{"meta":{"query_hash":"19ae3fcddb76","filters":{"topic":"Advanced Graph Theory Research"},"cohort_total":2515,"direct_labels_cover":3,"predictions_cover":2515,"exported":2515,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/19ae3fcddb76","api":"https://metacan.xera.ac/api/v1/cohort?topic=Advanced+Graph+Theory+Research"},"results":[{"id":"W100654495","doi":"","title":"List coloring Halin graphs","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018983832342762137,"score_gpt":0.28440059796351363,"score_spread":0.2654167656207515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100654495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26815376,0.0011690498,0.4030729,0.00948532,0.0008856678,0.00032155463,0.002482599,0.006674673,0.30775446],"genre_scores_gemma":[0.7427797,0.0007614982,0.098785914,0.0021829621,0.00035486266,0.00037658014,0.0027624741,0.0014070115,0.15058911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893826,0.00031778234,0.000045465527,0.00020705505,0.00025610178,0.00023523552],"domain_scores_gemma":[0.9949846,0.0027455902,0.00024450262,0.00087022316,0.00064302166,0.0005120537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084244605,0.0008976681,0.0008862409,0.0014658665,0.0032765856,0.0041263876,0.0018066991,0.0012833929,0.03129135],"category_scores_gemma":[0.0036890935,0.0007427899,0.00070935366,0.0018215306,0.0015858043,0.0046198755,0.0029288854,0.003581626,0.004870044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044505,0.00015487183,0.0007363016,0.00021241777,0.000028377306,0.00015475151,0.00059409335,0.0048025534,0.00456364,0.91040045,0.038585756,0.039321765],"study_design_scores_gemma":[0.00006682929,0.000041300653,0.00026240892,0.000030838855,0.000031654865,0.00013995821,0.00025669127,0.020049946,0.0049690627,0.95413476,0.019994413,0.000022133185],"about_ca_topic_score_codex":0.001579694,"about_ca_topic_score_gemma":0.0037528742,"teacher_disagreement_score":0.03129135,"about_ca_system_score_codex":0.00236982,"about_ca_system_score_gemma":0.001137104,"threshold_uncertainty_score":0.10467994},"labels":[],"label_agreement":null},{"id":"W1007141672","doi":"10.1007/978-3-319-06089-7_17","title":"Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Set (abstract data type); Tree (set theory); Computer science; Cover (algebra); Set packing; Regular polygon; Algorithm; Combinatorics; Mathematics; Geometry; Programming language","score_opus":0.03398452180586774,"score_gpt":0.29139792932001957,"score_spread":0.2574134075141518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1007141672","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18228528,0.010708865,0.6905525,0.0020892937,0.0005785608,0.00017854007,0.0010122838,0.0004371171,0.11215751],"genre_scores_gemma":[0.7802228,0.006610836,0.15677783,0.00032941584,0.0007954726,0.00036506852,0.0013993692,0.0003206787,0.053178586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990916,0.00016310878,0.000055221706,0.00015689594,0.00041391444,0.000119222364],"domain_scores_gemma":[0.9983039,0.0010950578,0.0001205179,0.00021574466,0.00013417844,0.0001306399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006194536,0.0010615436,0.0016660977,0.0016349964,0.0017291124,0.004161639,0.0021022242,0.0018733026,0.007884674],"category_scores_gemma":[0.004402286,0.00078332686,0.0012091295,0.0043801526,0.0023835918,0.005439167,0.0027482111,0.003446759,0.0007654334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006412419,0.000047003294,0.00037093926,0.00020898471,0.000028719223,0.00013067918,0.00030862194,0.04596391,0.001250171,0.90498644,0.006263625,0.040376805],"study_design_scores_gemma":[0.000009277278,0.000034052293,0.0003172345,0.000031692318,0.000012848107,0.00020300469,0.00008154182,0.12241526,0.00040015017,0.8722104,0.0042667645,0.000017810717],"about_ca_topic_score_codex":0.002398235,"about_ca_topic_score_gemma":0.0022488162,"teacher_disagreement_score":0.007884674,"about_ca_system_score_codex":0.0023170963,"about_ca_system_score_gemma":0.0008551128,"threshold_uncertainty_score":0.026376903},"labels":[],"label_agreement":null},{"id":"W101650661","doi":"","title":"A note on the total domination vertex critical graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.020847416150095426,"score_gpt":0.2936126408208226,"score_spread":0.27276522467072717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101650661","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085358605,0.025482673,0.18340153,0.019481072,0.01197286,0.00014376163,0.0010182571,0.0007209522,0.6724204],"genre_scores_gemma":[0.79541945,0.021144992,0.06391316,0.0065985923,0.0067900093,0.00015874159,0.0007354276,0.0005973473,0.10464234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976784,0.0000542108,0.0000075567064,0.000049051985,0.000083816754,0.000037647893],"domain_scores_gemma":[0.9984553,0.0009080115,0.00008261025,0.00017246854,0.00022104172,0.00016061983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044664033,0.00047794153,0.00037914322,0.0020242108,0.0013379483,0.0012416176,0.00096484815,0.00058719784,0.0098484745],"category_scores_gemma":[0.003223517,0.0002243188,0.00041560052,0.0014992066,0.0016166737,0.0023211662,0.0013075406,0.0019805094,0.0011049886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002920046,0.000012062562,0.00032508947,0.00014163574,0.000016557275,0.00029738236,0.00014736228,0.0017605809,0.0013899537,0.9316237,0.04141278,0.022843609],"study_design_scores_gemma":[0.000006984964,0.0000122850215,0.0003486743,0.000041270778,0.000014703176,0.00032459333,0.0000758797,0.0024001074,0.0006359889,0.9414033,0.054725595,0.000010553501],"about_ca_topic_score_codex":0.0016094821,"about_ca_topic_score_gemma":0.0030536375,"teacher_disagreement_score":0.0098484745,"about_ca_system_score_codex":0.00077463983,"about_ca_system_score_gemma":0.0004656867,"threshold_uncertainty_score":0.032946408},"labels":[],"label_agreement":null},{"id":"W102350756","doi":"","title":"Binomial Identities Generated by Counting Spanning Trees.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Binomial (polynomial); Combinatorics; Statistics","score_opus":0.015787305228591796,"score_gpt":0.27779793510411105,"score_spread":0.26201062987551926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102350756","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30789167,0.0017367052,0.3223695,0.0027662471,0.0017510976,0.00013566599,0.0009619266,0.0006464922,0.36174068],"genre_scores_gemma":[0.8840978,0.0011082545,0.051629193,0.0007809158,0.0012069975,0.00018093942,0.00089428964,0.000324826,0.059776776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871445,0.00037921654,0.00006493949,0.00016893008,0.000442926,0.00022964217],"domain_scores_gemma":[0.9967931,0.0016629273,0.00037180653,0.00027753014,0.00051467255,0.00037999154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012165924,0.0004613342,0.0008040372,0.0026314787,0.0018212852,0.002581981,0.0010591368,0.0009792504,0.012380332],"category_scores_gemma":[0.008215332,0.0004484904,0.00069314754,0.001750291,0.0015278261,0.003788915,0.0022618251,0.00194643,0.0030060946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022641596,0.000016726357,0.00026687593,0.000029638379,0.0000049770865,0.00012989735,0.00013119711,0.00034021505,0.0006700634,0.9881054,0.0034033873,0.0068788873],"study_design_scores_gemma":[0.000013419257,0.000008801671,0.00032281032,0.000026399312,0.000013404727,0.00045146933,0.00006413672,0.008180111,0.000774285,0.98395663,0.006176259,0.0000122390375],"about_ca_topic_score_codex":0.0005400983,"about_ca_topic_score_gemma":0.00094464794,"teacher_disagreement_score":0.012380332,"about_ca_system_score_codex":0.0009081803,"about_ca_system_score_gemma":0.00057749584,"threshold_uncertainty_score":0.041416347},"labels":[],"label_agreement":null},{"id":"W102410762","doi":"","title":"Long Paths and Cycles Through Specified Vertices in k-Connected Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Graph","score_opus":0.024117532862543152,"score_gpt":0.2860400059407764,"score_spread":0.26192247307823324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102410762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6111865,0.0043696873,0.29534355,0.0021583107,0.0003398689,0.00020951488,0.001975355,0.0010133083,0.08340383],"genre_scores_gemma":[0.90541166,0.0022626093,0.060154036,0.00034834773,0.00013499614,0.0002488608,0.0013875153,0.00027624198,0.029775836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938846,0.00018113885,0.0000548312,0.00015328154,0.000105713385,0.00011658988],"domain_scores_gemma":[0.9955048,0.0024096936,0.0009630169,0.00041881943,0.00032151345,0.0003821746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046601106,0.00049178395,0.0003923104,0.0019211695,0.0017168868,0.0024038956,0.00093590864,0.0015707703,0.008180076],"category_scores_gemma":[0.0059678284,0.00062584964,0.0005299834,0.0021446296,0.0020702523,0.00514165,0.002029622,0.0011588886,0.0014928678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021506335,0.00003886256,0.0017461082,0.00030109566,0.0000306606,0.00066789845,0.00086197554,0.0076711257,0.0030358513,0.94746596,0.003937361,0.034028098],"study_design_scores_gemma":[0.000019559622,0.000028118484,0.00056832517,0.000086263164,0.000026082442,0.0004598296,0.0003639328,0.009102816,0.0017943194,0.97705746,0.010469577,0.00002365471],"about_ca_topic_score_codex":0.001168316,"about_ca_topic_score_gemma":0.0027477082,"teacher_disagreement_score":0.008180076,"about_ca_system_score_codex":0.0010108603,"about_ca_system_score_gemma":0.00056651543,"threshold_uncertainty_score":0.027365088},"labels":[],"label_agreement":null},{"id":"W103588595","doi":"","title":"Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02281584283864667,"score_gpt":0.2748316275715963,"score_spread":0.2520157847329496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W103588595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9293687,0.0022340566,0.04310315,0.0017988783,0.0001332407,0.00011811207,0.0056029228,0.00051963265,0.017121231],"genre_scores_gemma":[0.9547111,0.0013911026,0.03242988,0.0002953037,0.000121004035,0.00019266333,0.004640831,0.0002940666,0.0059241713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992673,0.00018140954,0.00008245664,0.00021286045,0.00009394598,0.00016204786],"domain_scores_gemma":[0.99130744,0.004687497,0.0014991185,0.00072529877,0.0006714103,0.0011091696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007438308,0.0007078747,0.0008020194,0.0013647713,0.0013135818,0.0022926736,0.0013230087,0.0016406548,0.0039142417],"category_scores_gemma":[0.0091705015,0.0007285512,0.00050441886,0.0012114974,0.00096403586,0.0031124908,0.0015237463,0.0009626114,0.0010453006],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010039216,0.0006604282,0.064108945,0.004920964,0.0006874908,0.0025398042,0.004616654,0.09827479,0.12193495,0.4172278,0.052636176,0.22235282],"study_design_scores_gemma":[0.000576157,0.0008532949,0.018705808,0.00060898456,0.0004629035,0.0036539652,0.0023437554,0.13014323,0.05832276,0.74555683,0.03860539,0.00016695244],"about_ca_topic_score_codex":0.0006708899,"about_ca_topic_score_gemma":0.001447271,"teacher_disagreement_score":0.0039142417,"about_ca_system_score_codex":0.0009498676,"about_ca_system_score_gemma":0.00060505676,"threshold_uncertainty_score":0.013094425},"labels":[],"label_agreement":null},{"id":"W104414370","doi":"","title":"Stability Number and Fractional F-factors in Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stability (learning theory); Combinatorics; Computer science; Machine learning","score_opus":0.016190147693617225,"score_gpt":0.2772819295661864,"score_spread":0.2610917818725692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104414370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.669935,0.003149155,0.12329006,0.00353573,0.00061602006,0.000060400984,0.0005804066,0.00042188924,0.19841127],"genre_scores_gemma":[0.9776145,0.00063551846,0.0076189744,0.00013227752,0.0002831771,0.00003131743,0.00013498451,0.000048420345,0.0135008665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996474,0.00006966573,0.000013821474,0.00009546181,0.00008882435,0.000084933024],"domain_scores_gemma":[0.99835193,0.00081873033,0.000212066,0.00012717512,0.00022133606,0.00026879334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053504563,0.00039680058,0.00041987238,0.0027111357,0.0019288228,0.002142606,0.00054083654,0.000875408,0.009007518],"category_scores_gemma":[0.0039893026,0.00023449147,0.0003945442,0.001182656,0.0023593768,0.0032406638,0.00078895653,0.0010327057,0.00094455294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009237322,0.000016424872,0.0007683724,0.00004054161,0.000008422899,0.00006180644,0.00019326275,0.0014648199,0.0017083916,0.98075414,0.0025999295,0.0122915255],"study_design_scores_gemma":[0.000011343176,0.000018742621,0.0005289305,0.000016787242,0.000008305495,0.00013193063,0.00011929367,0.0050432654,0.0013410241,0.9881593,0.0046087573,0.000012368073],"about_ca_topic_score_codex":0.0015747561,"about_ca_topic_score_gemma":0.0016051955,"teacher_disagreement_score":0.009007518,"about_ca_system_score_codex":0.0011987215,"about_ca_system_score_gemma":0.00041854143,"threshold_uncertainty_score":0.030133128},"labels":[],"label_agreement":null},{"id":"W105843398","doi":"","title":"A Note of k-Rotation Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rotation (mathematics); Combinatorics; Pure mathematics; Geometry","score_opus":0.01264707814507132,"score_gpt":0.2822236817423465,"score_spread":0.2695766035972752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105843398","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035138115,0.035227142,0.10386139,0.02517078,0.02256744,0.00009003911,0.0007470384,0.0010240059,0.776174],"genre_scores_gemma":[0.63682306,0.048888963,0.10310424,0.011263589,0.014457371,0.00013253809,0.0010472758,0.0010643415,0.18321857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996679,0.00010415151,0.000012954136,0.00008593324,0.00006935493,0.000059677455],"domain_scores_gemma":[0.99898666,0.00047488682,0.00007285053,0.00021732003,0.00012868285,0.00011950637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043687064,0.0006305742,0.000533482,0.0012693355,0.002339035,0.0015499399,0.0010623888,0.00082181056,0.014661161],"category_scores_gemma":[0.0023306978,0.00037599393,0.0005913884,0.0018176525,0.0026119517,0.003864219,0.001991991,0.0027765566,0.004253672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005202054,0.000015923044,0.0002258482,0.00016802046,0.000014251833,0.0004446534,0.00019870038,0.0010805697,0.0010292344,0.8857808,0.07258566,0.038404293],"study_design_scores_gemma":[0.000008325822,0.000021952026,0.00045514712,0.00004495166,0.000012721116,0.00059460395,0.00015150006,0.0010681895,0.000540432,0.8034668,0.19361544,0.000019914902],"about_ca_topic_score_codex":0.0024592937,"about_ca_topic_score_gemma":0.004022627,"teacher_disagreement_score":0.014661161,"about_ca_system_score_codex":0.0008322206,"about_ca_system_score_gemma":0.0005236916,"threshold_uncertainty_score":0.049046457},"labels":[],"label_agreement":null},{"id":"W1061820890","doi":"10.1007/s10878-015-9936-0","title":"Lower bounds for positive semidefinite zero forcing and their applications","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex cover; Positive-definite matrix; Theory of computation; Vertex (graph theory); Zero (linguistics); Discrete mathematics; Graph; Forcing (mathematics); Semidefinite programming; Upper and lower bounds; Algorithm; Mathematical optimization","score_opus":0.019747254604522393,"score_gpt":0.28322497922973683,"score_spread":0.26347772462521446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1061820890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0216593,0.0059082634,0.8532277,0.0054826057,0.0013973813,0.0002839157,0.0011184105,0.0011467042,0.10977571],"genre_scores_gemma":[0.49563572,0.0132158855,0.41444007,0.004952924,0.0055200765,0.0021649145,0.0023229043,0.0025764208,0.059171125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99414116,0.0020287836,0.00025497767,0.00087590766,0.0018608315,0.0008382415],"domain_scores_gemma":[0.9250284,0.060512133,0.002669669,0.0044701635,0.00448168,0.002837918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011910784,0.0064501916,0.0039705723,0.007991211,0.0030343828,0.008078653,0.008029032,0.0046047964,0.030757802],"category_scores_gemma":[0.06133685,0.0026164104,0.0033468157,0.008062765,0.010130148,0.014327889,0.012331715,0.013030207,0.0063029877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026910432,0.00023738907,0.00043476673,0.0007067771,0.000082082195,0.0001444325,0.00032580728,0.04592532,0.0020817898,0.89766026,0.017611936,0.03452035],"study_design_scores_gemma":[0.000034805067,0.00007235952,0.0001839056,0.00028016727,0.000057325775,0.00014481756,0.00008917111,0.12809244,0.0009939255,0.8644246,0.005551453,0.000075106575],"about_ca_topic_score_codex":0.0011433456,"about_ca_topic_score_gemma":0.0022194942,"teacher_disagreement_score":0.030757802,"about_ca_system_score_codex":0.0045580515,"about_ca_system_score_gemma":0.003117857,"threshold_uncertainty_score":0.10289514},"labels":[],"label_agreement":null},{"id":"W106656638","doi":"","title":"3-flow Conjecture and Matchings in Bipartite Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Conjecture; Combinatorics; Strong perfect graph theorem; Flow (mathematics); Chordal graph; 1-planar graph; Graph; Geometry","score_opus":0.00948066044355914,"score_gpt":0.2595878085495363,"score_spread":0.2501071481059771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W106656638","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2842198,0.00698632,0.2712693,0.062097706,0.0032925121,0.00030112316,0.0038000213,0.0016998012,0.36633345],"genre_scores_gemma":[0.89167434,0.0044508753,0.046312265,0.00746501,0.0031847213,0.0003631465,0.0038022997,0.0004098403,0.04233752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779403,0.00072431966,0.000110378955,0.00047884378,0.00047509014,0.00041735315],"domain_scores_gemma":[0.9879538,0.007989678,0.000975091,0.0015112762,0.00077362073,0.000796572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003135581,0.00088347634,0.0015007171,0.0024305265,0.0038071736,0.0046211323,0.0025668056,0.005145547,0.026242359],"category_scores_gemma":[0.01890561,0.0010382803,0.0018894459,0.0033965993,0.0054595335,0.019497205,0.0041539,0.005881205,0.0033725407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011919163,0.00006990035,0.00070315116,0.00015066686,0.00001816794,0.00010862534,0.00027156167,0.0015817237,0.00027503172,0.97023726,0.015899092,0.010565777],"study_design_scores_gemma":[0.000020639214,0.000007155081,0.0001566243,0.000029968023,0.000007958916,0.00006694916,0.00006846423,0.002386809,0.00013029788,0.99322623,0.0038920857,0.000006923979],"about_ca_topic_score_codex":0.002480688,"about_ca_topic_score_gemma":0.0019715785,"teacher_disagreement_score":0.026242359,"about_ca_system_score_codex":0.0020255868,"about_ca_system_score_gemma":0.0012474325,"threshold_uncertainty_score":0.08778942},"labels":[],"label_agreement":null},{"id":"W108252396","doi":"","title":"A Sufficient Condition for Oriented Graphs to be Hamiltonian.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Mathematical optimization","score_opus":0.016509603998387756,"score_gpt":0.292884276763912,"score_spread":0.27637467276552424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108252396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46353287,0.0019231021,0.25347614,0.015294475,0.00493163,0.00081141124,0.013943014,0.0035819723,0.24250543],"genre_scores_gemma":[0.92334694,0.0008382673,0.0473525,0.002564346,0.0011919772,0.0005783515,0.008082408,0.0005002717,0.015544914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998314,0.0002785331,0.00017917679,0.00050971936,0.0002808826,0.0004376616],"domain_scores_gemma":[0.9826446,0.008711565,0.0014988761,0.0015223421,0.0029307723,0.0026918245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011053744,0.0006995382,0.0011533811,0.0012546255,0.002596144,0.002185022,0.0012652256,0.003949312,0.030409764],"category_scores_gemma":[0.01495271,0.0011443528,0.0012938639,0.0008989353,0.0025049187,0.004680554,0.0021798634,0.0032963161,0.0077419607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011735425,0.000827733,0.006861709,0.0012928736,0.00020026641,0.004455008,0.001402245,0.005280755,0.060833856,0.8309237,0.06326838,0.02348004],"study_design_scores_gemma":[0.0006073407,0.0004255238,0.007290303,0.0003804235,0.00018008398,0.004195332,0.0021169244,0.015708799,0.02407889,0.8865225,0.058287125,0.00020680486],"about_ca_topic_score_codex":0.0009677339,"about_ca_topic_score_gemma":0.0018582137,"teacher_disagreement_score":0.030409764,"about_ca_system_score_codex":0.0005779036,"about_ca_system_score_gemma":0.0016115168,"threshold_uncertainty_score":0.101730764},"labels":[],"label_agreement":null},{"id":"W109839048","doi":"","title":"P/d-Graphs of Tournaments.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016228202504722577,"score_gpt":0.2944694120789967,"score_spread":0.2782412095742741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109839048","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26208097,0.0018319016,0.22492638,0.0033451265,0.0007866144,0.00029493918,0.005540988,0.00168661,0.49950647],"genre_scores_gemma":[0.89413714,0.00095178426,0.043077618,0.0009599924,0.00025971918,0.00018964981,0.0035975606,0.00027511167,0.05655134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928063,0.00015880009,0.00004444411,0.00022298418,0.0001411405,0.00015202923],"domain_scores_gemma":[0.9982692,0.0005302725,0.00031529804,0.00027350732,0.00023575196,0.00037602705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003944265,0.00071362534,0.0005455587,0.0016670077,0.0021103765,0.0038742628,0.0011626701,0.0011088306,0.019465866],"category_scores_gemma":[0.0023523308,0.0006223417,0.00080456486,0.0018273636,0.0016404049,0.0028873933,0.0020628672,0.0019729233,0.0023713987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012952124,0.000049426322,0.000996826,0.00013322689,0.000034342076,0.00040401614,0.000147659,0.00134428,0.0018476774,0.96597886,0.012530497,0.016403653],"study_design_scores_gemma":[0.00005515489,0.000030581148,0.0012858401,0.00004159421,0.000037517184,0.0009603634,0.00019313177,0.0052305334,0.0018555428,0.96128494,0.029006273,0.000018462388],"about_ca_topic_score_codex":0.0017662285,"about_ca_topic_score_gemma":0.0022079214,"teacher_disagreement_score":0.019465866,"about_ca_system_score_codex":0.0012296553,"about_ca_system_score_gemma":0.00054219505,"threshold_uncertainty_score":0.0651198},"labels":[],"label_agreement":null},{"id":"W110549108","doi":"","title":"A note on choosability with separation for planar graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar graph; Planar; Combinatorics; Separation (statistics); Graph; Computer science; Statistics; Computer graphics (images)","score_opus":0.01996082089592175,"score_gpt":0.314720412405843,"score_spread":0.2947595915099212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110549108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03963547,0.0115643805,0.6096071,0.011257352,0.0032380354,0.00021464612,0.0008006735,0.0010241986,0.32265812],"genre_scores_gemma":[0.56945807,0.023497155,0.30112508,0.0055323583,0.005345916,0.0004580137,0.0019653619,0.0012286704,0.091389425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873894,0.00023256098,0.000064916945,0.00029136904,0.00045849147,0.00021372626],"domain_scores_gemma":[0.99687696,0.0021819116,0.00012873604,0.00046861704,0.0001435297,0.00020025927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010623023,0.0009980168,0.0010911132,0.0011954597,0.0015407937,0.00244944,0.0021269822,0.00158146,0.01633422],"category_scores_gemma":[0.005034618,0.00080325536,0.0018187342,0.0022871634,0.0033603597,0.007685909,0.0044995504,0.006749483,0.0031572056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001970704,0.00008750051,0.0005372687,0.00052926457,0.00006710062,0.00040683814,0.00022292316,0.0053102854,0.005766204,0.88081574,0.02617008,0.07988973],"study_design_scores_gemma":[0.00003140599,0.000056276836,0.00044714095,0.00006228042,0.00004519927,0.00043424877,0.000083043145,0.0065116915,0.0026376967,0.9552987,0.034364678,0.000027727268],"about_ca_topic_score_codex":0.0016919256,"about_ca_topic_score_gemma":0.0022383726,"teacher_disagreement_score":0.01633422,"about_ca_system_score_codex":0.001267557,"about_ca_system_score_gemma":0.0008214422,"threshold_uncertainty_score":0.054643333},"labels":[],"label_agreement":null},{"id":"W111065268","doi":"","title":"Mutually Eccentric Vertices in Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Eccentric; Structural engineering","score_opus":0.014587191091620417,"score_gpt":0.27014149887450295,"score_spread":0.2555543077828825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111065268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37770602,0.0039763567,0.28296855,0.0025626873,0.00089456304,0.00012150488,0.00077694666,0.0009485173,0.3300449],"genre_scores_gemma":[0.8810037,0.0016791684,0.06709379,0.0004209748,0.00030437272,0.000074171665,0.00050786807,0.00021102335,0.048705004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906284,0.00030624686,0.000055608438,0.00020012022,0.0002274488,0.00014775949],"domain_scores_gemma":[0.9976845,0.001064299,0.00037773236,0.00037845894,0.0002871784,0.0002078068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005537001,0.00048669294,0.0005166538,0.0018607766,0.002011125,0.0022001383,0.0007231885,0.0014845437,0.011490068],"category_scores_gemma":[0.0049389834,0.0004995708,0.00031206195,0.0017480546,0.0018313663,0.0035242238,0.0029694608,0.0013148799,0.003184036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001068999,0.000021370255,0.0012638825,0.00014664419,0.000018830824,0.00049249653,0.00045597245,0.001463612,0.0029232556,0.9556483,0.004525313,0.032933485],"study_design_scores_gemma":[0.000016923168,0.000025450929,0.00066120096,0.00008753543,0.000034370467,0.0011985146,0.00044573197,0.0045124036,0.0031757539,0.96458024,0.025245195,0.000016745145],"about_ca_topic_score_codex":0.00038918588,"about_ca_topic_score_gemma":0.000978618,"teacher_disagreement_score":0.011490068,"about_ca_system_score_codex":0.00060342235,"about_ca_system_score_gemma":0.00035865267,"threshold_uncertainty_score":0.03843814},"labels":[],"label_agreement":null},{"id":"W113325530","doi":"10.1007/3-540-45995-2_22","title":"On the Power of BFS to Determine a Graphs Diameter","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lexicographical order; Upper and lower bounds; Combinatorics; Computer science; Graph; Constant (computer programming); Expressive power; Discrete mathematics; Algorithm; Mathematics; Theoretical computer science; Programming language","score_opus":0.027953404545050294,"score_gpt":0.271347188716214,"score_spread":0.2433937841711637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113325530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119089365,0.0034376113,0.8157728,0.0035898553,0.00043097898,0.00012372556,0.00096975086,0.0024035692,0.054182347],"genre_scores_gemma":[0.5598668,0.0021862516,0.4197095,0.0009183652,0.0011633851,0.00022895381,0.0014435091,0.0012248658,0.013258441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966384,0.0012051086,0.000144151,0.0006572536,0.0010216598,0.00033340038],"domain_scores_gemma":[0.96869993,0.025748339,0.00062857947,0.0025334326,0.0016355744,0.00075417163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004004416,0.0014986669,0.0023582648,0.0044483333,0.0018654605,0.0033648082,0.0033571145,0.0021612945,0.008291951],"category_scores_gemma":[0.030759273,0.0011548799,0.001511086,0.0041632187,0.0037924969,0.010834043,0.003257129,0.004482602,0.002759198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012073584,0.00030346357,0.009542647,0.00067644625,0.0001451619,0.0003063208,0.0010930332,0.0980484,0.01072344,0.5280531,0.030649753,0.31925085],"study_design_scores_gemma":[0.00006237261,0.00008183024,0.0013099447,0.000096033604,0.00005970761,0.0002225567,0.00016142685,0.24151869,0.0037453473,0.745663,0.00703269,0.00004627736],"about_ca_topic_score_codex":0.005265311,"about_ca_topic_score_gemma":0.004841146,"teacher_disagreement_score":0.008291951,"about_ca_system_score_codex":0.0021666083,"about_ca_system_score_gemma":0.0012999158,"threshold_uncertainty_score":0.027739346},"labels":[],"label_agreement":null},{"id":"W113843839","doi":"","title":"A Note on Dominating Cycles in Tough Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016523351454351676,"score_gpt":0.2947455400191361,"score_spread":0.2782221885647844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113843839","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03547515,0.06254637,0.21783671,0.076199695,0.043341268,0.00020192962,0.0015491551,0.00088295474,0.5619668],"genre_scores_gemma":[0.4629981,0.087659985,0.17310612,0.03146357,0.043076884,0.00039062536,0.0015681472,0.0012900556,0.1984465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936384,0.00013867674,0.000032598175,0.0001499403,0.00021187117,0.00010313995],"domain_scores_gemma":[0.99529016,0.0033892973,0.00014054081,0.0003787241,0.00038932927,0.00041200072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009740508,0.0009278308,0.00096583634,0.0022170753,0.0028958004,0.002628292,0.0021181975,0.0018600391,0.014382924],"category_scores_gemma":[0.0062467624,0.00053566945,0.001011563,0.0028574646,0.0034703277,0.0072162654,0.0035055766,0.0054587647,0.002952297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074198324,0.000031879506,0.00046543335,0.00042949556,0.0000346851,0.0005844443,0.00036564333,0.0025399795,0.0015977209,0.8418926,0.11439369,0.03759023],"study_design_scores_gemma":[0.000009158454,0.000024887475,0.0004377527,0.00008382741,0.000021983025,0.00035935483,0.00017630645,0.0019016397,0.00042954768,0.88035244,0.11617833,0.000024810692],"about_ca_topic_score_codex":0.0026202768,"about_ca_topic_score_gemma":0.005226332,"teacher_disagreement_score":0.014382924,"about_ca_system_score_codex":0.0014713675,"about_ca_system_score_gemma":0.0006638988,"threshold_uncertainty_score":0.04811567},"labels":[],"label_agreement":null},{"id":"W115503190","doi":"","title":"Contractible Edges and Bowties in a k-Connected Graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Contractible space; Mathematics; Combinatorics; Graph","score_opus":0.021879418466877288,"score_gpt":0.2572238948136041,"score_spread":0.23534447634672678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115503190","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7255126,0.0012534608,0.13006724,0.0030931411,0.00038744937,0.0001014052,0.0008742842,0.00039894375,0.1383114],"genre_scores_gemma":[0.89602023,0.0011217402,0.046976335,0.0005190278,0.00023979356,0.00011396828,0.00083360256,0.00018919315,0.053986102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994941,0.000092734845,0.000030229357,0.00014202774,0.00011630601,0.00012457148],"domain_scores_gemma":[0.99751663,0.0010888625,0.00040632373,0.00025011183,0.00020991747,0.0005282541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043755354,0.00043102028,0.00055682875,0.0017327392,0.0024706975,0.0027299125,0.0010931742,0.0016900637,0.013987519],"category_scores_gemma":[0.0039635277,0.0005700744,0.000538694,0.0020959857,0.0031649754,0.0071963696,0.0033478688,0.0030205487,0.0016082128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009763252,0.000033312168,0.0006159447,0.00007985041,0.000011991442,0.00027298334,0.00053616805,0.0011606257,0.0019307304,0.97917867,0.0027824298,0.013299592],"study_design_scores_gemma":[0.000024417193,0.000021548467,0.0007619659,0.000050633374,0.000021060401,0.0003779363,0.00049934426,0.0040246556,0.00096942496,0.983108,0.010119391,0.000021616122],"about_ca_topic_score_codex":0.0015606855,"about_ca_topic_score_gemma":0.0022360852,"teacher_disagreement_score":0.013987519,"about_ca_system_score_codex":0.00079812395,"about_ca_system_score_gemma":0.00042117684,"threshold_uncertainty_score":0.046792865},"labels":[],"label_agreement":null},{"id":"W115874132","doi":"","title":"Vertex-Disjoint Short Cycles Containing Specified Edges in a Graph.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Disjoint sets; Graph","score_opus":0.02408683008824998,"score_gpt":0.2769357215780593,"score_spread":0.2528488914898093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115874132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5750106,0.0026095498,0.33694342,0.0011037601,0.00084755674,0.00058882195,0.0058127916,0.0014149129,0.07566861],"genre_scores_gemma":[0.78928727,0.0013087477,0.162403,0.0006088561,0.00015759126,0.00071186974,0.0058234166,0.00047827553,0.039221022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993191,0.00017697047,0.000086059554,0.00015776404,0.00014070993,0.00011955674],"domain_scores_gemma":[0.99696475,0.0010698489,0.0006318002,0.00049701595,0.0005014977,0.00033503145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004030433,0.0007032332,0.00057857734,0.0015418021,0.0019039841,0.0015041219,0.0012533261,0.0012819489,0.008704733],"category_scores_gemma":[0.0038990243,0.0005298965,0.0006044576,0.0021927496,0.00083154446,0.0028277887,0.0017358327,0.000834545,0.0017222426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011774084,0.00020244863,0.004054212,0.0007964578,0.00020494874,0.0026684701,0.0011565335,0.008761061,0.048857532,0.8272234,0.01478578,0.09011169],"study_design_scores_gemma":[0.000092222625,0.00028099326,0.0026854882,0.00031318647,0.00022638513,0.0020326474,0.0011365033,0.027351249,0.040166475,0.82000977,0.1056093,0.00009572741],"about_ca_topic_score_codex":0.0009940104,"about_ca_topic_score_gemma":0.0029736664,"teacher_disagreement_score":0.008704733,"about_ca_system_score_codex":0.00063009927,"about_ca_system_score_gemma":0.0008070013,"threshold_uncertainty_score":0.029120207},"labels":[],"label_agreement":null},{"id":"W116667574","doi":"","title":"Clique Graphs of Planar Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique-sum; Clique; Combinatorics; Chordal graph; Pathwidth; Indifference graph; Planar graph; 1-planar graph; Discrete mathematics; Graph; Line graph","score_opus":0.014745689355016434,"score_gpt":0.27422351416090585,"score_spread":0.25947782480588943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116667574","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2674714,0.0076141492,0.26300988,0.0070214802,0.0011239164,0.00030179895,0.0059246514,0.0016408032,0.445892],"genre_scores_gemma":[0.8587222,0.0044916905,0.055722352,0.00095054624,0.0009420156,0.00017452544,0.0051657027,0.00050613534,0.0733248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995652,0.00012294238,0.000013304497,0.00011164893,0.000104929684,0.00008189267],"domain_scores_gemma":[0.9980925,0.0010426166,0.00027413675,0.00024130385,0.00016365832,0.00018585498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029352336,0.0004900383,0.00049974985,0.0016388716,0.0014848285,0.002054204,0.0008984553,0.0010305238,0.018835561],"category_scores_gemma":[0.002854039,0.00052339985,0.0006038535,0.0019020992,0.0011227106,0.00349508,0.001147336,0.0016539838,0.00224415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008253228,0.00004752837,0.0008159188,0.00023189084,0.00003861502,0.00024626902,0.0002250976,0.003497009,0.0034213706,0.9354151,0.028981972,0.02699686],"study_design_scores_gemma":[0.000031945965,0.000021865724,0.0015435949,0.000053456075,0.000040807372,0.00047067716,0.00020218875,0.013199014,0.0017082022,0.9410726,0.04163709,0.000018498447],"about_ca_topic_score_codex":0.0023595754,"about_ca_topic_score_gemma":0.0043179854,"teacher_disagreement_score":0.018835561,"about_ca_system_score_codex":0.0008483435,"about_ca_system_score_gemma":0.00048313197,"threshold_uncertainty_score":0.06301129},"labels":[],"label_agreement":null},{"id":"W116901816","doi":"","title":"Independent Sums of Arithmetic Progressions in Km-free Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Discrete mathematics; Combinatorics","score_opus":0.015359571693553505,"score_gpt":0.2857425302751914,"score_spread":0.2703829585816379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116901816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5827581,0.0023547192,0.14154463,0.0021660298,0.00081839133,0.00013129886,0.00097599515,0.0009767801,0.26827404],"genre_scores_gemma":[0.92357194,0.00055622647,0.023363458,0.00036781267,0.00048079173,0.00012714829,0.0005608088,0.000226278,0.050745565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991673,0.00018924422,0.000056922465,0.00014546241,0.00025398386,0.0001870805],"domain_scores_gemma":[0.9975165,0.0013728538,0.00029272283,0.00022435344,0.0002555008,0.00033796814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069735025,0.0006320848,0.000739734,0.0026268647,0.00224379,0.0031376043,0.0013540805,0.00093523564,0.013199909],"category_scores_gemma":[0.004786571,0.0005823616,0.0007719594,0.0016937605,0.0020164798,0.0054870523,0.002850644,0.0022952612,0.0028299612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012268222,0.000056810815,0.00055737403,0.00013036237,0.000020114683,0.00028837682,0.00036408418,0.0016534248,0.0019991128,0.97376174,0.004536313,0.016509552],"study_design_scores_gemma":[0.000018327102,0.00001801336,0.00036204234,0.000030726675,0.000023679151,0.00030823663,0.00009832667,0.0041414886,0.0012814051,0.9890603,0.0046394924,0.000018048248],"about_ca_topic_score_codex":0.0005364259,"about_ca_topic_score_gemma":0.0011782696,"teacher_disagreement_score":0.013199909,"about_ca_system_score_codex":0.0008504713,"about_ca_system_score_gemma":0.00058577355,"threshold_uncertainty_score":0.04415804},"labels":[],"label_agreement":null},{"id":"W117787552","doi":"","title":"Some results in step domination of graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01554785319413933,"score_gpt":0.27828929668305524,"score_spread":0.2627414434889159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117787552","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15721135,0.01815489,0.22913161,0.01019194,0.0011980854,0.00018786873,0.001989839,0.00097506534,0.58095944],"genre_scores_gemma":[0.80818295,0.016126715,0.059471235,0.003448391,0.0022179992,0.00035284407,0.0028268716,0.0006586923,0.10671418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894553,0.00025530843,0.000056506815,0.000174685,0.0003674888,0.00020048238],"domain_scores_gemma":[0.9948376,0.0036400747,0.00023759539,0.00040868772,0.0004468325,0.00042928167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016762807,0.0008478319,0.00083098916,0.0031797271,0.0022739475,0.0027223353,0.0017810727,0.001402676,0.015495753],"category_scores_gemma":[0.005842556,0.0005558078,0.0014129989,0.004338487,0.0031129536,0.0063323234,0.0027072036,0.004529672,0.0025579336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007295155,0.0000788531,0.0010566852,0.0004003659,0.000051451036,0.00034579754,0.0006141558,0.0028365701,0.0011805502,0.95235926,0.015469936,0.025533382],"study_design_scores_gemma":[0.000020969888,0.000026552523,0.00076828356,0.000054583445,0.00004040591,0.00030663144,0.00016435386,0.004112612,0.0007513091,0.978725,0.015014265,0.000014940752],"about_ca_topic_score_codex":0.0021277454,"about_ca_topic_score_gemma":0.0025904533,"teacher_disagreement_score":0.015495753,"about_ca_system_score_codex":0.0016932421,"about_ca_system_score_gemma":0.00077040074,"threshold_uncertainty_score":0.051838458},"labels":[],"label_agreement":null},{"id":"W118134238","doi":"","title":"The Forcing Domination Numbers Of Some Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Forcing (mathematics); Mathematical analysis","score_opus":0.011385634558625768,"score_gpt":0.28273845909241435,"score_spread":0.27135282453378856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118134238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53455865,0.0013829506,0.08208351,0.004481517,0.0003704126,0.00009984154,0.0020192775,0.00050477637,0.37449896],"genre_scores_gemma":[0.9637728,0.0005605375,0.013717292,0.00031163817,0.00026591512,0.00014132682,0.0004887838,0.00010391193,0.020637676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912316,0.00020509218,0.00004582072,0.00016904646,0.00023786414,0.00021897862],"domain_scores_gemma":[0.992297,0.005533112,0.00052085886,0.0005068995,0.000510653,0.00063148345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001317429,0.000424428,0.0005066743,0.0028146089,0.0023964285,0.0032616805,0.000776945,0.00078548025,0.012140208],"category_scores_gemma":[0.0072868625,0.0003784623,0.0006563675,0.0015975123,0.003404275,0.004631655,0.0016326862,0.0022082184,0.0011712355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067442226,0.000014486564,0.0007140221,0.000044586497,0.000010281785,0.000056063906,0.00023126087,0.0010083191,0.0011137923,0.98810685,0.0025019979,0.00613091],"study_design_scores_gemma":[0.000021010968,0.000013112803,0.0011452432,0.000023638524,0.000014612214,0.0001680245,0.00012218239,0.003873678,0.001426181,0.9866535,0.006523128,0.000015691963],"about_ca_topic_score_codex":0.0010185995,"about_ca_topic_score_gemma":0.0016036798,"teacher_disagreement_score":0.012140208,"about_ca_system_score_codex":0.0018935809,"about_ca_system_score_gemma":0.000793007,"threshold_uncertainty_score":0.040613055},"labels":[],"label_agreement":null},{"id":"W119774723","doi":"10.1007/978-3-642-45043-3_8","title":"On the Parameterized Complexity of Computing Graph Bisections","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Disjoint sets; Vertex (graph theory); Combinatorics; Time complexity; Partition (number theory); Mathematics; Constant (computer programming); Graph partition; Feedback vertex set; Bisection method; Connected component; Graph; Vertex cover; Discrete mathematics; Computer science; Algorithm","score_opus":0.05961691458284554,"score_gpt":0.29979033801681515,"score_spread":0.2401734234339696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119774723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18075281,0.005889865,0.70966804,0.009740794,0.0010226154,0.00044022765,0.0034080083,0.0037336827,0.08534392],"genre_scores_gemma":[0.63138443,0.0053589595,0.31510386,0.0016210058,0.0019897413,0.0009668115,0.007393982,0.0034124032,0.032768816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939487,0.0014612374,0.0004149523,0.0013904902,0.0019881702,0.0007963559],"domain_scores_gemma":[0.96842235,0.023695707,0.0010425568,0.004783383,0.001236188,0.0008197791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028261112,0.0025279964,0.0028766694,0.0023667386,0.002473515,0.0102117285,0.006923442,0.0027868224,0.023837764],"category_scores_gemma":[0.028556364,0.0017806218,0.0036207098,0.0072152787,0.0044580936,0.028885856,0.0065459446,0.009962055,0.0034663295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001034182,0.00047388056,0.0029986412,0.0012635007,0.00024577073,0.00021730288,0.00093954516,0.115501605,0.0062684985,0.67068934,0.028697355,0.17167042],"study_design_scores_gemma":[0.000080803846,0.00005234711,0.00048376105,0.00007239971,0.00007609896,0.000117248,0.00013918805,0.108505964,0.001411944,0.8844734,0.004551077,0.000035927413],"about_ca_topic_score_codex":0.0049096155,"about_ca_topic_score_gemma":0.006309546,"teacher_disagreement_score":0.023837764,"about_ca_system_score_codex":0.0075465622,"about_ca_system_score_gemma":0.004054563,"threshold_uncertainty_score":0.07974529},"labels":[],"label_agreement":null},{"id":"W11995151","doi":"","title":"Improved bounds for the product of the domination and chromatic numbers of a graph.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Graph; Product (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.009365343003639942,"score_gpt":0.2594016022767104,"score_spread":0.25003625927307044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11995151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08525094,0.01981763,0.67483354,0.0073346044,0.001973125,0.00031589196,0.00475429,0.0033267583,0.20239323],"genre_scores_gemma":[0.66847986,0.007285534,0.27464503,0.0015014834,0.0030197396,0.00087074307,0.0039128414,0.0017262604,0.03855846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99310076,0.0015411992,0.00031171093,0.0014435822,0.0025765544,0.0010262126],"domain_scores_gemma":[0.9571693,0.031003999,0.0016802374,0.004986067,0.0032942095,0.001866109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069771106,0.0034608373,0.0019528163,0.007943351,0.002008882,0.0063447896,0.007483885,0.0027908126,0.025236987],"category_scores_gemma":[0.040118802,0.0015551939,0.0023174898,0.0051751425,0.004734432,0.018590003,0.008097548,0.009120241,0.0059816935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012688454,0.0003708856,0.0050456002,0.00095591147,0.00032427843,0.00038644712,0.00081476494,0.04732993,0.011819212,0.7631891,0.04412256,0.12437242],"study_design_scores_gemma":[0.00010589447,0.00019298753,0.003561255,0.0002771899,0.00031469172,0.0006608383,0.00019739123,0.1749654,0.007835254,0.78085876,0.030885523,0.00014491241],"about_ca_topic_score_codex":0.0031371673,"about_ca_topic_score_gemma":0.0064612674,"teacher_disagreement_score":0.025236987,"about_ca_system_score_codex":0.0054775807,"about_ca_system_score_gemma":0.0020258636,"threshold_uncertainty_score":0.084426165},"labels":[],"label_agreement":null},{"id":"W123065172","doi":"","title":"Restrained Domination Excellent Trees.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.024247903241052103,"score_gpt":0.2745094889075757,"score_spread":0.2502615856665236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123065172","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35268044,0.0026915402,0.199644,0.0026004624,0.00039990037,0.00008551975,0.001576539,0.0015135149,0.43880802],"genre_scores_gemma":[0.9071052,0.0006719078,0.02060829,0.00044823086,0.00016011836,0.000038232032,0.0006567808,0.00016685965,0.070144385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994962,0.00009842105,0.000019363368,0.00009533111,0.00016308071,0.00012753015],"domain_scores_gemma":[0.9981463,0.0008513887,0.0001379645,0.00038686054,0.00025419056,0.000223402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049539993,0.00023269348,0.00044262083,0.0007924621,0.0011435237,0.0011239311,0.0006974961,0.00046624435,0.008093167],"category_scores_gemma":[0.002402356,0.00024187144,0.00035697457,0.0008475719,0.0011105108,0.0021393816,0.0016300225,0.0014744406,0.0014446354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007187935,0.000029243993,0.0008408225,0.00007276272,0.000017612223,0.00024460632,0.0003741716,0.0017926687,0.0030066867,0.96207243,0.0094304215,0.022046655],"study_design_scores_gemma":[0.000020574635,0.00002096995,0.00083925173,0.000023265939,0.000024351286,0.0005745205,0.00012565256,0.0063899904,0.0021736193,0.9531961,0.03659768,0.00001394762],"about_ca_topic_score_codex":0.0013725844,"about_ca_topic_score_gemma":0.0028297715,"teacher_disagreement_score":0.008093167,"about_ca_system_score_codex":0.00078827754,"about_ca_system_score_gemma":0.00039560214,"threshold_uncertainty_score":0.027074397},"labels":[],"label_agreement":null},{"id":"W124402557","doi":"","title":"An Addressing Scheme On Complete Bipartite Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Scheme (mathematics); Combinatorics; Graph; Mathematical analysis","score_opus":0.07088800168607567,"score_gpt":0.3224054629053689,"score_spread":0.25151746121929325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124402557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111973,0.00069608487,0.7240379,0.002991736,0.0007871241,0.00056178804,0.0020930348,0.0045644618,0.15229481],"genre_scores_gemma":[0.5455053,0.0008604132,0.3524701,0.0012603764,0.00031052157,0.00073153706,0.0025634186,0.00072600896,0.09557239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856013,0.0003841809,0.00012042037,0.000285836,0.00037383608,0.0002755735],"domain_scores_gemma":[0.99665016,0.0009512972,0.00022656353,0.0014896288,0.0004017783,0.0002804907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427266,0.0006548978,0.0007679233,0.0010795147,0.0025145388,0.0031564897,0.0022912691,0.001955251,0.019195043],"category_scores_gemma":[0.005084049,0.00041434416,0.0007218775,0.0020833,0.0013480971,0.008082888,0.007077738,0.0020011922,0.0058617694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032931057,0.00012863903,0.00027980335,0.00017380943,0.000021133892,0.00007837881,0.00036568524,0.003322419,0.005579582,0.8715551,0.01946372,0.09870247],"study_design_scores_gemma":[0.00008740063,0.0001220983,0.00024231944,0.00008705125,0.000045631237,0.00019389401,0.00023224518,0.026761191,0.006182099,0.91080296,0.05519753,0.000045571658],"about_ca_topic_score_codex":0.0008651162,"about_ca_topic_score_gemma":0.0011582103,"teacher_disagreement_score":0.019195043,"about_ca_system_score_codex":0.0014389113,"about_ca_system_score_gemma":0.0016047071,"threshold_uncertainty_score":0.06421381},"labels":[],"label_agreement":null},{"id":"W124588306","doi":"","title":"Enumeration for spanning forests of complete bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Enumeration; Combinatorics; Complete bipartite graph; Spanning tree; Graph","score_opus":0.030775711098023847,"score_gpt":0.3004455467256993,"score_spread":0.26966983562767544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124588306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11142991,0.0023881502,0.792665,0.0026498532,0.00034234682,0.00024206324,0.00347056,0.001517965,0.08529418],"genre_scores_gemma":[0.56622535,0.0025792366,0.37490106,0.0010935912,0.00046774212,0.0004527299,0.009817483,0.00062125345,0.043841515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909997,0.00029205505,0.00006241513,0.0001681189,0.00022927493,0.00014825181],"domain_scores_gemma":[0.99737906,0.0016358822,0.00019484051,0.00035786364,0.00025968195,0.00017271661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008193147,0.00046417475,0.0006075945,0.0014678745,0.0011166789,0.0020231022,0.0010335477,0.0011898011,0.011025055],"category_scores_gemma":[0.0060890657,0.0005224292,0.00087099633,0.00215403,0.00069889845,0.004601196,0.0016174004,0.0018898697,0.002301969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016729505,0.0001988706,0.002104058,0.00058277056,0.0000643579,0.00027987728,0.0004897924,0.012554587,0.004617528,0.75663114,0.040029462,0.18228032],"study_design_scores_gemma":[0.00002050691,0.000019948862,0.0005184353,0.00008663498,0.000026587411,0.00040389167,0.00014224953,0.03843344,0.0011400674,0.94517845,0.014017352,0.000012383292],"about_ca_topic_score_codex":0.0009267896,"about_ca_topic_score_gemma":0.0025396033,"teacher_disagreement_score":0.011025055,"about_ca_system_score_codex":0.0007106616,"about_ca_system_score_gemma":0.00072554935,"threshold_uncertainty_score":0.03688246},"labels":[],"label_agreement":null},{"id":"W125447159","doi":"10.1007/978-3-319-07956-1_16","title":"New Lower Bounds on Broadcast Function","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Upper and lower bounds; Function (biology); Mathematics; Graph; Computer science; Discrete mathematics","score_opus":0.018034029748237645,"score_gpt":0.26643010582352544,"score_spread":0.2483960760752878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125447159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013484641,0.026823299,0.59062827,0.012246363,0.0043456843,0.00020631243,0.0018670058,0.0020661112,0.3483322],"genre_scores_gemma":[0.32685488,0.043671653,0.28448728,0.009350939,0.020005671,0.0027251753,0.005471956,0.007367572,0.30006486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993979,0.0011324438,0.000262379,0.0011396256,0.0023959766,0.0010905458],"domain_scores_gemma":[0.9777569,0.016491523,0.0006073531,0.0024684248,0.0018092289,0.0008664721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052783135,0.0055369423,0.0049232394,0.007857049,0.004017453,0.010508455,0.009406945,0.005149625,0.040936444],"category_scores_gemma":[0.02530142,0.0024773285,0.0040376172,0.009962934,0.005727251,0.023199206,0.0088760145,0.022589613,0.014720195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021921097,0.00014894528,0.00020569412,0.00052785524,0.000047449492,0.00006304479,0.0002464622,0.009653105,0.0015903907,0.87097883,0.0451255,0.07119351],"study_design_scores_gemma":[0.000034930374,0.000043748045,0.0002111036,0.00027804755,0.00010571122,0.0001610725,0.000082911036,0.037493177,0.0015856654,0.9201781,0.039769642,0.000055944034],"about_ca_topic_score_codex":0.0021651026,"about_ca_topic_score_gemma":0.0026893588,"teacher_disagreement_score":0.040936444,"about_ca_system_score_codex":0.010222959,"about_ca_system_score_gemma":0.0029044957,"threshold_uncertainty_score":0.13694602},"labels":[],"label_agreement":null},{"id":"W12746167","doi":"10.1080/08880010390203125","title":"Vertex-Disjoint K1, t's in Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.021898103047864267,"score_gpt":0.26131906849313136,"score_spread":0.2394209654452671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12746167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6156946,0.0077455323,0.2733652,0.0057208487,0.0011941402,0.0004901124,0.0061041126,0.0012485037,0.088436894],"genre_scores_gemma":[0.8960193,0.0033297832,0.06726746,0.00083013374,0.0002961634,0.00024070452,0.0042662234,0.00026054078,0.027489683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905974,0.0002553225,0.000082258885,0.00026806124,0.00016283673,0.0001717838],"domain_scores_gemma":[0.9959915,0.0019706653,0.0008922293,0.00037215935,0.00026442902,0.00050901563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008060472,0.00073990814,0.00081808126,0.0021500764,0.0023537793,0.0021206168,0.0010344185,0.0015179572,0.00773839],"category_scores_gemma":[0.0053034388,0.00050150446,0.00094426813,0.0023120267,0.001629094,0.0036321967,0.0018834162,0.001331644,0.0013540069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063930516,0.00017668698,0.0042381794,0.0010200841,0.00022159441,0.0022739805,0.0013333245,0.026897168,0.0065951273,0.8749829,0.022472417,0.059149273],"study_design_scores_gemma":[0.0000740349,0.00008043291,0.0017387124,0.00009018115,0.000074555035,0.0017057479,0.0003991799,0.023606956,0.0014094791,0.94667816,0.024116166,0.00002636769],"about_ca_topic_score_codex":0.0017994273,"about_ca_topic_score_gemma":0.0034041072,"teacher_disagreement_score":0.00773839,"about_ca_system_score_codex":0.0015253556,"about_ca_system_score_gemma":0.0007423363,"threshold_uncertainty_score":0.02588749},"labels":[],"label_agreement":null},{"id":"W12912828","doi":"10.1007/978-1-4471-4069-6_5","title":"Graphs and Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Tree traversal; Graph traversal; Floyd–Warshall algorithm; Dijkstra's algorithm; Computer science; Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Breadth-first search; Algorithm; Discrete mathematics; Shortest path problem; Theoretical computer science; Graph; Artificial intelligence","score_opus":0.03443815039716676,"score_gpt":0.28481126624538416,"score_spread":0.2503731158482174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12912828","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020350276,0.0675637,0.017938636,0.0060443003,0.0043643066,0.000046518584,0.00031333533,0.00034199137,0.9013523],"genre_scores_gemma":[0.033797964,0.059478994,0.010903407,0.0027644702,0.004555155,0.00011613551,0.0005991843,0.00051292364,0.88727176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978656,0.000053346655,0.0000067973665,0.00004488646,0.00008530928,0.00002312446],"domain_scores_gemma":[0.9997758,0.00009558202,0.000012055473,0.00004028218,0.000042174717,0.00003405184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018922961,0.00095025456,0.0006715523,0.0018599443,0.0012024496,0.002907798,0.000837348,0.0009150116,0.051235113],"category_scores_gemma":[0.0008246287,0.00042479145,0.00039439116,0.003609369,0.0017485805,0.0040730494,0.001171308,0.0022592635,0.018406622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007866926,0.000022009226,0.000074464566,0.00020046426,0.000007874478,0.000034845067,0.0004172519,0.0005741557,0.0003070552,0.6458856,0.25469518,0.09777312],"study_design_scores_gemma":[0.0000029831226,0.0000061518454,0.0001406948,0.000117581134,0.000004691884,0.00006762602,0.00012494241,0.00029374883,0.00008021404,0.3144019,0.6847547,0.0000047012363],"about_ca_topic_score_codex":0.0017905139,"about_ca_topic_score_gemma":0.004087274,"teacher_disagreement_score":0.051235113,"about_ca_system_score_codex":0.0015356226,"about_ca_system_score_gemma":0.00081518426,"threshold_uncertainty_score":0.17139852},"labels":[],"label_agreement":null},{"id":"W13215918","doi":"","title":"Spanning Eulerian Subgraphs in claw-free graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eulerian path; Claw; Combinatorics; Pure mathematics; Biology","score_opus":0.01387111740336125,"score_gpt":0.2660256259596989,"score_spread":0.2521545085563377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13215918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.835651,0.0010598738,0.12262135,0.00063739426,0.000040546547,0.00008790178,0.000561065,0.0004316934,0.03890916],"genre_scores_gemma":[0.97431266,0.00049080147,0.01924131,0.00014229325,0.000037246682,0.000052438052,0.00070940086,0.000054629796,0.0049590776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975055,0.00003920399,0.000015417734,0.00006734666,0.00007109922,0.0000563141],"domain_scores_gemma":[0.99922895,0.00034353635,0.00016299669,0.00006674745,0.000086281136,0.000111518704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016291013,0.00030005426,0.00017377993,0.0012287608,0.00058324065,0.0007249197,0.00038011058,0.00038963134,0.0030692474],"category_scores_gemma":[0.001173815,0.00029718736,0.00022946908,0.0011501164,0.0009889473,0.0016793631,0.0010144472,0.000646255,0.00028627296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014368891,0.00009856823,0.005849707,0.00027943956,0.000029352743,0.0011224038,0.0017617923,0.023782723,0.030216666,0.8757449,0.004624889,0.056345962],"study_design_scores_gemma":[0.000028843577,0.00006354443,0.0038865057,0.00005758791,0.000031476764,0.0011796748,0.0004938024,0.03419547,0.011244798,0.9330236,0.015766649,0.0000281032],"about_ca_topic_score_codex":0.001397309,"about_ca_topic_score_gemma":0.001988301,"teacher_disagreement_score":0.0030692474,"about_ca_system_score_codex":0.0007381253,"about_ca_system_score_gemma":0.00025982922,"threshold_uncertainty_score":0.010267675},"labels":[],"label_agreement":null},{"id":"W132229103","doi":"","title":"On The Hamiltonian Decomposition of Special Product of Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition; Hamiltonian (control theory); Pure mathematics; Product (mathematics); Combinatorics; Geometry; Mathematical optimization; Chemistry","score_opus":0.014578783458912632,"score_gpt":0.27608336610827916,"score_spread":0.26150458264936655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132229103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36105633,0.0050278446,0.36443585,0.0028868667,0.0013689568,0.00011167336,0.00076036365,0.00044765425,0.26390445],"genre_scores_gemma":[0.8619061,0.0022414988,0.07072551,0.00095787377,0.0008599027,0.00010111134,0.0011169928,0.0004202387,0.06167087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996382,0.00012757952,0.000015284662,0.000063562795,0.00007482545,0.00008056344],"domain_scores_gemma":[0.999193,0.00027871458,0.00010566853,0.00011996719,0.000103374885,0.00019926336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050180714,0.0005074106,0.00051320577,0.0013956232,0.0011613232,0.0014471896,0.0007796112,0.0008348369,0.011117881],"category_scores_gemma":[0.001717419,0.0004608112,0.00067763095,0.00088706723,0.0018454636,0.0037732872,0.0018065573,0.0016655893,0.0017851382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031487736,0.00002213268,0.00021006995,0.000049690418,0.000010526752,0.000100517835,0.00023514022,0.00097604253,0.0007870839,0.98127675,0.005850397,0.010450237],"study_design_scores_gemma":[0.000006643804,0.000010450397,0.00019039285,0.000015332094,0.0000065921017,0.00010299713,0.00008715664,0.003948583,0.00020940119,0.99102414,0.0043935007,0.000004912223],"about_ca_topic_score_codex":0.0008223754,"about_ca_topic_score_gemma":0.0015728222,"teacher_disagreement_score":0.011117881,"about_ca_system_score_codex":0.00061115937,"about_ca_system_score_gemma":0.00028032745,"threshold_uncertainty_score":0.037193},"labels":[],"label_agreement":null},{"id":"W133616081","doi":"","title":"Maximum genus, Girth and Maximum non-adjacent edge set.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Girth (graph theory); Enhanced Data Rates for GSM Evolution; Combinatorics; Set (abstract data type); Biology; Zoology; Computer science; Artificial intelligence","score_opus":0.012424787092114708,"score_gpt":0.2552469536248937,"score_spread":0.242822166532779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133616081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6891091,0.00731185,0.12495866,0.005503532,0.00059497805,0.00009407602,0.0027069952,0.00088447606,0.16883643],"genre_scores_gemma":[0.9655655,0.0025829214,0.022075817,0.00027349664,0.0004989983,0.00008287313,0.0006834814,0.00016182564,0.008075171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922,0.00019225836,0.000038876628,0.00019520556,0.00018690132,0.00016673998],"domain_scores_gemma":[0.99411917,0.0035902257,0.00086809584,0.0005422312,0.00027810966,0.00060216116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082749274,0.00074788724,0.0010156778,0.003110754,0.0016474851,0.0026911125,0.0015710815,0.0014518428,0.0071069393],"category_scores_gemma":[0.008390505,0.00068729254,0.00063438655,0.0027875619,0.0038000057,0.0051196082,0.002590086,0.0020921174,0.001102188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003980997,0.000090826994,0.0064650727,0.0003135724,0.00007977119,0.00051053223,0.0007056496,0.010826934,0.006044445,0.9050519,0.015899558,0.05361375],"study_design_scores_gemma":[0.000022017399,0.00003539718,0.0025718915,0.000063002655,0.000053630632,0.0008658645,0.0002585803,0.008170929,0.0013367257,0.98049104,0.006110837,0.000020032641],"about_ca_topic_score_codex":0.0005138899,"about_ca_topic_score_gemma":0.0006966654,"teacher_disagreement_score":0.0071069393,"about_ca_system_score_codex":0.0010047355,"about_ca_system_score_gemma":0.00048189057,"threshold_uncertainty_score":0.023775041},"labels":[],"label_agreement":null},{"id":"W133646803","doi":"","title":"Special Kinds of Domination Parameters of Edge-Deleted Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.018127951429485374,"score_gpt":0.2739325109925119,"score_spread":0.25580455956302656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133646803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4605972,0.0018736509,0.20644219,0.0020760144,0.0005444825,0.00020980934,0.0023766612,0.0024661464,0.3234139],"genre_scores_gemma":[0.9694196,0.00045057645,0.01213715,0.00034963212,0.00016727812,0.000120079596,0.00082997355,0.00045334882,0.016072504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982395,0.00037312598,0.00012884095,0.00044913724,0.0004406665,0.0003687128],"domain_scores_gemma":[0.99168724,0.003998148,0.0008250255,0.0022248884,0.00058155984,0.0006831041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001343767,0.0005663764,0.0006641488,0.0022795256,0.0018965013,0.005787019,0.0022985777,0.0023063251,0.014468371],"category_scores_gemma":[0.012909604,0.0007301512,0.000728293,0.0020176903,0.0030110104,0.011100218,0.0031024448,0.003232741,0.0016618328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096205775,0.000024740106,0.0009533287,0.000053884003,0.000013920583,0.0002377569,0.0004383591,0.0006053274,0.0018145446,0.98590523,0.0024881116,0.007368443],"study_design_scores_gemma":[0.000031935935,0.0000093355475,0.00043334477,0.000029804376,0.000019907953,0.00077074085,0.00028384867,0.0028217759,0.0022968042,0.9829853,0.010286531,0.000030600128],"about_ca_topic_score_codex":0.00041574278,"about_ca_topic_score_gemma":0.0006039836,"teacher_disagreement_score":0.014468371,"about_ca_system_score_codex":0.0015324493,"about_ca_system_score_gemma":0.00050374714,"threshold_uncertainty_score":0.048401535},"labels":[],"label_agreement":null},{"id":"W134620505","doi":"","title":"On a generalization of signed total dominating functions of graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.012171298720965895,"score_gpt":0.2663995398700411,"score_spread":0.2542282411490752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134620505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1665596,0.0027786056,0.62822014,0.0033057956,0.0012721831,0.00014784849,0.00079571723,0.000626985,0.1962931],"genre_scores_gemma":[0.8187363,0.0042104814,0.09229762,0.0021813826,0.0015841635,0.00024567344,0.0010564848,0.0005815636,0.0791064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991899,0.00023364079,0.000045083336,0.00017594805,0.00022219743,0.00013328202],"domain_scores_gemma":[0.99659735,0.0017220238,0.0002453143,0.0005787331,0.00050552096,0.00035102575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014996884,0.00095023005,0.0007379295,0.0029121283,0.0014536115,0.0031915694,0.0013690582,0.001026636,0.006976367],"category_scores_gemma":[0.0086384015,0.00035226493,0.0012550175,0.002848154,0.0023686928,0.007789737,0.002723121,0.002679637,0.0011865026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018319026,0.000016275264,0.00020734502,0.000040783514,0.000008056124,0.000047761994,0.00011690653,0.0016863247,0.00042682307,0.9807083,0.0027510005,0.013972059],"study_design_scores_gemma":[0.000007710681,0.000019728237,0.00020161316,0.000026574375,0.0000137989955,0.00018752311,0.00007719249,0.00954597,0.00034245732,0.9793474,0.010219612,0.000010472814],"about_ca_topic_score_codex":0.0012343486,"about_ca_topic_score_gemma":0.0011755141,"teacher_disagreement_score":0.006976367,"about_ca_system_score_codex":0.0016816813,"about_ca_system_score_gemma":0.000733193,"threshold_uncertainty_score":0.023338258},"labels":[],"label_agreement":null},{"id":"W135019761","doi":"","title":"Complete bipartite free graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Cograph; Chordal graph; 1-planar graph; Graph","score_opus":0.025079521374824644,"score_gpt":0.27375007785731814,"score_spread":0.2486705564824935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135019761","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13004683,0.0039649997,0.18012545,0.00588108,0.00078412646,0.00024359909,0.009324768,0.0013384434,0.6682906],"genre_scores_gemma":[0.7161739,0.0025207994,0.039594118,0.0020443075,0.0005759287,0.00027784487,0.0103114275,0.000394388,0.2281073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993568,0.0001450074,0.00002196803,0.00016450556,0.0001754767,0.00013631007],"domain_scores_gemma":[0.9983449,0.0006678263,0.00016476726,0.0002755832,0.00028100092,0.0002660184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004442986,0.00050279254,0.0006064409,0.0011457977,0.0014801346,0.0017908334,0.0009182478,0.001007118,0.030653294],"category_scores_gemma":[0.0023528815,0.0003686687,0.00045644728,0.0014700784,0.00085918256,0.0027430735,0.0014854026,0.0015288908,0.0052576563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118703494,0.00007551775,0.00053912256,0.00022606322,0.000039018618,0.00013891458,0.00020039137,0.0016009483,0.0021289268,0.896534,0.05634958,0.04204864],"study_design_scores_gemma":[0.000028845245,0.000016383008,0.00065346085,0.000045695575,0.00002746567,0.00024917113,0.00009914916,0.0050178953,0.0012023589,0.9334585,0.059188146,0.000012942969],"about_ca_topic_score_codex":0.0014769455,"about_ca_topic_score_gemma":0.0031052448,"teacher_disagreement_score":0.030653294,"about_ca_system_score_codex":0.0009600789,"about_ca_system_score_gemma":0.0007484982,"threshold_uncertainty_score":0.1025455},"labels":[],"label_agreement":null},{"id":"W135964657","doi":"","title":"The Expectation of Independent Domination Number Over Random Binary Trees.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Random binary tree; Binary tree; Combinatorics; Statistics; Arithmetic","score_opus":0.009152291672543507,"score_gpt":0.2763003681278505,"score_spread":0.267148076455307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135964657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40903023,0.0050872723,0.5092967,0.013168082,0.0011251137,0.00028055988,0.005214712,0.0021685953,0.05462873],"genre_scores_gemma":[0.95204127,0.0022290049,0.025345368,0.0012583673,0.00097287365,0.00040326742,0.0017134394,0.00040575716,0.01563071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956417,0.0017760092,0.00016218801,0.00087718916,0.0008285401,0.00071438996],"domain_scores_gemma":[0.9290604,0.057764325,0.0035959426,0.0048306924,0.0019934343,0.0027552766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00882974,0.001144614,0.0024057408,0.0029218004,0.0011070837,0.0040307776,0.004381769,0.0028935391,0.011720224],"category_scores_gemma":[0.0650362,0.0012260554,0.0010664541,0.0025809642,0.0047025126,0.011336071,0.0023994995,0.0036110345,0.0016649337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006469951,0.0001522281,0.004109746,0.00054249447,0.00016042669,0.00024432887,0.00028658478,0.047497954,0.0029768613,0.9118019,0.0138412425,0.017739195],"study_design_scores_gemma":[0.00009534675,0.00008201207,0.0029957301,0.00015309209,0.00006848438,0.00046328845,0.0001061559,0.24989651,0.002345598,0.7408327,0.0028830394,0.0000780012],"about_ca_topic_score_codex":0.0010225372,"about_ca_topic_score_gemma":0.0010181449,"teacher_disagreement_score":0.011720224,"about_ca_system_score_codex":0.0027675154,"about_ca_system_score_gemma":0.0013583377,"threshold_uncertainty_score":0.046696723},"labels":[],"label_agreement":null},{"id":"W137453216","doi":"","title":"On the Girth of Digraphs with High Connectivity.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Girth (graph theory); Mathematics; Combinatorics","score_opus":0.013045838375878383,"score_gpt":0.2476699812188061,"score_spread":0.2346241428429277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137453216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69866073,0.0053896457,0.1602122,0.0055122245,0.00055969786,0.0000949614,0.0016344131,0.00065565493,0.1272805],"genre_scores_gemma":[0.9581765,0.0030417636,0.025634678,0.00066057785,0.00065833866,0.000106545645,0.0008027538,0.0002537013,0.010665183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992163,0.000292534,0.000031852152,0.00012804482,0.00017445811,0.00015675413],"domain_scores_gemma":[0.987773,0.009110474,0.00084254256,0.00080770656,0.0004858368,0.0009804748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008922283,0.0005919433,0.0008961009,0.0030923325,0.0013135106,0.0021066153,0.0012947257,0.0013186679,0.008927098],"category_scores_gemma":[0.011897778,0.0007121959,0.00053101266,0.0021818993,0.0027232014,0.0051107826,0.0029399332,0.0027556666,0.0012806625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023137903,0.00006885147,0.0030014336,0.0002833891,0.000059412007,0.0002807403,0.0006914966,0.01898433,0.00333391,0.9280331,0.014386671,0.030645344],"study_design_scores_gemma":[0.00002697377,0.000043765507,0.0012040074,0.000056537912,0.000030249752,0.0003073249,0.00020135014,0.017691065,0.00068536913,0.97532755,0.0044079036,0.000017912083],"about_ca_topic_score_codex":0.00077480014,"about_ca_topic_score_gemma":0.0012540944,"teacher_disagreement_score":0.008927098,"about_ca_system_score_codex":0.0010414366,"about_ca_system_score_gemma":0.0003851569,"threshold_uncertainty_score":0.029864132},"labels":[],"label_agreement":null},{"id":"W137797140","doi":"","title":"Multiplicity of triangles in 2-edge coloring of a family of graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Multiplicity (mathematics); Enhanced Data Rates for GSM Evolution; Combinatorics; Graph coloring; Graph; Geometry; Computer science; Line graph; Artificial intelligence","score_opus":0.026968470004223616,"score_gpt":0.28860468504711323,"score_spread":0.2616362150428896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137797140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84361595,0.0011463872,0.07659429,0.0018829379,0.000532393,0.000056064273,0.0012906755,0.00048585967,0.074395455],"genre_scores_gemma":[0.970801,0.00036151757,0.01567063,0.00017709422,0.00017959492,0.00006693522,0.0006325347,0.00011764213,0.011993097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991359,0.00020611205,0.000044509055,0.00020607215,0.00021383427,0.00019355972],"domain_scores_gemma":[0.99384683,0.002974176,0.0010660749,0.0005181377,0.00067564397,0.00091917766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073874387,0.0005388532,0.00060613925,0.0023192733,0.0023521148,0.0021190092,0.0014241983,0.0015468458,0.010836037],"category_scores_gemma":[0.0068063773,0.0005789729,0.0006648372,0.0015533032,0.0014774188,0.002449424,0.0013168374,0.0013158809,0.001040434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046764023,0.00009253428,0.01302153,0.00019359474,0.000060398514,0.0015642378,0.0014729793,0.009422973,0.011460367,0.9226272,0.01394396,0.025672581],"study_design_scores_gemma":[0.00008489756,0.00010443943,0.010776451,0.000085561864,0.000064437714,0.0042563807,0.0006941704,0.045890253,0.0047443276,0.91565084,0.017577099,0.00007119339],"about_ca_topic_score_codex":0.0014434397,"about_ca_topic_score_gemma":0.001832785,"teacher_disagreement_score":0.010836037,"about_ca_system_score_codex":0.0011505575,"about_ca_system_score_gemma":0.0004294661,"threshold_uncertainty_score":0.036250174},"labels":[],"label_agreement":null},{"id":"W1418567529","doi":"10.1016/j.dam.2015.09.015","title":"Counting the number of non-equivalent vertex colorings of a graph","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Degree (music); Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.034397920620340305,"score_gpt":0.3151338333837076,"score_spread":0.2807359127633673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1418567529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8196829,0.0006289621,0.16162074,0.001934125,0.0004947281,0.00015457423,0.002103195,0.00093025697,0.012450482],"genre_scores_gemma":[0.86411333,0.00046358342,0.12403542,0.00040047098,0.0003799568,0.00021503006,0.0035418635,0.00044505662,0.006405238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920849,0.0018655178,0.0006765795,0.002180765,0.0021722286,0.0010199886],"domain_scores_gemma":[0.9474923,0.035276342,0.0029849554,0.007841891,0.003650442,0.0027541136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003000121,0.0013225891,0.0018652439,0.0036751833,0.0024976507,0.005333045,0.0057171397,0.0028210871,0.0077236593],"category_scores_gemma":[0.033626534,0.0012146229,0.0016888148,0.0036178485,0.00289131,0.009108307,0.0026897232,0.002682613,0.0007154046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004601751,0.0014192043,0.11858819,0.0022870288,0.0014810811,0.0014876999,0.0017507635,0.13729705,0.06494072,0.41041985,0.02056273,0.23516403],"study_design_scores_gemma":[0.0002868919,0.00036566317,0.013701968,0.0001257521,0.00053727074,0.002564695,0.0007185138,0.3541697,0.02035916,0.5990252,0.008002097,0.00014316394],"about_ca_topic_score_codex":0.0011472938,"about_ca_topic_score_gemma":0.0020563907,"teacher_disagreement_score":0.0077236593,"about_ca_system_score_codex":0.0021076791,"about_ca_system_score_gemma":0.0016571253,"threshold_uncertainty_score":0.025838196},"labels":[],"label_agreement":null},{"id":"W142123670","doi":"","title":"Regular Weighted Graphs Without Positive Cuts.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010257762863609247,"score_gpt":0.27615987145997967,"score_spread":0.2659021085963704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142123670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26514095,0.0017372294,0.4655954,0.00235806,0.0008418834,0.00026034954,0.0027572382,0.0014715336,0.25983745],"genre_scores_gemma":[0.7525889,0.0013428422,0.13682863,0.00096596585,0.0003377805,0.0002597616,0.0033173535,0.0006509623,0.10370778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999033,0.00019604147,0.000054801294,0.00029530074,0.00025963725,0.00016125625],"domain_scores_gemma":[0.9969599,0.0011707561,0.00051524,0.0005445462,0.00050635246,0.00030324515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066734944,0.00078363885,0.00063693285,0.00146348,0.0011788326,0.0024805923,0.0013653121,0.00112345,0.013268331],"category_scores_gemma":[0.0051460834,0.00073716545,0.0006252367,0.0014642334,0.0014462239,0.004349965,0.0012953768,0.0019138868,0.0030711666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024241673,0.000084069274,0.0007595957,0.00026224725,0.00006592389,0.0004342152,0.00022652945,0.003016157,0.006845064,0.93250066,0.013811047,0.041752227],"study_design_scores_gemma":[0.000032211392,0.00003293004,0.00053181977,0.00007173263,0.00005496335,0.00067270966,0.00015897927,0.010394277,0.0028984267,0.9654636,0.01967056,0.000017798848],"about_ca_topic_score_codex":0.0009018591,"about_ca_topic_score_gemma":0.0017258896,"teacher_disagreement_score":0.013268331,"about_ca_system_score_codex":0.0006378219,"about_ca_system_score_gemma":0.00045123062,"threshold_uncertainty_score":0.044386983},"labels":[],"label_agreement":null},{"id":"W143189219","doi":"10.46298/dmtcs.272","title":"P_4-Colorings and P_4-Bipartite Graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cograph; Bipartite graph; Strong perfect graph theorem; Indifference graph; Chordal graph; Discrete mathematics; Triangle-free graph; Pathwidth; Split graph; 1-planar graph; Pancyclic graph; Graph; Line graph","score_opus":0.01926560107359048,"score_gpt":0.2934408747580528,"score_spread":0.2741752736844623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143189219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63204557,0.000938387,0.29839018,0.00339936,0.00019829397,0.00013359173,0.0011373048,0.00069558056,0.06306173],"genre_scores_gemma":[0.9552527,0.00038367114,0.037215102,0.00036478695,0.00012046974,0.00009661413,0.00081893324,0.000050163733,0.0056975223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914074,0.00021066368,0.00004577519,0.00027562512,0.00014660036,0.00018054592],"domain_scores_gemma":[0.9975776,0.0012040513,0.0004303963,0.00046665996,0.00014912518,0.00017214446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007699681,0.0003599512,0.00027718136,0.0005518108,0.0011903096,0.0014222703,0.00063945435,0.00078278134,0.003876731],"category_scores_gemma":[0.0026622023,0.00042071237,0.000564506,0.00098721,0.0024409147,0.0026364466,0.0012692079,0.0012335248,0.00038031593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018981572,0.00007094451,0.0034077892,0.00015143375,0.00003445239,0.0003702323,0.00049775344,0.018060977,0.0048708417,0.9371673,0.0056092623,0.029569143],"study_design_scores_gemma":[0.000024611662,0.00003853502,0.0013917496,0.000019913803,0.000014671423,0.00032847858,0.00021023591,0.02834974,0.0027492857,0.95772326,0.00913235,0.000017117856],"about_ca_topic_score_codex":0.0017601588,"about_ca_topic_score_gemma":0.0014599145,"teacher_disagreement_score":0.003876731,"about_ca_system_score_codex":0.0009862516,"about_ca_system_score_gemma":0.0006370024,"threshold_uncertainty_score":0.012969017},"labels":[],"label_agreement":null},{"id":"W143711533","doi":"","title":"A Note on the Representation of Unit Interval Graphs: A Link Between Interval Graphs and Semiorders.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Interval (graph theory); Indifference graph; Link (geometry); Unit interval; Interval graph; Combinatorics; Chordal graph; Unit (ring theory); Representation (politics); Pathwidth; Discrete mathematics; 1-planar graph; Graph; Line graph; Mathematics education","score_opus":0.0368655418629756,"score_gpt":0.32064296678188997,"score_spread":0.2837774249189144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143711533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011805914,0.007887557,0.8040776,0.011170853,0.0060577737,0.00007924475,0.00059588137,0.0011300138,0.1571951],"genre_scores_gemma":[0.26989782,0.012178947,0.66227466,0.0070521287,0.0060939076,0.00027028905,0.000857358,0.0012720808,0.040102717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921846,0.00034241396,0.000052514686,0.00013710586,0.0001881565,0.00006126662],"domain_scores_gemma":[0.99661714,0.0018558167,0.00020344794,0.00079322583,0.00031238265,0.00021809092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014058562,0.00063743145,0.0006361285,0.0010917458,0.0019450929,0.00423734,0.0019385362,0.0014422506,0.011330648],"category_scores_gemma":[0.0067786546,0.00040812578,0.0010303814,0.0027784558,0.004279911,0.0112535665,0.0026511436,0.005202871,0.0028879207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019130444,0.000014748699,0.00007080908,0.00005806909,0.000005344071,0.00010186769,0.0003370277,0.00048708118,0.0005427379,0.97116864,0.0113186715,0.015875882],"study_design_scores_gemma":[0.0000041798744,0.000013736359,0.00007842106,0.00004079193,0.000008146335,0.00014053614,0.00009920075,0.0015558448,0.00028821133,0.9455239,0.05223402,0.000012978412],"about_ca_topic_score_codex":0.0015122613,"about_ca_topic_score_gemma":0.0023142344,"teacher_disagreement_score":0.011330648,"about_ca_system_score_codex":0.00072944217,"about_ca_system_score_gemma":0.0005686827,"threshold_uncertainty_score":0.03790474},"labels":[],"label_agreement":null},{"id":"W145583369","doi":"","title":"A Note on the Hall-Condition Number of a Graph.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.014490520136057602,"score_gpt":0.2956513618336297,"score_spread":0.2811608416975721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145583369","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07887145,0.020827174,0.106962465,0.033804875,0.019828705,0.00015242356,0.002286954,0.0010198681,0.7362461],"genre_scores_gemma":[0.8715197,0.010518098,0.05129123,0.0061317245,0.011553056,0.00021548438,0.0010688152,0.00045048672,0.047251523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990631,0.00023734293,0.000045400753,0.00022000806,0.00026454197,0.00016966632],"domain_scores_gemma":[0.99273866,0.0053139366,0.00026082192,0.0005934103,0.00052065507,0.0005723891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010664389,0.00073780393,0.0009730375,0.0031981997,0.0027433007,0.0026290456,0.0019594408,0.0019534326,0.02954756],"category_scores_gemma":[0.008659012,0.0004094521,0.0006807901,0.0025263617,0.0052765314,0.0072621796,0.002653765,0.005554859,0.0031425045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011373645,0.000023378292,0.00033204953,0.00017763459,0.000012695886,0.00018244184,0.0001234713,0.0009974557,0.0010316138,0.9440305,0.035677016,0.01729795],"study_design_scores_gemma":[0.000014864152,0.00002876952,0.00042492998,0.00003958175,0.000015985244,0.0001635023,0.00009860381,0.0014242212,0.0005645159,0.97245336,0.02474825,0.000023558292],"about_ca_topic_score_codex":0.0018564918,"about_ca_topic_score_gemma":0.0023948196,"teacher_disagreement_score":0.02954756,"about_ca_system_score_codex":0.0018666241,"about_ca_system_score_gemma":0.001012629,"threshold_uncertainty_score":0.098846495},"labels":[],"label_agreement":null},{"id":"W145866003","doi":"","title":"A note on graphs with disjoint dominating and total dominating sets.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Dominating set; Combinatorics; Graph","score_opus":0.013711757464083662,"score_gpt":0.26537390016920026,"score_spread":0.2516621427051166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145866003","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021597594,0.09468618,0.318755,0.058220852,0.040459197,0.000218983,0.0020880864,0.0009578956,0.46301624],"genre_scores_gemma":[0.34585527,0.12643677,0.3015352,0.029072113,0.057777666,0.00047637228,0.0020744712,0.0012215832,0.1355505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877113,0.00037316378,0.000076540164,0.0003019158,0.00037214134,0.0001050521],"domain_scores_gemma":[0.99399006,0.004400233,0.00018412486,0.00067526364,0.0004285194,0.0003218427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018257684,0.001387113,0.001603954,0.0019377917,0.0022806895,0.002724445,0.0023383955,0.0014442062,0.0082181655],"category_scores_gemma":[0.007355422,0.0006754336,0.0019293176,0.0031300322,0.003643002,0.010235643,0.0036737777,0.006633806,0.002607862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016263772,0.00006641532,0.0006470297,0.00088872423,0.00010728333,0.0010940238,0.0003844585,0.0034161701,0.001972986,0.80228704,0.12855124,0.060422007],"study_design_scores_gemma":[0.000019424666,0.000050874063,0.0007258378,0.00015197159,0.00007103574,0.0010762601,0.00016506808,0.0026229841,0.0004674202,0.85052156,0.14409494,0.000032586766],"about_ca_topic_score_codex":0.0025411595,"about_ca_topic_score_gemma":0.0046862797,"teacher_disagreement_score":0.0082181655,"about_ca_system_score_codex":0.0016946242,"about_ca_system_score_gemma":0.00077408686,"threshold_uncertainty_score":0.027492523},"labels":[],"label_agreement":null},{"id":"W147598185","doi":"","title":"Bondage number in oriented graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012176168225396909,"score_gpt":0.29484539892828276,"score_spread":0.28266923070288585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147598185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55991566,0.002953732,0.10205387,0.0033643201,0.0014996905,0.000080186765,0.0008096302,0.0006173217,0.32870552],"genre_scores_gemma":[0.9441135,0.0014925711,0.016129933,0.00023667987,0.00047121712,0.00009124586,0.00029420783,0.00014337368,0.03702733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999619,0.00008995776,0.000018134026,0.00008038876,0.00012480872,0.00006768341],"domain_scores_gemma":[0.9984579,0.0006325103,0.00030973417,0.000115034716,0.00014992042,0.00033490726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005071461,0.00035329425,0.00042134407,0.0024726465,0.0013070381,0.0021174608,0.00062924775,0.0010919403,0.014675764],"category_scores_gemma":[0.0029968852,0.00023490748,0.00023532555,0.0012554611,0.0016355468,0.0036432683,0.0010700878,0.0010653818,0.0019100542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004016236,0.000015734751,0.00046590684,0.00003967375,0.0000047585777,0.000039060084,0.000102212034,0.00079613517,0.0012073306,0.9855488,0.00283068,0.0089096185],"study_design_scores_gemma":[0.000012552658,0.000020508045,0.000593309,0.000024220997,0.0000081416265,0.00014418378,0.00009519565,0.004281021,0.0010846992,0.9849187,0.0088050915,0.000012321647],"about_ca_topic_score_codex":0.00050700986,"about_ca_topic_score_gemma":0.0007882607,"teacher_disagreement_score":0.014675764,"about_ca_system_score_codex":0.0007283141,"about_ca_system_score_gemma":0.00035890596,"threshold_uncertainty_score":0.049095333},"labels":[],"label_agreement":null},{"id":"W147739259","doi":"","title":"Two families of graphs that are not CCE-orientable","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02582890884677912,"score_gpt":0.2883827748628266,"score_spread":0.26255386601604747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147739259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7997642,0.0014796582,0.04721552,0.0037283434,0.000394305,0.00015909257,0.0010572971,0.0005987572,0.1456028],"genre_scores_gemma":[0.9621007,0.0006009224,0.017117176,0.0005739847,0.00007992327,0.00015637893,0.0017132652,0.00015718033,0.01750042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922943,0.00013867328,0.000034356304,0.00020327957,0.00014991783,0.00024438024],"domain_scores_gemma":[0.99568367,0.0021129297,0.0005430653,0.00049515796,0.0004433186,0.0007218914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007075739,0.0009739821,0.0007869566,0.0018261914,0.0033476157,0.003209804,0.0012263627,0.0024243942,0.0077231443],"category_scores_gemma":[0.005124519,0.0010103874,0.000960297,0.0017095007,0.0022470602,0.0029649932,0.0016355001,0.0023827755,0.00071663625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006246906,0.00018006125,0.0058064708,0.00028407283,0.00007171542,0.0052156323,0.0024684726,0.0022291427,0.010028263,0.9425072,0.010616814,0.019967495],"study_design_scores_gemma":[0.00033230323,0.00014941329,0.017573884,0.00026763292,0.00020522864,0.009036496,0.0047485456,0.0117935715,0.010595262,0.8761912,0.06895113,0.00015533442],"about_ca_topic_score_codex":0.0018665174,"about_ca_topic_score_gemma":0.0018372743,"teacher_disagreement_score":0.0077231443,"about_ca_system_score_codex":0.0015998436,"about_ca_system_score_gemma":0.0006195767,"threshold_uncertainty_score":0.025836527},"labels":[],"label_agreement":null},{"id":"W1481873605","doi":"10.1007/s00493-009-2178-y","title":"Highly parity linked graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Parity (physics); Disjoint sets; Graph; Joins; Discrete mathematics; Physics; Computer science","score_opus":0.0204968892541353,"score_gpt":0.28604150329798345,"score_spread":0.26554461404384816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481873605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54675955,0.0007052126,0.18272385,0.005062561,0.0008356409,0.00018161604,0.00145136,0.0013703366,0.26090991],"genre_scores_gemma":[0.9168064,0.00032064962,0.02715766,0.0013002724,0.00035893594,0.00014324852,0.001203453,0.00046368633,0.052245736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992803,0.00019436113,0.000024686171,0.00017227359,0.00020632354,0.00012215853],"domain_scores_gemma":[0.99639076,0.0014948688,0.0003982754,0.0008133784,0.0004687361,0.00043398162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005502124,0.0004940802,0.00057760207,0.0017451273,0.002233545,0.0028655343,0.0011601235,0.0017360598,0.019612232],"category_scores_gemma":[0.0054425756,0.00057774363,0.00046990011,0.001359483,0.0015708362,0.004541841,0.0027686397,0.0029618938,0.0024165912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009357666,0.00006768771,0.000792987,0.00006387724,0.000014025104,0.00023773892,0.00022209677,0.0013275241,0.0033475794,0.97312886,0.006950314,0.013753869],"study_design_scores_gemma":[0.00001950651,0.000014896957,0.00031837975,0.000015514022,0.000014393366,0.00023034394,0.00009575279,0.005881099,0.0016958608,0.98625237,0.005452779,0.000009049093],"about_ca_topic_score_codex":0.00036809573,"about_ca_topic_score_gemma":0.0006169389,"teacher_disagreement_score":0.019612232,"about_ca_system_score_codex":0.00066863926,"about_ca_system_score_gemma":0.00051611924,"threshold_uncertainty_score":0.065609396},"labels":[],"label_agreement":null},{"id":"W1481913488","doi":"10.1002/jgt.20649","title":"An asymptotically tight bound on the adaptable chromatic number","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigraph; Combinatorics; Mathematics; Chromatic scale; Vertex (graph theory); Integer (computer science); Graph; Upper and lower bounds; Edge coloring; Critical graph; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Graph power; Line graph","score_opus":0.022410699323175753,"score_gpt":0.2992226052457742,"score_spread":0.27681190592259847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481913488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4331191,0.0049546123,0.47835994,0.00427933,0.00052106165,0.0001827691,0.0019136447,0.0041834214,0.07248617],"genre_scores_gemma":[0.948733,0.0007451484,0.04365332,0.00055590476,0.00024502733,0.00013895195,0.00050894247,0.00035256793,0.00506705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967558,0.0004952852,0.00010472721,0.000994034,0.0009426546,0.0007075738],"domain_scores_gemma":[0.9820354,0.010427017,0.00087062304,0.0042527867,0.0011975651,0.0012165812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024955345,0.0011585652,0.0012770394,0.0019517683,0.0020102742,0.0032137334,0.0030013807,0.0014731431,0.008852186],"category_scores_gemma":[0.016578121,0.00071138865,0.0007044143,0.002271146,0.002655151,0.0057204585,0.003861993,0.004107391,0.0012328558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028949198,0.00039581544,0.011849848,0.0007540397,0.00025185331,0.0006638112,0.00069243944,0.4017532,0.07191129,0.38988125,0.025136257,0.09381536],"study_design_scores_gemma":[0.00011082162,0.00023300126,0.004251236,0.00012474872,0.00010992858,0.00056520157,0.00016709707,0.6233099,0.012195199,0.34610936,0.012702326,0.00012116466],"about_ca_topic_score_codex":0.0042840648,"about_ca_topic_score_gemma":0.0049301097,"teacher_disagreement_score":0.008852186,"about_ca_system_score_codex":0.0035509516,"about_ca_system_score_gemma":0.0017223574,"threshold_uncertainty_score":0.029613495},"labels":[],"label_agreement":null},{"id":"W1484014009","doi":"10.1007/bfb0026093","title":"On the maximum path length of AVL trees","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Path length; Path (computing); Tree (set theory); Bounded function; Upper and lower bounds; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.021525221077780408,"score_gpt":0.26746629434775215,"score_spread":0.24594107326997175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484014009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36249915,0.015286105,0.43588805,0.0047060526,0.00053524104,0.00017083257,0.0040763067,0.0015509978,0.1752873],"genre_scores_gemma":[0.80786276,0.007144858,0.15812624,0.0006307657,0.00093453366,0.00030115317,0.0030904769,0.001218172,0.020691013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987431,0.00032388695,0.00007408563,0.0002497556,0.0004250695,0.00018420059],"domain_scores_gemma":[0.98415816,0.012517721,0.0009835466,0.0008564252,0.0008949715,0.0005893111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016038318,0.0007258336,0.0010414872,0.0032337217,0.001398934,0.0028286723,0.0024461965,0.001215902,0.009115627],"category_scores_gemma":[0.016003972,0.0010119645,0.00067368435,0.0046354984,0.0019248383,0.0073937136,0.0022434122,0.0030253862,0.0015802694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000625496,0.00011438504,0.0041671665,0.0011925346,0.000094731,0.0001882462,0.00096934167,0.083344564,0.011373984,0.6647772,0.022977225,0.21017523],"study_design_scores_gemma":[0.000034287576,0.000072422845,0.001588756,0.00018138315,0.00005337702,0.0002157078,0.00019925983,0.093108095,0.002477204,0.8896745,0.012356813,0.000038230457],"about_ca_topic_score_codex":0.0015177066,"about_ca_topic_score_gemma":0.0027092397,"teacher_disagreement_score":0.009115627,"about_ca_system_score_codex":0.0024236504,"about_ca_system_score_gemma":0.0007828294,"threshold_uncertainty_score":0.030494869},"labels":[],"label_agreement":null},{"id":"W1484251326","doi":"10.48550/arxiv.0712.0804","title":"Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Transitive relation; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.05429848220109878,"score_gpt":0.31668739605324886,"score_spread":0.2623889138521501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484251326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22183204,0.0007573103,0.7603412,0.0014506909,0.00008330707,0.000468172,0.0023415722,0.00096326484,0.011762498],"genre_scores_gemma":[0.73442096,0.00073633366,0.25162536,0.00027271901,0.0001167526,0.0004508928,0.0023031426,0.00021544941,0.009858421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988318,0.00033379975,0.00007309267,0.00039460429,0.00021416055,0.0001524552],"domain_scores_gemma":[0.99541736,0.002808718,0.00038812924,0.00069064845,0.00033619368,0.00035894482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011312147,0.0008224514,0.00089438085,0.00090566144,0.0006080261,0.0019474169,0.0016751552,0.0010318446,0.0063086343],"category_scores_gemma":[0.006422027,0.00067243393,0.0008842027,0.001185705,0.0013896828,0.0047466955,0.0013551835,0.0018142443,0.0005232944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040916415,0.00035713054,0.0022960973,0.0009070062,0.00010664272,0.00041413808,0.0008559159,0.30150732,0.008843966,0.54841924,0.009017365,0.12686607],"study_design_scores_gemma":[0.00010448791,0.00015948282,0.000890511,0.000056216144,0.000056007128,0.00030963143,0.00030446032,0.3246507,0.00423819,0.66355664,0.0056384928,0.00003521226],"about_ca_topic_score_codex":0.002049849,"about_ca_topic_score_gemma":0.002866773,"teacher_disagreement_score":0.0063086343,"about_ca_system_score_codex":0.0025137076,"about_ca_system_score_gemma":0.001359948,"threshold_uncertainty_score":0.021104515},"labels":[],"label_agreement":null},{"id":"W1484691446","doi":"10.1016/j.tcs.2016.08.016","title":"The complexity of dominating set reconfiguration","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Dominating set; Mathematics; Discrete mathematics; Bipartite graph; Vertex (graph theory); Bounded function; Time complexity; Sequence (biology); Existential quantification; Maximal independent set; Split graph; Pathwidth; Graph; Line graph","score_opus":0.04426428454903826,"score_gpt":0.31935977987283914,"score_spread":0.2750954953238009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484691446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6405066,0.0041017267,0.24787806,0.01917026,0.0007042566,0.0003781202,0.00400861,0.0013195332,0.081932835],"genre_scores_gemma":[0.96526515,0.0013617333,0.023231171,0.0005498246,0.0005055264,0.0001806399,0.0013274855,0.00029270767,0.0072858515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942846,0.0019293934,0.00031311368,0.0010304326,0.0014620087,0.0009803731],"domain_scores_gemma":[0.9545282,0.03545572,0.0026705542,0.0041213436,0.0013050417,0.0019191306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032099537,0.0009397984,0.002387399,0.00158994,0.0021302782,0.008031608,0.0036672922,0.0028712035,0.011213007],"category_scores_gemma":[0.03262896,0.0012706709,0.0018841568,0.0034761124,0.003358086,0.013640236,0.003994332,0.0040558013,0.0009141838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015879559,0.00033739765,0.005013144,0.0008463711,0.00024813547,0.0005163668,0.0008695406,0.35686886,0.0059504434,0.5313458,0.022254733,0.07416118],"study_design_scores_gemma":[0.00015173915,0.00008455097,0.001165823,0.00003955982,0.00009695713,0.00035815084,0.00025624255,0.3119733,0.0012699997,0.68094826,0.0036127635,0.000042627562],"about_ca_topic_score_codex":0.0024635624,"about_ca_topic_score_gemma":0.0023628958,"teacher_disagreement_score":0.011213007,"about_ca_system_score_codex":0.0050672027,"about_ca_system_score_gemma":0.0028141502,"threshold_uncertainty_score":0.03751123},"labels":[],"label_agreement":null},{"id":"W1484933608","doi":"10.46298/dmtcs.2084","title":"Toppling numbers of complete and random graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Random graph; Discrete mathematics; Wheel graph; Graph power; Line graph","score_opus":0.01691383692396501,"score_gpt":0.28482182467055134,"score_spread":0.2679079877465863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484933608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7243162,0.00067724,0.24277638,0.0008385558,0.00007158823,0.000099005374,0.00030420686,0.00032824228,0.030588532],"genre_scores_gemma":[0.980113,0.00023402247,0.014171425,0.00008586952,0.000041143558,0.00006539129,0.00012881595,0.000055005097,0.005105419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881685,0.00048859755,0.000029986053,0.00020356047,0.00026821287,0.00019271523],"domain_scores_gemma":[0.9884964,0.007967549,0.001197421,0.0006295612,0.0004984403,0.0012105806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014398256,0.0006540153,0.0007484148,0.0017046187,0.00087366765,0.0016946879,0.001490945,0.0012351596,0.0052048825],"category_scores_gemma":[0.015784517,0.0005642341,0.0006159569,0.00077172037,0.0032560502,0.0032255922,0.0012063638,0.0014305231,0.00036942074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019797726,0.00007652478,0.0019474879,0.00013043499,0.00005486799,0.0003101078,0.00031906803,0.23792058,0.004848389,0.743648,0.0018639769,0.008682615],"study_design_scores_gemma":[0.0000247677,0.000062275074,0.0011535299,0.000022458187,0.000014003215,0.00016320233,0.000114228205,0.5676233,0.001061257,0.42851844,0.0012125819,0.000029893958],"about_ca_topic_score_codex":0.0013718911,"about_ca_topic_score_gemma":0.0012611197,"teacher_disagreement_score":0.0052048825,"about_ca_system_score_codex":0.0016139429,"about_ca_system_score_gemma":0.00054472545,"threshold_uncertainty_score":0.017412066},"labels":[],"label_agreement":null},{"id":"W1488677252","doi":"10.37236/1972","title":"A Note on Graphs Without Short Even Cycles","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Chordal graph; Discrete mathematics","score_opus":0.01295528252795957,"score_gpt":0.29942992678122426,"score_spread":0.2864746442532647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488677252","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14039041,0.063977234,0.20909138,0.14518642,0.03010673,0.00019759998,0.0015652247,0.0021290262,0.40735596],"genre_scores_gemma":[0.70233345,0.06651382,0.09691208,0.037420146,0.017084505,0.0002473266,0.0012442301,0.0016584418,0.07658604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908113,0.00024173068,0.000038337548,0.00024232989,0.00020979266,0.00018666002],"domain_scores_gemma":[0.9927729,0.0049099387,0.00025181822,0.0010275021,0.000571031,0.00046687116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008783771,0.0011774943,0.00089620333,0.00093643396,0.0022568924,0.0020348402,0.0017749987,0.0010286415,0.009056145],"category_scores_gemma":[0.0075011565,0.00054522697,0.00085391756,0.0016887867,0.0025269648,0.012763808,0.002653019,0.006497861,0.002891009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003754539,0.000118408156,0.0018725408,0.0008169229,0.000067179375,0.0008980823,0.00059389794,0.01082262,0.00943644,0.72039425,0.16136575,0.09323838],"study_design_scores_gemma":[0.000038852588,0.00011844913,0.0013430535,0.00020401829,0.00007398705,0.00062349206,0.00039523188,0.00880636,0.0042147394,0.76952434,0.21459801,0.00005943888],"about_ca_topic_score_codex":0.0045297043,"about_ca_topic_score_gemma":0.0055115526,"teacher_disagreement_score":0.009056145,"about_ca_system_score_codex":0.0016214973,"about_ca_system_score_gemma":0.00076446205,"threshold_uncertainty_score":0.030295849},"labels":[],"label_agreement":null},{"id":"W1491439802","doi":"10.48550/arxiv.0907.3016","title":"Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Duality (order theory); Mathematics; Combinatorics; Discrete mathematics; Mathematical economics","score_opus":0.08347775112373572,"score_gpt":0.35168272865645356,"score_spread":0.2682049775327178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491439802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44746432,0.0006600627,0.48530355,0.0044691153,0.0001797097,0.00009995782,0.001339555,0.0005570517,0.059926596],"genre_scores_gemma":[0.92730135,0.00036183326,0.062075756,0.0004922279,0.00019303922,0.00013549403,0.00085448497,0.0001249647,0.008460903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866605,0.00038457543,0.0000721823,0.0003648967,0.0002617389,0.00025060098],"domain_scores_gemma":[0.9942214,0.003982027,0.0004386622,0.00054855057,0.00033175774,0.0004776421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013983413,0.00043030825,0.00074953825,0.0009944641,0.0013590021,0.0043020444,0.0009980786,0.0009668994,0.0065529435],"category_scores_gemma":[0.006528939,0.000544425,0.0010090854,0.0011905748,0.0022371481,0.0065453644,0.0015862104,0.004057235,0.0006608725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015275921,0.00012453488,0.0010616957,0.000075761476,0.000013577289,0.000082040904,0.0002892912,0.006820342,0.002358333,0.9716119,0.0023189082,0.01509087],"study_design_scores_gemma":[0.000022611388,0.000028104012,0.0003377063,0.000011910932,0.0000065991167,0.00010182497,0.000101416874,0.021781405,0.0012371162,0.974664,0.0016963952,0.0000109314],"about_ca_topic_score_codex":0.00069330045,"about_ca_topic_score_gemma":0.000813021,"teacher_disagreement_score":0.0065529435,"about_ca_system_score_codex":0.0022695875,"about_ca_system_score_gemma":0.00095018564,"threshold_uncertainty_score":0.021921754},"labels":[],"label_agreement":null},{"id":"W1491529421","doi":"10.1007/3-540-36379-3_25","title":"New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Vertex cover; Planar graph; Disjoint sets; Treewidth; Mathematics; Vertex (graph theory); Feedback vertex set; Bounded function; Time complexity; Constant (computer programming); Binary logarithm; Kernelization; Cover (algebra); Discrete mathematics; Parameterized complexity; Graph; Pathwidth; Computer science; Mathematical analysis; Line graph","score_opus":0.03020348838626619,"score_gpt":0.276874548479269,"score_spread":0.24667106009300283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491529421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032589518,0.0010887763,0.9468972,0.0008545137,0.00024360817,0.00034705206,0.0005464719,0.0036577296,0.0137751885],"genre_scores_gemma":[0.0967692,0.0006705239,0.890606,0.00025063413,0.00021475158,0.00057860825,0.0013480934,0.0006311963,0.008930885],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817646,0.00025897438,0.0001607006,0.00045432957,0.0006884756,0.00026095775],"domain_scores_gemma":[0.99491644,0.0024927964,0.0003611472,0.0013299098,0.0006604601,0.00023926646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012752443,0.002114398,0.002264987,0.0024800603,0.0018841237,0.0041066087,0.0061687897,0.0027237944,0.012305798],"category_scores_gemma":[0.008683979,0.0014087497,0.0021646721,0.0044136443,0.0017224073,0.01028617,0.0054929256,0.0038480544,0.0025942088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080673787,0.00046295347,0.0009566845,0.00062395836,0.00013167836,0.00013863936,0.00054726674,0.106120296,0.00816286,0.19197619,0.035247896,0.6548249],"study_design_scores_gemma":[0.0002871689,0.00011523786,0.00047003577,0.00009055145,0.00011022869,0.00029845737,0.00021934285,0.64958453,0.006180004,0.32742128,0.015146663,0.00007650165],"about_ca_topic_score_codex":0.0054767313,"about_ca_topic_score_gemma":0.009684941,"teacher_disagreement_score":0.012305798,"about_ca_system_score_codex":0.004085941,"about_ca_system_score_gemma":0.0023502558,"threshold_uncertainty_score":0.04116696},"labels":[],"label_agreement":null},{"id":"W1491785597","doi":"10.1002/jgt.21850","title":"A Brooks‐Type Theorem for the Bichromatic Number","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Brooks' theorem; Perfect graph; Perfect graph theorem; Clique number; Extremal graph theory; Discrete mathematics; Graph; List coloring; Graph coloring; Chromatic scale; Graph power; Line graph; Voltage graph","score_opus":0.01930900589953868,"score_gpt":0.3015448466994069,"score_spread":0.28223584079986824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491785597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37051237,0.0028914483,0.46534425,0.0032244765,0.00058147084,0.00011407943,0.0012283598,0.0007128047,0.1553908],"genre_scores_gemma":[0.96224725,0.0003441243,0.031088568,0.00051135244,0.00019217294,0.00010123586,0.00023967109,0.00006592596,0.0052097547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985341,0.00023732928,0.00006440075,0.00043231054,0.00051422894,0.00021761388],"domain_scores_gemma":[0.99441624,0.0028283251,0.0005737245,0.0006808506,0.0010438863,0.00045696873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014729797,0.0003765449,0.000538733,0.0016390972,0.0011798402,0.001684398,0.0012750524,0.00065602106,0.0065537044],"category_scores_gemma":[0.008169776,0.00026650226,0.00037958878,0.0012507382,0.0027561975,0.0027721373,0.0016147816,0.001553355,0.00066124735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010424239,0.000017772292,0.0016098308,0.00007482237,0.000013429247,0.00007989768,0.00018181792,0.0030796782,0.0033589278,0.97604465,0.00399449,0.011440368],"study_design_scores_gemma":[0.000036915742,0.00004376935,0.0015230185,0.0000326065,0.000016507647,0.0003689403,0.00009817309,0.016412497,0.0026629623,0.9701067,0.008673053,0.0000249043],"about_ca_topic_score_codex":0.0019199427,"about_ca_topic_score_gemma":0.0011558915,"teacher_disagreement_score":0.0065537044,"about_ca_system_score_codex":0.0014004803,"about_ca_system_score_gemma":0.00061595923,"threshold_uncertainty_score":0.021924317},"labels":[],"label_agreement":null},{"id":"W1492727213","doi":"10.1007/978-3-642-30347-0_4","title":"The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Combinatorics; Regular polygon; Graph; Planar graph; Computer science; Planar; Mathematics; Computer graphics (images); Geometry","score_opus":0.04097300087380767,"score_gpt":0.3051633410611392,"score_spread":0.2641903401873315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492727213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20852987,0.0021282253,0.3923355,0.008089958,0.00088675634,0.0005265876,0.0011027645,0.001045917,0.3853544],"genre_scores_gemma":[0.6554322,0.0018835579,0.23435695,0.0010899091,0.00022667582,0.0003976396,0.0012398278,0.0005379981,0.1048352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993462,0.00017104385,0.00002478126,0.00015310953,0.00014659234,0.00015822155],"domain_scores_gemma":[0.99911183,0.00050407206,0.000048078593,0.00014845109,0.000061305145,0.00012619962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006476818,0.00087470014,0.0010858203,0.00066213997,0.0018117824,0.003162506,0.0023081978,0.0021812734,0.016251048],"category_scores_gemma":[0.0027945163,0.00051011326,0.001118159,0.0011812825,0.0032654917,0.0057599815,0.0029881601,0.0030896978,0.0014256767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024007761,0.000088207424,0.00027855762,0.00030619578,0.000044356435,0.000114315684,0.00037874636,0.028405689,0.002819256,0.9049388,0.016046992,0.046338808],"study_design_scores_gemma":[0.000047504374,0.00005880464,0.00016705443,0.00006364893,0.00003156047,0.00008828918,0.0003377317,0.056161694,0.002200347,0.9230569,0.017757978,0.000028603636],"about_ca_topic_score_codex":0.0030115643,"about_ca_topic_score_gemma":0.004775823,"teacher_disagreement_score":0.016251048,"about_ca_system_score_codex":0.001412333,"about_ca_system_score_gemma":0.0013156333,"threshold_uncertainty_score":0.054365218},"labels":[],"label_agreement":null},{"id":"W1493350325","doi":"10.1007/3-540-45071-8_55","title":"Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Parameterized complexity; Bounded function; Variable (mathematics); Computer science; Computational complexity theory; Time complexity; Satisfiability; Tree (set theory); Discrete mathematics; Combinatorics; Algorithm; Mathematics","score_opus":0.019886599099719942,"score_gpt":0.25577968761385705,"score_spread":0.23589308851413712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493350325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17818724,0.0022015756,0.7147774,0.0065083196,0.00020769994,0.00035915116,0.0025539782,0.003941424,0.091263264],"genre_scores_gemma":[0.8165449,0.0011323203,0.15596889,0.0008864933,0.00024308574,0.00043981217,0.0035390614,0.0011623966,0.020083116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975381,0.00045401952,0.00014568577,0.0005629643,0.00089322793,0.00040607134],"domain_scores_gemma":[0.9905743,0.0072426107,0.00050562393,0.0010267716,0.00048806568,0.00016266179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015662466,0.0012530085,0.0022268773,0.0013157537,0.0014654198,0.00551333,0.0051232795,0.0021517845,0.01005872],"category_scores_gemma":[0.013302566,0.0017753205,0.002518695,0.0035082628,0.0030882384,0.0122942,0.0029728876,0.010011123,0.0011123572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061661017,0.00027715336,0.0010844093,0.0006210419,0.00016111758,0.0004257469,0.0006940653,0.050899763,0.0064726523,0.8462518,0.012836725,0.07965905],"study_design_scores_gemma":[0.000121820005,0.000019088631,0.00021829538,0.000040179868,0.00009618787,0.0001300819,0.000096527976,0.05324422,0.002870973,0.9400981,0.003043371,0.000021151911],"about_ca_topic_score_codex":0.0036344684,"about_ca_topic_score_gemma":0.0057399482,"teacher_disagreement_score":0.01005872,"about_ca_system_score_codex":0.0042237747,"about_ca_system_score_gemma":0.0022220248,"threshold_uncertainty_score":0.033649802},"labels":[],"label_agreement":null},{"id":"W1493404814","doi":"10.1007/11600930_69","title":"Packing Trees in Communication Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University; University of Toronto","funders":"","keywords":"Linear programming relaxation; Integer programming; Steiner tree problem; Approximation algorithm; Solver; Relaxation (psychology); Spanning tree; Combinatorics; Linear programming; Time complexity; Block (permutation group theory); Set packing; Tree (set theory); Computer science; Multicast; Mathematics; Independent set; Graph; Set (abstract data type); Mathematical optimization","score_opus":0.02363825283242386,"score_gpt":0.2889289885727813,"score_spread":0.26529073574035744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493404814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032096714,0.03868223,0.53285277,0.0030914706,0.0029467037,0.00015238489,0.00042904838,0.0011791856,0.3885695],"genre_scores_gemma":[0.3972135,0.059442174,0.28655925,0.0015374656,0.004673164,0.0004538109,0.0015600084,0.0010516956,0.24750888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997004,0.00007447273,0.000013727047,0.00004747233,0.00012347392,0.000040465722],"domain_scores_gemma":[0.99955505,0.00023322675,0.000033585336,0.00008737866,0.00005208232,0.00003867743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002480711,0.0007263837,0.0010366001,0.0012896985,0.0008696573,0.0021185575,0.00080215314,0.0011737468,0.01069846],"category_scores_gemma":[0.0015848314,0.0007918465,0.00045264495,0.0046806163,0.0010157663,0.0033572167,0.0011312503,0.0022344335,0.0033287862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022567263,0.000027890299,0.000076962795,0.00020195016,0.000010165917,0.00007471622,0.00018663288,0.009109941,0.00082190085,0.8554356,0.026022447,0.10800918],"study_design_scores_gemma":[0.00000608575,0.00001771055,0.00010226769,0.000055506825,0.000009621918,0.00017673138,0.00004846112,0.017113296,0.00033129173,0.9322688,0.049863335,0.0000069079915],"about_ca_topic_score_codex":0.00057658594,"about_ca_topic_score_gemma":0.0006860649,"teacher_disagreement_score":0.01069846,"about_ca_system_score_codex":0.00078992127,"about_ca_system_score_gemma":0.00036820298,"threshold_uncertainty_score":0.035789967},"labels":[],"label_agreement":null},{"id":"W1493471320","doi":"10.1002/jgt.20641","title":"On the hamiltonicity of line graphs of locally finite, 6‐edge‐connected graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Line graph; 1-planar graph; Indifference graph; Discrete mathematics; Chordal graph; Pathwidth; Block graph; Symmetric graph; Graph; Voltage graph","score_opus":0.03758313666899045,"score_gpt":0.27017101973377083,"score_spread":0.2325878830647804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493471320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93861127,0.0001762368,0.049480453,0.0002469251,0.000015298283,0.00003340592,0.00013009406,0.00008397952,0.01122238],"genre_scores_gemma":[0.99329185,0.000088911234,0.004878647,0.000043708853,0.00001704961,0.000031371113,0.00009034368,0.0000178692,0.0015402245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997508,0.000082862396,0.000011437579,0.000051113322,0.000055896657,0.000047866786],"domain_scores_gemma":[0.9968874,0.0019641465,0.00053980143,0.00013315218,0.00023492168,0.00024058696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002952303,0.00017657063,0.00026405902,0.00096209336,0.0005475422,0.0008322991,0.00052931975,0.00042951774,0.004210113],"category_scores_gemma":[0.0020363203,0.00024444246,0.00018117263,0.00047387168,0.001688908,0.0012858846,0.0006559376,0.00047813813,0.00019657772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023581223,0.00007732925,0.004465842,0.00016090262,0.000047427744,0.0012295072,0.0013129315,0.028961506,0.024390226,0.9228836,0.0016616355,0.014573215],"study_design_scores_gemma":[0.00009090444,0.00012470405,0.003304527,0.000045186178,0.00003560436,0.00046008176,0.00075859827,0.082288094,0.0051333024,0.9047211,0.0029976089,0.00004031341],"about_ca_topic_score_codex":0.0013169051,"about_ca_topic_score_gemma":0.0016834065,"teacher_disagreement_score":0.004210113,"about_ca_system_score_codex":0.00046145738,"about_ca_system_score_gemma":0.00023907654,"threshold_uncertainty_score":0.01408422},"labels":[],"label_agreement":null},{"id":"W1496800439","doi":"10.1007/978-3-642-16926-7_24","title":"From Path Graphs to Directed Path Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Longest path problem; Induced path; Path (computing); Computer science; Block graph; Cograph; Combinatorics; Directed graph; Fast path; Induced subgraph isomorphism problem; Indifference graph; Pathwidth; Discrete mathematics; Mathematics; Algorithm; Graph; Chordal graph; Shortest path problem; Line graph; Voltage graph; Computer network","score_opus":0.015379193430134084,"score_gpt":0.26715536841971177,"score_spread":0.25177617498957766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496800439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064713946,0.009769414,0.8389265,0.0020924143,0.0012487009,0.00010014096,0.0012434146,0.0019081623,0.13823998],"genre_scores_gemma":[0.15869486,0.029653698,0.70189995,0.0027007642,0.0018245431,0.00048334143,0.0040704943,0.0029092645,0.09776307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956626,0.00010605658,0.000025276844,0.000133281,0.00013450992,0.00003461267],"domain_scores_gemma":[0.9989931,0.0006126496,0.000048941947,0.0001556047,0.00014204335,0.00004763972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038099306,0.001089086,0.00052703614,0.0021556593,0.0007611543,0.0022346484,0.0014924557,0.0009733193,0.017878136],"category_scores_gemma":[0.0031343186,0.0008116413,0.0008270544,0.0036402938,0.0016592069,0.007116562,0.0018757479,0.002829751,0.004274144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001211222,0.000014324945,0.00008066689,0.00029608852,0.0000109722505,0.00009127655,0.00024365497,0.0031163085,0.0007070375,0.86651236,0.02457874,0.10433641],"study_design_scores_gemma":[0.000002598155,0.0000039838737,0.000039357994,0.00004088725,0.0000054085476,0.00008015029,0.00003453796,0.0022341807,0.0001885661,0.95107716,0.04628826,0.000004893015],"about_ca_topic_score_codex":0.0016255768,"about_ca_topic_score_gemma":0.0017514027,"teacher_disagreement_score":0.017878136,"about_ca_system_score_codex":0.0011261362,"about_ca_system_score_gemma":0.00050483085,"threshold_uncertainty_score":0.059808373},"labels":[],"label_agreement":null},{"id":"W1497440123","doi":"10.1007/978-3-540-39890-5_24","title":"On the Recognition of General Partition Graphs","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Frequency partition of a graph; Discrete mathematics; Partition (number theory); Vertex (graph theory); Planar graph; Outerplanar graph; Pathwidth; Graph; Line graph; Graph power","score_opus":0.035032273226030246,"score_gpt":0.2766525167281121,"score_spread":0.24162024350208183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497440123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07881501,0.0042022625,0.8217508,0.0016054587,0.00051349035,0.00017188294,0.0011028775,0.0027947677,0.08904347],"genre_scores_gemma":[0.42955536,0.0058790934,0.47643855,0.0010121937,0.0006324845,0.00027563586,0.008402675,0.001494865,0.076308995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942577,0.00010722087,0.000036822883,0.00019017963,0.0001395719,0.00010058684],"domain_scores_gemma":[0.99875534,0.0005091218,0.00008275763,0.00039861567,0.00015982421,0.000094447576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045616998,0.0008866987,0.0011925204,0.0012281068,0.00092135725,0.0032472026,0.0017706385,0.001268904,0.011056992],"category_scores_gemma":[0.0026430124,0.00064320175,0.0008823949,0.002508535,0.0016368056,0.0065142447,0.0026244586,0.0021293296,0.0036233927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021612407,0.00008573062,0.0010492738,0.00035305775,0.000033117667,0.00022922584,0.0007702501,0.018635059,0.008390569,0.534015,0.04118969,0.3950329],"study_design_scores_gemma":[0.000013155769,0.00003260568,0.0007087921,0.000071541246,0.000019279687,0.0003616664,0.0002546464,0.04891134,0.0029298307,0.91264224,0.034031373,0.00002344185],"about_ca_topic_score_codex":0.001882606,"about_ca_topic_score_gemma":0.0024896304,"teacher_disagreement_score":0.011056992,"about_ca_system_score_codex":0.0008147458,"about_ca_system_score_gemma":0.00045389085,"threshold_uncertainty_score":0.03698933},"labels":[],"label_agreement":null},{"id":"W1500269355","doi":"10.1007/978-3-642-54423-1_47","title":"Complexity of Coloring Graphs without Paths and Cycles","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Complete coloring; NP-complete; Discrete mathematics; Brooks' theorem; Time complexity; Chordal graph; Path (computing); Graph; 1-planar graph; Computer science; Graph power; Line graph","score_opus":0.03918416248615249,"score_gpt":0.2926025502794808,"score_spread":0.2534183877933283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500269355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.540752,0.0027092793,0.29707447,0.01056584,0.0007026012,0.00044566276,0.008020125,0.002039321,0.13769078],"genre_scores_gemma":[0.8494136,0.002770483,0.094371155,0.0011406384,0.0009770029,0.00047671475,0.007907658,0.0014630788,0.04147972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979894,0.0004667867,0.00008277615,0.00047632612,0.0005850642,0.00039956952],"domain_scores_gemma":[0.9852959,0.011405697,0.00064106926,0.0013320522,0.0006023713,0.00072304613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092015404,0.0016764667,0.001569026,0.0011135272,0.0015693838,0.005815216,0.003945287,0.002233764,0.020657798],"category_scores_gemma":[0.0095457025,0.0013152794,0.0020380623,0.002816423,0.002073642,0.009097885,0.0024237495,0.004047597,0.0016509923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010461778,0.00048340802,0.0041191103,0.0013036729,0.00022834787,0.0004152775,0.0009771435,0.18522312,0.009381889,0.6458936,0.055979542,0.09494886],"study_design_scores_gemma":[0.00014534278,0.000041007777,0.0008599214,0.00004604512,0.00007869758,0.00024168103,0.00019041102,0.11403314,0.0018013782,0.87785393,0.0046764426,0.000032005708],"about_ca_topic_score_codex":0.0052902843,"about_ca_topic_score_gemma":0.005538599,"teacher_disagreement_score":0.020657798,"about_ca_system_score_codex":0.0039614947,"about_ca_system_score_gemma":0.002710919,"threshold_uncertainty_score":0.069107234},"labels":[],"label_agreement":null},{"id":"W1500859847","doi":"10.37236/826","title":"New Infinite Families of Almost-Planar Crossing-Critical Graphs","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Combinatorics; Degree (music); Planar graph; Chordal graph; 1-planar graph; Planar; Indifference graph; Simple (philosophy); Crossing number (knot theory); Clique-sum; Discrete mathematics; Graph; Computer science; Physics","score_opus":0.017154063795545682,"score_gpt":0.28502763383726015,"score_spread":0.26787357004171447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500859847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8309754,0.0010496821,0.10919986,0.00068141817,0.00007929463,0.000071934526,0.00044551175,0.0005355776,0.056961395],"genre_scores_gemma":[0.9672769,0.00048987655,0.024775464,0.00016803226,0.000038436036,0.000083060404,0.00074113725,0.000091776805,0.006335418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975127,0.000041077936,0.000010510221,0.00007067748,0.00007734316,0.00004908477],"domain_scores_gemma":[0.9988772,0.00041862065,0.00018717302,0.00012039223,0.00014390619,0.00025263432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024885047,0.00046211967,0.00025157363,0.0015392482,0.0009850187,0.0011298372,0.00100506,0.00054970366,0.0038447056],"category_scores_gemma":[0.0019692145,0.00042637816,0.0003211774,0.0007682029,0.0012317266,0.0014294521,0.0012545437,0.0009988396,0.00028930508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021010252,0.00008573916,0.004500921,0.00031230995,0.000052394502,0.002237321,0.0013975499,0.016038025,0.027956083,0.9168238,0.00427741,0.026108276],"study_design_scores_gemma":[0.00012315344,0.00019832418,0.0049894634,0.00014484282,0.0001225107,0.0059869196,0.0011094916,0.06907043,0.019156158,0.8579569,0.041029852,0.000111950096],"about_ca_topic_score_codex":0.0003696941,"about_ca_topic_score_gemma":0.00069758354,"teacher_disagreement_score":0.0038447056,"about_ca_system_score_codex":0.0007198186,"about_ca_system_score_gemma":0.00026990418,"threshold_uncertainty_score":0.012861848},"labels":[],"label_agreement":null},{"id":"W1500986313","doi":"10.46298/dmtcs.574","title":"Adaptive Identification of Sets of Vertices in Graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Identification (biology); Hamming distance; Combinatorics; Computer science; Discrete mathematics; Mathematics; Metric dimension; Chordal graph; Graph; 1-planar graph","score_opus":0.025401469451309618,"score_gpt":0.31525980717988045,"score_spread":0.28985833772857084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500986313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0781604,0.00023335879,0.9146781,0.0003380644,0.00007773112,0.000077071505,0.00015479451,0.00040095273,0.005879485],"genre_scores_gemma":[0.57864594,0.00047046467,0.40971774,0.00029547617,0.000112780544,0.00023088665,0.00045240475,0.00027957998,0.009794714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978795,0.00062715536,0.00013815457,0.0007341853,0.00042226582,0.00019877135],"domain_scores_gemma":[0.99316484,0.0035693287,0.00063996733,0.0016888654,0.00061985006,0.0003172715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013671195,0.0006849878,0.0009061823,0.002465716,0.001385726,0.0025293315,0.0018140449,0.0012341246,0.0038135557],"category_scores_gemma":[0.009137222,0.00068842527,0.0011473425,0.0018334623,0.0033612684,0.0054511563,0.0028544283,0.0024529977,0.0008105418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019395401,0.000070451046,0.0023200165,0.00018751253,0.000052043095,0.0003039107,0.00046727402,0.11210199,0.0076323105,0.81620365,0.0016423344,0.05882465],"study_design_scores_gemma":[0.000023761468,0.000045884317,0.0005545227,0.000035671,0.000029903631,0.00029166587,0.00022838642,0.24730581,0.005117814,0.7397023,0.006627161,0.00003711586],"about_ca_topic_score_codex":0.0012201982,"about_ca_topic_score_gemma":0.0013768558,"teacher_disagreement_score":0.0038135557,"about_ca_system_score_codex":0.0014957022,"about_ca_system_score_gemma":0.000777818,"threshold_uncertainty_score":0.012757659},"labels":[],"label_agreement":null},{"id":"W1501033600","doi":"","title":"Some Structural Properties of a Least Central Subtree of a Tree","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Cardinality (data modeling); Tree (set theory); Mathematics; Graph; Set (abstract data type); Discrete mathematics; Computer science; Data mining","score_opus":0.05119654889255751,"score_gpt":0.3449830083518981,"score_spread":0.29378645945934057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501033600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7539953,0.0008675192,0.22408468,0.0008591139,0.00004332432,0.00008138416,0.00044618428,0.00020183247,0.01942064],"genre_scores_gemma":[0.9108489,0.00040636712,0.08331102,0.00012545305,0.00012451167,0.000082709084,0.000775903,0.00014575658,0.004179279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943525,0.00012294186,0.000036516365,0.00014475334,0.00016700875,0.0000935486],"domain_scores_gemma":[0.99644035,0.0016973853,0.0006596675,0.0003328862,0.0003956403,0.00047412133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000956401,0.00022568302,0.00059845025,0.0012202256,0.0015873323,0.0019620182,0.0007688844,0.0008915395,0.0032282453],"category_scores_gemma":[0.004373435,0.00042577583,0.00060040306,0.0014741591,0.0024098814,0.0028873135,0.0013622994,0.0011174653,0.00049564766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019458776,0.000095295225,0.004203733,0.00022311127,0.000023494236,0.0007435664,0.001716229,0.010690988,0.02246163,0.93228114,0.0021335443,0.02523263],"study_design_scores_gemma":[0.000061000977,0.00014793756,0.0028256522,0.00005403459,0.000037655478,0.0010507941,0.001034932,0.053674836,0.008498638,0.922882,0.009695185,0.000037323447],"about_ca_topic_score_codex":0.00073690974,"about_ca_topic_score_gemma":0.0009849289,"teacher_disagreement_score":0.0032282453,"about_ca_system_score_codex":0.0008715205,"about_ca_system_score_gemma":0.00060488895,"threshold_uncertainty_score":0.010799587},"labels":[],"label_agreement":null},{"id":"W1502166895","doi":"10.46298/dmtcs.387","title":"Complexity results on graphs with few cliques","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chordal graph; Split graph; Discrete mathematics; Clique graph; Vertex cover; Clique-sum; Indifference graph; Cograph; Vertex (graph theory); Clique problem; Block graph; Time complexity; Treewidth; Pathwidth; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.03449243138924327,"score_gpt":0.3270042868670117,"score_spread":0.2925118554777685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502166895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2884974,0.015699835,0.5503227,0.019627945,0.00052757486,0.00046156498,0.00560249,0.0017466939,0.11751381],"genre_scores_gemma":[0.83850133,0.007654346,0.12226771,0.0018959708,0.0020883852,0.00055554917,0.005973315,0.00079823274,0.020265158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961817,0.0008807333,0.00016955803,0.00092995015,0.0012067254,0.00063122815],"domain_scores_gemma":[0.9607934,0.03177384,0.0017013876,0.0034609905,0.0011713747,0.0010990339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00196497,0.001427969,0.00183868,0.0027763783,0.0019967773,0.0049209925,0.0028383378,0.0018059718,0.012261228],"category_scores_gemma":[0.015487732,0.0009060554,0.0021066875,0.004319302,0.0033657728,0.011443162,0.0032068992,0.0045685354,0.0011178363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061984005,0.00049087073,0.00566614,0.0014496737,0.00030510584,0.00034038382,0.0008994428,0.17527036,0.0054245284,0.71309733,0.033926997,0.06250943],"study_design_scores_gemma":[0.00007168805,0.000038895392,0.0018126471,0.000053379612,0.000067238994,0.00023177231,0.000132565,0.14700508,0.00086718524,0.84172297,0.007967737,0.000028763316],"about_ca_topic_score_codex":0.004427579,"about_ca_topic_score_gemma":0.004026035,"teacher_disagreement_score":0.012261228,"about_ca_system_score_codex":0.004281332,"about_ca_system_score_gemma":0.0015881781,"threshold_uncertainty_score":0.04101795},"labels":[],"label_agreement":null},{"id":"W1506582321","doi":"10.1002/jgt.21667","title":"Forbidden Induced Subgraphs for Toughness","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Line graph; Discrete mathematics; Distance-hereditary graph; Voltage graph; Cubic graph; Symmetric graph","score_opus":0.0403595477434291,"score_gpt":0.3240029276503742,"score_spread":0.2836433799069451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506582321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6369666,0.0021131225,0.33679384,0.002034626,0.00014849612,0.00017881398,0.0021690966,0.000442514,0.019152896],"genre_scores_gemma":[0.9516909,0.000584384,0.04253423,0.00029016752,0.00030756043,0.0002818215,0.0014791113,0.00009847402,0.0027333894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818426,0.00040312766,0.00011927095,0.0007038323,0.00037513828,0.00021428886],"domain_scores_gemma":[0.982485,0.011503677,0.0027161483,0.001403534,0.00081154396,0.001080128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551265,0.00082295475,0.00095794996,0.0031659491,0.0014900764,0.002115483,0.0016970573,0.0012735892,0.006464718],"category_scores_gemma":[0.013147181,0.00063662365,0.001307347,0.002099953,0.003176899,0.005024329,0.0024556967,0.002370254,0.00037322947],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043351168,0.00019700076,0.012006167,0.0006498382,0.00020977663,0.00082641846,0.0019566398,0.07267633,0.011401236,0.85865045,0.0067443587,0.034248143],"study_design_scores_gemma":[0.000036570065,0.00008334154,0.0035993024,0.000067166366,0.000055626933,0.0007925317,0.00029874346,0.101216815,0.0018836543,0.88819903,0.0037127808,0.000054513817],"about_ca_topic_score_codex":0.0008748661,"about_ca_topic_score_gemma":0.00054717826,"teacher_disagreement_score":0.006464718,"about_ca_system_score_codex":0.0010593482,"about_ca_system_score_gemma":0.0004149094,"threshold_uncertainty_score":0.021626651},"labels":[],"label_agreement":null},{"id":"W150683057","doi":"","title":"On line graphs which are weakly maximal clique irreducible.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Combinatorics; Line (geometry); Clique-sum; Clique number; Chordal graph; Discrete mathematics; Graph; 1-planar graph; Geometry","score_opus":0.021942974181400923,"score_gpt":0.29408166444763506,"score_spread":0.27213869026623416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150683057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62029994,0.00079205143,0.18989685,0.0028183148,0.000224988,0.00016767593,0.0023164845,0.0014307287,0.18205297],"genre_scores_gemma":[0.93594944,0.00067300035,0.026615608,0.0004944136,0.00023777717,0.00009752159,0.0028162256,0.0003057548,0.032810163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908197,0.0002803793,0.000032681102,0.00018229445,0.000167922,0.00025483363],"domain_scores_gemma":[0.9946865,0.0030382657,0.0008473621,0.00052066316,0.0003967832,0.0005104366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065596856,0.00055470905,0.0005834144,0.0016080606,0.0017922001,0.0023833117,0.00068333437,0.0011592822,0.015242894],"category_scores_gemma":[0.0050532883,0.0005804257,0.0006698118,0.0014572116,0.002078619,0.004482308,0.0018829816,0.001887782,0.0018242464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025370286,0.00009029789,0.0019446044,0.0001575442,0.000031107673,0.00049185724,0.0005987353,0.0046339277,0.0036189097,0.96198565,0.010665557,0.015528168],"study_design_scores_gemma":[0.00003289649,0.00002724124,0.0011969417,0.00004686686,0.000025858626,0.00035692344,0.00035380587,0.01122922,0.0015985752,0.9770279,0.008088582,0.000015272648],"about_ca_topic_score_codex":0.00092670135,"about_ca_topic_score_gemma":0.0018273557,"teacher_disagreement_score":0.015242894,"about_ca_system_score_codex":0.00088952517,"about_ca_system_score_gemma":0.00042565807,"threshold_uncertainty_score":0.050992608},"labels":[],"label_agreement":null},{"id":"W1507564261","doi":"10.1007/978-3-540-39890-5_11","title":"A Simple Linear Time LexBFS Cograph Recognition Algorithm","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Lexicographical order; Simple (philosophy); Algorithm; Complement (music); Cograph; Time complexity; Graph; Theoretical computer science; Combinatorics; Mathematics; Pathwidth; Line graph","score_opus":0.023456181181346864,"score_gpt":0.27916664467076174,"score_spread":0.2557104634894149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507564261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06439797,0.00062585133,0.8350625,0.0011655414,0.0005567802,0.0005699594,0.00434048,0.051692694,0.041588247],"genre_scores_gemma":[0.14704183,0.00019716755,0.8060641,0.0003871294,0.00010750548,0.00025831832,0.009041213,0.0014976761,0.035404976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994548,0.000048988946,0.00004377363,0.00019752416,0.00016182064,0.00009314546],"domain_scores_gemma":[0.9995086,0.00009308441,0.00002646926,0.00018376586,0.00014162822,0.00004640855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002471782,0.00104511,0.0010275387,0.0011869498,0.0010383175,0.0017457281,0.0020849977,0.0011222262,0.031070722],"category_scores_gemma":[0.0009565399,0.00054015033,0.0009975039,0.0021108817,0.0005493218,0.0031577593,0.0016849458,0.0010945909,0.013461207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004789237,0.0002761251,0.0005936904,0.0002839344,0.000036579284,0.00013572915,0.00009983083,0.007339915,0.025565414,0.017359635,0.054274008,0.8935562],"study_design_scores_gemma":[0.0006969895,0.00061912363,0.0030052229,0.00015435534,0.00022113438,0.0012034547,0.0007136801,0.5252719,0.10330668,0.1898161,0.1748224,0.00016903055],"about_ca_topic_score_codex":0.0059779496,"about_ca_topic_score_gemma":0.011639696,"teacher_disagreement_score":0.031070722,"about_ca_system_score_codex":0.0012494749,"about_ca_system_score_gemma":0.002157384,"threshold_uncertainty_score":0.10394186},"labels":[],"label_agreement":null},{"id":"W1508755082","doi":"10.1006/jctb.2000.2009","title":"High-Girth Graphs Avoiding a Minor are Nearly Bipartite","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Triangle-free graph; Odd graph; Discrete mathematics; Bipartite graph; Homomorphism; 1-planar graph; Planar graph; Girth (graph theory); Foster graph; Graph homomorphism; Graph power; Graph minor; Graph; Line graph","score_opus":0.015223306658726087,"score_gpt":0.2601376903989754,"score_spread":0.2449143837402493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508755082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9186245,0.0002002125,0.051624503,0.0006855307,0.000097506,0.00010019702,0.0008347814,0.00061712705,0.027215585],"genre_scores_gemma":[0.9677865,0.00023116611,0.020548016,0.0004023945,0.00009651346,0.00010235557,0.00125104,0.0002302807,0.009351637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994611,0.00011988854,0.000031640764,0.00012961854,0.0001232752,0.00013441728],"domain_scores_gemma":[0.9943878,0.0025422839,0.0010300808,0.0008046329,0.0004644005,0.00077066023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050013105,0.00061336806,0.0008890599,0.001195524,0.0022248365,0.002550757,0.0009657191,0.001290922,0.0066453833],"category_scores_gemma":[0.0042073214,0.0011369414,0.0007667975,0.0014926688,0.0013913917,0.0024440098,0.0014650277,0.0014654895,0.0013305899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019026654,0.0004387398,0.016557407,0.00059695536,0.00022149565,0.002209402,0.0023586424,0.012787049,0.07625957,0.82699513,0.01478997,0.04488302],"study_design_scores_gemma":[0.00012316632,0.00019564848,0.0075785145,0.00003937556,0.00011653405,0.0028917287,0.0008640454,0.023739183,0.011645112,0.94569206,0.007062114,0.000052512438],"about_ca_topic_score_codex":0.0005464593,"about_ca_topic_score_gemma":0.0010487005,"teacher_disagreement_score":0.0066453833,"about_ca_system_score_codex":0.00045554838,"about_ca_system_score_gemma":0.00038795904,"threshold_uncertainty_score":0.022231042},"labels":[],"label_agreement":null},{"id":"W1509672730","doi":"10.37236/635","title":"Toughness of $K_{a,t}$-Minor-free Graphs","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Simon Fraser University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Omega; Graph; Discrete mathematics; Physics","score_opus":0.020393673663520264,"score_gpt":0.25172823739228267,"score_spread":0.2313345637287624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509672730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.917812,0.00036631545,0.061189555,0.00077175844,0.00006610851,0.00011561008,0.0013389119,0.00040269614,0.017937103],"genre_scores_gemma":[0.9738981,0.0002660206,0.018080086,0.00017333003,0.000054581145,0.0001410154,0.0013157167,0.000099263096,0.005971896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953556,0.000057626985,0.000031204632,0.00015078175,0.00010726323,0.000117617805],"domain_scores_gemma":[0.99669015,0.0011527076,0.00068675843,0.00031956096,0.00028828875,0.0008625752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038092438,0.00073739974,0.0005466476,0.0014818917,0.0013599473,0.0014320633,0.0012873417,0.00061268045,0.006666566],"category_scores_gemma":[0.002837277,0.0005378718,0.00092691806,0.0008771327,0.0014108858,0.001956826,0.0017794203,0.0011462125,0.0006924889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022928892,0.0004582893,0.020477975,0.0011980836,0.00039442384,0.0028071639,0.00303691,0.1266422,0.12388816,0.63236904,0.018598955,0.067836046],"study_design_scores_gemma":[0.00015882743,0.00042772677,0.02048513,0.00013961559,0.0001996035,0.002653936,0.0011345278,0.19845062,0.023775961,0.73387825,0.01853398,0.00016180887],"about_ca_topic_score_codex":0.0023050022,"about_ca_topic_score_gemma":0.002324102,"teacher_disagreement_score":0.006666566,"about_ca_system_score_codex":0.0007977848,"about_ca_system_score_gemma":0.00044246097,"threshold_uncertainty_score":0.022301912},"labels":[],"label_agreement":null},{"id":"W1509794588","doi":"10.5555/1496770.1496898","title":"A nearly linear time algorithm for the half integral parity disjoint paths packing problem","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Disjoint sets; Ackermann function; Mathematics; Time complexity; Parity (physics); Binary logarithm; Vertex (graph theory); Discrete mathematics; Approximation algorithm; Inverse; Algorithm; Graph; Physics","score_opus":0.01650779417379294,"score_gpt":0.2897351951554409,"score_spread":0.27322740098164794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509794588","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085743316,0.0012848484,0.8681496,0.0018254257,0.00030923914,0.000903468,0.0024706805,0.014289782,0.02502373],"genre_scores_gemma":[0.21868832,0.00048238027,0.765619,0.00057894987,0.00015153312,0.0007114295,0.0049481383,0.0011127578,0.0077073895],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793965,0.00030872546,0.00013646278,0.00074486225,0.00037050748,0.00049982936],"domain_scores_gemma":[0.99808586,0.00086469715,0.00015661173,0.000559263,0.00018621815,0.00014736618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008685606,0.0020934925,0.0019882254,0.0009984632,0.0013529564,0.0025012766,0.003468142,0.0021872688,0.016084444],"category_scores_gemma":[0.0034708919,0.00086564815,0.0012781682,0.0029069341,0.00072230655,0.0066381944,0.0027397168,0.0018340808,0.0045362543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023271495,0.0010771919,0.0022500462,0.0013849876,0.0002125075,0.00043380144,0.0006511575,0.174924,0.020471808,0.041575853,0.06266925,0.69202226],"study_design_scores_gemma":[0.0008801698,0.00047832538,0.00090721616,0.00006879738,0.000112083144,0.00059444027,0.0004001993,0.8623055,0.008416319,0.1040089,0.02175222,0.00007588092],"about_ca_topic_score_codex":0.0034675782,"about_ca_topic_score_gemma":0.0038870622,"teacher_disagreement_score":0.016084444,"about_ca_system_score_codex":0.001937021,"about_ca_system_score_gemma":0.0029091462,"threshold_uncertainty_score":0.053807795},"labels":[],"label_agreement":null},{"id":"W1509846055","doi":"10.1007/978-3-642-30347-0_9","title":"Conflict-Free Graph Orientations with Parity Constraints","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multigraph; Combinatorics; Disjoint sets; Vertex (graph theory); Parity (physics); Mixed graph; Computer science; Graph; Discrete mathematics; Mathematics; Line graph; Voltage graph; Physics","score_opus":0.028985400351798023,"score_gpt":0.28937606847839104,"score_spread":0.260390668126593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509846055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10810256,0.0010818873,0.61337507,0.0020307424,0.0008331098,0.00032682926,0.0013935515,0.0009625859,0.27189374],"genre_scores_gemma":[0.659346,0.0017169387,0.26366535,0.0006407244,0.0003594282,0.00054351235,0.0020185318,0.00087345095,0.07083605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992624,0.00015892733,0.000037920192,0.00013110737,0.00024489386,0.00016472157],"domain_scores_gemma":[0.99813986,0.0008129214,0.00015721672,0.00036650882,0.00031474137,0.00020875517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000781623,0.0009144694,0.0005461281,0.0009677159,0.0012987228,0.0022832148,0.0015731128,0.00094579475,0.014033833],"category_scores_gemma":[0.0036483728,0.0007548447,0.0007012662,0.0017018935,0.0017780369,0.0044321995,0.002117483,0.0029779293,0.0030410097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098055374,0.000056786204,0.00021585118,0.000117670264,0.000010211097,0.00015192923,0.00024469104,0.0053190463,0.0022644978,0.9426757,0.007912159,0.040933453],"study_design_scores_gemma":[0.000022697595,0.000011607733,0.000067356275,0.00002373168,0.000010074552,0.00011164905,0.00008741565,0.0069019906,0.0013768148,0.9800086,0.011365468,0.000012634511],"about_ca_topic_score_codex":0.0013011366,"about_ca_topic_score_gemma":0.0014959851,"teacher_disagreement_score":0.014033833,"about_ca_system_score_codex":0.00074854144,"about_ca_system_score_gemma":0.0011897474,"threshold_uncertainty_score":0.046947837},"labels":[],"label_agreement":null},{"id":"W1510083871","doi":"10.1007/978-3-642-12200-2_4","title":"Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kernelization; Dominating set; Connected dominating set; Combinatorics; Planar graph; Planar; Mathematics; Limit (mathematics); Graph; Set (abstract data type); Reduction (mathematics); Computer science; Kernel (algebra); Discrete mathematics; Vertex (graph theory)","score_opus":0.03497057844501919,"score_gpt":0.30016189911650626,"score_spread":0.2651913206714871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510083871","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4971311,0.0033176932,0.35894483,0.0071851285,0.00043518373,0.000146233,0.0005527905,0.0008592624,0.13142784],"genre_scores_gemma":[0.9566785,0.000935331,0.0246703,0.00046881847,0.00023287814,0.00014954017,0.00032384897,0.0002546174,0.016286207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930954,0.00010623734,0.000038003294,0.00024780649,0.0001686998,0.00012968037],"domain_scores_gemma":[0.9946378,0.0030420166,0.00042733733,0.0006290546,0.0005644025,0.00069944205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087538763,0.0005010778,0.0015833963,0.0011008369,0.001700117,0.0028990004,0.0017242497,0.001419902,0.004063739],"category_scores_gemma":[0.0071292985,0.00066651334,0.0010203258,0.0011928088,0.0030614152,0.008450707,0.0026931316,0.0037392408,0.00048677923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013877283,0.0000586713,0.0007036907,0.00025549287,0.000037238482,0.0002121007,0.00041092528,0.0072883065,0.0031181527,0.96780807,0.004907576,0.015060983],"study_design_scores_gemma":[0.000022507973,0.000052045532,0.0004811903,0.000024856103,0.00003322319,0.00054417533,0.00020544085,0.033108067,0.0017135327,0.95982724,0.0039619915,0.000025712761],"about_ca_topic_score_codex":0.000762662,"about_ca_topic_score_gemma":0.0006300951,"teacher_disagreement_score":0.004063739,"about_ca_system_score_codex":0.0014479128,"about_ca_system_score_gemma":0.000494768,"threshold_uncertainty_score":0.013594508},"labels":[],"label_agreement":null},{"id":"W1512105312","doi":"10.1016/j.disc.2015.12.030","title":"Bounds on the maximum number of minimum dominating sets","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation of Sri Lanka","keywords":"Mathematics; Combinatorics; Lexicographical order; Domination analysis; Dominating set; Graph; Discrete mathematics; Upper and lower bounds; Vertex (graph theory)","score_opus":0.028074880962659372,"score_gpt":0.3196065664226326,"score_spread":0.2915316854599732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512105312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0920998,0.03206511,0.66212016,0.028085865,0.0026862125,0.0003168643,0.005035794,0.00175694,0.1758333],"genre_scores_gemma":[0.6943297,0.019636625,0.24308829,0.004779112,0.0053403135,0.001382425,0.003976244,0.0017610551,0.02570631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99246174,0.0022296945,0.00035758544,0.0016501691,0.00206549,0.0012354382],"domain_scores_gemma":[0.8800413,0.10188023,0.0029430427,0.0061487476,0.0043230955,0.004663676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010532898,0.005114261,0.004089666,0.0061754007,0.0028262604,0.009674771,0.009147403,0.0044133198,0.014086668],"category_scores_gemma":[0.07045722,0.0025014326,0.0029623061,0.005838804,0.005309346,0.017864702,0.008797157,0.011080575,0.0029782522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003013529,0.0005532465,0.004072684,0.0038749762,0.00060856214,0.00042392488,0.00090478593,0.17569263,0.017782792,0.6438011,0.04288248,0.10638924],"study_design_scores_gemma":[0.00017764731,0.00023957071,0.0021068805,0.00062441453,0.00029978974,0.00061505643,0.00018582918,0.21160552,0.005209587,0.764325,0.014503537,0.0001071729],"about_ca_topic_score_codex":0.00087713014,"about_ca_topic_score_gemma":0.00209819,"teacher_disagreement_score":0.014086668,"about_ca_system_score_codex":0.0062486986,"about_ca_system_score_gemma":0.0022529769,"threshold_uncertainty_score":0.055703998},"labels":[],"label_agreement":null},{"id":"W1512371449","doi":"10.1016/j.jctb.2015.11.002","title":"On Rota's Conjecture and nested separations in matroids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Conjecture; Combinatorics; Mathematics; Nested set model; Computer science; Programming language","score_opus":0.01714138966048585,"score_gpt":0.2926170667063513,"score_spread":0.27547567704586545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512371449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4639081,0.0029876938,0.19714053,0.03441551,0.0018670069,0.00016556893,0.0010963029,0.0009701176,0.2974492],"genre_scores_gemma":[0.92580765,0.0018714591,0.039153453,0.0031018846,0.0016760315,0.00015529618,0.0011619799,0.00026554937,0.026806692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972977,0.00093556405,0.00014032824,0.0006004009,0.000571823,0.00045425395],"domain_scores_gemma":[0.9871349,0.0083653685,0.0009214898,0.0018262542,0.0007909955,0.00096099864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027699012,0.00086286466,0.002295079,0.0016050822,0.0049104337,0.0058688065,0.0028176794,0.004623383,0.016963812],"category_scores_gemma":[0.016581494,0.0013118571,0.0019902247,0.002658411,0.008503713,0.01735581,0.0046748393,0.007360876,0.0022089856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008092463,0.000051419003,0.00041425167,0.00006953469,0.000010139052,0.000077499826,0.00034645325,0.0015864382,0.00031967534,0.988639,0.0042903735,0.0041142423],"study_design_scores_gemma":[0.000019988953,0.000009316734,0.000118400094,0.000014193783,0.000004430843,0.000052833457,0.00013201307,0.002333596,0.000070240705,0.9956008,0.0016357313,0.000008405729],"about_ca_topic_score_codex":0.0022446977,"about_ca_topic_score_gemma":0.0025975793,"teacher_disagreement_score":0.016963812,"about_ca_system_score_codex":0.0017371427,"about_ca_system_score_gemma":0.0011354446,"threshold_uncertainty_score":0.056749582},"labels":[],"label_agreement":null},{"id":"W1513274608","doi":"10.1007/s00453-016-0159-2","title":"On the Parameterized Complexity of Reconfiguration Problems","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada); University of Waterloo","funders":"","keywords":"Control reconfiguration; Parameterized complexity; Vertex cover; Vertex (graph theory); Combinatorics; Kernelization; Mathematics; Theory of computation; Bounded function; Maximization; Sequence (biology); Discrete mathematics; Graph; Computer science; Algorithm; Mathematical optimization","score_opus":0.06819916082681735,"score_gpt":0.28743081139528687,"score_spread":0.21923165056846952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513274608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31481078,0.0065338574,0.5192821,0.027709136,0.0008843159,0.00046464644,0.0033727593,0.0016650289,0.12527734],"genre_scores_gemma":[0.8519376,0.0049231555,0.10861218,0.0019484507,0.001673054,0.0007751768,0.004767883,0.0013271322,0.024035284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476457,0.0020085264,0.00024782232,0.0010102697,0.0010827532,0.0008859193],"domain_scores_gemma":[0.94529593,0.04646668,0.0020471392,0.003619308,0.0011823834,0.0013886165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003651241,0.0023318178,0.0027526477,0.0022759843,0.002348251,0.007620481,0.0049802326,0.0036572756,0.025120707],"category_scores_gemma":[0.04089291,0.0014711602,0.0028709783,0.004893979,0.0048533464,0.021961251,0.005045634,0.0096840905,0.0019063135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007482647,0.0005016816,0.0036517296,0.000771584,0.00021005716,0.00026835644,0.00065051793,0.19189253,0.0021445577,0.7103118,0.025041092,0.063807815],"study_design_scores_gemma":[0.000115048395,0.000043069358,0.0006189328,0.00004901499,0.000057883073,0.00009144011,0.00013230514,0.15007652,0.00036465042,0.84539425,0.003032897,0.000024054698],"about_ca_topic_score_codex":0.0039025743,"about_ca_topic_score_gemma":0.00413229,"teacher_disagreement_score":0.025120707,"about_ca_system_score_codex":0.0056204475,"about_ca_system_score_gemma":0.0032229635,"threshold_uncertainty_score":0.084037125},"labels":[],"label_agreement":null},{"id":"W1514238746","doi":"10.1007/978-3-540-68552-4_7","title":"Computing Branch Decomposition of Large Planar Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar graph; Time complexity; Pathwidth; Subroutine; Mathematics; Planar; Book embedding; Algorithm; Combinatorics; Modular decomposition; Graph; Discrete mathematics; Computer science; Line graph","score_opus":0.016986563573989203,"score_gpt":0.29362713107242466,"score_spread":0.27664056749843546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514238746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39844677,0.0019489262,0.54046315,0.0016630384,0.00017143789,0.00030404294,0.0072613386,0.010746259,0.038995042],"genre_scores_gemma":[0.50298214,0.001122674,0.45497462,0.00030186836,0.00017192333,0.00021392551,0.02169875,0.0021621953,0.016371952],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995229,0.000070584705,0.00002242098,0.00013532456,0.00014025735,0.000108479064],"domain_scores_gemma":[0.99809617,0.0010132197,0.000115301176,0.0003284205,0.000258505,0.0001883311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000545917,0.001605274,0.0016051396,0.0022081607,0.0009540607,0.0030494872,0.0019904578,0.0012998749,0.018107198],"category_scores_gemma":[0.0039617056,0.0010353817,0.0011758578,0.0031423313,0.0008189112,0.00505709,0.0023078772,0.0022726918,0.0044780844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016675611,0.00047735052,0.008629905,0.0015316907,0.00021880955,0.0005003841,0.0009808356,0.19744684,0.036928855,0.087061524,0.09340935,0.5711469],"study_design_scores_gemma":[0.0001842736,0.00013463116,0.0018875843,0.00010359125,0.00010172713,0.00020625761,0.0005199768,0.7086565,0.009121253,0.26805946,0.01099879,0.00002602743],"about_ca_topic_score_codex":0.0026209138,"about_ca_topic_score_gemma":0.0080645885,"teacher_disagreement_score":0.018107198,"about_ca_system_score_codex":0.0010864618,"about_ca_system_score_gemma":0.0010058298,"threshold_uncertainty_score":0.06057465},"labels":[],"label_agreement":null},{"id":"W1516152095","doi":"10.1007/s101079900110","title":"Restricted 2-factor polytopes","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Travelling salesman problem; Facet (psychology); Uniform k 21 polytope; Birkhoff polytope; Graph; Discrete mathematics; Complete graph; Mathematical optimization; Geometry; Convex optimization; Regular polygon","score_opus":0.029632310202253837,"score_gpt":0.30495063517821547,"score_spread":0.27531832497596165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516152095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19670601,0.0014618954,0.5174134,0.0020336611,0.00043920524,0.00025897397,0.0031818792,0.0011139293,0.27739117],"genre_scores_gemma":[0.7130786,0.002109334,0.13829373,0.000920359,0.0004999812,0.00064466166,0.0044990587,0.001270352,0.13868389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992429,0.0001440553,0.000032384585,0.00023801926,0.00017127232,0.00017132965],"domain_scores_gemma":[0.9989511,0.00044490575,0.00012285126,0.0002042163,0.0001078888,0.0001690241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048607765,0.0013392874,0.0012769306,0.0010619997,0.00081990944,0.0023093743,0.0014533154,0.0010018031,0.055557568],"category_scores_gemma":[0.0022983428,0.00071417843,0.001081975,0.0014610062,0.0012287169,0.0040266295,0.0019621674,0.0035550387,0.006349626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027399688,0.00018017457,0.00037831583,0.00033628696,0.00005688796,0.00016858465,0.00024530882,0.01655587,0.0035216317,0.9109539,0.020304775,0.04702443],"study_design_scores_gemma":[0.000099042976,0.00008276265,0.00045556683,0.000060631646,0.000032919957,0.00040312417,0.00017474264,0.027878344,0.002167069,0.92987996,0.038728278,0.000037408718],"about_ca_topic_score_codex":0.00088556315,"about_ca_topic_score_gemma":0.0010021543,"teacher_disagreement_score":0.055557568,"about_ca_system_score_codex":0.0005847355,"about_ca_system_score_gemma":0.00029262365,"threshold_uncertainty_score":0.18585855},"labels":[],"label_agreement":null},{"id":"W1516725342","doi":"","title":"Constructing Incremental Sequences in Graphs","year":2006,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Sequence (biology); Approximation algorithm; Group (periodic table); Constraint (computer-aided design); Graph; Discrete mathematics; Geometry","score_opus":0.034354179743035174,"score_gpt":0.31869436152871883,"score_spread":0.28434018178568365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516725342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18155828,0.00040767645,0.8095922,0.0004930773,0.00008096584,0.00032973773,0.0006082413,0.0020968872,0.0048329905],"genre_scores_gemma":[0.31339648,0.00045033518,0.6788543,0.00015818067,0.000068132,0.00035059045,0.0020409566,0.00032519,0.004355816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989766,0.00026651996,0.0000814792,0.00028261187,0.00022563348,0.00016719992],"domain_scores_gemma":[0.99599034,0.0019844584,0.00044364214,0.0009037952,0.00038951475,0.00028819244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009865101,0.0010292464,0.0010819507,0.0015451772,0.0009592683,0.001170636,0.0020998248,0.001329327,0.004305379],"category_scores_gemma":[0.007951561,0.0007811934,0.0010274565,0.0021407572,0.0009886859,0.0049931956,0.0019575562,0.0012803869,0.0011741264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008211194,0.0003858126,0.0041464153,0.0008268562,0.00009434775,0.0004888495,0.0009911526,0.4692945,0.023238089,0.17323852,0.010806136,0.31566823],"study_design_scores_gemma":[0.00008169978,0.00024849203,0.00048340263,0.000065014545,0.000051237657,0.0003183259,0.00027828963,0.72361785,0.015234034,0.24928668,0.010299282,0.000035779813],"about_ca_topic_score_codex":0.0015912941,"about_ca_topic_score_gemma":0.0021199186,"teacher_disagreement_score":0.004305379,"about_ca_system_score_codex":0.001032806,"about_ca_system_score_gemma":0.0010982188,"threshold_uncertainty_score":0.014402986},"labels":[],"label_agreement":null},{"id":"W1517569912","doi":"10.1017/cbo9781139087223.008","title":"Graph minors: generalizing Kuratowski's theorem","year":2009,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Robertson–Seymour theorem; Combinatorics; Graph minor; Mathematics; Discrete mathematics; Minor (academic); Outerplanar graph; 1-planar graph; Graph; Pathwidth; Line graph; Voltage graph; Political science; Law","score_opus":0.02857034180329234,"score_gpt":0.2277575115081462,"score_spread":0.19918716970485384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517569912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09068539,0.008841574,0.5174185,0.008392277,0.0016260144,0.00012741066,0.0006061277,0.0015731866,0.37072954],"genre_scores_gemma":[0.7480321,0.0074868645,0.12505619,0.0023499092,0.001963371,0.0002500236,0.0007515446,0.0007969767,0.11331297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969006,0.000048943504,0.000013567615,0.00012159004,0.000090163245,0.00003560356],"domain_scores_gemma":[0.99953926,0.00018409426,0.000030080517,0.00011877361,0.00007956308,0.000048242906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047451805,0.00052052323,0.00046720752,0.0015664541,0.00092486397,0.0015321953,0.0008229363,0.00071787206,0.0035654488],"category_scores_gemma":[0.00142633,0.00032403,0.00080322364,0.0009141376,0.003436255,0.0055588824,0.0023305935,0.0020147073,0.0010766402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010590525,0.000006434686,0.00009959477,0.000035443703,0.000003530971,0.00006918315,0.000350844,0.00044422058,0.00089412933,0.9849119,0.003122649,0.010051529],"study_design_scores_gemma":[0.000007013183,0.000009480406,0.00019531153,0.000010275252,0.0000057989932,0.00014864639,0.00007596171,0.0012631703,0.0004386646,0.95674795,0.0410904,0.0000073945307],"about_ca_topic_score_codex":0.0019616308,"about_ca_topic_score_gemma":0.0018030334,"teacher_disagreement_score":0.0035654488,"about_ca_system_score_codex":0.0011061518,"about_ca_system_score_gemma":0.00046059626,"threshold_uncertainty_score":0.011927664},"labels":[],"label_agreement":null},{"id":"W1519450118","doi":"10.1007/11604686_10","title":"Roman Domination over Some Graph Classes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Vertex (graph theory); Domination analysis; Graph; Interval graph; Minimum weight; Mathematics; Time complexity; Dominating set; Discrete mathematics; Line graph; Pathwidth","score_opus":0.016729671139819293,"score_gpt":0.28423662359484875,"score_spread":0.2675069524550295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519450118","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13103513,0.0011135124,0.043746002,0.0017815162,0.000256075,0.00006647324,0.0003421023,0.00022340204,0.82143575],"genre_scores_gemma":[0.78658646,0.0014463315,0.017022261,0.00056485715,0.00047160892,0.00013522974,0.00050274545,0.0003335188,0.19293696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919695,0.00020238703,0.000033268443,0.00016117861,0.0002361836,0.0001700808],"domain_scores_gemma":[0.9988821,0.00057315576,0.00009679954,0.00012474252,0.0001661814,0.00015691809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006922127,0.00047952618,0.0007939281,0.0015572683,0.0027833672,0.0029242658,0.0007227131,0.0006165095,0.014289118],"category_scores_gemma":[0.0019988995,0.00043552864,0.0007253115,0.001961936,0.0025965045,0.0036070135,0.0014279683,0.0032149116,0.0017312511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017893013,0.000007800117,0.00007108914,0.000020119496,0.000003820131,0.000034405388,0.00017716535,0.00023092839,0.00026853103,0.9919802,0.002332186,0.0048558214],"study_design_scores_gemma":[0.000015505799,0.000008631972,0.00020697876,0.000015289617,0.000009657353,0.00015303513,0.000083000334,0.0014003722,0.00039382314,0.97478455,0.022921728,0.0000074508257],"about_ca_topic_score_codex":0.0013384612,"about_ca_topic_score_gemma":0.0017118956,"teacher_disagreement_score":0.014289118,"about_ca_system_score_codex":0.0016911252,"about_ca_system_score_gemma":0.000560753,"threshold_uncertainty_score":0.047801852},"labels":[],"label_agreement":null},{"id":"W1520749929","doi":"10.46298/dmtcs.550","title":"On the Book Thickness of k-Trees","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Tree (set theory); Combinatorics; Degree (music); Decomposition; Discrete mathematics; Physics; Ecology; Biology","score_opus":0.02964475841660093,"score_gpt":0.28619845014396084,"score_spread":0.2565536917273599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520749929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5116165,0.009907889,0.3399754,0.010084067,0.00057487236,0.00018618503,0.002285735,0.0022377367,0.1231316],"genre_scores_gemma":[0.78435695,0.005522164,0.16231312,0.0012959407,0.00072131614,0.00019855122,0.0021157032,0.001922173,0.041554056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980065,0.0005249175,0.00011575309,0.00046011465,0.00049860793,0.00039406525],"domain_scores_gemma":[0.98137707,0.011719451,0.0013151129,0.0033667677,0.0010955324,0.0011261337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020715138,0.0011616439,0.0015008986,0.0016164745,0.0017541877,0.004064133,0.0030750292,0.0016967756,0.012739284],"category_scores_gemma":[0.019988796,0.0016513412,0.000889323,0.0032769234,0.0025964454,0.017487258,0.004197374,0.0038188307,0.0037999754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020285747,0.00028023458,0.012744504,0.0008863641,0.000242033,0.0006091066,0.001993034,0.15256833,0.022981385,0.5440187,0.046781264,0.21486655],"study_design_scores_gemma":[0.00013958525,0.00021839669,0.0039125257,0.00021413859,0.00019069252,0.0009370492,0.0007040864,0.1675955,0.014337199,0.76690054,0.044749036,0.000101255566],"about_ca_topic_score_codex":0.0014713577,"about_ca_topic_score_gemma":0.0015928084,"teacher_disagreement_score":0.012739284,"about_ca_system_score_codex":0.0019585867,"about_ca_system_score_gemma":0.00066786323,"threshold_uncertainty_score":0.042617083},"labels":[],"label_agreement":null},{"id":"W1521918479","doi":"10.37236/976","title":"Matrix Partitions with Finitely Many Obstructions","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Matrix (chemical analysis); Diagonal; Characterization (materials science); Induced subgraph; Graph; Finite set; Block matrix; Discrete mathematics; Diagonal matrix; Eigenvalues and eigenvectors","score_opus":0.010567544475568983,"score_gpt":0.28278040714190844,"score_spread":0.2722128626663395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521918479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6981134,0.00015797022,0.27428275,0.0010881168,0.000080681144,0.00015336808,0.000615438,0.000701205,0.024807109],"genre_scores_gemma":[0.9326602,0.00011843885,0.057780445,0.00016915919,0.00008220341,0.00022793507,0.0009213966,0.00015774289,0.007882427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840575,0.0003613481,0.00012416663,0.00039877725,0.0003821599,0.00032780223],"domain_scores_gemma":[0.9936579,0.0033861161,0.000856061,0.0011925655,0.00037281803,0.00053463207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076891476,0.00057702657,0.0006499791,0.00077242707,0.0015822516,0.0026225396,0.0009830086,0.0010638883,0.009876777],"category_scores_gemma":[0.0073931813,0.0004961643,0.0010571661,0.0010260943,0.002504753,0.0040793815,0.0024307983,0.0018261411,0.0009923758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028165293,0.00017463395,0.0020090847,0.00014819903,0.00003051815,0.00044468485,0.00075121416,0.020372666,0.008651974,0.9463913,0.0031693964,0.017574554],"study_design_scores_gemma":[0.00006323415,0.000080324186,0.00077288284,0.000021511893,0.00002355775,0.00047310864,0.000312492,0.07277243,0.0065141567,0.91416276,0.004759786,0.000043822616],"about_ca_topic_score_codex":0.00085424265,"about_ca_topic_score_gemma":0.0012649803,"teacher_disagreement_score":0.009876777,"about_ca_system_score_codex":0.0010077754,"about_ca_system_score_gemma":0.00072332635,"threshold_uncertainty_score":0.03304112},"labels":[],"label_agreement":null},{"id":"W1522469957","doi":"10.1016/j.dam.2012.12.006","title":"The vertex leafage of chordal graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Chordal graph; Mathematics; Vertex (graph theory); Interval graph; Discrete mathematics; Treewidth; Tree (set theory); Graph; Pathwidth; 1-planar graph; Line graph","score_opus":0.019421689100344953,"score_gpt":0.2834221397538592,"score_spread":0.26400045065351424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522469957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74933255,0.0012054945,0.13116008,0.0014963357,0.00032224713,0.00009824777,0.00079318875,0.00046509205,0.11512674],"genre_scores_gemma":[0.948521,0.00086816336,0.02294108,0.00020730801,0.00023253383,0.000050612,0.0006379936,0.00013976166,0.026401429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971277,0.000053437732,0.000012984972,0.000064868655,0.00007904811,0.00007695268],"domain_scores_gemma":[0.99851483,0.0005906394,0.00019680933,0.00015683168,0.00016729756,0.00037364571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002933857,0.00034454858,0.00066232367,0.0013536917,0.0019949374,0.0028209318,0.0010087845,0.0010099713,0.007555285],"category_scores_gemma":[0.0032966717,0.00035576237,0.0004137742,0.0015267623,0.0018963416,0.002595202,0.001585205,0.0015410396,0.0013172958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014318211,0.00002213685,0.0010260028,0.00008514643,0.00000982863,0.00017898141,0.000805988,0.0020299738,0.004320387,0.9692236,0.0024165867,0.0197382],"study_design_scores_gemma":[0.000022928785,0.00003056517,0.0006735679,0.000026997137,0.000011572742,0.00013058331,0.0003370762,0.0066570193,0.0010087185,0.98293686,0.008152096,0.000012056216],"about_ca_topic_score_codex":0.0020152817,"about_ca_topic_score_gemma":0.0018008514,"teacher_disagreement_score":0.007555285,"about_ca_system_score_codex":0.00074237306,"about_ca_system_score_gemma":0.0005042353,"threshold_uncertainty_score":0.025274932},"labels":[],"label_agreement":null},{"id":"W1523383428","doi":"10.1007/11602613_104","title":"On Routing in VLSI Design and Communication Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Steiner tree problem; Routing (electronic design automation); Computer science; Vertex (graph theory); Mathematical optimization; Approximation algorithm; Multicast; Very-large-scale integration; Integer programming; Linear programming; Theoretical computer science; Mathematics; Distributed computing; Computer network; Graph","score_opus":0.02756434756253712,"score_gpt":0.28470505037295357,"score_spread":0.25714070281041645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523383428","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053764344,0.08991234,0.6466343,0.0052944943,0.0062796166,0.00014203956,0.0002563343,0.001155419,0.24494907],"genre_scores_gemma":[0.098055616,0.16906583,0.3779885,0.0034341828,0.0058464906,0.00043783928,0.000840748,0.0010675673,0.3432632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996778,0.000086287626,0.000016879747,0.000046409852,0.0001425334,0.000030103887],"domain_scores_gemma":[0.99961984,0.00020887397,0.00001801306,0.00007726702,0.000060720955,0.0000151906515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044910453,0.0013675003,0.00089652784,0.001010248,0.00046886544,0.001344902,0.0013868026,0.0010723022,0.013897301],"category_scores_gemma":[0.0011904247,0.0006678492,0.00045741576,0.0022179415,0.0010663505,0.0027122665,0.00095642154,0.001558985,0.004725547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037377788,0.000050373106,0.00012392097,0.00072621374,0.000034550343,0.00008628847,0.0001463299,0.019942127,0.0030816921,0.48281926,0.08577114,0.40718076],"study_design_scores_gemma":[0.000019546444,0.00007058385,0.00024871257,0.0003326638,0.000045757224,0.00030812444,0.00006904385,0.03643513,0.0021259815,0.5577661,0.40255514,0.000023152083],"about_ca_topic_score_codex":0.0005239462,"about_ca_topic_score_gemma":0.0012122893,"teacher_disagreement_score":0.013897301,"about_ca_system_score_codex":0.0007664264,"about_ca_system_score_gemma":0.00048555486,"threshold_uncertainty_score":0.046491086},"labels":[],"label_agreement":null},{"id":"W1523797563","doi":"10.1007/978-3-642-12200-2_30","title":"On Quadratic Threshold CSPs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Predicate (mathematical logic); Quadratic equation; Combinatorics; Discrete mathematics; Computer science","score_opus":0.02164728414739782,"score_gpt":0.28453404510519054,"score_spread":0.26288676095779273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523797563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07999631,0.0020553488,0.5355227,0.006312689,0.0007579711,0.00024745506,0.0013460809,0.0014728255,0.3722887],"genre_scores_gemma":[0.7023734,0.002406519,0.10846281,0.0018827458,0.0010660029,0.000402373,0.0024786063,0.001187656,0.17973988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987184,0.00022068854,0.00008911173,0.00024355532,0.00049693475,0.00023143999],"domain_scores_gemma":[0.9977715,0.0011484628,0.00013605985,0.00038921752,0.0003193465,0.00023540061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085871364,0.00076906173,0.0011192514,0.0013401903,0.0016721913,0.003248678,0.0015089113,0.0011139532,0.030379137],"category_scores_gemma":[0.005048187,0.0006485645,0.0010642087,0.0040632836,0.0021995918,0.008245447,0.0040969085,0.0059427787,0.0037507638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037228143,0.000028445951,0.000070835435,0.00008312892,0.000005082899,0.000027903872,0.00011032155,0.0023222978,0.0006858875,0.9722391,0.0066901566,0.0176996],"study_design_scores_gemma":[0.000011444084,0.000008359091,0.00007397214,0.000015054187,0.000004492659,0.000045036137,0.000028354109,0.010000789,0.00026990543,0.9829624,0.0065740324,0.0000062727545],"about_ca_topic_score_codex":0.0017813517,"about_ca_topic_score_gemma":0.0021731467,"teacher_disagreement_score":0.030379137,"about_ca_system_score_codex":0.0023701796,"about_ca_system_score_gemma":0.0010571484,"threshold_uncertainty_score":0.10162836},"labels":[],"label_agreement":null},{"id":"W15242030","doi":"","title":"Two-Dimensional Bandwidth of Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bandwidth (computing); Combinatorics; Computer network; Computer science","score_opus":0.013483079314258253,"score_gpt":0.2793649703429749,"score_spread":0.2658818910287167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15242030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.305199,0.011581389,0.46213216,0.011833813,0.0015380402,0.00040031134,0.008721955,0.0017124787,0.19688082],"genre_scores_gemma":[0.8871051,0.004601972,0.06359543,0.001178615,0.0006889013,0.00059219595,0.0037870787,0.00030124266,0.038149387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769044,0.0007970717,0.00013689189,0.00051254453,0.0004448442,0.0004182401],"domain_scores_gemma":[0.9915143,0.0045933607,0.0012161321,0.0013250026,0.0006427334,0.00070835016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014385963,0.0009030694,0.0010798327,0.004038626,0.0020291428,0.004232598,0.0019984161,0.0023619304,0.019491483],"category_scores_gemma":[0.013054931,0.00068010046,0.0009769994,0.0040077153,0.0022059085,0.006265575,0.0027240396,0.0021080552,0.0034491527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010932404,0.00006235806,0.0015551192,0.00030205064,0.00005566133,0.00025572805,0.000548881,0.006881354,0.0010033038,0.95047003,0.0097898245,0.02896636],"study_design_scores_gemma":[0.000024170808,0.000029359408,0.0012004955,0.00008662596,0.000029822351,0.0006669136,0.00031558503,0.018786564,0.00044218588,0.95653594,0.021858342,0.000024018642],"about_ca_topic_score_codex":0.0016419417,"about_ca_topic_score_gemma":0.0012660603,"teacher_disagreement_score":0.019491483,"about_ca_system_score_codex":0.0017063569,"about_ca_system_score_gemma":0.0006208517,"threshold_uncertainty_score":0.065205514},"labels":[],"label_agreement":null},{"id":"W1525531059","doi":"10.1007/978-1-4614-0110-0_29","title":"Construction of Locally Plane Graphs with Many Edges","year":2012,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Planar graph; Combinatorics; Mathematics; Line graph; Plane (geometry); Graph; Discrete mathematics; Geometry","score_opus":0.019809743065615164,"score_gpt":0.24161389944174816,"score_spread":0.221804156376133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525531059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033833545,0.0011530304,0.82691,0.00068714947,0.00022904795,0.00013952567,0.00047381353,0.0011722754,0.13540153],"genre_scores_gemma":[0.17359537,0.00247406,0.7514597,0.0002608839,0.00010345318,0.00024438993,0.0014066185,0.0011032124,0.069352314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984694,0.000033916163,0.0000061733767,0.00003657795,0.000054011394,0.000022348268],"domain_scores_gemma":[0.99981815,0.000049721235,0.000013865729,0.00006254881,0.00003324931,0.000022523456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017280094,0.0006101025,0.0005250103,0.0007746709,0.00080976053,0.0011220606,0.0011011967,0.00043472563,0.011959807],"category_scores_gemma":[0.00046564185,0.00057269994,0.00075876113,0.0009822152,0.0009467671,0.0018089734,0.001436737,0.0022679619,0.0036302232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032044383,0.000035344558,0.00015184068,0.00023453575,0.000016105492,0.00012239175,0.0002822054,0.005164252,0.010751243,0.8592961,0.012008002,0.111905955],"study_design_scores_gemma":[0.000021495744,0.000023871715,0.00024954713,0.00006862833,0.000028020873,0.00033039023,0.00016661242,0.012385529,0.007595917,0.87538576,0.103723206,0.00002102523],"about_ca_topic_score_codex":0.00080352364,"about_ca_topic_score_gemma":0.0012082194,"teacher_disagreement_score":0.011959807,"about_ca_system_score_codex":0.00054994394,"about_ca_system_score_gemma":0.00039087728,"threshold_uncertainty_score":0.04000956},"labels":[],"label_agreement":null},{"id":"W1526859640","doi":"","title":"K 3,3 Minors and the Maximum-Flow Problem","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minor (academic); Combinatorics; Mathematics; Planar graph; Graph; Enhanced Data Rates for GSM Evolution; 1-planar graph; Graph minor; Flow (mathematics); Discrete mathematics; Planar; Computer science; Chordal graph; Line graph; Geometry; Voltage graph; Artificial intelligence","score_opus":0.053062170730478746,"score_gpt":0.34197726507755705,"score_spread":0.2889150943470783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526859640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6220156,0.0012725532,0.34545478,0.002803018,0.00012652477,0.0002591783,0.0012461677,0.0009000208,0.025922153],"genre_scores_gemma":[0.83730316,0.0007864425,0.14828278,0.00039137847,0.00015605525,0.0001873011,0.0023775236,0.00022993346,0.010285507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955076,0.000118648975,0.000027856544,0.00011697414,0.000068075984,0.00011767771],"domain_scores_gemma":[0.9986064,0.0006052785,0.00028940305,0.00018495142,0.00010176359,0.0002121864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005818357,0.0007291944,0.00060484913,0.00058029406,0.0009323393,0.001287417,0.0009344087,0.00080885785,0.0036721635],"category_scores_gemma":[0.0023309183,0.00061615184,0.00093119266,0.0006864085,0.0010521029,0.003521733,0.0015084263,0.0011600797,0.0005692643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019253097,0.0008149045,0.0077814995,0.0007839697,0.00017861469,0.001116319,0.0014112914,0.1341136,0.032807514,0.6177224,0.028980937,0.17236371],"study_design_scores_gemma":[0.0001543014,0.0001962537,0.0028398538,0.000058561513,0.000058451427,0.001023053,0.00045952,0.15360427,0.0062090787,0.8169916,0.018359,0.00004603578],"about_ca_topic_score_codex":0.0023643216,"about_ca_topic_score_gemma":0.002232867,"teacher_disagreement_score":0.0036721635,"about_ca_system_score_codex":0.0008000634,"about_ca_system_score_gemma":0.0007232116,"threshold_uncertainty_score":0.012284577},"labels":[],"label_agreement":null},{"id":"W1526904710","doi":"10.1007/3-540-36379-3_35","title":"Connected and Loosely Connected List Homomorphisms","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Bipartite graph; Homomorphism; Combinatorics; Discrete mathematics; Time complexity; Pathwidth; Indifference graph; Mathematics; Graph homomorphism; Complete bipartite graph; Computer science; Graph; Line graph; Voltage graph","score_opus":0.02350317992220167,"score_gpt":0.25560026214924325,"score_spread":0.2320970822270416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526904710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18006486,0.0029903625,0.52845573,0.0020863577,0.00063730817,0.00018336035,0.00062817725,0.0020977198,0.28285617],"genre_scores_gemma":[0.72448474,0.002647353,0.116002314,0.00079823495,0.00061506295,0.00038694288,0.0010720006,0.00078161625,0.1532117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993068,0.00019293687,0.000045445795,0.00017278873,0.00018307356,0.00009902023],"domain_scores_gemma":[0.99822384,0.0009370663,0.00011147018,0.00035366009,0.00017673067,0.00019726752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056573225,0.00055337645,0.0005815928,0.0022083572,0.0026042229,0.0031365573,0.0011937437,0.00093386084,0.014341841],"category_scores_gemma":[0.003743076,0.0006670007,0.00070171955,0.003678904,0.0022057416,0.010363994,0.003981453,0.0022158592,0.0023726039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029698966,0.000020298821,0.00016082247,0.00006225024,0.000006210701,0.000088280496,0.0006485146,0.0005108219,0.0007764714,0.974838,0.0024573945,0.02040114],"study_design_scores_gemma":[0.0000061840346,0.000010490795,0.00012003972,0.000018147464,0.00001248353,0.00014817584,0.00019555479,0.001705234,0.0006844704,0.9844431,0.012647588,0.000008527702],"about_ca_topic_score_codex":0.00053024665,"about_ca_topic_score_gemma":0.0006713188,"teacher_disagreement_score":0.014341841,"about_ca_system_score_codex":0.00085022574,"about_ca_system_score_gemma":0.00044715,"threshold_uncertainty_score":0.047978222},"labels":[],"label_agreement":null},{"id":"W1527608075","doi":"10.37236/460","title":"Another Abstraction of the Erdős-Szekeres Happy End Theorem","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Tel Aviv University; Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Integer (computer science); Simple (philosophy); Regular polygon; Set (abstract data type); Discrete mathematics; General position; Plane (geometry); Geometry; Computer science","score_opus":0.0073306789534315605,"score_gpt":0.25351135019581006,"score_spread":0.2461806712423785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527608075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07087099,0.0010536778,0.72692543,0.0022612344,0.00088809704,0.00017215767,0.0010016718,0.0006423459,0.19618446],"genre_scores_gemma":[0.760847,0.0017340136,0.16320169,0.0017633464,0.0009917746,0.00047319365,0.0011735838,0.00050837966,0.06930701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890053,0.00024064948,0.000050217615,0.00025859833,0.0003578312,0.0001920723],"domain_scores_gemma":[0.99845874,0.0005835313,0.00020503633,0.00030145084,0.0002543679,0.0001968529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825253,0.0007847138,0.000833237,0.0015881616,0.0023666,0.002644417,0.0014629059,0.0013176932,0.011202069],"category_scores_gemma":[0.004034725,0.00041431357,0.0010495075,0.0013824438,0.0031089254,0.007405495,0.0051902346,0.0027488086,0.0025635506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028031067,0.0000096990825,0.00017691075,0.00003245186,0.0000063752977,0.00007492679,0.00013472015,0.0009401418,0.00044317218,0.9888614,0.0021342959,0.0071579227],"study_design_scores_gemma":[0.0000132026025,0.000039332706,0.00020704267,0.000015137884,0.000009810181,0.0002088017,0.0001156455,0.003842402,0.00083581044,0.96175796,0.0329399,0.0000150553005],"about_ca_topic_score_codex":0.0003990021,"about_ca_topic_score_gemma":0.0003534531,"teacher_disagreement_score":0.011202069,"about_ca_system_score_codex":0.00055653456,"about_ca_system_score_gemma":0.00047786982,"threshold_uncertainty_score":0.037474632},"labels":[],"label_agreement":null},{"id":"W1528095446","doi":"10.1007/11682462_62","title":"Packing Dicycle Covers in Planar Graphs with No K 5–e Minor","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Minor (academic); Planar; Planar graph; Combinatorics; Theoretical computer science; Computer graphics (images); Graph; Mathematics; Humanities; Art","score_opus":0.013087783474351394,"score_gpt":0.24909612712772436,"score_spread":0.23600834365337298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528095446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88962156,0.0011129291,0.033246085,0.00044156346,0.00019225299,0.00009208156,0.0007858859,0.0004033723,0.07410434],"genre_scores_gemma":[0.9458074,0.0009105876,0.026176283,0.00018151767,0.00009337128,0.000102860045,0.0016915879,0.00021601935,0.024820466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952996,0.000042516935,0.000026351974,0.00011297741,0.00009910914,0.00018907656],"domain_scores_gemma":[0.9992442,0.00028028234,0.00011672278,0.00015333282,0.00004838073,0.00015709599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018363603,0.00072802685,0.0010931778,0.0011481259,0.0018786918,0.002086821,0.0010561363,0.001158206,0.008392397],"category_scores_gemma":[0.0013495969,0.001054005,0.0006475964,0.002126095,0.0009182754,0.0022829855,0.0024504645,0.0012651623,0.0015606299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029651746,0.00046259593,0.011467844,0.0012695695,0.00022123045,0.004044733,0.003794455,0.036139216,0.090135776,0.5422332,0.04307567,0.26419047],"study_design_scores_gemma":[0.0003053278,0.0008869675,0.0203788,0.00032389283,0.00023794855,0.005858259,0.0029762026,0.09187395,0.044763904,0.7444572,0.08780888,0.00012880066],"about_ca_topic_score_codex":0.0009808821,"about_ca_topic_score_gemma":0.0011041447,"teacher_disagreement_score":0.008392397,"about_ca_system_score_codex":0.0006934825,"about_ca_system_score_gemma":0.0002512874,"threshold_uncertainty_score":0.028075337},"labels":[],"label_agreement":null},{"id":"W1528651684","doi":"10.1016/j.comgeo.2017.10.002","title":"Continuous Yao graphs","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Exploratory Research for Advanced Technology; Natural Sciences and Engineering Research Council of Canada; Natur og Univers, Det Frie Forskningsråd; National Science Foundation","keywords":"Spanner; Combinatorics; Vertex (graph theory); Mathematics; Regular polygon; Algebraic number; Apex (geometry); Plane (geometry); Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.02671546909029007,"score_gpt":0.32140128542788193,"score_spread":0.2946858163375919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528651684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30710995,0.0015925108,0.4511239,0.0076757516,0.0003359334,0.00018003285,0.0013085913,0.00080627284,0.22986707],"genre_scores_gemma":[0.8644224,0.0011464464,0.045732822,0.0008369842,0.0003430226,0.00029527946,0.0012043949,0.00042492984,0.085593626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985851,0.0003531451,0.00005002087,0.00038358115,0.00038310495,0.00024510836],"domain_scores_gemma":[0.9960504,0.0018479374,0.0004373867,0.00045019173,0.00057535636,0.0006385756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092247414,0.00085217156,0.0011852342,0.002349565,0.0023071987,0.004343526,0.0015575042,0.0019867897,0.0208624],"category_scores_gemma":[0.0065030647,0.0007582996,0.0008954351,0.002522918,0.003209145,0.010506324,0.0036892283,0.004750817,0.0017282285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016174332,0.000010595576,0.000080729944,0.000015281847,0.000003715175,0.0000190837,0.000055431676,0.0006047308,0.0002283899,0.9964657,0.0007398753,0.0017602815],"study_design_scores_gemma":[0.000011538332,0.000007893395,0.00012292105,0.000008070432,0.0000063736825,0.00005088514,0.000055993194,0.0039275903,0.00027525777,0.99223787,0.0032886956,0.0000069198936],"about_ca_topic_score_codex":0.0010292861,"about_ca_topic_score_gemma":0.0011366295,"teacher_disagreement_score":0.0208624,"about_ca_system_score_codex":0.001938325,"about_ca_system_score_gemma":0.0009919788,"threshold_uncertainty_score":0.069791675},"labels":[],"label_agreement":null},{"id":"W1529426207","doi":"10.37236/2570","title":"Note on Nordhaus-Gaddum Problems for Colin de Verdière type Parameters","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Combinatorics; Mathematics; Conjecture; Graph; Complement (music); Upper and lower bounds; Rank (graph theory); Type (biology); Chemistry","score_opus":0.01591747753785912,"score_gpt":0.2818817897808203,"score_spread":0.2659643122429612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529426207","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25457817,0.00635562,0.30292645,0.03368637,0.0027869665,0.00024628785,0.0018370129,0.00078952336,0.39679372],"genre_scores_gemma":[0.8456137,0.0031134696,0.08670691,0.0047401837,0.0028849847,0.00050184317,0.0015778348,0.000503378,0.05435776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969668,0.0010717117,0.00009751358,0.00056318677,0.000815728,0.00048506857],"domain_scores_gemma":[0.98755217,0.009278599,0.0006657561,0.00093367754,0.00063668576,0.0009331359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004065256,0.0017412449,0.0019666306,0.00366573,0.0034221576,0.0038867174,0.003650901,0.0038555523,0.017040605],"category_scores_gemma":[0.020384373,0.00095586164,0.0015590303,0.00289695,0.0058101323,0.010497924,0.0058150394,0.009803047,0.0024711313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014613886,0.00005677347,0.00080129964,0.00015772245,0.000021363821,0.00012313202,0.0002083565,0.0052847182,0.0006324741,0.97366285,0.008702868,0.010202287],"study_design_scores_gemma":[0.000028172626,0.000033467724,0.00029915862,0.000048679925,0.000018185765,0.00013030507,0.00007823789,0.012598521,0.0007562913,0.97911525,0.0068626795,0.00003107136],"about_ca_topic_score_codex":0.002774218,"about_ca_topic_score_gemma":0.002695561,"teacher_disagreement_score":0.017040605,"about_ca_system_score_codex":0.0027969133,"about_ca_system_score_gemma":0.0015136761,"threshold_uncertainty_score":0.057006538},"labels":[],"label_agreement":null},{"id":"W1529517016","doi":"","title":"A new flow formulation for FIPP p-cycle protection subject to multiple link failures","year":2011,"lang":"en","type":"article","venue":"International Conference on Ultra Modern Telecommunications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Column generation; Path (computing); Scalability; Mathematical optimization; Computer science; Bandwidth (computing); Dual (grammatical number); Mathematics; Computer network","score_opus":0.12270868231741712,"score_gpt":0.3413565591995041,"score_spread":0.21864787688208698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529517016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022412175,0.00012771065,0.9935888,0.00028817804,0.00006976836,0.00010260929,0.00015928701,0.000086535976,0.0033358473],"genre_scores_gemma":[0.24235497,0.00097252044,0.7381861,0.0005771813,0.0003615694,0.0009810093,0.00077804376,0.00026576914,0.015522778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991536,0.00024972038,0.00003716164,0.00017163601,0.00024626908,0.00014157034],"domain_scores_gemma":[0.9994417,0.0002385921,0.000061430284,0.000068529254,0.00013204195,0.000057719688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016815107,0.0012649803,0.0008561584,0.00064803316,0.00050072634,0.0015889512,0.0023686928,0.0020188785,0.007969347],"category_scores_gemma":[0.0021699457,0.0006043717,0.0015183245,0.0008551242,0.000787035,0.0024919903,0.001396977,0.0027519374,0.0008195614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040313946,0.000085892185,0.00018430501,0.00019203109,0.000028325696,0.00014336685,0.00008152935,0.7384189,0.0020539067,0.21744654,0.0067380723,0.034586802],"study_design_scores_gemma":[0.000022382703,0.000044470376,0.00005185319,0.000022834829,0.000013138701,0.000055793513,0.000019350748,0.9377696,0.00046567147,0.054738306,0.0067851082,0.000011497458],"about_ca_topic_score_codex":0.0030233688,"about_ca_topic_score_gemma":0.0030115056,"teacher_disagreement_score":0.007969347,"about_ca_system_score_codex":0.0016930246,"about_ca_system_score_gemma":0.0023358413,"threshold_uncertainty_score":0.026660144},"labels":[],"label_agreement":null},{"id":"W1529872609","doi":"10.1016/j.jctb.2015.05.011","title":"The structure of 2-separations of infinite matroids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Invariant (physics); Graphic matroid; Duality (order theory); Tree (set theory); Discrete mathematics; Mathematical physics","score_opus":0.01746079313427293,"score_gpt":0.29334364779114674,"score_spread":0.2758828546568738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529872609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87583405,0.0007633191,0.057125967,0.001458016,0.00017494046,0.000040568637,0.0004845358,0.00029404697,0.06382443],"genre_scores_gemma":[0.9731164,0.00029643023,0.012512697,0.00025601717,0.00023014568,0.00004428656,0.00052231806,0.00009085296,0.012930857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951327,0.000121088924,0.000030109497,0.00009050954,0.00014081635,0.00010412299],"domain_scores_gemma":[0.99810934,0.0007231434,0.00043167005,0.0001519862,0.00019598952,0.0003878835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043873847,0.0005034882,0.000619206,0.0018700305,0.0017852512,0.0040249606,0.0013235606,0.0013132629,0.008867138],"category_scores_gemma":[0.0020992835,0.0006764792,0.0005183561,0.0014960385,0.0021828546,0.0036661162,0.0014038815,0.0019961863,0.0010930076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010242223,0.000056944722,0.000613504,0.000044209453,0.000009831263,0.00013445261,0.00047236576,0.0022087942,0.0022959374,0.98764336,0.0015300032,0.004888121],"study_design_scores_gemma":[0.0000253189,0.000032036598,0.00055882306,0.00001610909,0.0000070843807,0.00018843038,0.00019726703,0.007450523,0.0006093452,0.9882067,0.0026912624,0.00001706656],"about_ca_topic_score_codex":0.0005035148,"about_ca_topic_score_gemma":0.0007348988,"teacher_disagreement_score":0.008867138,"about_ca_system_score_codex":0.0009807579,"about_ca_system_score_gemma":0.00046026093,"threshold_uncertainty_score":0.029663563},"labels":[],"label_agreement":null},{"id":"W1530791066","doi":"10.1023/a:1011453115618","title":"Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Satisfiability; Discrete mathematics; Theory of computation; Approximation algorithm; Upper and lower bounds; Heuristic; Algorithm; Mathematical optimization","score_opus":0.02127682984858473,"score_gpt":0.297354183519847,"score_spread":0.27607735367126224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530791066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0855244,0.001767292,0.87583864,0.0031266205,0.00045510218,0.0004915692,0.0018382765,0.0040229345,0.026935123],"genre_scores_gemma":[0.35168776,0.0010294749,0.6262089,0.0007722141,0.00054691324,0.0005912846,0.0026647411,0.0010970656,0.015401598],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718577,0.00074904057,0.00013816496,0.0006734685,0.00070478715,0.00054882205],"domain_scores_gemma":[0.9915901,0.00480478,0.0005500169,0.0018682505,0.0006422883,0.0005445637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027870794,0.00300004,0.0030877201,0.0026743081,0.0020799143,0.005720101,0.0076281847,0.003673064,0.022295663],"category_scores_gemma":[0.015197668,0.001685338,0.0033930521,0.006370382,0.002318158,0.011773049,0.0052069766,0.0057420493,0.0026528488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018802782,0.0013148495,0.002709818,0.0011062464,0.00033348022,0.0001955839,0.0006457289,0.29068878,0.005143859,0.2434624,0.043671645,0.4088472],"study_design_scores_gemma":[0.00028483968,0.00010866893,0.0005076889,0.00005356552,0.00011277054,0.00012444775,0.0001520701,0.60640764,0.0020600795,0.38517666,0.004971311,0.00004017845],"about_ca_topic_score_codex":0.0065141586,"about_ca_topic_score_gemma":0.015262941,"teacher_disagreement_score":0.022295663,"about_ca_system_score_codex":0.005934219,"about_ca_system_score_gemma":0.004055464,"threshold_uncertainty_score":0.07458639},"labels":[],"label_agreement":null},{"id":"W1532021344","doi":"10.1007/11538363_26","title":"Closure Properties of Weak Systems of Bounded Arithmetic","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bounded function; Class (philosophy); Axiom; Complexity class; Closure (psychology); Discrete mathematics; Descriptive complexity theory; Second-order arithmetic; Computer science; Arithmetic; Mathematics; Algebra over a field; Time complexity; Pure mathematics; Artificial intelligence","score_opus":0.027840504164713224,"score_gpt":0.2617839800224799,"score_spread":0.23394347585776665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532021344","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51728004,0.0019543886,0.33797193,0.0019929383,0.00037359202,0.00016234667,0.0008322441,0.00065572443,0.13877691],"genre_scores_gemma":[0.9493758,0.00066133303,0.030178951,0.00021494167,0.00039998977,0.00021440671,0.0006899814,0.0002391581,0.018025514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988072,0.00025690006,0.00010085394,0.00023431049,0.00040579346,0.00019493946],"domain_scores_gemma":[0.9966813,0.0019781478,0.00023351985,0.00039216792,0.0004230854,0.00029184163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015065157,0.00074708625,0.0011481007,0.001958996,0.0024391992,0.0038954108,0.001575497,0.0009827253,0.0072960164],"category_scores_gemma":[0.0052431896,0.00091117877,0.0012968514,0.0015556315,0.004315069,0.010600613,0.003757307,0.0037886037,0.0005724961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052831994,0.000014959218,0.00015317931,0.00004124637,0.000007138655,0.000034973506,0.00034511,0.00047034922,0.0012674172,0.9939539,0.0004740292,0.0031848387],"study_design_scores_gemma":[0.000020859577,0.000020855876,0.00019302602,0.000013565898,0.000010933114,0.00004132367,0.00012848119,0.0028918404,0.0007704814,0.99392575,0.0019737873,0.000009135707],"about_ca_topic_score_codex":0.00088761037,"about_ca_topic_score_gemma":0.00065379153,"teacher_disagreement_score":0.0072960164,"about_ca_system_score_codex":0.001419374,"about_ca_system_score_gemma":0.0006857001,"threshold_uncertainty_score":0.024407625},"labels":[],"label_agreement":null},{"id":"W1532852577","doi":"10.46298/dmtcs.482","title":"On edge-intersection graphs of k-bend paths in grids","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Pathwidth; 1-planar graph; Indifference graph; Chordal graph; Planar graph; Outerplanar graph; Longest path problem; Discrete mathematics; Grid; Clique-sum; Lattice graph; Line graph; Graph; Voltage graph; Geometry","score_opus":0.012110239712280422,"score_gpt":0.2889517041416278,"score_spread":0.2768414644293474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532852577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60535496,0.0006475612,0.33561277,0.0010424023,0.000082366976,0.00017725438,0.0012167357,0.00060215377,0.055263855],"genre_scores_gemma":[0.8896769,0.00094074535,0.097679,0.00036397896,0.00007808508,0.00020186159,0.0019336891,0.00025606947,0.008869625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991357,0.0002571422,0.000044107535,0.00020595227,0.00017507785,0.00018212596],"domain_scores_gemma":[0.99677724,0.0016145995,0.000594456,0.00042163694,0.00034779625,0.00024420468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004344733,0.00065421325,0.0006248221,0.001320352,0.001619049,0.0017631516,0.001107263,0.00078385964,0.008464288],"category_scores_gemma":[0.004224874,0.0005469293,0.00079475576,0.0027235097,0.0017886627,0.004731258,0.002028582,0.0016395155,0.000726562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005155268,0.0001569319,0.003025627,0.0002669876,0.000055096792,0.0005985562,0.0012961336,0.08346001,0.007039092,0.84341246,0.0051991986,0.0549744],"study_design_scores_gemma":[0.00005964373,0.000114591494,0.0018082985,0.000121384495,0.000047774218,0.0005276409,0.0009068626,0.115333,0.0032854476,0.8621261,0.015625041,0.00004418831],"about_ca_topic_score_codex":0.0027377282,"about_ca_topic_score_gemma":0.0017830967,"teacher_disagreement_score":0.008464288,"about_ca_system_score_codex":0.0010957312,"about_ca_system_score_gemma":0.00047819284,"threshold_uncertainty_score":0.028315842},"labels":[],"label_agreement":null},{"id":"W1537431299","doi":"10.1007/11775096_25","title":"Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Multiset; Graph; Mathematics; Partition (number theory); Discrete mathematics; Time complexity; Split graph; Computer science; Pathwidth; Line graph","score_opus":0.019577771788288685,"score_gpt":0.2545518202272691,"score_spread":0.2349740484389804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537431299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45003396,0.00039077713,0.52796495,0.00037822427,0.000090921625,0.00017689119,0.0016059768,0.0026777743,0.016680432],"genre_scores_gemma":[0.75913906,0.0003030343,0.22320965,0.00018501015,0.00005985916,0.00016783517,0.0054770266,0.0006865175,0.0107721025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994925,0.000060708244,0.000033482407,0.00022034478,0.00010305914,0.00008988506],"domain_scores_gemma":[0.99785197,0.0007307917,0.00031798545,0.0006305451,0.00028970942,0.00017915928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002530369,0.00050818315,0.0008118052,0.0011286932,0.00090327335,0.0018008396,0.0012144361,0.0010655253,0.005452731],"category_scores_gemma":[0.002867854,0.00053320266,0.0006177671,0.0016912436,0.00087418733,0.0036006987,0.0011311301,0.00096942857,0.0012204627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011131624,0.000510855,0.013814142,0.00083330437,0.00009651434,0.0013589233,0.0018690204,0.057867907,0.11042082,0.35119653,0.019297007,0.44162175],"study_design_scores_gemma":[0.00007003367,0.00023336009,0.009647669,0.00011593992,0.00008904601,0.0019209678,0.0016270702,0.3007316,0.06344324,0.59546596,0.026574375,0.0000807546],"about_ca_topic_score_codex":0.001243772,"about_ca_topic_score_gemma":0.002286243,"teacher_disagreement_score":0.005452731,"about_ca_system_score_codex":0.00062532496,"about_ca_system_score_gemma":0.00052650267,"threshold_uncertainty_score":0.018241167},"labels":[],"label_agreement":null},{"id":"W1539135222","doi":"10.46298/dmtcs.345","title":"Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Maximal independent set; Independent set; Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Discrete mathematics; Chordal graph; 1-planar graph; Computer science; Artificial intelligence","score_opus":0.030404127322679365,"score_gpt":0.3125950203568114,"score_spread":0.28219089303413203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539135222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5915115,0.0009772037,0.3730075,0.0075554517,0.00016893489,0.00039228596,0.0036072985,0.0025945355,0.02018521],"genre_scores_gemma":[0.8168098,0.00055882987,0.16682217,0.0006621104,0.00017806765,0.00023644301,0.0062806373,0.00035845203,0.0080934055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976388,0.00037455306,0.00022540613,0.0009812379,0.00035265923,0.0004274207],"domain_scores_gemma":[0.9812402,0.013306542,0.0016987065,0.0022599255,0.0007603141,0.0007342846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011855334,0.0008652948,0.0013545692,0.0010118888,0.001822777,0.004116809,0.0032561293,0.0024211486,0.005470769],"category_scores_gemma":[0.0084987255,0.000937153,0.0019730313,0.0022066191,0.002906536,0.011889831,0.0022092368,0.0036925548,0.00064916286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021800043,0.0011541657,0.015331774,0.0024393664,0.00039281862,0.0017066413,0.002835528,0.26479018,0.030883998,0.4464117,0.031038888,0.20083497],"study_design_scores_gemma":[0.00010432545,0.00014914872,0.0034742784,0.00010102375,0.00015901876,0.0017736839,0.0013373527,0.2513788,0.03196782,0.6944162,0.015018364,0.00011995493],"about_ca_topic_score_codex":0.0033012864,"about_ca_topic_score_gemma":0.0045383866,"teacher_disagreement_score":0.005470769,"about_ca_system_score_codex":0.0017302955,"about_ca_system_score_gemma":0.001473301,"threshold_uncertainty_score":0.018301606},"labels":[],"label_agreement":null},{"id":"W1541872440","doi":"10.1007/3-540-45477-2_9","title":"On the Relationship between Clique-Width and Treewidth","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Combinatorics; Clique-width; Clique-sum; Partial k-tree; Mathematics; Discrete mathematics; Bounded function; Graph; Tree decomposition; Tree-depth; Chordal graph; Pathwidth; 1-planar graph; Line graph; Voltage graph","score_opus":0.05768015266796828,"score_gpt":0.3089462622550377,"score_spread":0.2512661095870694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541872440","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22718923,0.046741396,0.574825,0.01707441,0.0016208316,0.00014468389,0.0020223379,0.0011606651,0.12922142],"genre_scores_gemma":[0.7992841,0.026474278,0.14863974,0.002636655,0.005430284,0.00035040273,0.0015620093,0.0012723398,0.014350169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682534,0.0009988496,0.00016589442,0.000875991,0.00077679736,0.00035713243],"domain_scores_gemma":[0.84239835,0.14501484,0.0047097015,0.0037661463,0.002503351,0.0016076324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060912045,0.0015443263,0.002503444,0.0040344144,0.0021095353,0.0050683594,0.005139445,0.0032695683,0.011432278],"category_scores_gemma":[0.06462514,0.002399851,0.0012906584,0.009230099,0.0071553085,0.026752647,0.004443266,0.009148945,0.0017739006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004225968,0.00019413755,0.0058805584,0.00064137933,0.00015030688,0.00019285138,0.00085837906,0.028774379,0.0024822617,0.870625,0.014067873,0.07571024],"study_design_scores_gemma":[0.000031957126,0.000041699906,0.0015613385,0.00011195396,0.00006915106,0.00024838428,0.00011183039,0.03553177,0.00044105857,0.9590921,0.0027154218,0.000043385695],"about_ca_topic_score_codex":0.0027522093,"about_ca_topic_score_gemma":0.0033863236,"teacher_disagreement_score":0.011432278,"about_ca_system_score_codex":0.0024822517,"about_ca_system_score_gemma":0.0010873718,"threshold_uncertainty_score":0.038244843},"labels":[],"label_agreement":null},{"id":"W1542271501","doi":"10.46298/dmtcs.533","title":"Cycle transversals in bounded degree graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Combinatorics; Mathematics; Degree (music); Bounded function; Transversal (combinatorics); Discrete mathematics; Chordal graph; Time complexity; Graph","score_opus":0.04119992193136523,"score_gpt":0.2953425194147365,"score_spread":0.25414259748337126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542271501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5187869,0.0019250808,0.4632167,0.0019910007,0.000076277596,0.00034820053,0.001161526,0.0015382019,0.010956135],"genre_scores_gemma":[0.72472125,0.0011567688,0.26490307,0.00025610736,0.00007889131,0.00017670791,0.0028877961,0.00029387954,0.005525539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987863,0.00030332876,0.00008148605,0.00035854874,0.00023679883,0.00023358673],"domain_scores_gemma":[0.99477404,0.0032375325,0.0006023866,0.0007163772,0.00031964027,0.00035010665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009543015,0.0007758622,0.0010734868,0.0011891695,0.0011214376,0.0024971303,0.0017175849,0.0010732781,0.0048323213],"category_scores_gemma":[0.006437291,0.00074436335,0.0011600576,0.002088975,0.0014096985,0.00472882,0.0018494459,0.0017978633,0.00059698196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011725201,0.00036291243,0.00541121,0.0009127317,0.00017904458,0.00035636208,0.0008882889,0.60175246,0.021878894,0.25069323,0.007541172,0.108851105],"study_design_scores_gemma":[0.00013346881,0.00010019898,0.0008655178,0.000059188424,0.00005957942,0.00032443748,0.00041063994,0.6715659,0.008454408,0.3135145,0.004479499,0.000032743363],"about_ca_topic_score_codex":0.005037395,"about_ca_topic_score_gemma":0.006522913,"teacher_disagreement_score":0.005037395,"about_ca_system_score_codex":0.0020984935,"about_ca_system_score_gemma":0.00128759,"threshold_uncertainty_score":0.016165733},"labels":[],"label_agreement":null},{"id":"W1542539758","doi":"10.1002/jgt.21795","title":"Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chordal graph; Vertex (graph theory); Bounded function; Independent set; Indifference graph; Discrete mathematics; Maximal independent set; Graph; 1-planar graph","score_opus":0.012063852795284016,"score_gpt":0.2689821085366713,"score_spread":0.2569182557413873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542539758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8858719,0.0004988371,0.09513496,0.00023856299,0.000037797803,0.000036610996,0.00049748074,0.00019245165,0.017491342],"genre_scores_gemma":[0.9819725,0.0002794784,0.014797865,0.000052280386,0.000040696515,0.0000290461,0.00047296684,0.000049714883,0.0023054355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996648,0.000059859496,0.000018904551,0.000084831045,0.000098083525,0.00007351275],"domain_scores_gemma":[0.99692804,0.0013922502,0.0007135708,0.00023969535,0.0003634133,0.00036312765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025062772,0.00036377646,0.0002848768,0.0018684906,0.0006031926,0.0012208226,0.00057436747,0.00036589825,0.0017847924],"category_scores_gemma":[0.0019249328,0.00017428324,0.0002513564,0.0016167783,0.00091540307,0.0015852503,0.0005419062,0.0006429964,0.0002112046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003208199,0.0001176062,0.009588505,0.00017961371,0.00002765766,0.00067302975,0.0010749206,0.034870263,0.035875533,0.87890005,0.0026331916,0.035738736],"study_design_scores_gemma":[0.00003085536,0.00013462335,0.0070979213,0.000049055707,0.00003702682,0.0010103331,0.00087491586,0.090776384,0.012741472,0.8745661,0.01263,0.000051284776],"about_ca_topic_score_codex":0.0010077308,"about_ca_topic_score_gemma":0.0010844882,"teacher_disagreement_score":0.0018684906,"about_ca_system_score_codex":0.00081824546,"about_ca_system_score_gemma":0.00032765552,"threshold_uncertainty_score":0.005970776},"labels":[],"label_agreement":null},{"id":"W1542956397","doi":"10.1007/3-540-45749-6_64","title":"Frequency Channel Assignment on Planar Networks","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Frequency assignment; Planar; Channel (broadcasting); Computer network; Telecommunications; Algorithm; Computer graphics (images)","score_opus":0.02724496262158387,"score_gpt":0.2615314947421288,"score_spread":0.2342865321205449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542956397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06256432,0.001394785,0.8042349,0.00075740815,0.0003184715,0.00008921019,0.00024318999,0.0008200757,0.12957756],"genre_scores_gemma":[0.669423,0.0051438203,0.22304225,0.00025910218,0.00046686674,0.00025244546,0.0005827756,0.0002667668,0.10056296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980897,0.000041526353,0.0000052866276,0.000034345885,0.00005853385,0.000051364197],"domain_scores_gemma":[0.9996395,0.00017137722,0.000037443453,0.000058035606,0.000061630286,0.00003201121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015858404,0.0004833507,0.00043744888,0.00074183743,0.00068840076,0.0009811869,0.0008601094,0.00045946045,0.008319295],"category_scores_gemma":[0.0011162801,0.00031599947,0.00024118954,0.0017403805,0.0005818157,0.001222766,0.0011506294,0.000763165,0.0013419688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013679639,0.000053582495,0.00017784735,0.00023791163,0.000019596604,0.00009131377,0.00012779067,0.15433471,0.0068209814,0.5980754,0.016862927,0.22306111],"study_design_scores_gemma":[0.00003239401,0.00008578292,0.00030838486,0.00004264997,0.000026879354,0.00021870367,0.000103430735,0.25591782,0.0029007301,0.70566756,0.03467004,0.000025557092],"about_ca_topic_score_codex":0.0011762707,"about_ca_topic_score_gemma":0.0011799684,"teacher_disagreement_score":0.008319295,"about_ca_system_score_codex":0.0006668917,"about_ca_system_score_gemma":0.00043415907,"threshold_uncertainty_score":0.02783078},"labels":[],"label_agreement":null},{"id":"W1542970106","doi":"10.48550/arxiv.1005.5522","title":"Shrink-Wrapping trajectories for Linear Programming","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Science Foundation","keywords":"Mathematics; Linear programming; Convexity; Affine transformation; Interior point method; Second-order cone programming; Convex cone; Sequence (biology); Path (computing); Affine space; Linear space; Linear-fractional programming; Regular polygon; Convex optimization; Algorithm; Computer science; Geometry; Convex analysis","score_opus":0.09761090265019441,"score_gpt":0.24282631029229504,"score_spread":0.1452154076421006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542970106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0936816,0.0014588584,0.88677615,0.0013803837,0.000077532444,0.000062212566,0.00025160986,0.00039915956,0.015912466],"genre_scores_gemma":[0.7786899,0.0024657792,0.20168896,0.00030378447,0.00019849789,0.00032058783,0.0008059116,0.0005693247,0.014957223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995734,0.00016191196,0.000019367115,0.0000853763,0.0001158337,0.0000440052],"domain_scores_gemma":[0.9984616,0.0008306645,0.0002294899,0.00013438611,0.00019265202,0.00015122324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078499014,0.0008901186,0.0005792947,0.0009887287,0.0008316371,0.0013937963,0.0005994973,0.00073621736,0.0037936661],"category_scores_gemma":[0.005326384,0.0004121676,0.0008016404,0.0008005488,0.001906121,0.0023396993,0.0018912499,0.002680491,0.0006973895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010173469,0.000041967764,0.0008422685,0.000101412115,0.00003074459,0.00017938645,0.00029147716,0.1624384,0.003006161,0.8057839,0.00390578,0.023276648],"study_design_scores_gemma":[0.000014084426,0.000044087792,0.00027310988,0.00002520436,0.0000055312903,0.00007461889,0.000091213784,0.42074507,0.0010619916,0.5732262,0.004424904,0.000013982979],"about_ca_topic_score_codex":0.0012288404,"about_ca_topic_score_gemma":0.00062685786,"teacher_disagreement_score":0.0037936661,"about_ca_system_score_codex":0.0012903307,"about_ca_system_score_gemma":0.00054501864,"threshold_uncertainty_score":0.012691021},"labels":[],"label_agreement":null},{"id":"W1542990689","doi":"10.1007/978-3-642-19222-7_7","title":"Shortest Paths between Shortest Paths and Independent Sets","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control reconfiguration; K shortest path routing; Shortest path problem; Sequence (biology); Yen's algorithm; Shortest Path Faster Algorithm; Floyd–Warshall algorithm; Graph","score_opus":0.03353041539316524,"score_gpt":0.2815773617864456,"score_spread":0.24804694639328037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542990689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03469144,0.015180313,0.72245497,0.0016280304,0.0014077644,0.00022329493,0.0030103936,0.0009283066,0.22047563],"genre_scores_gemma":[0.25148332,0.025979772,0.6078677,0.00056598167,0.0015221965,0.0006915269,0.0074725654,0.00085729087,0.1035596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999632,0.000051082883,0.000022567938,0.00010973155,0.0001575007,0.000027084881],"domain_scores_gemma":[0.99944836,0.00032257842,0.00004958189,0.000052846935,0.000093319846,0.00003330936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030529333,0.0010227048,0.0006532372,0.0025665688,0.0008009345,0.0015337864,0.0010934059,0.00070030056,0.010568384],"category_scores_gemma":[0.002091779,0.0006689213,0.0007780211,0.0058178,0.00096633844,0.004042875,0.0013030085,0.0023331284,0.0024629438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006550246,0.000032079024,0.00019596082,0.00058799045,0.000051679366,0.000110032626,0.00027500655,0.017786587,0.0018651499,0.78259873,0.02356201,0.17286922],"study_design_scores_gemma":[0.000011731343,0.00001782087,0.00017543019,0.000053867,0.000019610867,0.00013469158,0.000050096733,0.0075758095,0.0005022577,0.9411019,0.050344493,0.000012243304],"about_ca_topic_score_codex":0.00079940265,"about_ca_topic_score_gemma":0.0010932616,"teacher_disagreement_score":0.010568384,"about_ca_system_score_codex":0.0009840647,"about_ca_system_score_gemma":0.00063096493,"threshold_uncertainty_score":0.035354733},"labels":[],"label_agreement":null},{"id":"W154300135","doi":"","title":"Some Bounds on Alliances in Trees.","year":2010,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Dominating set; Mathematics; Cardinality (data modeling); Graph; Simple graph; Alliance; Offensive; Upper and lower bounds; Simple (philosophy); Discrete mathematics; Computer science; Data mining","score_opus":0.013036732546370977,"score_gpt":0.2734150912754956,"score_spread":0.2603783587291246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154300135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16060579,0.03670339,0.5171904,0.013025185,0.0013199488,0.00037344408,0.0057848487,0.0010053758,0.26399168],"genre_scores_gemma":[0.8079404,0.025361657,0.132241,0.0023328138,0.0028501034,0.0011076865,0.0043184436,0.00090918597,0.022938637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949522,0.001485417,0.0003015742,0.0009113607,0.0012271211,0.0011222712],"domain_scores_gemma":[0.95697486,0.032641962,0.0028611254,0.0024803614,0.0019189481,0.003122743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057449383,0.0021773777,0.0024315363,0.004069531,0.0034662965,0.0063851196,0.0036919515,0.0030669065,0.018454729],"category_scores_gemma":[0.03809096,0.0012157272,0.0024616637,0.006178228,0.0036659527,0.01826881,0.0053703776,0.007557742,0.0028726277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041841564,0.00018319329,0.0029725682,0.0009149406,0.00016409378,0.00022624413,0.0010449288,0.032433774,0.0033137097,0.88921857,0.019908747,0.049200896],"study_design_scores_gemma":[0.000055298508,0.00014707477,0.0020303107,0.00028632607,0.00016331505,0.00067683565,0.00036159073,0.04727397,0.0014361225,0.9251447,0.022371953,0.000052464886],"about_ca_topic_score_codex":0.0009396529,"about_ca_topic_score_gemma":0.0015157949,"teacher_disagreement_score":0.018454729,"about_ca_system_score_codex":0.0035358998,"about_ca_system_score_gemma":0.0009175398,"threshold_uncertainty_score":0.06173724},"labels":[],"label_agreement":null},{"id":"W154378396","doi":"","title":"Comment on \"Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles\".","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Enhanced Data Rates for GSM Evolution; Hamiltonian (control theory); Combinatorics; Hamiltonian path; Graph; Computer science; Mathematical optimization; Optics; Physics; Artificial intelligence","score_opus":0.025989539586778323,"score_gpt":0.28188861639656165,"score_spread":0.25589907680978335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154378396","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000944125,0.0019844647,0.0010532079,0.9162249,0.070900485,0.00003737847,0.0006213882,0.00024947218,0.007984564],"genre_scores_gemma":[0.0063316217,0.0013376197,0.00073748076,0.9642853,0.019608386,0.00007867595,0.00015137976,0.00007444223,0.0073950137],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99683917,0.00044096372,0.00036373318,0.0007929335,0.0011172795,0.0004458703],"domain_scores_gemma":[0.98770624,0.006458228,0.0010865353,0.0006064326,0.003440416,0.0007020279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036704491,0.0012842016,0.0013480464,0.0011302965,0.004151033,0.0021526897,0.006234564,0.028292488,0.012833217],"category_scores_gemma":[0.025268143,0.0009256464,0.0017632305,0.0015698172,0.0062909303,0.005180877,0.0025942014,0.028102446,0.0110486895],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006962214,0.000009695746,0.00024213073,0.00016825237,0.000018291223,0.00046975075,0.00014702507,0.00012248491,0.00024455212,0.008921804,0.98706853,0.00251789],"study_design_scores_gemma":[0.00017164476,0.000054156953,0.002698213,0.000558728,0.0000800081,0.0011371949,0.0006050747,0.00046729023,0.0013498813,0.033415873,0.959358,0.00010393212],"about_ca_topic_score_codex":0.020809192,"about_ca_topic_score_gemma":0.019807648,"teacher_disagreement_score":0.028292488,"about_ca_system_score_codex":0.003979527,"about_ca_system_score_gemma":0.0026993002,"threshold_uncertainty_score":0.042931378},"labels":[],"label_agreement":null},{"id":"W1546598357","doi":"10.37236/4053","title":"On the Hyperbolicity of Random Graphs","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Binomial (polynomial); Random graph; Discrete mathematics; Statistics","score_opus":0.008707904971047311,"score_gpt":0.24355808628778286,"score_spread":0.23485018131673555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546598357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8477628,0.0032319264,0.106600404,0.0048142844,0.00019858318,0.00008108856,0.00051041914,0.00027621916,0.036524247],"genre_scores_gemma":[0.98896104,0.0010073951,0.006228219,0.00039745143,0.00019513884,0.00006581952,0.0001996396,0.000085019026,0.0028602302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775535,0.0011422308,0.00007759772,0.00036229257,0.00035536228,0.0003071843],"domain_scores_gemma":[0.97388464,0.018657451,0.002306605,0.0021607322,0.0011614239,0.001829128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003467336,0.0005575353,0.0010394047,0.002258983,0.0012619591,0.0025623743,0.002083498,0.0010438114,0.0031639978],"category_scores_gemma":[0.02656316,0.00075235055,0.00045217833,0.00117804,0.0057249162,0.0051136175,0.0031550648,0.0021586684,0.00050348317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024305389,0.000035187026,0.004668491,0.000115395385,0.000043563035,0.00022727934,0.00059852784,0.017802939,0.0023042492,0.9603014,0.0025979022,0.0110621955],"study_design_scores_gemma":[0.00006107508,0.000055414195,0.0019313513,0.000063079286,0.000023547685,0.00031786697,0.00023401197,0.069511056,0.0009247854,0.9244712,0.0023558256,0.000050896146],"about_ca_topic_score_codex":0.0011814985,"about_ca_topic_score_gemma":0.0007656392,"teacher_disagreement_score":0.003467336,"about_ca_system_score_codex":0.0017774927,"about_ca_system_score_gemma":0.00042938913,"threshold_uncertainty_score":0.01833725},"labels":[],"label_agreement":null},{"id":"W1547065387","doi":"10.1016/j.jctb.2016.06.006","title":"5-list-coloring planar graphs with distant precolored vertices","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Planar graph; Order (exchange); Graph; Planar; Induced subgraph; Graph homomorphism","score_opus":0.011021558989236077,"score_gpt":0.24589534272845842,"score_spread":0.23487378373922235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547065387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53001225,0.00052119925,0.30645698,0.0019274482,0.00051097653,0.0003718368,0.002791048,0.0033819417,0.15402637],"genre_scores_gemma":[0.7566964,0.00032347822,0.20234668,0.00065580785,0.0000787706,0.00016647278,0.0035418137,0.00049460016,0.03569594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999243,0.00012575228,0.000044977205,0.00018327779,0.00014262393,0.0002603894],"domain_scores_gemma":[0.99814653,0.00045937658,0.00021163045,0.00049198937,0.0003416404,0.00034881965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047757424,0.000815378,0.0007057983,0.0009591692,0.002488024,0.0027449646,0.0023840407,0.0013809202,0.024946596],"category_scores_gemma":[0.0019857292,0.00073785597,0.00088812393,0.0013336901,0.0010265973,0.0026220793,0.002514185,0.0016034906,0.004126899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018158437,0.00076947815,0.008321349,0.0012039447,0.00020310775,0.0015833873,0.0013665516,0.044878088,0.051545255,0.6859626,0.03809919,0.16425115],"study_design_scores_gemma":[0.0004871736,0.0005297403,0.0050170715,0.00023236894,0.00037159555,0.0022414066,0.002087043,0.12108142,0.06253014,0.7385281,0.0667452,0.00014880607],"about_ca_topic_score_codex":0.0027007072,"about_ca_topic_score_gemma":0.0069780718,"teacher_disagreement_score":0.024946596,"about_ca_system_score_codex":0.001583878,"about_ca_system_score_gemma":0.0013160049,"threshold_uncertainty_score":0.08345467},"labels":[],"label_agreement":null},{"id":"W1547799720","doi":"10.1007/978-3-540-73420-8_25","title":"Universal Algebra and Hardness Results for Constraint Satisfaction Problems","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Concordia University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Idempotence; Congruence (geometry); Reduct; Discrete mathematics; Semiring; Algebraic number; Combinatorics; Algebra over a field; Computer science; Rough set; Pure mathematics","score_opus":0.020002480328235362,"score_gpt":0.28802100532307223,"score_spread":0.26801852499483686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547799720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10539739,0.0068766773,0.7168661,0.020854207,0.0010687737,0.0004217868,0.0031475858,0.0013736393,0.14399393],"genre_scores_gemma":[0.82816446,0.005572629,0.121399835,0.0038252773,0.0036350812,0.0008685968,0.0053511476,0.0007065543,0.03047642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99266243,0.0018191678,0.0004987489,0.0016079167,0.0023253136,0.0010864227],"domain_scores_gemma":[0.97559935,0.018705811,0.00094748824,0.0024256115,0.0012483061,0.0010735057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004080451,0.0018387702,0.0029056435,0.0037059216,0.00455795,0.008505128,0.005798149,0.0029952233,0.016016051],"category_scores_gemma":[0.023094922,0.0018524968,0.0044476595,0.007916773,0.007537728,0.023761913,0.007635627,0.0155014135,0.0015187777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014830231,0.0001580292,0.00053890113,0.0003877802,0.00009131526,0.00010211679,0.0004923912,0.007809574,0.0005762646,0.96153355,0.008808485,0.019353231],"study_design_scores_gemma":[0.000019595724,0.000010058023,0.00012621611,0.000020385754,0.000021276697,0.000044763823,0.00006328589,0.007156251,0.00022505691,0.99046737,0.0018319382,0.000013775367],"about_ca_topic_score_codex":0.003227294,"about_ca_topic_score_gemma":0.0028022365,"teacher_disagreement_score":0.016016051,"about_ca_system_score_codex":0.0038060776,"about_ca_system_score_gemma":0.0023705459,"threshold_uncertainty_score":0.053578973},"labels":[],"label_agreement":null},{"id":"W1548559198","doi":"10.1016/j.jctb.2014.12.003","title":"Matroid 3-connectivity and branch width","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Matroid; Combinatorics; Minor (academic); Mathematics; Integer (computer science); Oriented matroid; Matroid partitioning; Set (abstract data type); Discrete mathematics; Graphic matroid; Computer science; Humanities","score_opus":0.018418209423534875,"score_gpt":0.27575564629247123,"score_spread":0.25733743686893634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548559198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8712724,0.0012387675,0.055186044,0.0024041242,0.00009175696,0.00004927911,0.0010810464,0.000321487,0.068355285],"genre_scores_gemma":[0.9812138,0.00064178236,0.010561427,0.00027874124,0.00016994351,0.00006603381,0.0005690623,0.00012410257,0.0063751163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995308,0.00009172689,0.000027350934,0.00013344426,0.00011324825,0.000103498736],"domain_scores_gemma":[0.99448895,0.003234414,0.0009873606,0.0003130075,0.00033971237,0.00063650525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064810325,0.0005098911,0.000943911,0.002319343,0.0014373049,0.0040881825,0.0017658604,0.001671024,0.017455548],"category_scores_gemma":[0.0055821748,0.0007909615,0.0006424834,0.0027205793,0.002225689,0.0067620957,0.0018665788,0.0028730035,0.00104488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024864572,0.0001151445,0.0048920945,0.00015840646,0.000036683745,0.00026761537,0.00075114414,0.0053242357,0.004589058,0.96184105,0.0046811337,0.01709481],"study_design_scores_gemma":[0.000037090438,0.000030269333,0.0026903339,0.00003538492,0.000044160726,0.00058605534,0.00030817062,0.014419498,0.0013074344,0.9775219,0.0029996592,0.000020034815],"about_ca_topic_score_codex":0.0009339409,"about_ca_topic_score_gemma":0.0011504069,"teacher_disagreement_score":0.017455548,"about_ca_system_score_codex":0.0008671742,"about_ca_system_score_gemma":0.00031738018,"threshold_uncertainty_score":0.05839461},"labels":[],"label_agreement":null},{"id":"W1551586077","doi":"10.1007/978-3-319-12340-0_20","title":"Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Planar; Mathematics; Constant (computer programming); Treewidth; Graph; Discrete mathematics; Physics; Pathwidth; Computer science","score_opus":0.0165859407235565,"score_gpt":0.28004999691450977,"score_spread":0.26346405619095326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551586077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11314021,0.0031400735,0.82385707,0.0022614037,0.00042262467,0.00056936685,0.0031882024,0.013473173,0.039947942],"genre_scores_gemma":[0.26332125,0.0010046664,0.70809084,0.00051899644,0.00019002496,0.0004712218,0.007402886,0.0013751355,0.017624974],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881613,0.00016268138,0.000054670396,0.00033439446,0.00029728728,0.00033489038],"domain_scores_gemma":[0.998389,0.00063368893,0.00010577458,0.0004532069,0.00024604844,0.00017231356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073775894,0.0027755653,0.0023553597,0.0016314883,0.0012269737,0.002888047,0.0038580217,0.0019146731,0.026537545],"category_scores_gemma":[0.0032225025,0.0008511571,0.0017026908,0.0037025588,0.00079540245,0.0052207946,0.002812149,0.0031061457,0.007867556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020909514,0.0011182657,0.00163623,0.0012870423,0.00020120923,0.00024011027,0.00049973745,0.12757097,0.021096494,0.03943315,0.08874761,0.7160783],"study_design_scores_gemma":[0.0006614872,0.00026847818,0.00076468097,0.00008554906,0.00016678682,0.00030031163,0.00036282185,0.8775657,0.0076699913,0.09989977,0.012209794,0.00004469429],"about_ca_topic_score_codex":0.007229026,"about_ca_topic_score_gemma":0.011601801,"teacher_disagreement_score":0.026537545,"about_ca_system_score_codex":0.0025590772,"about_ca_system_score_gemma":0.0031869914,"threshold_uncertainty_score":0.08877689},"labels":[],"label_agreement":null},{"id":"W1554183532","doi":"10.1007/s10107-016-1041-3","title":"An axiomatic duality framework for the theta body and related convex corners","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Mathematics; Polytope; Combinatorics; Discrete mathematics","score_opus":0.03534091095242158,"score_gpt":0.3469610993440978,"score_spread":0.3116201883916762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554183532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022981105,0.00062210544,0.88927776,0.0031469292,0.00039705637,0.000062572195,0.00027601406,0.00016528649,0.083071075],"genre_scores_gemma":[0.6222122,0.0015900672,0.32710743,0.0025303285,0.0011811232,0.0005067365,0.0007306204,0.00046906245,0.043672413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988794,0.00042844628,0.000060809678,0.0002671852,0.00022056607,0.00014360408],"domain_scores_gemma":[0.99867237,0.000610529,0.00011589628,0.00020057803,0.00024712353,0.00015347717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002001014,0.00077086483,0.00090197555,0.0018696614,0.0023911123,0.004223857,0.0019803923,0.0018479889,0.012076503],"category_scores_gemma":[0.0039041426,0.0007601214,0.0018178212,0.0019179328,0.006345914,0.009556095,0.0047370614,0.006672739,0.001518908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016742192,0.0000023039843,0.000016126802,0.0000046713944,8.906096e-7,0.0000065980457,0.000027170998,0.00015295623,0.000036596866,0.9988207,0.0002816834,0.0006486876],"study_design_scores_gemma":[0.0000035840978,0.000003372093,0.000018143026,0.000004743171,0.00000169008,0.000013864121,0.00002802254,0.0014445295,0.00004259192,0.99678814,0.0016486363,0.0000026901778],"about_ca_topic_score_codex":0.0010349262,"about_ca_topic_score_gemma":0.0010375308,"teacher_disagreement_score":0.012076503,"about_ca_system_score_codex":0.0015471978,"about_ca_system_score_gemma":0.0010131578,"threshold_uncertainty_score":0.04039991},"labels":[],"label_agreement":null},{"id":"W1554852049","doi":"10.1007/978-3-642-15369-3_25","title":"Maximum Flows on Disjoint Paths","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Upper and lower bounds; Combinatorics; Maximum flow problem; Mathematics; Path (computing); Enhanced Data Rates for GSM Evolution; Flow (mathematics); Simple (philosophy); Constant (computer programming); Flow network; Planar; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.01871409523069201,"score_gpt":0.2704832735398518,"score_spread":0.2517691783091598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554852049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10639232,0.0050730715,0.49471113,0.002807425,0.00074709434,0.00022202216,0.0010927126,0.0006101934,0.38834396],"genre_scores_gemma":[0.54251444,0.010513463,0.29789355,0.00084695994,0.001385881,0.0006964006,0.0021620907,0.0007909954,0.14319621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952507,0.00010825502,0.000026583106,0.000117315,0.00014765993,0.00007521188],"domain_scores_gemma":[0.99843544,0.0010727886,0.00009461978,0.00014846353,0.00012317547,0.00012543717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057405117,0.0011346007,0.00091314426,0.002092672,0.001559313,0.001823092,0.0010526929,0.0009928411,0.012819851],"category_scores_gemma":[0.0032590448,0.0010997473,0.00094679784,0.0027770572,0.0013295669,0.006250375,0.002683163,0.00306506,0.0013059673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007250557,0.00003265677,0.000104046616,0.00027021373,0.000018646098,0.000049376937,0.00019561968,0.0067590303,0.0018133873,0.9310666,0.007992003,0.05162591],"study_design_scores_gemma":[0.000013265243,0.000013412998,0.0001232672,0.000041443192,0.000012089814,0.000077298515,0.000037568705,0.0056086434,0.0005925527,0.9825508,0.010922806,0.0000067801807],"about_ca_topic_score_codex":0.00047235572,"about_ca_topic_score_gemma":0.0006171215,"teacher_disagreement_score":0.012819851,"about_ca_system_score_codex":0.0010546765,"about_ca_system_score_gemma":0.00054199714,"threshold_uncertainty_score":0.042886674},"labels":[],"label_agreement":null},{"id":"W1558213091","doi":"10.1007/978-3-540-79719-7_10","title":"Complexity and Algorithms for Well-Structured k-SAT Instances","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bounded function; Treewidth; Combinatorics; Constructive; Discrete mathematics; Path (computing); Computational complexity theory; Algorithm; Graph; Pathwidth; Computer science; Line graph","score_opus":0.047337264908975586,"score_gpt":0.30210024391376333,"score_spread":0.2547629790047877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558213091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12062952,0.006157065,0.77249223,0.013630109,0.0006220455,0.0005631462,0.0046626376,0.0022915923,0.07895171],"genre_scores_gemma":[0.49053478,0.004559774,0.4603038,0.0015722392,0.001650126,0.0012634917,0.009613578,0.0012868204,0.029215353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957216,0.0012805499,0.0003176902,0.0009988266,0.0011761913,0.0005051538],"domain_scores_gemma":[0.9767825,0.01854349,0.00093296956,0.002408101,0.00082849397,0.000504454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00291487,0.0017437232,0.001951187,0.0021338856,0.001937578,0.010546583,0.0049429666,0.003233666,0.018929066],"category_scores_gemma":[0.018752465,0.0020847744,0.0040309518,0.00551813,0.003331217,0.020749329,0.00456831,0.009623426,0.0034204978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075725274,0.00049853144,0.0024359243,0.0014005797,0.00023448058,0.00020758262,0.00081441645,0.093167774,0.0038672606,0.72632617,0.03520554,0.13508458],"study_design_scores_gemma":[0.000085277636,0.000030998388,0.00037925327,0.000053168893,0.000056259974,0.0001447076,0.000107876105,0.1093656,0.0008683533,0.8857652,0.0031138281,0.000029483532],"about_ca_topic_score_codex":0.0019930047,"about_ca_topic_score_gemma":0.0033307076,"teacher_disagreement_score":0.018929066,"about_ca_system_score_codex":0.0043774624,"about_ca_system_score_gemma":0.0029605338,"threshold_uncertainty_score":0.063324034},"labels":[],"label_agreement":null},{"id":"W1559047461","doi":"","title":"Simple, Linear-Time Modular Decomposition","year":2007,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modular decomposition; Modular design; Computer science; Simple (philosophy); Time complexity; Decomposition; Undirected graph; Graph theory; Algorithm; Theoretical computer science; Graph; Tree decomposition; Linear programming; Mathematical optimization; Mathematics; Line graph; Combinatorics; Pathwidth","score_opus":0.041609745378921245,"score_gpt":0.23058745137637693,"score_spread":0.18897770599745567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559047461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13648613,0.0008702526,0.7095853,0.0043662903,0.0015391718,0.000702533,0.002420492,0.0044641276,0.13956574],"genre_scores_gemma":[0.56188554,0.0011415277,0.27195698,0.0014867893,0.0025612116,0.00040808643,0.005106072,0.0016343162,0.15381959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991671,0.00012576551,0.00003471075,0.00026903022,0.00023108248,0.00017240692],"domain_scores_gemma":[0.9983729,0.0004836617,0.00015004282,0.0003545777,0.0003364608,0.00030231537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088127895,0.0013881155,0.0010458182,0.0007549875,0.0011823716,0.002902058,0.0012435918,0.00088396226,0.039297376],"category_scores_gemma":[0.0028568574,0.00048074953,0.0013524811,0.0012141851,0.0010368559,0.0045335228,0.0020420097,0.002266939,0.010542294],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016260027,0.0009043058,0.0012989915,0.0014261918,0.00014511199,0.00072287704,0.0006028085,0.016165512,0.03732929,0.5731112,0.11800135,0.24866639],"study_design_scores_gemma":[0.00025857097,0.00017204414,0.00050949334,0.000037412847,0.000068789865,0.00041651638,0.00010140822,0.02358496,0.0069922474,0.9428052,0.025017567,0.000035818095],"about_ca_topic_score_codex":0.00035267542,"about_ca_topic_score_gemma":0.001002182,"teacher_disagreement_score":0.039297376,"about_ca_system_score_codex":0.0012355014,"about_ca_system_score_gemma":0.001178988,"threshold_uncertainty_score":0.13146281},"labels":[],"label_agreement":null},{"id":"W1559782353","doi":"10.1002/jgt.21797","title":"Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Conjecture; Claw; Homogeneous; Complement (music); Graph; Discrete mathematics; Pathwidth; Indifference graph; Strong perfect graph theorem; Chordal graph; 1-planar graph; Line graph","score_opus":0.009072508602622455,"score_gpt":0.2538911671698522,"score_spread":0.24481865856722976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559782353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8320849,0.0008023336,0.11484478,0.006219226,0.00018795254,0.000065968925,0.0004094831,0.0003540585,0.045031287],"genre_scores_gemma":[0.9889698,0.00015784288,0.007434226,0.00037835952,0.00008260519,0.000030081033,0.00023118113,0.000031474727,0.0026845091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988708,0.00025513332,0.000051533305,0.00038802158,0.00022050635,0.00021392149],"domain_scores_gemma":[0.99275196,0.003960542,0.000877411,0.0010697978,0.00058897404,0.00075128925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002081442,0.00053887273,0.0007045976,0.0013242093,0.0020125236,0.00230378,0.0013182077,0.0013077641,0.005937072],"category_scores_gemma":[0.0059055295,0.00050138525,0.0006809994,0.0015414417,0.0041437815,0.0047201025,0.0021698982,0.0028872793,0.0003512527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001712321,0.00014906684,0.0045676176,0.0001377431,0.000027683493,0.00035075858,0.00071768754,0.006563165,0.0039929007,0.9662021,0.0039535565,0.013166512],"study_design_scores_gemma":[0.00003800199,0.0000581449,0.0012554143,0.000028908431,0.00002019158,0.0001956478,0.00069115515,0.010375765,0.002178238,0.9822295,0.002906308,0.000022704386],"about_ca_topic_score_codex":0.0027543826,"about_ca_topic_score_gemma":0.003243365,"teacher_disagreement_score":0.005937072,"about_ca_system_score_codex":0.0010825163,"about_ca_system_score_gemma":0.0006804966,"threshold_uncertainty_score":0.01986146},"labels":[],"label_agreement":null},{"id":"W1559927413","doi":"","title":"Detecting Backdoor Sets with Respect to Horn and Binary Clauses.","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Backdoor; Parameterized complexity; Satisfiability; Mathematics; Class (philosophy); Set (abstract data type); Binary number; Discrete mathematics; Combinatorics; Boolean satisfiability problem; French horn; Computer science; Artificial intelligence; Arithmetic; Physics","score_opus":0.024991978151011344,"score_gpt":0.30241421303184235,"score_spread":0.277422234880831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559927413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.664178,0.0008813881,0.31928143,0.0030134532,0.000122139,0.00090388634,0.002315026,0.0035629454,0.005741721],"genre_scores_gemma":[0.9038387,0.00022562424,0.09154609,0.0004197217,0.000079147045,0.00021981266,0.0019181529,0.000272488,0.0014801683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9878974,0.0033994322,0.0008257879,0.0025129411,0.003165949,0.0021985045],"domain_scores_gemma":[0.8878602,0.09039079,0.009999744,0.008330133,0.0020217083,0.00139738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006381895,0.0014255437,0.0023670369,0.0016385355,0.0018327825,0.006286812,0.004481759,0.0032175991,0.0051750145],"category_scores_gemma":[0.06035684,0.0017884269,0.0033696184,0.002317556,0.0036720084,0.01628895,0.004338378,0.00444183,0.0004449666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0072414437,0.0018747485,0.03249217,0.0018869656,0.001940734,0.0022988527,0.0014482846,0.58373225,0.044717103,0.14542453,0.011985028,0.16495787],"study_design_scores_gemma":[0.00040640298,0.0003768829,0.002519731,0.00007198542,0.00032623028,0.00075202354,0.00039922664,0.7921004,0.025007168,0.17623654,0.0017206768,0.000082814906],"about_ca_topic_score_codex":0.006057562,"about_ca_topic_score_gemma":0.0054030833,"teacher_disagreement_score":0.006381895,"about_ca_system_score_codex":0.0045164893,"about_ca_system_score_gemma":0.0038569772,"threshold_uncertainty_score":0.03375113},"labels":[],"label_agreement":null},{"id":"W1560744624","doi":"10.1007/978-3-642-13078-6_5","title":"Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Pedigree chart; Computer science; Algorithm; Recombination; Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematics; Artificial intelligence; Genetics; Biology","score_opus":0.024338078797069902,"score_gpt":0.274277897785305,"score_spread":0.24993981898823509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560744624","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016104724,0.0002385739,0.97383386,0.00034612435,0.00009797349,0.000301796,0.00052396994,0.0032385166,0.0053144596],"genre_scores_gemma":[0.09259618,0.00013429878,0.8970784,0.00015391133,0.000059748723,0.0006289909,0.0014258636,0.0007137887,0.0072088866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772054,0.00065071974,0.00015806755,0.0008330063,0.00034321522,0.00029435812],"domain_scores_gemma":[0.9919641,0.003428775,0.0002432409,0.003436661,0.000689035,0.00023819454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026694401,0.0014298455,0.0020710682,0.0017235769,0.0018931538,0.0025559731,0.007361925,0.0035457301,0.022812957],"category_scores_gemma":[0.012139509,0.001110863,0.0018722177,0.003292103,0.0015356599,0.0069790166,0.0039012877,0.0026624682,0.007708647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015158043,0.00063601416,0.0025798427,0.0005434849,0.0003374021,0.0003398289,0.0006830533,0.15213509,0.007285835,0.09531415,0.029461037,0.7091684],"study_design_scores_gemma":[0.0010139906,0.00019865776,0.0007410534,0.00009345418,0.00020819373,0.00055143674,0.00023748493,0.60380703,0.006201791,0.37146524,0.01535631,0.00012539205],"about_ca_topic_score_codex":0.0036946973,"about_ca_topic_score_gemma":0.005965334,"teacher_disagreement_score":0.022812957,"about_ca_system_score_codex":0.0019982308,"about_ca_system_score_gemma":0.0041568596,"threshold_uncertainty_score":0.07631695},"labels":[],"label_agreement":null},{"id":"W1561229603","doi":"10.1007/11564751_30","title":"Maximum Constraint Satisfaction on Diamonds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Constraint satisfaction problem; Constraint (computer-aided design); Computer science; Constraint satisfaction dual problem; Lattice (music); Constraint satisfaction; Domain (mathematical analysis); Mathematical optimization; Combinatorics; Mathematics; Local consistency; Artificial intelligence; Geometry","score_opus":0.020528245553279045,"score_gpt":0.2781065930185123,"score_spread":0.2575783474652333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561229603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06128198,0.0015408453,0.78859586,0.0017911162,0.00030940087,0.0001999823,0.0017545754,0.0005982217,0.14392804],"genre_scores_gemma":[0.4583171,0.0017736858,0.48027307,0.0005713163,0.00023492613,0.00038741817,0.0034284126,0.0005045865,0.054509547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989415,0.00033212098,0.00006630716,0.00015268162,0.0003928901,0.00011459539],"domain_scores_gemma":[0.99741864,0.001761561,0.00011890678,0.00022755316,0.00035643403,0.00011689195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010260796,0.0006709951,0.0011392187,0.0009843596,0.0010415834,0.0017843838,0.0017510651,0.0008764284,0.012442602],"category_scores_gemma":[0.0048770765,0.00091457355,0.0009882108,0.00302813,0.0010441168,0.0027389314,0.0020362525,0.0026470704,0.0011221953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001240224,0.000059256174,0.0002546061,0.0006388892,0.000036498248,0.00012847285,0.0003209072,0.030433293,0.0037386573,0.84597886,0.02034495,0.097941555],"study_design_scores_gemma":[0.000040135445,0.000021726613,0.00013044996,0.000053952856,0.000009161725,0.0000682162,0.00008319549,0.04468253,0.0011633557,0.9409331,0.012801753,0.000012385745],"about_ca_topic_score_codex":0.0026171608,"about_ca_topic_score_gemma":0.00389167,"teacher_disagreement_score":0.012442602,"about_ca_system_score_codex":0.00089448143,"about_ca_system_score_gemma":0.0007846611,"threshold_uncertainty_score":0.041624606},"labels":[],"label_agreement":null},{"id":"W1561371316","doi":"","title":"Linear vertex arboricity, independence number and clique cover number","year":2001,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Arboricity; Independence number; Mathematics; Combinatorics; Vertex (graph theory); Vertex cover; Degeneracy (biology); Clique; Upper and lower bounds; Independence (probability theory); Edge cover; Discrete mathematics; Graph; Statistics; Planar graph; Biology","score_opus":0.012966408040262192,"score_gpt":0.24617425426983983,"score_spread":0.23320784622957763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561371316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49571908,0.0040127537,0.41009712,0.0023160346,0.00014653894,0.00017752277,0.0030492255,0.0014007849,0.08308097],"genre_scores_gemma":[0.9588725,0.0014855462,0.032115843,0.00017464103,0.0002989564,0.0001258935,0.0014769743,0.00013625853,0.0053134686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997797,0.00037758512,0.00010605682,0.00053485617,0.00075400056,0.00043046224],"domain_scores_gemma":[0.97941154,0.01550263,0.0016885946,0.0013684734,0.0008829813,0.001145707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015225542,0.00075225957,0.0005983972,0.00287883,0.00072305824,0.001911259,0.0016106395,0.00080361974,0.0054239742],"category_scores_gemma":[0.011250623,0.00057467195,0.00077144394,0.003011586,0.002674205,0.005050765,0.0019186921,0.0016715833,0.000759372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001425303,0.00043797505,0.052189644,0.001208788,0.0003470291,0.0017173502,0.0006788823,0.18847564,0.035978016,0.5433494,0.016539993,0.15765193],"study_design_scores_gemma":[0.000061081504,0.00031660259,0.020279907,0.000118282835,0.0001793384,0.002910653,0.0002258552,0.31014004,0.02372909,0.63124394,0.010683912,0.000111272435],"about_ca_topic_score_codex":0.00091774313,"about_ca_topic_score_gemma":0.0014598116,"teacher_disagreement_score":0.0054239742,"about_ca_system_score_codex":0.0011641396,"about_ca_system_score_gemma":0.00057762605,"threshold_uncertainty_score":0.018144965},"labels":[],"label_agreement":null},{"id":"W156247037","doi":"","title":"Notes on factor-critically, extendability and independence number.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Factor (programming language); Independence number; Discrete mathematics; Statistics; Computer science; Programming language","score_opus":0.02805785495427411,"score_gpt":0.3083864145964977,"score_spread":0.2803285596422236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156247037","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048382398,0.010599115,0.09194366,0.012065889,0.0017879754,0.000049722283,0.00085002603,0.00026242103,0.83405876],"genre_scores_gemma":[0.85382676,0.011678276,0.02858523,0.0028421653,0.0042546173,0.00016728052,0.0010184802,0.0002565033,0.097370714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992132,0.00015011756,0.0000475994,0.00019659456,0.00027114555,0.00012126646],"domain_scores_gemma":[0.9952709,0.0033087253,0.00021642356,0.0004890492,0.0004386167,0.00027624087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012480137,0.00073323044,0.00067177,0.0021252087,0.0013471069,0.0019436964,0.0008332208,0.000977613,0.019256683],"category_scores_gemma":[0.0058606975,0.00042869058,0.00076117786,0.0026057158,0.0057030157,0.007568701,0.0022511992,0.005765454,0.0019132192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022973967,0.000012852223,0.00018079836,0.000051209983,0.0000069417233,0.00005543629,0.00012286066,0.00025362184,0.00026501383,0.9857927,0.0055759037,0.007659691],"study_design_scores_gemma":[0.0000071053396,0.000009315029,0.0003924071,0.0000134411985,0.0000075046128,0.0000931698,0.000041543084,0.00028332582,0.00019043723,0.9866432,0.0123127075,0.0000058912983],"about_ca_topic_score_codex":0.0016241983,"about_ca_topic_score_gemma":0.0018255006,"teacher_disagreement_score":0.019256683,"about_ca_system_score_codex":0.0014313421,"about_ca_system_score_gemma":0.0005407293,"threshold_uncertainty_score":0.064420044},"labels":[],"label_agreement":null},{"id":"W156285056","doi":"","title":"K-Dominating Sets of Cardinal Products of Paths.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regular cardinal; Combinatorics","score_opus":0.015076404813184943,"score_gpt":0.2741882838147326,"score_spread":0.25911187900154764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156285056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84237665,0.0016353575,0.10653057,0.00036356132,0.00010887114,0.000110897585,0.0022146695,0.00024248657,0.046416886],"genre_scores_gemma":[0.9424231,0.0006931574,0.04536219,0.00008702258,0.00006569178,0.00011116259,0.0012417539,0.00006614396,0.009949647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992244,0.00012773972,0.000057251727,0.00025167517,0.00020032197,0.00013845917],"domain_scores_gemma":[0.9955519,0.00289653,0.0005482186,0.00028142176,0.00031154233,0.0004104852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071345596,0.0004970322,0.00041067784,0.0014573288,0.0013852636,0.002651159,0.00066236884,0.0003431174,0.0048292107],"category_scores_gemma":[0.0043844134,0.00044338222,0.0004965393,0.001130564,0.0011008501,0.003458552,0.001096658,0.00076409464,0.0006386565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013837133,0.00018030603,0.026210403,0.00107554,0.00017950856,0.0008814024,0.0022974312,0.0366725,0.034938548,0.7921405,0.0064825634,0.09755751],"study_design_scores_gemma":[0.00010094028,0.0002737871,0.014396904,0.00023979179,0.00014051977,0.003810653,0.0010741119,0.06763492,0.025119742,0.8354123,0.05169678,0.00009963184],"about_ca_topic_score_codex":0.00061147404,"about_ca_topic_score_gemma":0.0010405757,"teacher_disagreement_score":0.0048292107,"about_ca_system_score_codex":0.0012101948,"about_ca_system_score_gemma":0.00046672637,"threshold_uncertainty_score":0.016155303},"labels":[],"label_agreement":null},{"id":"W156526445","doi":"","title":"Transformation of Spanning Trees in a 2-Connected Graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Spanning tree; Mathematics; Transformation (genetics); Connected dominating set; Graph; Combinatorics; Chemistry","score_opus":0.01830503032991665,"score_gpt":0.27788232892317394,"score_spread":0.2595772985932573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156526445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5028528,0.0003929052,0.3566652,0.0005673834,0.00045374117,0.00022754198,0.00060991006,0.0017597098,0.13647084],"genre_scores_gemma":[0.9004378,0.00027109918,0.07113828,0.0001821873,0.00006749042,0.00009046077,0.0005866869,0.00052462664,0.02670143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982077,0.000044501692,0.0000072462412,0.000041593587,0.000050673465,0.000035189303],"domain_scores_gemma":[0.9997651,0.000081036036,0.000032120737,0.000059108497,0.000029019528,0.00003358362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010596557,0.0002546381,0.00017805846,0.0006945636,0.0005072213,0.0006037727,0.00034598302,0.00048537183,0.008549927],"category_scores_gemma":[0.000793894,0.00017874756,0.00039517623,0.00055672927,0.00039317994,0.00088424736,0.00075605983,0.00056965946,0.0016597245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019016425,0.0002379607,0.0009594134,0.00016052424,0.000038674243,0.0012017111,0.001130047,0.019453533,0.058246292,0.7796761,0.011037748,0.127668],"study_design_scores_gemma":[0.000061996594,0.00009946315,0.0014288832,0.000035837886,0.000026908876,0.0010396963,0.00046404268,0.06250944,0.020960687,0.87888855,0.034460038,0.000024525169],"about_ca_topic_score_codex":0.0005118162,"about_ca_topic_score_gemma":0.00085505174,"teacher_disagreement_score":0.008549927,"about_ca_system_score_codex":0.00023450938,"about_ca_system_score_gemma":0.00018345576,"threshold_uncertainty_score":0.028602362},"labels":[],"label_agreement":null},{"id":"W1566398300","doi":"10.5555/1496770.1496895","title":"List-color-critical graphs on a fixed surface","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; List coloring; Discrete mathematics; Vertex (graph theory); Graph; Edge coloring; Graph coloring; Graph power; Line graph","score_opus":0.02510923386739464,"score_gpt":0.3320261162720462,"score_spread":0.30691688240465154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566398300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8647011,0.0002885282,0.120182395,0.0012723252,0.000025853893,0.000114969705,0.00095951516,0.0008682761,0.0115869995],"genre_scores_gemma":[0.9371316,0.0003603894,0.05238859,0.00019073955,0.00004395452,0.0001309302,0.0028911757,0.0001795455,0.0066830907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945396,0.00006389627,0.000029977522,0.00020100607,0.0001355464,0.00011557921],"domain_scores_gemma":[0.99788684,0.0010559065,0.00027340828,0.00033463052,0.00021510756,0.00023414975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003449989,0.0006389813,0.00082038145,0.00076509756,0.0011520227,0.0019274281,0.0009957886,0.0011235469,0.0053014397],"category_scores_gemma":[0.0027048024,0.00060123997,0.00096971914,0.0011514297,0.001710322,0.003345776,0.001871123,0.001737232,0.0006657737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016143454,0.00038842385,0.017382108,0.0010479151,0.0001303682,0.0023757848,0.0023687808,0.31859365,0.07014172,0.49998868,0.011529398,0.07443879],"study_design_scores_gemma":[0.00020549375,0.00028172883,0.0065132976,0.00008321002,0.00008975431,0.000815071,0.0013172859,0.28894666,0.025348138,0.66260207,0.0137130935,0.00008418453],"about_ca_topic_score_codex":0.0021367976,"about_ca_topic_score_gemma":0.0020781544,"teacher_disagreement_score":0.0053014397,"about_ca_system_score_codex":0.0018307763,"about_ca_system_score_gemma":0.00069014414,"threshold_uncertainty_score":0.017735124},"labels":[],"label_agreement":null},{"id":"W1567455550","doi":"10.4230/dagrep.4.2.38","title":"Graph Modification Problems (Dagstuhl Seminar 14071)","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Universität Ulm; Université de Montpellier; Universität Rostock; Korea Advanced Institute of Science and Technology; Technische Universität Berlin; University of Haifa; National and Kapodistrian University of Athens; Goethe-Universität Frankfurt am Main; Magyar Tudományos Akadémia; Universität Trier; Durham University; University of Oregon; Universitetet i Bergen; University of Leeds; Uniwersytet Warszawski; Indian Institute of Science; University of Toronto; University of Ioannina; Universiteit Maastricht","keywords":"Graph; Computer science; Theoretical computer science","score_opus":0.023628448558856565,"score_gpt":0.2844284748760495,"score_spread":0.26080002631719296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567455550","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040072862,0.072481215,0.14116,0.17080782,0.03539886,0.0005496682,0.009631948,0.0033437116,0.526554],"genre_scores_gemma":[0.35538366,0.03471143,0.11172428,0.020161917,0.020372435,0.0012778989,0.021573802,0.0022889788,0.43250564],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814343,0.0005330469,0.00007262609,0.00035600283,0.00064956956,0.00024539445],"domain_scores_gemma":[0.9988734,0.00040658546,0.00007912823,0.00014127187,0.00018067122,0.00031883293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002232301,0.0013395222,0.0010644074,0.0016251473,0.001637111,0.002818608,0.001487671,0.0022521,0.043565877],"category_scores_gemma":[0.00405857,0.000574113,0.0010178249,0.002231752,0.0012387666,0.0028458824,0.002746913,0.004651709,0.013612913],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002780871,0.0001647259,0.00023119945,0.00034866287,0.000039663515,0.00015908632,0.00017261511,0.0025878076,0.0014742225,0.27980098,0.6052328,0.10951023],"study_design_scores_gemma":[0.00016607466,0.00010472839,0.0013653408,0.00021694804,0.00004017332,0.00022857894,0.000103118495,0.003815101,0.0018742434,0.49769267,0.4943459,0.000047077017],"about_ca_topic_score_codex":0.0019309169,"about_ca_topic_score_gemma":0.0025751707,"teacher_disagreement_score":0.043565877,"about_ca_system_score_codex":0.0037267318,"about_ca_system_score_gemma":0.0020824603,"threshold_uncertainty_score":0.14574236},"labels":[],"label_agreement":null},{"id":"W1567556142","doi":"10.5555/2133036.2133167","title":"The dichotomy of list homomorphisms for digraphs","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Mathematics; Conjecture; Discrete mathematics; Constraint satisfaction problem","score_opus":0.048820308952243,"score_gpt":0.2849847899260437,"score_spread":0.23616448097380072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567556142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6097553,0.0015871819,0.28897175,0.0066730645,0.00017715018,0.00017021994,0.0014467314,0.0005867541,0.09063182],"genre_scores_gemma":[0.96322066,0.0005751392,0.02630467,0.0006797933,0.00016050789,0.00020528056,0.0009806417,0.000061433006,0.007811899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786973,0.0005677575,0.00018787297,0.0005684109,0.00042910734,0.00037720447],"domain_scores_gemma":[0.99322706,0.004609493,0.00046561705,0.00063937355,0.000522314,0.00053608196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020605873,0.00029002034,0.00062479236,0.0018278925,0.0024390148,0.0050826236,0.000962777,0.0014392801,0.0079199],"category_scores_gemma":[0.0070698946,0.00046236772,0.00085022213,0.0014507904,0.0038150796,0.008876271,0.003162076,0.0033454818,0.0007524137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054851414,0.000039113937,0.000709145,0.00006278528,0.000007867176,0.00008337021,0.0005653285,0.00074827956,0.00076320476,0.98774856,0.000884886,0.00833257],"study_design_scores_gemma":[0.000028161228,0.000031572636,0.00053385895,0.000031062078,0.00000877453,0.0001454616,0.00036905712,0.004472163,0.00063460623,0.9904421,0.0032878774,0.00001530339],"about_ca_topic_score_codex":0.0009846339,"about_ca_topic_score_gemma":0.0007531906,"teacher_disagreement_score":0.0079199,"about_ca_system_score_codex":0.0021272982,"about_ca_system_score_gemma":0.0010481906,"threshold_uncertainty_score":0.026494741},"labels":[],"label_agreement":null},{"id":"W1568391928","doi":"10.37236/5180","title":"The Bondage Number of Random Graphs","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Domination analysis; Mathematics; Dominating set; Vertex (graph theory); Graph; Upper and lower bounds; Bound graph; Neighbourhood (mathematics); Discrete mathematics; Graph power; Line graph","score_opus":0.010165258565285135,"score_gpt":0.29121616005334944,"score_spread":0.28105090148806433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568391928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50055426,0.003934906,0.41110325,0.006711362,0.00028440822,0.0002263436,0.0009890744,0.00073342357,0.07546297],"genre_scores_gemma":[0.9456595,0.0029744857,0.032248273,0.00065120624,0.0005150738,0.00044221611,0.00056877197,0.00028441852,0.016656078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828184,0.00054442143,0.000054088992,0.00044493773,0.00039474637,0.000279936],"domain_scores_gemma":[0.98525697,0.010629434,0.0010364213,0.00096558256,0.0007120177,0.0013995572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019098151,0.0010291856,0.0013044159,0.0025087115,0.0017306966,0.0031687883,0.0021103756,0.0017934282,0.006614885],"category_scores_gemma":[0.02172865,0.00079060317,0.0008663998,0.0015082569,0.004109492,0.0066309976,0.002829945,0.0028577663,0.0010032911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022425536,0.00005188268,0.0022164409,0.00014520914,0.000048109225,0.0002050992,0.00037015992,0.028747732,0.0067505827,0.9440528,0.0056996085,0.011488188],"study_design_scores_gemma":[0.00005315484,0.00007091845,0.0011769631,0.000057243567,0.000034009397,0.00035024175,0.00009105848,0.1920734,0.0032611226,0.7965612,0.006220917,0.00004980684],"about_ca_topic_score_codex":0.0013581825,"about_ca_topic_score_gemma":0.00093349785,"teacher_disagreement_score":0.006614885,"about_ca_system_score_codex":0.0021803083,"about_ca_system_score_gemma":0.00070727995,"threshold_uncertainty_score":0.022129},"labels":[],"label_agreement":null},{"id":"W1572300247","doi":"10.55016/ojs/cdm.v5i2.62000","title":"Connected domination dot-critical graphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.012747377189052157,"score_gpt":0.3389732156815263,"score_spread":0.3262258384924741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572300247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75809634,0.0012312821,0.14421773,0.00080419576,0.00008176885,0.00033239738,0.0011916829,0.00039172597,0.09365293],"genre_scores_gemma":[0.96672744,0.0005577538,0.019896388,0.00019871628,0.000058183276,0.00012458897,0.0009342623,0.000049170903,0.011453498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997559,0.000023455708,0.00001054372,0.00007264601,0.000074783406,0.00006275026],"domain_scores_gemma":[0.9986765,0.00040132782,0.00024808536,0.0001064055,0.0002707346,0.00029697313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019617591,0.00038806963,0.0003330234,0.0016473109,0.0009353305,0.0010230064,0.00045859476,0.0003895567,0.0046648504],"category_scores_gemma":[0.0015426279,0.0002546539,0.00019860225,0.0010706348,0.0010888444,0.0010409579,0.00088745565,0.00056563166,0.00040990923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029022712,0.00006779082,0.005444871,0.000270261,0.000045173503,0.00090920937,0.0010716808,0.019352883,0.024477828,0.898703,0.008077118,0.04128985],"study_design_scores_gemma":[0.00010475631,0.00014339726,0.005909477,0.00008568106,0.000060617374,0.0022646599,0.0008077347,0.099776104,0.013966941,0.8051373,0.071694076,0.000049245264],"about_ca_topic_score_codex":0.0016485096,"about_ca_topic_score_gemma":0.0020478414,"teacher_disagreement_score":0.0046648504,"about_ca_system_score_codex":0.0010732103,"about_ca_system_score_gemma":0.00055245706,"threshold_uncertainty_score":0.01560545},"labels":[],"label_agreement":null},{"id":"W1572651318","doi":"10.1016/j.disc.2006.05.018","title":"A characterization of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-comparability graphs","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Bipartite graph; Mathematics; Comparability; Combinatorics; Graph; Transitive relation; Characterization (materials science); Path (computing); Discrete mathematics; Computer science","score_opus":0.021004266821016766,"score_gpt":0.257866261394366,"score_spread":0.23686199457334925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572651318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20168182,0.0008636804,0.42672858,0.008969657,0.00059672876,0.0005140958,0.00843857,0.0018666192,0.35034025],"genre_scores_gemma":[0.8312232,0.0010143846,0.07474996,0.0017480644,0.0011746576,0.0005303503,0.01210155,0.001276773,0.07618105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998075,0.00033847743,0.0001229408,0.00074180344,0.00044232004,0.0002794646],"domain_scores_gemma":[0.987909,0.006337128,0.0018193434,0.0013416455,0.0015567405,0.0010360254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012962562,0.00087119837,0.00059037976,0.0030196172,0.002365836,0.004838124,0.0021093695,0.0015178596,0.04738653],"category_scores_gemma":[0.011097334,0.0006009472,0.001043205,0.0036544865,0.0023825057,0.008951604,0.0022434902,0.002900731,0.004794494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013226578,0.00010418696,0.0014331973,0.00015831801,0.000021303906,0.0002381615,0.00042844817,0.0018127932,0.002371621,0.9610556,0.012757866,0.019486332],"study_design_scores_gemma":[0.000033498593,0.00006967486,0.0017759042,0.00006636411,0.000028703436,0.0008873722,0.00032870084,0.009241879,0.0030368497,0.942852,0.04165399,0.000025102236],"about_ca_topic_score_codex":0.0013198309,"about_ca_topic_score_gemma":0.001413083,"teacher_disagreement_score":0.04738653,"about_ca_system_score_codex":0.0026323274,"about_ca_system_score_gemma":0.0012653123,"threshold_uncertainty_score":0.15852374},"labels":[],"label_agreement":null},{"id":"W1572981224","doi":"10.1007/978-3-0348-8211-8_6","title":"Enumération des 2-arbres k-gonaux","year":2002,"lang":"fr","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Generalization; Quadrilateral; Combinatorics; Mathematics; Enumeration; Planar; Discrete mathematics; Computer science; Mathematical analysis; Physics","score_opus":0.10904042213735254,"score_gpt":0.29169895484272435,"score_spread":0.1826585327053718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572981224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37702477,0.002549484,0.4603506,0.00068892643,0.00042314356,0.00017147491,0.0019910217,0.0013912225,0.15540941],"genre_scores_gemma":[0.5962546,0.0035665783,0.27594894,0.00034272307,0.00017693448,0.00027149505,0.00385247,0.00044705102,0.11913917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961793,0.000086001826,0.000019800069,0.000073607574,0.00013719901,0.00006544422],"domain_scores_gemma":[0.9997315,0.000103522965,0.000027189264,0.00004065664,0.000074919626,0.000022209673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022472748,0.000679116,0.0005193796,0.0009141502,0.000986682,0.0019250619,0.0006128997,0.0006516752,0.009833788],"category_scores_gemma":[0.0008611009,0.0004110352,0.0005340554,0.0014281907,0.0009939972,0.0017303654,0.0007677985,0.0014397838,0.0030678397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018830481,0.000102070895,0.0029462248,0.00051476207,0.000040602194,0.00064227916,0.0008034583,0.023054132,0.020196458,0.6235407,0.012044366,0.3159266],"study_design_scores_gemma":[0.000101660014,0.00021822448,0.007477044,0.0002819109,0.00004732763,0.0023773988,0.0009317524,0.11366768,0.026454449,0.58639973,0.2619321,0.00011072503],"about_ca_topic_score_codex":0.003164178,"about_ca_topic_score_gemma":0.007353438,"teacher_disagreement_score":0.009833788,"about_ca_system_score_codex":0.00084054685,"about_ca_system_score_gemma":0.00038621103,"threshold_uncertainty_score":0.032897294},"labels":[],"label_agreement":null},{"id":"W1574040800","doi":"10.1007/978-3-540-72951-8_18","title":"Location Oblivious Distributed Unit Disk Graph Coloring","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Graph coloring; Computer science; List coloring; Edge coloring; Graph; Greedy coloring; Upper and lower bounds; Fractional coloring; Unit disk; Combinatorics; Chromatic scale; Algorithm; Unit disk graph; Mathematics; Theoretical computer science; Graph power; Line graph","score_opus":0.03679719369105777,"score_gpt":0.30106360173470526,"score_spread":0.2642664080436475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574040800","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071218945,0.0005850236,0.8710026,0.00120725,0.0004144974,0.00027250085,0.0011067662,0.011676417,0.042516068],"genre_scores_gemma":[0.6777484,0.0003494385,0.27924123,0.00045372845,0.00015333289,0.0003038042,0.0010416687,0.0012248799,0.039483577],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903476,0.00024704047,0.000029571594,0.00020389131,0.00026492376,0.00021989863],"domain_scores_gemma":[0.99684626,0.0007538886,0.00013673812,0.0018382762,0.00026532362,0.00015942106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005776665,0.000734224,0.0012645435,0.0005343507,0.0014261894,0.0017290193,0.003149364,0.00087752007,0.016602369],"category_scores_gemma":[0.0029546393,0.0005687496,0.0004051748,0.0019513023,0.00076960603,0.0027386723,0.0032438736,0.0015405503,0.0035700507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022220502,0.0007712425,0.0010116891,0.0008376262,0.000115548275,0.00024194668,0.00049291825,0.28659055,0.036454342,0.21994075,0.08405377,0.36726758],"study_design_scores_gemma":[0.00032481924,0.00016079059,0.00045479217,0.00003772814,0.00006418446,0.00020212443,0.00018548335,0.79600394,0.0203126,0.16611886,0.016098289,0.000036408866],"about_ca_topic_score_codex":0.0021324302,"about_ca_topic_score_gemma":0.00548852,"teacher_disagreement_score":0.016602369,"about_ca_system_score_codex":0.0019924631,"about_ca_system_score_gemma":0.0022296433,"threshold_uncertainty_score":0.055540442},"labels":[],"label_agreement":null},{"id":"W1574759554","doi":"10.1007/3-540-40996-3_3","title":"Strategies for Hotlink Assignments","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Computer science; Directed acyclic graph; Zipf's law; Web page; Constant (computer programming); Combinatorics; Set (abstract data type); Binary tree; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; World Wide Web; Programming language; Statistics","score_opus":0.02947728663966838,"score_gpt":0.3013976377944786,"score_spread":0.2719203511548102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574759554","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06326354,0.00044013083,0.55654925,0.0019988497,0.0005858667,0.00043490733,0.0005505131,0.002665603,0.3735113],"genre_scores_gemma":[0.5212088,0.0006323281,0.19419204,0.0010036645,0.00036595506,0.000686789,0.0012249048,0.0026940235,0.27799147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978294,0.00067676214,0.00011792449,0.0004389808,0.00044275384,0.0004942541],"domain_scores_gemma":[0.9935673,0.002899337,0.00025521015,0.0016492046,0.00089785154,0.0007311451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017097008,0.001202988,0.0010739216,0.0024865177,0.0047402866,0.006237034,0.003251482,0.002794745,0.067862056],"category_scores_gemma":[0.011405928,0.0011977147,0.0011511928,0.0028405318,0.001980625,0.0130425375,0.006868688,0.0033551017,0.014090405],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013764003,0.00012612998,0.00029684973,0.00014275222,0.000019558984,0.00013131037,0.000938607,0.001370784,0.0015199714,0.90864325,0.014578936,0.07209439],"study_design_scores_gemma":[0.000022774708,0.000027481185,0.00010352199,0.000037928046,0.000027228605,0.00010924742,0.00053806545,0.0087282,0.00189438,0.96644163,0.022049641,0.000019903404],"about_ca_topic_score_codex":0.00071443064,"about_ca_topic_score_gemma":0.001396244,"teacher_disagreement_score":0.067862056,"about_ca_system_score_codex":0.0011060517,"about_ca_system_score_gemma":0.0010196354,"threshold_uncertainty_score":0.22702122},"labels":[],"label_agreement":null},{"id":"W1575452258","doi":"10.46298/dmtcs.625","title":"Isomorphism of graph classes related to the circular-ones property","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph isomorphism; Combinatorics; Mathematics; Arc (geometry); Isomorphism (crystallography); Discrete mathematics; Regular polygon; Indifference graph; Graph property; Graph; Line graph; Voltage graph; Geometry; Chemistry","score_opus":0.018041717329907874,"score_gpt":0.2762916424278751,"score_spread":0.2582499250979672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575452258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27403468,0.00013046936,0.7078245,0.000634542,0.000064240856,0.0002369876,0.000454688,0.0024744086,0.014145428],"genre_scores_gemma":[0.8287872,0.00007185645,0.16546519,0.00015537253,0.00003669921,0.000112452726,0.0010179003,0.00028178448,0.004071601],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838126,0.0003205302,0.00011429762,0.0005696888,0.00037568138,0.00023851242],"domain_scores_gemma":[0.99210536,0.003222799,0.0007475367,0.0026919637,0.00088520884,0.00034709985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083395786,0.00040200955,0.00041835278,0.00091559463,0.0009768783,0.0015080258,0.0009936539,0.00065588474,0.0067738947],"category_scores_gemma":[0.006993466,0.00041806532,0.00064674765,0.0010962109,0.0014997163,0.003880543,0.0023170898,0.0012179543,0.0007246079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013017558,0.00049337663,0.014442147,0.00036934766,0.00012776956,0.000554594,0.0013571425,0.03653876,0.041421153,0.43669805,0.01109429,0.45560166],"study_design_scores_gemma":[0.00015430481,0.00021407827,0.003907041,0.000034502704,0.000067810615,0.00073628617,0.0005745786,0.19729091,0.053451948,0.7296635,0.013818552,0.0000864495],"about_ca_topic_score_codex":0.0014573954,"about_ca_topic_score_gemma":0.0013811646,"teacher_disagreement_score":0.0067738947,"about_ca_system_score_codex":0.0009854978,"about_ca_system_score_gemma":0.0011115951,"threshold_uncertainty_score":0.022660911},"labels":[],"label_agreement":null},{"id":"W1576493106","doi":"10.1007/978-3-540-85097-7_35","title":"Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Mathematics; Discrete mathematics; Computer science","score_opus":0.029438573931049136,"score_gpt":0.27957456160883376,"score_spread":0.2501359876777846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576493106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.548394,0.0014663477,0.28388393,0.0093149515,0.00040662815,0.00018063713,0.0015771664,0.0010941577,0.15368219],"genre_scores_gemma":[0.9271478,0.00082546764,0.040186904,0.0007374161,0.0003734613,0.00025477321,0.001113841,0.00029399767,0.0290663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999116,0.00020641618,0.000039048104,0.00020873167,0.00026226047,0.00016751935],"domain_scores_gemma":[0.9957675,0.0029252926,0.00019563414,0.00036937557,0.0002478402,0.0004944093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010100858,0.00072690897,0.0019679824,0.001444231,0.002360177,0.0042848154,0.0023077982,0.0024153132,0.015518792],"category_scores_gemma":[0.0051612095,0.000819968,0.0012876869,0.001634619,0.0021768762,0.007855146,0.0031559933,0.0067721657,0.0010192421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008867965,0.00007117188,0.00024438204,0.0001414561,0.000018206738,0.00007467632,0.00024835434,0.004219238,0.0011324995,0.98052406,0.0036531375,0.009584168],"study_design_scores_gemma":[0.000028677114,0.00001595125,0.0001465731,0.0000143402185,0.000011560112,0.000050172428,0.000069982525,0.014233,0.00039913415,0.98397696,0.0010455002,0.000008173429],"about_ca_topic_score_codex":0.000834318,"about_ca_topic_score_gemma":0.0012351114,"teacher_disagreement_score":0.015518792,"about_ca_system_score_codex":0.0028819551,"about_ca_system_score_gemma":0.0010908544,"threshold_uncertainty_score":0.051915526},"labels":[],"label_agreement":null},{"id":"W1576691799","doi":"10.1016/j.endm.2011.05.067","title":"Near-perfect graphs with polyhedral","year":2011,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Polytope; Mathematics; Graph; Operator (biology); Class (philosophy); Discrete mathematics; Characterization (materials science); Computer science; Physics; Chemistry; Artificial intelligence","score_opus":0.020429043359511363,"score_gpt":0.2706849358530934,"score_spread":0.25025589249358204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576691799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34537023,0.0012420409,0.3980561,0.0037503133,0.0009741275,0.000477277,0.0034901602,0.0013008765,0.24533889],"genre_scores_gemma":[0.86014616,0.0012154268,0.08748603,0.0011210045,0.00032078486,0.00039034954,0.0022129766,0.00027571907,0.04683162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983669,0.0003546437,0.00010692336,0.00040501467,0.00052476185,0.00024179087],"domain_scores_gemma":[0.99598855,0.0013202046,0.00061254745,0.0008494295,0.00043975085,0.00078947446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076780916,0.00075781776,0.0013473296,0.001570727,0.0029450213,0.0038418889,0.0017922053,0.0017536384,0.014410435],"category_scores_gemma":[0.006593207,0.0012471105,0.00093307905,0.0021527512,0.0024257968,0.006756961,0.0035291489,0.003125113,0.0022360587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117831514,0.000051222767,0.0003454442,0.00010339214,0.000017476217,0.00013505932,0.00016216397,0.0048057614,0.0010354248,0.97893655,0.0036375576,0.010652199],"study_design_scores_gemma":[0.00002849429,0.000027447992,0.000226806,0.000027225977,0.000013147917,0.00018203947,0.00012587651,0.0051751137,0.0005955304,0.98822355,0.0053607426,0.000013921683],"about_ca_topic_score_codex":0.0014279997,"about_ca_topic_score_gemma":0.0022433845,"teacher_disagreement_score":0.014410435,"about_ca_system_score_codex":0.0012316281,"about_ca_system_score_gemma":0.0012050465,"threshold_uncertainty_score":0.0482077},"labels":[],"label_agreement":null},{"id":"W1577506113","doi":"10.1007/978-3-540-68880-8_6","title":"New Upper Bounds on Continuous Tree Edge-Partition Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Partition (number theory); Combinatorics; Tree (set theory); Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.019245519122859895,"score_gpt":0.2659052201453175,"score_spread":0.24665970102245757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577506113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03406784,0.02698122,0.7765784,0.011884622,0.0038100944,0.00051678973,0.003378461,0.0024295456,0.14035301],"genre_scores_gemma":[0.36356494,0.02325006,0.5246913,0.006158402,0.010324789,0.0025008887,0.008344537,0.0038973966,0.057267677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927618,0.0016125287,0.0002630179,0.0013781611,0.0026460986,0.0013383736],"domain_scores_gemma":[0.9606264,0.029597586,0.0011522663,0.0034202668,0.0023720614,0.0028313259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007071384,0.005059019,0.005279716,0.0058300775,0.0035100852,0.010964474,0.015607946,0.0059709265,0.03528636],"category_scores_gemma":[0.04158605,0.0022895497,0.0036111923,0.012116316,0.004806225,0.025239361,0.010190025,0.02137154,0.0060895626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00121511,0.001039931,0.0014526632,0.0022103305,0.00023783163,0.000256253,0.0006026766,0.10364741,0.0046892636,0.5871701,0.12459845,0.17288001],"study_design_scores_gemma":[0.00014934788,0.00015866644,0.0008158185,0.00042549145,0.0002249975,0.00032157224,0.0002028268,0.30422136,0.0019462768,0.6678003,0.023647208,0.00008622631],"about_ca_topic_score_codex":0.0025598125,"about_ca_topic_score_gemma":0.003394442,"teacher_disagreement_score":0.03528636,"about_ca_system_score_codex":0.006414008,"about_ca_system_score_gemma":0.0033367896,"threshold_uncertainty_score":0.118044674},"labels":[],"label_agreement":null},{"id":"W1577910185","doi":"10.1002/jgt.22182","title":"Dominating induced matchings in graphs containing no long claw","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Chordal graph; Time complexity; Matching (statistics); Induced subgraph; Discrete mathematics; Graph","score_opus":0.03397447845630661,"score_gpt":0.3340140648915205,"score_spread":0.3000395864352139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577910185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.747344,0.00065916707,0.23685482,0.0009317602,0.00007433654,0.00036959036,0.0014204137,0.0007223379,0.011623518],"genre_scores_gemma":[0.85037374,0.00032320837,0.13740593,0.00029331355,0.000054083248,0.00013691775,0.0035752181,0.00014580518,0.0076916157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888283,0.00014699226,0.00008063919,0.00045225665,0.00022415866,0.00021316142],"domain_scores_gemma":[0.99631894,0.0016599913,0.0005847197,0.00051659683,0.00043140724,0.0004883941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007438464,0.00059047487,0.00091016834,0.0011799717,0.001021803,0.0015608766,0.0017230618,0.0011438091,0.0036855708],"category_scores_gemma":[0.0045172786,0.0006140671,0.00082857994,0.0015650287,0.0008091508,0.0035004616,0.002073861,0.0011923517,0.00053740107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024003985,0.0016796313,0.015233864,0.001869983,0.00045944413,0.0034771203,0.002768255,0.17696643,0.11386825,0.4329033,0.01785875,0.23051459],"study_design_scores_gemma":[0.00022973109,0.00027217562,0.0028430878,0.000102659134,0.00015288466,0.0015758733,0.00070345995,0.32783118,0.030684575,0.6189525,0.016597841,0.0000538863],"about_ca_topic_score_codex":0.001564566,"about_ca_topic_score_gemma":0.0022551054,"teacher_disagreement_score":0.0036855708,"about_ca_system_score_codex":0.0012317266,"about_ca_system_score_gemma":0.00090828806,"threshold_uncertainty_score":0.012329459},"labels":[],"label_agreement":null},{"id":"W1578742758","doi":"10.48550/arxiv.1410.7423","title":"Packing odd $T$-joins with at most two terminals","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Joins; Bipartite graph; Conjecture; Cardinality (data modeling); Disjoint sets; Sigma; Graph; Discrete mathematics; Physics; Computer science","score_opus":0.07429698143910071,"score_gpt":0.22548152780460756,"score_spread":0.15118454636550685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578742758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90014136,0.00015600314,0.08734822,0.0002558133,0.00004716207,0.000074676005,0.0006612506,0.00039828895,0.010917203],"genre_scores_gemma":[0.9247089,0.0002462931,0.06700118,0.00017845725,0.00003334073,0.00007967474,0.00152133,0.00016885072,0.0060619335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992411,0.000089518,0.00006182862,0.00020743748,0.0001317992,0.00026838644],"domain_scores_gemma":[0.99752706,0.00070471136,0.0005062681,0.00067779253,0.00015766236,0.00042655968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040537433,0.00067301444,0.00070641976,0.00052333204,0.001454718,0.0019380235,0.000948418,0.00070595636,0.0073864837],"category_scores_gemma":[0.0028683448,0.0005722206,0.000657686,0.0014086679,0.0011438985,0.003604413,0.002327954,0.00079018704,0.0011140885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033409141,0.0007544672,0.07305335,0.00074741774,0.0002601574,0.0027787979,0.003499739,0.14955904,0.13374256,0.37879968,0.022055408,0.23140854],"study_design_scores_gemma":[0.00019176201,0.0014802155,0.01999613,0.000201793,0.0002304799,0.006985075,0.003990473,0.34975442,0.13710223,0.42249015,0.05740923,0.00016800342],"about_ca_topic_score_codex":0.0013322758,"about_ca_topic_score_gemma":0.0014410329,"teacher_disagreement_score":0.0073864837,"about_ca_system_score_codex":0.00072593597,"about_ca_system_score_gemma":0.000736908,"threshold_uncertainty_score":0.024710238},"labels":[],"label_agreement":null},{"id":"W1579357699","doi":"10.1007/978-3-540-30551-4_77","title":"Sweeping Graphs with Large Clique Number","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Regina","funders":"","keywords":"Computer science; Clique; Clique problem; Theoretical computer science; Combinatorics; Graph; Chordal graph; Mathematics; 1-planar graph","score_opus":0.015019955904187065,"score_gpt":0.27993704221590104,"score_spread":0.26491708631171396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579357699","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40747014,0.0018666667,0.3672603,0.0023061857,0.00032943755,0.00028878212,0.0013554838,0.0015596361,0.21756342],"genre_scores_gemma":[0.7441762,0.0021457109,0.1543544,0.00044663766,0.00041493707,0.00023798105,0.0018945233,0.0007302492,0.095599405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997061,0.00005710555,0.000010387541,0.00008134988,0.00008999331,0.000055062406],"domain_scores_gemma":[0.9973411,0.0017831578,0.000147008,0.0003759052,0.00012554934,0.00022729256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034009604,0.0005031797,0.00056717865,0.001159418,0.0010444655,0.0012507705,0.0009655967,0.0008736565,0.011610181],"category_scores_gemma":[0.0024330877,0.00074296404,0.0005823033,0.0018081245,0.00089164905,0.002569494,0.0013236488,0.0016665816,0.0009922619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023756125,0.00011315038,0.0012423483,0.00048929587,0.00007838632,0.00069620076,0.0005068848,0.03650208,0.025205577,0.8008368,0.024120547,0.10997112],"study_design_scores_gemma":[0.00005962321,0.000056973826,0.0015012629,0.000045442943,0.000045864133,0.0007844468,0.00019724085,0.068181865,0.007014319,0.8963404,0.025749229,0.000023402241],"about_ca_topic_score_codex":0.0005061161,"about_ca_topic_score_gemma":0.0011026779,"teacher_disagreement_score":0.011610181,"about_ca_system_score_codex":0.0004621278,"about_ca_system_score_gemma":0.00027869205,"threshold_uncertainty_score":0.038839936},"labels":[],"label_agreement":null},{"id":"W158188782","doi":"","title":"On the lower bounds of partial signed domination number of graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Discrete mathematics; Graph","score_opus":0.01261581860335374,"score_gpt":0.2841050634765157,"score_spread":0.27148924487316195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158188782","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31225723,0.013294849,0.32540014,0.011130156,0.0015854071,0.00021937495,0.0032915717,0.0016886101,0.33113262],"genre_scores_gemma":[0.9183863,0.00454016,0.047092237,0.0013259002,0.0012065138,0.00040441952,0.0020119161,0.000590781,0.024441846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973794,0.00063148764,0.000117843665,0.00047263954,0.0008323134,0.0005663367],"domain_scores_gemma":[0.9737709,0.019319706,0.0013062238,0.002401472,0.0016301473,0.0015714754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028837658,0.0016397475,0.0015677074,0.0039908355,0.0018936627,0.0050131567,0.0036026,0.0019989384,0.017359512],"category_scores_gemma":[0.030649357,0.00069108297,0.001047647,0.0033329923,0.003035609,0.010618212,0.0036374482,0.0043943576,0.0031433557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007598722,0.00023010086,0.0034286154,0.0007446855,0.00013184542,0.00023138331,0.0005075912,0.03689837,0.0075580613,0.83935475,0.027826663,0.08232802],"study_design_scores_gemma":[0.000047916794,0.00010428846,0.0019139856,0.00017621309,0.00008938744,0.0003715356,0.00013683604,0.09368794,0.0043200077,0.88564044,0.013450739,0.000060783022],"about_ca_topic_score_codex":0.00094288675,"about_ca_topic_score_gemma":0.0016258275,"teacher_disagreement_score":0.017359512,"about_ca_system_score_codex":0.0026180595,"about_ca_system_score_gemma":0.0012935183,"threshold_uncertainty_score":0.0580734},"labels":[],"label_agreement":null},{"id":"W158287491","doi":"10.1007/bfb0023872","title":"A constructive proof that tree are well-quasi-ordered under minors (detailed abstract)","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constructive; Constructive proof; Mathematical proof; Mathematics; Lemma (botany); Discrete mathematics; Combinatorics; Tree (set theory); Minor (academic); Computer science","score_opus":0.025305504328420197,"score_gpt":0.27296282240515024,"score_spread":0.24765731807673005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158287491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030689787,0.0016892417,0.795251,0.005347607,0.0020643896,0.00021073445,0.0009937759,0.0017982451,0.1619552],"genre_scores_gemma":[0.45296356,0.002246101,0.44793692,0.002866422,0.0016967949,0.0003839589,0.0012782223,0.0012567155,0.0893712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993449,0.0001702256,0.000036518253,0.00014955172,0.0002206173,0.000078129335],"domain_scores_gemma":[0.9979387,0.0011052542,0.000085253734,0.00025257972,0.0004432282,0.00017492265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013113705,0.00077375426,0.0005568696,0.0009795196,0.001376368,0.0022618403,0.001069808,0.0007028991,0.010803936],"category_scores_gemma":[0.0026985302,0.001181866,0.0017770284,0.0011667763,0.0026557788,0.005586287,0.002274563,0.003949016,0.0027658606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040113588,0.00003999395,0.00017093004,0.00012838613,0.000014574599,0.00014560406,0.0005056852,0.00054444786,0.004971931,0.9644792,0.012241178,0.016718062],"study_design_scores_gemma":[0.000026997326,0.000037543825,0.0004391581,0.000037384936,0.000036308647,0.00040636465,0.00013537519,0.0025340463,0.003784572,0.94736165,0.04517492,0.000025673497],"about_ca_topic_score_codex":0.0015784875,"about_ca_topic_score_gemma":0.0025323625,"teacher_disagreement_score":0.010803936,"about_ca_system_score_codex":0.0011901287,"about_ca_system_score_gemma":0.0007467221,"threshold_uncertainty_score":0.036142766},"labels":[],"label_agreement":null},{"id":"W1582969422","doi":"10.1007/978-3-642-20807-2_6","title":"TSP on Cubic and Subcubic Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.027594923748835116,"score_gpt":0.27232444643889603,"score_spread":0.2447295226900609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582969422","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13352998,0.009352405,0.09067818,0.002783535,0.0009938047,0.00014736153,0.0012631468,0.00048110427,0.7607706],"genre_scores_gemma":[0.5464774,0.01439012,0.09015881,0.0006536414,0.0011989331,0.0002402483,0.0031669298,0.00061996875,0.34309402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999759,0.00003241751,0.000009173038,0.000051921394,0.000102571285,0.000044902517],"domain_scores_gemma":[0.9996252,0.00016748968,0.000029643923,0.000057715206,0.000073622505,0.00004620674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012844236,0.0005732611,0.00061343476,0.001158366,0.001180318,0.0017102447,0.0012128667,0.00063375087,0.012764654],"category_scores_gemma":[0.0011076302,0.00043630402,0.0005192992,0.00460785,0.00080000923,0.002467457,0.0010148813,0.0019578002,0.0017909928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052501568,0.000056322788,0.0002459344,0.00038431524,0.000013329177,0.00019695179,0.00036639333,0.019397046,0.0013495676,0.80960786,0.050986532,0.11734313],"study_design_scores_gemma":[0.000018089306,0.000018810078,0.0005033238,0.000049323156,0.000013571721,0.00026170697,0.00015176513,0.031400654,0.0005837991,0.891597,0.07538819,0.0000138333435],"about_ca_topic_score_codex":0.011964169,"about_ca_topic_score_gemma":0.017451959,"teacher_disagreement_score":0.012764654,"about_ca_system_score_codex":0.0017152888,"about_ca_system_score_gemma":0.0010027139,"threshold_uncertainty_score":0.04270208},"labels":[],"label_agreement":null},{"id":"W1584364430","doi":"10.1016/j.tcs.2015.04.037","title":"The interval constrained 3-coloring problem","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundacja na rzecz Nauki Polskiej","keywords":"Interval (graph theory); Mathematics; Combinatorics; Time complexity; Discrete mathematics","score_opus":0.031286921797765155,"score_gpt":0.30748014581150407,"score_spread":0.2761932240137389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584364430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20852089,0.0020136074,0.6748746,0.006672159,0.0009083988,0.0005097998,0.007479939,0.0016655894,0.09735501],"genre_scores_gemma":[0.6255412,0.002198127,0.33486968,0.001829702,0.0006619983,0.0005711404,0.006865784,0.0009985995,0.026463805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989567,0.00031425362,0.000045765228,0.0002893276,0.00017956592,0.00021436327],"domain_scores_gemma":[0.99660337,0.0020331808,0.00026885045,0.00042111013,0.00025411125,0.00041936617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019421,0.0011112569,0.0014975978,0.00078418385,0.0012425297,0.0030220423,0.0030001411,0.002249439,0.018978242],"category_scores_gemma":[0.005496242,0.0007567245,0.0010846588,0.0028114268,0.0011129179,0.0039734077,0.0020188976,0.0034631174,0.0016161276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014275034,0.0006955228,0.001759422,0.0013436993,0.00018204357,0.0006250981,0.000579951,0.16941996,0.0072836564,0.535863,0.081755556,0.19906458],"study_design_scores_gemma":[0.00029318358,0.00013622976,0.0010136919,0.00015648757,0.000079694495,0.00054134865,0.00034148846,0.21973473,0.002960795,0.7472668,0.027416341,0.000059278846],"about_ca_topic_score_codex":0.0038189557,"about_ca_topic_score_gemma":0.0028379397,"teacher_disagreement_score":0.018978242,"about_ca_system_score_codex":0.0014684113,"about_ca_system_score_gemma":0.0016701277,"threshold_uncertainty_score":0.06348854},"labels":[],"label_agreement":null},{"id":"W1586356312","doi":"10.1007/978-3-319-12691-3_22","title":"Algorithms for Cut Problems on Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"","keywords":"Parameterized complexity; Combinatorics; Running time; Time complexity; Tree (set theory); Mathematics; Constant (computer programming); Polynomial; Computer science; Discrete mathematics; Algorithm","score_opus":0.034287847710399014,"score_gpt":0.2979919124767282,"score_spread":0.2637040647663292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586356312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009382899,0.006011954,0.912936,0.0017834783,0.00065999787,0.00022964513,0.000769139,0.0019186153,0.06630833],"genre_scores_gemma":[0.07601245,0.0069154366,0.8694923,0.0007061566,0.00076732156,0.0005988572,0.0031921952,0.0013265457,0.04098878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988709,0.00019953452,0.00006832904,0.000240925,0.0004941405,0.00012604988],"domain_scores_gemma":[0.99762064,0.0015611236,0.00007476993,0.00038314468,0.00026778234,0.00009250039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085157494,0.0017830984,0.0012405342,0.0018269644,0.0010491518,0.003847327,0.0032016144,0.0018323777,0.020959398],"category_scores_gemma":[0.0060532545,0.0011154616,0.0016526405,0.0046276925,0.0013913163,0.007658681,0.002709469,0.006437096,0.005828566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010774012,0.00016032316,0.00027237216,0.0009063993,0.00006270913,0.000059015096,0.00027236308,0.019556647,0.002335816,0.5146697,0.061015904,0.400581],"study_design_scores_gemma":[0.000073118834,0.000025905538,0.00018553845,0.00014129849,0.00003976073,0.00016169052,0.00008486035,0.055625696,0.0014341593,0.8977687,0.044442076,0.000017156106],"about_ca_topic_score_codex":0.0014191241,"about_ca_topic_score_gemma":0.0021227712,"teacher_disagreement_score":0.020959398,"about_ca_system_score_codex":0.0017819742,"about_ca_system_score_gemma":0.0011462829,"threshold_uncertainty_score":0.07011622},"labels":[],"label_agreement":null},{"id":"W158781227","doi":"","title":"On Irregularity of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.0218766658137197,"score_gpt":0.2728580865804129,"score_spread":0.25098142076669316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158781227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3141603,0.016059304,0.32516187,0.018715912,0.0026504584,0.00014048858,0.0013830794,0.00080002693,0.3209286],"genre_scores_gemma":[0.9027511,0.008229123,0.040917166,0.0018992132,0.003244337,0.00016740503,0.0013009113,0.000488558,0.041002143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866474,0.0003953032,0.00008686218,0.00029761405,0.0003582411,0.00019716445],"domain_scores_gemma":[0.98998904,0.0060810414,0.00093152147,0.0015063623,0.00076531025,0.0007267188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014449216,0.0006432591,0.0011574241,0.004008225,0.002269217,0.0031790729,0.0012278132,0.0015335601,0.008722113],"category_scores_gemma":[0.012270986,0.0006102328,0.0009914312,0.0026826921,0.005137705,0.009235329,0.0034539143,0.0046398044,0.0014156643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003169608,0.000019204872,0.0007562837,0.000073747906,0.000012357913,0.00009526228,0.00026018397,0.0015759367,0.00029642842,0.9828551,0.0046062293,0.009417652],"study_design_scores_gemma":[0.000004617192,0.000007575853,0.0002919521,0.000021393806,0.0000058661367,0.00011522986,0.00008952313,0.0030926524,0.00010375283,0.99200696,0.004255251,0.0000053121566],"about_ca_topic_score_codex":0.001198795,"about_ca_topic_score_gemma":0.0014439181,"teacher_disagreement_score":0.008722113,"about_ca_system_score_codex":0.0016389365,"about_ca_system_score_gemma":0.0003887791,"threshold_uncertainty_score":0.02917844},"labels":[],"label_agreement":null},{"id":"W1590078554","doi":"","title":"Simplex Adjacency Graphs in Linear Optimization","year":2006,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Simplex; Adjacency list; Mathematics; Context (archaeology); Linear programming; Chordal graph; Indifference graph; Degeneracy (biology); Duality (order theory); Discrete mathematics; Computer science; Graph; Mathematical optimization","score_opus":0.04304331769652263,"score_gpt":0.3724864654297721,"score_spread":0.32944314773324945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590078554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035913803,0.008686987,0.8617055,0.0028982672,0.0003488865,0.000061622486,0.00063437206,0.0004042718,0.089346215],"genre_scores_gemma":[0.7034984,0.011504607,0.25492013,0.00085480796,0.001056415,0.0003389798,0.0009285788,0.00036997246,0.026528072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929416,0.00033994386,0.000020993457,0.00013276855,0.00015500853,0.000057110392],"domain_scores_gemma":[0.9986785,0.0009225441,0.000116913645,0.00009611031,0.00012257973,0.00006334306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006491808,0.0008054237,0.0005378641,0.001455598,0.00084795675,0.002024651,0.0007407908,0.0013095876,0.0075190635],"category_scores_gemma":[0.0033231354,0.00045146383,0.0005708462,0.002663237,0.0023611754,0.003482481,0.0013901924,0.0022879874,0.0012878132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069846806,0.000006698652,0.00007297805,0.000038378064,0.000005038684,0.000028812978,0.00007041775,0.017122118,0.00018505657,0.9705917,0.0017773649,0.010094389],"study_design_scores_gemma":[0.0000023262876,0.0000041831945,0.000052307973,0.000010091229,0.0000022924662,0.00001823388,0.000024383971,0.022981234,0.0000751978,0.9724715,0.0043536965,0.0000046589357],"about_ca_topic_score_codex":0.002397716,"about_ca_topic_score_gemma":0.001961544,"teacher_disagreement_score":0.0075190635,"about_ca_system_score_codex":0.0011917526,"about_ca_system_score_gemma":0.00050132046,"threshold_uncertainty_score":0.025153756},"labels":[],"label_agreement":null},{"id":"W1591207959","doi":"10.4230/lipics.fsttcs.2009.2319","title":"On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cover (algebra); Mathematics; Vertex (graph theory); Combinatorics; Upper and lower bounds; Vertex cover; Regular polygon; Inequality; Metric (unit); Discrete mathematics; Approximation algorithm; Mathematical analysis; Geometry; Graph","score_opus":0.01935012980026356,"score_gpt":0.27016689915421316,"score_spread":0.2508167693539496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591207959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1493679,0.0025676328,0.79164356,0.0051697134,0.0004848081,0.00042152204,0.0010257424,0.00072598987,0.048593167],"genre_scores_gemma":[0.6874385,0.002350427,0.29261932,0.002094529,0.00083445053,0.0008835048,0.0017222753,0.00067887927,0.011378015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99396497,0.0020664516,0.00027138588,0.0011033231,0.0013793302,0.0012146205],"domain_scores_gemma":[0.97110367,0.023075065,0.0011039829,0.0021508443,0.0011775374,0.0013888974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077589755,0.0025954293,0.0034401566,0.0023196803,0.0019495302,0.005421276,0.0041512693,0.0024775101,0.010214684],"category_scores_gemma":[0.035033904,0.0011962496,0.0027307111,0.0025958566,0.0043241787,0.008948369,0.007767376,0.010723198,0.001019358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007432153,0.0005038861,0.0025212453,0.0010161417,0.0002776013,0.00037831374,0.00057657436,0.37108696,0.0067165014,0.52013737,0.015112305,0.08092986],"study_design_scores_gemma":[0.000089796835,0.00021402186,0.00075924606,0.00013790526,0.000095855525,0.00021124419,0.00014861424,0.5938681,0.0025255724,0.3959558,0.0059528016,0.000041126776],"about_ca_topic_score_codex":0.0028678323,"about_ca_topic_score_gemma":0.0029612405,"teacher_disagreement_score":0.010214684,"about_ca_system_score_codex":0.0040854826,"about_ca_system_score_gemma":0.0026522698,"threshold_uncertainty_score":0.041033864},"labels":[],"label_agreement":null},{"id":"W159195102","doi":"","title":"Toughness of Generalized Petersen Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01855483965152638,"score_gpt":0.27677174546538014,"score_spread":0.25821690581385376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159195102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7481446,0.000983671,0.08024366,0.0025043457,0.00037915257,0.000092068105,0.0009887867,0.00035868204,0.16630502],"genre_scores_gemma":[0.9784878,0.0004219565,0.0058687595,0.00024391663,0.00017789978,0.000052337466,0.00041559775,0.00006970883,0.014262065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922204,0.00013562162,0.000034734512,0.00017287988,0.00025416812,0.00018044922],"domain_scores_gemma":[0.9971283,0.0013533623,0.0004930889,0.0002703144,0.00023377169,0.0005211913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005606568,0.00049351,0.0005264259,0.0025614386,0.0021017562,0.0026389994,0.00089121383,0.0008796033,0.015513322],"category_scores_gemma":[0.0042214687,0.00054146297,0.00068238,0.0012790449,0.0029412028,0.004859349,0.0025659145,0.001783814,0.0009824408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000613086,0.000018318533,0.0007024322,0.00006486295,0.000016702375,0.00014325487,0.0003640382,0.0018086107,0.0010933047,0.9882708,0.0026288931,0.0048275567],"study_design_scores_gemma":[0.000012854628,0.00001435277,0.0009135748,0.000020663023,0.000012327716,0.00019621082,0.00022682996,0.004787347,0.00055687147,0.9897305,0.0035143557,0.00001418116],"about_ca_topic_score_codex":0.0013814956,"about_ca_topic_score_gemma":0.001441575,"teacher_disagreement_score":0.015513322,"about_ca_system_score_codex":0.0007949432,"about_ca_system_score_gemma":0.0003563812,"threshold_uncertainty_score":0.051897287},"labels":[],"label_agreement":null},{"id":"W159253485","doi":"","title":"Graph Orientations and Signings That Are Saturated with Alternating Cycles.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01678179386426939,"score_gpt":0.2690823586310942,"score_spread":0.25230056476682483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159253485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64628845,0.000814162,0.13993117,0.0017796835,0.00027769437,0.00012573476,0.00085469184,0.0017706443,0.20815781],"genre_scores_gemma":[0.9573314,0.0003324127,0.016885063,0.00019173531,0.00012626123,0.000047863297,0.00062858686,0.00024705572,0.024209658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902177,0.00020432193,0.00006473376,0.00022829938,0.00017025237,0.00031048417],"domain_scores_gemma":[0.9963959,0.0014238063,0.0006215453,0.00075522583,0.00034036112,0.0004632378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053552905,0.0005042107,0.00046110674,0.001146789,0.0019312083,0.0029378948,0.00061219215,0.001247659,0.014465054],"category_scores_gemma":[0.004431665,0.0008401037,0.0006419561,0.0013479205,0.0027066795,0.00725562,0.0025298598,0.0020149432,0.0021698156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029278727,0.0000865565,0.0017025515,0.00009330756,0.000020053918,0.00077708677,0.000757986,0.0021002984,0.00808859,0.9597559,0.0042585246,0.022066383],"study_design_scores_gemma":[0.000038700182,0.000046661302,0.0009917783,0.000045125133,0.000036742458,0.00071196386,0.0006581469,0.007320178,0.0060357703,0.96898735,0.015089427,0.000038059447],"about_ca_topic_score_codex":0.0011526176,"about_ca_topic_score_gemma":0.0018453872,"teacher_disagreement_score":0.014465054,"about_ca_system_score_codex":0.00081409543,"about_ca_system_score_gemma":0.0005713715,"threshold_uncertainty_score":0.048390448},"labels":[],"label_agreement":null},{"id":"W1593178005","doi":"10.37236/5327","title":"The Total Acquisition Number of Random Graphs","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Western Michigan University","keywords":"Combinatorics; Conjecture; Vertex (graph theory); Mathematics; Graph; Random graph; Discrete mathematics","score_opus":0.00841781867157016,"score_gpt":0.28211421866373076,"score_spread":0.2736963999921606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593178005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8194177,0.0010189058,0.15159549,0.00455995,0.000103665814,0.0001600164,0.0012026913,0.0011142618,0.020827351],"genre_scores_gemma":[0.97378516,0.0006580528,0.018339211,0.00048869976,0.00014371461,0.0003224691,0.0008664216,0.00027888117,0.005117336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730206,0.0009613114,0.00012995738,0.0006819814,0.00047154177,0.00045321268],"domain_scores_gemma":[0.9634128,0.025168128,0.0026770153,0.004271723,0.0014634097,0.003006923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003313391,0.00063564425,0.0013431975,0.0019379107,0.0016918571,0.0027513811,0.0028810536,0.0017789775,0.0069676256],"category_scores_gemma":[0.028170697,0.0010864327,0.0009960263,0.0012082551,0.0036062028,0.007935486,0.0025453374,0.0027076465,0.0011004013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015856948,0.00025861242,0.02349818,0.0005807061,0.00025147668,0.0007333088,0.0010447985,0.083506286,0.03414302,0.7706552,0.021640126,0.062102657],"study_design_scores_gemma":[0.00019142967,0.0003289448,0.008749212,0.00008904132,0.00012237394,0.0017861894,0.0002760036,0.3362847,0.011766485,0.6326966,0.0075868974,0.00012216439],"about_ca_topic_score_codex":0.0008136387,"about_ca_topic_score_gemma":0.00085345097,"teacher_disagreement_score":0.0069676256,"about_ca_system_score_codex":0.0018422041,"about_ca_system_score_gemma":0.0008132236,"threshold_uncertainty_score":0.023309052},"labels":[],"label_agreement":null},{"id":"W1593427793","doi":"10.46298/dmtcs.458","title":"Adjoint functors and tree duality","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Mathematics; Homomorphism; Duality (order theory); Functor; Combinatorics; Functor category; Tree (set theory); Adjoint functors; Discrete mathematics; Natural transformation","score_opus":0.020913076198679884,"score_gpt":0.2992496958744759,"score_spread":0.27833661967579604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593427793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19218424,0.0021307403,0.7243893,0.0042256797,0.0002839167,0.00008360496,0.00040838058,0.0010269086,0.07526717],"genre_scores_gemma":[0.91447836,0.00069433625,0.07092456,0.00063668005,0.00018032877,0.00010580641,0.00035201025,0.00020175749,0.012426066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800533,0.000585955,0.00013231143,0.00045565615,0.00048066475,0.00034012247],"domain_scores_gemma":[0.9966363,0.0016521198,0.00027315086,0.0005992433,0.00045787104,0.00038134726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001948893,0.00041862184,0.00054176495,0.0017803769,0.001630534,0.003360829,0.00072028453,0.0011500628,0.0043449514],"category_scores_gemma":[0.0043927096,0.00044372556,0.0010899294,0.0012236789,0.0048898794,0.007975814,0.004172899,0.0026442294,0.00044299036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012732115,0.000013786879,0.00023307445,0.000019294072,0.000004039859,0.000040453473,0.00021222742,0.0010046209,0.00034254955,0.99220884,0.0003546336,0.0055536865],"study_design_scores_gemma":[0.0000062346558,0.000013619481,0.00017914792,0.000011834097,0.0000057056254,0.00009086614,0.00008387066,0.004194863,0.00044219565,0.98795265,0.0070106382,0.000008268948],"about_ca_topic_score_codex":0.0013417574,"about_ca_topic_score_gemma":0.0011065518,"teacher_disagreement_score":0.0043449514,"about_ca_system_score_codex":0.0020076546,"about_ca_system_score_gemma":0.0013625019,"threshold_uncertainty_score":0.0145666},"labels":[],"label_agreement":null},{"id":"W1594588516","doi":"10.1007/3-540-45105-6_106","title":"On the Treewidth of NK Landscapes","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Treewidth; Computer science; Theoretical computer science; Graph; Pathwidth","score_opus":0.020274896276776408,"score_gpt":0.2661022176563283,"score_spread":0.24582732137955188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594588516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2283918,0.019938745,0.42625776,0.0066829207,0.0006894011,0.00008645727,0.0015600366,0.0005368907,0.31585598],"genre_scores_gemma":[0.80985576,0.014537161,0.12949894,0.0011191585,0.00089534593,0.000210787,0.0011913634,0.00066221366,0.042029366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996126,0.00009365278,0.000024326979,0.00007840101,0.0001236284,0.00006742392],"domain_scores_gemma":[0.99672556,0.002502591,0.00017906066,0.0002372173,0.0002082138,0.0001473649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056712807,0.0005203506,0.0009860585,0.0016225228,0.0009400696,0.0026784572,0.0016072264,0.0010706271,0.010919623],"category_scores_gemma":[0.006539476,0.0006108883,0.0005607271,0.0028612632,0.0018153932,0.0080983555,0.0017286211,0.0036231107,0.0011060849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092488815,0.000030864627,0.00081024726,0.0002683764,0.000019285177,0.000094028655,0.00042139855,0.019775363,0.0022162434,0.89606494,0.01071621,0.069490544],"study_design_scores_gemma":[0.000009407247,0.000009231982,0.00042751728,0.00005863006,0.000010884969,0.00016258178,0.00010979704,0.022351505,0.00029914262,0.96956944,0.006984092,0.000007722487],"about_ca_topic_score_codex":0.001490625,"about_ca_topic_score_gemma":0.0017707488,"teacher_disagreement_score":0.010919623,"about_ca_system_score_codex":0.0011470726,"about_ca_system_score_gemma":0.0003065922,"threshold_uncertainty_score":0.03652978},"labels":[],"label_agreement":null},{"id":"W1595412293","doi":"10.1002/jgt.20626","title":"Large cliques or stable sets in graphs with no four‐edge path and no five‐edge path in the complement","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Induced path; Block graph; Conjecture; Induced subgraph; Path graph; Split graph; Independent set; Discrete mathematics; Complement (music); Graph factorization; Graph; Path (computing); Longest path problem; Chordal graph; Pathwidth; Line graph; Graph power; Computer science; Vertex (graph theory)","score_opus":0.04279535364240605,"score_gpt":0.2992597116122812,"score_spread":0.25646435796987516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595412293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94665563,0.000346987,0.038622722,0.0010277866,0.00004279136,0.000074853975,0.00032109485,0.00008772365,0.012820475],"genre_scores_gemma":[0.9863491,0.00016974859,0.010481447,0.00009359784,0.00004955636,0.0000550417,0.00036257884,0.000018556078,0.0024204196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932766,0.000165075,0.000029608515,0.00021070933,0.00013590217,0.00013096047],"domain_scores_gemma":[0.99295455,0.004606405,0.0009924578,0.00049113494,0.0003479757,0.0006075446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008920052,0.00038304683,0.0005127623,0.0011604324,0.0018881604,0.0018155341,0.000979514,0.00065619615,0.0047847335],"category_scores_gemma":[0.004398244,0.0005826459,0.0009019515,0.0010953471,0.0032476627,0.0033842432,0.0021864302,0.0010948495,0.0002296709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001000358,0.000240409,0.0125074405,0.00042094782,0.0001803151,0.0012605677,0.0023871143,0.020508656,0.025486883,0.9058258,0.007753063,0.022428533],"study_design_scores_gemma":[0.00019721485,0.00016173683,0.006058252,0.000052223,0.00010937463,0.00076205836,0.00083844573,0.061050706,0.009367688,0.9153929,0.0059367763,0.00007270408],"about_ca_topic_score_codex":0.0022605138,"about_ca_topic_score_gemma":0.002918907,"teacher_disagreement_score":0.0047847335,"about_ca_system_score_codex":0.0010149523,"about_ca_system_score_gemma":0.0007248952,"threshold_uncertainty_score":0.01600653},"labels":[],"label_agreement":null},{"id":"W159710950","doi":"","title":"Self-complementary Graphs with Minimum Degree Two","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Discrete mathematics","score_opus":0.03104552313222821,"score_gpt":0.27496098841493855,"score_spread":0.24391546528271033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159710950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.803011,0.00036641603,0.08840482,0.0015368,0.00022614164,0.00013665877,0.0013842661,0.00054118247,0.10439278],"genre_scores_gemma":[0.9157847,0.00035188903,0.057211082,0.00047202787,0.000111449954,0.00015740767,0.001337816,0.00016786638,0.024405684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960536,0.000086047345,0.000020174108,0.00009139553,0.00010686321,0.00009015732],"domain_scores_gemma":[0.99750525,0.0010999928,0.00027622515,0.0003234099,0.0003397974,0.00045530885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035798195,0.00045123755,0.0007061316,0.0014926199,0.0017407036,0.001467314,0.0008703446,0.0010641833,0.009503516],"category_scores_gemma":[0.0022982813,0.0005962882,0.00052942574,0.0010823915,0.0008908648,0.0022426546,0.0014984295,0.0012309256,0.0011761603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045196252,0.00022291172,0.0023833336,0.00031929335,0.0000672613,0.00064455497,0.00070410734,0.003291261,0.037363596,0.91271913,0.009285876,0.03254673],"study_design_scores_gemma":[0.00020283075,0.00015086995,0.0030656701,0.0000835873,0.0000851342,0.0015225245,0.0006813373,0.018005483,0.02366451,0.932708,0.019781915,0.000048148373],"about_ca_topic_score_codex":0.00040135588,"about_ca_topic_score_gemma":0.0009875082,"teacher_disagreement_score":0.009503516,"about_ca_system_score_codex":0.00053943926,"about_ca_system_score_gemma":0.00068748085,"threshold_uncertainty_score":0.031792402},"labels":[],"label_agreement":null},{"id":"W159748213","doi":"","title":"On Disconnected Graph with Large Reconstruction Number.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Totally disconnected space; Connectivity; Connected component; Discrete mathematics","score_opus":0.013110134706882505,"score_gpt":0.2500286008500767,"score_spread":0.23691846614319423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159748213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6932952,0.003484561,0.25286713,0.0037316047,0.00017134394,0.00012449177,0.0006812696,0.0007947284,0.044849742],"genre_scores_gemma":[0.93997115,0.0011613454,0.050166555,0.0003270169,0.0001565714,0.000125257,0.0011511433,0.00014901612,0.006791999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900705,0.0003694678,0.000033515105,0.000232554,0.00023557502,0.0001219652],"domain_scores_gemma":[0.99287766,0.004707154,0.00090508244,0.0006303303,0.0003484065,0.0005312927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009656147,0.0006376289,0.0007451256,0.0017833675,0.0013266406,0.0011041278,0.00087091327,0.0012186778,0.003598906],"category_scores_gemma":[0.007963946,0.00042207332,0.0005637546,0.0011000774,0.0020471662,0.003072386,0.0015359648,0.0012518348,0.0006043545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009431989,0.000121472796,0.006521788,0.00063490786,0.000105944615,0.0018411386,0.0010618494,0.09106352,0.018448811,0.8026567,0.010316621,0.06628387],"study_design_scores_gemma":[0.00009031591,0.00025962346,0.0035158878,0.0000818708,0.00008480293,0.0025519393,0.00039939684,0.20114946,0.009884654,0.7681896,0.013741267,0.00005131681],"about_ca_topic_score_codex":0.00044693763,"about_ca_topic_score_gemma":0.00048208813,"teacher_disagreement_score":0.003598906,"about_ca_system_score_codex":0.0011884618,"about_ca_system_score_gemma":0.00032006387,"threshold_uncertainty_score":0.012039542},"labels":[],"label_agreement":null},{"id":"W1597703390","doi":"10.1007/11604686_18","title":"Ultimate Generalizations of LexBFS and LEX M","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Chordal graph; Graph; Combinatorics; Set (abstract data type); Algorithm; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.023247366250803928,"score_gpt":0.2896899513063959,"score_spread":0.266442585055592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597703390","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07171588,0.0050783427,0.4823138,0.007279193,0.0011894538,0.00007339944,0.0015075827,0.0024558175,0.42838648],"genre_scores_gemma":[0.7686783,0.0034476568,0.10242814,0.002394156,0.0018918824,0.00019584922,0.0021483907,0.00083165657,0.11798396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991141,0.0002444982,0.0000825048,0.00023110924,0.00018984148,0.00013787154],"domain_scores_gemma":[0.99891865,0.00048557206,0.00008961064,0.00021804946,0.00019817178,0.00008987681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010769048,0.00074538763,0.0007912155,0.002095836,0.0026899944,0.002978694,0.0012081458,0.0012493435,0.011330215],"category_scores_gemma":[0.0031623514,0.0007421393,0.0016757207,0.0025958205,0.0029685264,0.0109795,0.0033258672,0.0040811934,0.0024811092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001828589,0.0000071821682,0.00008638298,0.000033352586,0.0000041573026,0.000034483222,0.00015160974,0.0002549589,0.0002360808,0.9864411,0.0034078215,0.009324652],"study_design_scores_gemma":[0.0000033642411,0.0000044827275,0.000057680776,0.000008997254,0.0000050776534,0.00003924888,0.000040120976,0.00052546326,0.00019036137,0.9898837,0.009236048,0.00000542673],"about_ca_topic_score_codex":0.0020983107,"about_ca_topic_score_gemma":0.002247179,"teacher_disagreement_score":0.011330215,"about_ca_system_score_codex":0.0017553195,"about_ca_system_score_gemma":0.0008354473,"threshold_uncertainty_score":0.03790337},"labels":[],"label_agreement":null},{"id":"W1598462167","doi":"","title":"Balanced allocations: balls-into-bins revisited and chains-into-bins","year":2007,"lang":"en","type":"article","venue":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bin; Ball (mathematics); Combinatorics; Bounded function; Mathematics; Chain (unit); Set (abstract data type); Mathematical optimization; Discrete mathematics; Computer science; Algorithm; Physics; Geometry","score_opus":0.03597906122040967,"score_gpt":0.3657497126521062,"score_spread":0.32977065143169654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598462167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17945111,0.00249233,0.7786212,0.002467489,0.00034829014,0.0003451076,0.000375288,0.0005009414,0.03539819],"genre_scores_gemma":[0.8681859,0.0012992152,0.11139894,0.00063795253,0.0003079891,0.00043297466,0.00024174851,0.00053252047,0.016962752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950287,0.0021726293,0.00016647071,0.00063810794,0.0008576328,0.0011366134],"domain_scores_gemma":[0.99157965,0.005030187,0.001064349,0.0009233696,0.0005941006,0.00080838834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003641071,0.001409167,0.0017624324,0.0010348896,0.0014766285,0.0031018266,0.0039014996,0.0022796395,0.018851537],"category_scores_gemma":[0.020787558,0.0010870213,0.0012549931,0.0019493502,0.0029222143,0.0081147775,0.0035541824,0.0031035922,0.0013860203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007391295,0.00029817596,0.0016531425,0.0002739094,0.00008936173,0.00024661745,0.0005704319,0.37493736,0.0031647438,0.57409173,0.0058420715,0.03809319],"study_design_scores_gemma":[0.000116153504,0.00017923917,0.0004578796,0.00006651136,0.000034828743,0.00014025038,0.0002631854,0.6302481,0.001231902,0.3606887,0.006534514,0.00003874862],"about_ca_topic_score_codex":0.0044260076,"about_ca_topic_score_gemma":0.0032456487,"teacher_disagreement_score":0.018851537,"about_ca_system_score_codex":0.0027417566,"about_ca_system_score_gemma":0.0020080742,"threshold_uncertainty_score":0.063064694},"labels":[],"label_agreement":null},{"id":"W159861840","doi":"","title":"Neighborhood Union Condition with Distance for Vertex-pancyclicity.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.011887405154393143,"score_gpt":0.27203364812114655,"score_spread":0.2601462429667534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159861840","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2913054,0.003123957,0.2114469,0.008390758,0.0011184103,0.00021864023,0.0032177134,0.0009948178,0.4801834],"genre_scores_gemma":[0.95084536,0.0011634394,0.019444084,0.0008090227,0.000634161,0.00018204233,0.0013206649,0.00019096385,0.025410254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843985,0.0002992639,0.00009248599,0.00035757065,0.00048084694,0.00033003217],"domain_scores_gemma":[0.9912675,0.004962819,0.00071487017,0.0011268918,0.00084911514,0.0010787678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009949157,0.00038786934,0.0011454572,0.0013867201,0.0024092544,0.0029531156,0.0020478833,0.0021215514,0.025632028],"category_scores_gemma":[0.013923201,0.0005373734,0.0006299768,0.0019805809,0.0027937323,0.009877505,0.004282155,0.0037453903,0.0025478022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016812197,0.000035066954,0.0004926036,0.00013635281,0.000013540342,0.0001955792,0.0001875867,0.001992685,0.00096993387,0.97628367,0.008504096,0.011020884],"study_design_scores_gemma":[0.000058212943,0.0000442496,0.000564263,0.000043720353,0.000022683162,0.00051485724,0.00021234396,0.01207616,0.0015591701,0.9758621,0.009015918,0.000026369124],"about_ca_topic_score_codex":0.0014332135,"about_ca_topic_score_gemma":0.0014662817,"teacher_disagreement_score":0.025632028,"about_ca_system_score_codex":0.0012917412,"about_ca_system_score_gemma":0.00087711937,"threshold_uncertainty_score":0.08574766},"labels":[],"label_agreement":null},{"id":"W1598672207","doi":"10.37236/2533","title":"A Note on Forbidding Clique Immersions","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Digraph; Eulerian path; Clique; Discrete mathematics; Graph; Structured program theorem; Immersion (mathematics); Robertson–Seymour theorem; Extremal graph theory; Pathwidth; Line graph; Pure mathematics; Voltage graph","score_opus":0.011424469731928658,"score_gpt":0.2835691420794096,"score_spread":0.2721446723474809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598672207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20299836,0.009298238,0.5190993,0.022623455,0.0031864494,0.00014796335,0.0005081148,0.0011844978,0.24095365],"genre_scores_gemma":[0.8555591,0.0042514508,0.09680664,0.0031269018,0.001859721,0.00011974289,0.00031803182,0.0005305034,0.03742795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802506,0.00061189866,0.00010105542,0.00050372427,0.00043983132,0.00031844122],"domain_scores_gemma":[0.99320555,0.004349578,0.00022237634,0.001189699,0.00046597168,0.0005667958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023569625,0.0006887971,0.0011595815,0.0012458877,0.0023475238,0.0018281805,0.0014297441,0.0019945048,0.0063020494],"category_scores_gemma":[0.008820392,0.00079739676,0.0017148424,0.0008045604,0.005642987,0.009785225,0.0047459183,0.0057661016,0.0010143134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026698232,0.000013842646,0.00019934296,0.00006482534,0.000008014887,0.00009888314,0.00033476533,0.00089000986,0.0012848505,0.99020374,0.0024346756,0.0044404007],"study_design_scores_gemma":[0.000022698161,0.000054308122,0.000266352,0.00003331365,0.000014509308,0.00014829927,0.00016833845,0.005454366,0.0015707759,0.96741796,0.024819655,0.000029380859],"about_ca_topic_score_codex":0.0027641605,"about_ca_topic_score_gemma":0.002672828,"teacher_disagreement_score":0.0063020494,"about_ca_system_score_codex":0.0012008912,"about_ca_system_score_gemma":0.00060138665,"threshold_uncertainty_score":0.02108246},"labels":[],"label_agreement":null},{"id":"W1598867843","doi":"10.1007/978-3-642-03816-7_18","title":"DP-Complete Problems Derived from Extremal NP-Complete Properties","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"NP-complete; Implicant; Combinatorics; Computer science; Mathematics; Contrast (vision); Degree (music); Discrete mathematics; Time complexity; Artificial intelligence; Physics; Boolean function","score_opus":0.05478918288468504,"score_gpt":0.2595776014824834,"score_spread":0.20478841859779834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598867843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07554825,0.003358731,0.5110561,0.007808073,0.0009325511,0.0003710274,0.002017163,0.0008862691,0.39802194],"genre_scores_gemma":[0.68091017,0.0039011089,0.24264397,0.0017797147,0.0016486543,0.0007417919,0.0052835536,0.0010564114,0.062034696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987796,0.00026668733,0.00008496035,0.00028773557,0.0004048509,0.00017612036],"domain_scores_gemma":[0.99586785,0.0030243294,0.00018395198,0.0004380859,0.00032648823,0.00015927706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012615282,0.00092469336,0.0012111305,0.0015139356,0.0018514548,0.0034893437,0.002519094,0.0018160744,0.010734909],"category_scores_gemma":[0.0069107665,0.0009063183,0.0018733381,0.0025132475,0.0024072519,0.007642282,0.0029487244,0.011370384,0.001496426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006023476,0.00006952789,0.00013647985,0.0002904999,0.000021653266,0.000076789096,0.00014248004,0.0066497494,0.00095717906,0.9547614,0.0102692135,0.02656485],"study_design_scores_gemma":[0.000021003087,0.000012891367,0.00013061283,0.000044342345,0.000018638963,0.00014845736,0.000067884204,0.012125204,0.0009333993,0.9767443,0.0097422125,0.000011059366],"about_ca_topic_score_codex":0.00051245716,"about_ca_topic_score_gemma":0.000889001,"teacher_disagreement_score":0.010734909,"about_ca_system_score_codex":0.0019405475,"about_ca_system_score_gemma":0.00088948774,"threshold_uncertainty_score":0.035911858},"labels":[],"label_agreement":null},{"id":"W1599403872","doi":"10.1016/j.dam.2016.01.026","title":"Global cycle properties of locally isometric graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Combinatorics; Isometric exercise; Conjecture; Chordal graph; Neighbourhood (mathematics); Discrete mathematics; Indifference graph; Graph; Vertex (graph theory); Mathematical analysis","score_opus":0.021100355340927864,"score_gpt":0.26408884339656225,"score_spread":0.2429884880556344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599403872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87755334,0.0006839174,0.063331276,0.0006562483,0.000045811175,0.00005469552,0.00052050984,0.00016531305,0.056988772],"genre_scores_gemma":[0.9805376,0.0005487718,0.006435675,0.00013748347,0.00009103565,0.00008011962,0.0007526108,0.00016923014,0.011247439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973947,0.00004892305,0.000012644537,0.000072242794,0.00007828909,0.00004841778],"domain_scores_gemma":[0.9982414,0.0007999288,0.0003042683,0.000169051,0.00020788632,0.0002774228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003568378,0.00054152386,0.00055946346,0.0021100773,0.0009412128,0.001935553,0.000976495,0.00075943174,0.010745407],"category_scores_gemma":[0.0024844382,0.0004113194,0.0004928711,0.0015431327,0.0014908876,0.0032485903,0.0014955051,0.0013314709,0.00062288943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015516384,0.00006435022,0.003381834,0.00015047373,0.00003122225,0.00026200153,0.0010691704,0.00762781,0.008155309,0.95179975,0.0025661169,0.024736835],"study_design_scores_gemma":[0.000027072085,0.000052265732,0.002800569,0.000029729155,0.000027595795,0.00023931178,0.0006215734,0.019476527,0.0017733376,0.9715371,0.003395829,0.000019141462],"about_ca_topic_score_codex":0.0013826697,"about_ca_topic_score_gemma":0.001472015,"teacher_disagreement_score":0.010745407,"about_ca_system_score_codex":0.00062063226,"about_ca_system_score_gemma":0.00028865543,"threshold_uncertainty_score":0.035946965},"labels":[],"label_agreement":null},{"id":"W1599512452","doi":"10.1007/978-3-319-07557-0_1","title":"The Cycling Property for the Clutter of Odd st-Walks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Bipartite graph; Clutter; Combinatorics; Computer science; Eulerian path; Matroid; Electronic circuit; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Mathematics; Telecommunications; Physics; Pure mathematics; Radar","score_opus":0.028923743418956042,"score_gpt":0.2878754024216047,"score_spread":0.25895165900264866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599512452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48685342,0.003450107,0.2382476,0.001249854,0.00082074513,0.00008766946,0.0011311537,0.0009594137,0.26720005],"genre_scores_gemma":[0.906768,0.0017929921,0.026455881,0.0006000773,0.0005470205,0.000090622925,0.0010119997,0.0006958533,0.06203756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995715,0.00006326918,0.000026951066,0.00013376049,0.00010981473,0.0000947222],"domain_scores_gemma":[0.997948,0.0009597857,0.0001577316,0.00037966704,0.00023938883,0.0003154134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045754178,0.00062510057,0.0007880417,0.0015179833,0.0018912248,0.0032892379,0.0009139011,0.0010287914,0.01291012],"category_scores_gemma":[0.003694078,0.00060908456,0.0008864783,0.0022551075,0.0020542333,0.0037286526,0.0016605272,0.0017605729,0.0017339975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011899233,0.000018637209,0.0006655954,0.000087897315,0.00000997091,0.00016940194,0.00025787638,0.0017049311,0.0024504599,0.9737925,0.004127538,0.016596185],"study_design_scores_gemma":[0.00001108377,0.000020185922,0.00042449858,0.000025906187,0.000011430503,0.00027335822,0.00006512629,0.005356305,0.0010049198,0.9843874,0.0084013175,0.000018544588],"about_ca_topic_score_codex":0.0019289514,"about_ca_topic_score_gemma":0.0018665537,"teacher_disagreement_score":0.01291012,"about_ca_system_score_codex":0.0007172741,"about_ca_system_score_gemma":0.0006389618,"threshold_uncertainty_score":0.04318869},"labels":[],"label_agreement":null},{"id":"W159955302","doi":"","title":"Average lower independence in trees and outerplanar graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Independence number; Combinatorics; Pathwidth; Discrete mathematics; Statistics; Graph; Line graph","score_opus":0.011522635569900066,"score_gpt":0.25953387175641757,"score_spread":0.2480112361865175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159955302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4628128,0.008971184,0.25286567,0.008259189,0.0007519141,0.00009398823,0.009823096,0.0023593367,0.25406283],"genre_scores_gemma":[0.94808406,0.001800418,0.019241912,0.0010823095,0.0009448795,0.00010479,0.004491303,0.0006913061,0.023559008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975376,0.0004899269,0.00008421058,0.0006258954,0.0006593694,0.0006029993],"domain_scores_gemma":[0.9728069,0.018122822,0.0018977387,0.0031546378,0.0015310711,0.0024868334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018934968,0.0010319278,0.0019262001,0.002608455,0.002325416,0.0042300946,0.0034263853,0.001636085,0.025912669],"category_scores_gemma":[0.019246763,0.001091582,0.0010943287,0.0037565983,0.002116643,0.0076881456,0.0024066875,0.004995406,0.003150151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009765698,0.0004062267,0.009578265,0.00065887487,0.0002676802,0.00036993242,0.00084411533,0.037603494,0.0057062944,0.8123657,0.06330099,0.06792173],"study_design_scores_gemma":[0.000055004108,0.000056986803,0.00592586,0.00005406033,0.000112095746,0.00037799714,0.00011449833,0.059326347,0.0027042723,0.92189443,0.009341442,0.000036927624],"about_ca_topic_score_codex":0.0040461402,"about_ca_topic_score_gemma":0.009497714,"teacher_disagreement_score":0.025912669,"about_ca_system_score_codex":0.0029438343,"about_ca_system_score_gemma":0.0011487062,"threshold_uncertainty_score":0.08668655},"labels":[],"label_agreement":null},{"id":"W1601379450","doi":"10.1007/3-540-44450-5_13","title":"Arithmetic Circuits and Polynomial Replacement Systems","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Generalization; Polynomial; Electronic circuit; Scope (computer science); Arithmetic; Natural number; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Programming language; Electrical engineering","score_opus":0.019089426504118573,"score_gpt":0.2632402137323563,"score_spread":0.24415078722823771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601379450","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042311717,0.032059688,0.09708233,0.005836177,0.0014526992,0.000050723338,0.00029785358,0.0006238684,0.82028496],"genre_scores_gemma":[0.6703743,0.023089916,0.02980849,0.0010678144,0.0023106348,0.00011556424,0.00060924364,0.00024382726,0.27238014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984336,0.000033040385,0.000005597873,0.000026584039,0.00006439436,0.00002706303],"domain_scores_gemma":[0.9997423,0.0001517474,0.000015931779,0.000043145345,0.000036130128,0.000010646864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000199261,0.00051086285,0.0004400608,0.00073417113,0.0007671096,0.001508249,0.0006379873,0.00060524157,0.013169534],"category_scores_gemma":[0.0007771479,0.00033339954,0.0003596053,0.0015190793,0.0014748401,0.002954493,0.00053904735,0.0021058253,0.0022651076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011771037,0.000008108304,0.000027065757,0.00006386234,0.0000025502798,0.000016095837,0.0000765408,0.0007022198,0.0005364325,0.9675684,0.007309389,0.023677543],"study_design_scores_gemma":[0.00000789816,0.000009851981,0.000087359374,0.00001748344,0.000006251631,0.00008339523,0.000026930646,0.0009505251,0.000469486,0.93764603,0.06069026,0.0000045224706],"about_ca_topic_score_codex":0.00054257555,"about_ca_topic_score_gemma":0.0006167344,"teacher_disagreement_score":0.013169534,"about_ca_system_score_codex":0.0014364587,"about_ca_system_score_gemma":0.000396947,"threshold_uncertainty_score":0.044056475},"labels":[],"label_agreement":null},{"id":"W1602309302","doi":"10.1016/j.jcss.2015.07.004","title":"Conservative constraint satisfaction re-revisited","year":2015,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint satisfaction problem; Homomorphism; Mathematics; Constraint (computer-aided design); Variable (mathematics); Graph; Constraint satisfaction; Discrete mathematics; Conservative extension; Combinatorics; Statistics","score_opus":0.06971659307546549,"score_gpt":0.32773972412823354,"score_spread":0.2580231310527681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602309302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039396644,0.0009254845,0.8682553,0.0066728434,0.0014611118,0.00027286215,0.0005404748,0.0015108164,0.080964364],"genre_scores_gemma":[0.5483022,0.0008593655,0.37379745,0.0029905217,0.00081365847,0.0002820753,0.0010283473,0.0017164091,0.07020993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959578,0.0013420357,0.00018516692,0.00055356044,0.0015591735,0.00040221924],"domain_scores_gemma":[0.98144287,0.008651931,0.00058349787,0.005723878,0.0030586927,0.0005391653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038007153,0.00085727556,0.0012964655,0.0016576123,0.0022025735,0.0032849417,0.0036914248,0.0015444196,0.022523336],"category_scores_gemma":[0.025388908,0.0009097955,0.0015060782,0.0023663265,0.0024439646,0.0046434654,0.0050316355,0.006107216,0.001906769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031818447,0.00018991312,0.0010695687,0.0004905134,0.00015472919,0.0010186973,0.001264066,0.02637041,0.005325905,0.77504885,0.02267033,0.16607878],"study_design_scores_gemma":[0.00010081089,0.00010446986,0.0006145031,0.00022346024,0.0001246388,0.00078501913,0.0009660339,0.16609424,0.006733038,0.7629081,0.06127989,0.00006567796],"about_ca_topic_score_codex":0.0048796046,"about_ca_topic_score_gemma":0.007844666,"teacher_disagreement_score":0.022523336,"about_ca_system_score_codex":0.0013125138,"about_ca_system_score_gemma":0.0031468242,"threshold_uncertainty_score":0.07534808},"labels":[],"label_agreement":null},{"id":"W1604898370","doi":"10.1007/s10107-003-0407-5","title":"The stable set problem and the lift-and-project ranks of graphs","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Subdivision; Vertex (graph theory); Pathwidth; Cograph; Graph; Discrete mathematics; Split graph; Line graph","score_opus":0.02837370701248726,"score_gpt":0.3029111102361365,"score_spread":0.2745374032236492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604898370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48027155,0.0015139865,0.3944311,0.012033376,0.00051264925,0.00015630535,0.0008127256,0.00053282786,0.10973554],"genre_scores_gemma":[0.92332965,0.0010414517,0.044036586,0.00051204214,0.0009386232,0.00017418235,0.0005786014,0.0002756747,0.029113013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970023,0.0010959866,0.00013081546,0.00047054124,0.00079094013,0.0005093774],"domain_scores_gemma":[0.9887449,0.0077015967,0.0008837822,0.00079041475,0.0006716353,0.0012076824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037037376,0.0011049949,0.0027115017,0.0034784654,0.0049991454,0.008327276,0.003251349,0.0035162738,0.01771668],"category_scores_gemma":[0.019489296,0.0011520222,0.0017617968,0.0037130534,0.0076365597,0.01766288,0.005022196,0.006451017,0.0015758737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003368077,0.000025237932,0.00014058905,0.00003513051,0.0000062844233,0.0000253298,0.00015515348,0.002040319,0.00011709098,0.9910204,0.0012041206,0.005196714],"study_design_scores_gemma":[0.000008519331,0.000005670288,0.00004220221,0.000006437066,0.0000032005369,0.000012708652,0.000051688443,0.0039322157,0.000081921906,0.995359,0.00049038825,0.000006048829],"about_ca_topic_score_codex":0.0015885624,"about_ca_topic_score_gemma":0.0018289717,"teacher_disagreement_score":0.01771668,"about_ca_system_score_codex":0.0022491983,"about_ca_system_score_gemma":0.0018260203,"threshold_uncertainty_score":0.059268177},"labels":[],"label_agreement":null},{"id":"W1609598951","doi":"10.15517/rmta.v19i2.1334","title":"Variants of the mixed postman problem solvable using linear programming","year":2012,"lang":"en","type":"article","venue":"Revista de Matemática Teoría y Aplicaciones","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sistema Nacional de Investigadores; University of Waterloo; Universidad Autónoma Metropolitana","keywords":"Mixed graph; Mathematics; Linear programming; Graph; Combinatorics; Time complexity; Discrete mathematics; Mathematical optimization; Line graph; Voltage graph","score_opus":0.029473064422161414,"score_gpt":0.29745937250027893,"score_spread":0.2679863080781175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609598951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060397796,0.00045203298,0.91188085,0.00072452636,0.00011698042,0.00020786287,0.00046961824,0.00037767904,0.025372632],"genre_scores_gemma":[0.38207433,0.00068364263,0.58937424,0.00033932607,0.00025057563,0.00059289613,0.0013648248,0.00036309246,0.024957117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990165,0.0002845542,0.000051142364,0.0002882639,0.00017740094,0.0001820874],"domain_scores_gemma":[0.9985519,0.000830519,0.00020875332,0.00020588296,0.000106790205,0.00009605432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011439507,0.001179924,0.0008575832,0.0006504197,0.0007430837,0.002242709,0.0020936532,0.0012030201,0.010297569],"category_scores_gemma":[0.003232288,0.0006660707,0.0015595744,0.0011300758,0.001107061,0.0041607087,0.0018472553,0.0029228176,0.0008582891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003891105,0.0004944544,0.0010364768,0.0005544169,0.00011244504,0.00046409733,0.00028284467,0.2611755,0.0046295114,0.625635,0.010669531,0.09455653],"study_design_scores_gemma":[0.00008884568,0.00012256973,0.00031146675,0.000044418495,0.00003819369,0.00023798387,0.00012249297,0.56749266,0.0023765445,0.41982585,0.009310383,0.000028567882],"about_ca_topic_score_codex":0.0020603372,"about_ca_topic_score_gemma":0.0033422445,"teacher_disagreement_score":0.010297569,"about_ca_system_score_codex":0.0010988336,"about_ca_system_score_gemma":0.0014227376,"threshold_uncertainty_score":0.034448802},"labels":[],"label_agreement":null},{"id":"W1609788678","doi":"10.1007/s00493-016-3356-3","title":"Density of 5/2-critical graphs","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Graph homomorphism; Discrete mathematics; Graph; Homomorphism; Triangle-free graph; Graph power; Line graph","score_opus":0.018925724334806764,"score_gpt":0.2944850513808936,"score_spread":0.2755593270460868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609788678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86234087,0.00066507293,0.048837144,0.0018640881,0.00013710205,0.00007082552,0.0004921322,0.00043006972,0.08516267],"genre_scores_gemma":[0.98643756,0.00028762253,0.005744364,0.00019705007,0.00013232937,0.00008798172,0.00040264626,0.00009536492,0.0066151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992854,0.00019793812,0.000024308672,0.00011540521,0.00021430216,0.00016267046],"domain_scores_gemma":[0.99490476,0.00281455,0.00052912626,0.0002964195,0.00051964825,0.0009356582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000913093,0.00054708595,0.00069891574,0.0036816017,0.0019450873,0.0030936867,0.0016744408,0.0013692675,0.0123550305],"category_scores_gemma":[0.008123886,0.00071133504,0.0004573458,0.0012330912,0.0024578143,0.0025983267,0.0017408478,0.0014174844,0.00076190464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008998809,0.000038154045,0.0015632263,0.00007729153,0.000012452696,0.00014293099,0.0003691729,0.0034497147,0.0019168747,0.98551846,0.0032334924,0.0035881212],"study_design_scores_gemma":[0.00004582715,0.000024974428,0.002534417,0.000061962746,0.00002108102,0.00040706407,0.00035516665,0.042296708,0.0017547525,0.9495164,0.0029560395,0.000025661704],"about_ca_topic_score_codex":0.0018460766,"about_ca_topic_score_gemma":0.0018026661,"teacher_disagreement_score":0.0123550305,"about_ca_system_score_codex":0.0014961176,"about_ca_system_score_gemma":0.0007349559,"threshold_uncertainty_score":0.04133171},"labels":[],"label_agreement":null},{"id":"W1612749533","doi":"10.37236/3128","title":"Optimization Problems over Unit-Distance Representations of Graphs","year":2013,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Hypersphere; Mathematics; Combinatorics; Ellipsoid; Homomorphism; Generalization; Graph; Discrete mathematics; Unit sphere; Unit (ring theory)","score_opus":0.0181356453415886,"score_gpt":0.29378667735360786,"score_spread":0.27565103201201924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1612749533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16015127,0.0018974808,0.8159016,0.001294323,0.000107187894,0.00007953208,0.00049368397,0.00024689035,0.019828085],"genre_scores_gemma":[0.86915654,0.0020475923,0.11901192,0.00027752353,0.00028617177,0.00019756294,0.00078593916,0.0002119347,0.008024806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988073,0.0005058827,0.000048153637,0.00029741507,0.0002156946,0.00012550317],"domain_scores_gemma":[0.996439,0.0025114755,0.00041143733,0.00027658197,0.00016278762,0.00019880949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013548918,0.0012704064,0.0010748334,0.0010413636,0.0005375043,0.0024360374,0.0016488566,0.0012439662,0.004288676],"category_scores_gemma":[0.006876717,0.00043966208,0.000596291,0.0021315243,0.001444066,0.005763235,0.0019750728,0.0022015506,0.00058582745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012157522,0.00013030211,0.0005190245,0.00026394447,0.000050632945,0.000114586495,0.00018641347,0.1716128,0.0018882619,0.77460325,0.0038964204,0.046612836],"study_design_scores_gemma":[0.000016947748,0.00004063112,0.0001563324,0.000020381607,0.000008595314,0.00006090049,0.00007104889,0.24561445,0.00062507624,0.7516064,0.0017665824,0.000012609606],"about_ca_topic_score_codex":0.0006124355,"about_ca_topic_score_gemma":0.00048143213,"teacher_disagreement_score":0.004288676,"about_ca_system_score_codex":0.0014521152,"about_ca_system_score_gemma":0.0004388014,"threshold_uncertainty_score":0.014347017},"labels":[],"label_agreement":null},{"id":"W161287854","doi":"","title":"Edge Complete (p, 2) Semigraphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.022926056344896535,"score_gpt":0.2889876445121452,"score_spread":0.2660615881672487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161287854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37474117,0.00130248,0.27695772,0.0031144496,0.00047797288,0.0003097744,0.013655889,0.0018623157,0.32757825],"genre_scores_gemma":[0.8074672,0.0006238376,0.08182407,0.00060994166,0.0001874855,0.00017963847,0.006790107,0.00037950702,0.10193823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995546,0.00013735711,0.000026060216,0.000107997024,0.00010006207,0.00007390966],"domain_scores_gemma":[0.99859256,0.0005284579,0.00017037636,0.0002487169,0.0002205835,0.00023937628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004431097,0.0005274234,0.00046471332,0.0006208911,0.0013620815,0.0015214535,0.0006943184,0.00069866766,0.02140213],"category_scores_gemma":[0.0015703675,0.0003513299,0.00048598013,0.0010332351,0.00066855224,0.003108002,0.0013534952,0.0011545032,0.0032080135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085883733,0.0002451813,0.0020367655,0.0007770571,0.00011183802,0.0011602244,0.00057913386,0.00605254,0.013418809,0.81894666,0.063178815,0.0926343],"study_design_scores_gemma":[0.00007529414,0.000105785446,0.001856443,0.00006584235,0.000050230523,0.0010942698,0.00030838227,0.009927246,0.005244534,0.9199991,0.061247855,0.000024905523],"about_ca_topic_score_codex":0.0007152413,"about_ca_topic_score_gemma":0.001789333,"teacher_disagreement_score":0.02140213,"about_ca_system_score_codex":0.0005578551,"about_ca_system_score_gemma":0.0005434127,"threshold_uncertainty_score":0.07159722},"labels":[],"label_agreement":null},{"id":"W1613467653","doi":"10.1016/j.jctb.2015.12.005","title":"Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Lemma (botany); Conjecture; Isoperimetric inequality; Graph; Vertex (graph theory); Induced subgraph; Discrete mathematics; Botany","score_opus":0.033757637382348084,"score_gpt":0.3304632292392484,"score_spread":0.2967055918569003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1613467653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45066833,0.0055380305,0.21714738,0.011456903,0.0008534973,0.00028983763,0.0019398791,0.002699189,0.30940697],"genre_scores_gemma":[0.9101523,0.002144272,0.047977,0.001947777,0.0007087035,0.0002144858,0.0015237262,0.0009512215,0.034380484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987962,0.00017649285,0.000039830273,0.00027164127,0.00026293047,0.00045282464],"domain_scores_gemma":[0.99060726,0.005861557,0.00052857754,0.00091871526,0.0007683404,0.0013156073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095343776,0.001552881,0.0010649455,0.0030103235,0.0029144112,0.0056124176,0.0041263974,0.0018597735,0.027235365],"category_scores_gemma":[0.007300459,0.0008291857,0.0011900221,0.0027448,0.0029054487,0.0075027444,0.0034427962,0.0041675363,0.0040430957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069026113,0.00033186973,0.0044570114,0.0008565504,0.000077007535,0.00043563338,0.0010525315,0.027108386,0.011931137,0.8662379,0.04468648,0.042135194],"study_design_scores_gemma":[0.00008378054,0.000116412535,0.002572543,0.00016691013,0.00013952183,0.00046448302,0.00088571064,0.1113865,0.008098696,0.8596881,0.016319389,0.00007797254],"about_ca_topic_score_codex":0.0046405066,"about_ca_topic_score_gemma":0.008005175,"teacher_disagreement_score":0.027235365,"about_ca_system_score_codex":0.0040825815,"about_ca_system_score_gemma":0.0013670842,"threshold_uncertainty_score":0.09111136},"labels":[],"label_agreement":null},{"id":"W16151075","doi":"10.1007/978-3-642-38768-5_28","title":"An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rounding; Semidefinite programming; Computer science; Semidefinite embedding; Bisection method; Graph; Algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Quadratically constrained quadratic program","score_opus":0.02390558049323789,"score_gpt":0.27698206770268197,"score_spread":0.2530764872094441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16151075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018660944,0.00044839116,0.9558161,0.0006524871,0.00039385486,0.00023480791,0.0003827948,0.0026963756,0.020714207],"genre_scores_gemma":[0.109174035,0.0002855463,0.8773594,0.00041777184,0.00018298245,0.00041626458,0.0011091563,0.0006050108,0.0104497615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822694,0.0004312181,0.00008791476,0.0003643766,0.0006377486,0.0002518504],"domain_scores_gemma":[0.99763,0.0010848886,0.000130695,0.0005555456,0.0004412193,0.00015759894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014721075,0.001736206,0.0021156783,0.0012010376,0.0011630302,0.0032388638,0.0034992595,0.0017631509,0.015376953],"category_scores_gemma":[0.0051413085,0.0009439677,0.0014864971,0.0027672881,0.000752953,0.0030025356,0.002926516,0.005583424,0.0039915084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008554545,0.0010352304,0.00049529976,0.00049963477,0.000092887974,0.00014101066,0.00025055776,0.28510046,0.0073327483,0.091640055,0.045451634,0.56710505],"study_design_scores_gemma":[0.00012199235,0.00011064667,0.00011977046,0.000036636535,0.000022363345,0.000074701544,0.000056424906,0.9531086,0.0019145355,0.039437573,0.004974737,0.000021992184],"about_ca_topic_score_codex":0.0030773322,"about_ca_topic_score_gemma":0.0052333204,"teacher_disagreement_score":0.015376953,"about_ca_system_score_codex":0.0017236195,"about_ca_system_score_gemma":0.0026176996,"threshold_uncertainty_score":0.051441014},"labels":[],"label_agreement":null},{"id":"W161675474","doi":"10.1016/j.jctb.2007.10.005","title":"Corrigendum to “Counting connected graphs inside-out” [J. Combin. Theory Ser. B 93 (2005) 127–172]","year":2008,"lang":"en","type":"erratum","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.021592723447045832,"score_gpt":0.27204120898922163,"score_spread":0.2504484855421758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161675474","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026168814,0.0051630023,0.0022696713,0.045599405,0.93023396,0.00009133617,0.0012277997,0.00071225717,0.014440922],"genre_scores_gemma":[0.015847802,0.022246897,0.008803124,0.09011134,0.48092178,0.0005729793,0.006282615,0.0024074113,0.37280604],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943463,0.0010628735,0.0006701836,0.001058481,0.0023370949,0.0005250911],"domain_scores_gemma":[0.9830205,0.004259912,0.0007302923,0.0015010019,0.009452713,0.0010355742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038936704,0.004406547,0.0053551956,0.0080109555,0.004479849,0.004569648,0.007999784,0.005858694,0.12015045],"category_scores_gemma":[0.029803101,0.0021739677,0.0049215835,0.004917753,0.003926419,0.0064931773,0.0032877752,0.0069821766,0.066768825],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005131197,0.000018358347,0.000050476432,0.00025931562,0.0000378262,0.00012301403,0.000019446225,0.000102261336,0.00009437103,0.0020684435,0.9921308,0.0050443425],"study_design_scores_gemma":[0.00012375272,0.00012338762,0.0029223962,0.00037370977,0.0001958595,0.0007963766,0.00008779735,0.0012631688,0.00086933345,0.024756754,0.9683183,0.00016912038],"about_ca_topic_score_codex":0.014653779,"about_ca_topic_score_gemma":0.016785348,"teacher_disagreement_score":0.12015045,"about_ca_system_score_codex":0.007099346,"about_ca_system_score_gemma":0.00272934,"threshold_uncertainty_score":0.40194327},"labels":[],"label_agreement":null},{"id":"W161708728","doi":"","title":"Square-free colorings of graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Square-free integer; Cartesian product; Discrete mathematics; Multipartite; Bounded function; Graph; Domination analysis; Vertex (graph theory)","score_opus":0.015100800266836044,"score_gpt":0.26638835724180937,"score_spread":0.25128755697497335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161708728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4048225,0.004398797,0.50312126,0.0009494051,0.00076148007,0.0002081729,0.001766957,0.0011631267,0.0828083],"genre_scores_gemma":[0.87906724,0.0013337897,0.09243212,0.0004109854,0.000390524,0.00018379134,0.001535145,0.00025914307,0.024387272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991295,0.00022736119,0.000040603376,0.00020383208,0.00021183382,0.00018679744],"domain_scores_gemma":[0.99720436,0.00143448,0.00032023055,0.00041333793,0.00028944714,0.000338059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006006626,0.0005393079,0.00034372802,0.0012197387,0.0007918906,0.0012352308,0.0004957221,0.0004952533,0.0056930906],"category_scores_gemma":[0.0030298622,0.0004064495,0.00047567175,0.0011364444,0.0014097348,0.0016493747,0.0010435182,0.000893874,0.0009531816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024144382,0.000054194177,0.0020653033,0.0002878136,0.000038812323,0.00032065317,0.00049373735,0.023258863,0.009861627,0.8769864,0.009187201,0.077204034],"study_design_scores_gemma":[0.000030854597,0.00010427767,0.001485174,0.000036704707,0.000013977622,0.000544413,0.00014217851,0.03472813,0.0031921188,0.9303672,0.02932872,0.000026197096],"about_ca_topic_score_codex":0.0008878032,"about_ca_topic_score_gemma":0.0015120446,"teacher_disagreement_score":0.0056930906,"about_ca_system_score_codex":0.0009692744,"about_ca_system_score_gemma":0.00035877476,"threshold_uncertainty_score":0.019045234},"labels":[],"label_agreement":null},{"id":"W162572492","doi":"","title":"Generalized weakly connected domination in graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.020548479801050817,"score_gpt":0.2737326248080655,"score_spread":0.2531841450070147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162572492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6487225,0.002422684,0.18337093,0.0033706862,0.00022439066,0.0001366622,0.00095317786,0.0005046806,0.16029434],"genre_scores_gemma":[0.9636075,0.0007983182,0.013541945,0.00040130955,0.00015524012,0.00010663841,0.0004285322,0.000075638876,0.020884868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992223,0.00026631544,0.000036166548,0.00016263334,0.00019649981,0.000115976254],"domain_scores_gemma":[0.9973787,0.0014511475,0.0002507694,0.00032733424,0.00030472752,0.00028737338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061923283,0.0003822387,0.0005852596,0.0013462129,0.0015318322,0.0021413278,0.000786119,0.0007087218,0.0055244397],"category_scores_gemma":[0.0035372372,0.00030988082,0.00053750817,0.0014345435,0.0021733514,0.0033044945,0.0019151799,0.0011917572,0.00053519383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000678519,0.000023956558,0.0015177154,0.00013635197,0.000031504627,0.00021879564,0.0007287271,0.0017143872,0.0026399004,0.9740002,0.003151144,0.015769543],"study_design_scores_gemma":[0.000014931251,0.000011057396,0.00082740013,0.000029990317,0.000022033038,0.00027660528,0.00026386284,0.006904348,0.0010036833,0.9849517,0.005685157,0.000009255335],"about_ca_topic_score_codex":0.0012406659,"about_ca_topic_score_gemma":0.0020415373,"teacher_disagreement_score":0.0055244397,"about_ca_system_score_codex":0.0011670202,"about_ca_system_score_gemma":0.0005181239,"threshold_uncertainty_score":0.018481076},"labels":[],"label_agreement":null},{"id":"W1629366369","doi":"10.37236/1893","title":"Matroid Inequalities from Electrical Network Theory","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Generalization; Combinatorics; Rank (graph theory); Logarithm; Class (philosophy); Graphic matroid; Property (philosophy); Discrete mathematics; Plane (geometry); Mathematical analysis; Geometry","score_opus":0.010880758061514501,"score_gpt":0.2616404004158826,"score_spread":0.2507596423543681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1629366369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06951114,0.007711428,0.64735574,0.0069019403,0.00070742995,0.000081584534,0.0010753912,0.00021074433,0.26644462],"genre_scores_gemma":[0.8027811,0.007600487,0.1328387,0.0023511655,0.0013206047,0.00029804494,0.0012474953,0.00015609714,0.05140626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993874,0.00011045899,0.00003835076,0.000139692,0.00024566488,0.000078370715],"domain_scores_gemma":[0.9988212,0.00057677424,0.00010738998,0.000102205304,0.00031673216,0.00007572297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007871775,0.00050356134,0.00035840727,0.0011082793,0.00071600167,0.0015708108,0.00089910324,0.0007612108,0.008441204],"category_scores_gemma":[0.0026578608,0.00027261584,0.0004823812,0.0014786449,0.0016306815,0.0043336432,0.0015161306,0.0029473521,0.00114351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014913003,0.0000072111407,0.000119015094,0.00005205353,0.000004456212,0.000029448753,0.00006419373,0.0022025986,0.0010712877,0.9824785,0.0021633415,0.011792877],"study_design_scores_gemma":[0.00000888955,0.000020216967,0.00030967937,0.00002933785,0.0000059703816,0.00009833086,0.000052966156,0.015058934,0.0018948771,0.95533234,0.02717644,0.000011989584],"about_ca_topic_score_codex":0.0016864866,"about_ca_topic_score_gemma":0.0018286869,"teacher_disagreement_score":0.008441204,"about_ca_system_score_codex":0.0017658502,"about_ca_system_score_gemma":0.00044838485,"threshold_uncertainty_score":0.028238654},"labels":[],"label_agreement":null},{"id":"W1631636474","doi":"10.1016/j.dam.2015.06.011","title":"A tie-break model for graph search","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.08109971346624698,"score_gpt":0.3344557456080762,"score_spread":0.2533560321418292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1631636474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08323161,0.0014828622,0.85806715,0.0067867106,0.00027678674,0.0003533678,0.001501917,0.0008424657,0.047457185],"genre_scores_gemma":[0.82787746,0.0020195646,0.08663296,0.0013108688,0.0005424117,0.0008792045,0.0014496737,0.00068712846,0.078600846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729866,0.0011172307,0.00010395275,0.00056522526,0.00049097295,0.00042401213],"domain_scores_gemma":[0.98645663,0.008889652,0.0012559677,0.0015250928,0.0007627591,0.0011099763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003352112,0.0014185531,0.0033550141,0.0025664174,0.0024841735,0.0052967495,0.00784445,0.00769557,0.028684296],"category_scores_gemma":[0.030340109,0.0015262455,0.0018857933,0.0041504474,0.0035592434,0.012979388,0.004283843,0.00807719,0.003910852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018180725,0.00014446802,0.00052134,0.00020618757,0.00006801426,0.00016284341,0.00038771713,0.12864912,0.00064233394,0.8465014,0.010334658,0.012200109],"study_design_scores_gemma":[0.00007195533,0.000052911364,0.00010650436,0.000023164828,0.00002617944,0.000072953015,0.00009606389,0.3359991,0.000086654836,0.66110903,0.0023344161,0.000021099419],"about_ca_topic_score_codex":0.0048080203,"about_ca_topic_score_gemma":0.00454601,"teacher_disagreement_score":0.028684296,"about_ca_system_score_codex":0.0030368303,"about_ca_system_score_gemma":0.0020215146,"threshold_uncertainty_score":0.09595853},"labels":[],"label_agreement":null},{"id":"W164070410","doi":"","title":"Independent Sets And Matchings In Tensor Product Of Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tensor product; Product (mathematics); Tensor (intrinsic definition); Combinatorics; Pure mathematics; Geometry","score_opus":0.0124302741916157,"score_gpt":0.2691557154029496,"score_spread":0.2567254412113339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164070410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35470992,0.009380632,0.4348014,0.0047514364,0.0009275765,0.00015264527,0.001276499,0.0008583845,0.19314146],"genre_scores_gemma":[0.88554704,0.0029469777,0.06615897,0.0005492985,0.0009611754,0.00013725823,0.000930574,0.00025845866,0.042510264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978034,0.0007136254,0.00017967532,0.00047617735,0.00050792616,0.00031918648],"domain_scores_gemma":[0.99410903,0.0031230797,0.0008569578,0.00078942586,0.00049237005,0.0006291008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020331019,0.00076628075,0.0010755227,0.003646673,0.0028625517,0.004424146,0.0015716434,0.0016572303,0.01042421],"category_scores_gemma":[0.007776422,0.0011821999,0.0014526533,0.0039859107,0.004127701,0.011949607,0.0032603631,0.0028338458,0.0017626968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035373418,0.000020991702,0.0002792146,0.000045766432,0.000014044069,0.00006652921,0.00020342004,0.0007212,0.00038371727,0.99098575,0.0015003611,0.005743672],"study_design_scores_gemma":[0.0000058976857,0.0000103112625,0.0001844898,0.000017421951,0.000014952891,0.00013772548,0.000069080306,0.0028623585,0.00025830578,0.9934009,0.0030298166,0.000008736863],"about_ca_topic_score_codex":0.0015344416,"about_ca_topic_score_gemma":0.0018761391,"teacher_disagreement_score":0.01042421,"about_ca_system_score_codex":0.0016598208,"about_ca_system_score_gemma":0.00071843906,"threshold_uncertainty_score":0.034872413},"labels":[],"label_agreement":null},{"id":"W1641711201","doi":"10.1007/s00373-009-0864-6","title":"Upper Bounds for α-Domination Parameters","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Domination analysis; Mathematics; Upper and lower bounds; Combinatorics; Vertex (graph theory); Probabilistic logic; Graph; Discrete mathematics; Tuple; Statistics","score_opus":0.016888497846105178,"score_gpt":0.27610609123442076,"score_spread":0.25921759338831557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641711201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06392266,0.023757204,0.5899647,0.012710398,0.0012001602,0.0005269431,0.0049680714,0.0046432046,0.29830673],"genre_scores_gemma":[0.74937415,0.022497222,0.15665473,0.0053709303,0.003593606,0.0018584324,0.0049995705,0.0044077695,0.051243592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874213,0.0022220144,0.000685525,0.002695347,0.0037133005,0.0032625538],"domain_scores_gemma":[0.8831928,0.08873212,0.0039178543,0.013743077,0.0050577605,0.005356397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010980649,0.0066403737,0.0052313944,0.010764208,0.004778838,0.016863411,0.014903591,0.0063227233,0.03895318],"category_scores_gemma":[0.067958854,0.003933148,0.0033393994,0.013269479,0.006594465,0.036976453,0.013247203,0.022469906,0.011962102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094887253,0.00053353724,0.003857511,0.001217648,0.00027426478,0.00024815075,0.0010017987,0.045738295,0.00828033,0.8178604,0.028673412,0.09136587],"study_design_scores_gemma":[0.00005578819,0.00005057063,0.00081966864,0.0003172987,0.0001559375,0.00034026767,0.00017691111,0.036741123,0.004161368,0.9430205,0.01405765,0.0001028563],"about_ca_topic_score_codex":0.0016715125,"about_ca_topic_score_gemma":0.003050998,"teacher_disagreement_score":0.03895318,"about_ca_system_score_codex":0.009647615,"about_ca_system_score_gemma":0.0033887879,"threshold_uncertainty_score":0.13031137},"labels":[],"label_agreement":null},{"id":"W164421947","doi":"","title":"A space-filling complete graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Space (punctuation); Combinatorics; Computer science","score_opus":0.030524980774971847,"score_gpt":0.2844275239525914,"score_spread":0.25390254317761957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164421947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3946,0.0015612118,0.3096109,0.0046815327,0.000698889,0.000365076,0.008437112,0.0022996955,0.27774563],"genre_scores_gemma":[0.7644229,0.0011269667,0.15334758,0.00077565433,0.00015524392,0.00023192177,0.00515674,0.0005373718,0.07424558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996487,0.00008773063,0.000015414607,0.00008633269,0.0000878176,0.00007398983],"domain_scores_gemma":[0.9989698,0.00042382174,0.000116804964,0.00018810967,0.00013071709,0.00017066226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026356906,0.00050129276,0.0005899059,0.00067028886,0.0015667806,0.0018273123,0.0008060491,0.0011472873,0.021458639],"category_scores_gemma":[0.0018557751,0.00035237125,0.0005471131,0.0012863918,0.001203439,0.0026849676,0.0013922375,0.0014819645,0.003615984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002453637,0.00011482465,0.0003996053,0.00037311963,0.00003226991,0.00059075886,0.00045800296,0.0040993937,0.007423445,0.9162787,0.025396308,0.04458817],"study_design_scores_gemma":[0.00004750494,0.00006709928,0.00062553224,0.00006473116,0.00003413247,0.0007348361,0.00034865818,0.0087529365,0.004246637,0.9305391,0.054517806,0.000021005915],"about_ca_topic_score_codex":0.0010022804,"about_ca_topic_score_gemma":0.0012928544,"teacher_disagreement_score":0.021458639,"about_ca_system_score_codex":0.00052040094,"about_ca_system_score_gemma":0.0006766733,"threshold_uncertainty_score":0.071786284},"labels":[],"label_agreement":null},{"id":"W164741719","doi":"","title":"Embedding Graphs Containing K5-Subdivisions.","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Subdivision; Planarity testing; Mathematics; Embedding; Partition (number theory); Combinatorics; Planar graph; Discrete mathematics; Graph; Computer science; Geography; Artificial intelligence","score_opus":0.04491052220131737,"score_gpt":0.31998172315983103,"score_spread":0.2750712009585137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164741719","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55098873,0.00043499857,0.3932587,0.00028580145,0.00009238417,0.00014837318,0.00089347456,0.0012655273,0.05263203],"genre_scores_gemma":[0.8677333,0.00021532302,0.11802121,0.00007963617,0.000016497183,0.000036718175,0.001836976,0.0001852803,0.011875016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997148,0.000035910423,0.000021473912,0.00008187283,0.00008567395,0.000060293867],"domain_scores_gemma":[0.99923563,0.00022060203,0.0001441246,0.00023737828,0.000108828,0.00005338386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016833433,0.00044045487,0.00029396667,0.00037599824,0.0005349577,0.00085535686,0.000726076,0.00060233,0.0066872137],"category_scores_gemma":[0.0015375013,0.00032183272,0.0004938495,0.0005437718,0.00065891375,0.0018393899,0.0016253539,0.00089277513,0.0014329255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076737104,0.0001761874,0.0064745084,0.000665067,0.00008991901,0.001204723,0.0018969266,0.050001405,0.08984819,0.5837621,0.008788087,0.25632545],"study_design_scores_gemma":[0.00008201872,0.00029203767,0.010881791,0.00015159148,0.00023068124,0.0019006425,0.001488712,0.16528061,0.07333933,0.66464466,0.08161682,0.00009119056],"about_ca_topic_score_codex":0.0020876613,"about_ca_topic_score_gemma":0.0034002801,"teacher_disagreement_score":0.0066872137,"about_ca_system_score_codex":0.0005144417,"about_ca_system_score_gemma":0.0003169058,"threshold_uncertainty_score":0.022370994},"labels":[],"label_agreement":null},{"id":"W165089886","doi":"10.1007/978-3-642-40104-6_16","title":"On the Spanning Ratio of Theta-Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.028394435626567245,"score_gpt":0.2754427752379511,"score_spread":0.24704833961138384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165089886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44558012,0.019152675,0.18744381,0.0047725006,0.0010964143,0.00009357397,0.00089827937,0.00059949316,0.34036317],"genre_scores_gemma":[0.9243179,0.012134619,0.036786772,0.00068948866,0.0019887104,0.00017654552,0.00086698186,0.0005549139,0.0224841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.00029607976,0.000038754744,0.0001804429,0.00024119277,0.00011181901],"domain_scores_gemma":[0.9958334,0.0031323659,0.00028234746,0.00020236065,0.00028377443,0.00026578785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001359217,0.0011195105,0.0010847611,0.004280706,0.00091258634,0.0020645957,0.0017830653,0.00094637566,0.008908158],"category_scores_gemma":[0.009038301,0.00067433866,0.0006506481,0.0035660402,0.0021796643,0.0052680713,0.0016256836,0.0028730456,0.0015664987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001254645,0.000042463096,0.0007997549,0.00025459303,0.00003115422,0.00008697653,0.00029814773,0.0068583325,0.0030261897,0.93043673,0.0072504953,0.050789665],"study_design_scores_gemma":[0.000017009397,0.000034003337,0.0008690152,0.00006894432,0.000033255303,0.0003127315,0.00013405288,0.015629835,0.0008435975,0.9767849,0.0052582873,0.00001429908],"about_ca_topic_score_codex":0.00059681153,"about_ca_topic_score_gemma":0.00044876113,"teacher_disagreement_score":0.008908158,"about_ca_system_score_codex":0.0012705353,"about_ca_system_score_gemma":0.00028239354,"threshold_uncertainty_score":0.029800713},"labels":[],"label_agreement":null},{"id":"W165467593","doi":"10.1007/978-3-642-36694-9_17","title":"Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Computer science; Graphic matroid; Polyhedron; Lift (data mining); Representation (politics); Time complexity; Matrix representation; Flow (mathematics); Algorithm; Matroid partitioning; Set (abstract data type); Relation (database); Combinatorics; Discrete mathematics; Mathematics; Geometry; Data mining","score_opus":0.030916162013431014,"score_gpt":0.2852821066402142,"score_spread":0.2543659446267832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165467593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085947014,0.0007790963,0.87954825,0.000687086,0.00034893324,0.0002447592,0.00046770734,0.0020374614,0.029939676],"genre_scores_gemma":[0.3047492,0.0008604268,0.66820204,0.00019553893,0.00024523624,0.0003523476,0.0012507006,0.0009930856,0.023151508],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992781,0.00012573261,0.00003872104,0.00016674632,0.00020632449,0.00018441107],"domain_scores_gemma":[0.9980228,0.00092086283,0.00012438088,0.00054555415,0.00018248784,0.000203918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009292942,0.0015458813,0.0019120887,0.0019325598,0.0014343931,0.0030954357,0.0029121619,0.0013891615,0.015754957],"category_scores_gemma":[0.0044044703,0.0011616229,0.0023668872,0.0026535604,0.0014054466,0.004585076,0.00389424,0.004688318,0.0026608924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007017059,0.0004241325,0.000878225,0.0006765993,0.000113955204,0.00022119713,0.0004923226,0.15795727,0.0059956415,0.37754872,0.03088207,0.4241081],"study_design_scores_gemma":[0.0001257036,0.00009592877,0.00022731027,0.00006555857,0.00004523755,0.00013197027,0.000116923075,0.37903643,0.0019445596,0.611602,0.006580079,0.00002837199],"about_ca_topic_score_codex":0.0021153188,"about_ca_topic_score_gemma":0.0030818281,"teacher_disagreement_score":0.015754957,"about_ca_system_score_codex":0.0016415252,"about_ca_system_score_gemma":0.0014283778,"threshold_uncertainty_score":0.052705646},"labels":[],"label_agreement":null},{"id":"W1658236029","doi":"10.11650/twjm/1500406852","title":"INCIDENCE COLORING OF REGULAR GRAPHS AND COMPLEMENT GRAPHS","year":2012,"lang":"en","type":"article","venue":"Taiwanese Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Incidence (geometry); Complement (music); Chromatic scale; Combinatorics; Discrete mathematics","score_opus":0.03780756360018455,"score_gpt":0.3126725882282856,"score_spread":0.27486502462810103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1658236029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7665876,0.0004228243,0.15750915,0.0008173027,0.00009776381,0.000075827884,0.0005159193,0.00036522347,0.07360833],"genre_scores_gemma":[0.96651053,0.00031571317,0.025408182,0.00009703986,0.00007093423,0.000056295674,0.00035879595,0.00005546477,0.0071269884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950254,0.000106209016,0.00002291999,0.000121139026,0.00012309315,0.00012409588],"domain_scores_gemma":[0.99754816,0.00135335,0.0002997644,0.00025771165,0.0002874584,0.00025351788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047368385,0.00039332182,0.0003275896,0.0011139266,0.00086285605,0.0017318289,0.00068206823,0.00040825593,0.0053572888],"category_scores_gemma":[0.003210021,0.00033575945,0.00048324757,0.0010107191,0.0018054552,0.0016826118,0.0009635038,0.0010675178,0.00031077134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002257065,0.000108443055,0.005118564,0.000120132405,0.000021482283,0.0003183297,0.00033960817,0.026261073,0.015172133,0.9230641,0.0029502362,0.026300121],"study_design_scores_gemma":[0.000057164623,0.000070596165,0.004710066,0.000043755885,0.000036729285,0.00062464527,0.0003402709,0.13640253,0.012070769,0.838751,0.006847367,0.000045189343],"about_ca_topic_score_codex":0.0037606445,"about_ca_topic_score_gemma":0.005372344,"teacher_disagreement_score":0.0053572888,"about_ca_system_score_codex":0.0014447984,"about_ca_system_score_gemma":0.0008382981,"threshold_uncertainty_score":0.017921925},"labels":[],"label_agreement":null},{"id":"W1660895817","doi":"10.1007/978-3-642-13580-4_1","title":"High Degree Graphs Contain Large-Star Factors","year":2010,"lang":"en","type":"book-chapter","venue":"Bolyai Society mathematical studies","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lemma (botany); Session (web analytics); Star (game theory); Combinatorics; Degree (music); Graph; Simple (philosophy); Computer science; Graph theory; Theoretical computer science; Mathematics; Discrete mathematics; World Wide Web; Physics; Biology; Botany","score_opus":0.07678758911574396,"score_gpt":0.3183262065036169,"score_spread":0.24153861738787297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1660895817","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2877115,0.0069683436,0.21860273,0.0028898453,0.0010968616,0.0001882975,0.0017514648,0.0021389383,0.478652],"genre_scores_gemma":[0.8046161,0.0045031076,0.058409456,0.0006408479,0.0006028568,0.00009187609,0.0009639019,0.00074567937,0.12942621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978596,0.00003620666,0.000008446565,0.00006570739,0.00006279633,0.00004084618],"domain_scores_gemma":[0.998869,0.0005450386,0.000086484295,0.00020319637,0.00018368768,0.00011257627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025878393,0.0007122413,0.0006106761,0.0014861531,0.0013909917,0.0022636263,0.0005086772,0.00079810066,0.010032548],"category_scores_gemma":[0.0014643151,0.00058273476,0.00055465987,0.0018094796,0.0012735152,0.0034603274,0.0009092656,0.0014733423,0.0027460312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005668659,0.000026164847,0.00058296154,0.00022608756,0.000020441355,0.00022536404,0.00043360217,0.0012592721,0.0039307596,0.9540378,0.011838982,0.027361823],"study_design_scores_gemma":[0.000012199613,0.000017260581,0.00060243136,0.00003569051,0.000028376315,0.00066807447,0.00017418874,0.0030099011,0.003013799,0.95949537,0.0329279,0.0000147377195],"about_ca_topic_score_codex":0.0007489274,"about_ca_topic_score_gemma":0.0015832967,"teacher_disagreement_score":0.010032548,"about_ca_system_score_codex":0.0006192352,"about_ca_system_score_gemma":0.00033465293,"threshold_uncertainty_score":0.033562183},"labels":[],"label_agreement":null},{"id":"W166823269","doi":"","title":"On Irregularity In Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011329640090500047,"score_gpt":0.2636239412768887,"score_spread":0.2522943011863887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166823269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20290856,0.029973157,0.38292646,0.028213648,0.004927378,0.00016430733,0.0012502901,0.000998387,0.34863785],"genre_scores_gemma":[0.83178794,0.019206276,0.063185774,0.0042663203,0.006292739,0.00025416346,0.0016402414,0.0007956838,0.07257091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987992,0.0003753615,0.00008354404,0.00024970938,0.00030025945,0.00019183845],"domain_scores_gemma":[0.99171,0.0052087754,0.0006670615,0.0011363224,0.00066315394,0.0006148269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015144388,0.0007193808,0.0012489116,0.0040127053,0.002514661,0.0029619471,0.0013242945,0.0018635349,0.009335966],"category_scores_gemma":[0.010366258,0.0006440004,0.0009156138,0.003330008,0.005436583,0.010390888,0.0035983317,0.005056456,0.0018906324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003625034,0.000029280118,0.0007314371,0.0001199631,0.000016678314,0.00014283966,0.0003564539,0.0018755036,0.0002986313,0.97325385,0.008894112,0.014245183],"study_design_scores_gemma":[0.000004470435,0.000008959482,0.00025581638,0.000030242782,0.0000068898653,0.00012143544,0.00011423242,0.0025389583,0.000091435715,0.9904585,0.006362951,0.000006232303],"about_ca_topic_score_codex":0.0013667092,"about_ca_topic_score_gemma":0.0018004366,"teacher_disagreement_score":0.009335966,"about_ca_system_score_codex":0.0016679371,"about_ca_system_score_gemma":0.0004682665,"threshold_uncertainty_score":0.03123194},"labels":[],"label_agreement":null},{"id":"W1668554195","doi":"10.2298/aadm151109021k","title":"Protecting a graph with mobile guards","year":2015,"lang":"en","type":"preprint","venue":"Applicable Analysis and Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Combinatorics; Vertex (graph theory); Computer security; Theoretical computer science; Mathematics","score_opus":0.022173567486252925,"score_gpt":0.3022670874989861,"score_spread":0.2800935200127332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1668554195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22249615,0.0015206549,0.7623777,0.0011851509,0.00017663286,0.00017163756,0.0007566752,0.0012226639,0.010092789],"genre_scores_gemma":[0.90845656,0.0010622318,0.08594312,0.00023122464,0.00010458572,0.00011740882,0.00059825723,0.00017138837,0.0033153067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834,0.00038947418,0.00010624262,0.00046263292,0.0003128582,0.00038874723],"domain_scores_gemma":[0.9920427,0.0038315796,0.00093962153,0.002265959,0.00030926574,0.0006109288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012391985,0.0013961378,0.0014263394,0.00089566427,0.001280823,0.0021299447,0.0021537368,0.0016024366,0.0032126233],"category_scores_gemma":[0.007621978,0.0006272317,0.0013027027,0.0011632013,0.0024219838,0.006063485,0.003568623,0.0020378937,0.00081507076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001094926,0.00021518796,0.0034516638,0.0008671902,0.00021980068,0.0009347977,0.0008471785,0.40848294,0.04038615,0.44102687,0.008391548,0.09408172],"study_design_scores_gemma":[0.00008675929,0.0003040997,0.00072417373,0.00008704397,0.00010872156,0.0007927715,0.00029125813,0.4952116,0.011661616,0.48232004,0.008363441,0.000048432063],"about_ca_topic_score_codex":0.0012642081,"about_ca_topic_score_gemma":0.0012041022,"teacher_disagreement_score":0.0032126233,"about_ca_system_score_codex":0.0015350465,"about_ca_system_score_gemma":0.0011116464,"threshold_uncertainty_score":0.011137545},"labels":[],"label_agreement":null},{"id":"W167532964","doi":"","title":"The Resolution Width Problem is EXPTIME-Complete.","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Resolution (logic); Conjecture; Mathematical proof; Mathematics; Set (abstract data type); Integer (computer science); Proof complexity; Reduction (mathematics); Discrete mathematics; Integer programming; Combinatorics; Algorithm; Computer science","score_opus":0.02134139489818287,"score_gpt":0.26929238239771053,"score_spread":0.24795098749952765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167532964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063038714,0.0028461164,0.86814445,0.018004777,0.0005508048,0.0005928937,0.0042854724,0.0018204341,0.040716317],"genre_scores_gemma":[0.52711725,0.0035893153,0.4283396,0.0059399824,0.0010513016,0.0010364419,0.0067672855,0.001278385,0.024880435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929085,0.0016242028,0.0006222282,0.0023037172,0.0015645635,0.0009769],"domain_scores_gemma":[0.94815254,0.04429272,0.0016838794,0.003198167,0.0018427934,0.00082986266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005661838,0.0014069779,0.0021160245,0.0011355046,0.0022700583,0.0068735224,0.0038792512,0.0032908737,0.012925594],"category_scores_gemma":[0.03616489,0.00160069,0.0044353693,0.0022227468,0.005684112,0.016181292,0.0047442922,0.010301997,0.0023265998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012501513,0.00061555585,0.0025505114,0.0025465777,0.00048476402,0.00076395075,0.0012295247,0.04201647,0.008042673,0.78030074,0.031940125,0.12825893],"study_design_scores_gemma":[0.00018183724,0.00008766999,0.00047579702,0.000099263,0.000089847344,0.0006065243,0.00017500046,0.031117199,0.003825244,0.9516082,0.011683968,0.0000493498],"about_ca_topic_score_codex":0.0036576388,"about_ca_topic_score_gemma":0.0029216532,"teacher_disagreement_score":0.012925594,"about_ca_system_score_codex":0.0022628284,"about_ca_system_score_gemma":0.0038929214,"threshold_uncertainty_score":0.043240428},"labels":[],"label_agreement":null},{"id":"W167733642","doi":"","title":"Total domination in Kr-covered graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010918119384244298,"score_gpt":0.2668438112478923,"score_spread":0.255925691863648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167733642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78660667,0.0013184994,0.0923295,0.001432219,0.00007197541,0.00009098205,0.0019663365,0.00051554875,0.11566814],"genre_scores_gemma":[0.9754032,0.00058048253,0.0067599188,0.00016135721,0.000047494115,0.00005141934,0.0009200756,0.00011093229,0.015965244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897015,0.00019894779,0.000044747143,0.00020857107,0.00029700578,0.00028058435],"domain_scores_gemma":[0.99558926,0.0026253841,0.00042634757,0.0005220061,0.00046575803,0.00037134372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005906516,0.00032354996,0.0005624906,0.0014422045,0.0011657209,0.0023002469,0.00086233293,0.00058423687,0.008710919],"category_scores_gemma":[0.003586326,0.00041844192,0.0005847533,0.0016470153,0.0012144378,0.0033965302,0.0018165049,0.0008262458,0.0008792212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040913085,0.00008177655,0.009304713,0.000675092,0.00020249467,0.0009956539,0.0021001515,0.016409539,0.014319359,0.8761439,0.016150976,0.0632072],"study_design_scores_gemma":[0.000080094826,0.00006601666,0.006079163,0.00013836955,0.00020006252,0.002268583,0.0011586562,0.048866414,0.009946882,0.89782935,0.033322886,0.00004344219],"about_ca_topic_score_codex":0.0025695772,"about_ca_topic_score_gemma":0.003478571,"teacher_disagreement_score":0.008710919,"about_ca_system_score_codex":0.0012027565,"about_ca_system_score_gemma":0.00055740273,"threshold_uncertainty_score":0.02914095},"labels":[],"label_agreement":null},{"id":"W1678874697","doi":"10.1007/s12532-018-0145-6","title":"Enumeration of 2-level polytopes","year":2018,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Enumeration; Facet (psychology); Combinatorics; Hyperplane; Mathematics; Dimension (graph theory); Polytope model; Regular polygon; Convex polytope; Polyhedral combinatorics; Birkhoff polytope; Discrete mathematics; Convex set; Convex optimization; Geometry","score_opus":0.056748973027078806,"score_gpt":0.34766620676157195,"score_spread":0.29091723373449313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1678874697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2328577,0.000446465,0.6644281,0.0013316127,0.00018091228,0.00019360156,0.0025865266,0.0010353603,0.096939676],"genre_scores_gemma":[0.47156245,0.000501717,0.47423536,0.0004659191,0.00010566649,0.0004242571,0.0057620085,0.0007914651,0.04615118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993337,0.0001523094,0.00003977797,0.00012658603,0.0001916117,0.0001560134],"domain_scores_gemma":[0.99883467,0.00054927985,0.000094551426,0.00021702376,0.00017048334,0.00013401134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038265742,0.0006677738,0.0009522997,0.0014749026,0.0011791144,0.0035713336,0.0016160305,0.0013367814,0.030667692],"category_scores_gemma":[0.002824087,0.0007775816,0.0012807937,0.0022179678,0.0008574083,0.0033041385,0.0023305647,0.0025800217,0.0044225208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015932033,0.00023663034,0.0015888829,0.00046952645,0.000054290966,0.00021553802,0.00040711026,0.038409572,0.005464865,0.8382889,0.019379817,0.09532552],"study_design_scores_gemma":[0.000044527096,0.000049638234,0.0008461136,0.00008941045,0.000029463805,0.00022978506,0.00022838442,0.103758834,0.003226286,0.870416,0.021053834,0.000027820477],"about_ca_topic_score_codex":0.0009841893,"about_ca_topic_score_gemma":0.0020897565,"teacher_disagreement_score":0.030667692,"about_ca_system_score_codex":0.00084671413,"about_ca_system_score_gemma":0.00053156336,"threshold_uncertainty_score":0.10259366},"labels":[],"label_agreement":null},{"id":"W1681620790","doi":"10.1007/978-3-642-17517-6_20","title":"Simultaneous Interval Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interval graph; Combinatorics; Chordal graph; Indifference graph; Pathwidth; Split graph; Cograph; Mathematics; Bipartite graph; Discrete mathematics; Maximal independent set; Interval (graph theory); Vertex (graph theory); 1-planar graph; Graph; Line graph","score_opus":0.015983635976769894,"score_gpt":0.279561506986288,"score_spread":0.2635778710095181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1681620790","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035019666,0.0016742423,0.3647448,0.00066531944,0.00081869337,0.00013519659,0.00064863893,0.0009870336,0.5953064],"genre_scores_gemma":[0.61872494,0.003038182,0.13872783,0.00050504075,0.00085298123,0.0003399717,0.0020919505,0.0008647677,0.23485434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955565,0.00006458824,0.000021357479,0.00014644684,0.00015047262,0.000061497376],"domain_scores_gemma":[0.999255,0.0002577563,0.000057219804,0.00020274692,0.00014167899,0.00008562858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031163532,0.0007400358,0.00049454905,0.0010327322,0.000994911,0.0018961284,0.0011653068,0.0006216339,0.03138552],"category_scores_gemma":[0.0018000776,0.0005772593,0.0007405335,0.0016941709,0.00068235985,0.0032711194,0.0018424558,0.0025164534,0.005283892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054693675,0.000035348676,0.000105203566,0.000098960605,0.000010824583,0.00008640812,0.00014793965,0.001594998,0.0026633032,0.92436063,0.009698977,0.06114274],"study_design_scores_gemma":[0.000016571903,0.000046126093,0.00027000796,0.000036681547,0.000028081355,0.0003093691,0.00010519131,0.0068881717,0.0022977856,0.9211704,0.06881798,0.000013618226],"about_ca_topic_score_codex":0.00035327233,"about_ca_topic_score_gemma":0.00040182754,"teacher_disagreement_score":0.03138552,"about_ca_system_score_codex":0.00056835264,"about_ca_system_score_gemma":0.0003505584,"threshold_uncertainty_score":0.10499501},"labels":[],"label_agreement":null},{"id":"W1683401792","doi":"10.1016/j.jctb.2015.11.005","title":"Certifying non-representability of matroids over prime fields","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Prime (order theory); Mathematics; Computer science; Combinatorics","score_opus":0.030494904017273235,"score_gpt":0.3143289892299906,"score_spread":0.28383408521271736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683401792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75840825,0.00045643435,0.20622124,0.006828437,0.00046880342,0.00016819745,0.0011310355,0.0020598455,0.024257705],"genre_scores_gemma":[0.9805248,0.00023139165,0.014168187,0.0005228689,0.0004579952,0.00007379496,0.00086787477,0.00024063657,0.0029124902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939136,0.0014226857,0.0004411295,0.0016898356,0.0014014387,0.0011313843],"domain_scores_gemma":[0.94114923,0.03923758,0.005307663,0.008661164,0.00318066,0.002463653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045038112,0.001159248,0.0022925679,0.0014291635,0.002338235,0.0067803464,0.0034366176,0.0032100528,0.006381666],"category_scores_gemma":[0.037231322,0.001593334,0.001995382,0.0019832323,0.006146901,0.012780552,0.0052007013,0.008445835,0.00089310645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012449772,0.0004224109,0.0065613613,0.0005553882,0.00022627747,0.0010587667,0.001616638,0.032366775,0.007998376,0.90724593,0.0085390005,0.032164052],"study_design_scores_gemma":[0.000094876705,0.00007858515,0.00039635398,0.000030859057,0.000043021457,0.00028641624,0.00013698424,0.024289664,0.0021344747,0.9713102,0.0011717614,0.000026667476],"about_ca_topic_score_codex":0.0007776405,"about_ca_topic_score_gemma":0.0008206775,"teacher_disagreement_score":0.0067803464,"about_ca_system_score_codex":0.001892079,"about_ca_system_score_gemma":0.0016935412,"threshold_uncertainty_score":0.023818731},"labels":[],"label_agreement":null},{"id":"W1683881076","doi":"10.1287/moor.2016.0815","title":"Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Convexity; Combinatorics; Finite set; Monotone polygon; Discrete mathematics; Regular polygon; Mathematical analysis","score_opus":0.11030769931766725,"score_gpt":0.4258984505532524,"score_spread":0.3155907512355851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683881076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4087948,0.0027231965,0.5034471,0.0024898953,0.00026080853,0.00010965213,0.00065369083,0.00016915808,0.08135164],"genre_scores_gemma":[0.8998335,0.0011439907,0.08955784,0.00022133016,0.00036099038,0.0001750774,0.00036081416,0.000087948,0.0082585085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850637,0.0004320313,0.00009296172,0.00038197832,0.00039605438,0.0001906574],"domain_scores_gemma":[0.9922053,0.0050959717,0.0009408,0.0005863456,0.00063093024,0.0005406735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024645692,0.0005872418,0.00079109264,0.0032155334,0.0015541398,0.0037297388,0.0009008921,0.0007174945,0.007034268],"category_scores_gemma":[0.010419311,0.00038603524,0.001213426,0.0016878543,0.0054913466,0.008328147,0.0018730805,0.0031187704,0.000735324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015900736,0.000009226868,0.00035854772,0.000022060727,0.0000045870606,0.000019350908,0.00009812237,0.0014392764,0.00039486034,0.9926577,0.00034564317,0.0046346523],"study_design_scores_gemma":[0.0000069811886,0.000024064128,0.0005857209,0.000016684671,0.000006355882,0.00008520441,0.000097755365,0.014529437,0.00094256445,0.98085314,0.0028318265,0.00002023699],"about_ca_topic_score_codex":0.00068779016,"about_ca_topic_score_gemma":0.00058132515,"teacher_disagreement_score":0.007034268,"about_ca_system_score_codex":0.0025568472,"about_ca_system_score_gemma":0.00074290636,"threshold_uncertainty_score":0.023531973},"labels":[],"label_agreement":null},{"id":"W168997024","doi":"","title":"The Greedy Algorithm for Domination in Cubic Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Greedy algorithm; Mathematics; Cubic graph; Combinatorics; Algorithm; Graph; Line graph","score_opus":0.013345152088701713,"score_gpt":0.2831954101280781,"score_spread":0.26985025803937635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168997024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06726803,0.0022131908,0.8363113,0.0031728777,0.0004463732,0.00047057195,0.0013374178,0.0048012626,0.08397894],"genre_scores_gemma":[0.42535463,0.0013571717,0.52983224,0.0009154133,0.00023824854,0.0004859677,0.0019826146,0.0010258695,0.038807828],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915314,0.00020740637,0.00003351304,0.000121760924,0.000244232,0.00023996312],"domain_scores_gemma":[0.9981254,0.00091272016,0.000096613076,0.00045648654,0.00023136787,0.00017744041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090145966,0.00068891695,0.0006532983,0.0010730262,0.0015769611,0.0016684129,0.0018340207,0.0011317137,0.009187823],"category_scores_gemma":[0.005542916,0.0004351286,0.0007203261,0.0019013063,0.0012480457,0.0027749173,0.0024751942,0.0018394013,0.0029969267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089470367,0.00023822534,0.0023080006,0.00054904114,0.000116348165,0.00018860449,0.00056400953,0.057452075,0.007482063,0.28643543,0.090984434,0.55278695],"study_design_scores_gemma":[0.00048042074,0.00014202522,0.0011006986,0.00011312359,0.00010239337,0.00037542052,0.0002843535,0.3698775,0.006496727,0.5749624,0.045998912,0.000066092034],"about_ca_topic_score_codex":0.010100346,"about_ca_topic_score_gemma":0.01612563,"teacher_disagreement_score":0.010100346,"about_ca_system_score_codex":0.0019101014,"about_ca_system_score_gemma":0.0043693674,"threshold_uncertainty_score":0.030736327},"labels":[],"label_agreement":null},{"id":"W1695953772","doi":"10.1016/j.ejc.2015.06.005","title":"Improved complexity results on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-coloring <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs","year":2015,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Vertex (graph theory); Complete coloring; Graph; Induced subgraph; Discrete mathematics; Line graph","score_opus":0.03197586937708036,"score_gpt":0.2621459650223334,"score_spread":0.23017009564525304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1695953772","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096699126,0.007378155,0.3725759,0.020079337,0.0025753838,0.0005557279,0.012499982,0.005181498,0.48245484],"genre_scores_gemma":[0.6015212,0.0061410996,0.21551171,0.0043123662,0.0035968751,0.0009127773,0.018756613,0.0053905197,0.14385687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964964,0.0006671802,0.00017369757,0.00066011114,0.0013121306,0.000690447],"domain_scores_gemma":[0.9827544,0.010029228,0.0007648499,0.003498822,0.0020409306,0.0009116966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020265991,0.0024478645,0.0016152291,0.0040280046,0.002402029,0.0048522246,0.00455607,0.001969866,0.05757092],"category_scores_gemma":[0.0136925625,0.0007714138,0.0030845145,0.0045400867,0.0023579225,0.010862482,0.0047661667,0.0075609116,0.01412159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012250032,0.00071283383,0.004662303,0.0025052966,0.00034026813,0.0007763068,0.0010187315,0.07673921,0.012034568,0.5304832,0.22607277,0.14342955],"study_design_scores_gemma":[0.00017282869,0.00011741522,0.0030967172,0.00016600637,0.00027531662,0.00056431344,0.00024448783,0.08571781,0.005593181,0.8559584,0.04797719,0.0001163101],"about_ca_topic_score_codex":0.009384505,"about_ca_topic_score_gemma":0.020206107,"teacher_disagreement_score":0.05757092,"about_ca_system_score_codex":0.0055829845,"about_ca_system_score_gemma":0.0027956618,"threshold_uncertainty_score":0.19259393},"labels":[],"label_agreement":null},{"id":"W1696541610","doi":"10.1002/jgt.22018","title":"Strongly Even‐Cycle Decomposable Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Mathematics; Combinatorics; Subdivision; Eulerian path; Characterization (materials science); Chordal graph; Property (philosophy); Graph; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Pure mathematics; Computer science; Lagrangian","score_opus":0.012991495177843027,"score_gpt":0.27929766973279474,"score_spread":0.2663061745549517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696541610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87344813,0.00008889136,0.10360888,0.00021814479,0.000031909887,0.00005563336,0.00073155505,0.0002908743,0.021526005],"genre_scores_gemma":[0.9783999,0.000086535874,0.016475054,0.00007459901,0.000021410247,0.00005224545,0.0009412377,0.00004864956,0.003900219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969125,0.000041639712,0.00001840249,0.00009560119,0.000080093814,0.000073132964],"domain_scores_gemma":[0.9990121,0.00031741933,0.00012174095,0.00019292119,0.00019035363,0.00016556057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020283954,0.00040051734,0.0002799071,0.0006633306,0.0005413871,0.0007847348,0.0004325053,0.0003241783,0.0029856479],"category_scores_gemma":[0.0008193104,0.00023297785,0.0003141443,0.0005013109,0.0009151759,0.0011826116,0.0009232998,0.0007301578,0.0003046336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000510193,0.00016259153,0.008032164,0.00020836867,0.000055522203,0.0013819378,0.0006896726,0.018509762,0.089016855,0.80709267,0.0030975747,0.071242675],"study_design_scores_gemma":[0.00004187517,0.00011283513,0.0038183834,0.000034479755,0.000041246487,0.0008169184,0.0004048469,0.033601504,0.039878976,0.9078405,0.013382672,0.000025712648],"about_ca_topic_score_codex":0.0004902084,"about_ca_topic_score_gemma":0.00070057355,"teacher_disagreement_score":0.0029856479,"about_ca_system_score_codex":0.00038881172,"about_ca_system_score_gemma":0.0003820631,"threshold_uncertainty_score":0.00998801},"labels":[],"label_agreement":null},{"id":"W16985043","doi":"10.1158/1055-9965.epi-06-0479","title":"Realizability of p-Point, q-Line Graphs with Prescribed Maximum Degree, and Point Connectivity.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Realizability; Mathematics; Degree (music); Point (geometry); Line (geometry); Combinatorics; Discrete mathematics; Algorithm; Geometry; Physics","score_opus":0.02517202750151202,"score_gpt":0.2729990411080596,"score_spread":0.2478270136065476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16985043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72757745,0.00038953248,0.20219746,0.0011221671,0.000048340982,0.00011974758,0.0014217653,0.0005332703,0.06659027],"genre_scores_gemma":[0.97904,0.00018130678,0.015480567,0.00006412549,0.00003033569,0.000064454856,0.0007580355,0.00005379835,0.004327262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995059,0.00013528393,0.000033345037,0.00013194382,0.00011277801,0.00008065024],"domain_scores_gemma":[0.997122,0.0015285059,0.0005054346,0.00037660205,0.0002097454,0.00025769637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050552597,0.0003368322,0.00036725274,0.00068923703,0.0010029031,0.002024944,0.00092646165,0.0011118498,0.0056075654],"category_scores_gemma":[0.0039730943,0.0004748357,0.0006870365,0.0007558704,0.0016318914,0.0035709129,0.0013961989,0.0013341766,0.00046842473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021598468,0.00007923983,0.002219448,0.00011037995,0.00003338774,0.0004382297,0.00050935673,0.020109864,0.0046937326,0.95864856,0.0021705627,0.010771248],"study_design_scores_gemma":[0.00007426038,0.00004794245,0.0010141061,0.000026575166,0.00002679065,0.00028656822,0.00028693522,0.03796336,0.0026816253,0.9550567,0.0025176418,0.000017518356],"about_ca_topic_score_codex":0.0019761578,"about_ca_topic_score_gemma":0.0027560664,"teacher_disagreement_score":0.0056075654,"about_ca_system_score_codex":0.0007488589,"about_ca_system_score_gemma":0.0004277721,"threshold_uncertainty_score":0.018759191},"labels":[],"label_agreement":null},{"id":"W170988298","doi":"","title":"Twin Domination in Digraphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Physics","score_opus":0.013472682030766093,"score_gpt":0.27525342787879337,"score_spread":0.2617807458480273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170988298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19790454,0.007245213,0.40298933,0.0030175264,0.00071197527,0.00023222355,0.00219349,0.0009846768,0.384721],"genre_scores_gemma":[0.8378149,0.0027439585,0.053648293,0.00067500246,0.00033660507,0.00022257106,0.0016428157,0.00023264157,0.10268324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989743,0.00026693477,0.00007762328,0.0002730998,0.00021559719,0.00019243888],"domain_scores_gemma":[0.9981495,0.0009554525,0.00016130366,0.00020628888,0.00027774484,0.000249686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078712124,0.00058188837,0.00052925845,0.0018679429,0.0023640539,0.0034229397,0.0005209831,0.0006250794,0.011866554],"category_scores_gemma":[0.002935567,0.00057131215,0.00070925796,0.002437936,0.0021333953,0.0043807435,0.0021620968,0.0011931749,0.0014080127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004499816,0.0000142608005,0.00061634986,0.000096813674,0.000013556535,0.00024524843,0.00088469504,0.0010421958,0.0009402211,0.9588364,0.00352021,0.033744976],"study_design_scores_gemma":[0.000014978896,0.000021936125,0.0005088921,0.00004879811,0.000020712117,0.00047859954,0.00033868724,0.005591355,0.0011090548,0.9429004,0.048946388,0.000020184547],"about_ca_topic_score_codex":0.003174013,"about_ca_topic_score_gemma":0.0062027024,"teacher_disagreement_score":0.011866554,"about_ca_system_score_codex":0.0022267469,"about_ca_system_score_gemma":0.001000994,"threshold_uncertainty_score":0.039697528},"labels":[],"label_agreement":null},{"id":"W171110949","doi":"","title":"The total number of generalized stable sets and kernels of graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012070815635474404,"score_gpt":0.2810397959182403,"score_spread":0.2689689802827659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171110949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8587462,0.0010804293,0.09036533,0.0013003029,0.00015813942,0.00007220051,0.0014861273,0.00038939936,0.04640187],"genre_scores_gemma":[0.98503256,0.0004911939,0.007759345,0.00007277553,0.00012606014,0.000068540656,0.0004583662,0.000071391616,0.0059196907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988702,0.00023908324,0.00007583698,0.00027392892,0.00033087892,0.00021002158],"domain_scores_gemma":[0.994514,0.002756738,0.0006726343,0.00074691465,0.00059183885,0.0007178937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011247869,0.0004792132,0.0008637065,0.0034354646,0.001546672,0.004300762,0.0019015209,0.001163638,0.008759669],"category_scores_gemma":[0.0074428646,0.0005066975,0.0007817523,0.0019040927,0.0031431883,0.008065824,0.0017999627,0.0010824476,0.00079115405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014791594,0.000038944076,0.0034723901,0.00014616548,0.000059262566,0.000100205645,0.0002873108,0.002986386,0.0035520552,0.9703129,0.002642411,0.016254153],"study_design_scores_gemma":[0.000021799904,0.000029212724,0.002437531,0.000031091564,0.00004929255,0.00050588965,0.0002637063,0.016622266,0.0023648164,0.97449625,0.0031572364,0.000020975262],"about_ca_topic_score_codex":0.00049068034,"about_ca_topic_score_gemma":0.00061933405,"teacher_disagreement_score":0.008759669,"about_ca_system_score_codex":0.0011273748,"about_ca_system_score_gemma":0.0004843825,"threshold_uncertainty_score":0.029304028},"labels":[],"label_agreement":null},{"id":"W1712011956","doi":"","title":"Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Cograph; Chordal graph; 1-planar graph; Graph","score_opus":0.02047042098494921,"score_gpt":0.2928000782790482,"score_spread":0.27232965729409897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1712011956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8338588,0.0015720018,0.10461727,0.002468151,0.00012978916,0.00012576967,0.0011378778,0.0002752039,0.05581511],"genre_scores_gemma":[0.97455615,0.0012982114,0.015601456,0.00030512217,0.00026232432,0.000109356806,0.00088295847,0.00007385676,0.0069105346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986601,0.00025906603,0.00009072745,0.00040749653,0.00034919239,0.0002334294],"domain_scores_gemma":[0.9878973,0.0068991003,0.0021174971,0.0014310265,0.00065703504,0.0009981147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089906086,0.00076634577,0.00096178864,0.0024054023,0.002398864,0.0031972954,0.0016530708,0.0013987867,0.007703385],"category_scores_gemma":[0.007731959,0.0009014996,0.0009938291,0.0043705,0.0037812218,0.0063144662,0.002524835,0.0028003503,0.0003988196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044977764,0.0001667582,0.007813705,0.00037595458,0.00008542946,0.0009930147,0.0014545969,0.011899308,0.0057712486,0.92836535,0.0053025982,0.037322298],"study_design_scores_gemma":[0.000048812566,0.00005016388,0.0026005069,0.000030563082,0.00006715621,0.00079158606,0.0002763585,0.017775062,0.0013981968,0.97389936,0.0030272347,0.00003505592],"about_ca_topic_score_codex":0.0018933916,"about_ca_topic_score_gemma":0.002937557,"teacher_disagreement_score":0.007703385,"about_ca_system_score_codex":0.0009710552,"about_ca_system_score_gemma":0.0006487469,"threshold_uncertainty_score":0.025770426},"labels":[],"label_agreement":null},{"id":"W171736474","doi":"","title":"Partioning A Bipartite Graph into Vertex-Disjoint Paths.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Complete bipartite graph; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.011712075852797465,"score_gpt":0.2598653087767702,"score_spread":0.24815323292397276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171736474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11044836,0.0007826248,0.818609,0.00070822565,0.00020366749,0.00037042162,0.0014166548,0.0017969309,0.06566418],"genre_scores_gemma":[0.51700234,0.0010856217,0.4124309,0.0007110439,0.00020915442,0.00054406165,0.0037049418,0.0009436534,0.06336828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891794,0.00039746464,0.000048671107,0.00026339322,0.00017305504,0.00019947332],"domain_scores_gemma":[0.996366,0.0017181828,0.0002392292,0.0011077238,0.00029556442,0.00027326538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007595573,0.0007363864,0.0005538036,0.0013165327,0.0014584007,0.001297363,0.0010223775,0.00073849043,0.013417287],"category_scores_gemma":[0.004257309,0.0006715184,0.00088837143,0.0022652142,0.0011561067,0.00292942,0.0024910602,0.0014244167,0.0037019923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079388014,0.00028636528,0.0019554954,0.00079286325,0.00020010183,0.000722486,0.0015773427,0.056586675,0.032645456,0.67666125,0.033327874,0.19445026],"study_design_scores_gemma":[0.00008300847,0.00016378863,0.0013490892,0.00013136708,0.00014313664,0.0005324652,0.00051163987,0.13523766,0.013401066,0.8025671,0.045833968,0.000045790286],"about_ca_topic_score_codex":0.0018568248,"about_ca_topic_score_gemma":0.004143553,"teacher_disagreement_score":0.013417287,"about_ca_system_score_codex":0.00057316956,"about_ca_system_score_gemma":0.00070204434,"threshold_uncertainty_score":0.044885278},"labels":[],"label_agreement":null},{"id":"W172066816","doi":"","title":"New Conditions for k-ordered Hamiltonian Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Hamiltonian path; Hamiltonian (control theory); Path graph; Graph; Discrete mathematics; Graph power; Line graph","score_opus":0.017926935948161738,"score_gpt":0.2960958785239048,"score_spread":0.27816894257574304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172066816","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21337518,0.0017950734,0.33818233,0.006935821,0.002787754,0.000735167,0.005070014,0.0020996514,0.429019],"genre_scores_gemma":[0.8587178,0.00152374,0.10245685,0.002183927,0.0010762251,0.0007694424,0.004424471,0.0005804019,0.028267162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985619,0.0002758743,0.00015536127,0.00028138867,0.00036708332,0.00035834324],"domain_scores_gemma":[0.9929724,0.0027892303,0.0009036352,0.00065723713,0.0011202799,0.0015572069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010963446,0.00075967744,0.0006035753,0.0020852676,0.0024473113,0.0022848381,0.00136913,0.0022626605,0.030464046],"category_scores_gemma":[0.009367582,0.0007561888,0.0008326965,0.0013574027,0.002263187,0.008269372,0.0029648424,0.003136966,0.0049327584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020950769,0.00009177169,0.0010457558,0.00023669278,0.000013399613,0.00089988724,0.00044399942,0.0024596844,0.005175603,0.9657638,0.013331822,0.010328181],"study_design_scores_gemma":[0.00014514309,0.00010557462,0.0012088229,0.00010996842,0.000032557517,0.0014312594,0.00081515283,0.013948242,0.0047986377,0.93749523,0.039836008,0.00007341562],"about_ca_topic_score_codex":0.0014371421,"about_ca_topic_score_gemma":0.002479367,"teacher_disagreement_score":0.030464046,"about_ca_system_score_codex":0.0012116751,"about_ca_system_score_gemma":0.0010984888,"threshold_uncertainty_score":0.10191244},"labels":[],"label_agreement":null},{"id":"W172707356","doi":"","title":"Realization of Degree 10 Minimum Spanning Trees in 3-Space.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Realization (probability); Spanning tree; Minimum spanning tree; Degree (music); Minimum degree spanning tree; Computer science; Space (punctuation); Mathematics; Combinatorics; Physics; Statistics","score_opus":0.046233520706352484,"score_gpt":0.28765465180558203,"score_spread":0.24142113109922955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172707356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5934158,0.00056923076,0.31950068,0.0016492929,0.0003045035,0.00012296409,0.0017733166,0.0011439974,0.08152019],"genre_scores_gemma":[0.89614594,0.00024143312,0.09406993,0.00010922825,0.000022500019,0.00009575598,0.0010509423,0.00008724312,0.008177047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976987,0.00003616984,0.000012159018,0.00003755986,0.00006421669,0.00007998812],"domain_scores_gemma":[0.99966526,0.00007586318,0.000049380888,0.00006611486,0.000045005225,0.000098445395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014382885,0.00033363767,0.00038362166,0.0002388651,0.0008391748,0.0010148953,0.00071256683,0.0008105237,0.010035092],"category_scores_gemma":[0.00089821615,0.0002666947,0.0004658274,0.0004605493,0.00047389654,0.0010089288,0.0011494878,0.00092967105,0.0020758526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005589442,0.00021472067,0.0015461599,0.00032623037,0.000057164096,0.0012668532,0.0008211291,0.05729633,0.05548421,0.7967224,0.017566487,0.06813931],"study_design_scores_gemma":[0.00026064683,0.00029396062,0.0025047895,0.00009952324,0.000059142352,0.0013895129,0.0010569979,0.18593618,0.029268358,0.7095886,0.06946239,0.00007988997],"about_ca_topic_score_codex":0.0009924155,"about_ca_topic_score_gemma":0.0021549095,"teacher_disagreement_score":0.010035092,"about_ca_system_score_codex":0.00047543284,"about_ca_system_score_gemma":0.00041593565,"threshold_uncertainty_score":0.033570766},"labels":[],"label_agreement":null},{"id":"W1732011848","doi":"10.46298/dmtcs.3411","title":"Finding a Strong Stable Set or a Meyniel Obstruction in any Graph","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rogers Communications (Canada); Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Chord (peer-to-peer); Clique; Independent set; Discrete mathematics; Computer science","score_opus":0.03194635860705702,"score_gpt":0.31990689398220307,"score_spread":0.28796053537514604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1732011848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6000346,0.0002748197,0.37821507,0.0018612557,0.00009242895,0.00045229506,0.0010431821,0.001664368,0.01636197],"genre_scores_gemma":[0.7722263,0.00018267657,0.2171512,0.00025282486,0.0000398529,0.00019622983,0.0014945294,0.00026767855,0.008188788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995272,0.00006464211,0.000034582547,0.00015068347,0.00009669084,0.00012622801],"domain_scores_gemma":[0.99889934,0.00054500427,0.00011514102,0.0001744224,0.00009278056,0.0001733113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051526056,0.00066793576,0.00072373764,0.00079205737,0.0014697138,0.0012518163,0.00096462347,0.0010636305,0.00710075],"category_scores_gemma":[0.0030188893,0.00040639058,0.0010993435,0.000664655,0.00103543,0.0033004205,0.002951041,0.0010706766,0.0010654797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033374508,0.00086289033,0.022952823,0.0016897256,0.0003330634,0.00226018,0.0038248212,0.060153887,0.1388747,0.40368667,0.022648416,0.33937547],"study_design_scores_gemma":[0.00039853275,0.001212438,0.009572414,0.00017917015,0.000270837,0.0012905258,0.0021799018,0.21774843,0.07052233,0.64976287,0.046686146,0.00017641742],"about_ca_topic_score_codex":0.0015503383,"about_ca_topic_score_gemma":0.0032938845,"teacher_disagreement_score":0.00710075,"about_ca_system_score_codex":0.00074998016,"about_ca_system_score_gemma":0.0011157299,"threshold_uncertainty_score":0.023754418},"labels":[],"label_agreement":null},{"id":"W1732508261","doi":"10.1002/jgt.20596","title":"Overlap number of graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Bound graph; Matching (statistics); Discrete mathematics; Graph power; Line graph","score_opus":0.029826219507205095,"score_gpt":0.29551436913689244,"score_spread":0.26568814962968734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1732508261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7436688,0.0004914654,0.20816481,0.00079708215,0.00009026746,0.00011405523,0.0010253544,0.0008439855,0.04480412],"genre_scores_gemma":[0.9467067,0.00015221206,0.047031328,0.000090176996,0.000056998637,0.000119305696,0.00084800174,0.00013121926,0.0048639877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846566,0.00027087555,0.000093746,0.00031001613,0.00052028464,0.00033939],"domain_scores_gemma":[0.9966097,0.0016087331,0.00041788068,0.0006266059,0.00037709592,0.00036002617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006760113,0.00044945424,0.00055232807,0.0014155633,0.0011113294,0.002075648,0.00089886336,0.00068373134,0.008572374],"category_scores_gemma":[0.0042799925,0.00040066973,0.0003772414,0.0015760801,0.0013495166,0.0037957935,0.0023234312,0.00077486434,0.00074204244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001943339,0.00023782157,0.008624942,0.00039312348,0.000054783635,0.0005098708,0.0009540041,0.057448175,0.029939234,0.7096241,0.008696975,0.18157364],"study_design_scores_gemma":[0.00012956678,0.00041834402,0.0047161835,0.00010206424,0.00008605439,0.0013501529,0.00078679365,0.20202559,0.036909625,0.7157106,0.037700083,0.00006492227],"about_ca_topic_score_codex":0.00056556344,"about_ca_topic_score_gemma":0.00064336514,"teacher_disagreement_score":0.008572374,"about_ca_system_score_codex":0.0010106431,"about_ca_system_score_gemma":0.0004915827,"threshold_uncertainty_score":0.028677464},"labels":[],"label_agreement":null},{"id":"W1738403920","doi":"10.1007/978-3-540-70918-3_30","title":"An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Combinatorics; Vertex (graph theory); Algorithm; Graph; Computer science; Mathematics; Discrete mathematics","score_opus":0.021008694542040462,"score_gpt":0.3043820339160814,"score_spread":0.2833733393740409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1738403920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10738452,0.0005477435,0.84976876,0.0011292776,0.00026229338,0.00045532684,0.0014126793,0.007650591,0.03138877],"genre_scores_gemma":[0.18444441,0.00027307917,0.7963343,0.00033949036,0.00008686718,0.00033349887,0.002813583,0.0010412005,0.014333557],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986143,0.00016933041,0.00008874153,0.0005198641,0.00034050658,0.00026729805],"domain_scores_gemma":[0.9982778,0.00058943644,0.00011136761,0.0005983434,0.00022063262,0.00020247833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833815,0.0015761595,0.0014874288,0.0013552965,0.0015749593,0.0024813924,0.0041135103,0.0017932439,0.01134997],"category_scores_gemma":[0.0027693256,0.00096141116,0.0010376825,0.0023295847,0.0011607795,0.0058343243,0.0039813546,0.0017836051,0.0030076914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016625862,0.0011647183,0.0014185276,0.0006643932,0.00013819063,0.0001842388,0.00041142234,0.08308613,0.02755332,0.0804502,0.042497125,0.7607691],"study_design_scores_gemma":[0.0009062305,0.00040380773,0.0014851029,0.0001150062,0.00020819748,0.0006572927,0.0004372455,0.7124179,0.023086531,0.23660606,0.023551416,0.0001252251],"about_ca_topic_score_codex":0.0034851595,"about_ca_topic_score_gemma":0.007395313,"teacher_disagreement_score":0.01134997,"about_ca_system_score_codex":0.0021276807,"about_ca_system_score_gemma":0.0036262188,"threshold_uncertainty_score":0.03796947},"labels":[],"label_agreement":null},{"id":"W175918027","doi":"","title":"Embedding graphs without edge accumulation points in tubular surfaces.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Embedding; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Geometry; Computer science; Artificial intelligence","score_opus":0.02975803999944533,"score_gpt":0.3394812905349219,"score_spread":0.30972325053547656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175918027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5341792,0.0012291968,0.33497202,0.0012752584,0.00037536214,0.00008758268,0.0007096272,0.0012523155,0.12591933],"genre_scores_gemma":[0.9057626,0.00075126876,0.051579468,0.00021768182,0.00015130291,0.00005203167,0.0008530296,0.0004238704,0.040208843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963117,0.00007423301,0.000021139062,0.00009229913,0.000105167645,0.00007591864],"domain_scores_gemma":[0.9989242,0.00035309003,0.00018218782,0.00018775449,0.00017298353,0.00017976329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025003176,0.00047327986,0.0005285945,0.0012669801,0.0013481156,0.0018978249,0.00082954566,0.0013552919,0.008385427],"category_scores_gemma":[0.0024757842,0.00053542753,0.0005625198,0.0010414633,0.0015919562,0.0036113588,0.0022046084,0.0015531493,0.0024858946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009946564,0.00003513297,0.00067058014,0.00009155299,0.000014082266,0.0003441439,0.00035837165,0.0039807204,0.0036113402,0.964137,0.004009859,0.022647751],"study_design_scores_gemma":[0.000016017486,0.000031475498,0.00056704687,0.0000345267,0.000018260262,0.0003373827,0.0002967286,0.010940382,0.0023042005,0.97522336,0.010215467,0.000015112815],"about_ca_topic_score_codex":0.0008807863,"about_ca_topic_score_gemma":0.001439485,"teacher_disagreement_score":0.008385427,"about_ca_system_score_codex":0.00054411835,"about_ca_system_score_gemma":0.00026601081,"threshold_uncertainty_score":0.028052032},"labels":[],"label_agreement":null},{"id":"W1759411922","doi":"10.1007/3-540-36136-7_37","title":"Bounded-Degree Independent Sets in Planar Graphs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Independent set; Combinatorics; Bounded function; Planar graph; Degree (music); Maximal independent set; Planar; Discrete mathematics; Mathematics; Graph; Set (abstract data type); Planar straight-line graph; Upper and lower bounds; 1-planar graph; Computer science; Chordal graph; Physics","score_opus":0.038105072769623306,"score_gpt":0.2821378396137072,"score_spread":0.2440327668440839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1759411922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3508909,0.010252528,0.28318757,0.0029332014,0.0005322694,0.00019572725,0.0013265809,0.0006697616,0.35001147],"genre_scores_gemma":[0.8726935,0.007225332,0.060031198,0.0003339292,0.0005045071,0.00028829422,0.0014413131,0.00023250171,0.05724954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996094,0.00006908419,0.00001625815,0.000075317716,0.00017437569,0.000055634406],"domain_scores_gemma":[0.99834955,0.0012274105,0.00008787393,0.00013004722,0.0001038019,0.0001014369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029341393,0.0006302897,0.00086834043,0.0015732746,0.0014135056,0.0023987074,0.0015898765,0.0009672287,0.005074148],"category_scores_gemma":[0.002607666,0.00096469786,0.00076660793,0.003025616,0.0014651283,0.003528044,0.0015722886,0.0028025524,0.00082614657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059421745,0.00005135681,0.00027671902,0.0002211258,0.000018301344,0.00009737765,0.0003460608,0.010394109,0.0018867836,0.9466996,0.0065145856,0.033434488],"study_design_scores_gemma":[0.00001433876,0.000010844138,0.00033242945,0.000024707273,0.000017562905,0.0001340467,0.000081025006,0.007671097,0.0007772469,0.98442405,0.006504647,0.000008105209],"about_ca_topic_score_codex":0.00072683865,"about_ca_topic_score_gemma":0.0010415278,"teacher_disagreement_score":0.005074148,"about_ca_system_score_codex":0.0010562581,"about_ca_system_score_gemma":0.00041338507,"threshold_uncertainty_score":0.016974688},"labels":[],"label_agreement":null},{"id":"W1763401657","doi":"10.1007/3-540-45471-3_21","title":"A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Matroid; Graphic matroid; Matroid partitioning; Combinatorics; Mathematics; Time complexity; Basis (linear algebra); Cycle basis; Discrete mathematics; Matrix (chemical analysis); Matrix multiplication; Oriented matroid; Graph","score_opus":0.012069325774437843,"score_gpt":0.2476371203445412,"score_spread":0.23556779457010335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763401657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16125302,0.00082279067,0.7992956,0.0014911409,0.00017120822,0.0005899672,0.0020032628,0.0056248563,0.028748278],"genre_scores_gemma":[0.23340045,0.00034157874,0.7512355,0.00018985702,0.00006696469,0.00033903532,0.0038938543,0.000691034,0.009841841],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951255,0.000064377724,0.000029183188,0.00017532839,0.00012511408,0.00009343921],"domain_scores_gemma":[0.99900776,0.00046337568,0.00007685662,0.0002341748,0.0001233971,0.00009452606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045376737,0.0012530927,0.0013944886,0.0011915126,0.0009467514,0.0021784056,0.0024207423,0.0013646497,0.010744362],"category_scores_gemma":[0.0021629764,0.0008397028,0.0013366006,0.0022383386,0.0007647692,0.0029094215,0.0019090154,0.0018608778,0.0023541746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010360716,0.00062272843,0.0017565835,0.001136516,0.00017929108,0.00021495321,0.00052064046,0.07329129,0.037835304,0.08221808,0.042786486,0.75840217],"study_design_scores_gemma":[0.0008702305,0.0005193505,0.001655021,0.00011231486,0.00021768798,0.00059572863,0.0006173581,0.58066386,0.020198435,0.3725349,0.0219323,0.000082803155],"about_ca_topic_score_codex":0.0031342024,"about_ca_topic_score_gemma":0.005804029,"teacher_disagreement_score":0.010744362,"about_ca_system_score_codex":0.0016227645,"about_ca_system_score_gemma":0.0016435315,"threshold_uncertainty_score":0.03594345},"labels":[],"label_agreement":null},{"id":"W1764061692","doi":"10.1002/jgt.21882","title":"<i>K</i><sub>4</sub>‐free and ‐free Planar Matching Covered Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Matching (statistics); Subdivision; Graph; Induced subgraph; Factor-critical graph; Conformal map; Line graph; Discrete mathematics; Graph power; Vertex (graph theory); Geometry","score_opus":0.02082237696549377,"score_gpt":0.25973746476043824,"score_spread":0.23891508779494447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764061692","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8326295,0.00034771956,0.108787805,0.00045936098,0.000052192237,0.00010631205,0.0015929504,0.00041064023,0.055613596],"genre_scores_gemma":[0.96155745,0.00017825203,0.026600389,0.0001203774,0.000021027763,0.000059491987,0.0018786237,0.00006514604,0.009519268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996074,0.00003762466,0.000028547847,0.000099863144,0.00010570247,0.0001208849],"domain_scores_gemma":[0.99932766,0.00017272362,0.00015329372,0.00012395009,0.00012327202,0.00009911725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017220025,0.00036024867,0.00038514167,0.0008718179,0.0007915089,0.0011674038,0.0007830235,0.00041255538,0.008001586],"category_scores_gemma":[0.0007836721,0.00032587544,0.0005043494,0.00088580616,0.00072164496,0.0015215897,0.0014436892,0.00054141675,0.00076242245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072022434,0.00020613815,0.013353595,0.00062347495,0.00013949415,0.0012587485,0.0006905811,0.040332086,0.06470325,0.7501072,0.017050393,0.110814914],"study_design_scores_gemma":[0.00012400423,0.00024432383,0.024269419,0.0001253723,0.00029877824,0.002967172,0.0014413793,0.11032759,0.0695308,0.7039514,0.08656419,0.00015562815],"about_ca_topic_score_codex":0.0019392605,"about_ca_topic_score_gemma":0.0021164415,"teacher_disagreement_score":0.008001586,"about_ca_system_score_codex":0.0007385018,"about_ca_system_score_gemma":0.0003621132,"threshold_uncertainty_score":0.026768029},"labels":[],"label_agreement":null},{"id":"W1766429383","doi":"10.37236/5095","title":"Graphs with Induced-Saturation Number Zero","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Saturation (graph theory); Vertex (graph theory); Induced subgraph; Graph; Discrete mathematics","score_opus":0.01403695763189795,"score_gpt":0.2792874026438186,"score_spread":0.2652504450119207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1766429383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61481476,0.00046023476,0.29912183,0.0012804571,0.00012338905,0.00022135479,0.0015368373,0.0015662104,0.08087489],"genre_scores_gemma":[0.92058176,0.00030873562,0.066621065,0.0002680457,0.000056289857,0.00015482672,0.0013641035,0.00016805175,0.010477129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912864,0.00014564903,0.000054946067,0.0002820006,0.00022980994,0.00015911077],"domain_scores_gemma":[0.9949479,0.0021582753,0.0005041691,0.00096081727,0.00090270845,0.0005261128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000520061,0.0005818301,0.00046569333,0.0009851416,0.0011627837,0.0012686937,0.0010175612,0.00059581717,0.0060713096],"category_scores_gemma":[0.002921928,0.00045204494,0.0008237876,0.0010540356,0.002004141,0.0035494484,0.0020902895,0.0010566143,0.0006972011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045222742,0.00016771877,0.0078953365,0.00061465957,0.00010380252,0.0011109035,0.001822216,0.02923926,0.03826712,0.85422295,0.0058619017,0.06024198],"study_design_scores_gemma":[0.000071917944,0.0001867314,0.0036991513,0.00009432364,0.00009973217,0.0013897314,0.00095372344,0.08061356,0.030442866,0.8464573,0.03592555,0.000065336935],"about_ca_topic_score_codex":0.001546122,"about_ca_topic_score_gemma":0.0024751942,"teacher_disagreement_score":0.0060713096,"about_ca_system_score_codex":0.0015054975,"about_ca_system_score_gemma":0.0010756877,"threshold_uncertainty_score":0.020310521},"labels":[],"label_agreement":null},{"id":"W176713422","doi":"","title":"The Inverse Domination Number of a Graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inverse; Graph; Combinatorics; Geometry","score_opus":0.012533047829698121,"score_gpt":0.2847599724812493,"score_spread":0.2722269246515512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176713422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4777745,0.0025745304,0.09392923,0.004018691,0.0009064901,0.000089740206,0.0039022004,0.00076940114,0.41603518],"genre_scores_gemma":[0.95553386,0.001235782,0.01643878,0.0003250942,0.0004477734,0.00010359744,0.0010304146,0.00016918326,0.024715412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914765,0.00017448288,0.000044954857,0.00022633813,0.00023014242,0.00017651387],"domain_scores_gemma":[0.99546176,0.0028567452,0.00042925248,0.00036136273,0.00041853302,0.00047239938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006815669,0.00047678896,0.0005759065,0.003581371,0.0013717193,0.003083018,0.00083581713,0.00087965355,0.013277536],"category_scores_gemma":[0.005532858,0.00025603865,0.00040492497,0.0017646572,0.0021492182,0.004723758,0.0011532431,0.001768856,0.0016175675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023636859,0.000050590876,0.0024243924,0.0002048362,0.00003768508,0.00014372414,0.00041581815,0.0027308264,0.0059199976,0.9321733,0.012474652,0.043187857],"study_design_scores_gemma":[0.000029457955,0.00004678607,0.0027554838,0.00007359794,0.000050024624,0.0008897801,0.00026249277,0.010076696,0.0055380166,0.94616723,0.03406886,0.000041416813],"about_ca_topic_score_codex":0.0007385503,"about_ca_topic_score_gemma":0.00095905364,"teacher_disagreement_score":0.013277536,"about_ca_system_score_codex":0.0012244951,"about_ca_system_score_gemma":0.0005903058,"threshold_uncertainty_score":0.04441774},"labels":[],"label_agreement":null},{"id":"W1768636550","doi":"10.1007/978-3-319-13524-3_21","title":"Reconfiguration over Tree Decompositions","year":2014,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Control reconfiguration; Vertex (graph theory); Parameterized complexity; Combinatorics; Bounded function; Feedback vertex set; Mathematics; Discrete mathematics; Cardinality (data modeling); Graph; Dominating set; Pathwidth; Computer science; Line graph","score_opus":0.020282838400060097,"score_gpt":0.31319455821428005,"score_spread":0.29291171981421993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768636550","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3167509,0.0014982825,0.59640247,0.0010920351,0.0005061039,0.000262145,0.0013533112,0.0060083815,0.07612635],"genre_scores_gemma":[0.8250901,0.0008221197,0.15338922,0.0002882317,0.00017220688,0.00012759356,0.0018538481,0.001314206,0.01694242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993475,0.00012593214,0.00004293297,0.0001703974,0.00013029398,0.00018298031],"domain_scores_gemma":[0.9984763,0.0004509997,0.00014965991,0.00052374165,0.00017076822,0.00022852361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004915452,0.0005697349,0.00071392395,0.0010787335,0.00072321395,0.0018503042,0.00079664454,0.0006659711,0.012853701],"category_scores_gemma":[0.0022911646,0.0004839053,0.0006657632,0.0015727428,0.0006881472,0.002750655,0.0019510457,0.0013911217,0.0017699172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012060042,0.00027029932,0.0017363428,0.0007335561,0.00015179977,0.0012646592,0.0009561811,0.11097065,0.061939266,0.41674837,0.03161482,0.3724079],"study_design_scores_gemma":[0.000097877135,0.00014377116,0.0011184366,0.00010308665,0.00009172905,0.00060295494,0.00046762638,0.24186338,0.01537443,0.7028801,0.03721026,0.000046452344],"about_ca_topic_score_codex":0.00087950693,"about_ca_topic_score_gemma":0.0011236035,"teacher_disagreement_score":0.012853701,"about_ca_system_score_codex":0.00067260885,"about_ca_system_score_gemma":0.00034734778,"threshold_uncertainty_score":0.042999923},"labels":[],"label_agreement":null},{"id":"W1774294075","doi":"10.46298/dmtcs.3429","title":"Directed One-Trees","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Directed graph; Property (philosophy); Class (philosophy); Tree (set theory); Measure (data warehouse); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.020004681116525647,"score_gpt":0.29856820624155356,"score_spread":0.2785635251250279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1774294075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13757353,0.0022171582,0.7881178,0.0009971091,0.00028184496,0.00015218525,0.0016910989,0.0010643394,0.06790482],"genre_scores_gemma":[0.6989494,0.0017792179,0.2734954,0.0010407254,0.00025882208,0.00024168809,0.0029450743,0.00046023563,0.020829462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993198,0.000082011116,0.00003570184,0.00028981979,0.00016182732,0.00011091512],"domain_scores_gemma":[0.9977235,0.00093905476,0.0003055777,0.00037708413,0.0003473789,0.00030735676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036673286,0.0004972339,0.00061944267,0.0012598803,0.0010698598,0.0017821684,0.0012210138,0.00070824113,0.007543246],"category_scores_gemma":[0.0029374368,0.0003054092,0.00056684733,0.0011338687,0.0008537735,0.0039838385,0.001722673,0.0015453509,0.001563161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001249723,0.00007511352,0.0017187404,0.00035258074,0.000032655083,0.00019379581,0.00031995375,0.0077409507,0.009517311,0.8400709,0.007737556,0.13211541],"study_design_scores_gemma":[0.000014837092,0.000041727057,0.0010789342,0.000077443336,0.000032958775,0.00077084714,0.00018346428,0.041338008,0.0065764184,0.9106453,0.03921235,0.000027745018],"about_ca_topic_score_codex":0.00061215565,"about_ca_topic_score_gemma":0.0009904702,"teacher_disagreement_score":0.007543246,"about_ca_system_score_codex":0.00061810925,"about_ca_system_score_gemma":0.00039125848,"threshold_uncertainty_score":0.02523464},"labels":[],"label_agreement":null},{"id":"W1784462007","doi":"10.1016/j.tcs.2015.09.009","title":"Games on interval and permutation graph representations","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Combinatorics; Interval graph; Graph; Mathematics; Permutation graph; Discrete mathematics; Combinatorial game theory; PSPACE; Permutation (music); Time complexity; Representation (politics); Computer science; Theoretical computer science; Pathwidth; Computational complexity theory; Line graph; Algorithm; Sequential game; Game theory; Mathematical economics","score_opus":0.034296970045577184,"score_gpt":0.3413963523780636,"score_spread":0.3070993823324864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1784462007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2301994,0.00061554566,0.5888323,0.0039150314,0.00045283764,0.00027903134,0.0008652587,0.00043959563,0.17440094],"genre_scores_gemma":[0.8723337,0.000670989,0.08604612,0.000501041,0.00030770365,0.00039561288,0.0007037472,0.00016785493,0.038873196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832386,0.00074680237,0.00008937282,0.00024001401,0.00036016354,0.00023986574],"domain_scores_gemma":[0.99644476,0.0020489576,0.0003370793,0.00043711593,0.0002615321,0.00047053338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014074101,0.00077382836,0.00097596913,0.0012253352,0.0013089883,0.004574557,0.0021469072,0.0022036184,0.015824888],"category_scores_gemma":[0.007582184,0.00047591372,0.0010479005,0.0017564746,0.0021907745,0.009075208,0.002118387,0.0028560478,0.0009597812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003893292,0.00003137111,0.00005268277,0.000019373036,0.0000049339487,0.000027826705,0.00009571513,0.0030484155,0.00018450418,0.99084026,0.0013087206,0.0043471023],"study_design_scores_gemma":[0.000019785188,0.000015351721,0.00004727117,0.0000079737465,0.000005502171,0.000029647626,0.000057118585,0.017675987,0.000070270326,0.98055446,0.0015098286,0.0000067958945],"about_ca_topic_score_codex":0.0016502937,"about_ca_topic_score_gemma":0.0014086572,"teacher_disagreement_score":0.015824888,"about_ca_system_score_codex":0.0015090563,"about_ca_system_score_gemma":0.0008788192,"threshold_uncertainty_score":0.052939534},"labels":[],"label_agreement":null},{"id":"W1786052730","doi":"10.46298/dmtcs.3419","title":"Fast separation in a graph with an excluded minor","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Backslash; Combinatorics; Mathematics; Vertex (graph theory); Order (exchange); Graph; Discrete mathematics","score_opus":0.01874154929046081,"score_gpt":0.3162033184436024,"score_spread":0.2974617691531416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1786052730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37126362,0.0005651825,0.60968363,0.001565019,0.00012561501,0.00040012383,0.001484974,0.0065187956,0.008393069],"genre_scores_gemma":[0.4606038,0.00029847526,0.5210889,0.00045758983,0.000085710875,0.00026324316,0.0040114764,0.0009086931,0.012282085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999121,0.0001242614,0.00005647041,0.0003097047,0.00018009439,0.00020844943],"domain_scores_gemma":[0.9974916,0.0010791508,0.0002797507,0.00061295775,0.00023176713,0.00030478643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062916527,0.0014171482,0.0011997621,0.0010328783,0.0016460159,0.0015308135,0.0018186605,0.0011997541,0.005450875],"category_scores_gemma":[0.0032337676,0.0009246749,0.0015043075,0.0013996504,0.0012320692,0.0043261955,0.0039111753,0.0019730502,0.0022448397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007461011,0.0012967396,0.006837225,0.001907531,0.00037312845,0.0016790517,0.0032403914,0.16032055,0.19808476,0.16383094,0.04349008,0.4114786],"study_design_scores_gemma":[0.0006869351,0.00083962537,0.0018280974,0.000091106835,0.00021684176,0.0011310036,0.0006410708,0.5354088,0.06855833,0.3656575,0.024821086,0.00011967262],"about_ca_topic_score_codex":0.003360412,"about_ca_topic_score_gemma":0.0055516833,"teacher_disagreement_score":0.005450875,"about_ca_system_score_codex":0.0012909416,"about_ca_system_score_gemma":0.0014892948,"threshold_uncertainty_score":0.018234968},"labels":[],"label_agreement":null},{"id":"W1791050365","doi":"10.2168/lmcs-11(4:18)2015","title":"A finer reduction of constraint problems to digraphs","year":2015,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Grantová Agentura České Republiky; Grantová Agentura, Univerzita Karlova","keywords":"Digraph; Constraint satisfaction problem; Nondeterministic algorithm; Combinatorics; Mathematics; Complexity of constraint satisfaction; Discrete mathematics; Conjecture; Constraint (computer-aided design); Algebraic number; Local consistency","score_opus":0.16129164546768482,"score_gpt":0.4418393829298686,"score_spread":0.28054773746218375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791050365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08197344,0.0008979085,0.8431943,0.004475545,0.00027929718,0.00022797615,0.001126936,0.00072969694,0.06709495],"genre_scores_gemma":[0.65364206,0.0012215838,0.30679798,0.0017412874,0.00057763053,0.00034079357,0.0019420324,0.00041017524,0.0333265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798644,0.00055402535,0.0001296253,0.0006201121,0.00046707565,0.0002426931],"domain_scores_gemma":[0.99713874,0.0017132168,0.00015234215,0.00060088397,0.00020130786,0.00019342003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010857313,0.00050326,0.0008167276,0.0011121597,0.0012019726,0.0038360024,0.001508894,0.0010175505,0.012313393],"category_scores_gemma":[0.0049623204,0.00048678363,0.0017304568,0.0019566035,0.002367305,0.006022274,0.0040970873,0.0052217008,0.00093511574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016498296,0.000043077493,0.00010759616,0.00005484835,0.000009238815,0.00006008789,0.00013948938,0.0047486853,0.000704161,0.9830905,0.001370612,0.009655093],"study_design_scores_gemma":[0.000020788233,0.000012732909,0.00012321619,0.000013754722,0.000007458605,0.000055526663,0.00005008548,0.019013591,0.00046730388,0.97168005,0.008547074,0.000008492695],"about_ca_topic_score_codex":0.0030019188,"about_ca_topic_score_gemma":0.0034158567,"teacher_disagreement_score":0.012313393,"about_ca_system_score_codex":0.001978209,"about_ca_system_score_gemma":0.0011987602,"threshold_uncertainty_score":0.041192412},"labels":[],"label_agreement":null},{"id":"W1791216447","doi":"10.1016/j.ejc.2015.08.001","title":"Fast recoloring of sparse graphs","year":2015,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Graph coloring; Mathematics; Edge coloring; List coloring; Complete coloring; Fractional coloring; Discrete mathematics; Conjecture; Graph; Planar graph; Greedy coloring; Brooks' theorem; Bounded function; Vertex (graph theory); Graph power; Line graph","score_opus":0.05956010983609713,"score_gpt":0.2941333767780692,"score_spread":0.2345732669419721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791216447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36425593,0.00096966425,0.6034968,0.0010652344,0.00041130217,0.00028272806,0.0010983921,0.007624527,0.020795414],"genre_scores_gemma":[0.570955,0.00051017106,0.40895373,0.00028447973,0.00011481323,0.00014938439,0.0017377464,0.0013676676,0.01592703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993262,0.00018560298,0.000027218006,0.0001373502,0.00016976621,0.00015392105],"domain_scores_gemma":[0.996317,0.00141371,0.00025739975,0.0014164643,0.0003745419,0.0002208927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006274954,0.0010386504,0.0013440601,0.0013995543,0.00083164306,0.0011756412,0.0015974925,0.00078183645,0.009987331],"category_scores_gemma":[0.004444525,0.0005470471,0.0008564705,0.0014939636,0.00074690464,0.0022683092,0.0031984446,0.0011619959,0.0016758036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001965035,0.00035319812,0.0028003457,0.001061711,0.00014842549,0.0004832448,0.00089001586,0.09795285,0.075910494,0.07190995,0.037595518,0.70892924],"study_design_scores_gemma":[0.00036489137,0.00038244977,0.0017571267,0.000119980745,0.0001292066,0.00059057213,0.0005539801,0.6180506,0.051708523,0.2998887,0.026387664,0.00006634844],"about_ca_topic_score_codex":0.0019398504,"about_ca_topic_score_gemma":0.0050374875,"teacher_disagreement_score":0.009987331,"about_ca_system_score_codex":0.0007659975,"about_ca_system_score_gemma":0.00060832547,"threshold_uncertainty_score":0.033410907},"labels":[],"label_agreement":null},{"id":"W1791945965","doi":"10.3390/a11020020","title":"Vertex Cover Reconfiguration and Beyond","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Vertex cover; Combinatorics; Parameterized complexity; Bipartite graph; Vertex (graph theory); Control reconfiguration; Feedback vertex set; Mathematics; Edge cover; Bounded function; Discrete mathematics; Graph; Computer science","score_opus":0.017390398062897928,"score_gpt":0.2864005603685251,"score_spread":0.2690101623056272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791945965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32337713,0.008026164,0.5449504,0.00912947,0.0008006516,0.0005853122,0.002624072,0.003764612,0.106742196],"genre_scores_gemma":[0.8921016,0.0016026594,0.08941452,0.0010526817,0.00035822424,0.00020614134,0.0019783012,0.00035615344,0.012929709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979518,0.00036912612,0.00007178248,0.00082929747,0.0003441185,0.00043389533],"domain_scores_gemma":[0.99633235,0.00202168,0.00038940407,0.00087825564,0.00014767221,0.00023062892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009416671,0.0008220271,0.0010888485,0.0005786664,0.001290488,0.00293191,0.0022706739,0.001864895,0.008710297],"category_scores_gemma":[0.0052496474,0.0004869825,0.001055082,0.0014246806,0.0021030626,0.0059796614,0.0021811437,0.002301989,0.0010415923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001135676,0.00032855783,0.0020265223,0.0010008563,0.00012710571,0.0008959228,0.00058944325,0.25787127,0.016274743,0.46317676,0.029111318,0.22746184],"study_design_scores_gemma":[0.00010488444,0.00022007313,0.0010314011,0.00012425012,0.000059601527,0.0008341619,0.00028747984,0.31943113,0.010098314,0.63469476,0.03306027,0.00005369084],"about_ca_topic_score_codex":0.0020388723,"about_ca_topic_score_gemma":0.0017411496,"teacher_disagreement_score":0.008710297,"about_ca_system_score_codex":0.002075798,"about_ca_system_score_gemma":0.0010458585,"threshold_uncertainty_score":0.029138863},"labels":[],"label_agreement":null},{"id":"W179577048","doi":"10.1007/0-387-22444-0_4","title":"Algorithmic Aspects of Tree Width","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":283,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Divide and conquer algorithms; Computer science; Graph; Graph theory; Theoretical computer science; Tree (set theory); Politics; Algorithm; Political science; Mathematics; Combinatorics","score_opus":0.024976958168576105,"score_gpt":0.27036624599583775,"score_spread":0.24538928782726166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179577048","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051910434,0.01159526,0.42659426,0.0056996224,0.00079391076,0.00008710539,0.0005415253,0.00060145324,0.5021764],"genre_scores_gemma":[0.55453295,0.014668264,0.26671025,0.0013518314,0.0026141296,0.00033514205,0.0011751984,0.0011491508,0.1574631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936825,0.00010762406,0.000030996882,0.0001522753,0.00026137326,0.00007951367],"domain_scores_gemma":[0.998159,0.001134616,0.000106689564,0.00029141793,0.00021738592,0.00009086458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069214415,0.00062015094,0.00069430843,0.0017601555,0.0012503607,0.004308336,0.0019306072,0.0010549482,0.011847112],"category_scores_gemma":[0.004660389,0.0008867495,0.000733633,0.004504352,0.0031778913,0.010217992,0.0015872031,0.004429692,0.002097048],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012737056,0.000012843615,0.0001272236,0.00004964381,0.0000037942739,0.000013793439,0.00012353816,0.001428622,0.00032438335,0.97188336,0.004279805,0.021740267],"study_design_scores_gemma":[0.0000030009187,0.000003338107,0.00009940361,0.000015391195,0.0000057063226,0.00003894294,0.000038612106,0.0030845387,0.00023046946,0.9872012,0.00927578,0.0000036122813],"about_ca_topic_score_codex":0.0011654433,"about_ca_topic_score_gemma":0.0015849642,"teacher_disagreement_score":0.011847112,"about_ca_system_score_codex":0.0016115408,"about_ca_system_score_gemma":0.0007617518,"threshold_uncertainty_score":0.0396325},"labels":[],"label_agreement":null},{"id":"W1799977443","doi":"10.48550/arxiv.1110.4896","title":"Strengthened Brooks Theorem for digraphs of girth three","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Chromatic scale; Corollary; Degree (music); Graph; Vertex (graph theory); Discrete mathematics; Physics","score_opus":0.10628695600934576,"score_gpt":0.21712545748954373,"score_spread":0.11083850148019797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1799977443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4167187,0.0019121318,0.45722696,0.0027588394,0.0002909543,0.00013888684,0.0016422176,0.000979114,0.11833223],"genre_scores_gemma":[0.93391556,0.00094843697,0.046130747,0.00066581205,0.00016611713,0.0001840156,0.0006977258,0.00015082817,0.01714078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994948,0.00007027965,0.000021022395,0.00015666061,0.00013549713,0.00012176737],"domain_scores_gemma":[0.99731785,0.0015020272,0.00020872852,0.00039370527,0.00029013483,0.0002875066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006229607,0.00051845296,0.0004942587,0.0014889743,0.0014406322,0.0015602487,0.0011628362,0.00052261323,0.009045112],"category_scores_gemma":[0.0045607267,0.00033811718,0.0008744056,0.0011532772,0.0017207315,0.0027198368,0.0018072039,0.0015954198,0.0008280452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076797965,0.000016643482,0.0014135422,0.0001004644,0.00002154969,0.00010426261,0.00028295067,0.009954745,0.0036700002,0.96323496,0.0038792514,0.01724476],"study_design_scores_gemma":[0.000024140343,0.000039223498,0.0010827369,0.000029233952,0.000024241066,0.0002054986,0.00010235853,0.02985822,0.002255319,0.9526301,0.013724283,0.000024640683],"about_ca_topic_score_codex":0.004774128,"about_ca_topic_score_gemma":0.005351356,"teacher_disagreement_score":0.009045112,"about_ca_system_score_codex":0.0023232575,"about_ca_system_score_gemma":0.00093827647,"threshold_uncertainty_score":0.030258954},"labels":[],"label_agreement":null},{"id":"W1801749230","doi":"10.37236/2497","title":"Recognition and Characterization of Chronological Interval Digraphs","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Victoria","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Interval (graph theory); Characterization (materials science); Interval graph; Vertex (graph theory); Discrete mathematics; Time complexity; Graph; Class (philosophy); Pathwidth; Line graph; Computer science; Artificial intelligence","score_opus":0.01725302464268015,"score_gpt":0.24430010431113044,"score_spread":0.22704707966845028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801749230","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2451691,0.0005402813,0.7378597,0.0002225879,0.00008064029,0.00014449332,0.0015008393,0.0010242354,0.013458058],"genre_scores_gemma":[0.75095457,0.00041752667,0.24166334,0.00012319897,0.00006267443,0.00014259256,0.0024625207,0.000094140676,0.0040793386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996215,0.000046944784,0.00003084983,0.00016054802,0.00009176217,0.00004831677],"domain_scores_gemma":[0.99870706,0.0004271031,0.0002961417,0.0002771327,0.00018361918,0.00010904921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019097826,0.00024899121,0.00020779828,0.0009286432,0.00041568434,0.0010479066,0.0006037347,0.00033736136,0.0025731714],"category_scores_gemma":[0.0019049648,0.00023103919,0.0003407321,0.0010317031,0.0005174268,0.0013790894,0.00045695773,0.0007038615,0.00040706698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033323176,0.00021466026,0.010851017,0.0005247601,0.00004627233,0.0006845833,0.0008305676,0.041769195,0.06491441,0.6204632,0.0063621937,0.25300592],"study_design_scores_gemma":[0.00007178193,0.00022377787,0.008010943,0.00011972507,0.00007476272,0.002233387,0.000685477,0.31828448,0.051027488,0.55677766,0.06238363,0.00010688053],"about_ca_topic_score_codex":0.0011055756,"about_ca_topic_score_gemma":0.0016696992,"teacher_disagreement_score":0.0025731714,"about_ca_system_score_codex":0.00052394246,"about_ca_system_score_gemma":0.00046834975,"threshold_uncertainty_score":0.008608103},"labels":[],"label_agreement":null},{"id":"W1803579481","doi":"","title":"Forced Orientation of Graphs","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Forcing (mathematics); Matroid; Combinatorics; Orientation (vector space); Graph; Cardinality (data modeling); Set (abstract data type); Existential quantification; Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.047339521230320085,"score_gpt":0.30143359753334603,"score_spread":0.25409407630302594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803579481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3849957,0.001987972,0.53781986,0.00081345515,0.00036077478,0.00015891471,0.001040885,0.00043754096,0.07238496],"genre_scores_gemma":[0.8743401,0.0007639832,0.11607461,0.00029290142,0.0002913855,0.00016053501,0.0007226301,0.00010748843,0.0072463416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857104,0.00025665984,0.00012549298,0.00044081852,0.00037611582,0.00022988855],"domain_scores_gemma":[0.9978276,0.000652714,0.000408568,0.0004816946,0.00036728417,0.00026203468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084128603,0.00047505123,0.00046291368,0.0015614927,0.0010841272,0.0022051267,0.00066396117,0.00065044226,0.0025736536],"category_scores_gemma":[0.0029073972,0.0003412295,0.00076965225,0.0011487621,0.002647379,0.0036354116,0.0019249208,0.0012199177,0.0003807075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004621504,0.000026136035,0.0010505927,0.00005750512,0.000009855507,0.00008861739,0.00035303898,0.0029153158,0.0043520513,0.9692879,0.0011046575,0.020708192],"study_design_scores_gemma":[0.000017248778,0.00008750493,0.0013635944,0.000037247733,0.000014913728,0.0007245422,0.00021457823,0.012845739,0.004561504,0.9569018,0.023200668,0.000030637806],"about_ca_topic_score_codex":0.00063588505,"about_ca_topic_score_gemma":0.0006914209,"teacher_disagreement_score":0.0025736536,"about_ca_system_score_codex":0.0010438841,"about_ca_system_score_gemma":0.00044799264,"threshold_uncertainty_score":0.0086096525},"labels":[],"label_agreement":null},{"id":"W180549117","doi":"","title":"Maximum number of 3-paths in a graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.01570994867429192,"score_gpt":0.2926897269549101,"score_spread":0.27697977828061815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180549117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6745445,0.0033467049,0.14478838,0.009575427,0.0005662479,0.00031260774,0.019643087,0.0019990276,0.145224],"genre_scores_gemma":[0.81847703,0.002081976,0.1411552,0.0008773261,0.00025263886,0.00036529033,0.0071095144,0.0004601288,0.029220905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989015,0.00026509108,0.00008665042,0.00028967194,0.00020552083,0.00025148105],"domain_scores_gemma":[0.9905143,0.005629779,0.0009387005,0.00078860525,0.00081591035,0.0013126391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009382363,0.0009009972,0.0008435289,0.0017397626,0.0027085738,0.0030301893,0.0016258113,0.0021735737,0.022081954],"category_scores_gemma":[0.007574889,0.0006227452,0.0010989137,0.0015516314,0.0015380145,0.0063159326,0.0020135937,0.0017121744,0.003583681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030826076,0.0005505085,0.014786539,0.0032581887,0.00052829465,0.0015396915,0.0018060061,0.022931866,0.056461398,0.676735,0.049992185,0.1683277],"study_design_scores_gemma":[0.00019737812,0.00027078015,0.005481641,0.0003413341,0.00028794145,0.002661321,0.0008907722,0.020313054,0.017303787,0.90172267,0.050451696,0.00007763658],"about_ca_topic_score_codex":0.0007389244,"about_ca_topic_score_gemma":0.0019302965,"teacher_disagreement_score":0.022081954,"about_ca_system_score_codex":0.0009884773,"about_ca_system_score_gemma":0.0010116262,"threshold_uncertainty_score":0.073871434},"labels":[],"label_agreement":null},{"id":"W1813313303","doi":"10.1137/100793529","title":"A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest path problem; Combinatorics; Mathematics; Lexicographical order; Discrete mathematics; Time complexity; Induced path; Hamiltonian path; Graph; Shortest path problem","score_opus":0.037621190887750726,"score_gpt":0.32785387620906364,"score_spread":0.2902326853213129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813313303","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033478193,0.000573075,0.9370495,0.0014173988,0.0001318478,0.0005030171,0.00089225534,0.0066586747,0.019295922],"genre_scores_gemma":[0.20952803,0.00045467354,0.7742388,0.0003823388,0.00013358163,0.0005079497,0.0032984838,0.0009484551,0.010507702],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986203,0.00017319711,0.00006962575,0.00058480963,0.00025573134,0.00029639876],"domain_scores_gemma":[0.99834406,0.00092542445,0.00012667614,0.00035833754,0.00016141435,0.00008411998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056222716,0.0014701203,0.0013459239,0.0011972944,0.0012203186,0.0017285831,0.0024084614,0.0018134734,0.015746042],"category_scores_gemma":[0.0037152644,0.0006251137,0.0015378827,0.002639159,0.00096957694,0.00408162,0.0025967825,0.0026636766,0.003707059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006067408,0.0006807811,0.0015006401,0.00097603264,0.00014583614,0.00032400122,0.0007199144,0.13048248,0.01783871,0.15384072,0.061215676,0.63166845],"study_design_scores_gemma":[0.00036654464,0.0002448063,0.00068859,0.00006800418,0.00008922287,0.0004794775,0.00029889398,0.6788419,0.008714265,0.27911663,0.031030413,0.00006133772],"about_ca_topic_score_codex":0.007254195,"about_ca_topic_score_gemma":0.008621378,"teacher_disagreement_score":0.015746042,"about_ca_system_score_codex":0.002436363,"about_ca_system_score_gemma":0.0027133604,"threshold_uncertainty_score":0.052675724},"labels":[],"label_agreement":null},{"id":"W1816145465","doi":"10.1007/978-3-662-44777-2_46","title":"Ordering without Forbidden Patterns","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Graph; Discrete mathematics","score_opus":0.022712947709002854,"score_gpt":0.2848081149853978,"score_spread":0.262095167276395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1816145465","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039149076,0.0014794029,0.15790537,0.001941417,0.0013964358,0.00015545115,0.002129703,0.0008851708,0.794958],"genre_scores_gemma":[0.3314794,0.0034111342,0.12639274,0.0013015791,0.00086781126,0.00026490635,0.0061720028,0.0014922614,0.5286182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994735,0.00007425826,0.000034416713,0.00014058319,0.00018218199,0.00009502559],"domain_scores_gemma":[0.99919707,0.00023537256,0.000058768892,0.00024807366,0.00017737632,0.000083386876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028531958,0.00074147334,0.0006232933,0.0014574579,0.0018422429,0.0022374187,0.0007958289,0.0006445441,0.028092736],"category_scores_gemma":[0.0013704187,0.0006517013,0.00061375526,0.0023347393,0.0013563385,0.0037373675,0.001360492,0.0026169664,0.009743486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007630351,0.0000508162,0.00015155645,0.00014608745,0.000010203105,0.00014907565,0.00023947183,0.00063857384,0.0025142212,0.9068322,0.023393016,0.06579847],"study_design_scores_gemma":[0.000009283381,0.000013252355,0.00009446806,0.00002794831,0.000008210074,0.00019159223,0.000059246755,0.00078309677,0.0015082628,0.9366608,0.06063469,0.0000090396825],"about_ca_topic_score_codex":0.00087878865,"about_ca_topic_score_gemma":0.0015215534,"teacher_disagreement_score":0.028092736,"about_ca_system_score_codex":0.0007696801,"about_ca_system_score_gemma":0.0008965928,"threshold_uncertainty_score":0.0939796},"labels":[],"label_agreement":null},{"id":"W182912702","doi":"","title":"Several definitions of matroids.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Combinatorics","score_opus":0.025569289347559657,"score_gpt":0.2771785389918423,"score_spread":0.25160924964428266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182912702","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017841322,0.030214576,0.4565982,0.01571043,0.004157284,0.00024885382,0.0024651266,0.00090094935,0.47186327],"genre_scores_gemma":[0.3212648,0.033235367,0.49576074,0.014004091,0.0062059686,0.0013039872,0.0045486437,0.0011014834,0.122574896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997726,0.0007106363,0.00020537239,0.0005420696,0.0005915388,0.0002243766],"domain_scores_gemma":[0.99742174,0.0010427951,0.00032323116,0.00038830948,0.0005218614,0.00030217285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018607546,0.0013341607,0.0008257759,0.0037370976,0.0024160324,0.004719975,0.0022176353,0.0017441547,0.019871006],"category_scores_gemma":[0.004368544,0.00069194235,0.0014622646,0.00579247,0.003666583,0.009956526,0.0033959732,0.005890011,0.0055032135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108151835,0.000024720366,0.00013500433,0.00010636026,0.000009904525,0.00006336306,0.00023323363,0.00016313232,0.00037668092,0.97643673,0.011699173,0.01074089],"study_design_scores_gemma":[0.000009191312,0.000023759894,0.00037036376,0.00011571617,0.000017150078,0.000646462,0.00025510526,0.0009495275,0.00063446764,0.80824226,0.1887054,0.00003056405],"about_ca_topic_score_codex":0.00084827066,"about_ca_topic_score_gemma":0.0015047401,"teacher_disagreement_score":0.019871006,"about_ca_system_score_codex":0.0020833772,"about_ca_system_score_gemma":0.00068310194,"threshold_uncertainty_score":0.06647509},"labels":[],"label_agreement":null},{"id":"W1829289780","doi":"10.1016/j.tcs.2016.05.031","title":"A 13k-kernel for planar feedback vertex set via region decomposition","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Narodowe Centrum Nauki; Agence Nationale de la Recherche","keywords":"Vertex (graph theory); Kernel (algebra); Mathematics; Set (abstract data type); Planar; Feedback vertex set; Algorithm; Combinatorics; Computer science; Graph","score_opus":0.021215364685179622,"score_gpt":0.3082908469589348,"score_spread":0.28707548227375523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829289780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1559764,0.0002557904,0.8140901,0.0004472316,0.00012801423,0.00014477002,0.0006556939,0.0010936181,0.02720845],"genre_scores_gemma":[0.79319763,0.00031081098,0.1773018,0.0002524072,0.00011124875,0.00025049693,0.0007919787,0.0005392832,0.027244326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993901,0.000092439564,0.000024965406,0.00015292743,0.00021045719,0.00012898725],"domain_scores_gemma":[0.9990513,0.0002529964,0.000109434404,0.0001770228,0.00020416513,0.00020508505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045963874,0.0005776379,0.0010785701,0.00088404136,0.0008811531,0.0015959227,0.0015402472,0.0009505389,0.006800053],"category_scores_gemma":[0.0023857923,0.0003851657,0.00086318044,0.00069294905,0.0012174654,0.0019074804,0.0028288336,0.0018689896,0.0017919085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002724665,0.00012878733,0.0004301997,0.00018557263,0.000037408936,0.00014229161,0.00034778795,0.034664147,0.010182195,0.90396404,0.008106724,0.041538432],"study_design_scores_gemma":[0.000043373646,0.000070103226,0.00034992167,0.000025302184,0.000022333825,0.00017280073,0.00010826904,0.2195006,0.002750947,0.7711468,0.0057700113,0.000039475886],"about_ca_topic_score_codex":0.0016259584,"about_ca_topic_score_gemma":0.0010936231,"teacher_disagreement_score":0.006800053,"about_ca_system_score_codex":0.0011581122,"about_ca_system_score_gemma":0.000886594,"threshold_uncertainty_score":0.02274847},"labels":[],"label_agreement":null},{"id":"W1832761474","doi":"10.1007/978-3-540-78773-0_16","title":"Minimum Cost Homomorphisms to Reflexive Digraphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Mathematics; Partition (number theory); Discrete mathematics; Graph homomorphism; Graph; Line graph; Voltage graph","score_opus":0.0334414931792028,"score_gpt":0.3030028647787649,"score_spread":0.2695613715995621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832761474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21796207,0.001414835,0.6886123,0.0012940317,0.0003866219,0.0002401648,0.00076026836,0.0017133224,0.08761642],"genre_scores_gemma":[0.75038683,0.0014299306,0.20322913,0.00033803505,0.0002813235,0.00029774304,0.0007169399,0.00061031117,0.04270984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938834,0.000155031,0.000038021048,0.00014832687,0.00017716597,0.000093103656],"domain_scores_gemma":[0.99758494,0.0013558349,0.00013416226,0.00043249913,0.00022995894,0.00026257028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005516544,0.0005869757,0.0008210564,0.0011689556,0.0006969592,0.0020198566,0.0015503118,0.0008201771,0.007564418],"category_scores_gemma":[0.0034478172,0.0006661031,0.0007895134,0.001353276,0.0010021047,0.0039684135,0.0016205405,0.0025977844,0.00096629525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010575176,0.000091526366,0.00019088453,0.00027866263,0.000025258722,0.0000743914,0.0002992726,0.0097773345,0.0049695917,0.91256464,0.0041652303,0.06745758],"study_design_scores_gemma":[0.000033329445,0.000053443368,0.00018359993,0.000031748204,0.000025421465,0.0001387853,0.000090052425,0.017352656,0.0030793215,0.9708553,0.008142187,0.000014193613],"about_ca_topic_score_codex":0.00039370015,"about_ca_topic_score_gemma":0.0007646883,"teacher_disagreement_score":0.007564418,"about_ca_system_score_codex":0.0013066404,"about_ca_system_score_gemma":0.00053283107,"threshold_uncertainty_score":0.02530551},"labels":[],"label_agreement":null},{"id":"W183387654","doi":"","title":"New Families of Sequential Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018161506262625228,"score_gpt":0.2779904438686136,"score_spread":0.25982893760598835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183387654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17971684,0.002756729,0.5717496,0.004044074,0.0010121579,0.0003386685,0.0022132273,0.0020616676,0.23610713],"genre_scores_gemma":[0.7058388,0.002911346,0.15736577,0.0013838504,0.0009489569,0.0008747951,0.003179168,0.0009619085,0.12653543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856025,0.0003754751,0.000073025214,0.00041382512,0.0003974868,0.00018005718],"domain_scores_gemma":[0.99308664,0.0031779932,0.0007411954,0.0011367148,0.0009894803,0.0008679223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013264283,0.0007518428,0.00056840904,0.0026963917,0.0027896608,0.0025700624,0.0013441426,0.0011381464,0.021884236],"category_scores_gemma":[0.008311116,0.00087660836,0.0012829272,0.0017815153,0.0019342841,0.007822089,0.0027967044,0.002132006,0.0024596562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007317848,0.00003462837,0.0008308717,0.000088017834,0.000015969687,0.0004122104,0.00046225797,0.0011258646,0.0009966745,0.97101766,0.007497948,0.017444843],"study_design_scores_gemma":[0.000039798982,0.000044909353,0.00061600556,0.000059531325,0.000033898257,0.0014781229,0.00031906343,0.009161031,0.0010265114,0.9267593,0.060439058,0.000022959623],"about_ca_topic_score_codex":0.0006877784,"about_ca_topic_score_gemma":0.0012653003,"teacher_disagreement_score":0.021884236,"about_ca_system_score_codex":0.0014474819,"about_ca_system_score_gemma":0.00077649235,"threshold_uncertainty_score":0.07321006},"labels":[],"label_agreement":null},{"id":"W1836341359","doi":"10.37236/2475","title":"Recurrence Relations and Splitting Formulas for the Domination Polynomial","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"European Social Fund","keywords":"Mathematics; Combinatorics; Graph; Polynomial; Reduction (mathematics); Recurrence relation; Discrete mathematics; Mathematical analysis","score_opus":0.01530257340099532,"score_gpt":0.28800492155899604,"score_spread":0.2727023481580007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836341359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5844605,0.0011941739,0.35660222,0.0018113356,0.00011354841,0.000106423984,0.00082374073,0.0005864444,0.054301642],"genre_scores_gemma":[0.9550959,0.00041557912,0.037122633,0.00019753443,0.00012075129,0.00012313761,0.00058750313,0.00012828229,0.00620865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914336,0.00013111989,0.00006200367,0.00020127311,0.000263621,0.00019859252],"domain_scores_gemma":[0.99676776,0.002212972,0.0002884713,0.000243573,0.00036233373,0.00012485251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085964205,0.0004973007,0.00046327608,0.0016556721,0.00086095894,0.0015536702,0.0010933768,0.0006781123,0.0042476715],"category_scores_gemma":[0.005002142,0.00034757072,0.0009985922,0.0016456344,0.0017083153,0.0028451073,0.0011675534,0.002417334,0.0005956991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044476932,0.000050375755,0.0014027612,0.00007251488,0.0000144435535,0.00025799457,0.0006209344,0.004593789,0.0063543404,0.961118,0.002166842,0.023303447],"study_design_scores_gemma":[0.000021274205,0.00002569607,0.0008165194,0.000017460776,0.000020840214,0.00033833538,0.00012777337,0.033743426,0.004913169,0.9572486,0.0026953777,0.00003145587],"about_ca_topic_score_codex":0.0015847288,"about_ca_topic_score_gemma":0.001741888,"teacher_disagreement_score":0.0042476715,"about_ca_system_score_codex":0.0015684621,"about_ca_system_score_gemma":0.000465611,"threshold_uncertainty_score":0.0142098665},"labels":[],"label_agreement":null},{"id":"W1836455089","doi":"10.1007/s00453-016-0139-6","title":"List H-Coloring a Graph by Removing Few Vertices","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Defense Advanced Research Projects Agency; Office of Naval Research; Hungarian Scientific Research Fund; National Science Foundation","keywords":"Combinatorics; Mathematics; Parameterized complexity; Bipartite graph; Conjecture; Discrete mathematics; Homomorphism; Vertex (graph theory); Graph homomorphism; Graph; Graph power; Line graph","score_opus":0.01321742497990888,"score_gpt":0.2631657678241809,"score_spread":0.249948342844272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836455089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3160721,0.00059492385,0.6127608,0.0037113926,0.0016115688,0.0007713121,0.0036796844,0.009176058,0.051622227],"genre_scores_gemma":[0.4166563,0.0003643057,0.5362609,0.0017936588,0.0003676881,0.00048376812,0.0038347829,0.0012689602,0.03896959],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992015,0.00023450583,0.000037145775,0.00016285005,0.0001284845,0.0002354706],"domain_scores_gemma":[0.99565023,0.0013726781,0.00019670845,0.0016364951,0.00048826647,0.0006556524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006901099,0.0011355755,0.00097134936,0.0012039354,0.0030595048,0.0017993058,0.0025527584,0.0012016447,0.020083033],"category_scores_gemma":[0.002674771,0.0007245892,0.0009200559,0.0015117222,0.0010628109,0.0025853394,0.001961558,0.0017559328,0.006072003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044672075,0.00243999,0.011369338,0.0023908801,0.00048550428,0.0012749877,0.00125884,0.058167376,0.17405637,0.15005109,0.117539145,0.4764993],"study_design_scores_gemma":[0.0011678778,0.0020645852,0.008050955,0.00028710262,0.00071182224,0.001591815,0.0024148824,0.28529075,0.17605795,0.42456827,0.09747021,0.0003237111],"about_ca_topic_score_codex":0.0023443187,"about_ca_topic_score_gemma":0.007095824,"teacher_disagreement_score":0.020083033,"about_ca_system_score_codex":0.0009189769,"about_ca_system_score_gemma":0.0020919095,"threshold_uncertainty_score":0.06718445},"labels":[],"label_agreement":null},{"id":"W184891553","doi":"","title":"On the Decomposition of Graphs Into Cliques.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition; Combinatorics; Biology","score_opus":0.011175043424231097,"score_gpt":0.29203822280072705,"score_spread":0.28086317937649596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184891553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062649496,0.014041583,0.71258676,0.01096436,0.0014608263,0.00021744514,0.0015700052,0.00080491503,0.19570461],"genre_scores_gemma":[0.4365956,0.0130948145,0.44104072,0.005457176,0.0036688426,0.0004179105,0.004496039,0.0014917532,0.09373701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982986,0.00073443895,0.00007472704,0.0003216952,0.0002976636,0.00027294914],"domain_scores_gemma":[0.99372417,0.003918359,0.00037894264,0.0010124729,0.00043689884,0.0005291631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020284506,0.0011392713,0.0012193071,0.0028190452,0.0025640153,0.003318456,0.0018521141,0.0021013203,0.013479481],"category_scores_gemma":[0.009117698,0.001016704,0.0016041939,0.0033245757,0.0049753934,0.012265849,0.0032939091,0.0052306354,0.003927352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006212874,0.000050803937,0.00051568565,0.00018474899,0.000048110844,0.00012634462,0.00041125555,0.0034015963,0.000889912,0.9436462,0.023426535,0.027236603],"study_design_scores_gemma":[0.000008795767,0.000007666817,0.00024355674,0.000034717013,0.000014085789,0.00008525895,0.0000830307,0.004481818,0.00015576648,0.98580176,0.009076149,0.000007399225],"about_ca_topic_score_codex":0.0033573888,"about_ca_topic_score_gemma":0.0052378625,"teacher_disagreement_score":0.013479481,"about_ca_system_score_codex":0.0018137832,"about_ca_system_score_gemma":0.0007675454,"threshold_uncertainty_score":0.045093298},"labels":[],"label_agreement":null},{"id":"W1853166665","doi":"10.1007/978-3-642-54423-1_10","title":"Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Upper and lower bounds; Spanning tree; Integer (computer science); Mathematics; Computer science; Discrete mathematics","score_opus":0.02470718623155525,"score_gpt":0.2757769881116598,"score_spread":0.2510698018801045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853166665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25067693,0.016796613,0.49627936,0.0053588864,0.00075241603,0.00026335297,0.0031246494,0.0023061153,0.22444175],"genre_scores_gemma":[0.8181799,0.011310904,0.13986056,0.0014908533,0.001584744,0.0005714962,0.0032340158,0.0018620726,0.021905452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976841,0.00060440815,0.000086776396,0.0005181351,0.0006674148,0.0004390416],"domain_scores_gemma":[0.97907513,0.016479466,0.00089289196,0.0014753873,0.0009640038,0.0011131567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026722308,0.00296823,0.00213451,0.004232333,0.0013941355,0.003744883,0.0051344107,0.0020910385,0.020017875],"category_scores_gemma":[0.023844954,0.0014442942,0.0014448363,0.005041655,0.0022615327,0.007986959,0.0037694173,0.005126899,0.0034636522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008044995,0.00030439527,0.002234706,0.0014356233,0.0002467933,0.0003342041,0.00052823446,0.10156478,0.018312464,0.72437775,0.026244735,0.12361186],"study_design_scores_gemma":[0.00006033942,0.00013594041,0.0019191343,0.00025154784,0.00016209629,0.00067252753,0.00021778351,0.177574,0.0048288344,0.8047126,0.0093985135,0.00006664344],"about_ca_topic_score_codex":0.0007508261,"about_ca_topic_score_gemma":0.0011790983,"teacher_disagreement_score":0.020017875,"about_ca_system_score_codex":0.0021112384,"about_ca_system_score_gemma":0.00069932616,"threshold_uncertainty_score":0.066966414},"labels":[],"label_agreement":null},{"id":"W1857045085","doi":"10.20382/jocg.v3i1a1","title":"The emergence of sparse spanners and well-separated pair decomposition under anarchy","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Spanner; Euclidean geometry; Combinatorics; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Mathematics; Constant (computer programming); Euclidean distance; Graph; Network topology; Computer science; Discrete mathematics; Theoretical computer science; Algorithm; Computer network; Distributed computing; Artificial intelligence; Geometry","score_opus":0.02514194668334845,"score_gpt":0.26345494322076585,"score_spread":0.2383129965374174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857045085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5230101,0.00033419355,0.46233353,0.00047928205,0.000048079943,0.00007237464,0.0001529412,0.00024406929,0.013325474],"genre_scores_gemma":[0.8812432,0.0002834989,0.11017506,0.00013472357,0.000080537844,0.0001209511,0.00031629123,0.000090050795,0.007555624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990207,0.00027893184,0.00004439007,0.00024177876,0.0002599611,0.00015416188],"domain_scores_gemma":[0.9964947,0.001274356,0.00065120426,0.0005400316,0.0003909091,0.00064872234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079975545,0.00040796338,0.0006113336,0.0010708552,0.0009687814,0.001395582,0.00067974534,0.0009221138,0.0024627575],"category_scores_gemma":[0.004322383,0.00053425704,0.00067652954,0.00069661264,0.0021399069,0.0033938452,0.0021736843,0.0015617127,0.00058130966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016181199,0.000057999707,0.0015742292,0.000086224536,0.000031181797,0.00035192023,0.0007022672,0.035987236,0.012196442,0.9274536,0.0016415206,0.019755589],"study_design_scores_gemma":[0.000048520855,0.00013917568,0.00096911733,0.000022171607,0.000017288932,0.0005279454,0.00033016672,0.1295165,0.004085383,0.8595425,0.004771789,0.000029486444],"about_ca_topic_score_codex":0.0004920383,"about_ca_topic_score_gemma":0.00058267475,"teacher_disagreement_score":0.0024627575,"about_ca_system_score_codex":0.00053713506,"about_ca_system_score_gemma":0.00031043848,"threshold_uncertainty_score":0.008238673},"labels":[],"label_agreement":null},{"id":"W1858133485","doi":"10.37236/2299","title":"On the Cartesian Product of Non Well-Covered Graphs","year":2013,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Cartesian product; Combinatorics; Vertex (graph theory); Mathematics; Cardinality (data modeling); Graph; Product (mathematics); Maximal independent set; Discrete mathematics; Chordal graph; 1-planar graph; Computer science; Geometry; Data mining","score_opus":0.011681149696567873,"score_gpt":0.26048168492128465,"score_spread":0.2488005352247168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1858133485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8915353,0.001148607,0.09417903,0.0005974195,0.0000425825,0.00003605258,0.00045502928,0.00020024124,0.011805736],"genre_scores_gemma":[0.9636509,0.0010966947,0.030233106,0.00014947592,0.00016785174,0.00008583312,0.001207892,0.0001369744,0.0032712966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808633,0.00055962283,0.000097630254,0.0005600062,0.00044555176,0.00025076763],"domain_scores_gemma":[0.98562187,0.009726304,0.0014033346,0.0013675079,0.0008847961,0.0009961957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018230207,0.0009059858,0.0010954604,0.0026340054,0.001407786,0.002624778,0.0011012753,0.00087690784,0.0032220094],"category_scores_gemma":[0.007814551,0.0012869488,0.0008681377,0.0025367227,0.0030156274,0.007369449,0.0031443152,0.0015706111,0.00048915955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096416613,0.00016342562,0.01465399,0.00034680846,0.0001659237,0.0019835897,0.0027722605,0.033052962,0.009383227,0.9049742,0.0041768826,0.027362399],"study_design_scores_gemma":[0.000057380938,0.00016758192,0.0048282724,0.00007681011,0.00012667458,0.0018751987,0.0005040281,0.079810925,0.0033563343,0.9037421,0.005412465,0.000042199597],"about_ca_topic_score_codex":0.0010320492,"about_ca_topic_score_gemma":0.0007305782,"teacher_disagreement_score":0.0032220094,"about_ca_system_score_codex":0.00084027776,"about_ca_system_score_gemma":0.00036112516,"threshold_uncertainty_score":0.010778725},"labels":[],"label_agreement":null},{"id":"W1860548633","doi":"10.37236/2666","title":"A Superlocal Version of Reed's Conjecture","year":2014,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Neighbourhood (mathematics); Mathematics; Omega; Vertex (graph theory); Upper and lower bounds; Locality; Independent set; Graph; Chromatic scale; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.008571330437597833,"score_gpt":0.2618029617354574,"score_spread":0.2532316312978596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860548633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5263857,0.0011333765,0.29556602,0.013838318,0.0005872813,0.00009219845,0.0009605669,0.001131588,0.16030496],"genre_scores_gemma":[0.9683069,0.00029166776,0.01706941,0.0014945763,0.0002942232,0.000080528866,0.00028475674,0.00010143065,0.012076577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989473,0.00018918217,0.000040517152,0.0004456181,0.00019939226,0.00017805576],"domain_scores_gemma":[0.99461836,0.0022440052,0.00049331994,0.0016840122,0.00059553375,0.00036475595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333229,0.00037516616,0.0008167412,0.00062559673,0.001560956,0.0013121921,0.001775454,0.0013786915,0.011572208],"category_scores_gemma":[0.005685211,0.00032923586,0.00076369214,0.0007988719,0.0027496703,0.006174944,0.0024766594,0.0022796516,0.00116961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022458046,0.00004321141,0.0017641045,0.00022638547,0.00002442162,0.00019975915,0.00063601945,0.008911317,0.0061219814,0.96010816,0.006299467,0.0154405795],"study_design_scores_gemma":[0.000057164416,0.00008853114,0.0016066824,0.000036859543,0.000024199004,0.00033586274,0.00028535197,0.02474582,0.0028632286,0.9544078,0.015510504,0.000037992326],"about_ca_topic_score_codex":0.001153931,"about_ca_topic_score_gemma":0.0013695257,"teacher_disagreement_score":0.011572208,"about_ca_system_score_codex":0.0013506024,"about_ca_system_score_gemma":0.0005724901,"threshold_uncertainty_score":0.03871292},"labels":[],"label_agreement":null},{"id":"W1861204304","doi":"10.1007/978-3-642-25870-1_29","title":"Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Grid; Vertex (graph theory); Intersection (aeronautics); Computer science; Combinatorics; Theoretical computer science; Geography; Mathematics; Graph; Cartography; Geometry","score_opus":0.03237308431601719,"score_gpt":0.2708802046717232,"score_spread":0.238507120355706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861204304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80147547,0.0002814734,0.17578885,0.0005159698,0.000053457527,0.00015063319,0.0016126782,0.0016149589,0.018506382],"genre_scores_gemma":[0.8785106,0.00024544648,0.10874736,0.00015731751,0.000045980043,0.00010417288,0.0057137967,0.00041073436,0.0060645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932504,0.000049731658,0.00005062376,0.0002910375,0.00013069189,0.00015284237],"domain_scores_gemma":[0.99761343,0.0009624804,0.0003432468,0.00051543274,0.00028760658,0.00027794664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002969551,0.0006125602,0.0009110777,0.0012481849,0.0013345737,0.0024285908,0.0019386681,0.001326074,0.0046241665],"category_scores_gemma":[0.0028809193,0.00093967747,0.0010077073,0.0021860476,0.0010206763,0.004167685,0.0013389853,0.0017652905,0.000811548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015561694,0.0009543103,0.08448954,0.00090125605,0.00022753338,0.0043455665,0.00472622,0.1039982,0.054134186,0.455983,0.027606763,0.26107726],"study_design_scores_gemma":[0.000095141055,0.00016470537,0.016066805,0.00015804298,0.00011970475,0.0025325709,0.0038048532,0.38608277,0.018254695,0.54981416,0.022832526,0.00007399904],"about_ca_topic_score_codex":0.00472361,"about_ca_topic_score_gemma":0.0053592427,"teacher_disagreement_score":0.00472361,"about_ca_system_score_codex":0.00074182573,"about_ca_system_score_gemma":0.0005688198,"threshold_uncertainty_score":0.015469372},"labels":[],"label_agreement":null},{"id":"W186137167","doi":"","title":"Trees with equal average domination and independent domination numbers.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph","score_opus":0.0096807429801973,"score_gpt":0.2558306158770472,"score_spread":0.2461498728968499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186137167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6488353,0.001753173,0.21413322,0.0016186372,0.0002199826,0.00010566534,0.0029377402,0.0007832356,0.12961298],"genre_scores_gemma":[0.96913546,0.0003825095,0.017452091,0.00024615313,0.00015448709,0.00007632241,0.0007783163,0.00012942715,0.011645351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831605,0.00036559755,0.00008180047,0.00038303202,0.0004294516,0.00042402354],"domain_scores_gemma":[0.9846821,0.009660331,0.0014528796,0.001544974,0.0014297629,0.0012300503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013141125,0.0003739494,0.00073224236,0.0022278978,0.0017026503,0.0034804163,0.0013750009,0.00099896,0.008169428],"category_scores_gemma":[0.014378031,0.0004506469,0.00048365287,0.001841232,0.0017636401,0.0047451053,0.0014187214,0.0012675668,0.0010820997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046949266,0.00010958911,0.005999496,0.00016250032,0.00009152087,0.0003864555,0.0005483813,0.013981943,0.007062372,0.9169938,0.010128398,0.044066012],"study_design_scores_gemma":[0.000053470798,0.000044148106,0.0036407071,0.000044454537,0.00008272444,0.001188919,0.00028039067,0.03677887,0.003911595,0.9448114,0.009128398,0.000034892433],"about_ca_topic_score_codex":0.0011840352,"about_ca_topic_score_gemma":0.0024871638,"teacher_disagreement_score":0.008169428,"about_ca_system_score_codex":0.0012891496,"about_ca_system_score_gemma":0.00073126704,"threshold_uncertainty_score":0.027329504},"labels":[],"label_agreement":null},{"id":"W1861909104","doi":"10.1007/s00453-013-9752-9","title":"Practical and Efficient Split Decomposition via Graph-Labelled Trees","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ackermann function; Lexicographical order; Graph; Modular decomposition; Decomposition; Mathematics; Algorithm; Combinatorics; Computer science; Inverse; Line graph; Pathwidth","score_opus":0.014971663974801794,"score_gpt":0.31105844003241884,"score_spread":0.296086776057617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861909104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04417786,0.00019544108,0.9406567,0.0004387754,0.00010013943,0.00019046034,0.0006397324,0.0025061613,0.011094731],"genre_scores_gemma":[0.2129201,0.00017050684,0.7752615,0.00019539014,0.000058763966,0.00022046128,0.00200407,0.0008133984,0.008355737],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897814,0.00022481893,0.00005519648,0.00021699905,0.0003280884,0.00019680265],"domain_scores_gemma":[0.9981629,0.0007172485,0.00008945152,0.00060886174,0.00024139338,0.00018004767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008052725,0.0008157868,0.00085758895,0.0008622146,0.00091371394,0.0018293642,0.0014425576,0.0010504833,0.014352604],"category_scores_gemma":[0.0034562638,0.00061990274,0.0010097914,0.001168325,0.0008873779,0.0033105107,0.0033452718,0.0018759167,0.004456331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013691495,0.0008352495,0.0018691029,0.00077368313,0.00012002447,0.00044540138,0.00092439505,0.08774496,0.0573494,0.18718061,0.046534903,0.6148531],"study_design_scores_gemma":[0.000284999,0.00021244952,0.0007115716,0.00008975814,0.00009508654,0.00030648126,0.0005427236,0.46172023,0.01859301,0.49996263,0.01743872,0.000042288782],"about_ca_topic_score_codex":0.0009730745,"about_ca_topic_score_gemma":0.003517958,"teacher_disagreement_score":0.014352604,"about_ca_system_score_codex":0.0007001704,"about_ca_system_score_gemma":0.0014892536,"threshold_uncertainty_score":0.048014224},"labels":[],"label_agreement":null},{"id":"W1864728667","doi":"","title":"Decycling and dominating cubes and grids","year":2006,"lang":"en","type":"dissertation","venue":"Memorial University Research Repository (Memorial University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Computer science","score_opus":0.01967402217984583,"score_gpt":0.27810012708419835,"score_spread":0.2584261049043525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864728667","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.155419,0.014745998,0.6242864,0.011296133,0.0017087542,0.0004246086,0.0025261557,0.0016025385,0.18799046],"genre_scores_gemma":[0.6463214,0.010210995,0.23320405,0.0012835633,0.00063797436,0.00034638285,0.00250889,0.000402305,0.105084494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999241,0.0002376559,0.000042910546,0.0001820618,0.0001596342,0.00013679994],"domain_scores_gemma":[0.99807847,0.00091772596,0.00017800952,0.00041254587,0.00020689952,0.00020637967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007300287,0.00054905645,0.000783126,0.0010259236,0.0012965236,0.0022691654,0.0011375963,0.00069015723,0.010314621],"category_scores_gemma":[0.0036453009,0.0003272113,0.0006298105,0.0026376797,0.0011999016,0.003720823,0.0021162753,0.0014526097,0.0011979167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022875173,0.000063534295,0.0010583195,0.00031249007,0.00003936865,0.00017087073,0.00040688462,0.059593737,0.0010152587,0.7967962,0.023380231,0.11693436],"study_design_scores_gemma":[0.00004112129,0.00006802422,0.00065053155,0.00008856105,0.000021438193,0.0003035272,0.00040538935,0.082175806,0.0012554288,0.84967476,0.06529496,0.000020369214],"about_ca_topic_score_codex":0.004419389,"about_ca_topic_score_gemma":0.0059086345,"teacher_disagreement_score":0.010314621,"about_ca_system_score_codex":0.0015885964,"about_ca_system_score_gemma":0.0009997931,"threshold_uncertainty_score":0.034505844},"labels":[],"label_agreement":null},{"id":"W1871413087","doi":"10.1016/j.dam.2015.08.018","title":"A note on the Grundy number and graph products","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Memorial University of Newfoundland; Mount Allison University; University of Prince Edward Island; St. Francis Xavier University; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.04128525240217985,"score_gpt":0.30362654616002677,"score_spread":0.2623412937578469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871413087","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055775594,0.06123223,0.16523845,0.13171615,0.03937022,0.000060818358,0.0007540304,0.0004825295,0.54537],"genre_scores_gemma":[0.65589625,0.049236234,0.10132768,0.020742383,0.06392038,0.0002742612,0.0005509242,0.00082732795,0.10722454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987488,0.0004246315,0.00008083409,0.00030088806,0.00033198786,0.00011295889],"domain_scores_gemma":[0.99517256,0.0036358142,0.0001758938,0.0005010423,0.0003116435,0.00020302928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024333089,0.0010751765,0.001583446,0.0031380185,0.0033929779,0.004215492,0.0020014143,0.002775254,0.009899956],"category_scores_gemma":[0.007273147,0.00063691894,0.0013970361,0.0032227554,0.01106032,0.015398872,0.0043457043,0.008752352,0.0017316155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017882821,0.0000057157854,0.000054583048,0.00003723011,0.0000045249617,0.000043250457,0.00009213996,0.0001664593,0.0001314948,0.9874407,0.0074699097,0.0045361635],"study_design_scores_gemma":[0.000004353732,0.0000059041313,0.0000754837,0.000010764724,0.0000038008134,0.00004121184,0.00002189289,0.00022817965,0.000065122986,0.981427,0.018106623,0.000009785496],"about_ca_topic_score_codex":0.001480501,"about_ca_topic_score_gemma":0.0016245632,"teacher_disagreement_score":0.009899956,"about_ca_system_score_codex":0.0018109004,"about_ca_system_score_gemma":0.0007484219,"threshold_uncertainty_score":0.033118606},"labels":[],"label_agreement":null},{"id":"W187157619","doi":"","title":"Domination Graphs of Tournaments with Isolated Vertices.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010761805555458954,"score_gpt":0.25894835006657946,"score_spread":0.24818654451112052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187157619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7279535,0.0013043956,0.11068907,0.0014850764,0.0002208327,0.00015759851,0.0017169144,0.00062530284,0.15584733],"genre_scores_gemma":[0.974853,0.00036934728,0.008263311,0.00022505494,0.00010620882,0.00007936593,0.00104385,0.000077755554,0.014982138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991054,0.0002547198,0.00004538467,0.00017458053,0.0001639252,0.0002559937],"domain_scores_gemma":[0.99508166,0.0026309453,0.00076457206,0.00038275353,0.00036760024,0.0007725355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056684896,0.0005350064,0.0006013781,0.0014772535,0.0022503585,0.0033766944,0.0012344944,0.0009438499,0.010163382],"category_scores_gemma":[0.0042042374,0.0005678648,0.0006233821,0.0015904208,0.0013246515,0.0025545524,0.0015559901,0.0011573728,0.0008175062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006016967,0.00014549756,0.0076585887,0.0002287348,0.00014465305,0.0012978065,0.0011603762,0.008971285,0.0074996515,0.91856116,0.017413126,0.03631746],"study_design_scores_gemma":[0.00018327242,0.00007822308,0.0068405475,0.0000878009,0.00012904174,0.0018818656,0.0007892182,0.03791417,0.0037056648,0.9200405,0.028302716,0.000047058416],"about_ca_topic_score_codex":0.0026986508,"about_ca_topic_score_gemma":0.0036848248,"teacher_disagreement_score":0.010163382,"about_ca_system_score_codex":0.0011580124,"about_ca_system_score_gemma":0.00047645232,"threshold_uncertainty_score":0.03399992},"labels":[],"label_agreement":null},{"id":"W1873702685","doi":"10.1090/s0002-9947-04-03544-5","title":"Coloring-flow duality of embedded graphs","year":2004,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Council; Division of Mathematical Sciences; National Security Agency; Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Invariant (physics); Edge coloring; Discrete mathematics; Mathematical physics","score_opus":0.021607512555551954,"score_gpt":0.30324022582720556,"score_spread":0.2816327132716536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1873702685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6370735,0.0004964195,0.231785,0.0007218453,0.0002159405,0.00008537448,0.00063612306,0.0005254107,0.12846042],"genre_scores_gemma":[0.93469167,0.00033798008,0.032629743,0.00023817137,0.00015036386,0.0000883764,0.0007256736,0.0002518517,0.030886292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959046,0.000061159924,0.000015166684,0.00012351794,0.00009641151,0.00011329596],"domain_scores_gemma":[0.9993011,0.00018469075,0.0001058902,0.000087756845,0.00014556808,0.00017497964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003358518,0.0004480945,0.0002760813,0.0012687637,0.0008222034,0.0016938089,0.0006631972,0.0006017049,0.0073629045],"category_scores_gemma":[0.0011092294,0.0002842368,0.00045344522,0.00074504036,0.0015144179,0.0023810759,0.0012127876,0.001111412,0.00072009687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028275215,0.00002045924,0.00033685143,0.000021095602,0.000003593755,0.00007048196,0.00021905277,0.0027865923,0.001983702,0.98807377,0.0007806807,0.005675496],"study_design_scores_gemma":[0.00002339175,0.00002917287,0.0007599218,0.00001803707,0.000009477821,0.00013228919,0.00021143502,0.027048247,0.0020195022,0.9595789,0.01015426,0.000015361811],"about_ca_topic_score_codex":0.002276619,"about_ca_topic_score_gemma":0.00186751,"teacher_disagreement_score":0.0073629045,"about_ca_system_score_codex":0.0016468712,"about_ca_system_score_gemma":0.00041972412,"threshold_uncertainty_score":0.024631381},"labels":[],"label_agreement":null},{"id":"W187710645","doi":"","title":"Distance Independent Domination In Iterated Line Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Iterated function; Combinatorics; Line (geometry); Geometry; Mathematical analysis","score_opus":0.009569804928416695,"score_gpt":0.2630987710915827,"score_spread":0.253528966163166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187710645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7037351,0.001065331,0.15349905,0.0012149047,0.00009700712,0.000081668164,0.00039968546,0.00045772758,0.1394495],"genre_scores_gemma":[0.9703569,0.00033434856,0.011409133,0.00015469713,0.000073188545,0.000045827135,0.00018613435,0.00006284913,0.017376868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991053,0.00022843825,0.000036876783,0.00017529055,0.00028054125,0.00017354965],"domain_scores_gemma":[0.9947389,0.003244779,0.0006066788,0.0004693866,0.00047032716,0.00046997474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005555027,0.00025675687,0.00039839873,0.0011949667,0.001222053,0.0018701704,0.0010050873,0.00070363004,0.006084964],"category_scores_gemma":[0.0049902922,0.000281944,0.0004309248,0.000969128,0.0015529216,0.0028705662,0.0015680806,0.0012147871,0.00077407504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014065602,0.00006396203,0.0028558637,0.00014437438,0.00004991268,0.0005344719,0.000961181,0.0051774103,0.0069099353,0.94523907,0.004286828,0.03363629],"study_design_scores_gemma":[0.000054863533,0.000045599474,0.0019747342,0.000041759915,0.000058514885,0.00097976,0.00041036613,0.034336362,0.004615325,0.9463565,0.0110977525,0.00002844454],"about_ca_topic_score_codex":0.0010559276,"about_ca_topic_score_gemma":0.001567488,"teacher_disagreement_score":0.006084964,"about_ca_system_score_codex":0.0010774276,"about_ca_system_score_gemma":0.0003698406,"threshold_uncertainty_score":0.020356297},"labels":[],"label_agreement":null},{"id":"W1878158968","doi":"10.37236/689","title":"A New Upper Bound on the Global Defensive Alliance Number in Trees","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Alliance; Vertex (graph theory); Graph; Tree (set theory); Order (exchange); Dominating set; Discrete mathematics; Geography","score_opus":0.02319584475108637,"score_gpt":0.2794500783205623,"score_spread":0.2562542335694759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878158968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27623004,0.0073346845,0.59334743,0.0025370654,0.00036521806,0.0002242983,0.0024229598,0.0007698366,0.11676856],"genre_scores_gemma":[0.83855844,0.0045937374,0.13594168,0.0005896678,0.00050137896,0.0003365807,0.0016444381,0.000314911,0.01751916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862754,0.00020790347,0.00008729891,0.00033855016,0.00039103825,0.00034764296],"domain_scores_gemma":[0.9919354,0.0051588016,0.0005495518,0.00079626427,0.00053292233,0.0010271753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013842289,0.0012293889,0.0014766783,0.0019567544,0.0014481898,0.003293388,0.0017606901,0.0011141192,0.008286742],"category_scores_gemma":[0.006256461,0.00056157244,0.0009974365,0.0018727302,0.0016014994,0.0076573845,0.0029827596,0.003124281,0.0013851521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009501892,0.00032606785,0.008326466,0.0014590166,0.00023186722,0.00071802136,0.0014725861,0.13558733,0.07015567,0.645713,0.022241674,0.1128181],"study_design_scores_gemma":[0.0000868034,0.0006957729,0.006809189,0.0002896873,0.00035872663,0.0027882587,0.0007194213,0.27728564,0.022990104,0.63551754,0.052298665,0.00016019703],"about_ca_topic_score_codex":0.00038846012,"about_ca_topic_score_gemma":0.0010793266,"teacher_disagreement_score":0.008286742,"about_ca_system_score_codex":0.0015067812,"about_ca_system_score_gemma":0.0006098618,"threshold_uncertainty_score":0.027721941},"labels":[],"label_agreement":null},{"id":"W1878337849","doi":"","title":"A note on equimatchable graphs","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Matching (statistics); Cardinality (data modeling); Discrete mathematics; Computer science","score_opus":0.0199512579187382,"score_gpt":0.3179064146089651,"score_spread":0.29795515669022693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878337849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36583307,0.014236466,0.4282643,0.004264449,0.0010982814,0.00011826558,0.0006500335,0.00066460256,0.18487057],"genre_scores_gemma":[0.8388876,0.0075721596,0.13565479,0.0014040631,0.0010153496,0.000059327333,0.0006731364,0.00018734332,0.0145462155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995591,0.00008681171,0.000024108906,0.000104051636,0.00012868368,0.000097291944],"domain_scores_gemma":[0.9985481,0.00080092804,0.00014894902,0.00018177807,0.00019082273,0.00012945049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042415215,0.00047445792,0.0004042583,0.0013312914,0.0010468499,0.0007084369,0.0006827325,0.0005027151,0.004827948],"category_scores_gemma":[0.0018345051,0.00025793313,0.00040231264,0.0017022118,0.0010418672,0.0025549582,0.0012362323,0.0017506684,0.0005643005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026825815,0.00015990114,0.0060587362,0.00052522746,0.000044709563,0.0017607545,0.0009022959,0.02862427,0.01159307,0.711753,0.02036997,0.2179397],"study_design_scores_gemma":[0.000012720222,0.00023873849,0.003886915,0.00010799339,0.000037095408,0.0027063568,0.00070221856,0.022898473,0.0049799597,0.86331224,0.10107884,0.000038479648],"about_ca_topic_score_codex":0.0010681837,"about_ca_topic_score_gemma":0.0015005884,"teacher_disagreement_score":0.004827948,"about_ca_system_score_codex":0.0004783595,"about_ca_system_score_gemma":0.00021375094,"threshold_uncertainty_score":0.01615107},"labels":[],"label_agreement":null},{"id":"W189131776","doi":"","title":"Constrained switchings in cubic graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.009523332103955083,"score_gpt":0.255686903082417,"score_spread":0.2461635709784619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189131776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5220531,0.0014904854,0.15733938,0.001903968,0.00067698053,0.00022659946,0.0021950044,0.0016741621,0.31244037],"genre_scores_gemma":[0.9387294,0.0004892653,0.026943455,0.00052359956,0.00015014733,0.0001390812,0.0012379166,0.00031339086,0.03147385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933237,0.0001265592,0.00003357757,0.00014749059,0.00016348,0.00019647893],"domain_scores_gemma":[0.9974496,0.0010476678,0.0003008597,0.0005652488,0.00024126779,0.0003954117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036347136,0.00032355677,0.00046819818,0.001019652,0.0017158851,0.00170655,0.0012536208,0.00098276,0.026855016],"category_scores_gemma":[0.0036313997,0.0004222808,0.00054938154,0.0014916657,0.0012110567,0.0026258207,0.0016342726,0.0018625658,0.0018113919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017185911,0.00010198194,0.00089422415,0.00016933639,0.000022544298,0.00030691767,0.00029925662,0.0077424827,0.0038246477,0.9302812,0.010546669,0.045638803],"study_design_scores_gemma":[0.00004572793,0.000033493227,0.00086077873,0.000040174506,0.000018893414,0.00023691016,0.00023701052,0.02915916,0.0017064376,0.95263225,0.015002544,0.000026721289],"about_ca_topic_score_codex":0.005062349,"about_ca_topic_score_gemma":0.009715645,"teacher_disagreement_score":0.026855016,"about_ca_system_score_codex":0.0012039859,"about_ca_system_score_gemma":0.0009903017,"threshold_uncertainty_score":0.08983898},"labels":[],"label_agreement":null},{"id":"W1897354905","doi":"10.37236/4419","title":"On Maltsev Digraphs","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Mathematics; Combinatorics; Constraint satisfaction problem; Time complexity; Discrete mathematics; Disjoint sets; Semilattice; Directed graph; Homomorphism; Series (stratigraphy)","score_opus":0.01895759023653225,"score_gpt":0.2791022268054558,"score_spread":0.26014463656892356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897354905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34956723,0.000405146,0.62012064,0.00067907193,0.00009909431,0.0002476681,0.0015131399,0.001507588,0.025860397],"genre_scores_gemma":[0.8199034,0.0005091582,0.15833864,0.00031542673,0.000050451818,0.00023004822,0.0019844177,0.000207035,0.018461445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954957,0.00007348899,0.00003835106,0.00014485138,0.00009092958,0.000102762824],"domain_scores_gemma":[0.9986552,0.0005587704,0.00016823984,0.00027587768,0.00018890874,0.00015295873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037818102,0.00035380624,0.00041226388,0.0008666876,0.0013483719,0.0013868706,0.00064795103,0.0004005727,0.0056761242],"category_scores_gemma":[0.0022971532,0.00035101504,0.000539718,0.0014447868,0.0012009352,0.0027407892,0.0013291725,0.0011232028,0.0007574838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018343145,0.00014627108,0.0035649093,0.00023299937,0.00002950571,0.00082083786,0.0016202673,0.01576928,0.018555388,0.86372495,0.0033271005,0.09202506],"study_design_scores_gemma":[0.000045569497,0.0001306311,0.001786863,0.0000668534,0.00003784129,0.00074785086,0.0009670981,0.056726545,0.018254895,0.88271254,0.038468808,0.000054565764],"about_ca_topic_score_codex":0.0045831916,"about_ca_topic_score_gemma":0.0065186806,"teacher_disagreement_score":0.0056761242,"about_ca_system_score_codex":0.0011316173,"about_ca_system_score_gemma":0.0007648231,"threshold_uncertainty_score":0.01898849},"labels":[],"label_agreement":null},{"id":"W1899569194","doi":"10.1016/j.jctb.2016.02.002","title":"Packing Steiner trees","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Steiner tree problem; Conjecture; Mathematics; Disjoint sets; Graph; Spanning tree; Tree (set theory); Discrete mathematics","score_opus":0.014121268360480495,"score_gpt":0.269411629229777,"score_spread":0.2552903608692965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899569194","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4062875,0.001725331,0.17307499,0.0026895243,0.00088030694,0.00019857955,0.0028021731,0.0013347998,0.4110068],"genre_scores_gemma":[0.8064097,0.0019109572,0.098199114,0.00078176183,0.00041416867,0.00015691416,0.006094101,0.000862489,0.08517078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944335,0.000098767305,0.000035211797,0.00013091731,0.00018165118,0.000109977336],"domain_scores_gemma":[0.9991898,0.00024270365,0.00010583661,0.00022726326,0.00011062309,0.00012364105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024262439,0.0006616123,0.001031515,0.0013522685,0.0015920555,0.0025703828,0.0010248311,0.0015296253,0.03353051],"category_scores_gemma":[0.0023146658,0.00082913635,0.00074469077,0.0029807733,0.00078490266,0.002988005,0.0023533436,0.0024030178,0.0060653593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031351668,0.00024140066,0.0018286762,0.00032049333,0.00008710529,0.0008596266,0.0005373855,0.015948296,0.011654037,0.7856501,0.05264771,0.1299117],"study_design_scores_gemma":[0.000056781635,0.00010376717,0.0018906916,0.000085957945,0.00008117993,0.0015199372,0.00048683074,0.054349687,0.005801063,0.88972723,0.04586947,0.00002740493],"about_ca_topic_score_codex":0.0005061091,"about_ca_topic_score_gemma":0.00082895625,"teacher_disagreement_score":0.03353051,"about_ca_system_score_codex":0.0007778773,"about_ca_system_score_gemma":0.00041899452,"threshold_uncertainty_score":0.112170696},"labels":[],"label_agreement":null},{"id":"W1911143988","doi":"10.1093/comjnl/bxv039","title":"Narrowing the Complexity Gap for Colouring (<i>C<sub>s</sub>, P<sub>t</sub></i>)-Free Graphs","year":2015,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Library science; Computer science; Media studies; Sociology","score_opus":0.09799493135422839,"score_gpt":0.30158093558384713,"score_spread":0.20358600422961876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1911143988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22114474,0.004846296,0.67618144,0.023261683,0.0011722657,0.0010414263,0.0042638374,0.008385731,0.059702624],"genre_scores_gemma":[0.57298756,0.0028532508,0.38962564,0.005110063,0.00089067506,0.00080535415,0.006606899,0.0033207226,0.017799878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914136,0.0018914276,0.00040127896,0.0024265437,0.001991628,0.0018755597],"domain_scores_gemma":[0.96529704,0.0258971,0.0010444124,0.005109107,0.0014294457,0.0012228878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050940514,0.0025781377,0.003391042,0.0019787955,0.0033825452,0.007986091,0.00553412,0.0036769644,0.01524059],"category_scores_gemma":[0.019775141,0.0014449587,0.0056151967,0.0025038312,0.004844065,0.0181619,0.0087774955,0.009422977,0.003024542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033431903,0.0014362643,0.0052945027,0.002897772,0.00035605475,0.0006999359,0.0022997998,0.30077392,0.015104342,0.3341795,0.0729192,0.2606955],"study_design_scores_gemma":[0.00032569634,0.00017244647,0.000865593,0.0002288426,0.0001739464,0.00024386132,0.00040706046,0.37928644,0.0044086995,0.60222214,0.011579743,0.00008543284],"about_ca_topic_score_codex":0.013465933,"about_ca_topic_score_gemma":0.016721856,"teacher_disagreement_score":0.01524059,"about_ca_system_score_codex":0.008475292,"about_ca_system_score_gemma":0.008529507,"threshold_uncertainty_score":0.0614928},"labels":[],"label_agreement":null},{"id":"W1911800350","doi":"10.2298/fil1601169a","title":"On the domination polynomials of friendship graphs","year":2016,"lang":"en","type":"preprint","venue":"Filomat","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Limiting; Order (exchange)","score_opus":0.03332738700759024,"score_gpt":0.3040263962590281,"score_spread":0.27069900925143786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1911800350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86060476,0.0008875912,0.0919441,0.0008954605,0.000038986935,0.00003988158,0.00033578966,0.00013588417,0.045117576],"genre_scores_gemma":[0.9903937,0.00045480914,0.0043467176,0.0000484818,0.000071839204,0.000015859297,0.00011956764,0.000029937357,0.0045190915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994555,0.00011262293,0.000010666103,0.00008917819,0.00014477686,0.00018725908],"domain_scores_gemma":[0.99658763,0.0023109892,0.0003037083,0.00019178004,0.00027550192,0.00033048785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006875127,0.0003762998,0.00034024328,0.0017380269,0.0010333763,0.0011074751,0.0006399451,0.0004080161,0.0039055322],"category_scores_gemma":[0.0060115284,0.00023227099,0.00046778732,0.0016621945,0.001714716,0.0019917095,0.0011214071,0.0011071886,0.00039053164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025896178,0.00007314557,0.0043165735,0.0001266841,0.000024053614,0.00035534654,0.0015480926,0.037157305,0.007939969,0.90461975,0.0027859528,0.04079424],"study_design_scores_gemma":[0.00004419642,0.00006409859,0.004486241,0.000037756723,0.000021395097,0.00052166055,0.00040073865,0.1196338,0.003136208,0.86363727,0.007975205,0.000041459898],"about_ca_topic_score_codex":0.0038252247,"about_ca_topic_score_gemma":0.0029377227,"teacher_disagreement_score":0.0039055322,"about_ca_system_score_codex":0.0015101237,"about_ca_system_score_gemma":0.0004191977,"threshold_uncertainty_score":0.013065338},"labels":[],"label_agreement":null},{"id":"W1913504200","doi":"10.1002/jgt.21791","title":"Chasing a Fast Robber on Planar Graphs and Random Graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Israeli Centers for Research Excellence; Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Mathematics; Combinatorics; Treewidth; Planar graph; Vertex (graph theory); Discrete mathematics; Graph; Constant (computer programming); Pathwidth; Line graph; Computer science","score_opus":0.01250663770375848,"score_gpt":0.2608837992795954,"score_spread":0.2483771615758369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913504200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50282884,0.0007346613,0.4788396,0.0018675611,0.00007129116,0.00021273564,0.00051543355,0.00060650875,0.01432337],"genre_scores_gemma":[0.92550856,0.00055922335,0.06646727,0.00027130643,0.00007262944,0.00018314933,0.0003769797,0.0001499257,0.006410889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979791,0.00072414835,0.000064600856,0.00050616194,0.00021915967,0.00050686963],"domain_scores_gemma":[0.9899766,0.006830267,0.0012197501,0.00085429935,0.00027690534,0.0008422418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016153067,0.0018458473,0.0021502073,0.0011104911,0.0013656438,0.0018425225,0.0028273573,0.0022633432,0.0047554527],"category_scores_gemma":[0.012565231,0.00079186534,0.0012008883,0.0013661152,0.0030533469,0.0059537776,0.0026430415,0.0020067664,0.00052924006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000597661,0.00015687656,0.0012012833,0.00021894026,0.00012556552,0.00061121327,0.0002337028,0.7196965,0.005436018,0.25818366,0.0026518453,0.010886655],"study_design_scores_gemma":[0.00008935373,0.00013508425,0.00044532618,0.000019537607,0.00003385277,0.00024869313,0.00013354231,0.8671801,0.0015157704,0.12873162,0.0014288098,0.000038199698],"about_ca_topic_score_codex":0.0044319173,"about_ca_topic_score_gemma":0.004108405,"teacher_disagreement_score":0.0047554527,"about_ca_system_score_codex":0.0019653873,"about_ca_system_score_gemma":0.001013373,"threshold_uncertainty_score":0.015908599},"labels":[],"label_agreement":null},{"id":"W191581831","doi":"","title":"Triangle-Free Regular Graphs as an Extremal Family.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023373265250316945,"score_gpt":0.2794175054579152,"score_spread":0.25604424020759825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191581831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6321008,0.0015805932,0.10880795,0.0025781959,0.0004006755,0.0000706197,0.00079862314,0.0006147377,0.25304776],"genre_scores_gemma":[0.96540415,0.0005130942,0.012916383,0.00021268045,0.0001235997,0.000037211263,0.00039081246,0.00011149053,0.020290513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996413,0.00008497771,0.00001414713,0.00008085387,0.00010472912,0.000073989],"domain_scores_gemma":[0.99912566,0.00032301908,0.00012562031,0.0001322227,0.00010225771,0.00019116358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036717084,0.00030083567,0.00038202852,0.001271132,0.0018434831,0.0015077292,0.0006652917,0.00093033875,0.0101904],"category_scores_gemma":[0.002106554,0.0004560952,0.00043738258,0.000748744,0.0012018959,0.0022222002,0.0013446324,0.0012569526,0.0011182165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007380717,0.00001834408,0.0005967715,0.000040536594,0.000010573402,0.00032221756,0.0002247494,0.001306493,0.0018653634,0.981471,0.0051747877,0.008895366],"study_design_scores_gemma":[0.000019124824,0.000024901501,0.0008179091,0.00003154775,0.000019979609,0.0016390827,0.00026839634,0.011124354,0.0012669958,0.9727759,0.011995898,0.00001595612],"about_ca_topic_score_codex":0.00046395554,"about_ca_topic_score_gemma":0.00069242954,"teacher_disagreement_score":0.0101904,"about_ca_system_score_codex":0.00056174106,"about_ca_system_score_gemma":0.00021966542,"threshold_uncertainty_score":0.03409028},"labels":[],"label_agreement":null},{"id":"W1916472382","doi":"10.37236/449","title":"Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Australian Research Council; Canada Research Chairs; University of Melbourne; Macquarie University","keywords":"Combinatorics; Mathematics; Heuristics; Bounding overwatch; Maximal independent set; Cubic graph; Vertex (graph theory); Greedy algorithm; Discrete mathematics; Graph; Chordal graph; Algorithm; Computer science; 1-planar graph; Line graph; Mathematical optimization","score_opus":0.009681412868531011,"score_gpt":0.2806493101126358,"score_spread":0.27096789724410475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916472382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05818998,0.0019365271,0.9148393,0.0025584828,0.0001661534,0.0002461297,0.0007782431,0.0014917898,0.019793386],"genre_scores_gemma":[0.60043293,0.0023701976,0.3809085,0.0013081351,0.0006198481,0.0009635819,0.0014509627,0.0013977353,0.010547996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911299,0.003062101,0.0002686565,0.0011940122,0.0019229838,0.0024223053],"domain_scores_gemma":[0.96699345,0.026545627,0.0024343003,0.0016770861,0.0014642166,0.0008854376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006554182,0.0025974002,0.002022985,0.0022367067,0.001415835,0.004297741,0.0041019702,0.0017683611,0.0061573824],"category_scores_gemma":[0.030011807,0.0013178913,0.0023805413,0.0047123246,0.0034727098,0.0053374707,0.0023103873,0.0048959553,0.001143259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005148487,0.00024563077,0.0014699659,0.00045788163,0.00014008878,0.00014802112,0.00022920691,0.86034703,0.0029614503,0.09734231,0.006028248,0.030115338],"study_design_scores_gemma":[0.000030459927,0.000057896137,0.00021688877,0.000021089098,0.000023884799,0.000034592304,0.000040388346,0.9380585,0.0006134282,0.059975516,0.0009130945,0.000014275846],"about_ca_topic_score_codex":0.012579901,"about_ca_topic_score_gemma":0.008759027,"teacher_disagreement_score":0.012579901,"about_ca_system_score_codex":0.0063956194,"about_ca_system_score_gemma":0.0046766945,"threshold_uncertainty_score":0.046403706},"labels":[],"label_agreement":null},{"id":"W1917899534","doi":"10.1007/s10878-015-9947-x","title":"Reconfiguration of dominating sets","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Connected dominating set; Graph; Domination analysis; Control reconfiguration; Discrete mathematics; Adjacency list; Computer science","score_opus":0.02884581217723134,"score_gpt":0.30399583347759573,"score_spread":0.27515002130036437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917899534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60755014,0.0016569863,0.24410063,0.0016595831,0.00078727555,0.00034443478,0.0014378865,0.0021167079,0.14034629],"genre_scores_gemma":[0.9375559,0.0004992761,0.043354094,0.00025710705,0.00015283903,0.00009944089,0.0012044914,0.0002920231,0.016584912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991673,0.00017386973,0.00004870095,0.00025018267,0.0001357669,0.00022408526],"domain_scores_gemma":[0.997801,0.00074338994,0.00018617068,0.0006467837,0.00021451343,0.00040819455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048120023,0.00076440343,0.0010540643,0.0012892055,0.0012211063,0.0026022359,0.0012819201,0.0007821326,0.010976906],"category_scores_gemma":[0.0033725088,0.00069384044,0.0008667888,0.0012940044,0.0009191455,0.002588122,0.0017398776,0.0012391979,0.0012697327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016630728,0.00054549717,0.003006073,0.00074593385,0.0002300304,0.001332687,0.0010152897,0.17397027,0.068597086,0.4704082,0.032406636,0.2460792],"study_design_scores_gemma":[0.00017480161,0.00036791968,0.0036023983,0.00008531866,0.00012558336,0.0014761995,0.0007838272,0.28831515,0.021263028,0.64456725,0.039161433,0.00007700727],"about_ca_topic_score_codex":0.0007685939,"about_ca_topic_score_gemma":0.0009559473,"teacher_disagreement_score":0.010976906,"about_ca_system_score_codex":0.001166124,"about_ca_system_score_gemma":0.00047736353,"threshold_uncertainty_score":0.03672141},"labels":[],"label_agreement":null},{"id":"W191955849","doi":"","title":"On the Domination Number of the Product of Two Cycles.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Combinatorics; Arithmetic; Geometry","score_opus":0.015502352550200691,"score_gpt":0.3097720243543911,"score_spread":0.2942696718041904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191955849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65718,0.0054129795,0.08831775,0.0044104923,0.00065214804,0.00010811304,0.0017191294,0.00028572956,0.24191363],"genre_scores_gemma":[0.97160923,0.0016470415,0.013051296,0.00027648412,0.00043927453,0.00011824926,0.00051404536,0.00013563462,0.0122087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870384,0.00042431933,0.000074848824,0.00024201069,0.0002941692,0.00026070848],"domain_scores_gemma":[0.9817508,0.014090952,0.001431673,0.00079254585,0.0007853169,0.0011487212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001653895,0.00060017215,0.00095249654,0.0037225788,0.0018731884,0.0030237513,0.001645159,0.0012684223,0.012440633],"category_scores_gemma":[0.016084956,0.00053842727,0.00046275684,0.0024618919,0.0027740295,0.006863017,0.0018410139,0.0019094342,0.0011448539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048404327,0.00006211918,0.0038181474,0.0002705678,0.000058464404,0.00022930358,0.00052983145,0.011776709,0.0032456818,0.9311207,0.010797809,0.037606537],"study_design_scores_gemma":[0.000057321693,0.000058345882,0.0025412717,0.00011273858,0.000066060784,0.00054739317,0.00025844612,0.0366669,0.0022418872,0.9470871,0.010318221,0.000044295608],"about_ca_topic_score_codex":0.0013753638,"about_ca_topic_score_gemma":0.0017674319,"teacher_disagreement_score":0.012440633,"about_ca_system_score_codex":0.0018069992,"about_ca_system_score_gemma":0.0006179532,"threshold_uncertainty_score":0.04161805},"labels":[],"label_agreement":null},{"id":"W1924533234","doi":"10.37236/1778","title":"Decomposing Infinite 2-Connected Graphs into 3-Connected Components","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Modular decomposition; Planar graph; Chordal graph; Connected component; Indifference graph; 1-planar graph; Pathwidth; Strongly connected component; Discrete mathematics; Clique-sum; Graph; Line graph","score_opus":0.011773604596896615,"score_gpt":0.26508313271587697,"score_spread":0.25330952811898033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924533234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15028892,0.0013472609,0.800288,0.0006301034,0.00020601692,0.00019598949,0.0003880842,0.0005176685,0.046137966],"genre_scores_gemma":[0.61117464,0.0026475256,0.36535928,0.00072317396,0.000246932,0.0004499555,0.0016555582,0.00042651582,0.017316438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969447,0.000065077526,0.00002089542,0.00007696345,0.000063644504,0.000078985846],"domain_scores_gemma":[0.9994043,0.00020136582,0.000079562655,0.00010648031,0.00012895637,0.000079377576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031834262,0.00096641725,0.0005762912,0.0016528158,0.0008991332,0.0018860301,0.00079415314,0.0009691626,0.0042133927],"category_scores_gemma":[0.0012720986,0.00049018714,0.0010425901,0.0012977164,0.0018403277,0.003974408,0.0022039162,0.0015939121,0.0010199818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008541206,0.000040873347,0.00076051184,0.00019776118,0.000025800437,0.00045793207,0.0008498261,0.026376618,0.006862885,0.9159656,0.0028562855,0.04552042],"study_design_scores_gemma":[0.000011360361,0.000025023288,0.00030813902,0.000057789206,0.000018752178,0.00022096826,0.00022324038,0.035291735,0.001591659,0.9495367,0.012697354,0.000017300674],"about_ca_topic_score_codex":0.0016697159,"about_ca_topic_score_gemma":0.0019284878,"teacher_disagreement_score":0.0042133927,"about_ca_system_score_codex":0.0005973115,"about_ca_system_score_gemma":0.00058120495,"threshold_uncertainty_score":0.014095187},"labels":[],"label_agreement":null},{"id":"W1924742230","doi":"10.1007/s00493-015-3003-4","title":"Regular families of forests, antichains and duality pairs of relational structures","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Antichain; Mathematics; Homomorphism; Duality (order theory); Combinatorics; Constraint (computer-aided design); Constraint satisfaction problem; Discrete mathematics; Partially ordered set; Geometry","score_opus":0.020806861208372263,"score_gpt":0.2683903031659259,"score_spread":0.2475834419575536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924742230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57108605,0.0012931534,0.39342538,0.0009793328,0.00013107591,0.00007840153,0.0008456261,0.00043085986,0.031730138],"genre_scores_gemma":[0.93183976,0.0004861086,0.059144147,0.0002737625,0.0001352555,0.00012334912,0.00082204526,0.00012415425,0.0070512393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807847,0.00051249063,0.00013291354,0.0006502753,0.00039022195,0.00023561656],"domain_scores_gemma":[0.99443346,0.0032223496,0.0007039785,0.00057571277,0.00048931385,0.000575164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016167383,0.0004500965,0.00080944074,0.0026825836,0.0029635404,0.004470003,0.0012763524,0.001136649,0.004343745],"category_scores_gemma":[0.0054215775,0.0012059256,0.0011222835,0.0026217452,0.0035119571,0.008571616,0.0018028558,0.0021680077,0.00040121665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051085397,0.000030957537,0.0013953763,0.000039159793,0.000015279373,0.00016544804,0.0006448233,0.00080255297,0.000914352,0.98894894,0.0007155714,0.0062764306],"study_design_scores_gemma":[0.000016645603,0.000013484791,0.0006778714,0.000017307633,0.00002267687,0.00036857708,0.00027065846,0.0042770104,0.0007117638,0.99085087,0.0027594212,0.000013771635],"about_ca_topic_score_codex":0.0012200164,"about_ca_topic_score_gemma":0.0019044002,"teacher_disagreement_score":0.004470003,"about_ca_system_score_codex":0.0014593127,"about_ca_system_score_gemma":0.0007166178,"threshold_uncertainty_score":0.014531314},"labels":[],"label_agreement":null},{"id":"W1927157310","doi":"10.1109/ipps.1992.223066","title":"Efficient parallel shortest path algorithms for k-chordal graphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Shortest path problem; Chordal graph; Product (mathematics); Combinatorics; Path (computing); Longest path problem; Parallel algorithm; Computer science; Binary logarithm; K shortest path routing; Algorithm; Floyd–Warshall algorithm; Mathematics; Discrete mathematics; Graph","score_opus":0.03269908696444551,"score_gpt":0.3084834023234436,"score_spread":0.2757843153589981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927157310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039702892,0.0008556781,0.9214673,0.00064798014,0.00035246048,0.0003280697,0.00066829525,0.0047729514,0.031204293],"genre_scores_gemma":[0.19347917,0.0007008583,0.7850788,0.00013018805,0.000135703,0.00028609135,0.002244484,0.0004954911,0.017449223],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994867,0.00006443109,0.000043206688,0.0001477937,0.00018046811,0.00007727426],"domain_scores_gemma":[0.9991703,0.0002403809,0.000048503225,0.00020798652,0.00028547546,0.00004740342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003516529,0.0006958585,0.0005849668,0.0010779626,0.0011680183,0.0010861683,0.0011791144,0.0004977398,0.005419279],"category_scores_gemma":[0.0015653499,0.00033488494,0.0005580149,0.002347467,0.0003763626,0.0020146403,0.0009619994,0.0006945629,0.0022044373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005318494,0.00031812803,0.0011539313,0.00045761987,0.000085995925,0.00017680119,0.0002484744,0.16509458,0.030568162,0.07162281,0.042522367,0.68721926],"study_design_scores_gemma":[0.00013594398,0.000181768,0.000536597,0.000032786098,0.000042617055,0.0002563528,0.00022513095,0.84561515,0.025773536,0.071361616,0.055799592,0.000038992162],"about_ca_topic_score_codex":0.0076301224,"about_ca_topic_score_gemma":0.010249419,"teacher_disagreement_score":0.0076301224,"about_ca_system_score_codex":0.0013051317,"about_ca_system_score_gemma":0.0014227282,"threshold_uncertainty_score":0.01812929},"labels":[],"label_agreement":null},{"id":"W1928499748","doi":"10.1016/j.jctb.2016.07.008","title":"Non-planar extensions of subdivisions of planar graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Security Agency; National Science Foundation","keywords":"Combinatorics; Mathematics; Planar graph; Subdivision; Graph; Backslash; Planar; Lemma (botany); Discrete mathematics; Computer science","score_opus":0.013822217486434706,"score_gpt":0.27120107243894753,"score_spread":0.25737885495251284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1928499748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9062173,0.00036055644,0.03317407,0.00031240273,0.0001318699,0.00003965295,0.00016583184,0.00014578318,0.059452575],"genre_scores_gemma":[0.97124857,0.0004056563,0.009536271,0.00009275038,0.00011728012,0.000027028167,0.00034718146,0.00008845181,0.01813681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996358,0.00006284789,0.000023021566,0.00008169284,0.000114940776,0.000081692524],"domain_scores_gemma":[0.99862385,0.0004933277,0.00025835025,0.00017764453,0.00016245242,0.00028437833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028938756,0.00044384485,0.000501641,0.0011663385,0.0007927529,0.0020360383,0.0011430612,0.00061095326,0.007197276],"category_scores_gemma":[0.0021259086,0.0004375836,0.00074338546,0.0008866125,0.0014038052,0.0022067397,0.0024153406,0.0019469098,0.0006305907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016022105,0.00010567205,0.0016730617,0.000082955754,0.000018596063,0.0005826442,0.0007954966,0.0035199118,0.005817625,0.96474254,0.001382012,0.02111924],"study_design_scores_gemma":[0.00004184116,0.00006453711,0.002472119,0.00003980114,0.00003558074,0.00075708964,0.0006429205,0.011722441,0.0015577835,0.9722343,0.010412357,0.000019157098],"about_ca_topic_score_codex":0.00064724707,"about_ca_topic_score_gemma":0.0012756353,"teacher_disagreement_score":0.007197276,"about_ca_system_score_codex":0.0006050573,"about_ca_system_score_gemma":0.00030730007,"threshold_uncertainty_score":0.024077356},"labels":[],"label_agreement":null},{"id":"W1930792227","doi":"10.1002/jgt.21711","title":"Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Arboricity; Multigraph; Mathematics; Combinatorics; Degree (music); Conjecture; Dense graph; Planar graph; Bounded function; Graph; Discrete mathematics; Tree decomposition; Pathwidth; 1-planar graph; Chordal graph; Line graph","score_opus":0.01759353469542376,"score_gpt":0.2805384940187399,"score_spread":0.2629449593233162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1930792227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80272555,0.0006399363,0.18814512,0.00038775842,0.000024332749,0.000029263862,0.00018050714,0.00014274103,0.0077248644],"genre_scores_gemma":[0.9754847,0.00015491586,0.022869268,0.00007007435,0.000019543097,0.000013473046,0.00017024488,0.000014811561,0.0012028476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997998,0.000040027335,0.000010865776,0.000048503105,0.00004944512,0.0000513436],"domain_scores_gemma":[0.999121,0.0003752317,0.0001957038,0.00009209574,0.00009341792,0.0001226006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024027238,0.00023205981,0.00028122694,0.00093019294,0.0003602942,0.00064742414,0.00023068547,0.00028596527,0.0016589012],"category_scores_gemma":[0.0011100819,0.00020732608,0.00028831218,0.0005410353,0.0005540306,0.0010651544,0.00066365337,0.00041076555,0.00012798951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075128593,0.00019776169,0.015597149,0.0003888416,0.000106675485,0.002031339,0.001054276,0.16200279,0.10815718,0.62842226,0.0048915064,0.07639893],"study_design_scores_gemma":[0.00005205451,0.00010167237,0.006173496,0.00007081,0.000054613716,0.0013406764,0.00055498554,0.40503356,0.012708292,0.5674939,0.0063936706,0.000022298402],"about_ca_topic_score_codex":0.0009814337,"about_ca_topic_score_gemma":0.0017297948,"teacher_disagreement_score":0.0016589012,"about_ca_system_score_codex":0.0004094722,"about_ca_system_score_gemma":0.00020105591,"threshold_uncertainty_score":0.00554955},"labels":[],"label_agreement":null},{"id":"W194079889","doi":"","title":"On a-valuations of disconnected graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.025384215024093684,"score_gpt":0.3063423858488823,"score_spread":0.28095817082478863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194079889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48298144,0.0050252494,0.20579801,0.0043963436,0.0009868171,0.00011533358,0.0011999162,0.0004674433,0.29902947],"genre_scores_gemma":[0.9459105,0.0020571114,0.020896528,0.0006003347,0.0006542548,0.00008325773,0.0006804919,0.00018239317,0.028935134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990823,0.00032747144,0.00005762569,0.00016359643,0.0001915449,0.0001774827],"domain_scores_gemma":[0.995372,0.0025128222,0.0005143465,0.00032709088,0.00034905982,0.0009245809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011170752,0.000787284,0.0006454736,0.0036347709,0.0020660392,0.00420663,0.0010663079,0.001216669,0.009285227],"category_scores_gemma":[0.0046513733,0.0005368492,0.00088158017,0.0026205685,0.0037150155,0.0077762487,0.0030851904,0.0026931367,0.0013430006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004047017,0.00002309669,0.00044226923,0.000037464,0.000010587009,0.00012294661,0.0002000867,0.0006107432,0.0006141741,0.99062777,0.0017563063,0.0055141044],"study_design_scores_gemma":[0.000012837363,0.00001093949,0.00024136774,0.000022794637,0.0000067427995,0.00018476171,0.00014025279,0.0021264239,0.00019510947,0.993891,0.0031612485,0.0000066698517],"about_ca_topic_score_codex":0.00077924423,"about_ca_topic_score_gemma":0.0008531506,"teacher_disagreement_score":0.009285227,"about_ca_system_score_codex":0.0014017285,"about_ca_system_score_gemma":0.0004487994,"threshold_uncertainty_score":0.031062245},"labels":[],"label_agreement":null},{"id":"W194283047","doi":"","title":"Polynomial Algorithm for Finding Chromatic Sum for Unicyclic and Outerplanar Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Chromatic polynomial; Algorithm; Discrete mathematics","score_opus":0.01932628026623991,"score_gpt":0.2964231950449247,"score_spread":0.2770969147786848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194283047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15249676,0.0013589399,0.7814934,0.0021745309,0.00037049557,0.0006219254,0.0031712432,0.010356155,0.047956623],"genre_scores_gemma":[0.48645005,0.0004607607,0.48849663,0.00034965103,0.0001493168,0.0002732738,0.0048389304,0.00073356536,0.018247882],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908245,0.00014344943,0.00005949963,0.00028010548,0.0002177118,0.00021676852],"domain_scores_gemma":[0.99758685,0.0009205462,0.00018984165,0.0007298656,0.00036205092,0.00021099624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065113266,0.0009172995,0.0010010455,0.0018864853,0.0014870373,0.0022867632,0.0025339324,0.0011955446,0.01678689],"category_scores_gemma":[0.004328735,0.00044981725,0.0008450368,0.0027668036,0.00088096963,0.0034016503,0.0024643745,0.0016046392,0.004022144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018700976,0.00095795526,0.0049749943,0.0010192466,0.00027840163,0.00033283723,0.0009079526,0.039707962,0.024288421,0.093813576,0.0656954,0.76615316],"study_design_scores_gemma":[0.0010402815,0.0006185269,0.0053652567,0.00012994971,0.0004533258,0.0011388041,0.0010340875,0.57995033,0.027975151,0.34058183,0.041555356,0.00015712553],"about_ca_topic_score_codex":0.008198225,"about_ca_topic_score_gemma":0.016599746,"teacher_disagreement_score":0.01678689,"about_ca_system_score_codex":0.0017501168,"about_ca_system_score_gemma":0.003061987,"threshold_uncertainty_score":0.056157768},"labels":[],"label_agreement":null},{"id":"W1943297633","doi":"10.46298/dmtcs.2080","title":"Diversities and the Geometry of Hypergraphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Embedding; Metric (unit); Steiner tree problem; Hypergraph; Combinatorics; Set (abstract data type); Distortion (music); Relation (database); Combinatorial optimization; Discrete mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.010219233834626421,"score_gpt":0.2556408838133856,"score_spread":0.2454216499787592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943297633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6609171,0.015676493,0.18418412,0.00891033,0.001090278,0.000095250034,0.0013165807,0.00037382732,0.12743595],"genre_scores_gemma":[0.9632854,0.0050868182,0.01497924,0.00046373616,0.0013566406,0.00009049089,0.0006060073,0.00012753364,0.014004134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992224,0.0002321848,0.00003604504,0.00021961903,0.00022277138,0.000066906476],"domain_scores_gemma":[0.99766004,0.0009849282,0.0005569095,0.00015817558,0.00021366199,0.0004261749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056731136,0.00074417534,0.00086824363,0.0026026196,0.0015895679,0.0048702057,0.00065248465,0.0008945177,0.0054402426],"category_scores_gemma":[0.0036565266,0.00064021937,0.0005735218,0.0024177432,0.003420982,0.004749805,0.003708431,0.002430093,0.0007661106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003486746,0.00001401221,0.0013504635,0.00006758602,0.000024161222,0.0001319706,0.00021873598,0.008132986,0.00074292073,0.97129726,0.0037733738,0.014211651],"study_design_scores_gemma":[0.000005842695,0.000029959465,0.00096650183,0.000031640422,0.000010550747,0.00028639057,0.00014497257,0.01202648,0.0002627,0.9757117,0.010509177,0.00001411928],"about_ca_topic_score_codex":0.00086033077,"about_ca_topic_score_gemma":0.0006024767,"teacher_disagreement_score":0.0054402426,"about_ca_system_score_codex":0.001982267,"about_ca_system_score_gemma":0.0003356359,"threshold_uncertainty_score":0.018199384},"labels":[],"label_agreement":null},{"id":"W1943774235","doi":"10.1109/icpads.2004.92","title":"Wavelength assignment on bounded degree trees of rings","year":2004,"lang":"en","type":"article","venue":"International Conference on Parallel and Distributed Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Tree (set theory); Wavelength; Node (physics); Bounded function; Time complexity; Upper and lower bounds; Mathematics; Degree (music); Approximation algorithm; Routing (electronic design automation); Network topology; Disjoint sets; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Combinatorics; Computer science; Algorithm; Computer network; Physics; Optics; Telecommunications","score_opus":0.07809195675287456,"score_gpt":0.31608982907265426,"score_spread":0.2379978723197797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943774235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3289224,0.0017634723,0.64671457,0.0010032001,0.00010828064,0.00021960364,0.0005935856,0.0012713886,0.01940353],"genre_scores_gemma":[0.7279684,0.0014283088,0.26128843,0.00021421758,0.00012467004,0.00017915253,0.00070226117,0.00018914192,0.0079053715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989262,0.00032339533,0.000057735604,0.00017160366,0.00021588926,0.00030505718],"domain_scores_gemma":[0.99791163,0.0009997546,0.00035378593,0.0003609112,0.00019084536,0.0001831235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008112136,0.00040009947,0.000875504,0.00055102113,0.0010275773,0.0013189467,0.0017522991,0.0007441782,0.0032304523],"category_scores_gemma":[0.0037976112,0.00055876555,0.00053083524,0.0013052206,0.0006501256,0.0027797008,0.0015697394,0.0007701574,0.0008295113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082294416,0.00018475647,0.0013896822,0.0004879113,0.00005336679,0.0003604049,0.0004278957,0.70223904,0.021471769,0.15881354,0.010515552,0.10323322],"study_design_scores_gemma":[0.00009670462,0.00010419322,0.00056594907,0.00003838648,0.000021439138,0.00017685485,0.00013035636,0.8497317,0.0044203135,0.13536291,0.009332129,0.000019124092],"about_ca_topic_score_codex":0.0018366938,"about_ca_topic_score_gemma":0.0019635304,"teacher_disagreement_score":0.0032304523,"about_ca_system_score_codex":0.0009428634,"about_ca_system_score_gemma":0.00065276737,"threshold_uncertainty_score":0.010806918},"labels":[],"label_agreement":null},{"id":"W194649186","doi":"10.1007/978-3-642-25011-8_24","title":"On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multigraph; Combinatorics; Vertex (graph theory); Planar graph; Graph; Planar; Mathematics; Plane (geometry); Discrete mathematics; Computer science; Geometry","score_opus":0.03404041091732289,"score_gpt":0.2868589059006162,"score_spread":0.2528184949832933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194649186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27944508,0.001412592,0.6935351,0.0013088697,0.00027810136,0.00024668183,0.0005998523,0.0013036083,0.021870097],"genre_scores_gemma":[0.4802567,0.0015691741,0.48819724,0.0003402568,0.00027985254,0.000506292,0.0015986917,0.0019580352,0.025293803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931836,0.0002318086,0.000025765748,0.00016585378,0.00013321784,0.00012504696],"domain_scores_gemma":[0.9956802,0.0031681566,0.0003367449,0.0003283916,0.00022993395,0.0002565864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009394367,0.0026686685,0.0021392584,0.0011318674,0.0011338714,0.0017885477,0.0033240106,0.0022614745,0.007940022],"category_scores_gemma":[0.006456435,0.001060365,0.00094094157,0.0019931667,0.0016461562,0.0031967848,0.0022357607,0.0019564563,0.0011209704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084135093,0.00030077636,0.0015441007,0.0008101299,0.00010256772,0.00016538089,0.0002859368,0.76929367,0.015568451,0.05605982,0.010686167,0.14434166],"study_design_scores_gemma":[0.00009054776,0.00032161234,0.0009112397,0.00005311011,0.0000644299,0.00013407297,0.00017241284,0.8918104,0.0036926735,0.100480214,0.0022423058,0.000026927268],"about_ca_topic_score_codex":0.00294153,"about_ca_topic_score_gemma":0.0039994307,"teacher_disagreement_score":0.007940022,"about_ca_system_score_codex":0.0018442824,"about_ca_system_score_gemma":0.0010916279,"threshold_uncertainty_score":0.026562035},"labels":[],"label_agreement":null},{"id":"W1948783854","doi":"10.48550/arxiv.1004.3320","title":"Approximation Algorithms for Dominating Set in Disk Graphs","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Euclidean geometry; Set (abstract data type); Graph; Upper and lower bounds; Approximation algorithm; Unit disk graph; Unit disk; Running time; Discrete mathematics; Algorithm; Computer science; Vertex (graph theory); Geometry","score_opus":0.09476514679204252,"score_gpt":0.2512652688231497,"score_spread":0.1565001220311072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948783854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042745773,0.0017376911,0.9458108,0.0012145734,0.00012598986,0.00020022198,0.00057416834,0.0013786966,0.0062121134],"genre_scores_gemma":[0.45735925,0.0017769695,0.52985495,0.0004977272,0.00024109957,0.00046780644,0.001973698,0.00048448084,0.007344064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979195,0.000689748,0.00009907022,0.00048782767,0.00051853864,0.00028533704],"domain_scores_gemma":[0.99515885,0.0030820305,0.00039168878,0.0007965712,0.0002997065,0.00027112712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002238229,0.00178869,0.0023689428,0.0017153746,0.0012661996,0.0026305267,0.004349046,0.002095815,0.003801629],"category_scores_gemma":[0.011828281,0.00080468075,0.0011401724,0.003560451,0.0011366578,0.0044804257,0.00252386,0.0021624207,0.001133426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000738812,0.00033673717,0.0013159813,0.00069337554,0.0002055814,0.00015341373,0.0004292252,0.73345184,0.004255066,0.11951909,0.011932536,0.12696838],"study_design_scores_gemma":[0.00007902439,0.000066382556,0.00015702721,0.000023211293,0.00003318576,0.0001021251,0.00006080827,0.8947271,0.001202921,0.100014254,0.003522508,0.000011427804],"about_ca_topic_score_codex":0.002536935,"about_ca_topic_score_gemma":0.0027034585,"teacher_disagreement_score":0.004349046,"about_ca_system_score_codex":0.002923839,"about_ca_system_score_gemma":0.0013604836,"threshold_uncertainty_score":0.021214068},"labels":[],"label_agreement":null},{"id":"W1949878150","doi":"10.1137/1.9781611973730.114","title":"Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Chordal graph; Intersection graph; Split graph; Algorithm; Interval graph; Block graph; Time complexity; Discrete mathematics; Arc (geometry); Mathematics; Graph; Indifference graph; Line graph; 1-planar graph; Geometry","score_opus":0.03502330776170659,"score_gpt":0.2828926462636801,"score_spread":0.2478693385019735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949878150","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1476512,0.00026035513,0.83178174,0.0013696788,0.00014599391,0.00015434521,0.00060707063,0.003033834,0.014995848],"genre_scores_gemma":[0.7910792,0.00024280958,0.1990712,0.00041087577,0.00014948554,0.00014875244,0.0019695393,0.00046900802,0.006459121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753296,0.00031601219,0.00018745329,0.00088718045,0.0007075412,0.00036891457],"domain_scores_gemma":[0.9869332,0.0065755793,0.0014331122,0.0032060356,0.0012630572,0.00058905437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010091311,0.0005735201,0.0007581233,0.0010040968,0.0010413254,0.0023173552,0.0017227295,0.001408792,0.0034680744],"category_scores_gemma":[0.009445002,0.0004632315,0.0013304796,0.0012374357,0.002932621,0.004463716,0.002857125,0.0038726048,0.0011909084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004390093,0.0003053107,0.006249558,0.00044308207,0.00005363387,0.00066920696,0.0012134407,0.06093543,0.025415124,0.748663,0.010799566,0.14481369],"study_design_scores_gemma":[0.000052233474,0.00012041107,0.0010323334,0.000048062542,0.0000468889,0.00090675947,0.00028872665,0.15095624,0.028491218,0.8044151,0.013561163,0.000080775586],"about_ca_topic_score_codex":0.001148372,"about_ca_topic_score_gemma":0.00081718294,"teacher_disagreement_score":0.0034680744,"about_ca_system_score_codex":0.0013382904,"about_ca_system_score_gemma":0.0014940233,"threshold_uncertainty_score":0.011601865},"labels":[],"label_agreement":null},{"id":"W1953770551","doi":"10.37236/550","title":"Hamiltonicity of $k$-Traceable Graphs","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Hamiltonian path; Graph; Path (computing); Vertex (graph theory); Induced path; Integer (computer science); Discrete mathematics; Longest path problem; Shortest path problem; Computer science","score_opus":0.02183922895665276,"score_gpt":0.2527308645314063,"score_spread":0.23089163557475356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953770551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9508885,0.00019631647,0.0342897,0.00029101982,0.000015208453,0.000040646206,0.00037529343,0.00014042127,0.013762873],"genre_scores_gemma":[0.9908048,0.00017095308,0.005072363,0.000051699255,0.000016532287,0.00003215871,0.00030584342,0.000027962922,0.0035177711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997781,0.00003374252,0.000013130099,0.000055620607,0.000042784057,0.00007668671],"domain_scores_gemma":[0.999033,0.00045857747,0.00020974732,0.000080597485,0.000094448966,0.00012365208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001575151,0.00027830518,0.00023372986,0.0006231112,0.00055290246,0.00077762385,0.0005437417,0.00036500633,0.0034963838],"category_scores_gemma":[0.0014018781,0.00022500168,0.00031699883,0.0005710935,0.00090846163,0.0010507907,0.0006679104,0.0005794546,0.00025163288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034903162,0.00015854539,0.009837728,0.00026685518,0.000059629638,0.0014094657,0.0015564159,0.05241397,0.03566586,0.8660786,0.0039986325,0.028205158],"study_design_scores_gemma":[0.00007905785,0.00009340055,0.003760433,0.000029880239,0.000026519678,0.00049051887,0.00057292066,0.10755808,0.009619119,0.8729935,0.0047363266,0.00004034307],"about_ca_topic_score_codex":0.0033414075,"about_ca_topic_score_gemma":0.004082494,"teacher_disagreement_score":0.0034963838,"about_ca_system_score_codex":0.0007457596,"about_ca_system_score_gemma":0.00053946034,"threshold_uncertainty_score":0.011696577},"labels":[],"label_agreement":null},{"id":"W196193938","doi":"","title":"Counting rooted spanning forests in complete multipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Spanning tree; Physics","score_opus":0.02526542457220644,"score_gpt":0.28737536236066785,"score_spread":0.2621099377884614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196193938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29331118,0.0029508732,0.6518375,0.0025260227,0.0004473641,0.00027376486,0.0033167892,0.0013188043,0.044017784],"genre_scores_gemma":[0.7579636,0.0013503483,0.22068359,0.00052903953,0.00045921776,0.00028870755,0.0036092233,0.00051179883,0.014604546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998004,0.0006472479,0.0001503219,0.00040548088,0.00053624,0.00025661982],"domain_scores_gemma":[0.9877867,0.007846238,0.0011649381,0.0014020591,0.0011289589,0.0006711397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015162417,0.0005951103,0.0009890599,0.002818056,0.0013507426,0.0031576904,0.0019933518,0.0021487419,0.006686606],"category_scores_gemma":[0.020143032,0.0008170179,0.0007074808,0.0037127184,0.0011922801,0.007271178,0.0019045378,0.00155166,0.0011319434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036110374,0.0001967019,0.008333703,0.00090922654,0.00017956518,0.00039614787,0.00064339663,0.04127814,0.008798833,0.7675951,0.028746886,0.14256115],"study_design_scores_gemma":[0.00003260231,0.00004059339,0.0017460891,0.0001086379,0.00006714366,0.0005673473,0.00022263985,0.13090244,0.003892338,0.85300654,0.009389851,0.000023841536],"about_ca_topic_score_codex":0.0009751516,"about_ca_topic_score_gemma":0.002288145,"teacher_disagreement_score":0.006686606,"about_ca_system_score_codex":0.0008950065,"about_ca_system_score_gemma":0.0005664582,"threshold_uncertainty_score":0.022368908},"labels":[],"label_agreement":null},{"id":"W1963693997","doi":"10.1016/j.ejc.2013.06.043","title":"Graph partitions with prescribed patterns","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Induced subgraph isomorphism problem; Graph homomorphism; Homomorphism; Partition (number theory); Induced subgraph; Discrete mathematics; Graph; Distance-hereditary graph; Factor-critical graph; Line graph; Voltage graph","score_opus":0.01618968927603948,"score_gpt":0.23112680411656777,"score_spread":0.2149371148405283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963693997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47814095,0.000365262,0.3529273,0.0019196556,0.000503138,0.0004233535,0.0016450434,0.0017274477,0.16234788],"genre_scores_gemma":[0.8314406,0.0004022971,0.11654313,0.0005991432,0.00015980251,0.0005033867,0.001971316,0.0008924203,0.04748795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981731,0.00039225596,0.00014557206,0.0004035459,0.00051033276,0.00037513784],"domain_scores_gemma":[0.9956874,0.0013169401,0.00039287185,0.0013974945,0.00063390884,0.00057134253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077918376,0.00068367337,0.0010438473,0.0017649997,0.0025224222,0.003495427,0.0014228534,0.0019406944,0.015830934],"category_scores_gemma":[0.0058237268,0.0009390863,0.0013441541,0.0018462024,0.0024360523,0.0037291364,0.0035073245,0.00222069,0.0032501472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019680281,0.000079882644,0.0007583366,0.0001083916,0.000020910937,0.00029281838,0.00046044597,0.0026353844,0.0048500253,0.9687008,0.004832946,0.017063096],"study_design_scores_gemma":[0.000060434668,0.000035432968,0.00050663523,0.000033893117,0.000021648731,0.00043947165,0.00025811157,0.012198521,0.00302404,0.9763198,0.0070838844,0.000018197232],"about_ca_topic_score_codex":0.0008148483,"about_ca_topic_score_gemma":0.0013985138,"teacher_disagreement_score":0.015830934,"about_ca_system_score_codex":0.0010555584,"about_ca_system_score_gemma":0.0010267837,"threshold_uncertainty_score":0.05295974},"labels":[],"label_agreement":null},{"id":"W1964031838","doi":"10.1007/s00493-011-1687-5","title":"Packing directed circuits exactly","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Cardinality (data modeling); Combinatorics; Mathematics; Set (abstract data type); Electronic circuit; Characterization (materials science); Property (philosophy); Discrete mathematics; Minor (academic); Computer science; Law","score_opus":0.05387108488223161,"score_gpt":0.27160837928300036,"score_spread":0.21773729440076875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964031838","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3764549,0.0011418387,0.2360365,0.0017137466,0.0009271316,0.00026619557,0.0011832973,0.0027835122,0.37949282],"genre_scores_gemma":[0.84101,0.000994605,0.0771222,0.0013978145,0.00029260412,0.0002225813,0.0019012915,0.001116571,0.07594236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899083,0.00016746768,0.000040454666,0.00023129239,0.00029774816,0.000272147],"domain_scores_gemma":[0.9987387,0.00046406337,0.00008880728,0.0004915656,0.000108202454,0.00010858339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000265734,0.0011076456,0.0012309755,0.000822627,0.0014044531,0.0030905204,0.0012361058,0.0018040051,0.019583764],"category_scores_gemma":[0.0027639477,0.0009808103,0.0008080802,0.0018896933,0.0011946578,0.0043142247,0.0023901102,0.0024741832,0.00353612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023992157,0.0002505789,0.0007177956,0.0003480387,0.00007296463,0.0003165198,0.0005064586,0.012688316,0.014491646,0.85247064,0.025322113,0.092574984],"study_design_scores_gemma":[0.00007957097,0.000071778006,0.0005933608,0.00006971268,0.000063232386,0.00037910914,0.00028668626,0.032821197,0.00974415,0.9318027,0.024063852,0.0000246212],"about_ca_topic_score_codex":0.00079608336,"about_ca_topic_score_gemma":0.0015509076,"teacher_disagreement_score":0.019583764,"about_ca_system_score_codex":0.0009957269,"about_ca_system_score_gemma":0.00057810225,"threshold_uncertainty_score":0.06551421},"labels":[],"label_agreement":null},{"id":"W1964148783","doi":"10.1016/j.disc.2007.08.052","title":"Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Steiner tree problem; Connectivity; Neighbourhood (mathematics); Discrete mathematics; Graph; Induced subgraph","score_opus":0.015517588845970518,"score_gpt":0.28714373773133084,"score_spread":0.2716261488853603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964148783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8923189,0.0004739415,0.06384276,0.001002766,0.000085894186,0.000045907935,0.00085978396,0.00012710897,0.041242912],"genre_scores_gemma":[0.96727544,0.0004417405,0.018277498,0.00022079158,0.00008437787,0.00006914175,0.00077957887,0.000057059497,0.012794313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994061,0.000109568005,0.000040344003,0.00013306813,0.000190292,0.000120561475],"domain_scores_gemma":[0.997471,0.0012423798,0.00054107764,0.0002000103,0.00021126587,0.00033429332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050173135,0.00041704852,0.00080992107,0.0017373775,0.0022941849,0.0026123493,0.001315352,0.0011734745,0.0072339484],"category_scores_gemma":[0.0023754984,0.0006849321,0.0006559664,0.0030778311,0.0022076461,0.0035896522,0.0016416063,0.0015299531,0.00049490365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001324493,0.00005057229,0.0016134212,0.000077995144,0.000020240543,0.00024925,0.0005746511,0.008117842,0.0018080364,0.9773907,0.001648664,0.008316214],"study_design_scores_gemma":[0.000055101315,0.000043711116,0.0022652624,0.000031046944,0.00004919867,0.0006545444,0.0006566523,0.021260254,0.0021214357,0.96797377,0.0048647616,0.000024258188],"about_ca_topic_score_codex":0.0019635004,"about_ca_topic_score_gemma":0.003255436,"teacher_disagreement_score":0.0072339484,"about_ca_system_score_codex":0.0014554067,"about_ca_system_score_gemma":0.0006434731,"threshold_uncertainty_score":0.024199963},"labels":[],"label_agreement":null},{"id":"W1964296470","doi":"10.1016/s0012-365x(00)00055-8","title":"Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Digraph; Combinatorics; Mathematics; Bipartite graph; Path (computing); Discrete mathematics; Graph; Computer science; Quantum","score_opus":0.02621749155710442,"score_gpt":0.29682061700021123,"score_spread":0.27060312544310683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964296470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8836168,0.00022379404,0.10110854,0.00052631414,0.0000365061,0.00007676248,0.0007713869,0.00018727226,0.013452534],"genre_scores_gemma":[0.9619635,0.00029280546,0.0303968,0.00017500126,0.000036708712,0.00013507479,0.0010670292,0.00007503604,0.005858053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960715,0.00009581804,0.000029283055,0.000101316815,0.000076865195,0.00008959701],"domain_scores_gemma":[0.9959455,0.0022500574,0.00058979227,0.00024368048,0.00037767357,0.0005932811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044551195,0.00041126745,0.00053912593,0.00116163,0.0015613054,0.0016934855,0.00080044084,0.0008317045,0.00446617],"category_scores_gemma":[0.0031889372,0.0009096148,0.0005611371,0.0014984887,0.0009482712,0.0022873648,0.0014804848,0.0011201873,0.0003949405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042757456,0.00015230599,0.0057019866,0.0004741249,0.00011512129,0.00089301483,0.0013953737,0.026707686,0.017061995,0.917976,0.0035972507,0.025497483],"study_design_scores_gemma":[0.000055777982,0.00006632345,0.002850687,0.00005177358,0.00006418439,0.00040021705,0.0005032716,0.05963918,0.0036525764,0.9293943,0.0033015308,0.000020209964],"about_ca_topic_score_codex":0.0008252945,"about_ca_topic_score_gemma":0.0019379125,"teacher_disagreement_score":0.00446617,"about_ca_system_score_codex":0.0006759041,"about_ca_system_score_gemma":0.00047434738,"threshold_uncertainty_score":0.014940858},"labels":[],"label_agreement":null},{"id":"W1964336276","doi":"10.1007/s00373-007-0712-5","title":"On the Density of Trigraph Homomorphisms","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Order (exchange); Graph homomorphism; Combinatorics; Algebra homomorphism; Discrete mathematics; Graph; Line graph; Voltage graph","score_opus":0.016357687131862527,"score_gpt":0.24953558173241772,"score_spread":0.23317789460055519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964336276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59492606,0.0039383117,0.31336132,0.00794992,0.0004961725,0.00009656012,0.0008228327,0.00089485914,0.07751398],"genre_scores_gemma":[0.9686261,0.002050113,0.017687678,0.00058208965,0.00083327864,0.00013060067,0.00047117192,0.000222902,0.009396194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979791,0.0008921662,0.00008292035,0.00030126068,0.00048233825,0.0002623133],"domain_scores_gemma":[0.9591371,0.033579856,0.0015248606,0.0020268334,0.0017426134,0.0019888121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027941042,0.00072439836,0.0018911003,0.004075898,0.0027471075,0.004089557,0.0024932364,0.0022097297,0.011245769],"category_scores_gemma":[0.033765867,0.0012825815,0.00080935477,0.0036658796,0.006214881,0.012128531,0.004089425,0.0035251034,0.00082773797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006513272,0.000036749872,0.00088920287,0.00007035532,0.000008968062,0.000057803652,0.00034068918,0.002600625,0.00035004845,0.9874721,0.001538065,0.006570295],"study_design_scores_gemma":[0.000012039286,0.000012757904,0.00039017486,0.000023894348,0.000009347056,0.00011383039,0.000104469,0.016834743,0.00021138908,0.98145735,0.0008162785,0.000013787626],"about_ca_topic_score_codex":0.0021445162,"about_ca_topic_score_gemma":0.0015227341,"teacher_disagreement_score":0.011245769,"about_ca_system_score_codex":0.0020378248,"about_ca_system_score_gemma":0.00090710097,"threshold_uncertainty_score":0.037620783},"labels":[],"label_agreement":null},{"id":"W1964476238","doi":"10.1016/s0012-365x(03)00302-9","title":"On i−-ER-critical graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of South Africa","keywords":"Combinatorics; Mathematics; Corollary; Discrete mathematics; Indifference graph; Enhanced Data Rates for GSM Evolution; Graph; Domination analysis; Computer science; Vertex (graph theory)","score_opus":0.02765724729133736,"score_gpt":0.3274778824452344,"score_spread":0.29982063515389706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964476238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47791627,0.0012855937,0.11119896,0.0036002952,0.00051813526,0.00023484528,0.00085070264,0.00055559684,0.40383962],"genre_scores_gemma":[0.9122685,0.0011981202,0.018111952,0.0012091633,0.00033536096,0.00014995274,0.0010463871,0.00029791362,0.06538268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995956,0.000082824336,0.000014705835,0.0000989953,0.0000736369,0.00013434808],"domain_scores_gemma":[0.99840397,0.00053658284,0.00032179023,0.00013991045,0.00023929297,0.00035837985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001241,0.0010323161,0.0007217093,0.002996673,0.002220411,0.0022087859,0.0010593013,0.0010377449,0.016929224],"category_scores_gemma":[0.0021286001,0.00046424512,0.00066562364,0.0012718417,0.0019901018,0.0037371116,0.0020384213,0.002106969,0.0017203309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007435037,0.000022860228,0.00024908304,0.000075303375,0.000007017965,0.00014180013,0.00019599232,0.0010558997,0.0014035917,0.9891093,0.003215209,0.0044494695],"study_design_scores_gemma":[0.000027714801,0.000021033678,0.00028475464,0.000045169985,0.0000118721,0.00016766143,0.00025412635,0.0035445709,0.0010860551,0.9899502,0.0045963665,0.000010521027],"about_ca_topic_score_codex":0.0011877245,"about_ca_topic_score_gemma":0.0012945376,"teacher_disagreement_score":0.016929224,"about_ca_system_score_codex":0.0011848747,"about_ca_system_score_gemma":0.000447505,"threshold_uncertainty_score":0.05663395},"labels":[],"label_agreement":null},{"id":"W1964689736","doi":"10.1007/s10107-010-0384-4","title":"The master equality polyhedron with multiple rows","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subadditivity; Polyhedron; Mathematics; Row; Combinatorics; Vertex (graph theory); Submodular set function; Duality (order theory); Discrete mathematics; Graph; Computer science","score_opus":0.03564288285088745,"score_gpt":0.30824950322159844,"score_spread":0.272606620370711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964689736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11674342,0.0005033241,0.58860695,0.0061832834,0.000628465,0.00017207758,0.0016166309,0.00052650715,0.28501928],"genre_scores_gemma":[0.7041756,0.0006435313,0.16897629,0.001387916,0.0006592422,0.00033746986,0.0014704373,0.00057663606,0.12177296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989121,0.0002571214,0.000046202582,0.00026872364,0.00029303817,0.0002228556],"domain_scores_gemma":[0.9987225,0.00046979406,0.00011884123,0.00029223415,0.0002043755,0.0001921639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008002292,0.0005365632,0.0011473611,0.0007216278,0.0017475123,0.0036130766,0.0018041829,0.0014036295,0.032996595],"category_scores_gemma":[0.0037527508,0.0006548773,0.0008146538,0.0010848168,0.0020803816,0.0055682845,0.0025297645,0.0045413193,0.003694736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005985292,0.000033574153,0.00009647834,0.00005043924,0.000009041628,0.000054084256,0.00007820129,0.0025175144,0.0005419571,0.97635263,0.007335469,0.012870775],"study_design_scores_gemma":[0.000023708448,0.000021259251,0.000108689856,0.000018200517,0.000005792423,0.0000847829,0.0000832054,0.015294814,0.0008482973,0.9753421,0.00815721,0.000011965504],"about_ca_topic_score_codex":0.0008874946,"about_ca_topic_score_gemma":0.0009078013,"teacher_disagreement_score":0.032996595,"about_ca_system_score_codex":0.0008779688,"about_ca_system_score_gemma":0.00097470806,"threshold_uncertainty_score":0.11038458},"labels":[],"label_agreement":null},{"id":"W1964729600","doi":"10.1016/j.ejc.2007.11.007","title":"Majority functions on structures with finite duality","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of the Fraser Valley","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Unanimity; Duality (order theory); Combinatorics; Bounded function; Strong duality; Path (computing); Discrete mathematics; Pure mathematics; Optimization problem; Mathematical analysis; Mathematical optimization","score_opus":0.03352257192047073,"score_gpt":0.25745444317490584,"score_spread":0.22393187125443512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964729600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5269274,0.0007333211,0.33752808,0.0034025107,0.00049243413,0.00012342066,0.0004182452,0.00078157644,0.12959301],"genre_scores_gemma":[0.92692024,0.00046446288,0.03503135,0.0005889801,0.00040271482,0.00017582338,0.00032392854,0.00035196534,0.0357404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723166,0.0008315927,0.0001492443,0.0005269992,0.00054994517,0.0007106388],"domain_scores_gemma":[0.9942889,0.003270458,0.0004373073,0.00069699937,0.00051117863,0.0007950877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022796937,0.0010358928,0.001942206,0.0035426382,0.0046656295,0.006534788,0.002068036,0.0024633924,0.008098379],"category_scores_gemma":[0.0066178124,0.0011891548,0.001938361,0.0027324127,0.0058711274,0.014010172,0.0070422,0.004936938,0.0015796933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027179734,0.000013420983,0.00007214331,0.000011824678,0.000002951383,0.0000433727,0.00014015616,0.00019296189,0.00024747962,0.99697745,0.0002677779,0.002003319],"study_design_scores_gemma":[0.0000107494525,0.000007893585,0.000042639567,0.000008038278,0.000006637334,0.00007056211,0.000072562165,0.0010924789,0.00032849074,0.9973923,0.0009601399,0.0000075672174],"about_ca_topic_score_codex":0.00073522766,"about_ca_topic_score_gemma":0.0006330259,"teacher_disagreement_score":0.008098379,"about_ca_system_score_codex":0.0023221062,"about_ca_system_score_gemma":0.0009259753,"threshold_uncertainty_score":0.027091801},"labels":[],"label_agreement":null},{"id":"W1964757115","doi":"10.1016/j.jctb.2007.09.002","title":"Generating weakly 4-connected matroids","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Graphic matroid; Oriented matroid; Matroid partitioning; Element (criminal law); Minor (academic); Discrete mathematics","score_opus":0.011170585007555882,"score_gpt":0.27695689597859524,"score_spread":0.2657863109710394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964757115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83528984,0.0002469857,0.08211932,0.0012395526,0.00018732266,0.00013851364,0.00051351084,0.0003288501,0.07993604],"genre_scores_gemma":[0.9285415,0.00021360227,0.02544776,0.00030438614,0.00016799799,0.00016616225,0.0008863474,0.00022776128,0.044044532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953604,0.00013188401,0.00002801358,0.000071779556,0.00013326363,0.00009905134],"domain_scores_gemma":[0.99833125,0.0008150092,0.00019362383,0.00016403472,0.00021783709,0.00027832814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000457503,0.0008288058,0.0007464528,0.0017051948,0.0015247356,0.003065067,0.0013519607,0.001434607,0.014794969],"category_scores_gemma":[0.0022064648,0.0007135029,0.00090879924,0.0013180219,0.0011494915,0.0025490422,0.0028106892,0.0020414684,0.0015229572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013851513,0.00009589787,0.0009821599,0.00008517579,0.000019912946,0.0002376333,0.00058855425,0.0033707942,0.00616475,0.9762838,0.0024000732,0.009632749],"study_design_scores_gemma":[0.000044756325,0.000032047337,0.00045078178,0.000020641648,0.000023071518,0.00021264992,0.00024399762,0.01959157,0.0029593455,0.9730014,0.0034061547,0.000013640487],"about_ca_topic_score_codex":0.00029729842,"about_ca_topic_score_gemma":0.000713696,"teacher_disagreement_score":0.014794969,"about_ca_system_score_codex":0.0008720198,"about_ca_system_score_gemma":0.000332148,"threshold_uncertainty_score":0.049494147},"labels":[],"label_agreement":null},{"id":"W1964852627","doi":"10.1007/s10107-012-0626-8","title":"A stabilized structured Dantzig–Wolfe decomposition method","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Polyhedron; Column generation; Mathematics; Decomposition; Mathematical optimization; Extreme point; Variable (mathematics); Linear programming; Scheme (mathematics); Decomposition method (queueing theory); Combinatorics; Discrete mathematics","score_opus":0.035062206351621106,"score_gpt":0.38205921895953326,"score_spread":0.34699701260791216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964852627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042243674,0.00013121664,0.9858803,0.00014740948,0.00013291326,0.00003334774,0.000050687428,0.00008659221,0.009313216],"genre_scores_gemma":[0.18708129,0.000637017,0.7703568,0.0004934198,0.00028722847,0.00044432413,0.00037595886,0.0004339807,0.039890002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976844,0.000092856855,0.0000071766913,0.00003547636,0.00007628849,0.000019813418],"domain_scores_gemma":[0.99975985,0.00006851845,0.000017202414,0.000045557586,0.00007503831,0.000033796718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053900905,0.00077085604,0.0006932833,0.00085282105,0.000501046,0.00086993043,0.00096879527,0.0011082967,0.008842523],"category_scores_gemma":[0.0012048067,0.00042469066,0.00069845567,0.00060952595,0.00066683674,0.0009349813,0.0014065806,0.0015484587,0.0026687752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096030926,0.00013853626,0.00020282225,0.00015633808,0.00006255697,0.00009303439,0.00010348996,0.121562146,0.0116692595,0.7420187,0.010536228,0.11336097],"study_design_scores_gemma":[0.000031257794,0.000041248804,0.00007126991,0.000025123962,0.00001538867,0.00004942988,0.000018428686,0.7358601,0.0016756987,0.2546248,0.0075736702,0.000013588175],"about_ca_topic_score_codex":0.00041307407,"about_ca_topic_score_gemma":0.00061426644,"teacher_disagreement_score":0.008842523,"about_ca_system_score_codex":0.00031147312,"about_ca_system_score_gemma":0.00063572783,"threshold_uncertainty_score":0.02958119},"labels":[],"label_agreement":null},{"id":"W1964864950","doi":"10.1006/jctb.2001.2090","title":"Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Matching (statistics); Cubic graph; Lattice (music); Graph; Discrete mathematics; Line graph; Voltage graph; Physics","score_opus":0.01904510044783211,"score_gpt":0.2777941096068416,"score_spread":0.2587490091590095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964864950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63363844,0.00066425215,0.30003443,0.00079756184,0.00015992134,0.00013795328,0.0008968016,0.0004692073,0.063201495],"genre_scores_gemma":[0.8974683,0.0005266877,0.08341492,0.00021316219,0.0001334561,0.0001379148,0.0012267585,0.00024625962,0.016632535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994153,0.00013011109,0.000029637073,0.00008895783,0.000148986,0.00018694303],"domain_scores_gemma":[0.9990478,0.00028012623,0.000117568925,0.00017392672,0.00013974977,0.00024084293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066595356,0.00059852924,0.0009460688,0.0013583843,0.0009307598,0.0030832877,0.0011118753,0.0009425809,0.00940363],"category_scores_gemma":[0.0021875384,0.0005659698,0.00075731816,0.0012263334,0.0011566778,0.0025908242,0.0017095137,0.001953574,0.0013425447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034406118,0.00016969115,0.00053007144,0.000102646845,0.000022460761,0.00008546362,0.00032963682,0.01333089,0.008110925,0.93507665,0.0048285243,0.03706901],"study_design_scores_gemma":[0.00006116335,0.00005595904,0.0002461334,0.000022955053,0.00001745193,0.000070344024,0.00025572794,0.04322767,0.0020613663,0.95085305,0.0031133383,0.0000148536965],"about_ca_topic_score_codex":0.0006286872,"about_ca_topic_score_gemma":0.0012156727,"teacher_disagreement_score":0.00940363,"about_ca_system_score_codex":0.00090312056,"about_ca_system_score_gemma":0.0005454578,"threshold_uncertainty_score":0.03145826},"labels":[],"label_agreement":null},{"id":"W1965667139","doi":"10.1137/110847585","title":"A Local Strengthening of Reed's $\\omega$, $\\Delta$, $\\chi$ Conjecture for Quasi-line Graphs","year":2013,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Omega; Conjecture; Combinatorics; Mathematics; Line (geometry); Mathematical proof; Graph; Line graph; Discrete mathematics; Physics; Geometry","score_opus":0.03564674079192311,"score_gpt":0.3243638320159371,"score_spread":0.288717091224014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965667139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41727892,0.0011662906,0.49595043,0.014945792,0.00051508716,0.000321848,0.0013912747,0.0047982363,0.063632004],"genre_scores_gemma":[0.8808884,0.0007819036,0.09985067,0.00238802,0.0005042299,0.0003209965,0.0013360991,0.00049583433,0.013433838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788624,0.00056790415,0.00008904649,0.00079425174,0.0003351643,0.0003272526],"domain_scores_gemma":[0.9884305,0.0061392,0.00075336715,0.0032196618,0.0008654593,0.00059172267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024579524,0.0011438347,0.0013681048,0.0008076206,0.0019273664,0.002428071,0.0028637524,0.001590907,0.01649605],"category_scores_gemma":[0.010262716,0.0010230527,0.0017074683,0.0010635812,0.003258049,0.0106664905,0.0040012035,0.0062605953,0.0026651009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019026289,0.00056141557,0.009931533,0.0017977344,0.00021135664,0.0010220095,0.00232353,0.06713321,0.062043373,0.67399853,0.050308555,0.12876622],"study_design_scores_gemma":[0.00030904374,0.0005321828,0.004865034,0.00022553354,0.00020814767,0.0012773058,0.0012788001,0.2622177,0.038010374,0.6542385,0.03666041,0.00017682336],"about_ca_topic_score_codex":0.0025327695,"about_ca_topic_score_gemma":0.0033174877,"teacher_disagreement_score":0.01649605,"about_ca_system_score_codex":0.0017086407,"about_ca_system_score_gemma":0.0014388409,"threshold_uncertainty_score":0.05518484},"labels":[],"label_agreement":null},{"id":"W1965799704","doi":"10.1016/j.dam.2012.02.004","title":"On edge-sets of bicliques in graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Simon Fraser University","funders":"Secretaría de Ciencia y Técnica, Universidad de Buenos Aires; Natural Sciences and Engineering Research Council of Canada; Fondation Sciences Mathématiques de Paris; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Combinatorics; Hypergraph; Mathematics; Bipartite graph; Complete bipartite graph; Intersection graph; Discrete mathematics; Graph; Line graph","score_opus":0.026164911057218455,"score_gpt":0.31298894050997234,"score_spread":0.28682402945275387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965799704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6613229,0.0026015714,0.20143881,0.0036649904,0.00043569988,0.00020350292,0.0017528633,0.0003448761,0.1282347],"genre_scores_gemma":[0.87366253,0.0021602914,0.084698096,0.0011262313,0.0006647338,0.00035748215,0.002456305,0.0003642927,0.03450997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983804,0.0004826086,0.0001062904,0.00030987262,0.00041024838,0.00031055245],"domain_scores_gemma":[0.9932192,0.0037770027,0.0007768039,0.0005110999,0.0007315541,0.0009843293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011514582,0.0011355571,0.002076896,0.004665147,0.005754798,0.0062674168,0.0037645805,0.0028535668,0.012019763],"category_scores_gemma":[0.0074544987,0.0016210806,0.0016107261,0.0051996857,0.004484268,0.008062388,0.0041418793,0.004480223,0.0014069766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012973322,0.0000637284,0.0008711899,0.00012936135,0.000021056505,0.0001214152,0.00062726124,0.0050150114,0.0006893684,0.9819432,0.0027361638,0.007652633],"study_design_scores_gemma":[0.000018352303,0.000016720594,0.0004184688,0.000055805893,0.000013122906,0.00008881202,0.00028737224,0.01189223,0.00018216527,0.9847712,0.0022420106,0.000013729701],"about_ca_topic_score_codex":0.004116023,"about_ca_topic_score_gemma":0.005220777,"teacher_disagreement_score":0.012019763,"about_ca_system_score_codex":0.002258536,"about_ca_system_score_gemma":0.0008004256,"threshold_uncertainty_score":0.04021007},"labels":[],"label_agreement":null},{"id":"W1966205566","doi":"10.1007/s00373-011-1072-8","title":"On Cartesian Product of Factor-Critical Graphs","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Factor graph; Graph; Discrete mathematics; Factor (programming language); Product (mathematics); Cartesian coordinate system; Computer science; Geometry; Algorithm","score_opus":0.03510544318309315,"score_gpt":0.27590548118175523,"score_spread":0.24080003799866206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966205566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6409417,0.00223757,0.22430488,0.0011362088,0.00034871022,0.00012764391,0.0005054767,0.0005682244,0.12982963],"genre_scores_gemma":[0.9334419,0.0012790299,0.036269415,0.00030036984,0.00027879892,0.00008196125,0.00081389176,0.00028791072,0.027246743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908566,0.00024147626,0.000046922753,0.0002608425,0.0001894422,0.00017558341],"domain_scores_gemma":[0.99609286,0.00191478,0.00046522255,0.00034361507,0.0006076361,0.00057592243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012570651,0.0010651113,0.0012118067,0.0033526837,0.0021711416,0.0029139898,0.0012091058,0.00097620615,0.008883497],"category_scores_gemma":[0.004387491,0.00094556186,0.0010612918,0.0023720688,0.0038237441,0.005548438,0.0027423056,0.0018782538,0.0009438485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006321184,0.000016047748,0.0004535444,0.000045634675,0.000008738675,0.00013572177,0.0005192026,0.00085004594,0.0005176255,0.99267596,0.0011466666,0.0035676088],"study_design_scores_gemma":[0.000012685984,0.000017759958,0.0002520426,0.000018325922,0.000014340488,0.00014812032,0.0001668692,0.0023963258,0.00031464823,0.99380916,0.002840285,0.000009477237],"about_ca_topic_score_codex":0.0022509827,"about_ca_topic_score_gemma":0.002451317,"teacher_disagreement_score":0.008883497,"about_ca_system_score_codex":0.0013706614,"about_ca_system_score_gemma":0.00058032863,"threshold_uncertainty_score":0.02971828},"labels":[],"label_agreement":null},{"id":"W1967091137","doi":"10.7151/dmgt.1238","title":"On dominating the Cartesian product of a graph and K <sub>2</sub>","year":2004,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Graph; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.011147351217330617,"score_gpt":0.25500146980566574,"score_spread":0.2438541185883351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967091137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5511048,0.007883313,0.11341022,0.014023678,0.0023931696,0.00010082069,0.00052699156,0.0002491024,0.310308],"genre_scores_gemma":[0.9025605,0.0041720495,0.034426898,0.0023249392,0.0018807153,0.00013859259,0.00061455154,0.00029365526,0.05358821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878925,0.0005276798,0.000052861164,0.0003483775,0.00014070013,0.00014107229],"domain_scores_gemma":[0.9958008,0.0025781053,0.0003449213,0.0003618031,0.0004836585,0.00043071355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020092155,0.0009538203,0.0010727099,0.002292511,0.0026021677,0.0036286644,0.001051,0.0013248665,0.006074784],"category_scores_gemma":[0.004322845,0.00092157326,0.0012153336,0.0021510106,0.0063853366,0.008142967,0.0027052797,0.0036512287,0.0007842548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025157336,0.000007855957,0.00016607739,0.000033163375,0.0000050367958,0.000049382288,0.00042944503,0.00031606396,0.00020895097,0.995989,0.0013634576,0.001406456],"study_design_scores_gemma":[0.000010190748,0.000019080468,0.00032215062,0.000018486546,0.000013057369,0.00014556083,0.00020149887,0.0014834991,0.00014767665,0.99209,0.005539988,0.000008918477],"about_ca_topic_score_codex":0.0027742498,"about_ca_topic_score_gemma":0.0023466628,"teacher_disagreement_score":0.006074784,"about_ca_system_score_codex":0.0021537459,"about_ca_system_score_gemma":0.0008267825,"threshold_uncertainty_score":0.020322204},"labels":[],"label_agreement":null},{"id":"W1968027460","doi":"10.1016/s0166-218x(02)00418-3","title":"Maximum independent set and maximum clique algorithms for overlap graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Chordal graph; Mathematics; Combinatorics; Maximal independent set; Split graph; Indifference graph; Treewidth; Independent set; Clique-sum; Pathwidth; Discrete mathematics; Cograph; Vertex (graph theory); Clique problem; 1-planar graph; Graph; Line graph","score_opus":0.030238746495345224,"score_gpt":0.3033645190743955,"score_spread":0.27312577257905024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968027460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06161339,0.0012291217,0.914891,0.0015455481,0.0001678283,0.00038797146,0.0007180913,0.0013344306,0.018112589],"genre_scores_gemma":[0.3242281,0.00091453444,0.65829223,0.00052856654,0.0005067309,0.0010700391,0.0023294266,0.0008447275,0.011285646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947212,0.002057042,0.00020017658,0.0010241102,0.0013991854,0.0005983114],"domain_scores_gemma":[0.97819877,0.014825523,0.0012030757,0.0033778667,0.0013150735,0.0010797232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050201635,0.001976375,0.0031918064,0.003314467,0.0032198387,0.004295709,0.0075402907,0.0030620557,0.008267081],"category_scores_gemma":[0.025127508,0.0018797679,0.0028286844,0.005920014,0.0027364984,0.01208439,0.0065255715,0.005663151,0.0017040644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023261167,0.0012478592,0.00298593,0.0009568576,0.00035570937,0.00012393012,0.0010848864,0.20174453,0.0041522994,0.4615447,0.024699515,0.2987777],"study_design_scores_gemma":[0.00022432792,0.00011978368,0.00062181463,0.00007380448,0.00013341049,0.00011360214,0.00017756276,0.58502984,0.0033212472,0.4045855,0.005554794,0.00004424138],"about_ca_topic_score_codex":0.0027155033,"about_ca_topic_score_gemma":0.0056945053,"teacher_disagreement_score":0.008267081,"about_ca_system_score_codex":0.002878652,"about_ca_system_score_gemma":0.0042171115,"threshold_uncertainty_score":0.027656138},"labels":[],"label_agreement":null},{"id":"W1968677127","doi":"10.1016/j.jctb.2004.09.006","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>Δ</mml:mi><mml:mo>-</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-critical graphs","year":2004,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Microsoft (Canada); University of Toronto","funders":"","keywords":"Clique; Algorithm; Graph; Combinatorics; Mathematics; Discrete mathematics; Computer science","score_opus":0.016637711207507806,"score_gpt":0.2627129415723882,"score_spread":0.2460752303648804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968677127","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017273782,0.00035178207,0.11164185,0.0061108447,0.0017065878,0.00029343675,0.08900287,0.10077862,0.6883866],"genre_scores_gemma":[0.024949435,0.0012927442,0.080290824,0.0021129379,0.00086318376,0.0005056437,0.10883717,0.09023342,0.6909147],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961203,0.000057070505,0.000036332418,0.000066024324,0.00018135084,0.000047144527],"domain_scores_gemma":[0.99814534,0.00048175492,0.0001250339,0.00041133244,0.000663096,0.00017335181],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058621564,0.0012672214,0.0009093544,0.0022363353,0.0010990012,0.005176947,0.0026382755,0.0014340476,0.667536],"category_scores_gemma":[0.0041460744,0.0009496798,0.00079950213,0.0032109027,0.0006604292,0.0055859294,0.001906819,0.0027649044,0.5590368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042896267,0.000023176513,0.000108364926,0.0001341962,0.000004250013,0.000037991198,0.000073465744,0.00022579354,0.0008160557,0.03103198,0.93440396,0.03309777],"study_design_scores_gemma":[0.000030528725,0.000007943437,0.00036671507,0.00005305611,0.000004412385,0.00011936383,0.00005621012,0.0015551724,0.0028655424,0.021758236,0.97315717,0.000025574518],"about_ca_topic_score_codex":0.00685629,"about_ca_topic_score_gemma":0.0076473216,"teacher_disagreement_score":0.667536,"about_ca_system_score_codex":0.0023084064,"about_ca_system_score_gemma":0.0010446094,"threshold_uncertainty_score":0.4742195},"labels":[],"label_agreement":null},{"id":"W1968959377","doi":"10.1016/j.disopt.2005.10.007","title":"How to recycle your facets","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Educational Foundation of America; HEC Montréal; Belgian American Educational Foundation","keywords":"Facet (psychology); Polytope; Mathematics; Construct (python library); Combinatorics; Polyhedral combinatorics; Mathematical optimization; Computer science; Geometry; Psychology","score_opus":0.017486512446671036,"score_gpt":0.2802205927815007,"score_spread":0.26273408033482964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968959377","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023853617,0.0028160156,0.62104917,0.030123971,0.009185428,0.00040883635,0.0013925718,0.009763449,0.30140695],"genre_scores_gemma":[0.18265446,0.0042150407,0.47864628,0.008103607,0.0017209315,0.00036964237,0.0018442458,0.009646675,0.31279913],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989737,0.00018410612,0.000058203183,0.00013124484,0.0004909988,0.00016176156],"domain_scores_gemma":[0.9932922,0.0010567919,0.00015931268,0.004036362,0.0011439129,0.0003114462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014147708,0.00085137377,0.0013118933,0.0011896543,0.00189177,0.0047291364,0.0017086099,0.0014222343,0.08081825],"category_scores_gemma":[0.014791591,0.00075583905,0.0021178266,0.0013100373,0.0017443597,0.008106131,0.0033969255,0.005424735,0.0333136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003329149,0.00032120274,0.0010945097,0.00040483387,0.00009930072,0.00048450654,0.0005829224,0.0050269295,0.005272404,0.22031109,0.23839381,0.52767557],"study_design_scores_gemma":[0.00009070271,0.000087266635,0.0006213328,0.00026640404,0.00007258638,0.0007124802,0.0006256733,0.015279194,0.008084051,0.59289473,0.38118264,0.00008274169],"about_ca_topic_score_codex":0.0027034006,"about_ca_topic_score_gemma":0.0037334438,"teacher_disagreement_score":0.08081825,"about_ca_system_score_codex":0.00070588035,"about_ca_system_score_gemma":0.0017490892,"threshold_uncertainty_score":0.270364},"labels":[],"label_agreement":null},{"id":"W1969337449","doi":"10.1016/j.disc.2007.11.006","title":"Bipartite graphs are not universal fixers","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.02775671963024989,"score_gpt":0.2992228160809777,"score_spread":0.27146609645072783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969337449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39393032,0.0044142273,0.36512977,0.008176238,0.0012281791,0.0003736282,0.001785536,0.0038102805,0.22115192],"genre_scores_gemma":[0.8775124,0.001970737,0.04734975,0.0021680673,0.00052315387,0.0005570341,0.0014802259,0.0013748991,0.06706377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624926,0.00057004567,0.00017387175,0.0013423357,0.00056845794,0.0010959299],"domain_scores_gemma":[0.98437923,0.0075235297,0.0013777297,0.003846515,0.0014034888,0.0014694541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003541243,0.0015637357,0.003563115,0.0047214692,0.0071100015,0.0078408625,0.003126862,0.004605209,0.021996116],"category_scores_gemma":[0.016603118,0.0032157565,0.003521504,0.0034213185,0.009502407,0.021319035,0.010270463,0.0080616865,0.0029386394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006229236,0.000017368067,0.00024530315,0.00006774209,0.00003868271,0.000042161704,0.00022340965,0.00045876415,0.0003502995,0.99301815,0.0018612405,0.003614592],"study_design_scores_gemma":[0.00003306782,0.000011999134,0.0001703133,0.000038010592,0.000049599843,0.000107774504,0.00016922597,0.0011341937,0.00051238184,0.99305576,0.0046948367,0.000023004293],"about_ca_topic_score_codex":0.0023780377,"about_ca_topic_score_gemma":0.0024887044,"teacher_disagreement_score":0.021996116,"about_ca_system_score_codex":0.0036763914,"about_ca_system_score_gemma":0.0014972385,"threshold_uncertainty_score":0.07358432},"labels":[],"label_agreement":null},{"id":"W1969412240","doi":"10.1016/j.disc.2008.01.039","title":"On Tutte polynomial uniqueness of twisted wheels","year":2008,"lang":"it","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Nankai University","keywords":"Tutte polynomial; Mathematics; Combinatorics; Polyhedral graph; Discrete mathematics; Hypercube; Chromatic polynomial; Uniqueness; Graph; Matroid; Line graph; Pathwidth; Voltage graph","score_opus":0.04184147399083735,"score_gpt":0.30485081405496806,"score_spread":0.2630093400641307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969412240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51064974,0.00096920127,0.40328845,0.0021458685,0.00069082563,0.00010990918,0.00046494493,0.00039735276,0.08128379],"genre_scores_gemma":[0.9333821,0.0007259324,0.028252192,0.00040884572,0.00029338183,0.00010653478,0.0004070411,0.0004119967,0.03601197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988701,0.0002595884,0.000047000845,0.0002247751,0.0002101163,0.00038828448],"domain_scores_gemma":[0.9967552,0.0015005728,0.00032502372,0.00034453024,0.00055557664,0.0005191096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012611282,0.000814452,0.0015919177,0.0023332483,0.0035420458,0.0035226939,0.0021709814,0.002174127,0.0113701],"category_scores_gemma":[0.009815873,0.00096912903,0.0019271062,0.0019550035,0.004541552,0.006815777,0.00561097,0.004207667,0.0016511839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003224024,0.000009770696,0.00024728943,0.00002109873,0.0000052834375,0.00003892626,0.00013576497,0.0016052889,0.00032923173,0.99477106,0.0006302033,0.0021739951],"study_design_scores_gemma":[0.000009361902,0.000014429095,0.00016033552,0.000015819749,0.000007215411,0.00005579715,0.00016310133,0.008743059,0.00033354672,0.98908067,0.0014001775,0.000016560007],"about_ca_topic_score_codex":0.0029104953,"about_ca_topic_score_gemma":0.0027445627,"teacher_disagreement_score":0.0113701,"about_ca_system_score_codex":0.0018356381,"about_ca_system_score_gemma":0.0013458462,"threshold_uncertainty_score":0.038036764},"labels":[],"label_agreement":null},{"id":"W1969741579","doi":"10.1007/s003730170022","title":"Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs","year":2001,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Digraph; Combinatorics; Mathematics; Conjecture; Graph; Discrete mathematics; Physics","score_opus":0.023888732718980208,"score_gpt":0.27729175245013604,"score_spread":0.2534030197311558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969741579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5816825,0.002686118,0.24199936,0.06419182,0.0029489647,0.000197457,0.0037913802,0.0010086073,0.101493716],"genre_scores_gemma":[0.89752674,0.0012860001,0.0725867,0.0035672076,0.0022656135,0.00028306927,0.0027815348,0.00042906933,0.019274058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980702,0.0006685406,0.000105919855,0.0006242812,0.00023039534,0.00030077598],"domain_scores_gemma":[0.9752398,0.019524746,0.0010096888,0.00195474,0.0011412819,0.0011297199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023716039,0.001079301,0.0020130589,0.0014602385,0.0031218138,0.004552484,0.0030472844,0.004428132,0.014680807],"category_scores_gemma":[0.026157552,0.0012822957,0.002197598,0.002014878,0.00491796,0.010378176,0.0037219687,0.0063947523,0.0013384147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004191042,0.000157823,0.0013536813,0.00047766487,0.00009273079,0.00019528539,0.0007525072,0.026537078,0.0009948245,0.93269616,0.023419894,0.012903276],"study_design_scores_gemma":[0.000057222616,0.000022864751,0.00022535797,0.000029874771,0.000018400293,0.000052727057,0.00016604467,0.022172237,0.000295566,0.9748668,0.0020729017,0.000019967218],"about_ca_topic_score_codex":0.0021182923,"about_ca_topic_score_gemma":0.0019260654,"teacher_disagreement_score":0.014680807,"about_ca_system_score_codex":0.0023717654,"about_ca_system_score_gemma":0.0017632119,"threshold_uncertainty_score":0.0491122},"labels":[],"label_agreement":null},{"id":"W1969997664","doi":"10.1007/s00373-010-0887-z","title":"Diameter-Preserving Spanning Trees in Sparse Weighted Graphs","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Spanning tree; Mathematics; Weight function; Vertex (graph theory); Graph; Shortest-path tree; Simple graph; Connectivity; Discrete mathematics; Mathematical analysis","score_opus":0.020223197123717028,"score_gpt":0.2652129367781776,"score_spread":0.24498973965446055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969997664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66393226,0.00059074076,0.318574,0.0008619213,0.00010085673,0.00015038518,0.00064939447,0.0004772381,0.014663193],"genre_scores_gemma":[0.89501214,0.0011061269,0.09288923,0.0002483926,0.00014338933,0.00016649038,0.0010972323,0.00025846067,0.009078605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940586,0.00013123879,0.000049713817,0.00014519344,0.00016931343,0.00009879299],"domain_scores_gemma":[0.9946386,0.0027110598,0.0008697795,0.00070823054,0.00048083012,0.00059142325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066292327,0.00050467666,0.00085270155,0.0012842304,0.0010207065,0.0017119756,0.0013441113,0.0009805887,0.0022180902],"category_scores_gemma":[0.00822238,0.0008550705,0.00059564266,0.002253353,0.0008431543,0.0035509262,0.0015036352,0.0012404007,0.0004775845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072293216,0.00037256733,0.0063362876,0.0006805677,0.00013087658,0.0007713365,0.0018527097,0.08288621,0.050955378,0.68170786,0.009126199,0.164457],"study_design_scores_gemma":[0.000079739155,0.00016251883,0.0021523063,0.000057923175,0.00011736062,0.00091809046,0.00054645305,0.14070255,0.011762496,0.8373385,0.0061335755,0.00002851716],"about_ca_topic_score_codex":0.00063090905,"about_ca_topic_score_gemma":0.0012094048,"teacher_disagreement_score":0.0022180902,"about_ca_system_score_codex":0.000531406,"about_ca_system_score_gemma":0.00050609896,"threshold_uncertainty_score":0.0074203014},"labels":[],"label_agreement":null},{"id":"W1970277269","doi":"10.1145/1360443.1360454","title":"The complexity of fixed-parameter problems","year":2008,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Completeness (order theory); Computer science; Mathematics; Theoretical computer science; Algorithm; Calculus (dental); Mathematical analysis","score_opus":0.11419205458326208,"score_gpt":0.3186488220123281,"score_spread":0.204456767429066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970277269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09504716,0.0039296346,0.79863405,0.011247152,0.00040182026,0.00030754585,0.0014658269,0.00086457026,0.08810213],"genre_scores_gemma":[0.87581897,0.0037859771,0.10031181,0.0011388551,0.0010916942,0.0009789155,0.0022601897,0.0006802934,0.013933319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9882401,0.0038927826,0.0006296597,0.00243219,0.0035279419,0.0012772082],"domain_scores_gemma":[0.94825995,0.03838626,0.0017296273,0.008741604,0.0019969593,0.000885594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005960337,0.0011418322,0.0015587927,0.001967003,0.0019416385,0.009423194,0.006188314,0.003555135,0.010356025],"category_scores_gemma":[0.04886815,0.0012609372,0.0026206644,0.0027744689,0.008167988,0.02716626,0.005976649,0.010951264,0.0013771266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000829648,0.000052417137,0.0005764544,0.00023051888,0.000053911623,0.0000776988,0.00025768406,0.030121595,0.00068477954,0.95028955,0.0033628698,0.014209531],"study_design_scores_gemma":[0.000013908234,0.000012306557,0.00015900412,0.000033000768,0.000012903287,0.000053940163,0.000051413153,0.022302397,0.00055176805,0.9737709,0.0030195802,0.000018824407],"about_ca_topic_score_codex":0.0014566947,"about_ca_topic_score_gemma":0.00069235126,"teacher_disagreement_score":0.010356025,"about_ca_system_score_codex":0.0054574497,"about_ca_system_score_gemma":0.0020074865,"threshold_uncertainty_score":0.039596736},"labels":[],"label_agreement":null},{"id":"W1970577301","doi":"10.1016/j.dam.2014.02.008","title":"Number of lines in hypergraphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada); Concordia University","funders":"Concordia University; Canada Research Chairs","keywords":"Hypergraph; Mathematics; Combinatorics; Upper and lower bounds; Line (geometry); Chen; Discrete mathematics; Geometry","score_opus":0.01583011199010476,"score_gpt":0.2953630191365015,"score_spread":0.2795329071463967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970577301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.761085,0.0010320976,0.14710024,0.003998969,0.00037922428,0.00012923988,0.0024226184,0.0009861195,0.08286648],"genre_scores_gemma":[0.9243188,0.0007441448,0.0418209,0.000488364,0.0004681023,0.00026534058,0.0013561937,0.0003309372,0.030207235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998615,0.00042472914,0.00008707233,0.00035608187,0.00032281736,0.00019431252],"domain_scores_gemma":[0.9855875,0.008980989,0.0017838028,0.00082122994,0.0011479484,0.0016785379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009906802,0.0005732682,0.00095123326,0.0033967881,0.0021766443,0.005307327,0.0021154617,0.0019133196,0.0213074],"category_scores_gemma":[0.008777482,0.00083770877,0.0005695069,0.0028954232,0.0021884732,0.008908629,0.0013025395,0.0018973346,0.0019022804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004548629,0.00014149236,0.006508453,0.0002965223,0.00006897299,0.0002713309,0.00074496586,0.0060144635,0.006100369,0.94215965,0.009709587,0.027529228],"study_design_scores_gemma":[0.00009714765,0.000069545385,0.002593851,0.00007950722,0.0000625864,0.00051125226,0.00046196688,0.020887665,0.0024574148,0.96485096,0.007897735,0.00003041756],"about_ca_topic_score_codex":0.00047361382,"about_ca_topic_score_gemma":0.0006171927,"teacher_disagreement_score":0.0213074,"about_ca_system_score_codex":0.001220301,"about_ca_system_score_gemma":0.00046984342,"threshold_uncertainty_score":0.07128036},"labels":[],"label_agreement":null},{"id":"W1970733021","doi":"10.5539/jmr.v4n3p116","title":"The Upper Bound of Transitive Index of Reducible Tournaments","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Guangdong Province","keywords":"Mathematics; Transitive relation; Upper and lower bounds; Index (typography); Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.09975700056949226,"score_gpt":0.42083377958498186,"score_spread":0.3210767790154896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970733021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3853303,0.006550642,0.3906248,0.0034840065,0.00087519153,0.00027266282,0.0019189431,0.0015540171,0.20938946],"genre_scores_gemma":[0.95497966,0.0020012907,0.032082137,0.0005121174,0.0005573325,0.00024684443,0.00095459935,0.00034881927,0.008317219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946473,0.0007441649,0.0002458474,0.0011930623,0.0017935436,0.0013761001],"domain_scores_gemma":[0.98471504,0.009112528,0.0010018811,0.00254143,0.00097275776,0.0016563697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026518067,0.0011896964,0.0022554165,0.002697006,0.0023638953,0.006731474,0.0036712391,0.001754733,0.01244255],"category_scores_gemma":[0.02017385,0.00090248015,0.0023978564,0.0024252834,0.0031283665,0.008827912,0.0037605604,0.0062862877,0.0015415861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038427455,0.00017798074,0.0030918007,0.00038820368,0.00011857533,0.00036346092,0.00062203454,0.01618675,0.010770841,0.9321991,0.0068967044,0.028800173],"study_design_scores_gemma":[0.000081675425,0.0002457814,0.0027356357,0.00014163618,0.0001860209,0.00090497074,0.00019627665,0.0862371,0.009874018,0.8862066,0.013088343,0.00010186622],"about_ca_topic_score_codex":0.00076770346,"about_ca_topic_score_gemma":0.00070181617,"teacher_disagreement_score":0.01244255,"about_ca_system_score_codex":0.0023257688,"about_ca_system_score_gemma":0.0009948484,"threshold_uncertainty_score":0.041624486},"labels":[],"label_agreement":null},{"id":"W1971393213","doi":"10.1007/s00224-007-1345-z","title":"An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Parameterized complexity; Feedback vertex set; Combinatorics; Undirected graph; Mathematics; Vertex (graph theory); Algorithm; Bounded function; Running time; Exponential function; Vertex cover; Function (biology); Time complexity; Binary logarithm; Graph; Exponential time hypothesis; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.02914474183978229,"score_gpt":0.31721327122112886,"score_spread":0.2880685293813466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971393213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047406815,0.0013975232,0.89251876,0.004169851,0.0008341281,0.0008919765,0.002239704,0.013040856,0.037500292],"genre_scores_gemma":[0.22729482,0.00040574695,0.7500528,0.0010914758,0.00033816358,0.00103231,0.0033438678,0.0012380455,0.015202668],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977512,0.0003905673,0.00010600503,0.0007564813,0.0006009813,0.00039473182],"domain_scores_gemma":[0.995402,0.0029236432,0.00023188279,0.00085821556,0.00033407717,0.00025025354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012498528,0.0020862988,0.0022264484,0.0013384771,0.0016818861,0.002987751,0.0036602656,0.0033703474,0.024281813],"category_scores_gemma":[0.008026271,0.00074622873,0.0018037442,0.0022329458,0.0011015591,0.0054625818,0.0027995051,0.00333856,0.0054651704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017859368,0.0009778644,0.0012405835,0.0010204406,0.00023230136,0.00032492034,0.00028674697,0.13394554,0.011664667,0.045029063,0.07401678,0.7294751],"study_design_scores_gemma":[0.0011914849,0.00028455452,0.0010396072,0.00012306432,0.00020048062,0.000508047,0.0002415227,0.8070819,0.0056341505,0.16874234,0.014874009,0.00007891982],"about_ca_topic_score_codex":0.0064449445,"about_ca_topic_score_gemma":0.009393606,"teacher_disagreement_score":0.024281813,"about_ca_system_score_codex":0.0030319141,"about_ca_system_score_gemma":0.003377664,"threshold_uncertainty_score":0.0812307},"labels":[],"label_agreement":null},{"id":"W1971489185","doi":"10.1016/j.disc.2014.12.001","title":"Point determining digraphs, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>-matrix partitions, and dualities in full homomorphisms","year":2014,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Mathematics; Algorithm; Theology; Philosophy","score_opus":0.022036936684090846,"score_gpt":0.2675929174034697,"score_spread":0.24555598071937884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971489185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3002476,0.0009623934,0.40053254,0.0020158477,0.00040938257,0.00029093528,0.004819756,0.0019338937,0.2887876],"genre_scores_gemma":[0.7899588,0.0007688418,0.09089315,0.0004299293,0.00018404821,0.00015871729,0.0038933721,0.00054212473,0.11317109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961495,0.000075919874,0.000023110484,0.00013687358,0.00008165055,0.00006746994],"domain_scores_gemma":[0.99904853,0.00033160014,0.00008127521,0.00013578493,0.00023845503,0.00016446925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043582267,0.00037622594,0.00032359964,0.0013959289,0.0014210728,0.0020524412,0.00069062575,0.00051942543,0.0214014],"category_scores_gemma":[0.0020621773,0.00035367758,0.00045552012,0.0010772424,0.0011141442,0.0038338616,0.0012272286,0.0013241217,0.0038205124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050280596,0.000047166053,0.00041579126,0.00007196465,0.000008432313,0.00012188177,0.0004421662,0.0006944081,0.0015459204,0.96667236,0.0073088664,0.022620667],"study_design_scores_gemma":[0.000017448025,0.000034719167,0.0006558309,0.000023006653,0.000012873209,0.00038612392,0.00035531854,0.003599177,0.002654978,0.9654845,0.02675304,0.000022934932],"about_ca_topic_score_codex":0.001994277,"about_ca_topic_score_gemma":0.0030313449,"teacher_disagreement_score":0.0214014,"about_ca_system_score_codex":0.0009832736,"about_ca_system_score_gemma":0.00067423773,"threshold_uncertainty_score":0.071594834},"labels":[],"label_agreement":null},{"id":"W1971752656","doi":"10.1016/j.jctb.2009.05.002","title":"The projective plane is a stabilizer","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Projective plane; Matroid; Real projective plane; Stabilizer (aeronautics); Projective test; Blocking set; Minor (academic); Plane (geometry); Mathematics; Projective space; Combinatorics; Fano plane; Pure mathematics; Complex projective space; Geometry; Art; Engineering; Structural engineering","score_opus":0.011682825517400432,"score_gpt":0.2817224498482041,"score_spread":0.2700396243308037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971752656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7232486,0.0007202415,0.058459204,0.0034828458,0.0006974273,0.00011171145,0.00058739574,0.0008662473,0.21182637],"genre_scores_gemma":[0.9691682,0.00036267334,0.0039689452,0.00022136627,0.0005164572,0.000039409082,0.00031588256,0.00008919492,0.02531801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992799,0.0001121249,0.00003553221,0.00022172653,0.00020885772,0.00014198173],"domain_scores_gemma":[0.9993451,0.00017544503,0.000117869466,0.000065489534,0.00012429092,0.00017185253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036320672,0.0008148646,0.0008375787,0.0017556705,0.0023941738,0.0038878564,0.00055188313,0.00092184846,0.011898327],"category_scores_gemma":[0.0007214246,0.00055381045,0.0005552338,0.0010585765,0.002619184,0.0029611094,0.002128117,0.0017875554,0.00213957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023919041,0.000057091715,0.0011471936,0.0000670962,0.000054442702,0.0007451402,0.0006234207,0.0011201219,0.011244385,0.9704112,0.004192535,0.010098187],"study_design_scores_gemma":[0.0002284194,0.00033554574,0.0041521355,0.000028900027,0.00011432516,0.0015914394,0.0008518048,0.007340301,0.00893488,0.94887614,0.027484106,0.00006209399],"about_ca_topic_score_codex":0.00080368447,"about_ca_topic_score_gemma":0.00060365844,"teacher_disagreement_score":0.011898327,"about_ca_system_score_codex":0.0007738586,"about_ca_system_score_gemma":0.0003059139,"threshold_uncertainty_score":0.039803922},"labels":[],"label_agreement":null},{"id":"W1972322699","doi":"10.1016/j.disc.2012.07.018","title":"Separation properties of 3-Steiner and 3-monophonic convexity in graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convexity; Combinatorics; Disjoint sets; Regular polygon; Convex set; Subderivative; Space (punctuation); Discrete mathematics; Convex optimization; Geometry; Computer science","score_opus":0.039361960832035935,"score_gpt":0.3071247290695605,"score_spread":0.2677627682375246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972322699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7674347,0.0007912366,0.14815462,0.002339189,0.00011828711,0.000084626656,0.0009769126,0.00023388687,0.07986653],"genre_scores_gemma":[0.9673931,0.00063851645,0.01997717,0.0003668752,0.00020335552,0.00011484218,0.0009848634,0.0002313407,0.01009004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913484,0.00018156705,0.00004449649,0.00015900028,0.00025969069,0.0002204351],"domain_scores_gemma":[0.9941923,0.0033314354,0.00078129343,0.00044234926,0.0004896675,0.00076292845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008782864,0.000866804,0.0013374845,0.0019254879,0.002261921,0.0042451047,0.0017950662,0.0014049581,0.010855475],"category_scores_gemma":[0.0053634867,0.001115511,0.001675419,0.002472182,0.0034332632,0.0053740637,0.0024651203,0.0040290053,0.0008966005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002119016,0.000060929324,0.0013957673,0.00009842027,0.000036703845,0.00022194014,0.00048048917,0.008603544,0.0034424528,0.97503996,0.0027614878,0.007646383],"study_design_scores_gemma":[0.000051911236,0.00004262502,0.0023026096,0.000028436007,0.000040877232,0.00038955288,0.00032681812,0.034543,0.0020304592,0.95748943,0.0027200724,0.0000342198],"about_ca_topic_score_codex":0.0027100567,"about_ca_topic_score_gemma":0.002659125,"teacher_disagreement_score":0.010855475,"about_ca_system_score_codex":0.0016981403,"about_ca_system_score_gemma":0.0010847888,"threshold_uncertainty_score":0.036315143},"labels":[],"label_agreement":null},{"id":"W1973793988","doi":"10.1007/s00026-015-0251-3","title":"The Highly Connected Matroids in Minor-Closed Classes","year":2015,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Minor (academic); Combinatorics; Characterization (materials science); Class (philosophy); Graphic matroid; State (computer science); Discrete mathematics; Computer science; Algorithm; Physics","score_opus":0.0879982621014941,"score_gpt":0.35005088756509617,"score_spread":0.2620526254636021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973793988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84206545,0.0010656195,0.10319429,0.004467141,0.00016585273,0.000096856435,0.0008427329,0.00028728682,0.047814768],"genre_scores_gemma":[0.9676068,0.00066887157,0.017442368,0.0003427419,0.0005245206,0.0000960769,0.00059104146,0.00010653808,0.012620969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991959,0.00022082288,0.000038389993,0.00021443791,0.00020195705,0.00012844826],"domain_scores_gemma":[0.9954275,0.0022850481,0.00070089346,0.0003916014,0.00038360766,0.0008113009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006770377,0.0005586508,0.0010608808,0.0019969798,0.002521945,0.005177728,0.001575425,0.0015509718,0.008309741],"category_scores_gemma":[0.0056228354,0.0009430552,0.00080838933,0.002198397,0.0033561827,0.0066778227,0.0022993675,0.0031165532,0.00076268264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012581586,0.000047575304,0.0010980852,0.000070600865,0.000016070644,0.00012476463,0.0006547577,0.0021118913,0.001512757,0.9830111,0.0029479812,0.008278516],"study_design_scores_gemma":[0.00002505835,0.0000118444395,0.00061845954,0.0000115954135,0.000010569129,0.00014068403,0.00018219449,0.006760025,0.00031684866,0.9896114,0.0023033686,0.0000079645415],"about_ca_topic_score_codex":0.0012707035,"about_ca_topic_score_gemma":0.0015443689,"teacher_disagreement_score":0.008309741,"about_ca_system_score_codex":0.0013094322,"about_ca_system_score_gemma":0.0004334414,"threshold_uncertainty_score":0.027798891},"labels":[],"label_agreement":null},{"id":"W1973873776","doi":"10.1016/j.ic.2004.03.005","title":"Computing the vertex separation of unicyclic graphs","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Computer science; Vertex (graph theory); Mathematics; Discrete mathematics; Graph","score_opus":0.0162835703785676,"score_gpt":0.3142700028112472,"score_spread":0.2979864324326796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973873776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8089803,0.0007203073,0.17009044,0.0014738835,0.00015024825,0.00007971523,0.0017185196,0.002262319,0.014524237],"genre_scores_gemma":[0.9075339,0.00018082024,0.08534321,0.0001579912,0.000061388295,0.000040349067,0.0024530874,0.00023595731,0.0039933976],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992005,0.0001459372,0.000046700363,0.00022296736,0.00016435282,0.0002195493],"domain_scores_gemma":[0.9949799,0.002620815,0.00050906924,0.0008218202,0.00051855284,0.0005497822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006317198,0.0008694507,0.0013857814,0.0019747834,0.0012049696,0.0028023166,0.0017433173,0.0013539373,0.006573049],"category_scores_gemma":[0.008386495,0.0006414852,0.00058033393,0.0027195455,0.0012582211,0.004015801,0.002196601,0.0022999265,0.0011443001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004644831,0.0008295171,0.015992342,0.0011467965,0.0003153173,0.000588462,0.0011451364,0.25385973,0.028975584,0.24183652,0.03864683,0.41201904],"study_design_scores_gemma":[0.0001803503,0.00018815411,0.0019148536,0.000055046497,0.0000918046,0.00018679048,0.00043698167,0.5166153,0.012763737,0.4630421,0.0044881417,0.000036701545],"about_ca_topic_score_codex":0.0028203214,"about_ca_topic_score_gemma":0.0066770385,"teacher_disagreement_score":0.006573049,"about_ca_system_score_codex":0.0014439251,"about_ca_system_score_gemma":0.0016416672,"threshold_uncertainty_score":0.021989048},"labels":[],"label_agreement":null},{"id":"W1974199390","doi":"10.1016/s1571-0653(04)00119-2","title":"The Domination Number of Cubic Graphs with Girth at least Five","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Domination analysis; Cubic graph; Graph; Discrete mathematics; Line graph; Vertex (graph theory); Voltage graph","score_opus":0.011223979419256062,"score_gpt":0.2711278830301002,"score_spread":0.25990390361084414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974199390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.972001,0.00060556945,0.003906423,0.0007491532,0.000043985416,0.000018911109,0.0008198794,0.000111220135,0.021743758],"genre_scores_gemma":[0.995336,0.00030962616,0.0014475374,0.00006131109,0.000061033694,0.000031359858,0.0004496921,0.000025957928,0.002277512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994905,0.00010217678,0.000024494264,0.00011037793,0.00012518186,0.00014719534],"domain_scores_gemma":[0.9913107,0.0057457443,0.0010894365,0.0005113232,0.0004072781,0.00093560125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062625983,0.00041473916,0.0005934748,0.0022682294,0.0013828092,0.0022273338,0.0012296177,0.00094754406,0.0042106207],"category_scores_gemma":[0.0058534197,0.00042289327,0.00029759307,0.0017952834,0.001443055,0.0018741606,0.0010081029,0.0011570338,0.00032656777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039624055,0.00032926636,0.054234028,0.0010785238,0.0002784555,0.00089604955,0.0027030227,0.09547335,0.07430836,0.62948483,0.0288245,0.108427204],"study_design_scores_gemma":[0.00041329456,0.00037101423,0.05081814,0.00019631948,0.00021498052,0.0021339413,0.001211695,0.22569197,0.023662679,0.6748027,0.020264477,0.00021888429],"about_ca_topic_score_codex":0.0017895389,"about_ca_topic_score_gemma":0.0026201734,"teacher_disagreement_score":0.0042106207,"about_ca_system_score_codex":0.0015434979,"about_ca_system_score_gemma":0.00081961334,"threshold_uncertainty_score":0.0140859485},"labels":[],"label_agreement":null},{"id":"W1975011389","doi":"10.1016/s0012-365x(00)00345-9","title":"Bounded vertex coloring of trees","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Bounded function; Combinatorics; Mathematics; Fractional coloring; Vertex (graph theory); Complete coloring; Chromatic scale; Brooks' theorem; Discrete mathematics; List coloring; Graph; Graph power; 1-planar graph; Chordal graph","score_opus":0.033826241284818,"score_gpt":0.3093333693216396,"score_spread":0.2755071280368216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975011389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.422975,0.0017364689,0.4746842,0.0023984099,0.00037997315,0.00007732768,0.0009476125,0.0011737323,0.095627226],"genre_scores_gemma":[0.8778122,0.001081571,0.08882755,0.0005936818,0.00023302832,0.00011259662,0.0011486564,0.0005337621,0.02965683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913055,0.00026458356,0.00003029032,0.00016726446,0.0002066585,0.00020068155],"domain_scores_gemma":[0.9939605,0.0036331161,0.0003322659,0.000736302,0.00060103176,0.000736838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061502354,0.00064332166,0.00093967834,0.0010898141,0.0014239928,0.0033274197,0.001858189,0.0008601402,0.006485509],"category_scores_gemma":[0.0056287036,0.00069323473,0.0006911133,0.002036992,0.0016076334,0.0030797936,0.0018849083,0.0029054582,0.00093893375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011468904,0.000043827473,0.0005232789,0.00008338261,0.000014555818,0.00008584506,0.0003154525,0.013651847,0.0029846283,0.9643394,0.005027138,0.012815957],"study_design_scores_gemma":[0.000017463215,0.000009691522,0.00021912775,0.000013598549,0.0000108662625,0.000049170176,0.00006785206,0.02829406,0.0006718863,0.96775913,0.0028796752,0.0000074790846],"about_ca_topic_score_codex":0.0045613307,"about_ca_topic_score_gemma":0.0062348153,"teacher_disagreement_score":0.006485509,"about_ca_system_score_codex":0.0024762328,"about_ca_system_score_gemma":0.0010233154,"threshold_uncertainty_score":0.02169621},"labels":[],"label_agreement":null},{"id":"W1975017470","doi":"10.1016/j.disc.2009.07.015","title":"Graph-like spaces: An introduction","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Graph; Discrete mathematics; Combinatorics","score_opus":0.02130881350651235,"score_gpt":0.30365715907637125,"score_spread":0.2823483455698589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975017470","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067975335,0.48817343,0.30469662,0.015205192,0.02027183,0.00016947747,0.0014436474,0.0004991796,0.16274306],"genre_scores_gemma":[0.13111293,0.46470317,0.19077158,0.017351687,0.07191887,0.0011239983,0.0027270408,0.0012490769,0.11904166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987998,0.0004084257,0.00011211175,0.00032444447,0.0002621397,0.000092975824],"domain_scores_gemma":[0.99895144,0.00058648305,0.00009205912,0.00008759431,0.0001697736,0.000112605325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014405197,0.0036993935,0.0027213022,0.007950847,0.0020233826,0.0066237175,0.0035641512,0.0044432487,0.011267779],"category_scores_gemma":[0.001739462,0.0017818697,0.0025850378,0.009862113,0.006847967,0.01402969,0.0047026197,0.00790804,0.0055727963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021767011,0.00010832973,0.00022084138,0.0009302749,0.00002937492,0.00021221221,0.00033615297,0.001347303,0.0006007088,0.9108892,0.037232615,0.048071273],"study_design_scores_gemma":[0.000010301116,0.000081339655,0.00037733337,0.00037492393,0.000024856263,0.00071289676,0.00019502416,0.002301801,0.00021022683,0.73509365,0.26056346,0.000054207463],"about_ca_topic_score_codex":0.00092759886,"about_ca_topic_score_gemma":0.0014476224,"teacher_disagreement_score":0.011267779,"about_ca_system_score_codex":0.0023658762,"about_ca_system_score_gemma":0.0008701742,"threshold_uncertainty_score":0.037694454},"labels":[],"label_agreement":null},{"id":"W1975155259","doi":"10.1007/s00373-013-1286-z","title":"Subset-Sum Representations of Domination Polynomials","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Domination analysis; Graph; Discrete mathematics","score_opus":0.014489181128081844,"score_gpt":0.27050442430798644,"score_spread":0.2560152431799046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975155259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4666554,0.0008716585,0.34103224,0.0017361547,0.00033056864,0.00007236941,0.00072607293,0.000602123,0.1879734],"genre_scores_gemma":[0.94526696,0.00063808705,0.021627331,0.0002818694,0.0004019543,0.000076715645,0.00042478935,0.00020526764,0.03107706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999585,0.00008600465,0.000016064574,0.00007176336,0.00015254253,0.00008862285],"domain_scores_gemma":[0.9992298,0.00031569746,0.000103706625,0.00012151447,0.0001227225,0.000106517065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054077955,0.0005394652,0.0005818379,0.0019220739,0.001084715,0.0027483995,0.000988256,0.00065648044,0.011316453],"category_scores_gemma":[0.0019765415,0.00034305267,0.00051361194,0.0019483328,0.0014804355,0.003415201,0.0015783934,0.0019316062,0.0012577856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025642697,0.000017023905,0.00011592594,0.000019738134,0.0000036652402,0.000038327686,0.0002044228,0.000926387,0.0007917203,0.9860508,0.0011597377,0.0106466105],"study_design_scores_gemma":[0.000006244559,0.0000067321357,0.00011437762,0.0000076771,0.0000047727385,0.0000710474,0.000063265026,0.0060980343,0.0004610948,0.99100834,0.0021513742,0.0000070829187],"about_ca_topic_score_codex":0.0005552711,"about_ca_topic_score_gemma":0.0008644917,"teacher_disagreement_score":0.011316453,"about_ca_system_score_codex":0.0008792593,"about_ca_system_score_gemma":0.00037497378,"threshold_uncertainty_score":0.037857294},"labels":[],"label_agreement":null},{"id":"W1975172784","doi":"10.1016/j.jctb.2006.01.001","title":"Representation characterizations of chordal bipartite graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Chordal graph; Interval graph; Bipartite graph; Mathematics; Complete bipartite graph; Split graph; Discrete mathematics; Cograph; Distance-hereditary graph; Indifference graph; Graph; Line graph; 1-planar graph; Graph power","score_opus":0.012271149793242522,"score_gpt":0.2757147604491695,"score_spread":0.263443610655927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975172784","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59338385,0.00063960673,0.29073304,0.0018115537,0.00021667557,0.00024830407,0.001840014,0.00071845297,0.11040848],"genre_scores_gemma":[0.9490883,0.00040310033,0.030110555,0.00030348406,0.00021883668,0.00015613383,0.0024739162,0.00022457085,0.01702118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897707,0.00020259082,0.000066560424,0.00025024478,0.0002876824,0.00021581481],"domain_scores_gemma":[0.9959882,0.0018370756,0.00056651677,0.0005410561,0.0006093421,0.00045784476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066598697,0.0005954862,0.00066926057,0.0024662474,0.001249888,0.004358128,0.002129443,0.0012768673,0.014366083],"category_scores_gemma":[0.005794923,0.00041934318,0.00070074387,0.003198435,0.00155575,0.004548445,0.002333217,0.0025851622,0.0012931845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010828846,0.00007166125,0.00078511937,0.00007950126,0.000010242797,0.00010450253,0.0006563579,0.0021715437,0.0025045387,0.9704964,0.002816102,0.020195842],"study_design_scores_gemma":[0.000025249597,0.00004003715,0.00058081,0.000033884175,0.000016651127,0.00023453936,0.00047226023,0.01799412,0.000981389,0.9734167,0.006185199,0.000019212783],"about_ca_topic_score_codex":0.00081779796,"about_ca_topic_score_gemma":0.0007404827,"teacher_disagreement_score":0.014366083,"about_ca_system_score_codex":0.0014087704,"about_ca_system_score_gemma":0.0004902418,"threshold_uncertainty_score":0.048059344},"labels":[],"label_agreement":null},{"id":"W1975406723","doi":"10.1137/070687988","title":"Edge-Face Total Chromatic Number of Halin Graphs","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Discrete mathematics; Face (sociological concept); Enhanced Data Rates for GSM Evolution; Graph; Computer science; Artificial intelligence","score_opus":0.01865966902696562,"score_gpt":0.3178651783919686,"score_spread":0.29920550936500295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975406723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.922976,0.0002073304,0.051850352,0.0003820925,0.000032076867,0.000031157284,0.0004507348,0.00029251043,0.023777626],"genre_scores_gemma":[0.9842254,0.00010682074,0.011632786,0.000043339394,0.0000140601815,0.000031633957,0.00025225955,0.00005177814,0.0036419304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974364,0.000046401845,0.0000084621215,0.000058771886,0.000066116074,0.00007662251],"domain_scores_gemma":[0.99900156,0.0005323616,0.00009264469,0.00011344571,0.00012450131,0.00013555161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034138584,0.00036840065,0.00029402133,0.00087496365,0.00123674,0.001386819,0.0008177901,0.00030436972,0.004249832],"category_scores_gemma":[0.0013744117,0.00020902474,0.0001995542,0.0005672086,0.0007912393,0.0009918083,0.00070534606,0.00059400755,0.00027868143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020714328,0.0002513499,0.026243385,0.00036825347,0.00011206168,0.00046160712,0.0010791089,0.25939012,0.05859276,0.51062256,0.016618289,0.124189034],"study_design_scores_gemma":[0.00010084467,0.00018649257,0.0107779335,0.000039363724,0.00008193447,0.00050741725,0.00050243345,0.5802069,0.05203721,0.34505743,0.010431891,0.00007004125],"about_ca_topic_score_codex":0.0034667347,"about_ca_topic_score_gemma":0.005797954,"teacher_disagreement_score":0.004249832,"about_ca_system_score_codex":0.00169658,"about_ca_system_score_gemma":0.00062371074,"threshold_uncertainty_score":0.014217138},"labels":[],"label_agreement":null},{"id":"W1975475652","doi":"10.2298/aadm100213014w","title":"Voting 'Against' in regular and nearly regular graphs","year":2010,"lang":"en","type":"article","venue":"Applicable Analysis and Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Strongly regular graph; Pathwidth; Line graph","score_opus":0.00830073800910323,"score_gpt":0.2578503158802581,"score_spread":0.24954957787115487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975475652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69292426,0.00044381813,0.27431688,0.0011356046,0.00005184573,0.00007099892,0.00072855863,0.0003972603,0.029930826],"genre_scores_gemma":[0.97019804,0.00014543574,0.025170706,0.0001644552,0.00004061153,0.0000546517,0.00037881228,0.000059233575,0.0037880489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809283,0.0006447253,0.00008409753,0.00051568117,0.00029972964,0.00036288152],"domain_scores_gemma":[0.98943245,0.0069361445,0.0014789742,0.0010048463,0.0004989975,0.0006486099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019038491,0.00050133,0.0011435569,0.0007861246,0.0008800917,0.0015918843,0.00134706,0.00088298024,0.0030859753],"category_scores_gemma":[0.009731224,0.00033878558,0.0005201334,0.0008853809,0.0020215404,0.0032299412,0.00097013736,0.001027804,0.0003323919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008875736,0.00010611028,0.0067552347,0.00031055947,0.00008030444,0.00025991656,0.0006890326,0.09284594,0.014085014,0.8262461,0.0046626613,0.053071517],"study_design_scores_gemma":[0.00006137403,0.00017030418,0.003243738,0.000047455265,0.000066704284,0.00037129555,0.00028241545,0.34465468,0.006046618,0.63759774,0.007414995,0.000042747204],"about_ca_topic_score_codex":0.0011542635,"about_ca_topic_score_gemma":0.0014771024,"teacher_disagreement_score":0.0030859753,"about_ca_system_score_codex":0.0010485072,"about_ca_system_score_gemma":0.00041103954,"threshold_uncertainty_score":0.010323584},"labels":[],"label_agreement":null},{"id":"W1975584720","doi":"10.7151/dmgt.1727","title":"On the complexity of the 3-kernel problem in some classes of digraphs","year":2013,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Kernel (algebra); Vertex (graph theory); Discrete mathematics; Computational complexity theory; Graph; Algorithm","score_opus":0.035712373019534484,"score_gpt":0.27579385258276223,"score_spread":0.24008147956322776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975584720","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8467087,0.0015492215,0.108918324,0.010356144,0.00016476937,0.00022946624,0.003317721,0.0006499959,0.028105771],"genre_scores_gemma":[0.96237576,0.00097128656,0.023769805,0.00054945616,0.00034066974,0.0002047093,0.002431601,0.00027541158,0.00908131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973699,0.00071224745,0.00015892752,0.0006035952,0.00046848715,0.00068679405],"domain_scores_gemma":[0.9603566,0.03257976,0.0025033646,0.0016082799,0.0008474703,0.0021044246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023399778,0.0010251387,0.0027947156,0.0022581555,0.002586414,0.0078886775,0.004433037,0.0040002153,0.016410228],"category_scores_gemma":[0.021602536,0.0010210386,0.0020005773,0.0033848302,0.0035154098,0.018891105,0.0037541543,0.0050568734,0.00092082896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015998406,0.0010668121,0.0102922125,0.000993692,0.00024253035,0.0006701912,0.001743187,0.16802591,0.0027811828,0.75708044,0.020492991,0.035011094],"study_design_scores_gemma":[0.00017844673,0.00005555674,0.0016361355,0.000040292805,0.00006320338,0.00023203103,0.00038302774,0.27824798,0.00054930383,0.71689963,0.0016660831,0.000048385824],"about_ca_topic_score_codex":0.007429037,"about_ca_topic_score_gemma":0.0064893053,"teacher_disagreement_score":0.016410228,"about_ca_system_score_codex":0.0049261553,"about_ca_system_score_gemma":0.0025853293,"threshold_uncertainty_score":0.054897666},"labels":[],"label_agreement":null},{"id":"W1975645051","doi":"10.1016/s0012-365x(02)00518-6","title":"Factor d-domatic colorings of graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Fractional coloring; Discrete mathematics; Edge coloring; Vertex (graph theory); Disjoint sets; Graph; Graph power; Line graph","score_opus":0.029955070364367387,"score_gpt":0.2972155256529396,"score_spread":0.26726045528857223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975645051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47681433,0.0010751206,0.431476,0.0016334642,0.0003649026,0.00015748509,0.0016708043,0.0011217379,0.08568608],"genre_scores_gemma":[0.8461306,0.00080150255,0.11319597,0.0006400696,0.00019351262,0.00015293939,0.0021076319,0.00045105763,0.03632684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999062,0.00020346718,0.00005543641,0.00030374978,0.0001502554,0.00022514183],"domain_scores_gemma":[0.99624026,0.0014552544,0.00041106192,0.00070705573,0.00052104477,0.0006653582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077688054,0.0008306634,0.0007671103,0.0019257317,0.0016981143,0.0033031963,0.0011474076,0.0010334911,0.010991836],"category_scores_gemma":[0.003837535,0.00085656025,0.00089629384,0.0017551841,0.0019461578,0.0029686491,0.0019964506,0.0018174908,0.0015334418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043200987,0.00008430024,0.0020488868,0.00014592554,0.000030366553,0.00014898316,0.00049141067,0.0058286637,0.0067927884,0.9502198,0.0076737655,0.026103104],"study_design_scores_gemma":[0.000060604223,0.000041636904,0.0006714815,0.00002684904,0.00002404365,0.00026524792,0.00022765035,0.0150393685,0.002119725,0.97216,0.0093415715,0.00002195101],"about_ca_topic_score_codex":0.0021740226,"about_ca_topic_score_gemma":0.0035954437,"teacher_disagreement_score":0.010991836,"about_ca_system_score_codex":0.0014835818,"about_ca_system_score_gemma":0.00074823573,"threshold_uncertainty_score":0.036771357},"labels":[],"label_agreement":null},{"id":"W1975847110","doi":"10.2298/yjor130402037h","title":"On the maximum orders of an induced forest, an induced tree, and a stable set","year":2013,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Combinatorics; Mathematics; Graph; Tree (set theory); Integer (computer science); Order (exchange); Upper and lower bounds; Set (abstract data type); Stability (learning theory); Discrete mathematics; Computer science","score_opus":0.12365718098265857,"score_gpt":0.40012774714530297,"score_spread":0.2764705661626444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975847110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7577589,0.0030281907,0.15966348,0.00274119,0.00015978115,0.0001245316,0.0020640001,0.00044938835,0.07401051],"genre_scores_gemma":[0.9365495,0.001875324,0.049407262,0.00023739743,0.00038506626,0.0001736777,0.001524725,0.00024052382,0.009606641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986143,0.0003409963,0.00007414314,0.0002598313,0.0003533225,0.00035737333],"domain_scores_gemma":[0.9718679,0.021426944,0.002040619,0.0012909415,0.0012315796,0.002142094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022681777,0.0009922175,0.0011703622,0.0028909005,0.0018903932,0.0036431109,0.0015587592,0.0009069074,0.006077562],"category_scores_gemma":[0.013049507,0.0008795815,0.00075963984,0.0019556754,0.0029299522,0.008089023,0.001764851,0.0019741105,0.0008421262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016308828,0.00034964413,0.0104010375,0.00048588437,0.000088971996,0.0004299138,0.0013280623,0.080615826,0.011941589,0.8307186,0.008020554,0.05398901],"study_design_scores_gemma":[0.00012711492,0.00038815604,0.007299026,0.00017151017,0.00011021168,0.00073465274,0.00066055276,0.17557974,0.007507216,0.7988343,0.008499715,0.00008771084],"about_ca_topic_score_codex":0.0025614554,"about_ca_topic_score_gemma":0.0042543164,"teacher_disagreement_score":0.006077562,"about_ca_system_score_codex":0.002902214,"about_ca_system_score_gemma":0.0013400428,"threshold_uncertainty_score":0.021057129},"labels":[],"label_agreement":null},{"id":"W1976120600","doi":"10.1142/s0129054100000260","title":"ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES","year":2000,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":231,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Clique graph; Treewidth; Split graph; Vertex (graph theory); Chordal graph; Block graph; Bounded function; Graph; Pathwidth; Line graph; Graph power; 1-planar graph","score_opus":0.02382651196834527,"score_gpt":0.33623674160293426,"score_spread":0.312410229634589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976120600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9390916,0.0007694262,0.045842033,0.00082026934,0.000021680144,0.000022935796,0.0005413171,0.00012277227,0.012767868],"genre_scores_gemma":[0.9876752,0.00025627943,0.010203594,0.0000970467,0.00005454397,0.000028851295,0.00033559068,0.000059433092,0.0012894911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942374,0.000116007155,0.000022082153,0.00018776508,0.00011302984,0.00013736662],"domain_scores_gemma":[0.9944561,0.004009391,0.00051320344,0.00039408426,0.00023225552,0.00039504605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010543725,0.00030259552,0.0003901796,0.001149104,0.00087346387,0.0017195841,0.00075390295,0.0004423125,0.002233714],"category_scores_gemma":[0.0056013423,0.00036444498,0.00039728318,0.0010249795,0.0019141866,0.003416607,0.00097218866,0.0009519958,0.0001659174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067725376,0.00012883611,0.0133740315,0.00022936046,0.000075014104,0.00028233672,0.0015502832,0.04251962,0.013951498,0.8888129,0.004676673,0.033722203],"study_design_scores_gemma":[0.000059848768,0.000086647604,0.0069585806,0.000053061107,0.000045324236,0.00039926183,0.0004893121,0.10472572,0.00497028,0.8750736,0.0070971223,0.000041234434],"about_ca_topic_score_codex":0.0016658392,"about_ca_topic_score_gemma":0.0014889714,"teacher_disagreement_score":0.002233714,"about_ca_system_score_codex":0.0011168651,"about_ca_system_score_gemma":0.00041203247,"threshold_uncertainty_score":0.00810349},"labels":[],"label_agreement":null},{"id":"W1976525036","doi":"10.1016/j.tcs.2012.12.025","title":"Weak near-unanimity functions and digraph homomorphism problems","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Digraph; Unanimity; Homomorphism; Mathematics; Combinatorics; Conjecture; Algebraic number; Context (archaeology); Discrete mathematics; Constraint satisfaction problem; Measure (data warehouse); Computer science","score_opus":0.013713714101190025,"score_gpt":0.24758432885136222,"score_spread":0.2338706147501722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976525036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47372147,0.0028632733,0.45735523,0.008974731,0.00031041892,0.00010124027,0.0003855118,0.0004383942,0.055849653],"genre_scores_gemma":[0.9455189,0.0017860768,0.033285473,0.00086190103,0.0004219958,0.00019220401,0.00038889164,0.00011824994,0.017426226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983505,0.0006829217,0.00009392274,0.0003665615,0.00024411966,0.00026207702],"domain_scores_gemma":[0.9888521,0.008513639,0.0005514326,0.0007972978,0.00047424485,0.00081133767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003105254,0.00087964017,0.0015538416,0.0026512798,0.0039062835,0.0046098107,0.0023557823,0.0027141941,0.006271248],"category_scores_gemma":[0.013756313,0.0010401654,0.001356066,0.0034949088,0.005069292,0.018481705,0.004805988,0.0061414936,0.0006443752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059679667,0.000043466935,0.00026085682,0.000056312547,0.000010664848,0.000045555214,0.0003067162,0.0013580847,0.00025134755,0.98986316,0.0006841094,0.007060045],"study_design_scores_gemma":[0.000009025911,0.000006545657,0.0000480326,0.0000070360065,0.000006088668,0.00003316556,0.00006629245,0.0021640765,0.0001525143,0.99703825,0.0004638734,0.0000051480793],"about_ca_topic_score_codex":0.0008727554,"about_ca_topic_score_gemma":0.0007033491,"teacher_disagreement_score":0.006271248,"about_ca_system_score_codex":0.0021228883,"about_ca_system_score_gemma":0.0011198892,"threshold_uncertainty_score":0.020979404},"labels":[],"label_agreement":null},{"id":"W1976577139","doi":"10.1016/j.dam.2012.01.024","title":"Finding and listing induced paths and cycles","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Listing (finance); Time complexity; Running time; Discrete mathematics; Algorithm","score_opus":0.047435364140021107,"score_gpt":0.3154596740394087,"score_spread":0.26802430989938764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976577139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31613362,0.0007531102,0.64076465,0.0011791427,0.00016063686,0.0007360501,0.005399484,0.0067991107,0.028074145],"genre_scores_gemma":[0.29148936,0.00045594448,0.6853817,0.00016224722,0.00004060248,0.00017167245,0.0068653687,0.0010003595,0.014432841],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929297,0.00011952625,0.000048144717,0.00017969644,0.00022253719,0.00013707358],"domain_scores_gemma":[0.9973254,0.001371922,0.00020374093,0.0004739382,0.0004517979,0.00017308557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005077759,0.0008782867,0.0008616602,0.0026847392,0.001440261,0.0020097098,0.0014688309,0.0012717987,0.012206603],"category_scores_gemma":[0.005924345,0.0005997722,0.0011590029,0.0031633151,0.00086721097,0.004650704,0.0016911132,0.0012204115,0.0019617307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057219056,0.000608664,0.01313684,0.00145893,0.0001542776,0.0008749604,0.0010637214,0.055341404,0.018945346,0.14858967,0.029593967,0.72966],"study_design_scores_gemma":[0.00015111669,0.00035482884,0.0030739468,0.00031144673,0.00023492021,0.0007490578,0.0016142619,0.3212115,0.031870723,0.58587915,0.05446812,0.00008089195],"about_ca_topic_score_codex":0.0050305445,"about_ca_topic_score_gemma":0.012961799,"teacher_disagreement_score":0.012206603,"about_ca_system_score_codex":0.00090963824,"about_ca_system_score_gemma":0.0019350465,"threshold_uncertainty_score":0.0408352},"labels":[],"label_agreement":null},{"id":"W1976619117","doi":"10.1016/j.disc.2005.12.053","title":"The firefighter problem for graphs of maximum degree three","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Degree (music); Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.03299384743016334,"score_gpt":0.28530295995360117,"score_spread":0.2523091125234378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976619117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55009955,0.0022197983,0.36295128,0.015588834,0.00067260925,0.0006414821,0.0022895446,0.00061800727,0.064918876],"genre_scores_gemma":[0.80206126,0.002148939,0.13500312,0.0011352492,0.00044119466,0.0003223991,0.002892919,0.00037803617,0.055616897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896204,0.00028775245,0.000032165135,0.00023793102,0.000110207475,0.00037001746],"domain_scores_gemma":[0.996089,0.002330677,0.0003675257,0.0003437563,0.00019413288,0.00067489786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017831121,0.0012155743,0.001878414,0.00093373226,0.0035388665,0.002944254,0.0040184036,0.0053777383,0.016144805],"category_scores_gemma":[0.006832984,0.0009471957,0.001526178,0.0011582302,0.0025476352,0.0068032932,0.002837547,0.0036616186,0.0015655644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002969215,0.0010261523,0.0052107396,0.0016732652,0.00024944326,0.0017758735,0.0021069217,0.19943851,0.008343796,0.5807166,0.08450775,0.11198172],"study_design_scores_gemma":[0.00040055613,0.00025850753,0.0014508732,0.00019519826,0.00010769646,0.0008198426,0.0028582183,0.20435987,0.0049464395,0.7624148,0.022121385,0.000066612345],"about_ca_topic_score_codex":0.0059407596,"about_ca_topic_score_gemma":0.0055993586,"teacher_disagreement_score":0.016144805,"about_ca_system_score_codex":0.001679833,"about_ca_system_score_gemma":0.0017786117,"threshold_uncertainty_score":0.054009795},"labels":[],"label_agreement":null},{"id":"W1976828798","doi":"10.1016/j.jctb.2008.03.003","title":"Projective geometries in dense matroids","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Prime power; Minor (academic); Mathematics; Integer (computer science); Projective plane; Prime (order theory); Simple (philosophy); Discrete mathematics; Computer science; Geometry","score_opus":0.017698982939964993,"score_gpt":0.2748469373574108,"score_spread":0.2571479544174458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976828798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7159987,0.0032790718,0.122810066,0.005186249,0.00037372712,0.00009621224,0.0011972865,0.0004522163,0.15060645],"genre_scores_gemma":[0.9697356,0.0011132342,0.012835764,0.00030877584,0.00063246145,0.00006523062,0.0007392874,0.000088026536,0.014481483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998845,0.00038121047,0.000058190803,0.00024413597,0.00028626132,0.00018519153],"domain_scores_gemma":[0.9972773,0.0013357635,0.00038576624,0.00023429589,0.00025316616,0.0005136199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008482408,0.00084188586,0.0011587263,0.002432331,0.0025349064,0.004957094,0.001348341,0.0012292542,0.009406638],"category_scores_gemma":[0.003053279,0.0013745171,0.0006634226,0.0029303017,0.0043047965,0.0074581583,0.003063421,0.003719432,0.00092726084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023681117,0.000017995297,0.00031760894,0.000028717375,0.0000052576775,0.000057291832,0.00026709514,0.00056657,0.00026661262,0.9955389,0.0009225655,0.0019876047],"study_design_scores_gemma":[0.000016372247,0.000010560621,0.0003498585,0.000007950877,0.000007851895,0.00010402086,0.00013466294,0.0017401943,0.00011959,0.9958026,0.0016995984,0.000006788713],"about_ca_topic_score_codex":0.0013761072,"about_ca_topic_score_gemma":0.0020665496,"teacher_disagreement_score":0.009406638,"about_ca_system_score_codex":0.0014732035,"about_ca_system_score_gemma":0.00046049966,"threshold_uncertainty_score":0.031468272},"labels":[],"label_agreement":null},{"id":"W1977227483","doi":"10.1007/s00037-009-0266-4","title":"Space-Efficient Counting in Graphs on Surfaces","year":2009,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Modulo; Discrete mathematics; Algebraic number; Planar graph; Counting problem; Graph","score_opus":0.0639715632429065,"score_gpt":0.3344310122917777,"score_spread":0.2704594490488712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977227483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47919005,0.0012298357,0.4630827,0.007043381,0.0003890327,0.00023582598,0.0015866171,0.0028297484,0.044412795],"genre_scores_gemma":[0.7979183,0.00081985164,0.18083204,0.00051203574,0.00038274511,0.0002427286,0.0019729906,0.0009954664,0.016323712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969277,0.00082092383,0.0001774922,0.00055814703,0.00089291466,0.0006228711],"domain_scores_gemma":[0.98764217,0.007705251,0.00073071505,0.0026677512,0.0007284503,0.0005257276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014358589,0.0011690619,0.0019004061,0.0023391717,0.002161964,0.0074272337,0.0041102944,0.0021433216,0.013321787],"category_scores_gemma":[0.013523559,0.0007991407,0.0017478291,0.005738014,0.0029442892,0.0147324335,0.0034409333,0.0030571788,0.001517432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041460892,0.00029356088,0.0024662132,0.00042089992,0.00007178383,0.00017774921,0.0006972865,0.094671346,0.006685692,0.76818365,0.016861526,0.10905566],"study_design_scores_gemma":[0.000045111792,0.000021849844,0.00036242622,0.00002102169,0.00003166993,0.00007151155,0.00014807141,0.16227165,0.0023656893,0.83203965,0.0026008477,0.0000206159],"about_ca_topic_score_codex":0.004914538,"about_ca_topic_score_gemma":0.007939045,"teacher_disagreement_score":0.013321787,"about_ca_system_score_codex":0.0030171617,"about_ca_system_score_gemma":0.0025199184,"threshold_uncertainty_score":0.044565797},"labels":[],"label_agreement":null},{"id":"W1977358807","doi":"10.1016/j.aam.2012.03.004","title":"On minor-closed classes of matroids with exponential growth rate","year":2012,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Exponential function; Matroid; Base (topology); Integer (computer science); Minor (academic); Prime power; Exponential growth; Prime (order theory); Discrete mathematics; Mathematical analysis","score_opus":0.013725122250598564,"score_gpt":0.2805289442160489,"score_spread":0.2668038219654503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977358807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7194783,0.0022644633,0.21916905,0.00531665,0.00035973187,0.00015010609,0.0012041543,0.0005441973,0.051513348],"genre_scores_gemma":[0.93550575,0.0019916326,0.031169925,0.0006387438,0.0012409857,0.0003217575,0.0015829413,0.0004579425,0.02709034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982449,0.0005212671,0.00008816118,0.0003598175,0.00042039974,0.00036540887],"domain_scores_gemma":[0.9766218,0.015583652,0.0022646203,0.001063824,0.0014628251,0.003003269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002242184,0.0017635445,0.002267031,0.0035564918,0.002805678,0.0057947114,0.0029519293,0.0022277653,0.010500218],"category_scores_gemma":[0.020946845,0.0014312582,0.0019627989,0.00290204,0.0042658155,0.009068954,0.004115963,0.005140079,0.0009326986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002733162,0.00012321254,0.0014490464,0.000124909,0.000037553877,0.00017527971,0.00071529264,0.009483501,0.0019208001,0.9724168,0.0041851425,0.009095114],"study_design_scores_gemma":[0.00006259866,0.000048847658,0.0007561717,0.000028665494,0.000023080516,0.00022922983,0.00014292359,0.047184415,0.00035764204,0.94903696,0.0021051688,0.000024305757],"about_ca_topic_score_codex":0.0022085716,"about_ca_topic_score_gemma":0.0019086028,"teacher_disagreement_score":0.010500218,"about_ca_system_score_codex":0.0034427831,"about_ca_system_score_gemma":0.0009650306,"threshold_uncertainty_score":0.035126746},"labels":[],"label_agreement":null},{"id":"W1977507713","doi":"10.1007/s10878-007-9106-0","title":"Lower bounds and a tabu search algorithm for the minimum deficiency problem","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Theory of computation; Tabu search; Graph; Graph coloring; Edge coloring; Neighbourhood (mathematics); Discrete mathematics; Algorithm; Graph power; Line graph","score_opus":0.01375133543579926,"score_gpt":0.2907933059047155,"score_spread":0.27704197046891627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977507713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062010355,0.0018104643,0.9033445,0.0021589852,0.00042268762,0.0002712964,0.0007265962,0.0016680114,0.027587138],"genre_scores_gemma":[0.25273505,0.00067999994,0.73567516,0.0005315056,0.0002470422,0.00053714786,0.0014136981,0.0007328331,0.0074476018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827206,0.00069736916,0.00007089401,0.00019107913,0.0005416803,0.00022689413],"domain_scores_gemma":[0.9915793,0.006286535,0.00032979177,0.0007306535,0.0008668545,0.00020688782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00280191,0.0015735076,0.0016596153,0.0026428467,0.0012914668,0.003546089,0.0027940553,0.0025725865,0.013838806],"category_scores_gemma":[0.021032564,0.0009458388,0.0010806785,0.0029692943,0.0015789106,0.0032856788,0.0019166954,0.003418273,0.0020120812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011553961,0.00053346384,0.0014196719,0.0003727566,0.000086704174,0.00008565343,0.00023071116,0.62725437,0.003268048,0.112612955,0.019940061,0.23304023],"study_design_scores_gemma":[0.00013154751,0.000086692904,0.00021470395,0.00005673176,0.00002137047,0.000044768058,0.000038357204,0.9256779,0.0006932708,0.070694745,0.0023222796,0.000017635793],"about_ca_topic_score_codex":0.003618048,"about_ca_topic_score_gemma":0.0042609572,"teacher_disagreement_score":0.013838806,"about_ca_system_score_codex":0.0021617757,"about_ca_system_score_gemma":0.0022511552,"threshold_uncertainty_score":0.046295404},"labels":[],"label_agreement":null},{"id":"W1977677776","doi":"10.1016/s1571-0653(04)00379-8","title":"Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Minor (academic); Mathematics; Partial k-tree; Maximization; Combinatorics; 1-planar graph; Discrete mathematics; Planar graph; Bounded function; Graph minor; Minification; Robertson–Seymour theorem; Graph; Pathwidth; Chordal graph; Mathematical optimization; Line graph; Graph power; Mathematical analysis","score_opus":0.025549136054115698,"score_gpt":0.30638295864821063,"score_spread":0.28083382259409495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977677776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31702647,0.0021157644,0.65102243,0.0021811123,0.00032329326,0.00029110422,0.0016900096,0.005852865,0.01949695],"genre_scores_gemma":[0.68438655,0.0006952183,0.30021697,0.00049215846,0.00014235775,0.00028454326,0.0024998377,0.0009972579,0.010285112],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846184,0.00028220317,0.00009679767,0.00029764188,0.00039923616,0.0004623828],"domain_scores_gemma":[0.99395895,0.0030994487,0.00035154112,0.0017692855,0.00045272932,0.0003679793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001754308,0.0013935196,0.0015637341,0.0013020923,0.0016807121,0.0037308747,0.0037186036,0.001955991,0.0109055005],"category_scores_gemma":[0.009679833,0.0006526685,0.001474602,0.0024682693,0.0012576478,0.007788377,0.004838951,0.002358166,0.0019402223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008126022,0.0006188346,0.0039032686,0.0010393028,0.00025975818,0.00032555073,0.0021230963,0.2211862,0.024921548,0.31111822,0.034871157,0.39150703],"study_design_scores_gemma":[0.0004279162,0.00021546548,0.0007595866,0.00008730252,0.00012372668,0.00021219996,0.00037258715,0.56659836,0.00952268,0.41326037,0.008358397,0.00006144022],"about_ca_topic_score_codex":0.0043661986,"about_ca_topic_score_gemma":0.008436184,"teacher_disagreement_score":0.0109055005,"about_ca_system_score_codex":0.003532261,"about_ca_system_score_gemma":0.0019207771,"threshold_uncertainty_score":0.036482573},"labels":[],"label_agreement":null},{"id":"W1977889556","doi":"10.1016/s0012-365x(02)00803-8","title":"Finding a maximum induced matching in weakly chordal graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Bipartite graph; Matching (statistics); Split graph; 3-dimensional matching; Interval graph; Vertex (graph theory); Indifference graph; Discrete mathematics; Factor-critical graph; Cardinality (data modeling); Pathwidth; Graph; 1-planar graph; Line graph; Graph power; Computer science","score_opus":0.03729535450122503,"score_gpt":0.314509867878203,"score_spread":0.277214513376978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977889556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71245724,0.0006293666,0.25963202,0.0021110827,0.0001725557,0.00063432154,0.002483764,0.0014508469,0.020428807],"genre_scores_gemma":[0.73642755,0.00042081575,0.24935547,0.00039605945,0.00010231412,0.00025237858,0.0032587864,0.00037935356,0.0094073],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989287,0.00018957363,0.00008965224,0.00038593158,0.00018053324,0.00022552759],"domain_scores_gemma":[0.9946774,0.0031528568,0.00053865305,0.0006436832,0.00035453745,0.0006328374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087307015,0.0010643242,0.0023568494,0.0015694952,0.0022970757,0.0029329807,0.0039592846,0.0030062231,0.00879702],"category_scores_gemma":[0.009219709,0.0012343981,0.0014406967,0.0029192592,0.0011455498,0.0063649877,0.0030930762,0.002020021,0.0017033687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056724814,0.0030180728,0.024865234,0.005247461,0.0008288176,0.0015879271,0.0027736097,0.1327887,0.099422745,0.2546657,0.032877367,0.43625194],"study_design_scores_gemma":[0.0006211387,0.00090384803,0.004641459,0.00022636943,0.00037446583,0.0009243553,0.002008105,0.35277203,0.042199004,0.584122,0.011113309,0.000093773],"about_ca_topic_score_codex":0.0015786745,"about_ca_topic_score_gemma":0.0029230788,"teacher_disagreement_score":0.00879702,"about_ca_system_score_codex":0.001550666,"about_ca_system_score_gemma":0.0016096192,"threshold_uncertainty_score":0.029428959},"labels":[],"label_agreement":null},{"id":"W1978292808","doi":"10.1090/s0002-9947-09-04874-0","title":"Varieties with few subalgebras of powers","year":2009,"lang":"lv","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Conjecture; Algorithm; Mathematics; Artificial intelligence; Computer science; Combinatorics","score_opus":0.01388077732672764,"score_gpt":0.27560731840426334,"score_spread":0.2617265410775357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978292808","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2594966,0.00287744,0.24949284,0.007927897,0.0008156755,0.000099588906,0.0018651494,0.0014892428,0.47593552],"genre_scores_gemma":[0.91290367,0.0008581118,0.031141864,0.0010125289,0.0006611938,0.00009372023,0.0013921132,0.00039714554,0.051539678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823123,0.00044272564,0.00012417215,0.0005523262,0.000427522,0.00022204648],"domain_scores_gemma":[0.99766636,0.0010134676,0.0001982354,0.0005011806,0.00036071462,0.00026010055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012781736,0.000554653,0.0010025821,0.0015083409,0.003271668,0.005408452,0.0009652564,0.0007277213,0.018811844],"category_scores_gemma":[0.003409247,0.000687284,0.0014708547,0.0015258503,0.005245476,0.009948585,0.0038239618,0.003192521,0.0037846395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030555853,0.000007930511,0.00021348102,0.000023846404,0.0000065638615,0.000057858655,0.00017616998,0.00021459041,0.0002165143,0.9945294,0.0015418694,0.0029812055],"study_design_scores_gemma":[0.00001331807,0.0000064066894,0.00013705136,0.0000110876645,0.0000063535413,0.000091007976,0.00011598245,0.0008971024,0.00026261804,0.9920157,0.0064365296,0.000006726959],"about_ca_topic_score_codex":0.0016919626,"about_ca_topic_score_gemma":0.0017346779,"teacher_disagreement_score":0.018811844,"about_ca_system_score_codex":0.0016927539,"about_ca_system_score_gemma":0.00076745584,"threshold_uncertainty_score":0.062931895},"labels":[],"label_agreement":null},{"id":"W1978631091","doi":"10.1016/j.disc.2007.12.075","title":"The obstructions for toroidal graphs with no <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si14.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>’s","year":2008,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toroid; Combinatorics; Mathematics; Planar graph; Subdivision; Discrete mathematics; Physics; Graph","score_opus":0.021273118216842864,"score_gpt":0.25545277334377403,"score_spread":0.23417965512693117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978631091","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39855653,0.0019586668,0.16004546,0.008210658,0.0014317154,0.00025688307,0.0018589915,0.0014006948,0.42628053],"genre_scores_gemma":[0.9216551,0.0008551541,0.013109437,0.00078807276,0.0005425726,0.00015937045,0.0012243497,0.0004398748,0.061226096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988381,0.00023564798,0.00006735337,0.00021850607,0.00027885268,0.0003614639],"domain_scores_gemma":[0.9967539,0.0012525704,0.00045287027,0.0003772699,0.000377618,0.0007858512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008304208,0.0006769432,0.0008274241,0.0031251798,0.004429276,0.0035283226,0.0009984333,0.0014591771,0.022589901],"category_scores_gemma":[0.004832911,0.00064565515,0.0014203726,0.0012892368,0.004455398,0.0059178877,0.0047424687,0.0029920095,0.0032179535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004050845,0.000010711001,0.00019763935,0.000040928808,0.000004996188,0.00012363154,0.00022430228,0.0005019673,0.00026537565,0.99218905,0.0040942063,0.0023066166],"study_design_scores_gemma":[0.000020564907,0.000016574302,0.0004265995,0.000025261903,0.000012088079,0.00020607954,0.00022811012,0.0025612745,0.00038763613,0.9853109,0.010781358,0.000023601066],"about_ca_topic_score_codex":0.0044209966,"about_ca_topic_score_gemma":0.004202324,"teacher_disagreement_score":0.022589901,"about_ca_system_score_codex":0.002088156,"about_ca_system_score_gemma":0.001301933,"threshold_uncertainty_score":0.0755707},"labels":[],"label_agreement":null},{"id":"W1979091665","doi":"10.1016/j.jctb.2010.06.001","title":"The number of points in a matroid with no n-point line as a minor","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Minor (academic); Combinatorics; Rank (graph theory); Mathematics; Prime power; Line (geometry); Integer (computer science); Point (geometry); Prime (order theory); Projective plane; Oriented matroid; Discrete mathematics; Graphic matroid; Geometry; Computer science; Humanities","score_opus":0.005835806336886248,"score_gpt":0.27290845197337554,"score_spread":0.2670726456364893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979091665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9591739,0.00018247176,0.024420077,0.000650724,0.0000681539,0.000046382876,0.0011688316,0.0001425987,0.014146734],"genre_scores_gemma":[0.9656604,0.000198348,0.02387796,0.00009355841,0.00012305976,0.00012109482,0.0013203435,0.00009454675,0.008510718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849474,0.00030578885,0.00015967923,0.0003861699,0.000419829,0.00023373288],"domain_scores_gemma":[0.990448,0.004421533,0.001890456,0.00073484704,0.00084943406,0.0016558408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097154186,0.0007192731,0.0011052244,0.0025537894,0.002343304,0.0038388057,0.0029491198,0.0021690878,0.007851041],"category_scores_gemma":[0.0058574695,0.0008801784,0.0009523523,0.0021129658,0.0029068636,0.0050353613,0.002122141,0.0014406315,0.001058017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007140575,0.00067384564,0.07571884,0.0009890848,0.0006683467,0.0023009393,0.0025152052,0.051316537,0.11961857,0.6573927,0.014931724,0.066733666],"study_design_scores_gemma":[0.0005667828,0.0011505603,0.042887434,0.00015634464,0.0006698687,0.008166623,0.003267341,0.17492983,0.06471264,0.67913383,0.024068134,0.00029066027],"about_ca_topic_score_codex":0.0008420231,"about_ca_topic_score_gemma":0.00089382415,"teacher_disagreement_score":0.007851041,"about_ca_system_score_codex":0.0011633697,"about_ca_system_score_gemma":0.00056581554,"threshold_uncertainty_score":0.02626431},"labels":[],"label_agreement":null},{"id":"W1979119667","doi":"10.1109/lics.2012.24","title":"Near Unanimity Constraints Have Bounded Pathwidth Duality","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Nondeterministic algorithm; Unanimity; Bounded function; Conjecture; Constraint satisfaction problem; Mathematics; Duality (order theory); Discrete mathematics; Equivalence (formal languages); Backtracking; Combinatorics; Mathematical optimization","score_opus":0.04729336190534559,"score_gpt":0.3271589810276005,"score_spread":0.2798656191222549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979119667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27558154,0.00058261293,0.6912001,0.002569995,0.00008936333,0.000108338565,0.0005241157,0.0007268046,0.028617151],"genre_scores_gemma":[0.88487154,0.00029789686,0.10851193,0.0006551447,0.00014056507,0.0002161258,0.00045298177,0.00028067836,0.0045729512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99336064,0.0016958322,0.00035424138,0.0019450852,0.0017425932,0.00090157316],"domain_scores_gemma":[0.9739172,0.01953725,0.0016984595,0.0032654256,0.0007507965,0.0008308396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032914774,0.00075800734,0.0015886077,0.0010184995,0.0018698348,0.0058205584,0.0030843415,0.0023794125,0.0058984146],"category_scores_gemma":[0.0190518,0.0013250685,0.002518944,0.0019698595,0.0043115118,0.016868306,0.005612676,0.007654507,0.0007610738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018804986,0.00010795819,0.0014657453,0.0001443175,0.000045561046,0.00021926794,0.000620998,0.015574032,0.0050281337,0.9587801,0.0008470391,0.016978774],"study_design_scores_gemma":[0.000024189754,0.000047119174,0.00023616909,0.000020127354,0.000031537533,0.0002652215,0.00010009273,0.027781093,0.0044307956,0.96497047,0.0020730977,0.00001993778],"about_ca_topic_score_codex":0.0010966976,"about_ca_topic_score_gemma":0.0009197868,"teacher_disagreement_score":0.0058984146,"about_ca_system_score_codex":0.0018551968,"about_ca_system_score_gemma":0.0012567054,"threshold_uncertainty_score":0.019732177},"labels":[],"label_agreement":null},{"id":"W1979477295","doi":"10.1016/j.disc.2004.07.022","title":"The graphs with maximum induced matching and maximum matching the same size","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Wilfrid Laurier University","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Factor-critical graph; Characterization (materials science); 3-dimensional matching; Graph; Cograph; Discrete mathematics; Simple (philosophy); Line graph; Bipartite graph; Pathwidth; Voltage graph; Statistics","score_opus":0.019029947364102493,"score_gpt":0.27922666289546505,"score_spread":0.26019671553136253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979477295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61736894,0.0020587018,0.23383996,0.007760092,0.00061831163,0.00034113077,0.0034383137,0.0009388633,0.1336357],"genre_scores_gemma":[0.89072144,0.0014250983,0.08066807,0.0014676433,0.00068751373,0.00038388424,0.0024903268,0.0003913534,0.021764588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823356,0.000473759,0.00007951661,0.0005924987,0.0003141978,0.00030656398],"domain_scores_gemma":[0.99009085,0.003929526,0.0017597004,0.0021191793,0.0010346078,0.0010661306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014107743,0.0008930001,0.0014219858,0.0019612275,0.0025269228,0.0032557223,0.002489525,0.0024421017,0.00762007],"category_scores_gemma":[0.013644605,0.0008616167,0.0015723865,0.0028207423,0.00224472,0.00750021,0.0019560049,0.0025651301,0.0010668407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009408371,0.00014570475,0.0016820481,0.0004134631,0.00014296071,0.00033758476,0.00060691906,0.006907211,0.007368464,0.9365836,0.011559743,0.03331143],"study_design_scores_gemma":[0.00013577359,0.000076954464,0.0017825583,0.000046023357,0.00011753552,0.0005426486,0.00027808867,0.013253628,0.003370516,0.9708439,0.009517033,0.00003526244],"about_ca_topic_score_codex":0.0008175837,"about_ca_topic_score_gemma":0.0007889941,"teacher_disagreement_score":0.00762007,"about_ca_system_score_codex":0.0012908156,"about_ca_system_score_gemma":0.0013869512,"threshold_uncertainty_score":0.025491655},"labels":[],"label_agreement":null},{"id":"W1979637305","doi":"10.1016/j.dam.2004.07.007","title":"Minimization of ordered, symmetric half-products","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Minification; Algebra over a field; Mathematical optimization; Pure mathematics","score_opus":0.021628327450887167,"score_gpt":0.2727581203581696,"score_spread":0.25112979290728243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979637305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44391653,0.00067438034,0.4905083,0.0008415609,0.00027682743,0.00012213984,0.000740462,0.00033330976,0.062586546],"genre_scores_gemma":[0.7667345,0.00067902316,0.1693479,0.0003063057,0.00017949115,0.00020493763,0.0011927101,0.00076652045,0.060588542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999526,0.00010616939,0.000027771186,0.00009463771,0.00016977474,0.00007565019],"domain_scores_gemma":[0.99883026,0.00044866302,0.000106937085,0.00017020658,0.0002628306,0.00018113111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065007724,0.00054008677,0.00075452134,0.0007035053,0.00059176417,0.0016530685,0.0013964741,0.0008281103,0.010342331],"category_scores_gemma":[0.0024818964,0.00045786245,0.0005677133,0.00065396546,0.0008631698,0.0028472631,0.0012335341,0.0011004474,0.0010805267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027503117,0.00018033563,0.00073673297,0.00045800948,0.00006537406,0.00019704108,0.00037865434,0.020934772,0.010424,0.84815377,0.013882802,0.104313485],"study_design_scores_gemma":[0.00003283767,0.00010815168,0.00049728237,0.000038707953,0.00002360983,0.00025741776,0.0002498064,0.08466696,0.009818919,0.89627147,0.008014171,0.000020625368],"about_ca_topic_score_codex":0.0004061243,"about_ca_topic_score_gemma":0.0007610835,"teacher_disagreement_score":0.010342331,"about_ca_system_score_codex":0.0006192582,"about_ca_system_score_gemma":0.0005801719,"threshold_uncertainty_score":0.03459853},"labels":[],"label_agreement":null},{"id":"W1979733770","doi":"10.1016/s0012-365x(03)00311-x","title":"Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Variable neighborhood search; Heuristic; Variable (mathematics); Algebraic number; Series (stratigraphy); Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Metaheuristic","score_opus":0.051255614563814056,"score_gpt":0.3153195008242945,"score_spread":0.26406388626048044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979733770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12542081,0.00072558527,0.83501863,0.004638399,0.00027458012,0.00024924698,0.00038322268,0.0015257857,0.03176368],"genre_scores_gemma":[0.593957,0.00031831054,0.39487007,0.0006848307,0.00019461673,0.00028788144,0.000712922,0.0002899503,0.008684418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968836,0.0013309409,0.00014380988,0.000570148,0.0006605219,0.00041098328],"domain_scores_gemma":[0.9801276,0.01100324,0.00081046805,0.006345293,0.0010811512,0.0006323042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038118078,0.0005527025,0.0014038441,0.0015894535,0.0019691414,0.0029142878,0.004877081,0.0027065433,0.00915898],"category_scores_gemma":[0.025193136,0.0005674963,0.001574994,0.0016267457,0.0037969258,0.008140903,0.005469635,0.0031991166,0.0012650597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008093426,0.00028482842,0.0064282427,0.00040065477,0.00010449342,0.00020312892,0.0006114779,0.03293359,0.0030880393,0.8243534,0.012622031,0.11816072],"study_design_scores_gemma":[0.00011234317,0.00009580424,0.0006849482,0.000052452608,0.000047733232,0.00014305589,0.0002035473,0.16997698,0.0029576502,0.8207329,0.0049540345,0.000038565704],"about_ca_topic_score_codex":0.0012301626,"about_ca_topic_score_gemma":0.002132226,"teacher_disagreement_score":0.00915898,"about_ca_system_score_codex":0.0009215469,"about_ca_system_score_gemma":0.0011099946,"threshold_uncertainty_score":0.030639827},"labels":[],"label_agreement":null},{"id":"W1979947096","doi":"10.1016/s0012-365x(00)00369-1","title":"The upper domination Ramsey number u(3,3,3)","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Ramsey's theorem; Domination analysis; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Vertex (graph theory); Computer science","score_opus":0.024625825096035517,"score_gpt":0.2973754815534076,"score_spread":0.2727496564573721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979947096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74949574,0.0016933763,0.038505476,0.0039682267,0.00047654402,0.00006105467,0.0010702861,0.00073750614,0.2039918],"genre_scores_gemma":[0.97683835,0.0003504944,0.0066426764,0.00037708282,0.00013476342,0.00004768922,0.00027685647,0.00007952748,0.015252446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995352,0.00011438478,0.000016443053,0.00011377053,0.00008415596,0.00013614485],"domain_scores_gemma":[0.9987342,0.0006655963,0.000145716,0.00012482639,0.00008509254,0.00024454552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005824735,0.00040924567,0.0006477346,0.0013169866,0.0032130326,0.0026791047,0.00063116645,0.0009474376,0.012609825],"category_scores_gemma":[0.0021195202,0.00029772703,0.0003589901,0.0011352726,0.0018271062,0.0025992214,0.0014227688,0.0017878107,0.0012897698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042954375,0.000043145094,0.0008486684,0.00013463691,0.000016609727,0.00014788975,0.0005334058,0.0017046862,0.0055337385,0.9496328,0.011395244,0.029579736],"study_design_scores_gemma":[0.000044988097,0.00004406791,0.0013518109,0.00004195296,0.000022743958,0.00037940452,0.00018572774,0.005803782,0.0051147663,0.9706937,0.016282154,0.00003477966],"about_ca_topic_score_codex":0.0011575327,"about_ca_topic_score_gemma":0.0011107409,"teacher_disagreement_score":0.012609825,"about_ca_system_score_codex":0.00087322865,"about_ca_system_score_gemma":0.00061886525,"threshold_uncertainty_score":0.042183995},"labels":[],"label_agreement":null},{"id":"W1980213624","doi":"10.1016/j.dam.2011.01.014","title":"Separator orders in interval, cocomparability, and AT-free graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Separator (oil production); Combinatorics; Interval graph; Interval (graph theory); Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.041937089263702064,"score_gpt":0.29236340334544086,"score_spread":0.2504263140817388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980213624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7069653,0.000701373,0.17127559,0.0017179754,0.00017006781,0.000079865924,0.0015238014,0.0005068049,0.11705928],"genre_scores_gemma":[0.9619347,0.00040075884,0.01989117,0.00024003076,0.00015763685,0.00007366937,0.0010507074,0.00016569585,0.016085701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999223,0.00013115672,0.00004955284,0.00018781582,0.0002337923,0.00017468103],"domain_scores_gemma":[0.9934617,0.003458926,0.00086753245,0.0007059443,0.0006602455,0.0008456612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007058313,0.00044705928,0.0009854265,0.0021899866,0.0024340856,0.0037673605,0.0012549219,0.0011200097,0.010769977],"category_scores_gemma":[0.0041169203,0.00057586504,0.0008157507,0.0028307538,0.0032275626,0.0050869053,0.001534994,0.003176496,0.0008329433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001275546,0.000039350536,0.00074940524,0.000047077836,0.000012223837,0.000116409916,0.00040678587,0.0026048883,0.0008437831,0.98554176,0.0016459518,0.007864717],"study_design_scores_gemma":[0.000033784683,0.000019037861,0.0005091056,0.0000133745125,0.000016075548,0.000114606344,0.00017938214,0.006748765,0.0006460609,0.9892726,0.0024313286,0.000015893278],"about_ca_topic_score_codex":0.0027029468,"about_ca_topic_score_gemma":0.003170212,"teacher_disagreement_score":0.010769977,"about_ca_system_score_codex":0.0012287059,"about_ca_system_score_gemma":0.0007208631,"threshold_uncertainty_score":0.0360291},"labels":[],"label_agreement":null},{"id":"W1980595063","doi":"10.1016/j.tcs.2010.07.003","title":"Cops and Robbers from a distance","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Upper and lower bounds; Graph; Zigzag; Function (biology); Discrete mathematics; Geometry","score_opus":0.0074750399545815875,"score_gpt":0.26657268459215955,"score_spread":0.25909764463757795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980595063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3048199,0.002099139,0.48431394,0.006329482,0.00067455706,0.00016163837,0.0005620087,0.0005786202,0.20046076],"genre_scores_gemma":[0.81604975,0.0011582979,0.075135745,0.00085890014,0.0006153727,0.00024543097,0.00060948456,0.0005221385,0.104804866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980902,0.0004528922,0.00008817089,0.00046134513,0.00057667674,0.00033062114],"domain_scores_gemma":[0.99616677,0.0019329665,0.00032846123,0.0005576625,0.0004407575,0.0005732893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083212304,0.0010358365,0.0020871577,0.0029087851,0.0036834371,0.0038166384,0.0023955568,0.0028709238,0.021015998],"category_scores_gemma":[0.008977373,0.0010100405,0.0014745375,0.002296373,0.0048209904,0.008156121,0.0064912857,0.004158107,0.0026594554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049966464,0.000020029624,0.00017799187,0.00006508669,0.000018501527,0.00012196297,0.00040281905,0.002793613,0.00044889204,0.98508644,0.0029260288,0.007888683],"study_design_scores_gemma":[0.00001363974,0.000019273786,0.00017316097,0.000017949424,0.0000112237785,0.00013467448,0.00016555942,0.0073577687,0.00025474216,0.98577166,0.006068525,0.0000119168235],"about_ca_topic_score_codex":0.0017579969,"about_ca_topic_score_gemma":0.0014316174,"teacher_disagreement_score":0.021015998,"about_ca_system_score_codex":0.0010686961,"about_ca_system_score_gemma":0.000605006,"threshold_uncertainty_score":0.070305526},"labels":[],"label_agreement":null},{"id":"W1980634280","doi":"10.1016/j.disc.2011.11.032","title":"A degree condition for cycles of maximum length in bipartite digraphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Digraph; Mathematics; Combinatorics; Degree (music); Hamiltonian (control theory); Discrete mathematics; Graph; Physics","score_opus":0.08954373980614025,"score_gpt":0.3256156053587312,"score_spread":0.23607186555259094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980634280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6498087,0.0014505062,0.26584518,0.006080188,0.0007665124,0.00048284722,0.004826525,0.0012963071,0.06944321],"genre_scores_gemma":[0.9445124,0.00097612065,0.03799288,0.001248385,0.00082441437,0.00044027716,0.0022058224,0.0005565142,0.011243146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979031,0.00036681135,0.00018806693,0.00064601575,0.00038534732,0.00051066396],"domain_scores_gemma":[0.967744,0.021504486,0.001820899,0.0019647675,0.0029184856,0.0040474012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019513189,0.0012641479,0.0020985673,0.00349564,0.0033489747,0.0043728123,0.0027975806,0.003561282,0.012287387],"category_scores_gemma":[0.02404442,0.0017405429,0.002103524,0.0036791153,0.0041044136,0.010114492,0.003885541,0.004795269,0.0017289396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000994408,0.00024058456,0.003984717,0.0005736676,0.00007915605,0.00068400806,0.0014841987,0.016413314,0.01456272,0.93208,0.009308912,0.019594364],"study_design_scores_gemma":[0.00021519214,0.0001576752,0.0016273209,0.00012110921,0.00007715721,0.00047320672,0.00046717547,0.042930502,0.0044963537,0.94399154,0.0053260922,0.00011665067],"about_ca_topic_score_codex":0.0030724795,"about_ca_topic_score_gemma":0.0041763955,"teacher_disagreement_score":0.012287387,"about_ca_system_score_codex":0.0024029845,"about_ca_system_score_gemma":0.0020603342,"threshold_uncertainty_score":0.04110539},"labels":[],"label_agreement":null},{"id":"W1980709314","doi":"10.4236/ojdm.2013.33029","title":"Multiple Circular Colouring as a Model for Scheduling","year":2013,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Chromatic scale; Mathematics; Scheduling (production processes); Graph; Combinatorics; Computer science; Mathematical optimization; Discrete mathematics","score_opus":0.058188764967941606,"score_gpt":0.3432924704403453,"score_spread":0.28510370547240366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980709314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021177042,0.00034294196,0.9648644,0.00048562454,0.0001476447,0.0000849833,0.00011043902,0.00024440265,0.012542651],"genre_scores_gemma":[0.6384204,0.0010212392,0.33493426,0.000496787,0.00020848858,0.0004766993,0.00037120777,0.00034686865,0.02372406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899703,0.000325116,0.000040534625,0.00021064805,0.00027280924,0.00015386184],"domain_scores_gemma":[0.9986765,0.0005543592,0.00013519307,0.00032834985,0.00016462279,0.0001408636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009980415,0.0007500923,0.00046480302,0.00055218255,0.0008293932,0.001336821,0.0018988486,0.0011943573,0.004491047],"category_scores_gemma":[0.0021275997,0.00045978074,0.00086733163,0.00093554804,0.0015111185,0.002650754,0.0010650007,0.0017070838,0.00071165984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013168507,0.00006569831,0.00029250208,0.00010484872,0.000022588123,0.00015002351,0.00018259104,0.3180414,0.0056703365,0.66074383,0.0024041987,0.012190326],"study_design_scores_gemma":[0.000052419102,0.00008729941,0.00011264495,0.000018943378,0.000017000406,0.00011495215,0.00004282756,0.69398093,0.0017513207,0.2896323,0.014165098,0.000024323595],"about_ca_topic_score_codex":0.0033949455,"about_ca_topic_score_gemma":0.0027676525,"teacher_disagreement_score":0.004491047,"about_ca_system_score_codex":0.001890969,"about_ca_system_score_gemma":0.0014747826,"threshold_uncertainty_score":0.015024066},"labels":[],"label_agreement":null},{"id":"W1981011157","doi":"10.1016/j.disc.2014.02.006","title":"Binary matroids with no 4-spike minors","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Combinatorics; Minor (academic); Mathematics; Binary number; Simple (philosophy); Rank (graph theory); Circumference; Bounding overwatch; Discrete mathematics; Computer science; Arithmetic","score_opus":0.012548588064515712,"score_gpt":0.26391457852280636,"score_spread":0.25136599045829067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981011157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7443773,0.00035845445,0.11540514,0.0032886053,0.0006118494,0.00021788428,0.0022094515,0.0009868371,0.13254462],"genre_scores_gemma":[0.88805926,0.00032197172,0.048611615,0.001254551,0.00037081135,0.00024871767,0.0026761966,0.00051941775,0.057937287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989497,0.00017937759,0.00008433196,0.00024214738,0.00028059923,0.00026389665],"domain_scores_gemma":[0.9975903,0.00061536604,0.00047419884,0.00042878062,0.00033143078,0.0005600199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055641227,0.000994674,0.0013343602,0.0011443376,0.0019967516,0.004342848,0.0017714646,0.0021254586,0.01599104],"category_scores_gemma":[0.0031659368,0.0011740727,0.0011895252,0.0014397886,0.0015230023,0.004723195,0.0029438664,0.0036302628,0.0035002688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080999185,0.00031306795,0.0011606836,0.00025942948,0.000066982946,0.00065874046,0.000513834,0.002993187,0.016952142,0.9322609,0.015523481,0.028487675],"study_design_scores_gemma":[0.0001500558,0.00011187896,0.00094784104,0.000036107653,0.0000403272,0.0009405941,0.00028394882,0.016205369,0.0054447767,0.9661049,0.009683961,0.000050251037],"about_ca_topic_score_codex":0.00047840463,"about_ca_topic_score_gemma":0.000778159,"teacher_disagreement_score":0.01599104,"about_ca_system_score_codex":0.0009828503,"about_ca_system_score_gemma":0.0006886865,"threshold_uncertainty_score":0.053495347},"labels":[],"label_agreement":null},{"id":"W1981167177","doi":"10.1007/s11083-010-9175-z","title":"Join-Irreducible Boolean Functions","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Join (topology); Irreducibility; Discrete mathematics; Order (exchange); Omega; Pure mathematics","score_opus":0.01812048192973254,"score_gpt":0.2922381663705092,"score_spread":0.27411768444077667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981167177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28640434,0.0017802084,0.4193993,0.0036204692,0.00080234424,0.00012910325,0.00097639934,0.0012532608,0.28563473],"genre_scores_gemma":[0.8763686,0.0016408584,0.047328975,0.00093413214,0.0010523549,0.00011028938,0.0009894142,0.00046516463,0.07111022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988226,0.00018971933,0.000052805284,0.0002438792,0.00044800717,0.0002429787],"domain_scores_gemma":[0.9978708,0.0010611332,0.00017244223,0.0002927637,0.00028270934,0.00032009213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012224143,0.0008822271,0.0010146637,0.0029022733,0.0022851957,0.0050565596,0.0009195866,0.000998999,0.009177216],"category_scores_gemma":[0.0030906969,0.0004926315,0.0010665887,0.0030613146,0.003294642,0.0066464813,0.002343082,0.0038475443,0.0018277367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003754974,0.000027445842,0.000085938926,0.000021353897,0.000003457003,0.000027401173,0.00011330067,0.00019134367,0.0006029627,0.9905918,0.0012938849,0.0070034773],"study_design_scores_gemma":[0.000011744549,0.000011146408,0.00012610875,0.000008939682,0.000014359234,0.00008030858,0.000048482892,0.0015185804,0.0015147156,0.99068624,0.0059684822,0.000010989465],"about_ca_topic_score_codex":0.00064415566,"about_ca_topic_score_gemma":0.0010355129,"teacher_disagreement_score":0.009177216,"about_ca_system_score_codex":0.00170038,"about_ca_system_score_gemma":0.0009089854,"threshold_uncertainty_score":0.030700803},"labels":[],"label_agreement":null},{"id":"W1981391255","doi":"10.4310/joc.2013.v4.n3.a2","title":"Complements of nearly perfect graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Hungarian Scientific Research Fund; Fonds Québécois de la Recherche sur la Nature et les Technologies; Agence Nationale de la Recherche","keywords":"Class (philosophy); Bounded function; Trivially perfect graph; Chordal graph; Indifference graph; Function (biology); Clique-sum","score_opus":0.018441708194938358,"score_gpt":0.28255513332557425,"score_spread":0.2641134251306359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981391255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8696059,0.0009819041,0.06969776,0.0006976938,0.00012763363,0.000077504264,0.0011467192,0.0002788878,0.057386033],"genre_scores_gemma":[0.9827474,0.00037622897,0.009943775,0.0001497132,0.000085329724,0.000069273476,0.001069647,0.000073718584,0.005484943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990306,0.00018887884,0.000039883107,0.00024065831,0.00030212992,0.00019789388],"domain_scores_gemma":[0.9967649,0.0012359646,0.0005599956,0.00034975805,0.00049471663,0.0005947089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072082324,0.0003934775,0.0006447315,0.001662739,0.0014201386,0.0026543152,0.0007772738,0.0006901675,0.005375711],"category_scores_gemma":[0.004194172,0.00043490177,0.00057455915,0.0010024074,0.0026170388,0.0035467967,0.0021023133,0.0009410931,0.00034801036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014849206,0.00002324249,0.0021728019,0.000056520068,0.000018865474,0.00022084925,0.0004032614,0.0046092896,0.0022294533,0.979427,0.001706843,0.008983334],"study_design_scores_gemma":[0.000028738063,0.00006205344,0.0041873413,0.00007208224,0.0000356241,0.00068011833,0.0008143166,0.030624019,0.0028648516,0.9423704,0.018221324,0.000039129078],"about_ca_topic_score_codex":0.0037254728,"about_ca_topic_score_gemma":0.0023029428,"teacher_disagreement_score":0.005375711,"about_ca_system_score_codex":0.0012577687,"about_ca_system_score_gemma":0.0006894262,"threshold_uncertainty_score":0.017983556},"labels":[],"label_agreement":null},{"id":"W1981399828","doi":"10.1016/s0166-218x(03)00304-4","title":"Hereditary dominating pair graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Research Council Canada; National Science Council","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Path graph; Dominating set; Induced path; Graph; Discrete mathematics; Line graph; Pathwidth; Graph power","score_opus":0.018307557652128232,"score_gpt":0.2723833924507984,"score_spread":0.2540758347986702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981399828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46828675,0.0010304813,0.20648162,0.0025773079,0.00030191423,0.00022821284,0.0019399403,0.000724191,0.31842965],"genre_scores_gemma":[0.8917894,0.000664025,0.032108564,0.00045962256,0.00013712056,0.0001270545,0.0018612158,0.0001432034,0.072709784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937457,0.00014838834,0.000022808168,0.00019164532,0.00015444227,0.000108271866],"domain_scores_gemma":[0.9980496,0.00082655234,0.00017765822,0.00031328274,0.00027195798,0.0003609647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054068526,0.0005536033,0.000586145,0.0011072409,0.0018675865,0.0022786765,0.00096071756,0.00069823966,0.014016102],"category_scores_gemma":[0.0019040075,0.0005356996,0.00044489407,0.001179702,0.0010408236,0.003403874,0.0016720966,0.0014069257,0.0013868443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007472759,0.000045596145,0.0008188742,0.00008448636,0.000022398168,0.00018514546,0.00031229877,0.0015233636,0.0025426822,0.9738253,0.006745396,0.013819729],"study_design_scores_gemma":[0.00003838907,0.00004956221,0.0010423227,0.000027951182,0.00006486288,0.0006891286,0.00040600702,0.01072709,0.005275526,0.9564016,0.025261011,0.000016531369],"about_ca_topic_score_codex":0.00043410299,"about_ca_topic_score_gemma":0.0007448139,"teacher_disagreement_score":0.014016102,"about_ca_system_score_codex":0.0011502923,"about_ca_system_score_gemma":0.0005490724,"threshold_uncertainty_score":0.04688847},"labels":[],"label_agreement":null},{"id":"W1981737915","doi":"10.1016/j.disc.2007.03.017","title":"Perfect matchings after vertex deletions","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Factor-critical graph; Distance-hereditary graph; Perfect graph theorem; Discrete mathematics; Induced subgraph; Graph; Line graph; Pathwidth; Graph power","score_opus":0.013243460046563798,"score_gpt":0.29337321976176767,"score_spread":0.2801297597152039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981737915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5057423,0.0016019499,0.344511,0.0038228508,0.0011620983,0.00040929898,0.0025494376,0.0028893843,0.1373117],"genre_scores_gemma":[0.8746051,0.00087771873,0.060504835,0.00086389756,0.00029451767,0.00020033123,0.0017235203,0.00078624865,0.06014379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981937,0.00035838023,0.00012079248,0.00041451774,0.0004446842,0.00046796104],"domain_scores_gemma":[0.9915244,0.0037539275,0.00086311187,0.0025351944,0.0006919819,0.00063143607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018883924,0.0007713403,0.0016513342,0.0021424438,0.0025488955,0.0028430829,0.002419516,0.0022641735,0.014935344],"category_scores_gemma":[0.01464249,0.0011762151,0.0014079068,0.0032393886,0.0019364633,0.007709095,0.0031406048,0.0033004375,0.0027108546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069193664,0.00015460822,0.0009350423,0.00025112342,0.000071463706,0.000721098,0.00062398746,0.012392579,0.006525543,0.91534853,0.012531319,0.04975281],"study_design_scores_gemma":[0.0000680945,0.000039740768,0.0004437415,0.00003528023,0.000046611938,0.000284581,0.00016589634,0.015031962,0.0035454782,0.97325504,0.007064904,0.000018676674],"about_ca_topic_score_codex":0.0012161805,"about_ca_topic_score_gemma":0.0015900651,"teacher_disagreement_score":0.014935344,"about_ca_system_score_codex":0.001257906,"about_ca_system_score_gemma":0.0012480583,"threshold_uncertainty_score":0.049963713},"labels":[],"label_agreement":null},{"id":"W1981843507","doi":"10.1016/j.dam.2010.02.011","title":"A General Label Search to investigate classical graph search algorithms","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Search algorithm; Algorithm; Graph; Mathematical optimization; Combinatorics","score_opus":0.03913475955611867,"score_gpt":0.3226654876041811,"score_spread":0.28353072804806245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981843507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03491909,0.002523097,0.9200814,0.0040512253,0.00036314756,0.00022432073,0.00048573106,0.00032410803,0.037027854],"genre_scores_gemma":[0.48927796,0.0035181458,0.4287538,0.003655853,0.0018774988,0.00074403355,0.0012278252,0.0009838362,0.06996104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741983,0.0012494784,0.00006934906,0.00048248234,0.0005231271,0.00025574517],"domain_scores_gemma":[0.992322,0.005717968,0.00029490291,0.0006986102,0.00061386655,0.0003526805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003540617,0.0011776295,0.0019607514,0.0028586728,0.0019437455,0.0034810598,0.004194107,0.004473527,0.01095377],"category_scores_gemma":[0.018147957,0.0007092127,0.0019476209,0.004472183,0.0040021804,0.0104977265,0.0037699598,0.0047267424,0.0016783791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006911134,0.000087568194,0.00035825867,0.0001874868,0.000028823084,0.000042817202,0.00011290053,0.027751595,0.0010498923,0.94852734,0.0067189005,0.015065333],"study_design_scores_gemma":[0.000035139878,0.000052847026,0.00012347999,0.000038047372,0.000024785915,0.000059571666,0.000043023618,0.24457039,0.00041869938,0.7498718,0.0047450443,0.000017242475],"about_ca_topic_score_codex":0.0019479323,"about_ca_topic_score_gemma":0.0020846138,"teacher_disagreement_score":0.01095377,"about_ca_system_score_codex":0.0029266067,"about_ca_system_score_gemma":0.0020628693,"threshold_uncertainty_score":0.03664404},"labels":[],"label_agreement":null},{"id":"W1981884232","doi":"10.1016/j.disc.2005.12.048","title":"Can transitive orientation make sandwich problems easier?","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Transitive relation; Combinatorics; Mathematics; Partially ordered set; Comparability graph; Transitive reduction; Orientation (vector space); Comparability; Graph; Discrete mathematics; Line graph; Pathwidth; Voltage graph","score_opus":0.01616633255282864,"score_gpt":0.27545241161224837,"score_spread":0.25928607905941975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981884232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2008371,0.0014083572,0.62164533,0.011626014,0.0035842892,0.00024306313,0.0004465389,0.002378597,0.15783073],"genre_scores_gemma":[0.7113298,0.0014889194,0.22296831,0.0028350626,0.0010582979,0.00029021292,0.0009126205,0.001963519,0.057153255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982711,0.0005955959,0.00011471349,0.00038827767,0.00026431886,0.00036603617],"domain_scores_gemma":[0.98918825,0.0054663178,0.0006067818,0.003301197,0.00063400384,0.0008033538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031578285,0.0013237201,0.001533731,0.00079822814,0.0022143438,0.0039513684,0.0026876095,0.003732502,0.049697485],"category_scores_gemma":[0.018389046,0.0012531255,0.0021314167,0.0010435738,0.0027315267,0.025626445,0.004422508,0.0064629843,0.0092595015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019691215,0.00018135607,0.0004663536,0.00023159434,0.00003679882,0.00013730949,0.00029250508,0.004033915,0.00210074,0.9357393,0.012701092,0.04388203],"study_design_scores_gemma":[0.000034790126,0.000027074791,0.00008942938,0.000027657441,0.000017725424,0.00007090752,0.00015888916,0.004265695,0.00092024973,0.99006313,0.004309499,0.000014955728],"about_ca_topic_score_codex":0.0004067485,"about_ca_topic_score_gemma":0.00065530837,"teacher_disagreement_score":0.049697485,"about_ca_system_score_codex":0.0006040723,"about_ca_system_score_gemma":0.0009148472,"threshold_uncertainty_score":0.16625464},"labels":[],"label_agreement":null},{"id":"W1982050567","doi":"10.1007/s00373-012-1270-z","title":"Solving Partition Problems with Colour-Bipartitions","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Indifference graph; Pathwidth; Discrete mathematics; Homomorphism; Partition (number theory); Vertex (graph theory); Time complexity; Graph; Line graph","score_opus":0.021424106780662405,"score_gpt":0.24812032415968993,"score_spread":0.22669621737902754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982050567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39466515,0.0013484447,0.5475037,0.004370261,0.00046959735,0.0006054672,0.001327791,0.0016366051,0.048073046],"genre_scores_gemma":[0.659429,0.00080531713,0.3152454,0.0009126048,0.0003143326,0.00043288225,0.0026191736,0.0009447329,0.019296486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780196,0.00080542255,0.00010448858,0.0004619761,0.0003197466,0.00050651905],"domain_scores_gemma":[0.9903868,0.007389697,0.00040839837,0.000982931,0.000327832,0.0005043595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021672093,0.0016466939,0.0022213832,0.001620019,0.0023922417,0.004953372,0.0036719944,0.004500977,0.016047629],"category_scores_gemma":[0.016468005,0.001635208,0.00247579,0.0029891673,0.003287216,0.010554243,0.0049047493,0.005245864,0.0017110573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019226721,0.001294225,0.0024987368,0.0015324656,0.00029878106,0.0005111366,0.0014974029,0.35699993,0.0075741895,0.43756402,0.034834653,0.15347186],"study_design_scores_gemma":[0.00026399753,0.0001385628,0.00028078523,0.000081725164,0.000089235786,0.00012223753,0.00048241054,0.20731123,0.0024654162,0.78452206,0.0042090663,0.000033287088],"about_ca_topic_score_codex":0.0034771664,"about_ca_topic_score_gemma":0.005212413,"teacher_disagreement_score":0.016047629,"about_ca_system_score_codex":0.0017982962,"about_ca_system_score_gemma":0.0017007021,"threshold_uncertainty_score":0.05368465},"labels":[],"label_agreement":null},{"id":"W1982107102","doi":"10.1016/j.ipl.2006.01.013","title":"On the structure of certain intersection graphs","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Intersection (aeronautics); Computer science; Data structure; Combinatorics; Mathematics; Discrete mathematics; Programming language; Engineering","score_opus":0.007812606576568194,"score_gpt":0.2381557933190754,"score_spread":0.23034318674250723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982107102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8013448,0.00060817885,0.12875575,0.0023589313,0.000059031914,0.000097593926,0.0013155162,0.00042167152,0.06503855],"genre_scores_gemma":[0.9481629,0.0007624731,0.03941347,0.00034352037,0.00016566447,0.00012162186,0.0029055548,0.00021936138,0.007905276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990584,0.00022659932,0.0000467636,0.0002020911,0.0002565959,0.00020943725],"domain_scores_gemma":[0.9884312,0.0068674474,0.0016591091,0.0007598614,0.0012909712,0.00099141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010794464,0.00055714016,0.0009468204,0.0044901683,0.003653799,0.0039888364,0.0018274714,0.0014307281,0.008869736],"category_scores_gemma":[0.00727136,0.00090175733,0.0008154293,0.004431217,0.003134052,0.0075261616,0.0022085612,0.0031956849,0.00080073724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013255139,0.000060276463,0.0016247081,0.000055378132,0.000018433087,0.00014896758,0.00071078225,0.0021953473,0.0012777338,0.98288584,0.002163809,0.008726223],"study_design_scores_gemma":[0.000019102547,0.000021149272,0.00080024474,0.000024340805,0.00002133691,0.0001948259,0.0003673731,0.013016878,0.000915811,0.9820672,0.002537183,0.000014438733],"about_ca_topic_score_codex":0.0011308113,"about_ca_topic_score_gemma":0.0011746332,"teacher_disagreement_score":0.008869736,"about_ca_system_score_codex":0.0013578559,"about_ca_system_score_gemma":0.0008247089,"threshold_uncertainty_score":0.029672205},"labels":[],"label_agreement":null},{"id":"W1982321501","doi":"10.1016/j.aim.2011.03.015","title":"Exponentially many perfect matchings in cubic graphs","year":2011,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Seventh Framework Programme; Agentúra na Podporu Výskumu a Vývoja; National Science Foundation","keywords":"Lemma (botany); Mathematics; Conjecture; Cubic graph; Exposition (narrative); Combinatorics; Graph; Exponential growth; Discrete mathematics; Line graph; Mathematical analysis; Voltage graph","score_opus":0.026881069079637696,"score_gpt":0.29544386877180084,"score_spread":0.2685627996921631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982321501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81210566,0.0028774636,0.094738066,0.016111214,0.00062930246,0.0002136151,0.0026609574,0.001410167,0.069253616],"genre_scores_gemma":[0.960635,0.0011459047,0.019581743,0.0011984975,0.0005174105,0.00020256388,0.0012406578,0.00029126139,0.015187019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645114,0.0009090938,0.00017224076,0.0006250149,0.0010869913,0.0007554492],"domain_scores_gemma":[0.97318757,0.019030616,0.001932936,0.0023133154,0.0014508894,0.0020848105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027591793,0.0009818634,0.0023658865,0.002454745,0.004154699,0.006321055,0.003988526,0.003813635,0.013833785],"category_scores_gemma":[0.035073463,0.0019019091,0.0015894459,0.0041884384,0.004333178,0.013167676,0.0047025816,0.005528253,0.0014151018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014975475,0.00032644684,0.004397152,0.00070440135,0.00016727568,0.0005105952,0.0010256195,0.03262501,0.0039384053,0.9003973,0.023468947,0.030941384],"study_design_scores_gemma":[0.00019333664,0.00003984746,0.00084343035,0.00004055765,0.00006635118,0.00025570113,0.0002538066,0.049918167,0.0008329497,0.9450141,0.002515463,0.000026200103],"about_ca_topic_score_codex":0.0027662592,"about_ca_topic_score_gemma":0.0052787596,"teacher_disagreement_score":0.013833785,"about_ca_system_score_codex":0.0042691785,"about_ca_system_score_gemma":0.0024626052,"threshold_uncertainty_score":0.046278656},"labels":[],"label_agreement":null},{"id":"W1982842138","doi":"10.1016/j.aam.2014.02.002","title":"A geometric version of the Andrásfai–Erdős–Sós Theorem","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Mathematics; Combinatorics; Matroid; Integer (computer science); Rank (graph theory); Binary number; Discrete mathematics; Simple (philosophy); Graphic matroid; Affine transformation; Graph; Upper and lower bounds; Geometry; Arithmetic; Mathematical analysis","score_opus":0.00964440343855563,"score_gpt":0.2692203123829219,"score_spread":0.2595759089443663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982842138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058377232,0.0036713763,0.5257445,0.0153366225,0.0026504477,0.00018100002,0.0019745918,0.0006050828,0.3914591],"genre_scores_gemma":[0.77330005,0.0069767414,0.09153615,0.0060669403,0.003952463,0.00034164722,0.0017321344,0.0006575372,0.11543635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868387,0.00025865843,0.00006178832,0.00038718848,0.00042216576,0.00018636294],"domain_scores_gemma":[0.99817574,0.00063800765,0.00028679884,0.00028598195,0.00044811214,0.00016540384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011735858,0.0009830194,0.0012196283,0.0023434276,0.0018186963,0.002337303,0.0015888883,0.001643508,0.019562831],"category_scores_gemma":[0.0051216222,0.00046053762,0.0013337345,0.0020446156,0.0034853583,0.006541502,0.004298382,0.004370579,0.003852396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001833848,0.00000897643,0.00015342546,0.00005934068,0.000011956975,0.000036742164,0.00006341251,0.0011101938,0.0005169926,0.98587996,0.005223086,0.006917581],"study_design_scores_gemma":[0.000013024337,0.000012212617,0.00022255574,0.000014287366,0.000009085639,0.000117855605,0.000039778526,0.0031801495,0.0002377731,0.9824844,0.013655744,0.000013111212],"about_ca_topic_score_codex":0.0009400993,"about_ca_topic_score_gemma":0.0007023645,"teacher_disagreement_score":0.019562831,"about_ca_system_score_codex":0.0011937533,"about_ca_system_score_gemma":0.0009163106,"threshold_uncertainty_score":0.06544423},"labels":[],"label_agreement":null},{"id":"W1983971177","doi":"10.5539/jmr.v7n1p1","title":"Eccentric Coloring of a Graph","year":2015,"lang":"","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Lexicographical order; Graph; Chromatic scale; Fractional coloring; Graph power; Line graph","score_opus":0.270494518278048,"score_gpt":0.44991933732218525,"score_spread":0.17942481904413726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983971177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5534872,0.0005750543,0.3299399,0.0009876695,0.00022901857,0.000105659594,0.0013322702,0.00073987345,0.11260336],"genre_scores_gemma":[0.8837309,0.00055632164,0.09320381,0.00031089614,0.00018612517,0.0000835658,0.0011649547,0.0001835964,0.02057985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933654,0.0001246588,0.00004058608,0.00024850562,0.00013335727,0.00011637531],"domain_scores_gemma":[0.99841356,0.00054018875,0.00022000619,0.00034846654,0.00027931292,0.00019846033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041368112,0.00037323232,0.00032167078,0.00072860776,0.0009161164,0.0012626408,0.00036174935,0.0004875054,0.005198129],"category_scores_gemma":[0.0021107642,0.00023634324,0.00028700425,0.0009220541,0.0013718546,0.0016620696,0.0009096057,0.0006869805,0.00063716905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028086564,0.00008455488,0.004638347,0.00018971653,0.000038808153,0.00069699,0.0008357015,0.014968378,0.02691297,0.88193595,0.007895977,0.06152173],"study_design_scores_gemma":[0.000051665596,0.0001707882,0.004761107,0.000056160887,0.00004916374,0.0025249613,0.00062891305,0.07179319,0.012099228,0.83539957,0.07241612,0.000049115937],"about_ca_topic_score_codex":0.0010356471,"about_ca_topic_score_gemma":0.0011112007,"teacher_disagreement_score":0.005198129,"about_ca_system_score_codex":0.0007051129,"about_ca_system_score_gemma":0.00047189195,"threshold_uncertainty_score":0.017389476},"labels":[],"label_agreement":null},{"id":"W1983977135","doi":"10.1002/jgt.10002","title":"Coloring all directed paths in a symmetric tree, with an application to optical networks*","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Directed graph; Tree (set theory); Wavelength-division multiplexing; Arc (geometry); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Wavelength; Telecommunications","score_opus":0.016131353985332345,"score_gpt":0.2866688221256312,"score_spread":0.2705374681402989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983977135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121215776,0.0007526377,0.8635197,0.0013669608,0.00019940422,0.00028502793,0.00023835695,0.00039803542,0.012024008],"genre_scores_gemma":[0.40532517,0.00086726714,0.5865731,0.0003599654,0.0002003185,0.00027045654,0.00032578362,0.0001417289,0.0059362124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917513,0.0002916748,0.00005708192,0.00017051445,0.00017890496,0.00012670095],"domain_scores_gemma":[0.9971597,0.0016824558,0.00033333182,0.0003370572,0.00028262514,0.00020482855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011517829,0.0007062249,0.00084413186,0.00062747294,0.0014915002,0.0010808422,0.0011377243,0.0006778955,0.0022909194],"category_scores_gemma":[0.0029120427,0.00037740526,0.0006980328,0.0012131869,0.0014549902,0.0020189332,0.0013766511,0.0010606913,0.0002874761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005141137,0.00047768131,0.0015727798,0.00085970014,0.00009824813,0.0006007057,0.000638062,0.23265766,0.038969588,0.48108622,0.014567458,0.22795783],"study_design_scores_gemma":[0.000118823176,0.00025630216,0.0004761413,0.000040161824,0.00006438273,0.00051668705,0.00018974674,0.58741474,0.011477362,0.3829499,0.016467568,0.000028215227],"about_ca_topic_score_codex":0.0019666895,"about_ca_topic_score_gemma":0.0031670958,"teacher_disagreement_score":0.0022909194,"about_ca_system_score_codex":0.0014296984,"about_ca_system_score_gemma":0.0013829245,"threshold_uncertainty_score":0.010373175},"labels":[],"label_agreement":null},{"id":"W1984034523","doi":"10.1007/s00373-013-1310-3","title":"A Note on Cyclic Connectivity and Matching Properties of Regular Graphs","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Discrete mathematics; Indifference graph; Graph","score_opus":0.01688209207769032,"score_gpt":0.24026086724360105,"score_spread":0.22337877516591073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984034523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23831865,0.04182041,0.3416555,0.04106797,0.011305058,0.00020991758,0.0025148455,0.0015988469,0.3215088],"genre_scores_gemma":[0.8511946,0.02574281,0.069056705,0.0054448657,0.01797128,0.00015420404,0.001696992,0.0005524007,0.02818613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920183,0.00016010349,0.00005531847,0.000273383,0.00023110595,0.00007830641],"domain_scores_gemma":[0.9878313,0.0094610015,0.00045496426,0.0013287669,0.0005640617,0.00035990204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011783863,0.00072593044,0.0010459308,0.0018641079,0.001342294,0.00236913,0.0019544277,0.0015006592,0.008207697],"category_scores_gemma":[0.009791533,0.00050314463,0.0010524538,0.003847762,0.0029284898,0.0071318615,0.0017860925,0.0031632113,0.00095648295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034177,0.00014055362,0.0023635332,0.00093643414,0.000091794755,0.0014090507,0.0007040615,0.008259847,0.010595748,0.84976155,0.040365167,0.08503046],"study_design_scores_gemma":[0.00002036137,0.0000707471,0.0012551553,0.000055118864,0.000064530446,0.0005015001,0.00014978161,0.0067494093,0.0021243843,0.9563908,0.032576744,0.00004130839],"about_ca_topic_score_codex":0.0016339772,"about_ca_topic_score_gemma":0.0014605138,"teacher_disagreement_score":0.008207697,"about_ca_system_score_codex":0.0008386157,"about_ca_system_score_gemma":0.0004374864,"threshold_uncertainty_score":0.027457535},"labels":[],"label_agreement":null},{"id":"W1984099766","doi":"10.5555/1283383.1283472","title":"Lower bounds on average-case delay for video-on-demand broadcast protocols","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Communication source; Upper and lower bounds; Bandwidth (computing); Atomic broadcast; Video on demand; Matching (statistics); Computer network; Set (abstract data type); Constant (computer programming); Broadcasting (networking); Mathematics; Statistics","score_opus":0.024335974845671633,"score_gpt":0.3356211953914677,"score_spread":0.31128522054579605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984099766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0399482,0.019427786,0.89490014,0.0039057052,0.0007364564,0.00025674046,0.0012742763,0.0016430331,0.037907634],"genre_scores_gemma":[0.7099675,0.024189766,0.23702706,0.0025710298,0.002822853,0.0014255669,0.0024586797,0.002687373,0.016850214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98492604,0.0022849743,0.00089906773,0.0029825906,0.0049707354,0.003936603],"domain_scores_gemma":[0.8782163,0.094911024,0.0058799656,0.007883503,0.0099110035,0.0031981503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012939637,0.0055244947,0.0046331845,0.007246006,0.004481189,0.010301074,0.007233613,0.0035251735,0.009317373],"category_scores_gemma":[0.074910656,0.0020861062,0.00222589,0.0071679177,0.004750718,0.018967323,0.006413352,0.010661288,0.003002861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022111582,0.0008150555,0.0034023244,0.0019402507,0.00037977143,0.00045179774,0.0012997196,0.4697049,0.020093165,0.37526986,0.017593801,0.1068382],"study_design_scores_gemma":[0.000072998846,0.00024367911,0.0008264571,0.00036675122,0.00021217324,0.0005005264,0.0003998281,0.7205612,0.009797219,0.2568831,0.009989156,0.00014692437],"about_ca_topic_score_codex":0.003645867,"about_ca_topic_score_gemma":0.004298239,"teacher_disagreement_score":0.012939637,"about_ca_system_score_codex":0.012648039,"about_ca_system_score_gemma":0.0047599524,"threshold_uncertainty_score":0.091768324},"labels":[],"label_agreement":null},{"id":"W1984128589","doi":"10.1007/s00373-004-0579-7","title":"Spanning Trails Connecting Given Edges","year":2005,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Degree (music); Enhanced Data Rates for GSM Evolution; Multiple edges; Discrete mathematics; Physics; Computer science","score_opus":0.024392160606597258,"score_gpt":0.27269927210987666,"score_spread":0.2483071115032794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984128589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6067004,0.0005015348,0.24846283,0.0013297868,0.0009900621,0.0009024424,0.0042056176,0.0013276542,0.1355797],"genre_scores_gemma":[0.7302218,0.0008013498,0.18690325,0.00048535073,0.00013528389,0.00044424646,0.004043635,0.0002946416,0.076670416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947923,0.00006622466,0.000053066546,0.00012950128,0.00012155489,0.00015049944],"domain_scores_gemma":[0.99687034,0.0007576126,0.00042405928,0.0006555605,0.0007076169,0.00058478053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048173376,0.00049461005,0.00054171414,0.0017659157,0.002546793,0.0027806868,0.0012207667,0.0013461546,0.019574225],"category_scores_gemma":[0.004313244,0.000648878,0.0005892953,0.002188191,0.0007890445,0.0029443423,0.0019027276,0.0013831359,0.0032722636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012919218,0.0008840061,0.006963373,0.001188083,0.00016707879,0.0022774555,0.0017395172,0.010727387,0.034887355,0.71586245,0.023615709,0.2003956],"study_design_scores_gemma":[0.0002302513,0.0004682202,0.00404578,0.0006187321,0.00033374768,0.0021549389,0.0022463428,0.039320365,0.036941186,0.82667315,0.086881675,0.00008563171],"about_ca_topic_score_codex":0.0007700906,"about_ca_topic_score_gemma":0.0020209202,"teacher_disagreement_score":0.019574225,"about_ca_system_score_codex":0.0005745334,"about_ca_system_score_gemma":0.0010539909,"threshold_uncertainty_score":0.06548232},"labels":[],"label_agreement":null},{"id":"W1984228559","doi":"10.1016/j.disc.2003.06.004","title":"Roman domination in graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":556,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Vertex (graph theory); Graph; Dominating set; Minimum weight; Discrete mathematics","score_opus":0.01958927517900732,"score_gpt":0.2969287906505696,"score_spread":0.27733951547156227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984228559","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3851298,0.0016621426,0.06799932,0.004307144,0.00038082266,0.00007716176,0.00028336284,0.00025391762,0.53990626],"genre_scores_gemma":[0.93876314,0.00074638147,0.0078054112,0.00044797707,0.00029057916,0.00006188911,0.00019811922,0.00010211441,0.0515844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860686,0.0005692818,0.000047219717,0.0002053327,0.000314354,0.000256887],"domain_scores_gemma":[0.9973176,0.0014336356,0.00032485867,0.00023587182,0.00034251402,0.0003456055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012216577,0.00042875906,0.00084721326,0.0023500759,0.0031705434,0.0040800944,0.000851904,0.000992173,0.0104602035],"category_scores_gemma":[0.005141162,0.00044885694,0.000594073,0.0023368238,0.004230782,0.0038962583,0.0020651743,0.0025142878,0.001235658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019656138,0.00000481451,0.00011062807,0.000013948062,0.0000024405006,0.000025220717,0.00021060393,0.0003309166,0.00014505564,0.9956381,0.00091916986,0.0025795086],"study_design_scores_gemma":[0.000012372616,0.000005119821,0.00014587176,0.000008429284,0.000004858253,0.0000740917,0.000098835626,0.0016815785,0.00019867072,0.9931184,0.004646265,0.000005581234],"about_ca_topic_score_codex":0.0013805671,"about_ca_topic_score_gemma":0.0014730617,"teacher_disagreement_score":0.0104602035,"about_ca_system_score_codex":0.0014859127,"about_ca_system_score_gemma":0.0006785092,"threshold_uncertainty_score":0.034992874},"labels":[],"label_agreement":null},{"id":"W1984238924","doi":"10.2991/iccnce.2013.32","title":"On the Tree Inclusion Problem","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Tree (set theory); Computer science; Time complexity; K-ary tree; Algorithm; Inclusion (mineral); Mathematics; Tree structure; Theoretical computer science; Mathematical optimization; Combinatorics; Binary tree","score_opus":0.018946320464185443,"score_gpt":0.2726178480970612,"score_spread":0.25367152763287576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984238924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14550073,0.0037306794,0.7974301,0.008546116,0.00056065316,0.0004678539,0.0019617672,0.0014098091,0.04039223],"genre_scores_gemma":[0.433588,0.0053500733,0.5190343,0.0023872966,0.0014238774,0.0006278263,0.00824224,0.0010493407,0.028297044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961564,0.0010562148,0.00030615405,0.0009830903,0.0008913334,0.0006068554],"domain_scores_gemma":[0.98604685,0.010409784,0.0007356332,0.0012614778,0.0009969609,0.00054945255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025746946,0.0011176745,0.0020804182,0.0021154014,0.0033801736,0.0035919072,0.0028628705,0.0028026763,0.0115163],"category_scores_gemma":[0.01513684,0.00084946456,0.0021013243,0.004592645,0.0025707944,0.016573783,0.0055617485,0.0046894546,0.0025662356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009422558,0.0006871971,0.004120392,0.0012131237,0.00017059014,0.0013069656,0.0011767138,0.05918862,0.0053298217,0.5728252,0.042728387,0.31031075],"study_design_scores_gemma":[0.0000885303,0.00011854167,0.0007487036,0.00013083992,0.000070712274,0.0008871708,0.0003834673,0.08382171,0.0030842067,0.8894957,0.02112929,0.000041076797],"about_ca_topic_score_codex":0.0030854985,"about_ca_topic_score_gemma":0.0019400987,"teacher_disagreement_score":0.0115163,"about_ca_system_score_codex":0.0013980203,"about_ca_system_score_gemma":0.0015490707,"threshold_uncertainty_score":0.03852588},"labels":[],"label_agreement":null},{"id":"W1984264511","doi":"10.1016/j.tcs.2005.09.028","title":"H-Coloring dichotomy revisited","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Greedy coloring; Complete coloring; Combinatorics; Discrete mathematics; Complexity of constraint satisfaction; Computational complexity theory; Automaton; Constraint (computer-aided design); Fractional coloring; List coloring; Constraint satisfaction; Graph coloring; Time complexity; Computer science; Local consistency; Theoretical computer science; Algorithm; Graph","score_opus":0.015057328051587939,"score_gpt":0.29933949641029667,"score_spread":0.28428216835870873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984264511","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.220037,0.0038393962,0.12394076,0.07611137,0.0034327458,0.000098103585,0.00086112146,0.00074375916,0.5709359],"genre_scores_gemma":[0.9428965,0.0014037503,0.01605689,0.009131542,0.0018587705,0.000105705876,0.00029148636,0.00014618257,0.028109083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999206,0.00028768578,0.000019426801,0.00017931772,0.00012902808,0.00017862034],"domain_scores_gemma":[0.9969285,0.0019020162,0.00014168587,0.00043107718,0.00023720835,0.0003595216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013899952,0.00033333473,0.0008916006,0.0011762657,0.0031866478,0.0037642315,0.0014444869,0.002599878,0.019030102],"category_scores_gemma":[0.00391567,0.00044089006,0.0006167561,0.0015566169,0.0043519316,0.0067953337,0.0022458052,0.0055333404,0.0013916284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015588397,0.000012279495,0.00008604467,0.000020440615,0.0000028687107,0.000022294473,0.00006392608,0.00016430348,0.00010750836,0.99098045,0.005635703,0.0028884627],"study_design_scores_gemma":[0.0000133541635,0.0000038032658,0.000084523665,0.000007949367,0.000002299755,0.000036928013,0.000073041374,0.00079785514,0.00005999276,0.9966241,0.002293525,0.000002502651],"about_ca_topic_score_codex":0.0008113076,"about_ca_topic_score_gemma":0.00079379947,"teacher_disagreement_score":0.019030102,"about_ca_system_score_codex":0.001471828,"about_ca_system_score_gemma":0.0010286954,"threshold_uncertainty_score":0.06366199},"labels":[],"label_agreement":null},{"id":"W1984989930","doi":"10.1016/j.ejc.2008.09.010","title":"Local Steiner convexity","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Steiner tree problem; Vertex (graph theory); Convexity; Convex set; Regular polygon; Graph; Discrete mathematics; Convex optimization; Geometry","score_opus":0.03156079600770018,"score_gpt":0.25557173935320465,"score_spread":0.22401094334550448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984989930","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13604164,0.0019923432,0.13196014,0.0066643814,0.0005171564,0.000085597356,0.0015958351,0.0005373223,0.7206056],"genre_scores_gemma":[0.77522105,0.0025723241,0.02213842,0.0015903905,0.0006776441,0.00018879729,0.0019264265,0.00081038906,0.19487454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945945,0.000111076704,0.00002194181,0.00014569072,0.00016116453,0.0001006599],"domain_scores_gemma":[0.9991959,0.00029501048,0.00008435788,0.0001600778,0.00014162455,0.00012304929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047829133,0.00083993556,0.0012465175,0.001638293,0.0017481353,0.0029374715,0.0011754833,0.001025589,0.035131995],"category_scores_gemma":[0.0021505244,0.0005809275,0.0011374485,0.0018168662,0.0019058961,0.0051076435,0.0035850024,0.004874601,0.0047485316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028210723,0.000011899669,0.00012933442,0.000047034664,0.000011978093,0.00007335485,0.00007867726,0.0010639115,0.00059667253,0.9836,0.007472101,0.006886813],"study_design_scores_gemma":[0.000012762844,0.000009158168,0.00027358858,0.0000141659675,0.000017553464,0.00027781219,0.000090059955,0.0033307194,0.00056294777,0.98358524,0.011818317,0.0000077639825],"about_ca_topic_score_codex":0.00075548474,"about_ca_topic_score_gemma":0.00096114835,"teacher_disagreement_score":0.035131995,"about_ca_system_score_codex":0.0015026311,"about_ca_system_score_gemma":0.0006137193,"threshold_uncertainty_score":0.1175282},"labels":[],"label_agreement":null},{"id":"W1985078507","doi":"10.1006/eujc.2000.0382","title":"Jump-number of Means on Graphs","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Idempotence; Vertex (graph theory); Jump; Graph; Discrete mathematics","score_opus":0.018218568695760166,"score_gpt":0.27622258504412533,"score_spread":0.2580040163483652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985078507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80030423,0.00066254055,0.14854835,0.0031366388,0.00040267804,0.000087702785,0.00071533606,0.0012027108,0.044939823],"genre_scores_gemma":[0.94841194,0.00041022743,0.027107535,0.00033029425,0.00040932547,0.00018245653,0.000604088,0.00036984906,0.02217438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983285,0.00031056,0.000088597255,0.00039813804,0.00046251906,0.0004118083],"domain_scores_gemma":[0.98407364,0.010270346,0.0010894648,0.0011018247,0.001059582,0.0024051515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017022202,0.0008980412,0.0019433451,0.004036574,0.003106711,0.004848158,0.0039300593,0.0028036374,0.01598533],"category_scores_gemma":[0.013339563,0.0008444802,0.0015401989,0.0023032024,0.0043426766,0.009136535,0.004457192,0.0046540364,0.001055821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037542268,0.0000771235,0.0011968168,0.000111813024,0.000028824885,0.0001182146,0.00046037463,0.003932998,0.003072569,0.97555393,0.0030378876,0.012033873],"study_design_scores_gemma":[0.000038303897,0.000044239434,0.0007692758,0.000017976763,0.000027353293,0.00011604707,0.000112156406,0.020316418,0.0014718069,0.9757859,0.0012717486,0.00002873709],"about_ca_topic_score_codex":0.0010408658,"about_ca_topic_score_gemma":0.0011556383,"teacher_disagreement_score":0.01598533,"about_ca_system_score_codex":0.0022621783,"about_ca_system_score_gemma":0.0010231038,"threshold_uncertainty_score":0.053476274},"labels":[],"label_agreement":null},{"id":"W1985281184","doi":"10.1016/j.dam.2009.04.004","title":"Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Upper and lower bounds; Mathematical proof; Independence number; Graph; Discrete mathematics; Independent set","score_opus":0.02630681998353096,"score_gpt":0.31734610857314616,"score_spread":0.2910392885896152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985281184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1147588,0.0067680506,0.7775551,0.0065867626,0.00042738108,0.00024402782,0.0015137012,0.0009671075,0.09117917],"genre_scores_gemma":[0.79705435,0.0032484583,0.17510128,0.0016734767,0.00073151535,0.0004890886,0.0017356663,0.0008090229,0.019157095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974413,0.00080808875,0.00008729639,0.000519461,0.0006953443,0.00044856372],"domain_scores_gemma":[0.9719928,0.023047592,0.00086163025,0.0020782573,0.0010937379,0.0009260575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040063565,0.0009734886,0.0020561717,0.0024234266,0.0018236674,0.002720416,0.004074036,0.001469245,0.012881186],"category_scores_gemma":[0.031110244,0.00088999985,0.0016031098,0.003073001,0.0031000844,0.008914644,0.003504256,0.0059625157,0.0013447476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006740672,0.00033277727,0.0047598234,0.0006209685,0.00018035024,0.00017490517,0.00050390564,0.13892166,0.0035509616,0.72672534,0.0242372,0.09931807],"study_design_scores_gemma":[0.000049346516,0.00007895251,0.0012852115,0.000111358284,0.00008507568,0.000095419724,0.00006772521,0.27725184,0.0019467702,0.71447414,0.0045228964,0.000031287294],"about_ca_topic_score_codex":0.0027311174,"about_ca_topic_score_gemma":0.005266837,"teacher_disagreement_score":0.012881186,"about_ca_system_score_codex":0.002537039,"about_ca_system_score_gemma":0.001331937,"threshold_uncertainty_score":0.043091893},"labels":[],"label_agreement":null},{"id":"W1985423710","doi":"10.1016/s1571-0653(05)80121-0","title":"On homomorphisms to edge-coloured cycles","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Capilano University","funders":"","keywords":"Mathematics; Combinatorics; Homomorphism; Graph; Time complexity; Graph homomorphism; Monochromatic color; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Graph power; Line graph; Computer science; Artificial intelligence","score_opus":0.01376915242437346,"score_gpt":0.29312911589385715,"score_spread":0.27935996346948366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985423710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50769496,0.002768359,0.3124478,0.0035516815,0.001554365,0.0003048516,0.0006351632,0.001110396,0.16993241],"genre_scores_gemma":[0.89582306,0.0028983352,0.04234727,0.0012668157,0.0009970936,0.0003090673,0.00062764937,0.00054628256,0.05518442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876237,0.00034982114,0.000062934814,0.00031679872,0.00020883855,0.00029917623],"domain_scores_gemma":[0.99546707,0.002622152,0.00035342513,0.00041070508,0.00042639303,0.0007202564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012158134,0.001219475,0.0011787057,0.0036718599,0.0026345907,0.0036486466,0.0020110032,0.0018059089,0.012649987],"category_scores_gemma":[0.006974557,0.0010343421,0.0017032801,0.0041498384,0.003657453,0.008477115,0.0053385976,0.0038813243,0.0010800703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056443,0.000038437996,0.000177388,0.0000496357,0.000010557261,0.00011484421,0.0005573761,0.00075587124,0.00058345846,0.9888058,0.0011096093,0.0077406894],"study_design_scores_gemma":[0.00001625199,0.000013386487,0.00009721519,0.00001462772,0.000009966263,0.00007167201,0.00010631075,0.0017501656,0.00023229218,0.9955155,0.002163129,0.000009381126],"about_ca_topic_score_codex":0.0021274863,"about_ca_topic_score_gemma":0.0014788179,"teacher_disagreement_score":0.012649987,"about_ca_system_score_codex":0.0021159512,"about_ca_system_score_gemma":0.000746514,"threshold_uncertainty_score":0.042318404},"labels":[],"label_agreement":null},{"id":"W1985501593","doi":"10.1007/s11425-009-0192-6","title":"A conjecture on k-factor-critical and 3-γ-critical graphs","year":2010,"lang":"en","type":"article","venue":"Science in China Series A Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Domination analysis; Dominating set; Critical graph; Bound graph; Neighbourhood (mathematics); Graph; Discrete mathematics; Graph power; Line graph","score_opus":0.01666036097839081,"score_gpt":0.33114757451013227,"score_spread":0.31448721353174147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985501593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6983872,0.001994011,0.04896179,0.020108389,0.0011725819,0.00014458128,0.0014637578,0.00088428456,0.22688346],"genre_scores_gemma":[0.97258896,0.0007625169,0.0080355285,0.0016524543,0.00052511075,0.000085060696,0.0010276294,0.00012625149,0.01519649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922764,0.00013648288,0.000038509173,0.0002807244,0.00010543031,0.00021122239],"domain_scores_gemma":[0.99504626,0.0026122844,0.0004856252,0.00066229166,0.00059985096,0.0005937214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066426,0.00090862514,0.00095719856,0.0019464216,0.0037014806,0.0041515455,0.0016595718,0.002726756,0.01512891],"category_scores_gemma":[0.0070767007,0.0007814115,0.0011676985,0.0020139068,0.0052009383,0.009454541,0.0023761515,0.0033478977,0.0015138297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025859693,0.000052911706,0.0016899167,0.00015295317,0.000017148435,0.0002106589,0.00103053,0.0016768441,0.0013050099,0.97769505,0.009543461,0.006366938],"study_design_scores_gemma":[0.000040117866,0.000016044703,0.0005724305,0.000031657888,0.000016110036,0.00012930213,0.00038108535,0.001983552,0.0006175709,0.9908846,0.005311911,0.000015585878],"about_ca_topic_score_codex":0.003840278,"about_ca_topic_score_gemma":0.0026606799,"teacher_disagreement_score":0.01512891,"about_ca_system_score_codex":0.0020799143,"about_ca_system_score_gemma":0.0009790844,"threshold_uncertainty_score":0.050611258},"labels":[],"label_agreement":null},{"id":"W1985638002","doi":"10.1016/j.dam.2007.10.015","title":"Partition into cliques for cubic graphs: Planar case, complexity and approximation","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Induced subgraph isomorphism problem; Disjoint sets; Discrete mathematics; Clique-sum; Cograph; Clique; Chordal graph; Induced subgraph; Partition problem; Planar graph; Frequency partition of a graph; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.06445379228865139,"score_gpt":0.3174664405960601,"score_spread":0.2530126483074087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985638002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47488984,0.0025670938,0.455555,0.010804059,0.00023006738,0.0004459141,0.0024565165,0.0007434071,0.052308153],"genre_scores_gemma":[0.82358634,0.0017866429,0.15141343,0.0008100019,0.00063573045,0.00033813788,0.003072168,0.00040917107,0.017948447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971928,0.0006621417,0.000119453885,0.0006366956,0.000862093,0.0005268573],"domain_scores_gemma":[0.97254217,0.021194953,0.0019306522,0.0025875003,0.0007477992,0.0009969509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022227976,0.0010464191,0.0023976797,0.0020860943,0.0024927265,0.007764037,0.0043592146,0.0033528015,0.010714208],"category_scores_gemma":[0.026133904,0.0012124394,0.0024345857,0.005363136,0.0032088507,0.014711415,0.003854034,0.0048157526,0.00077494886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013601568,0.0007124633,0.007613721,0.0008956363,0.00026996818,0.00035280103,0.0015502047,0.25922114,0.0038989296,0.6128908,0.02376616,0.08746807],"study_design_scores_gemma":[0.00013937888,0.00006396195,0.0013221018,0.00003631712,0.0000953441,0.0003442089,0.00037828443,0.38736457,0.0010684186,0.60577255,0.0033816756,0.000033125536],"about_ca_topic_score_codex":0.0063511576,"about_ca_topic_score_gemma":0.008452965,"teacher_disagreement_score":0.010714208,"about_ca_system_score_codex":0.0037544149,"about_ca_system_score_gemma":0.0027291153,"threshold_uncertainty_score":0.035842597},"labels":[],"label_agreement":null},{"id":"W1985793060","doi":"10.1016/j.disc.2006.08.010","title":"Retractions onto series-parallel posets","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Partially ordered set; Mathematics; Combinatorics; Homomorphism; Star product; Series (stratigraphy); Discrete mathematics; Algebraic number","score_opus":0.02578994077376497,"score_gpt":0.3219776912850309,"score_spread":0.29618775051126595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985793060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3220354,0.001126115,0.46546197,0.003192423,0.0026573145,0.0003580653,0.0012454328,0.0031703624,0.20075297],"genre_scores_gemma":[0.7948699,0.0019579602,0.06473671,0.0008136392,0.0014609809,0.00039618192,0.00151552,0.0015905161,0.1326586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988218,0.00019320237,0.000096007374,0.00030315245,0.00038103043,0.00020480168],"domain_scores_gemma":[0.99765104,0.00084776303,0.00032858786,0.00038718,0.0003752305,0.00041018252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009557729,0.0015411223,0.00078564946,0.0030344792,0.0019761971,0.003733653,0.001081604,0.0010295557,0.021569237],"category_scores_gemma":[0.004402355,0.00077479676,0.0017683476,0.002222193,0.0022156157,0.0067326827,0.003908928,0.004114552,0.0029710536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008178557,0.000068432026,0.00017296594,0.000067627545,0.000016825657,0.00024200787,0.00045983397,0.001756004,0.0025625217,0.9754421,0.0032194804,0.015910363],"study_design_scores_gemma":[0.000029858391,0.000043676588,0.00014370281,0.000014013685,0.000015605541,0.00030417534,0.00018235898,0.0030598855,0.0017651719,0.9850787,0.009348256,0.000014655449],"about_ca_topic_score_codex":0.0005109561,"about_ca_topic_score_gemma":0.0006091647,"teacher_disagreement_score":0.021569237,"about_ca_system_score_codex":0.00095430604,"about_ca_system_score_gemma":0.0006256477,"threshold_uncertainty_score":0.07215625},"labels":[],"label_agreement":null},{"id":"W1985797130","doi":"10.1016/j.dam.2004.01.005","title":"Minimum average distance of strong orientations of graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Multipartite; Upper and lower bounds; Eulerian path; Girth (graph theory); Planar graph; Graph; Connectivity; Discrete mathematics; Lagrangian","score_opus":0.018001465331463636,"score_gpt":0.2891017829121568,"score_spread":0.2711003175806932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985797130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88811374,0.00071365025,0.097662956,0.0008602299,0.00011152046,0.000043569038,0.00083687506,0.00021334665,0.011444215],"genre_scores_gemma":[0.9528783,0.0005924417,0.040363427,0.00016513932,0.00017438846,0.00009262752,0.0012666195,0.00017343878,0.004293533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900764,0.0002509668,0.00007339138,0.00026647132,0.00023396313,0.00016762022],"domain_scores_gemma":[0.98944944,0.0055587487,0.0013758743,0.00076221407,0.0010149508,0.0018387035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010526403,0.0010679755,0.0015790572,0.002476027,0.0016644432,0.0039419997,0.0023728036,0.0016426805,0.0045579458],"category_scores_gemma":[0.010558716,0.0009726704,0.00064508495,0.0021492592,0.0019228461,0.0048003057,0.002116375,0.0022016494,0.0007284318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020348446,0.00030322914,0.014923987,0.000656699,0.0001949361,0.00037102608,0.0012297323,0.047494214,0.02178438,0.8449599,0.007707884,0.058339264],"study_design_scores_gemma":[0.00010863578,0.0001714499,0.0045487015,0.000043188596,0.00006508646,0.0003118166,0.000545522,0.065653816,0.003972127,0.9214896,0.0030517883,0.000038131693],"about_ca_topic_score_codex":0.0008697154,"about_ca_topic_score_gemma":0.001610165,"teacher_disagreement_score":0.0045579458,"about_ca_system_score_codex":0.0014890912,"about_ca_system_score_gemma":0.0007012964,"threshold_uncertainty_score":0.015247822},"labels":[],"label_agreement":null},{"id":"W1986161890","doi":"10.1016/j.ejc.2008.09.022","title":"On the geodesic pre-hull number of a graph","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Convexity; Combinatorics; Hull; Geodesic; Bipartite graph; Convex hull; Graph; Discrete mathematics; Regular polygon; Geometry","score_opus":0.027576156594967358,"score_gpt":0.2700224635671326,"score_spread":0.24244630697216524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986161890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79037136,0.0012477684,0.082344204,0.0033179303,0.00044950988,0.000081152466,0.00079320295,0.0003780532,0.12101679],"genre_scores_gemma":[0.9473413,0.0011564887,0.022562923,0.000333696,0.00073185546,0.000121149904,0.0011153824,0.00021064376,0.026426457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990376,0.0002459016,0.000041897285,0.00019980244,0.00029943854,0.00017542116],"domain_scores_gemma":[0.9932522,0.0037796579,0.00080073864,0.00033094132,0.0004890898,0.0013472569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011803962,0.0010850898,0.0014320395,0.0061268792,0.002601611,0.003961207,0.0026103994,0.0019592748,0.013005939],"category_scores_gemma":[0.0061780144,0.0006889497,0.00085521303,0.003025415,0.0048785023,0.008077167,0.0025979832,0.0039038719,0.0013138234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030301168,0.00005675255,0.0016509974,0.0001242512,0.000022244209,0.00018941617,0.00060538936,0.0071836296,0.00207425,0.9709779,0.003925618,0.01288664],"study_design_scores_gemma":[0.000038656566,0.00007928242,0.0023223865,0.00004503646,0.000025751464,0.000210656,0.00024323828,0.024964355,0.0010267572,0.9669357,0.0040713856,0.000036745696],"about_ca_topic_score_codex":0.00211903,"about_ca_topic_score_gemma":0.0019874922,"teacher_disagreement_score":0.013005939,"about_ca_system_score_codex":0.002371068,"about_ca_system_score_gemma":0.0006794096,"threshold_uncertainty_score":0.043509185},"labels":[],"label_agreement":null},{"id":"W1986861105","doi":"10.1016/s0095-8956(03)00031-5","title":"Bounded size components—partitions and transversals","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Bounded function; Degree (music); Vertex (graph theory); Graph; Constant (computer programming); Component (thermodynamics); Frequency partition of a graph; Induced subgraph; Vertex connectivity; Discrete mathematics; Graph power; Line graph; Computer science; Physics","score_opus":0.016114984336661697,"score_gpt":0.265491512526323,"score_spread":0.24937652818966133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986861105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6955185,0.0019166052,0.21059407,0.002514148,0.00037436228,0.000119872384,0.0006356631,0.0005326292,0.08779422],"genre_scores_gemma":[0.9324872,0.0012968389,0.034281068,0.0004652734,0.00034243305,0.00014011096,0.0007611278,0.00041184868,0.029814063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914885,0.00017274066,0.00005383047,0.00023798413,0.00017400917,0.000212532],"domain_scores_gemma":[0.99320155,0.0033816444,0.00068749924,0.0011039071,0.0005875442,0.0010379136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087724795,0.00067202066,0.0009768608,0.0022269886,0.002614894,0.005419135,0.0015456849,0.0018331872,0.012112019],"category_scores_gemma":[0.007719834,0.0014165646,0.0010019514,0.0022682801,0.0040617594,0.008276911,0.0032293024,0.0033083227,0.0013750696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001302953,0.000032048938,0.0009152377,0.000054406093,0.000009384294,0.00011218989,0.0004572476,0.0010986004,0.0025944808,0.984277,0.002290379,0.008028749],"study_design_scores_gemma":[0.000022268141,0.0000234372,0.0005798713,0.00002649529,0.000021621629,0.0003092258,0.00047789232,0.0037504851,0.0011873307,0.9895732,0.004013843,0.0000143310135],"about_ca_topic_score_codex":0.00081458595,"about_ca_topic_score_gemma":0.0011743422,"teacher_disagreement_score":0.012112019,"about_ca_system_score_codex":0.0011200337,"about_ca_system_score_gemma":0.0005398407,"threshold_uncertainty_score":0.04051876},"labels":[],"label_agreement":null},{"id":"W1987809901","doi":"10.5555/1873601.1873628","title":"Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements","year":2010,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Combinatorics; Parity (physics); Mathematics; Ackermann function; Time complexity; Subdivision; Discrete mathematics; Vertex (graph theory); Graph; Inverse; Geometry","score_opus":0.01978642089397287,"score_gpt":0.29402099037229334,"score_spread":0.2742345694783205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987809901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4435694,0.00016052574,0.5404619,0.00045453975,0.00006487589,0.00024410871,0.00096676644,0.0019487933,0.012129106],"genre_scores_gemma":[0.62438154,0.000093241644,0.36534908,0.00012619035,0.000010792495,0.0001243933,0.0023284594,0.0002599149,0.0073263585],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952114,0.000053817927,0.000042189997,0.00015517228,0.00010246652,0.00012528458],"domain_scores_gemma":[0.99883085,0.0004042318,0.00014915597,0.00038701805,0.00013611939,0.00009259794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028336258,0.0005705446,0.0005157514,0.00033750094,0.000559186,0.0009081915,0.0008715724,0.00078501564,0.005218952],"category_scores_gemma":[0.0021135875,0.0003849194,0.0008344456,0.00065804424,0.00067935325,0.0022240027,0.001644632,0.0010117018,0.0011347525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015003689,0.0003597928,0.0133008,0.0007735338,0.00010782807,0.0014891069,0.0019908976,0.09879778,0.15927035,0.15276402,0.013440533,0.556205],"study_design_scores_gemma":[0.00019590862,0.00056863343,0.005644418,0.00010396248,0.00009605179,0.0017348286,0.0012996121,0.41108778,0.13149601,0.41623583,0.031397235,0.00013972439],"about_ca_topic_score_codex":0.001899117,"about_ca_topic_score_gemma":0.002996733,"teacher_disagreement_score":0.005218952,"about_ca_system_score_codex":0.0006233922,"about_ca_system_score_gemma":0.0008317825,"threshold_uncertainty_score":0.017459154},"labels":[],"label_agreement":null},{"id":"W1988192783","doi":"10.5784/23-1-46","title":"An algorithm for the (r,s)-domination number of a tree","year":2007,"lang":"en","type":"article","venue":"Orion/ORiON","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Neighbourhood (mathematics); Combinatorics; Vertex (graph theory); Mathematics; Graph; Function (biology); Tree (set theory); Domination analysis; Discrete mathematics; Algorithm","score_opus":0.021198265349127925,"score_gpt":0.3456694556178839,"score_spread":0.324471190268756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988192783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075508535,0.0005126372,0.9067006,0.00086445507,0.00008871033,0.00048774076,0.0006921912,0.0039280993,0.011217001],"genre_scores_gemma":[0.13940111,0.00016818868,0.85278934,0.00012917936,0.00003633359,0.0003206978,0.00088628527,0.00033840328,0.0059305374],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992655,0.00016011459,0.000064987355,0.00020852909,0.00014080697,0.00015998456],"domain_scores_gemma":[0.9981382,0.00095122133,0.00017433254,0.00029776795,0.00027137712,0.00016705897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014337847,0.00097127346,0.0012532884,0.001877093,0.0010553664,0.0015701171,0.0023809941,0.0013778317,0.0061548175],"category_scores_gemma":[0.0038769045,0.00053056417,0.0010074989,0.0016072071,0.0007980832,0.0025834586,0.0020414228,0.0011882551,0.0016680832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001068562,0.00046870578,0.0037519413,0.00060983736,0.000121765246,0.00019399814,0.00079374836,0.14359155,0.028849911,0.059539743,0.021328164,0.7396821],"study_design_scores_gemma":[0.00050982577,0.00039497158,0.0013194196,0.00009160783,0.00008635586,0.0004431904,0.00024907768,0.89316094,0.015803069,0.06996092,0.017882535,0.000098123244],"about_ca_topic_score_codex":0.003845266,"about_ca_topic_score_gemma":0.0058871326,"teacher_disagreement_score":0.0061548175,"about_ca_system_score_codex":0.002513017,"about_ca_system_score_gemma":0.0028150668,"threshold_uncertainty_score":0.020589888},"labels":[],"label_agreement":null},{"id":"W1988645991","doi":"10.1016/j.cor.2012.01.005","title":"A Tabu search algorithm for the network pricing problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Wilfrid Laurier University; SNC-Lavalin (Canada)","funders":"","keywords":"Tabu search; Guided Local Search; Mathematical optimization; Computer science; Combinatorial optimization; Flow network; Algorithm; Mathematics","score_opus":0.08855724499197673,"score_gpt":0.39515374008068405,"score_spread":0.30659649508870734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988645991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03229143,0.0012778038,0.94022155,0.0010529694,0.00042692566,0.0003825165,0.0007163556,0.003435091,0.020195337],"genre_scores_gemma":[0.15474415,0.00040275024,0.8337071,0.0003995636,0.00014063406,0.0005338109,0.0009841064,0.000623152,0.00846473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892116,0.00047705442,0.00004278013,0.0001571889,0.00023857362,0.00016332936],"domain_scores_gemma":[0.9973916,0.0017700526,0.00010891575,0.00023430552,0.00037459776,0.00012044015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016961537,0.0011617203,0.0018303065,0.0021360249,0.0014336216,0.0019985512,0.0028378994,0.0032140526,0.019683912],"category_scores_gemma":[0.00827069,0.00093179353,0.0010211067,0.0041372357,0.0010579813,0.0022512248,0.0015289511,0.0021724943,0.0035193842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052036287,0.00045852174,0.00079710904,0.00020973313,0.00010547443,0.0001222088,0.00014932551,0.5572815,0.0013226019,0.033652067,0.028733127,0.37664798],"study_design_scores_gemma":[0.00023634214,0.00008541968,0.00019164957,0.000028303437,0.000028057104,0.00005494886,0.00003803823,0.9650074,0.00034290642,0.030662404,0.0033048426,0.000019697065],"about_ca_topic_score_codex":0.008369809,"about_ca_topic_score_gemma":0.0071150693,"teacher_disagreement_score":0.019683912,"about_ca_system_score_codex":0.0016203591,"about_ca_system_score_gemma":0.0029315003,"threshold_uncertainty_score":0.065849304},"labels":[],"label_agreement":null},{"id":"W1989224319","doi":"10.1016/j.jctb.2008.07.003","title":"Excluding a group-labelled graph","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Mathematics; Graph; Abelian group; Robertson–Seymour theorem; Discrete mathematics; Line graph; 1-planar graph","score_opus":0.025041027880452885,"score_gpt":0.2730869488318363,"score_spread":0.24804592095138345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989224319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4605845,0.00027710028,0.18874045,0.0035840534,0.0009753627,0.00024630534,0.0009895888,0.0012296732,0.34337306],"genre_scores_gemma":[0.8483331,0.00026588046,0.06207944,0.0014556597,0.00036944804,0.0002592769,0.0020199064,0.00066953036,0.08454773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888855,0.000344907,0.000048267255,0.00027023384,0.00020388575,0.00024428382],"domain_scores_gemma":[0.99636406,0.0013561414,0.00035894677,0.0007437749,0.0005144628,0.0006626491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007472973,0.0007046977,0.0011233445,0.0017181197,0.0057740267,0.0033133642,0.0018252564,0.002909701,0.016990613],"category_scores_gemma":[0.0037301714,0.00064263836,0.0015540516,0.0012322107,0.002688489,0.0040127393,0.002650284,0.0029933339,0.0040406752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017723763,0.00008126611,0.0008199145,0.000105557636,0.00002092695,0.00046316447,0.0003882523,0.001274288,0.0044938433,0.9794605,0.00583971,0.0068753334],"study_design_scores_gemma":[0.000043974276,0.000043892494,0.0005344412,0.000044681172,0.000040813822,0.00034657755,0.0002253226,0.0072577014,0.0026354566,0.979044,0.009765792,0.000017282271],"about_ca_topic_score_codex":0.0014412524,"about_ca_topic_score_gemma":0.0024669617,"teacher_disagreement_score":0.016990613,"about_ca_system_score_codex":0.0008964182,"about_ca_system_score_gemma":0.0011238337,"threshold_uncertainty_score":0.056839228},"labels":[],"label_agreement":null},{"id":"W1989358594","doi":"10.1016/j.dam.2014.06.007","title":"Constructions of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-critical<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si12.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs","year":2014,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Vertex (graph theory); Graph; Combinatorics; Algorithm; Discrete mathematics","score_opus":0.018204848653324352,"score_gpt":0.25829085320337314,"score_spread":0.24008600455004878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989358594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020940997,0.00036778307,0.58571017,0.0024391941,0.0008453479,0.00046809216,0.009024929,0.0060365745,0.37416694],"genre_scores_gemma":[0.31723505,0.0011303261,0.3594541,0.001495734,0.00031477114,0.0009314237,0.025396232,0.0132961115,0.28074622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990877,0.00019974595,0.00006566125,0.00021164927,0.00024746597,0.00018782425],"domain_scores_gemma":[0.997638,0.0008881374,0.00014799142,0.0005096881,0.00056542293,0.0002508786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009797711,0.0009653314,0.00047434715,0.001774997,0.0025565433,0.0030358112,0.0018314543,0.0008650013,0.09406612],"category_scores_gemma":[0.0035831002,0.0009394833,0.0013012884,0.0020674858,0.0018257509,0.0044860803,0.0032376768,0.002754321,0.030368667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091454946,0.00004980853,0.00024473306,0.00020261048,0.0000146605325,0.00022102664,0.00066398614,0.0014472042,0.0034968443,0.8842522,0.08789167,0.02142368],"study_design_scores_gemma":[0.000053554944,0.000029471754,0.0004792069,0.00010769859,0.000038294624,0.00032813137,0.00044317494,0.0033031711,0.00860891,0.6121449,0.37439418,0.00006922987],"about_ca_topic_score_codex":0.003083028,"about_ca_topic_score_gemma":0.005880514,"teacher_disagreement_score":0.09406612,"about_ca_system_score_codex":0.002219203,"about_ca_system_score_gemma":0.0013973708,"threshold_uncertainty_score":0.31468248},"labels":[],"label_agreement":null},{"id":"W1989578968","doi":"10.1016/j.dam.2007.05.044","title":"On bags and bugs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Science and Engineering Research Board","keywords":"Combinatorics; Mathematics; Chordal graph; Discrete mathematics; Graph; Indifference graph","score_opus":0.01574263487328406,"score_gpt":0.2900160010133184,"score_spread":0.2742733661400344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989578968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1040085,0.02352069,0.5265886,0.09034959,0.0061001214,0.00009707471,0.0011700846,0.002279101,0.24588619],"genre_scores_gemma":[0.82298857,0.0063317004,0.064726345,0.008156927,0.0037607125,0.0002011149,0.0011043602,0.0020708274,0.09065952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964491,0.0014225523,0.00019374173,0.0007252052,0.00082431483,0.00038507735],"domain_scores_gemma":[0.98723185,0.008639516,0.000535957,0.0019441368,0.0010701118,0.0005784078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002654954,0.0010055936,0.0017143094,0.0031264399,0.0038826356,0.00602006,0.0018956519,0.0033565164,0.019965129],"category_scores_gemma":[0.022817366,0.0012059256,0.0015629288,0.003639661,0.010356728,0.022944571,0.0065038996,0.006002213,0.002385646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020217221,0.000008736099,0.00024273383,0.000035246787,0.000008594836,0.000035983296,0.00042845236,0.0005132149,0.00007031024,0.9825226,0.0072951736,0.008818663],"study_design_scores_gemma":[0.0000044108588,0.0000024715741,0.0000392012,0.000013932145,0.000004943014,0.000029935056,0.0000969695,0.0008098367,0.000032666547,0.9918365,0.007124206,0.0000050051694],"about_ca_topic_score_codex":0.003007813,"about_ca_topic_score_gemma":0.0020303552,"teacher_disagreement_score":0.019965129,"about_ca_system_score_codex":0.0022086883,"about_ca_system_score_gemma":0.0009178878,"threshold_uncertainty_score":0.066790044},"labels":[],"label_agreement":null},{"id":"W1989763262","doi":"10.5539/jmr.v1n1p25","title":"Perfect Glued Graphs at Complete Clones","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Cograph; Split graph; Clique-sum; Indifference graph; Disjoint sets; Chromatic scale; Discrete mathematics; Pathwidth; Block graph; Graph; 1-planar graph; Line graph","score_opus":0.13600706403871263,"score_gpt":0.41446255105119795,"score_spread":0.27845548701248535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989763262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93588984,0.00020251647,0.04624378,0.00016312946,0.000026439247,0.000032067368,0.00021072364,0.00019531527,0.017036196],"genre_scores_gemma":[0.98710525,0.00010736722,0.009714711,0.000046432204,0.000019486844,0.000029931976,0.00021403427,0.00003938125,0.0027234291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999393,0.00009757495,0.00003677665,0.00018339831,0.00013821601,0.00015099479],"domain_scores_gemma":[0.99812275,0.00057299074,0.0003701313,0.00037585464,0.00021099526,0.00034724327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042193555,0.00035106303,0.0004812314,0.0014004282,0.001257858,0.0017060596,0.000532294,0.0007945479,0.0033123596],"category_scores_gemma":[0.003128835,0.00045110783,0.00043919747,0.000992002,0.0022912999,0.0024799507,0.0025146417,0.000738564,0.00027313016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015773588,0.000020239388,0.0047026584,0.00007562493,0.000019118239,0.00087864307,0.0008864718,0.008134338,0.009970108,0.9595968,0.00087278953,0.014685378],"study_design_scores_gemma":[0.000041090658,0.000097496864,0.004485074,0.00005868718,0.00003280394,0.0009548095,0.0009641362,0.024476407,0.01025355,0.9507194,0.007878635,0.00003789997],"about_ca_topic_score_codex":0.0015018379,"about_ca_topic_score_gemma":0.0013318602,"teacher_disagreement_score":0.0033123596,"about_ca_system_score_codex":0.0010410462,"about_ca_system_score_gemma":0.000414718,"threshold_uncertainty_score":0.011080921},"labels":[],"label_agreement":null},{"id":"W1989806198","doi":"10.1109/csss.2012.41","title":"On the Decomposition of Posets","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Set (abstract data type); Decomposition; Combinatorics; Space (punctuation); Chain (unit); Mathematics; Computer science; Algorithm; Discrete mathematics; Physics; Chemistry","score_opus":0.02695638876271974,"score_gpt":0.33423375290629787,"score_spread":0.30727736414357815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989806198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03233461,0.00063305086,0.95506793,0.0004255322,0.00008182335,0.00016696485,0.00042132812,0.0008469961,0.010021651],"genre_scores_gemma":[0.14860639,0.0008156325,0.83976996,0.00018492466,0.00010689704,0.000216798,0.0027117527,0.00038177142,0.0072059375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912137,0.00024154132,0.00006829378,0.0002330282,0.00020411344,0.00013171784],"domain_scores_gemma":[0.9989048,0.00050741265,0.000084120846,0.00028179257,0.00012191399,0.00009997728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007297331,0.0010471785,0.0008865277,0.0011826019,0.0008814512,0.0018257439,0.0008384543,0.00059335993,0.007890801],"category_scores_gemma":[0.0026620834,0.0005833605,0.0012584201,0.0015600518,0.0010824136,0.004564898,0.0024597978,0.0015466609,0.0015981566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040010994,0.00021828707,0.0011807185,0.0006649153,0.00009255531,0.00030500302,0.0009445765,0.07646757,0.016080765,0.5235968,0.014665691,0.36538303],"study_design_scores_gemma":[0.0000605621,0.00010947758,0.00039440527,0.00010560121,0.000037471622,0.00028047728,0.0002554306,0.1985431,0.00519563,0.7694166,0.025578575,0.000022621298],"about_ca_topic_score_codex":0.0014196782,"about_ca_topic_score_gemma":0.0020503874,"teacher_disagreement_score":0.007890801,"about_ca_system_score_codex":0.00076144736,"about_ca_system_score_gemma":0.0007265564,"threshold_uncertainty_score":0.026397347},"labels":[],"label_agreement":null},{"id":"W1989905036","doi":"10.1016/j.disc.2005.09.030","title":"List homomorphisms of graphs with bounded degrees","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Bounded function; Combinatorics; Discrete mathematics; Contrast (vision); Upper and lower bounds; Degree (music); Graph homomorphism; Computational complexity theory; Graph; Computer science; Algorithm; Line graph; Artificial intelligence","score_opus":0.01541211956355663,"score_gpt":0.25741590942436116,"score_spread":0.24200378986080454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989905036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6052959,0.0011816059,0.33834323,0.0023327132,0.00030769123,0.00015351613,0.0011649575,0.0023489806,0.048871424],"genre_scores_gemma":[0.9197196,0.00090218295,0.04622143,0.00076158065,0.00039686606,0.00025430668,0.0011902831,0.0006330396,0.02992071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998285,0.00049257715,0.00010724219,0.0003960249,0.00034306114,0.00037608444],"domain_scores_gemma":[0.9881827,0.0073168,0.0010011786,0.0009839776,0.0009560897,0.0015591973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014853198,0.00078893994,0.0009092201,0.0037348277,0.0026674797,0.004529739,0.002374563,0.001412267,0.008729715],"category_scores_gemma":[0.009004522,0.00097423454,0.0011181495,0.0025376168,0.002246143,0.010567183,0.0037962007,0.0028827144,0.00158803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002398478,0.00008502495,0.00069074944,0.00011008031,0.000017637154,0.00020219218,0.0011601617,0.0015405656,0.0031996316,0.9779335,0.0019384477,0.012882275],"study_design_scores_gemma":[0.000046513596,0.000036504134,0.00041935724,0.000027635377,0.000030823492,0.00020087064,0.00034988322,0.0067919423,0.0024062088,0.9860698,0.0035877035,0.000032700602],"about_ca_topic_score_codex":0.001020598,"about_ca_topic_score_gemma":0.0009930928,"teacher_disagreement_score":0.008729715,"about_ca_system_score_codex":0.0017175179,"about_ca_system_score_gemma":0.00079642405,"threshold_uncertainty_score":0.029203832},"labels":[],"label_agreement":null},{"id":"W1990093945","doi":"10.1016/j.ejc.2004.01.003","title":"Coloring face hypergraphs on surfaces","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Hypergraph; Mathematics; Vertex (graph theory); Upper and lower bounds; Surface (topology); Graph; Discrete mathematics; Geometry","score_opus":0.023794382802791874,"score_gpt":0.26164787578767273,"score_spread":0.23785349298488087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990093945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6896503,0.00058938435,0.22401647,0.0010794473,0.0005987732,0.0001777396,0.0005496085,0.0018455564,0.0814928],"genre_scores_gemma":[0.7853267,0.00092258415,0.15690461,0.00055924425,0.00022431668,0.00019467424,0.0009000718,0.0011371574,0.053830605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961674,0.0000803786,0.000012334784,0.000074713396,0.00008757777,0.00012821871],"domain_scores_gemma":[0.9989506,0.0004280378,0.00006318027,0.00020532034,0.00015073219,0.00020206737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026585817,0.00073068304,0.0006807892,0.0010771557,0.001498184,0.002413362,0.001033915,0.00090324495,0.016469287],"category_scores_gemma":[0.0013012803,0.0006570353,0.0006035935,0.0013518719,0.00087846175,0.0018784165,0.0016602839,0.0015900506,0.002028195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073335867,0.00028982142,0.003717709,0.00047186998,0.00007486109,0.0006877444,0.0012712787,0.038269646,0.06356352,0.657261,0.027223807,0.20643538],"study_design_scores_gemma":[0.00012494595,0.00013664333,0.0026242074,0.0000798616,0.000065219945,0.0003639196,0.0011368785,0.07917879,0.02285234,0.8605718,0.032824647,0.00004077057],"about_ca_topic_score_codex":0.002300605,"about_ca_topic_score_gemma":0.004416,"teacher_disagreement_score":0.016469287,"about_ca_system_score_codex":0.001296899,"about_ca_system_score_gemma":0.00051385385,"threshold_uncertainty_score":0.055095315},"labels":[],"label_agreement":null},{"id":"W1990117560","doi":"10.4153/cmb-2010-034-8","title":"A New Sufficient Condition for a Graph To Be (<i>g</i>, <i>f</i>, <i>n</i>)-Critical","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Qinglan Project of Jiangsu Province of China; Government of Jiangsu Province","keywords":"Mathematics; Combinatorics; Graph; Bound graph; Discrete mathematics; Graph power; Line graph","score_opus":0.02173126923665959,"score_gpt":0.2996863677020775,"score_spread":0.27795509846541794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990117560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7861356,0.0008888911,0.12861732,0.004659569,0.00083922484,0.0007858045,0.0038532913,0.0017462006,0.07247403],"genre_scores_gemma":[0.95263064,0.00026825792,0.039471224,0.000706149,0.0004147496,0.00033121483,0.0023941707,0.00027685464,0.0035067517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979134,0.00028052478,0.00022374194,0.0007267857,0.00029343955,0.0005620325],"domain_scores_gemma":[0.9782023,0.010279474,0.0024968847,0.0011762558,0.0034958327,0.004349207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016381465,0.0008128618,0.0014141849,0.0032579915,0.0026782409,0.0025490166,0.0014528878,0.0024957198,0.01335946],"category_scores_gemma":[0.013552303,0.001017632,0.0011542487,0.0011338567,0.0029291653,0.0053509204,0.0020920518,0.0020567002,0.0016738614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004614821,0.0013512779,0.024475692,0.0022804695,0.0003164043,0.007107087,0.0025602684,0.03059552,0.1794924,0.68006396,0.031505704,0.03563635],"study_design_scores_gemma":[0.0014244362,0.0024349228,0.022486307,0.00087926816,0.0004232759,0.009625298,0.00501629,0.13111602,0.119702846,0.6419024,0.06441859,0.00057030993],"about_ca_topic_score_codex":0.0018827415,"about_ca_topic_score_gemma":0.0030239266,"teacher_disagreement_score":0.01335946,"about_ca_system_score_codex":0.001683841,"about_ca_system_score_gemma":0.0017438924,"threshold_uncertainty_score":0.04469186},"labels":[],"label_agreement":null},{"id":"W1990242495","doi":"10.1016/j.dam.2003.07.001","title":"A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interval graph; Mathematics; Graph; Algorithm; Interval (graph theory); Simple (philosophy); Unit interval; SIMPLE algorithm; Combinatorics; Simple graph; Unit (ring theory); Line graph; Pathwidth","score_opus":0.045052827599361286,"score_gpt":0.31071194466239943,"score_spread":0.26565911706303813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990242495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03777791,0.00033123014,0.94233114,0.00017513726,0.00007734213,0.0001731667,0.0006244164,0.011586477,0.0069231023],"genre_scores_gemma":[0.13789314,0.00017281779,0.8529311,0.00010982662,0.000047236474,0.00020657125,0.002131248,0.000633878,0.0058741686],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995565,0.000049973216,0.00003753566,0.00013241298,0.0001386023,0.00008496191],"domain_scores_gemma":[0.99937683,0.00018542183,0.00003922669,0.00022426374,0.00011186682,0.000062438914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030157485,0.0009794305,0.0010747674,0.0017081496,0.0006962522,0.0014895819,0.0018029081,0.0009842686,0.017637273],"category_scores_gemma":[0.0016667935,0.00044128406,0.00077229645,0.0017140019,0.00045957702,0.002182706,0.0017455486,0.0010447352,0.004835544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034356126,0.00013474711,0.0007291074,0.0001406839,0.000026213756,0.000074906144,0.00010237792,0.010403557,0.023844285,0.007320208,0.008638451,0.94824183],"study_design_scores_gemma":[0.0004133493,0.00040471126,0.002673235,0.000094097595,0.00010229776,0.00067162095,0.00052852347,0.7926595,0.061979163,0.09043214,0.049903937,0.00013744495],"about_ca_topic_score_codex":0.0035454943,"about_ca_topic_score_gemma":0.0050229775,"teacher_disagreement_score":0.017637273,"about_ca_system_score_codex":0.0005930255,"about_ca_system_score_gemma":0.0009605881,"threshold_uncertainty_score":0.05900258},"labels":[],"label_agreement":null},{"id":"W1990318969","doi":"10.1007/s00012-007-2030-4","title":"Not every full duality is strong!","year":2007,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Duality (order theory); Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.025290600793800626,"score_gpt":0.2904640971381592,"score_spread":0.26517349634435855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990318969","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12269363,0.004000783,0.28523007,0.04695845,0.0039221006,0.00009795406,0.0011232287,0.001378006,0.5345959],"genre_scores_gemma":[0.91729724,0.0012296637,0.027666617,0.0051629716,0.0014383706,0.00015624803,0.00050593715,0.00038807347,0.046154782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978078,0.00061061134,0.000113336304,0.0005754282,0.00045989364,0.0004329086],"domain_scores_gemma":[0.9957365,0.0017645799,0.00022073348,0.00097640854,0.0008732435,0.00042850128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031567658,0.0006333626,0.0012294562,0.0015400787,0.0055793193,0.0052901865,0.00096044753,0.001958011,0.015248221],"category_scores_gemma":[0.0058987197,0.0009458051,0.001349429,0.0015942598,0.009715103,0.026925132,0.0053889286,0.0060049784,0.0024789164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016297916,0.00000795183,0.000056796194,0.00001998478,0.0000059609524,0.000012311044,0.00010033824,0.000024896639,0.000115517025,0.9960567,0.0018502705,0.001733029],"study_design_scores_gemma":[0.0000056933445,0.0000041435565,0.00003599605,0.000006051627,0.0000042711836,0.00003394146,0.00007261035,0.000093681854,0.0001355163,0.99564856,0.003955626,0.000003901029],"about_ca_topic_score_codex":0.00054908026,"about_ca_topic_score_gemma":0.0005238611,"teacher_disagreement_score":0.015248221,"about_ca_system_score_codex":0.001124775,"about_ca_system_score_gemma":0.00093079085,"threshold_uncertainty_score":0.05101037},"labels":[],"label_agreement":null},{"id":"W1990357453","doi":"10.1006/jctb.2001.2068","title":"Totally Free Expansions of Matroids","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; National Security Agency","keywords":"Matroid; Combinatorics; Mathematics; Duality (order theory); Extension (predicate logic); Graphic matroid; Element (criminal law); Discrete mathematics; Rank (graph theory); Computer science","score_opus":0.015787991316954807,"score_gpt":0.2546160460856362,"score_spread":0.2388280547686814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990357453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7221098,0.000931954,0.069557056,0.0016558096,0.00040767284,0.000054449454,0.00043560247,0.00037074636,0.2044769],"genre_scores_gemma":[0.9363749,0.0005626978,0.018015591,0.0003646257,0.00050064304,0.00005363458,0.00043777184,0.00017249212,0.043517716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999616,0.00010071023,0.000018654891,0.000049762937,0.00013179422,0.00008293415],"domain_scores_gemma":[0.9990088,0.00048874645,0.00011106623,0.000088881796,0.00013463889,0.00016778163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003667792,0.0005131982,0.0006632108,0.0015742787,0.001051941,0.0019968771,0.00081184966,0.0007228154,0.008622662],"category_scores_gemma":[0.0015143775,0.00046529467,0.00065250735,0.001289364,0.0011898652,0.0026652173,0.0012386392,0.0022015623,0.00075720204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000435491,0.00003230177,0.00013514905,0.000029589686,0.0000059654726,0.00012423992,0.00019901348,0.0010103013,0.0018603272,0.9887595,0.0018363248,0.005963747],"study_design_scores_gemma":[0.000020800306,0.000020152618,0.0002929236,0.000012924616,0.000009731554,0.00023478203,0.000110878325,0.0054548043,0.0005447134,0.9891243,0.004163538,0.0000104654655],"about_ca_topic_score_codex":0.00044016298,"about_ca_topic_score_gemma":0.0012024953,"teacher_disagreement_score":0.008622662,"about_ca_system_score_codex":0.00073730806,"about_ca_system_score_gemma":0.00025379658,"threshold_uncertainty_score":0.028845727},"labels":[],"label_agreement":null},{"id":"W1990755119","doi":"10.1016/j.dam.2011.04.005","title":"Dichotomy for tree-structured trigraph list homomorphism problems","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Tree (set theory); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.0410811667948333,"score_gpt":0.27026961887385204,"score_spread":0.22918845207901872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990755119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5613036,0.0025067593,0.27302414,0.02427955,0.000636397,0.00022119509,0.002158215,0.0015377663,0.13433243],"genre_scores_gemma":[0.9497338,0.0012419703,0.023553941,0.0019417877,0.000923617,0.00032665653,0.0018209557,0.00024551002,0.020211766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983321,0.00052890484,0.00006763986,0.00031862216,0.00042868816,0.0003241083],"domain_scores_gemma":[0.9918665,0.006267178,0.00046188597,0.00042452294,0.00034283297,0.00063709205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017841825,0.00074253825,0.0019276079,0.0019335322,0.0029662608,0.0068230242,0.0027684618,0.0034237404,0.01645851],"category_scores_gemma":[0.0111714555,0.0006683472,0.0012201007,0.0025785263,0.003313372,0.013178423,0.0037248745,0.006233633,0.0014682371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018172251,0.00017275,0.00047459957,0.00015058575,0.000024043497,0.00010657019,0.00036651114,0.004395302,0.0005137839,0.9755735,0.0083775,0.0096632205],"study_design_scores_gemma":[0.0000404015,0.000014336757,0.00011692736,0.000012702838,0.000009680735,0.00004488283,0.00008257231,0.015536163,0.00015693295,0.98337734,0.00059984165,0.000008214711],"about_ca_topic_score_codex":0.0010314909,"about_ca_topic_score_gemma":0.0010628343,"teacher_disagreement_score":0.01645851,"about_ca_system_score_codex":0.0027209232,"about_ca_system_score_gemma":0.0017111999,"threshold_uncertainty_score":0.055059195},"labels":[],"label_agreement":null},{"id":"W1990809933","doi":"10.1016/s0166-218x(01)00237-2","title":"On the computational complexity of strong edge coloring","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Mathematics; Edge coloring; Combinatorics; Computational complexity theory; Graph coloring; Time complexity; Graph; Completeness (order theory); Matching (statistics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Graph power; Artificial intelligence; Computer science; Line graph","score_opus":0.09358971132498799,"score_gpt":0.3031898687250434,"score_spread":0.2096001574000554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990809933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51747745,0.0034831194,0.35212925,0.030295182,0.0009650584,0.00036363848,0.0042805304,0.0015913079,0.08941438],"genre_scores_gemma":[0.91490316,0.0019435895,0.064511515,0.0016611842,0.0012183534,0.0003586603,0.0021437684,0.00064317405,0.012616605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99400455,0.002463973,0.00024071807,0.0008700631,0.0012996403,0.0011211178],"domain_scores_gemma":[0.90751487,0.08032705,0.0024034814,0.0059393398,0.0020864021,0.0017287984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004799743,0.0014921246,0.0024259537,0.001755489,0.0024877351,0.0068947263,0.0050584357,0.002675439,0.01610107],"category_scores_gemma":[0.04312851,0.0012405165,0.0022061004,0.004254775,0.0054323766,0.0194032,0.00554033,0.006588842,0.0014197599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025434208,0.00050935696,0.0043703336,0.0006344584,0.00018482412,0.00025034955,0.0007517964,0.19030736,0.0036038132,0.711483,0.028973194,0.05638813],"study_design_scores_gemma":[0.00016603143,0.000054335793,0.0007146496,0.000035684818,0.0000647072,0.00009102216,0.0001615199,0.2266714,0.0008609565,0.7691834,0.0019648902,0.00003133506],"about_ca_topic_score_codex":0.0051674005,"about_ca_topic_score_gemma":0.0059208195,"teacher_disagreement_score":0.01610107,"about_ca_system_score_codex":0.0049881707,"about_ca_system_score_gemma":0.0044252425,"threshold_uncertainty_score":0.053863406},"labels":[],"label_agreement":null},{"id":"W1990941137","doi":"10.1002/jgt.20565","title":"Vizing's conjecture: a survey and recent results","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":136,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Furman University","keywords":"Conjecture; Counterexample; Cartesian product; Mathematics; Combinatorics; Domination analysis; Product (mathematics); Graph; Upper and lower bounds; Discrete mathematics; Graph theory","score_opus":0.06090426272339177,"score_gpt":0.294004860554233,"score_spread":0.23310059783084125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990941137","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06490338,0.73636883,0.08383117,0.01892742,0.0020525178,0.000067146946,0.00046529816,0.00036509166,0.09301918],"genre_scores_gemma":[0.5163074,0.42658362,0.034163386,0.0034258384,0.009512418,0.0001055323,0.0013835764,0.00014865091,0.008369502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977628,0.0003794753,0.0001641309,0.00076482916,0.0006691568,0.0002596236],"domain_scores_gemma":[0.98836875,0.008532593,0.0006035116,0.00077020813,0.0013343899,0.0003905541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004226734,0.0008901974,0.0016071581,0.0037939798,0.0017440262,0.004268723,0.0023212424,0.0019118357,0.0035523267],"category_scores_gemma":[0.009887331,0.0007035999,0.00078532123,0.008204582,0.0051369593,0.009532583,0.0021927936,0.003571281,0.0009611795],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030266272,0.0002038991,0.0059438585,0.003717203,0.0001373792,0.00041417766,0.00063968136,0.007192086,0.001713395,0.6476235,0.026923921,0.30518833],"study_design_scores_gemma":[0.00004067917,0.00013279573,0.0029687334,0.0008722086,0.00010392963,0.0012939064,0.00076375285,0.011360231,0.002287525,0.7699436,0.2101368,0.000095868905],"about_ca_topic_score_codex":0.0019535888,"about_ca_topic_score_gemma":0.0009139429,"teacher_disagreement_score":0.004268723,"about_ca_system_score_codex":0.0024244622,"about_ca_system_score_gemma":0.00147973,"threshold_uncertainty_score":0.022353351},"labels":[],"label_agreement":null},{"id":"W1991223992","doi":"10.1016/j.dam.2007.08.013","title":"Planar graph bipartization in linear time","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Planar graph; Combinatorics; Planar; Graph; Vertex (graph theory); Transversal (combinatorics); Planar straight-line graph; Time complexity; Discrete mathematics; Mathematical analysis; Pathwidth; Line graph; Computer science","score_opus":0.01678555882454132,"score_gpt":0.2884691405430597,"score_spread":0.2716835817185184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991223992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16239196,0.0013719292,0.7154276,0.004291732,0.00046760816,0.000813621,0.004059292,0.0101743275,0.10100197],"genre_scores_gemma":[0.48040086,0.000987647,0.4501435,0.0011025092,0.00026984097,0.00066885015,0.0061349515,0.0024036253,0.057888184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978199,0.00040659533,0.00010324298,0.00055352255,0.00055218174,0.00056463253],"domain_scores_gemma":[0.99551326,0.002288846,0.00038233094,0.0010290028,0.00039426962,0.00039226012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009922307,0.0013560782,0.0023873807,0.0015301824,0.0023277858,0.0048321746,0.0027487301,0.001752451,0.03451855],"category_scores_gemma":[0.006642195,0.0009953101,0.0017402844,0.004300643,0.0017087415,0.007858904,0.004050033,0.0032042754,0.004937278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024732153,0.0008047511,0.0014006823,0.0015072883,0.00029169192,0.00029236212,0.0009246306,0.14333639,0.020114077,0.43009883,0.07009037,0.32866573],"study_design_scores_gemma":[0.00052051333,0.0002176176,0.0007932734,0.00007346069,0.00020099599,0.00026372858,0.00049064506,0.30198517,0.008785803,0.6650611,0.021550598,0.00005708883],"about_ca_topic_score_codex":0.006194681,"about_ca_topic_score_gemma":0.00949071,"teacher_disagreement_score":0.03451855,"about_ca_system_score_codex":0.0035054684,"about_ca_system_score_gemma":0.0025774215,"threshold_uncertainty_score":0.11547601},"labels":[],"label_agreement":null},{"id":"W1991265104","doi":"10.1145/2537800","title":"New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation","keywords":"Cover (algebra); Combinatorics; Mathematics; Edge coloring; Graph coloring; Graph; Vertex cover; Discrete mathematics; Computer science; Graph power; Line graph; Engineering","score_opus":0.03570242712076727,"score_gpt":0.3221715244481421,"score_spread":0.28646909732737486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991265104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1505806,0.0049825422,0.67704153,0.026594328,0.0019446274,0.0009453463,0.009373815,0.0034607837,0.12507647],"genre_scores_gemma":[0.63385206,0.0040114964,0.31041428,0.0069608516,0.0031017116,0.0012603962,0.009012642,0.0019105336,0.029476024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996309,0.0006832139,0.00018083335,0.00089399,0.0010989278,0.00083392236],"domain_scores_gemma":[0.98604393,0.01026892,0.00097116403,0.0013987463,0.00063334726,0.0006838794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018286034,0.0024132289,0.0020943396,0.0016440026,0.0027507648,0.0052962573,0.005018037,0.002994622,0.018280959],"category_scores_gemma":[0.010240624,0.0014035525,0.0038350618,0.0028801318,0.003331236,0.012621085,0.0052947,0.009257515,0.0021659639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018322745,0.001580945,0.0043103914,0.0029625196,0.0005189303,0.0018750549,0.0015073876,0.28406206,0.01444769,0.41230863,0.14953871,0.12505545],"study_design_scores_gemma":[0.00033680839,0.00015097014,0.0013233288,0.00018761447,0.00024314219,0.0010240331,0.0003897344,0.24424696,0.0063608047,0.7136422,0.03199617,0.00009832241],"about_ca_topic_score_codex":0.0048375526,"about_ca_topic_score_gemma":0.006668335,"teacher_disagreement_score":0.018280959,"about_ca_system_score_codex":0.0038337384,"about_ca_system_score_gemma":0.002610047,"threshold_uncertainty_score":0.061155856},"labels":[],"label_agreement":null},{"id":"W1991507146","doi":"10.1007/s003730170006","title":"Diagonal Flips in Labelled Planar Triangulations","year":2001,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Combinatorics; Diagonal; Mathematics; Triangulation; Planar; Sequence (biology); Class (philosophy); Upper and lower bounds; Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.02099190701356197,"score_gpt":0.2671143189203534,"score_spread":0.24612241190679146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991507146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7179055,0.0005424658,0.18493055,0.0009688004,0.00041071064,0.0002173967,0.0007876847,0.0012160498,0.09302094],"genre_scores_gemma":[0.9152832,0.0005169685,0.044839628,0.00028375824,0.000081148835,0.0001515314,0.0006755658,0.00046854417,0.037699588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994037,0.00012205785,0.000033087654,0.000098129465,0.00015878543,0.00018418043],"domain_scores_gemma":[0.99784493,0.00086460303,0.00035684337,0.00033154892,0.00027834834,0.0003236944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052403286,0.00044132443,0.00058126973,0.0019566799,0.0019934904,0.002204535,0.0011628402,0.0016603511,0.016295336],"category_scores_gemma":[0.003963072,0.00079463836,0.00060836057,0.0017428288,0.002581486,0.002708986,0.0027717513,0.002024889,0.0021374698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024710924,0.00008481105,0.00097619864,0.00013457268,0.000011214394,0.00046047164,0.000793208,0.007461544,0.006116476,0.9463218,0.004592687,0.032799967],"study_design_scores_gemma":[0.00006524521,0.00004837924,0.0006605814,0.00006792139,0.000021764889,0.00022856628,0.0007404393,0.022551699,0.003428985,0.9658431,0.0063147764,0.000028659924],"about_ca_topic_score_codex":0.002527993,"about_ca_topic_score_gemma":0.0043801796,"teacher_disagreement_score":0.016295336,"about_ca_system_score_codex":0.0009881147,"about_ca_system_score_gemma":0.00052322407,"threshold_uncertainty_score":0.054513335},"labels":[],"label_agreement":null},{"id":"W1991583924","doi":"10.1002/jgt.20580","title":"High-girth cubic graphs are homomorphic to the Clebsch graph","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Cubic graph; Foster graph; Edge coloring; Discrete mathematics; Triangle-free graph; Symmetric graph; Graph homomorphism; Petersen graph; Windmill graph; Graph power; Odd graph; Graph; Voltage graph; Line graph; 1-planar graph","score_opus":0.0306625239425227,"score_gpt":0.260962884872394,"score_spread":0.2303003609298713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991583924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7381399,0.0004437239,0.1538155,0.0015862919,0.00014796574,0.00014839308,0.0005198502,0.00066705124,0.10453137],"genre_scores_gemma":[0.9684172,0.0002675724,0.023269488,0.0002814337,0.000049566635,0.000048067293,0.00023183708,0.00004567686,0.007389078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996026,0.00006017911,0.000011696609,0.00007744266,0.00014451798,0.000103550694],"domain_scores_gemma":[0.9985683,0.0004883057,0.00023645473,0.00036457615,0.00017760094,0.00016482675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022797503,0.000208508,0.00024200983,0.00053113414,0.0010702708,0.00089874654,0.00044732014,0.0003985304,0.004663476],"category_scores_gemma":[0.0013509304,0.00031433452,0.0003743125,0.0006968294,0.0015180532,0.0013954126,0.0013835318,0.001606775,0.0004282413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014644368,0.000059791368,0.002227888,0.00009453492,0.000012398579,0.0006240703,0.0007042609,0.0060953847,0.0072709173,0.94789153,0.0041708713,0.030701848],"study_design_scores_gemma":[0.000051772542,0.00010134851,0.0042956467,0.000021293334,0.000029846946,0.0013787334,0.0005497955,0.025984107,0.010311328,0.9341117,0.023116678,0.00004785899],"about_ca_topic_score_codex":0.004324984,"about_ca_topic_score_gemma":0.004932524,"teacher_disagreement_score":0.004663476,"about_ca_system_score_codex":0.0007751114,"about_ca_system_score_gemma":0.00095632527,"threshold_uncertainty_score":0.01560086},"labels":[],"label_agreement":null},{"id":"W1991595634","doi":"10.1016/j.endm.2006.06.012","title":"The structure and unlabelled enumeration of toroidal graphs with no K3,3's","year":2006,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Toroid; Combinatorics; Planar; Planar graph; Chordal graph; Discrete mathematics; Graph; Computer science; Physics","score_opus":0.004346590744890076,"score_gpt":0.23853025931039273,"score_spread":0.23418366856550266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991595634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80361426,0.00033800505,0.075844795,0.0011785458,0.00041401217,0.00008340596,0.0013631851,0.00047816508,0.11668558],"genre_scores_gemma":[0.92722446,0.0003288716,0.039888624,0.00047379732,0.000116355346,0.0001180293,0.0019981486,0.00030466917,0.029547013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945635,0.00010736628,0.000033274322,0.00011549123,0.000106788706,0.00018081596],"domain_scores_gemma":[0.99825686,0.00057247066,0.00032396676,0.0002741874,0.00027162564,0.00030084804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042356568,0.00048146705,0.000610487,0.0011832347,0.0031499385,0.0039107143,0.001520035,0.0013877837,0.008019205],"category_scores_gemma":[0.0022697116,0.0005787974,0.00064100756,0.0014342695,0.0021680507,0.003039287,0.001336924,0.0019104596,0.001634777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020784012,0.00004755024,0.00067426503,0.000076614415,0.000007802836,0.00019560855,0.000628068,0.0018713374,0.0038436328,0.9788263,0.0033163826,0.010304554],"study_design_scores_gemma":[0.000018488772,0.000023852297,0.0007647398,0.000036785063,0.000013774482,0.0001615554,0.00041698304,0.0057837786,0.0018710397,0.9839662,0.0069216136,0.000021185497],"about_ca_topic_score_codex":0.002120648,"about_ca_topic_score_gemma":0.0032084465,"teacher_disagreement_score":0.008019205,"about_ca_system_score_codex":0.0011238428,"about_ca_system_score_gemma":0.0010189847,"threshold_uncertainty_score":0.026826918},"labels":[],"label_agreement":null},{"id":"W1991670069","doi":"10.1016/s0166-218x(01)00268-2","title":"Domination analysis of some heuristics for the traveling salesman problem","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Southern Taiwan Science Park","keywords":"Travelling salesman problem; Digraph; Mathematics; Combinatorics; Heuristics; Bottleneck traveling salesman problem; Integer (computer science); Christofides algorithm; Upper and lower bounds; Discrete mathematics; Algorithm; Mathematical optimization; Computer science","score_opus":0.03373754081539889,"score_gpt":0.289320133767459,"score_spread":0.25558259295206015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991670069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59039325,0.002686923,0.33623248,0.0024496592,0.00013729933,0.00056610623,0.00089809526,0.00061211636,0.066024005],"genre_scores_gemma":[0.91122836,0.0011723773,0.074107856,0.00039080714,0.00017180573,0.00034498842,0.00084522855,0.00027747868,0.011461037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979096,0.0007917633,0.00007162559,0.00023482573,0.00041517528,0.0005769993],"domain_scores_gemma":[0.9767379,0.018838806,0.0012115808,0.0010226986,0.001456109,0.0007327643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003055037,0.0011234954,0.0013761242,0.0035278325,0.00183132,0.0030929407,0.002654608,0.0013266028,0.008282519],"category_scores_gemma":[0.021591073,0.00079714385,0.0016107736,0.0034196232,0.0018177683,0.0033981754,0.0010963065,0.0020881293,0.00047511503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011221725,0.0007041327,0.005977359,0.0005569708,0.00027922174,0.00028460252,0.00076769036,0.57281995,0.0064806594,0.31056842,0.014869894,0.08556894],"study_design_scores_gemma":[0.00009978666,0.00014823033,0.0014344183,0.000046745165,0.00010954781,0.00010204553,0.00015758465,0.8879444,0.001220413,0.10643725,0.0022683502,0.00003120862],"about_ca_topic_score_codex":0.007387179,"about_ca_topic_score_gemma":0.0066584116,"teacher_disagreement_score":0.008282519,"about_ca_system_score_codex":0.004052615,"about_ca_system_score_gemma":0.0034197564,"threshold_uncertainty_score":0.029403865},"labels":[],"label_agreement":null},{"id":"W1991809010","doi":"10.1145/2213977.2214060","title":"The freezing threshold for k-colourings of a random graph","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Kempe Foundation","keywords":"Random graph; Combinatorics; Mathematics; Graph; Discrete mathematics; Random regular graph; 1-planar graph; Line graph","score_opus":0.030189687331009643,"score_gpt":0.3034710440275536,"score_spread":0.27328135669654396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991809010","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.556214,0.0009113837,0.43004242,0.00078102417,0.00004879972,0.00012048837,0.00026613587,0.0005651068,0.01105069],"genre_scores_gemma":[0.9798115,0.000276151,0.018398223,0.0001119887,0.000027430877,0.00009557057,0.000116424504,0.0000837243,0.0010789813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988312,0.00031988145,0.00004986509,0.00025885282,0.00024391711,0.0002961853],"domain_scores_gemma":[0.98680204,0.009489067,0.0010229923,0.0013496726,0.0004943799,0.00084176136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020293582,0.00054525613,0.0008149395,0.0014883569,0.0009925251,0.0015245329,0.0018716976,0.0009894633,0.0029967956],"category_scores_gemma":[0.01721109,0.0006020511,0.0010387389,0.00046153282,0.0041633807,0.0034306995,0.0020014876,0.0019238612,0.00031417605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034573424,0.000115132636,0.006325862,0.00030206394,0.000107898515,0.000387501,0.00064351683,0.2039551,0.017900025,0.75131327,0.0021656253,0.016438268],"study_design_scores_gemma":[0.00003267895,0.00007137868,0.001866834,0.000057648147,0.00002938592,0.00023832513,0.0000971793,0.4967459,0.0049171695,0.4949681,0.0009237052,0.000051739964],"about_ca_topic_score_codex":0.0026483827,"about_ca_topic_score_gemma":0.0015574382,"teacher_disagreement_score":0.0029967956,"about_ca_system_score_codex":0.0019640042,"about_ca_system_score_gemma":0.0007449097,"threshold_uncertainty_score":0.014249921},"labels":[],"label_agreement":null},{"id":"W1991963660","doi":"10.1016/s0095-8956(03)00039-x","title":"The linear delta-matroid parity problem","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale pour la Gestion des Déchets Radioactifs","keywords":"Matroid; Matroid partitioning; Oriented matroid; Weighted matroid; Minimax; Combinatorics; Mathematics; Parity (physics); Discrete mathematics; Generalization; Graphic matroid; Mathematical optimization; Mathematical analysis; Physics","score_opus":0.01284547565339551,"score_gpt":0.27372730726499367,"score_spread":0.26088183161159817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991963660","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61335266,0.0015394606,0.21096745,0.018161593,0.00074300537,0.00019801037,0.0020001333,0.00070854137,0.15232913],"genre_scores_gemma":[0.94742274,0.00067922985,0.02942526,0.0009927639,0.00040591924,0.00011153448,0.0011115789,0.00013792964,0.019713083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990331,0.0003361948,0.00004326904,0.0002129862,0.00018992097,0.00018453631],"domain_scores_gemma":[0.99511045,0.0032345636,0.0003021943,0.00059943675,0.00036802917,0.00038537616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011139585,0.0004778181,0.0009786166,0.0006622583,0.0015517371,0.0034567136,0.0023011293,0.0023545967,0.011892157],"category_scores_gemma":[0.007027909,0.00049802795,0.00053808227,0.0013329858,0.0021354589,0.00530353,0.002151805,0.0031486077,0.0011526259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044792276,0.00021246757,0.0011929774,0.00028109236,0.000037742466,0.00031874696,0.000252453,0.0125184795,0.0021653904,0.90593123,0.018496115,0.0581454],"study_design_scores_gemma":[0.000082975326,0.000031686115,0.00020786359,0.000024185407,0.000015308558,0.00022675551,0.0001504307,0.03171446,0.0010774297,0.96345466,0.0030004736,0.000013788816],"about_ca_topic_score_codex":0.0008676172,"about_ca_topic_score_gemma":0.00067748985,"teacher_disagreement_score":0.011892157,"about_ca_system_score_codex":0.0011330972,"about_ca_system_score_gemma":0.0011855306,"threshold_uncertainty_score":0.0397833},"labels":[],"label_agreement":null},{"id":"W1992234658","doi":"10.1016/j.ejc.2015.02.013","title":"Boxicity and cubicity of product graphs","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Austrian Science Fund","keywords":"Intersection graph; Mathematics; Combinatorics; Cartesian product; Graph; Sublinear function; Discrete mathematics; Line graph","score_opus":0.038455324322367514,"score_gpt":0.272555753371019,"score_spread":0.2341004290486515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992234658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86048186,0.00046628795,0.08420524,0.001127511,0.000085740576,0.000043893226,0.000590276,0.0001949736,0.052804165],"genre_scores_gemma":[0.9761377,0.0003453018,0.011609167,0.00015485777,0.00007928119,0.000053070562,0.000528623,0.00008369045,0.011008396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993303,0.00014855353,0.000028791192,0.00016591288,0.00015369448,0.00017271486],"domain_scores_gemma":[0.99499303,0.0031825288,0.00053974695,0.00040973746,0.00040333736,0.00047165484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006186288,0.00035991243,0.0008045277,0.0011415591,0.0015679186,0.0029453533,0.0008352104,0.0007299237,0.008220494],"category_scores_gemma":[0.003694766,0.00066417415,0.0006762594,0.0014752545,0.0030414115,0.0036137137,0.0019540808,0.0020549607,0.00058499136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017175543,0.000041054995,0.0022219957,0.00009124028,0.000018790575,0.0002041974,0.00095009163,0.0031986504,0.0021503363,0.979736,0.0017144636,0.009501495],"study_design_scores_gemma":[0.000027968254,0.000018396775,0.00095090613,0.000015827176,0.000012653496,0.00014213791,0.00019623581,0.0058925627,0.0006946288,0.9896054,0.0024300285,0.000013193338],"about_ca_topic_score_codex":0.0035804454,"about_ca_topic_score_gemma":0.004388543,"teacher_disagreement_score":0.008220494,"about_ca_system_score_codex":0.0010254199,"about_ca_system_score_gemma":0.000757621,"threshold_uncertainty_score":0.027500272},"labels":[],"label_agreement":null},{"id":"W1992400796","doi":"10.1016/s0012-365x(01)00054-1","title":"On the divisibility of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Agence Nationale pour la Gestion des Déchets Radioactifs","keywords":"Mathematics; Combinatorics; Divisibility rule; Perfect graph; Perfect graph theorem; Conjecture; Trivially perfect graph; Induced subgraph; Split graph; Discrete mathematics; Graph; Clique number; Vertex (graph theory); Partition (number theory); Cograph; Chromatic scale; Line graph; Pathwidth","score_opus":0.04652455214468322,"score_gpt":0.2935728521492843,"score_spread":0.2470483000046011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992400796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5770765,0.008713726,0.15997864,0.024333134,0.0013410763,0.000121194396,0.000792625,0.00038845427,0.22725467],"genre_scores_gemma":[0.92765963,0.006371717,0.02381886,0.0018892426,0.0024007584,0.00014766712,0.0006571322,0.00037507506,0.036679987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986143,0.0005192542,0.00006237414,0.00033388464,0.00028473002,0.00018544424],"domain_scores_gemma":[0.9785242,0.016019514,0.0012662819,0.0019254799,0.0010626098,0.0012020456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024632988,0.0010619593,0.0016975544,0.0039924337,0.0029291096,0.0034554983,0.002679646,0.0022821624,0.010148517],"category_scores_gemma":[0.017039932,0.0011209053,0.0013111987,0.0028625818,0.0114348,0.014803409,0.0053661,0.00858142,0.0008785077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007387633,0.000024418021,0.00031965,0.00008637347,0.000011571982,0.0000647066,0.00049094163,0.0018665614,0.0004274831,0.9887293,0.0017294441,0.0061756424],"study_design_scores_gemma":[0.0000073605006,0.000006804728,0.000093530005,0.000011277058,0.0000028031866,0.000032419266,0.000040538194,0.0011948891,0.000059574108,0.9974076,0.0011391863,0.0000040057294],"about_ca_topic_score_codex":0.0009616136,"about_ca_topic_score_gemma":0.0006738067,"teacher_disagreement_score":0.010148517,"about_ca_system_score_codex":0.0020211586,"about_ca_system_score_gemma":0.00053923624,"threshold_uncertainty_score":0.03395021},"labels":[],"label_agreement":null},{"id":"W1992428436","doi":"10.1016/j.jctb.2013.07.001","title":"Characterizing graphic matroids by a system of linear equations","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Graphic matroid; Rank (graph theory); Construct (python library); System of linear equations; Binary number; Linear equation; Mathematics; Oriented matroid; Combinatorics; Matroid partitioning; Discrete mathematics; Computer science; Mathematical analysis; Arithmetic; Programming language","score_opus":0.011407239103333898,"score_gpt":0.25369649348407347,"score_spread":0.24228925438073956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992428436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31457233,0.0003367938,0.6452059,0.0021047287,0.00020753937,0.0003386028,0.0014199334,0.0006174006,0.035196796],"genre_scores_gemma":[0.85386324,0.00042062532,0.120095156,0.0007910635,0.0004691755,0.0003784004,0.0017501746,0.00026776738,0.021964421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986072,0.0004383604,0.00008807164,0.00034737654,0.00032511068,0.00019390116],"domain_scores_gemma":[0.9958954,0.0025410745,0.0005786681,0.00030012804,0.00048272012,0.00020210941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011113151,0.000851398,0.001191419,0.0022302181,0.0010763023,0.0039797667,0.0016209362,0.0020049193,0.008696166],"category_scores_gemma":[0.00850239,0.0009905664,0.0015353946,0.0016193797,0.001654191,0.0031768342,0.0019517757,0.0029058023,0.0011382283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008318233,0.00021547334,0.0042331833,0.00018035538,0.00007095325,0.0003178467,0.0007959368,0.0471367,0.0051463945,0.9042767,0.009338498,0.028204758],"study_design_scores_gemma":[0.00005792065,0.000057832996,0.00089349295,0.000030214816,0.00003207061,0.00019043557,0.00019447827,0.26540148,0.0010315453,0.7290517,0.0030109482,0.0000479323],"about_ca_topic_score_codex":0.0022218153,"about_ca_topic_score_gemma":0.002946076,"teacher_disagreement_score":0.008696166,"about_ca_system_score_codex":0.0014657262,"about_ca_system_score_gemma":0.0008999573,"threshold_uncertainty_score":0.029091597},"labels":[],"label_agreement":null},{"id":"W1992434757","doi":"10.1142/s0129054100000259","title":"FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT","year":2000,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Supertree; Combinatorics; Mathematics; Tree (set theory); Vertex (graph theory); Minor (academic); Bounded function; Embedding; Discrete mathematics; Computer science; Graph; Biology; Artificial intelligence; Phylogenetic tree","score_opus":0.0312662277924988,"score_gpt":0.3391405770950674,"score_spread":0.3078743493025686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992434757","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32300088,0.0004981269,0.66996473,0.0004971035,0.000031026375,0.00016630338,0.00083582604,0.0011333976,0.0038726311],"genre_scores_gemma":[0.59461516,0.0004285689,0.39923066,0.00016312671,0.00006766197,0.00015821688,0.0026448462,0.00034721202,0.0023445163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991053,0.00018317286,0.00008059832,0.00028860342,0.00024658407,0.000095764095],"domain_scores_gemma":[0.9926467,0.003962079,0.0009970465,0.0013027396,0.0007238968,0.00036757585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009305949,0.0003577421,0.0008479709,0.0011523882,0.0008354839,0.0012700931,0.00078998675,0.00069870404,0.001310891],"category_scores_gemma":[0.007514371,0.0004901502,0.00071312697,0.0013359848,0.0011696239,0.0031399482,0.0021158515,0.0007259194,0.00040156543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007899396,0.0002321083,0.014557302,0.0012244226,0.00010469237,0.0014794569,0.0041509415,0.06888961,0.09739385,0.30595836,0.015091597,0.49012774],"study_design_scores_gemma":[0.000052299598,0.0002602719,0.004738577,0.000088902016,0.00007220049,0.0019410516,0.0011437023,0.20435427,0.03479042,0.73402226,0.018485848,0.000050244304],"about_ca_topic_score_codex":0.00089689356,"about_ca_topic_score_gemma":0.0014713067,"teacher_disagreement_score":0.001310891,"about_ca_system_score_codex":0.0005374326,"about_ca_system_score_gemma":0.0008707838,"threshold_uncertainty_score":0.004921496},"labels":[],"label_agreement":null},{"id":"W1992517803","doi":"10.1016/j.jalgor.2004.04.011","title":"A polynomial-time algorithm for near-unanimity graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Time complexity; Unanimity; Algorithm; Combinatorics; Polynomial; Mathematics; Computer science; Discrete mathematics","score_opus":0.016181630222047556,"score_gpt":0.2872839656478463,"score_spread":0.27110233542579876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992517803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13079703,0.00080842286,0.82641554,0.00427987,0.00041048112,0.0010410151,0.0018518595,0.010023568,0.024372306],"genre_scores_gemma":[0.24845497,0.0003589411,0.7297264,0.0006199955,0.00019893816,0.00059111236,0.004119448,0.0011652182,0.014765122],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736017,0.0003815615,0.00017715935,0.0009914944,0.0006601568,0.00042945263],"domain_scores_gemma":[0.99361914,0.0029869382,0.00038492118,0.0018449894,0.0006477084,0.00051626965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016982557,0.0016271748,0.0023073372,0.002158034,0.003739516,0.0040223617,0.0059865243,0.003089075,0.012791849],"category_scores_gemma":[0.008184201,0.0013594066,0.0022919495,0.0035412598,0.0021953355,0.012854099,0.005936399,0.0035864061,0.003465193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023208826,0.001611638,0.0027816151,0.001392564,0.00022529479,0.00033811014,0.0015648227,0.07244643,0.02341389,0.21745425,0.050168514,0.62628204],"study_design_scores_gemma":[0.0006682047,0.00031757116,0.0009723368,0.00011424549,0.0001970051,0.00044865505,0.00058182445,0.2927638,0.012352684,0.673286,0.018196229,0.00010138274],"about_ca_topic_score_codex":0.00456562,"about_ca_topic_score_gemma":0.008688976,"teacher_disagreement_score":0.012791849,"about_ca_system_score_codex":0.0039147977,"about_ca_system_score_gemma":0.0044851047,"threshold_uncertainty_score":0.042792976},"labels":[],"label_agreement":null},{"id":"W1992684615","doi":"10.1016/j.jctb.2007.09.004","title":"Oriented star packings","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"","keywords":"Digraph; Combinatorics; Disjoint sets; Mathematics; Star (game theory); Vertex (graph theory); Packing problems; Hypergraph; Stars; Discrete mathematics; Graph; Physics; Astrophysics","score_opus":0.010867677503855932,"score_gpt":0.27922039294997053,"score_spread":0.2683527154461146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992684615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62831783,0.00084846845,0.05245026,0.0011094307,0.00080148183,0.00011675406,0.00070188055,0.00047024974,0.31518358],"genre_scores_gemma":[0.91066474,0.00082388206,0.02584611,0.0005278316,0.0003216778,0.00011913663,0.001304883,0.00033890674,0.060052842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996203,0.00006191731,0.000022299626,0.00007789074,0.00012243923,0.00009523281],"domain_scores_gemma":[0.9993691,0.00015522017,0.00010742829,0.00008323945,0.00010980139,0.00017513479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021592782,0.00062991015,0.00078218326,0.0019830444,0.0021312414,0.0030024627,0.0006184319,0.0011003133,0.016104165],"category_scores_gemma":[0.0010867118,0.0006587555,0.0006088843,0.0020142568,0.0010911818,0.0018434549,0.001821015,0.001458916,0.0023879532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015369333,0.00009162057,0.0008145953,0.00008160225,0.00002550822,0.00026745073,0.00024385407,0.0026114748,0.003908358,0.9669959,0.008164978,0.01664089],"study_design_scores_gemma":[0.000056427434,0.0000715133,0.0014387096,0.000043971515,0.000044624496,0.00080717687,0.0005398674,0.018758545,0.0035392926,0.95023155,0.024439521,0.00002879817],"about_ca_topic_score_codex":0.0006262142,"about_ca_topic_score_gemma":0.00091626047,"teacher_disagreement_score":0.016104165,"about_ca_system_score_codex":0.00068308495,"about_ca_system_score_gemma":0.00039453723,"threshold_uncertainty_score":0.053873777},"labels":[],"label_agreement":null},{"id":"W1993089254","doi":"10.1016/s0012-365x(03)00138-9","title":"The Petersen graph is not 3-edge-colorable—a new proof","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Petersen graph; Mathematics; Combinatorics; Graph; Combinatorial proof; Discrete mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Line graph; Voltage graph; Computer science; Graph power","score_opus":0.03119521382550538,"score_gpt":0.2955282700129855,"score_spread":0.2643330561874801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993089254","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23674093,0.003443812,0.3452028,0.031304922,0.0047477605,0.00040241782,0.0019967442,0.001037393,0.37512317],"genre_scores_gemma":[0.85250306,0.0055359164,0.09383684,0.006841409,0.0024025778,0.00032249923,0.0023728732,0.0005810633,0.035603803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915636,0.000104923885,0.000042504853,0.00027653226,0.00024728363,0.00017245571],"domain_scores_gemma":[0.9960949,0.0021787013,0.00031700925,0.00040726658,0.00059459254,0.00040752845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011305101,0.0017487463,0.0012694219,0.002177095,0.0025732217,0.0025896663,0.0026643923,0.0021233207,0.01423882],"category_scores_gemma":[0.0043093488,0.0012356655,0.002721635,0.0018930177,0.0057155383,0.010955102,0.0057078856,0.010121178,0.0013351999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001385196,0.00010362841,0.0010550619,0.00031487536,0.00007729632,0.00069707114,0.0003555868,0.0015953766,0.0030990057,0.96773225,0.011366977,0.013464516],"study_design_scores_gemma":[0.00005564571,0.00004875225,0.0011639445,0.000053003405,0.000085596235,0.0007649119,0.00027988385,0.0054441895,0.0019624732,0.9683975,0.021693652,0.000050488878],"about_ca_topic_score_codex":0.002344553,"about_ca_topic_score_gemma":0.002944569,"teacher_disagreement_score":0.01423882,"about_ca_system_score_codex":0.0014693043,"about_ca_system_score_gemma":0.00087921653,"threshold_uncertainty_score":0.047633648},"labels":[],"label_agreement":null},{"id":"W1993237896","doi":"10.1016/j.disc.2008.05.038","title":"The circular chromatic number of hypergraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic scale; Mathematics; Generalization; Combinatorics; Mathematical proof; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.023709070813125177,"score_gpt":0.29308402407486295,"score_spread":0.26937495326173777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993237896","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8094718,0.0015111611,0.06614706,0.0033765996,0.00037464694,0.000073504016,0.001312405,0.0004591161,0.11727375],"genre_scores_gemma":[0.9771854,0.0009473982,0.009440144,0.00026474384,0.00035409752,0.00008387341,0.0005851565,0.00012834034,0.0110107735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928147,0.00017356916,0.000030765925,0.00020378456,0.00015995858,0.00015049119],"domain_scores_gemma":[0.99242765,0.0041339374,0.0010783043,0.0007185172,0.0006723421,0.0009692636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010039753,0.0004346042,0.00052462035,0.003487114,0.0021620607,0.0047219335,0.0014241794,0.0012840042,0.01005758],"category_scores_gemma":[0.006964412,0.00053513696,0.00035451577,0.003911671,0.0044336407,0.004744049,0.0013663169,0.0016400121,0.0008003295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035988961,0.000034094282,0.0033036354,0.0001174544,0.000022531056,0.00006377814,0.00043841373,0.008810526,0.0033975248,0.9620934,0.006666412,0.014692446],"study_design_scores_gemma":[0.000060836832,0.00004282055,0.0035462703,0.000055221095,0.000038313872,0.00019340358,0.00034353312,0.03346798,0.0024500755,0.95070356,0.009053642,0.000044256863],"about_ca_topic_score_codex":0.003574221,"about_ca_topic_score_gemma":0.0029109989,"teacher_disagreement_score":0.01005758,"about_ca_system_score_codex":0.0028908509,"about_ca_system_score_gemma":0.0012994987,"threshold_uncertainty_score":0.033645928},"labels":[],"label_agreement":null},{"id":"W1993350312","doi":"10.1016/j.disc.2012.12.003","title":"Efficient domination in circulant graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Mathematics; Circulant graph; Combinatorics; Wreath product; Dominating set; Discrete mathematics; Graph; Line graph; Product (mathematics); Voltage graph; Vertex (graph theory)","score_opus":0.016434020257279764,"score_gpt":0.27905689023469377,"score_spread":0.262622869977414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993350312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57748306,0.00077332486,0.3510209,0.0015761631,0.00014907145,0.00022867878,0.0005854545,0.0008229536,0.06736041],"genre_scores_gemma":[0.9261071,0.00046033738,0.04891713,0.00034009662,0.00014503635,0.00017969991,0.0005360535,0.00035286593,0.02296163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853396,0.00044808746,0.00005073892,0.00022435066,0.00037526255,0.00036758027],"domain_scores_gemma":[0.99072015,0.0060200994,0.0005361825,0.001302975,0.00069422345,0.00072640984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011248072,0.0006567705,0.0011512109,0.0012480298,0.0021162492,0.0031152274,0.0019929819,0.001191734,0.006934782],"category_scores_gemma":[0.008320247,0.00065221894,0.00063598633,0.0018482491,0.0016732544,0.0031289032,0.0020887165,0.0017746792,0.0007764813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023334498,0.00018986597,0.0012880011,0.00020034632,0.000043821652,0.00026885935,0.0005965949,0.036045887,0.01199526,0.8935374,0.010085308,0.045515366],"study_design_scores_gemma":[0.00008745853,0.000035620076,0.00046169452,0.000026133948,0.000030222925,0.00019568486,0.00013486149,0.16024493,0.0039396277,0.8297033,0.005117579,0.000022895414],"about_ca_topic_score_codex":0.0025910705,"about_ca_topic_score_gemma":0.0059441538,"teacher_disagreement_score":0.006934782,"about_ca_system_score_codex":0.0017231748,"about_ca_system_score_gemma":0.001483844,"threshold_uncertainty_score":0.0231992},"labels":[],"label_agreement":null},{"id":"W1993587964","doi":"10.1016/j.disc.2009.12.007","title":"Domination of generalized Cartesian products","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Mathematics; Cartesian product; Combinatorics; Discrete mathematics; Cartesian coordinate system; Algebra over a field; Pure mathematics; Geometry","score_opus":0.017179675835678223,"score_gpt":0.29458408373626477,"score_spread":0.27740440790058657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993587964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80645794,0.00097564136,0.10540641,0.0009925102,0.00014925134,0.000049230024,0.00033568792,0.0001991644,0.085434176],"genre_scores_gemma":[0.9687872,0.00046046003,0.010626375,0.00019888724,0.00015590842,0.000060089886,0.0002708227,0.00011340253,0.019326983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985864,0.00034158665,0.000070228634,0.00034386443,0.0003778327,0.00028003132],"domain_scores_gemma":[0.9943342,0.0031252948,0.0005248167,0.00062296423,0.00080702716,0.0005857009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012117294,0.00042026662,0.0011356041,0.0018918585,0.0021695907,0.0037258337,0.0010833364,0.00074382866,0.00642728],"category_scores_gemma":[0.0045667533,0.00070530374,0.0008927934,0.0021707243,0.0036657508,0.0045582075,0.002596759,0.001871792,0.00048578723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054375374,0.0000110666515,0.00040039804,0.000024564266,0.00001149006,0.00007197345,0.0004929935,0.00061357365,0.00065952743,0.99358726,0.000608055,0.0034647132],"study_design_scores_gemma":[0.000025855876,0.000014050223,0.00047823635,0.000009674081,0.000017080223,0.000184625,0.0001521631,0.0032329496,0.0005497764,0.9926045,0.0027189709,0.0000121233525],"about_ca_topic_score_codex":0.001588498,"about_ca_topic_score_gemma":0.0015335295,"teacher_disagreement_score":0.00642728,"about_ca_system_score_codex":0.0013313853,"about_ca_system_score_gemma":0.0006527319,"threshold_uncertainty_score":0.021501422},"labels":[],"label_agreement":null},{"id":"W1993739399","doi":"10.5539/jmr.v3n1p148","title":"Net Tape Graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; 1-planar graph; Graph; Ribbon; Indifference graph; Discrete mathematics; Line graph; Chordal graph; Geometry","score_opus":0.21256792913739325,"score_gpt":0.4109825260800115,"score_spread":0.19841459694261826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993739399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15783817,0.0012858174,0.556035,0.0011270401,0.0012259722,0.0002654063,0.0024149197,0.0023992844,0.27740854],"genre_scores_gemma":[0.724985,0.0016863133,0.11875451,0.00085247215,0.00036456354,0.00035347012,0.002927827,0.0004967065,0.14957915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973124,0.000041154985,0.000013198054,0.000062404615,0.00010115474,0.000050745817],"domain_scores_gemma":[0.9995994,0.000059729224,0.00006226353,0.00007343345,0.00013640546,0.00006870309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013707242,0.00039823834,0.00023138331,0.0008135387,0.0009298951,0.0011378445,0.00069299067,0.00041891666,0.015094015],"category_scores_gemma":[0.00058486394,0.00016103506,0.0003047969,0.00073239655,0.00065691513,0.0021066342,0.00096334855,0.0007302322,0.0015658007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014142689,0.000046598205,0.00081104145,0.000181174,0.000016023465,0.00063847215,0.00031989938,0.0043371017,0.0064324844,0.92567474,0.010420456,0.050980527],"study_design_scores_gemma":[0.000045396187,0.00013341702,0.0014873492,0.000082549894,0.0000482724,0.0017560809,0.0006942242,0.027395725,0.010099338,0.7457123,0.21249913,0.000046188135],"about_ca_topic_score_codex":0.0017121141,"about_ca_topic_score_gemma":0.0029099598,"teacher_disagreement_score":0.015094015,"about_ca_system_score_codex":0.0006383802,"about_ca_system_score_gemma":0.00041139743,"threshold_uncertainty_score":0.050494492},"labels":[],"label_agreement":null},{"id":"W1994346013","doi":"10.4153/cmb-2012-046-3","title":"The <i>f</i>-Chromatic Index of a Graph Whose <i>f</i>-Core Has Maximum Degree 2","year":2013,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Research in Fundamental Sciences; School of Mathematics, Institute for Research in Fundamental Sciences","keywords":"Combinatorics; Mathematics; Graph; Graph power; Vertex (graph theory); Degree (music); Edge coloring; Discrete mathematics; Bound graph; Line graph; Physics","score_opus":0.03712894046586018,"score_gpt":0.24669559014851455,"score_spread":0.20956664968265437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994346013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9579669,0.00035324148,0.018729044,0.0005120634,0.00007742595,0.000043982054,0.0011979805,0.00018447266,0.020934775],"genre_scores_gemma":[0.9804308,0.00017978546,0.014249518,0.00011135509,0.000040301577,0.00004952047,0.0011019782,0.000057907553,0.003778893],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999795,0.000017658218,0.000010276958,0.00006318425,0.00002979681,0.00008409502],"domain_scores_gemma":[0.9992349,0.00014380035,0.00016321044,0.00006172002,0.00014957835,0.00024676215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021223475,0.00037174407,0.00032528507,0.0011049391,0.0009067324,0.0012030568,0.00043822746,0.0004131857,0.0032417697],"category_scores_gemma":[0.0007328127,0.00016612398,0.00028861084,0.0005918147,0.0007885033,0.0009380427,0.00035340205,0.0004694875,0.00032212865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003301576,0.00077949825,0.09027285,0.0011348957,0.0003550468,0.0013836143,0.0017799247,0.09725366,0.34901676,0.25780135,0.039788052,0.15713274],"study_design_scores_gemma":[0.0003089256,0.0014343157,0.14248504,0.00033648015,0.0003180439,0.004553547,0.001791342,0.30093968,0.16159904,0.31020886,0.07571279,0.00031199708],"about_ca_topic_score_codex":0.0040732604,"about_ca_topic_score_gemma":0.0043983585,"teacher_disagreement_score":0.0040732604,"about_ca_system_score_codex":0.0017752302,"about_ca_system_score_gemma":0.00068999914,"threshold_uncertainty_score":0.012880266},"labels":[],"label_agreement":null},{"id":"W1994512037","doi":"10.1016/s0304-3975(01)00263-8","title":"Density via duality","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Homomorphism; Mathematics; Duality (order theory); Partially ordered set; Directed graph; Combinatorics; Discrete mathematics","score_opus":0.024775744892119242,"score_gpt":0.28839810292029566,"score_spread":0.2636223580281764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994512037","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10858604,0.003311875,0.32578608,0.015918951,0.0016261132,0.00016839681,0.00093078957,0.00079316174,0.5428785],"genre_scores_gemma":[0.84755564,0.0029274705,0.036044415,0.0033450192,0.00254868,0.00040236465,0.00072163506,0.00072957214,0.10572518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881244,0.0003398594,0.000042862986,0.0002676669,0.000338223,0.00019886253],"domain_scores_gemma":[0.9978629,0.0010634792,0.00014377612,0.00028118014,0.00032412747,0.0003244692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011285308,0.0009564201,0.0018512656,0.0038546752,0.0033283764,0.004897115,0.0016587828,0.0020573696,0.01906773],"category_scores_gemma":[0.0059917187,0.00092817476,0.0014554323,0.0026972357,0.004486683,0.010043527,0.0065151495,0.0065568592,0.0025980994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005177973,0.0000061311707,0.000022342821,0.000010700552,0.000001959819,0.000005703293,0.000038812435,0.00009617857,0.000053924334,0.9972914,0.0011027165,0.0013648928],"study_design_scores_gemma":[0.0000034530801,0.0000020070538,0.000028938628,0.000004475911,0.0000026936148,0.00002978168,0.00001606235,0.00087722886,0.000053192438,0.9973908,0.0015886683,0.0000028256475],"about_ca_topic_score_codex":0.0010155559,"about_ca_topic_score_gemma":0.00053365086,"teacher_disagreement_score":0.01906773,"about_ca_system_score_codex":0.0023697228,"about_ca_system_score_gemma":0.0009443869,"threshold_uncertainty_score":0.06378794},"labels":[],"label_agreement":null},{"id":"W1994609765","doi":"10.1007/s00373-006-0653-4","title":"Coloring Vertices and Faces of Locally Planar Graphs","year":2006,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Outerplanar graph; Graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.011546693249279157,"score_gpt":0.23584856605866827,"score_spread":0.22430187280938912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994609765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77839977,0.0010876444,0.15957928,0.00133884,0.00025702638,0.000093271134,0.00042721233,0.00059632555,0.058220726],"genre_scores_gemma":[0.9085582,0.0010524021,0.06025016,0.00033696878,0.00020655435,0.00011841763,0.000734016,0.00028126535,0.028462019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960464,0.000095297364,0.000014946731,0.000076800956,0.00009433661,0.00011402186],"domain_scores_gemma":[0.9984981,0.0009095607,0.00014778925,0.00015214882,0.00011868634,0.00017371551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030682964,0.0005289947,0.0006168293,0.0009107283,0.0012413741,0.0027014678,0.0011650937,0.00088314805,0.0058397143],"category_scores_gemma":[0.0023076697,0.00068388414,0.00042138787,0.001124849,0.0015507251,0.0023664988,0.0013544274,0.001790294,0.0007048344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004278618,0.00012937823,0.0031604143,0.00023602176,0.00003567595,0.00042723966,0.0014588308,0.024097104,0.015240252,0.8680017,0.008711936,0.07807356],"study_design_scores_gemma":[0.000044890377,0.000038988943,0.0012329941,0.000027557902,0.000035825993,0.00019122192,0.0006691218,0.022499885,0.004308131,0.96436757,0.0065612886,0.000022569675],"about_ca_topic_score_codex":0.0031056597,"about_ca_topic_score_gemma":0.005269891,"teacher_disagreement_score":0.0058397143,"about_ca_system_score_codex":0.0010878878,"about_ca_system_score_gemma":0.0005487799,"threshold_uncertainty_score":0.01953578},"labels":[],"label_agreement":null},{"id":"W1995160715","doi":"10.1016/j.ejc.2009.11.009","title":"Circuit and fractional circuit covers of matroids","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Mathematics; Conjecture; Combinatorics; Cover (algebra); Circumference; Graphic matroid; Set (abstract data type); Discrete mathematics; Geometry; Computer science","score_opus":0.02325855087543759,"score_gpt":0.25863036851149096,"score_spread":0.23537181763605336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995160715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9291671,0.0008203432,0.023650784,0.000636412,0.000048779835,0.00002117153,0.00042471124,0.00011584552,0.04511485],"genre_scores_gemma":[0.98592585,0.00053865224,0.0037538472,0.00008056581,0.00011316334,0.000023448538,0.00035422057,0.000037457725,0.009172707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994535,0.00007830014,0.00001832684,0.0000944417,0.00018074752,0.00017466051],"domain_scores_gemma":[0.9986557,0.00079111126,0.00017109806,0.0001238261,0.00008367794,0.00017458835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024308516,0.00039811042,0.00076078443,0.001346254,0.0015750335,0.0029497505,0.00076059595,0.0009084425,0.007957469],"category_scores_gemma":[0.002099759,0.0004339431,0.00060720346,0.0019959148,0.0012515939,0.0023540456,0.0012214343,0.0012312486,0.00035495523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037579134,0.00007703641,0.0021144405,0.0001272003,0.000048742142,0.0004219317,0.00069444574,0.017237976,0.00548701,0.9481491,0.0028425418,0.022423632],"study_design_scores_gemma":[0.000057632034,0.00005215586,0.0029713195,0.000035174362,0.00006849536,0.00056864455,0.00028074023,0.049884334,0.0029996156,0.934191,0.0088687455,0.000022279348],"about_ca_topic_score_codex":0.0026473955,"about_ca_topic_score_gemma":0.0028105623,"teacher_disagreement_score":0.007957469,"about_ca_system_score_codex":0.0016900726,"about_ca_system_score_gemma":0.00041769168,"threshold_uncertainty_score":0.026620328},"labels":[],"label_agreement":null},{"id":"W1995612970","doi":"10.1016/s0012-365x(02)00260-1","title":"On cop-win graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Calgary; Université de Montréal","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Discrete mathematics; Indifference graph; Graph","score_opus":0.034749443931359224,"score_gpt":0.290733015575863,"score_spread":0.2559835716445038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995612970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4362088,0.001456853,0.20872952,0.007521042,0.0011214204,0.00033387713,0.0011494296,0.00094907876,0.3425299],"genre_scores_gemma":[0.8602639,0.001534823,0.02799954,0.0015271184,0.0006890013,0.0003277877,0.0013374394,0.0008531057,0.105467185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989231,0.00023100711,0.00003620306,0.00023011398,0.00024653983,0.00033297937],"domain_scores_gemma":[0.9963793,0.0013860684,0.00051845703,0.0005161876,0.00038880014,0.00081122055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007950561,0.0013123044,0.0017840271,0.0031021188,0.0051990906,0.0046626767,0.0022388052,0.002125943,0.022787873],"category_scores_gemma":[0.005360405,0.0011865015,0.001313177,0.0033952922,0.0030722911,0.008804456,0.005118605,0.0048507676,0.002495506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046934085,0.000025859097,0.00019111934,0.000042658845,0.000009160255,0.00006965621,0.00020421408,0.0008494209,0.00031434014,0.9887334,0.004302761,0.005210614],"study_design_scores_gemma":[0.000012494741,0.0000056152708,0.00010328916,0.000012331002,0.000009272207,0.000050883704,0.00009949993,0.002811192,0.00014506633,0.99407285,0.0026723063,0.00000522113],"about_ca_topic_score_codex":0.002748257,"about_ca_topic_score_gemma":0.0035378844,"teacher_disagreement_score":0.022787873,"about_ca_system_score_codex":0.001954236,"about_ca_system_score_gemma":0.0010293998,"threshold_uncertainty_score":0.07623303},"labels":[],"label_agreement":null},{"id":"W1995632009","doi":"10.1016/j.ejc.2012.02.002","title":"Immersing complete digraphs","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Eulerian path; Immersion (mathematics); Graph; Simple (philosophy); Degree (music); Discrete mathematics; Pure mathematics; Physics","score_opus":0.03739444157553979,"score_gpt":0.2731345082850047,"score_spread":0.2357400667094649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995632009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3170109,0.00041496241,0.5436571,0.0009457385,0.00047810233,0.00015819972,0.00078896066,0.0015239911,0.135022],"genre_scores_gemma":[0.7754089,0.00076592306,0.12914144,0.0005382768,0.00010198564,0.00017895778,0.0012513592,0.0009000026,0.09171311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999424,0.0000989901,0.00003140529,0.00017656843,0.00013450692,0.00013447512],"domain_scores_gemma":[0.9984327,0.0007676515,0.00007876219,0.00026184804,0.00016198959,0.00029706262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039066642,0.0010867734,0.00071205804,0.0010655762,0.0014189605,0.002221455,0.0009715748,0.0013554895,0.0185156],"category_scores_gemma":[0.0021134717,0.0009956653,0.0009612317,0.00079556496,0.001318619,0.0046768123,0.0064031202,0.0034690404,0.0022894277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011654342,0.00011271014,0.00049639406,0.00014305941,0.000034928595,0.00077074836,0.001751802,0.00615895,0.009634755,0.9431695,0.0030668506,0.0345438],"study_design_scores_gemma":[0.000039329116,0.00007426427,0.00027043436,0.000052761447,0.000031153813,0.00037375648,0.00081184023,0.013467366,0.0040242164,0.95890266,0.021928022,0.000024091165],"about_ca_topic_score_codex":0.0007919921,"about_ca_topic_score_gemma":0.0017708483,"teacher_disagreement_score":0.0185156,"about_ca_system_score_codex":0.000520455,"about_ca_system_score_gemma":0.00031887056,"threshold_uncertainty_score":0.06194079},"labels":[],"label_agreement":null},{"id":"W1996212671","doi":"10.1109/icc.2012.6363762","title":"Carving-decomposition based algorithms for the maximum path coloring problem","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Cardinality (data modeling); Path (computing); Approximation algorithm; Disjoint sets; Mathematics; Algorithm; Computer science; Discrete mathematics; Graph; Database","score_opus":0.041602706309320975,"score_gpt":0.3298041118872781,"score_spread":0.28820140557795715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996212671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020770615,0.0008187239,0.965515,0.0004655961,0.000085448475,0.00022533271,0.00030281144,0.0023483098,0.0094681075],"genre_scores_gemma":[0.13511708,0.0005568425,0.85768056,0.00026432,0.00006557338,0.0003769573,0.0014594819,0.0005253283,0.0039539007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998273,0.0003783427,0.00007922288,0.0004170922,0.0004471952,0.0004051025],"domain_scores_gemma":[0.99841726,0.00073055265,0.00012558859,0.00037356417,0.00023936645,0.00011374639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012600992,0.0019349811,0.0015366158,0.0015739825,0.0012287848,0.0019928168,0.0027595654,0.0015535117,0.007932814],"category_scores_gemma":[0.0038498882,0.0010596834,0.0017432766,0.0026320145,0.001074984,0.003673111,0.0026683765,0.0028227093,0.0017385102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045333168,0.0004668508,0.0008643666,0.00038884737,0.00009725149,0.0001001725,0.00031402538,0.5638645,0.0051303245,0.0947219,0.022997513,0.3106009],"study_design_scores_gemma":[0.000095609415,0.000051802937,0.00013304812,0.000028158298,0.000022679944,0.00007903119,0.00006287824,0.9332422,0.0016934,0.059294954,0.0052777277,0.000018429662],"about_ca_topic_score_codex":0.007591673,"about_ca_topic_score_gemma":0.009341992,"teacher_disagreement_score":0.007932814,"about_ca_system_score_codex":0.0031314981,"about_ca_system_score_gemma":0.0033364391,"threshold_uncertainty_score":0.026537895},"labels":[],"label_agreement":null},{"id":"W1996626788","doi":"10.1112/s0024611500012168","title":"Convex Bodies, Graphs and Partial Orders","year":2000,"lang":"en","type":"article","venue":"Proceedings of the London Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Pointwise; Combinatorics; Convex polytope; Regular polygon; Convex set; Polytope; Mixed volume; Subderivative; Convex body; Convex geometry; Convex analysis; Convex hull; Product (mathematics); Discrete mathematics; Geometry; Mathematical analysis; Convex optimization","score_opus":0.014188926602624495,"score_gpt":0.25693648866429797,"score_spread":0.24274756206167347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996626788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52572024,0.012459722,0.23599835,0.006035384,0.00040137646,0.00006693525,0.00075711025,0.00029616506,0.21826477],"genre_scores_gemma":[0.95128715,0.003413659,0.01969336,0.00029937498,0.00039442047,0.00007087902,0.00053031207,0.000079868856,0.024230974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954224,0.00011094807,0.00002126768,0.000121677025,0.00013845501,0.00006552981],"domain_scores_gemma":[0.9982262,0.0008946897,0.0003140903,0.0001759548,0.00016753176,0.00022159584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045697385,0.0004047303,0.0004798346,0.0014986057,0.0010417278,0.0025612984,0.0005922782,0.00070004934,0.0060217036],"category_scores_gemma":[0.0023906652,0.0002868847,0.00032565152,0.0017233258,0.0058420426,0.005120349,0.001983873,0.0016573446,0.00062822516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009816223,0.000003825897,0.00024560973,0.00002288648,0.0000023695932,0.000030723902,0.00013175297,0.0018020085,0.00022225927,0.99097824,0.0009005717,0.005650059],"study_design_scores_gemma":[0.000003922115,0.0000084264275,0.0005516774,0.000014777505,0.0000030060312,0.00007377473,0.00018423669,0.004031119,0.00023464374,0.98726416,0.0076240827,0.0000061119563],"about_ca_topic_score_codex":0.0019081625,"about_ca_topic_score_gemma":0.0021402827,"teacher_disagreement_score":0.0060217036,"about_ca_system_score_codex":0.0014876894,"about_ca_system_score_gemma":0.0003173602,"threshold_uncertainty_score":0.020144641},"labels":[],"label_agreement":null},{"id":"W1996859829","doi":"10.1016/j.aml.2006.01.017","title":"Tree coloring of distance graphs with a real interval set","year":2006,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Arboricity; Vertex (graph theory); Discrete mathematics; Graph; Vertex connectivity; Interval (graph theory); Degeneracy (biology); Planar graph","score_opus":0.015141743432573712,"score_gpt":0.24804148813283733,"score_spread":0.23289974470026362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996859829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36969995,0.0005126196,0.59799236,0.00079092506,0.00022610127,0.00008857944,0.0007376902,0.00073556753,0.029216267],"genre_scores_gemma":[0.7374084,0.00046496512,0.24999516,0.00022352353,0.000101222045,0.00011573313,0.00077205215,0.00026093103,0.010658136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941516,0.00016754489,0.000034681543,0.0001340147,0.0001406612,0.000107944994],"domain_scores_gemma":[0.9969112,0.0014989347,0.00041940392,0.00042246442,0.00038771803,0.0003602935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048757586,0.00037632996,0.00052903173,0.0008097864,0.00093749765,0.0021133549,0.001236614,0.0006552575,0.004809148],"category_scores_gemma":[0.0030130495,0.0004296164,0.00048225909,0.0012999616,0.0006631874,0.0022012093,0.00080271286,0.0013277688,0.000701416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047816525,0.00016243747,0.0018661532,0.0002270424,0.000043856173,0.00050596584,0.0006745112,0.0369732,0.020700395,0.8804512,0.006042708,0.051874388],"study_design_scores_gemma":[0.00008870162,0.00012851378,0.001428995,0.00004921476,0.000059358106,0.000730509,0.0003951158,0.1651596,0.009102969,0.8066693,0.016145153,0.000042548872],"about_ca_topic_score_codex":0.0012306325,"about_ca_topic_score_gemma":0.0013605374,"teacher_disagreement_score":0.004809148,"about_ca_system_score_codex":0.0009149614,"about_ca_system_score_gemma":0.0006179614,"threshold_uncertainty_score":0.016088188},"labels":[],"label_agreement":null},{"id":"W1996888602","doi":"10.1016/j.disc.2011.05.037","title":"Decomposition tree of a lexicographic product of binary structures","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Lexicographical order; Binary number; Mathematics; Arithmetic","score_opus":0.040228358571186555,"score_gpt":0.31151545552536747,"score_spread":0.2712870969541809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996888602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40820554,0.0008785083,0.49646762,0.0011312864,0.00024594602,0.00031017003,0.0053163012,0.001346526,0.08609808],"genre_scores_gemma":[0.4908205,0.00085771875,0.4442154,0.000329528,0.00009841271,0.00020761022,0.009260393,0.0006818621,0.053528603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997235,0.000042443608,0.000024261812,0.000058340378,0.000089557376,0.000061861414],"domain_scores_gemma":[0.99931455,0.00021940816,0.00007865161,0.00008145354,0.00019562397,0.00011039944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020474612,0.00032901682,0.0005130224,0.0014289722,0.0008811934,0.001900863,0.00045797904,0.0005605192,0.013224073],"category_scores_gemma":[0.00090707204,0.0004481592,0.00058540044,0.001702682,0.0005915843,0.0016671736,0.0007538627,0.0010484633,0.0029745053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004923098,0.00022484869,0.0021967047,0.0006967384,0.000073663236,0.0015277758,0.001337056,0.0049328967,0.05610533,0.78313977,0.020145016,0.129128],"study_design_scores_gemma":[0.000082509294,0.00024735642,0.0033588891,0.00018621811,0.00013103355,0.0023609004,0.0009192212,0.03737541,0.021571793,0.8667004,0.06699954,0.00006663974],"about_ca_topic_score_codex":0.0010097321,"about_ca_topic_score_gemma":0.001678579,"teacher_disagreement_score":0.013224073,"about_ca_system_score_codex":0.00053631037,"about_ca_system_score_gemma":0.00067431066,"threshold_uncertainty_score":0.044238925},"labels":[],"label_agreement":null},{"id":"W1996889656","doi":"10.1016/s0166-218x(99)00217-6","title":"Biconvex graphs: ordering and algorithms","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Row; Row and column spaces; Mathematics; Combinatorics; Bipartite graph; Matrix (chemical analysis); Vertex (graph theory); Property (philosophy); Context (archaeology); Permutation (music); Discrete mathematics; Algorithm; Graph; Computer science","score_opus":0.0166004784493937,"score_gpt":0.270519379893698,"score_spread":0.2539189014443043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996889656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20557067,0.008205138,0.6299435,0.008927309,0.0009825089,0.00031762465,0.0038724672,0.0008626542,0.1413182],"genre_scores_gemma":[0.471861,0.011475624,0.40714663,0.0017055447,0.00078619755,0.00039871476,0.005537378,0.0007051311,0.10038377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993673,0.00016735499,0.00003137264,0.00013954777,0.00018999375,0.000104424296],"domain_scores_gemma":[0.9966274,0.0018470208,0.00029064156,0.0003923577,0.00047505315,0.00036748333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070232234,0.0010480004,0.0014702484,0.0019012005,0.0023134153,0.0050696987,0.0021525698,0.0016611993,0.012193909],"category_scores_gemma":[0.005318664,0.00093604863,0.00075094023,0.006290197,0.0023369351,0.0068026013,0.0018011291,0.004796107,0.0014902786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084987165,0.00008369295,0.0004609715,0.0001763876,0.000012173553,0.000049610695,0.0002132449,0.006850646,0.0005919582,0.9303498,0.01376613,0.04736031],"study_design_scores_gemma":[0.000020996735,0.000014179299,0.0002190549,0.00003087577,0.00000866026,0.00008000077,0.000116851115,0.015882798,0.00033729157,0.9751609,0.008118005,0.000010320107],"about_ca_topic_score_codex":0.007030472,"about_ca_topic_score_gemma":0.011551876,"teacher_disagreement_score":0.012193909,"about_ca_system_score_codex":0.0030147186,"about_ca_system_score_gemma":0.0024822543,"threshold_uncertainty_score":0.040792704},"labels":[],"label_agreement":null},{"id":"W1997048861","doi":"10.1016/j.tcs.2010.12.005","title":"On the complexity of reconfiguration problems","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":258,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control reconfiguration; Mathematics; Time complexity; Transformation (genetics); PSPACE; NP-complete; Computer science; Computational complexity theory; Combinatorics; Theoretical computer science; Algorithm","score_opus":0.04184605298491346,"score_gpt":0.2974343397464628,"score_spread":0.2555882867615493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997048861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36881235,0.009878537,0.35704586,0.044967704,0.0011059025,0.00039286452,0.0029135789,0.0012271833,0.21365596],"genre_scores_gemma":[0.9109624,0.0049728365,0.054351185,0.0019649097,0.0018565409,0.00046383744,0.0026433286,0.0005967304,0.02218812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99388134,0.0022615963,0.00029839348,0.0009184551,0.0017196138,0.0009205737],"domain_scores_gemma":[0.91510737,0.075222805,0.0026553702,0.003563008,0.0016540192,0.0017974923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004062533,0.0016422637,0.0029628035,0.002851429,0.0027641605,0.007450954,0.004152395,0.004008743,0.022622252],"category_scores_gemma":[0.045203015,0.0014345783,0.0026881017,0.004500631,0.0059840474,0.021468904,0.005302838,0.009148328,0.0015048455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000501069,0.00024713724,0.001857828,0.0005782003,0.00011979395,0.00026727564,0.0005620129,0.07956664,0.0009215256,0.8589684,0.01901561,0.037394516],"study_design_scores_gemma":[0.000060898776,0.000022908675,0.00032597154,0.000029084851,0.000027285898,0.00008306509,0.00009457588,0.056417666,0.00016657017,0.9409225,0.0018334519,0.000016089609],"about_ca_topic_score_codex":0.0024863228,"about_ca_topic_score_gemma":0.00216789,"teacher_disagreement_score":0.022622252,"about_ca_system_score_codex":0.0043009007,"about_ca_system_score_gemma":0.0022053774,"threshold_uncertainty_score":0.075679004},"labels":[],"label_agreement":null},{"id":"W1997448354","doi":"10.1007/s10922-006-9042-9","title":"Transmission Link Dimensioning and Service Assignment for Differentiated Protection","year":2006,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Institut National de la Recherche Scientifique; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Polytechnique Montréal","keywords":"Dimensioning; Computer science; Survivability; Transmission (telecommunications); Reliability (semiconductor); Computer network; Mathematical optimization; Service (business); Link (geometry); Distributed computing; Session (web analytics); Telecommunications","score_opus":0.02169622228251448,"score_gpt":0.24747677780108204,"score_spread":0.22578055551856757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997448354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08799571,0.0004885114,0.9039459,0.00038176498,0.00011052774,0.000072490555,0.00008731531,0.0002119502,0.006705803],"genre_scores_gemma":[0.9072583,0.00021190014,0.08992199,0.00008023845,0.00008515889,0.000041677053,0.000051619223,0.00003575675,0.0023134197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999161,0.00035330278,0.000035551642,0.0001634253,0.00013508555,0.00015172643],"domain_scores_gemma":[0.99615127,0.0022388287,0.00031147586,0.00065104314,0.0004488059,0.00019861262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016329219,0.0004572752,0.00073915656,0.00065638224,0.0007469759,0.001361149,0.0011692673,0.0005722424,0.0038992502],"category_scores_gemma":[0.0066736774,0.0003802938,0.0003249215,0.0011915938,0.00096704444,0.0019059986,0.0011097642,0.0011538414,0.00028521565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065960217,0.00019830694,0.0017247207,0.00016795346,0.00005530771,0.00016002459,0.0003197022,0.49776787,0.0156849,0.23335561,0.003464407,0.2464415],"study_design_scores_gemma":[0.000032771844,0.00009558591,0.00060757843,0.000017715558,0.000038948016,0.00010150594,0.000045888213,0.9130124,0.0023034106,0.08186564,0.001858245,0.000020406356],"about_ca_topic_score_codex":0.0021434329,"about_ca_topic_score_gemma":0.0029771025,"teacher_disagreement_score":0.0038992502,"about_ca_system_score_codex":0.001263738,"about_ca_system_score_gemma":0.0011326273,"threshold_uncertainty_score":0.013044298},"labels":[],"label_agreement":null},{"id":"W1997569066","doi":"10.1016/j.jda.2014.01.002","title":"Corrections to “Finding dominators via disjoint set union” [J. Discrete Algorithms 23 (2013) 2–20]","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Benbria (Canada); Université du Québec en Outaouais","funders":"","keywords":"Disjoint sets; Set (abstract data type); Algorithm; Computer science; Mathematics; Combinatorics","score_opus":0.019056176328588144,"score_gpt":0.30864762417329683,"score_spread":0.2895914478447087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997569066","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023078702,0.006440333,0.085287936,0.25120285,0.6208869,0.00011188023,0.002122802,0.0038923738,0.027746974],"genre_scores_gemma":[0.13542157,0.017738365,0.14487179,0.18092336,0.29985353,0.0005491388,0.0048313634,0.009349241,0.20646165],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9850209,0.0045284536,0.0011796167,0.0028956407,0.005640983,0.0007343304],"domain_scores_gemma":[0.9562827,0.016995309,0.0016706286,0.0069840094,0.016792879,0.0012744464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007419859,0.0032029368,0.003297457,0.004370946,0.006627126,0.005048587,0.009035851,0.0063460437,0.03192697],"category_scores_gemma":[0.10355441,0.0020916625,0.003471677,0.0059349076,0.0077936924,0.010926624,0.0043206248,0.017250262,0.0148058785],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120073324,0.000030747433,0.00014666739,0.0002183121,0.000066242465,0.00014310623,0.00015336141,0.00085540814,0.00029698398,0.047881532,0.93594676,0.014140651],"study_design_scores_gemma":[0.00015915524,0.00005218273,0.00088682555,0.0003081553,0.00017516762,0.0006143734,0.00018548136,0.009390872,0.002040838,0.2711662,0.71476585,0.0002549124],"about_ca_topic_score_codex":0.025437683,"about_ca_topic_score_gemma":0.022888279,"teacher_disagreement_score":0.03192697,"about_ca_system_score_codex":0.005895203,"about_ca_system_score_gemma":0.00495819,"threshold_uncertainty_score":0.10680634},"labels":[],"label_agreement":null},{"id":"W1997658699","doi":"10.1016/j.disc.2006.10.011","title":"The structure of well-covered graphs with no cycles of length 4","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Discrete mathematics; Equivalence relation; Graph; Vector space; Independent set","score_opus":0.010903874820202587,"score_gpt":0.2742881681302803,"score_spread":0.2633842933100777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997658699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95864403,0.0005572725,0.020545103,0.0010008622,0.000037234113,0.000032677235,0.00084349676,0.00017873854,0.018160533],"genre_scores_gemma":[0.9782113,0.0005204754,0.010087072,0.0002590189,0.00010927521,0.00007098939,0.0014586608,0.000109668385,0.009173559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958163,0.00008938682,0.000018898509,0.00010371476,0.00010707715,0.0000992465],"domain_scores_gemma":[0.9970059,0.0012521506,0.000648396,0.00031262104,0.00031259182,0.00046843183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033763915,0.0005016826,0.0006298603,0.0023062814,0.0016275132,0.002724164,0.0012443447,0.0013296454,0.004946335],"category_scores_gemma":[0.0025635678,0.0009330169,0.00047956823,0.0016136381,0.0015667984,0.004278489,0.0011904264,0.0010587928,0.0006267742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004781246,0.00008888958,0.0040264814,0.00018771982,0.00005160755,0.00047977697,0.001685965,0.006722602,0.013635131,0.9521812,0.006441339,0.014021117],"study_design_scores_gemma":[0.000060938637,0.00007288158,0.0035924874,0.000039377148,0.000046412846,0.000496148,0.000528136,0.021634711,0.0034031237,0.96379286,0.006297392,0.00003562148],"about_ca_topic_score_codex":0.0009647875,"about_ca_topic_score_gemma":0.0011378748,"teacher_disagreement_score":0.004946335,"about_ca_system_score_codex":0.000833977,"about_ca_system_score_gemma":0.000502574,"threshold_uncertainty_score":0.016547084},"labels":[],"label_agreement":null},{"id":"W1997694836","doi":"10.1016/j.ejc.2014.04.009","title":"Connected obstructions to full graph homomorphisms","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Homomorphism; Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.015460049152079302,"score_gpt":0.24380856122834915,"score_spread":0.22834851207626986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997694836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6808788,0.00086425146,0.14220218,0.004123705,0.000746667,0.00015691223,0.0005285996,0.0020350744,0.16846383],"genre_scores_gemma":[0.95658845,0.00047820882,0.010326036,0.00046708994,0.0003779658,0.00011241156,0.0004121905,0.00044066092,0.030797042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774843,0.00046715135,0.000097166936,0.00043113885,0.0006029882,0.00065308716],"domain_scores_gemma":[0.99388313,0.0029913525,0.0004864575,0.00059766317,0.000410419,0.0016309887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011522131,0.0009527693,0.0012396176,0.0042058113,0.0039375704,0.004873805,0.0018753578,0.002204641,0.016263196],"category_scores_gemma":[0.00669178,0.0010773009,0.0016169155,0.0024085175,0.004549136,0.009424191,0.009524775,0.0056324787,0.0015167848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005566729,0.00006261289,0.00026883677,0.000045077948,0.000009552413,0.00018603285,0.00060952845,0.0004638266,0.00059144234,0.9932594,0.0013337516,0.0031143604],"study_design_scores_gemma":[0.00003073184,0.000015749669,0.00030178693,0.000012787039,0.00001821173,0.0001882665,0.00020594354,0.0023458619,0.00050398824,0.99345446,0.0029043085,0.000017838309],"about_ca_topic_score_codex":0.0010885649,"about_ca_topic_score_gemma":0.0009744155,"teacher_disagreement_score":0.016263196,"about_ca_system_score_codex":0.0014180379,"about_ca_system_score_gemma":0.0006740106,"threshold_uncertainty_score":0.05440581},"labels":[],"label_agreement":null},{"id":"W1998044937","doi":"10.1016/s0012-365x(00)00181-3","title":"The ultimate categorical matching in a graph","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Categorical variable; Factor-critical graph; Matching (statistics); Graph; Edge-transitive graph; Discrete mathematics; Graph power; Line graph; Statistics","score_opus":0.02454482641561275,"score_gpt":0.3128628851969006,"score_spread":0.28831805878128786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998044937","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44584763,0.0015725491,0.30733094,0.014265501,0.00095793186,0.00014365163,0.0011144483,0.0009509441,0.2278164],"genre_scores_gemma":[0.93950844,0.0004983083,0.030978631,0.0012340925,0.0004428653,0.000095686955,0.0005493444,0.00019304852,0.026499683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832445,0.0004962923,0.00009354556,0.00047181768,0.0003266565,0.00028714622],"domain_scores_gemma":[0.9976299,0.0009926996,0.00021791879,0.00038940247,0.00033598696,0.00043415927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013705877,0.0003998949,0.0010322998,0.0025860646,0.004056187,0.005157423,0.0018795666,0.0028411828,0.008630736],"category_scores_gemma":[0.0048654317,0.0006415506,0.0012026179,0.0026704092,0.005409088,0.012818239,0.0043765525,0.0039061606,0.0012210901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012881253,0.000007340895,0.00009005124,0.000011616806,0.0000018930106,0.000017027369,0.00010395987,0.00012826476,0.00014307386,0.99757916,0.0004280729,0.001476693],"study_design_scores_gemma":[0.000004713226,0.000004248315,0.000059335947,0.0000046315954,0.0000037771636,0.000032138636,0.000060364117,0.00061604904,0.00012880896,0.99761,0.0014716128,0.000004421623],"about_ca_topic_score_codex":0.00150597,"about_ca_topic_score_gemma":0.0013718349,"teacher_disagreement_score":0.008630736,"about_ca_system_score_codex":0.0017432028,"about_ca_system_score_gemma":0.0009872881,"threshold_uncertainty_score":0.028872669},"labels":[],"label_agreement":null},{"id":"W1998140754","doi":"10.1016/s0012-365x(99)00206-x","title":"Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Variable neighborhood search; Combinatorics; Variable (mathematics); Combinatorial optimization; Discrete mathematics; Metaheuristic; Mathematical optimization","score_opus":0.024019720620125168,"score_gpt":0.28211261587146697,"score_spread":0.2580928952513418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998140754","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47415972,0.0021446105,0.48986408,0.0025753703,0.00016956036,0.0000935097,0.0004796521,0.0004216674,0.030091805],"genre_scores_gemma":[0.9354504,0.0006907402,0.05086321,0.00027362313,0.0001526608,0.00008853346,0.0003218207,0.00012473532,0.012034373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942505,0.0002677588,0.000013640385,0.00011805451,0.000082858554,0.00009273905],"domain_scores_gemma":[0.9970023,0.0019794833,0.00030266287,0.00023192712,0.00021236521,0.00027113166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001005891,0.0004163746,0.0015873936,0.0011066092,0.0013711537,0.0017121118,0.0018503317,0.0020758368,0.0059142136],"category_scores_gemma":[0.0066949436,0.00049460656,0.0006620444,0.0009744796,0.0016293995,0.0027212882,0.0022455875,0.0016905796,0.00036778513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020837132,0.00009094322,0.0014253856,0.0001541068,0.00007880671,0.00014877474,0.00018482114,0.24263568,0.0012938051,0.72974175,0.006324615,0.01771299],"study_design_scores_gemma":[0.000042702333,0.000037512815,0.00030889956,0.000013917982,0.000014522434,0.00005644621,0.000048109658,0.70450133,0.00023317675,0.29367253,0.0010520954,0.000018721319],"about_ca_topic_score_codex":0.0028985334,"about_ca_topic_score_gemma":0.0033830132,"teacher_disagreement_score":0.0059142136,"about_ca_system_score_codex":0.0011567572,"about_ca_system_score_gemma":0.00084476155,"threshold_uncertainty_score":0.019784987},"labels":[],"label_agreement":null},{"id":"W1998427290","doi":"10.1016/s0304-3975(03)00221-4","title":"Generating and characterizing the perfect elimination orderings of a chordal graph","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Amortized analysis; Oracle; Initialization; Clique; Treewidth; Discrete mathematics; Constant (computer programming); Graph; Algorithm; Computer science; Data structure; Pathwidth; Line graph","score_opus":0.01231511195538729,"score_gpt":0.26704502216468384,"score_spread":0.25472991020929653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998427290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85259414,0.00011576902,0.12834273,0.0003235605,0.000034262794,0.00012394573,0.0011145849,0.0003183923,0.017032685],"genre_scores_gemma":[0.9499236,0.00009710379,0.042644132,0.00006236645,0.00003441359,0.000040332143,0.0018178393,0.00009304448,0.005287155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992982,0.00010940436,0.00004719526,0.00017055498,0.00020822909,0.00016641559],"domain_scores_gemma":[0.99594146,0.0020556408,0.0005736189,0.0006424368,0.00045133705,0.00033552936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052089896,0.0003287616,0.00037678028,0.001240256,0.0011255002,0.0022949893,0.00095371023,0.00047954242,0.0025214206],"category_scores_gemma":[0.0042817323,0.00038854085,0.00049173663,0.0011785412,0.0011271181,0.002076789,0.00079624954,0.0009002974,0.00037998578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051170675,0.00026797724,0.0143435635,0.0003036169,0.000046052992,0.0004976381,0.002186978,0.020534078,0.031171348,0.846962,0.0042701424,0.07890497],"study_design_scores_gemma":[0.00007255489,0.00013311394,0.003869799,0.000034060417,0.000045388108,0.00046664444,0.00087673584,0.050845712,0.017256742,0.91865325,0.007708212,0.00003768096],"about_ca_topic_score_codex":0.0021612379,"about_ca_topic_score_gemma":0.004173501,"teacher_disagreement_score":0.0025214206,"about_ca_system_score_codex":0.0008729309,"about_ca_system_score_gemma":0.0010870638,"threshold_uncertainty_score":0.008435011},"labels":[],"label_agreement":null},{"id":"W1999197342","doi":"10.4153/cjm-2011-084-9","title":"Uniquely <i>D</i>-colourable Digraphs with Large Girth","year":2011,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Digraph; Combinatorics; Mathematics; Vertex (graph theory); Girth (graph theory); Automorphism; Graph","score_opus":0.03200467889537613,"score_gpt":0.23513788894870047,"score_spread":0.20313321005332435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999197342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86660475,0.00054518814,0.1048662,0.00057025265,0.000082293824,0.00012019604,0.0007630868,0.00052512245,0.02592295],"genre_scores_gemma":[0.95746976,0.00024798376,0.03721727,0.00013865517,0.000016822498,0.000077677985,0.0005627721,0.000046057543,0.0042230375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994337,0.00009748786,0.000045901805,0.00021339006,0.0000766342,0.00013296815],"domain_scores_gemma":[0.99720925,0.0011734423,0.00032659082,0.00054710516,0.00021957868,0.0005240352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038424705,0.000356398,0.00056571065,0.00073405856,0.0010699084,0.0014865552,0.0005389043,0.00063348335,0.0022851056],"category_scores_gemma":[0.0019834596,0.00058909314,0.0005719714,0.00067819987,0.0010881226,0.0014051636,0.001340238,0.0010147309,0.00026062317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007364909,0.0002373035,0.019260822,0.00088439527,0.00018049827,0.0025460494,0.002255996,0.049706154,0.11285597,0.7290858,0.0064821616,0.075768396],"study_design_scores_gemma":[0.00021184408,0.00037283706,0.015091049,0.00021344615,0.0003455217,0.004407181,0.0013101744,0.09080076,0.063942425,0.7767622,0.046339076,0.00020356706],"about_ca_topic_score_codex":0.0013766098,"about_ca_topic_score_gemma":0.0026291735,"teacher_disagreement_score":0.0022851056,"about_ca_system_score_codex":0.0014281097,"about_ca_system_score_gemma":0.0006768071,"threshold_uncertainty_score":0.010361731},"labels":[],"label_agreement":null},{"id":"W1999565878","doi":"10.1016/j.disc.2008.04.023","title":"Achieving maximum chromatic index in multigraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Multigraph; Upper and lower bounds; Edge coloring; Bipartite graph; Multiplicity (mathematics); Discrete mathematics; Graph","score_opus":0.02820827059957298,"score_gpt":0.28811301385298915,"score_spread":0.25990474325341617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999565878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43263575,0.0015250097,0.44206458,0.0032554567,0.0002216613,0.00017693242,0.0012526558,0.0027062462,0.11616168],"genre_scores_gemma":[0.8567168,0.000704172,0.1304727,0.0006769535,0.00017269995,0.0001506527,0.00066071434,0.00063845114,0.009806828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987746,0.0002837764,0.000041934694,0.00028686036,0.0003046591,0.00030818506],"domain_scores_gemma":[0.99467576,0.0030120392,0.00037520519,0.0009778189,0.00031433481,0.0006449104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015394196,0.0013015821,0.0014179912,0.0018647113,0.0022464658,0.0036474369,0.0024162428,0.0014588187,0.006314224],"category_scores_gemma":[0.005580494,0.0008922925,0.0007747639,0.0026955134,0.0019210568,0.0055639194,0.0042237164,0.0027917097,0.0011607031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000955885,0.00029210077,0.0024516543,0.000610307,0.00010940447,0.00023370291,0.00083700934,0.074645266,0.03250319,0.79538226,0.018875625,0.07310359],"study_design_scores_gemma":[0.00007309247,0.00008943418,0.0006563027,0.000058622612,0.000051187126,0.00014837996,0.00016781516,0.10487893,0.009686816,0.87952983,0.004632769,0.000026851296],"about_ca_topic_score_codex":0.0010592903,"about_ca_topic_score_gemma":0.0033156876,"teacher_disagreement_score":0.006314224,"about_ca_system_score_codex":0.0029292223,"about_ca_system_score_gemma":0.0012248491,"threshold_uncertainty_score":0.021253109},"labels":[],"label_agreement":null},{"id":"W1999576733","doi":"10.1007/s00453-007-9045-2","title":"Maximum Induced Matchings for Chordal Graphs in Linear Time","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Indifference graph; Split graph; Maximal independent set; Treewidth; Discrete mathematics; Pathwidth; Bipartite graph; Time complexity; Cograph; Line graph; Graph; 1-planar graph","score_opus":0.017835605613190888,"score_gpt":0.3055982628954908,"score_spread":0.28776265728229994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999576733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3632899,0.0027111375,0.532885,0.008906701,0.000654566,0.0021628581,0.0107875345,0.011474109,0.06712819],"genre_scores_gemma":[0.5700659,0.0011961338,0.38479257,0.0013444736,0.00047796482,0.0010990412,0.013412253,0.0021591221,0.025452439],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959182,0.0007871222,0.00027250327,0.0012205921,0.0010077609,0.00079389807],"domain_scores_gemma":[0.98438764,0.010388967,0.0010396431,0.0023151007,0.00071723084,0.0011514402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022322906,0.002047895,0.0030045987,0.0020408265,0.0028774545,0.006519879,0.0056141824,0.0031487187,0.032708254],"category_scores_gemma":[0.016779982,0.0017888381,0.0028374768,0.0049527166,0.0023147683,0.018256497,0.005216811,0.004346763,0.005021857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00690388,0.0034383917,0.006492111,0.004570376,0.00083623553,0.00053102477,0.002120264,0.1049162,0.03227206,0.29176292,0.092602395,0.4535541],"study_design_scores_gemma":[0.0016122535,0.0004253087,0.0015347626,0.00015179304,0.0005179144,0.00048182003,0.0007611502,0.21244958,0.011704041,0.75562257,0.014650072,0.00008868172],"about_ca_topic_score_codex":0.0027434248,"about_ca_topic_score_gemma":0.008983204,"teacher_disagreement_score":0.032708254,"about_ca_system_score_codex":0.004846838,"about_ca_system_score_gemma":0.0043177945,"threshold_uncertainty_score":0.10942},"labels":[],"label_agreement":null},{"id":"W1999881617","doi":"10.1017/s0004972708000099","title":"OUTER AUTOMORPHISM GROUPS OF CERTAIN TREE PRODUCTS OF ABELIAN GROUPS","year":2008,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Abelian group; Tree (set theory); Automorphism; Non-abelian group; Rank of an abelian group; Inner automorphism; Elementary abelian group; Automorphism group; Pure mathematics; Combinatorics; Discrete mathematics","score_opus":0.03869099300674883,"score_gpt":0.2705307745244882,"score_spread":0.23183978151773937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999881617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96327066,0.00011624125,0.027684996,0.00006720712,0.000020032016,0.000015687318,0.000033648306,0.000093956645,0.008697666],"genre_scores_gemma":[0.99385273,0.00005748517,0.002961285,0.000020191357,0.000024381385,0.000010932018,0.00007237274,0.00002290533,0.0029777186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995809,0.000084246465,0.000023655066,0.00007852933,0.00013350863,0.00009919249],"domain_scores_gemma":[0.9988036,0.00040832855,0.0002670531,0.0001324495,0.00014901841,0.00023944903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605256,0.00026021694,0.00032648246,0.0007104635,0.0006569498,0.0012527771,0.00035346538,0.00034521255,0.003108649],"category_scores_gemma":[0.0014398805,0.00019285738,0.00039405123,0.00035907363,0.0014053516,0.0022214898,0.0014282315,0.00060154457,0.00038787787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024123525,0.000068251626,0.004368196,0.000059503902,0.00002605599,0.0009202216,0.0022141498,0.0018644799,0.026066102,0.95322144,0.00038326078,0.010567129],"study_design_scores_gemma":[0.000052770076,0.0004103274,0.0044977353,0.000026787444,0.000055028257,0.0012381022,0.0012486437,0.009710157,0.030125663,0.9391007,0.013498612,0.000035573667],"about_ca_topic_score_codex":0.000182896,"about_ca_topic_score_gemma":0.00014714175,"teacher_disagreement_score":0.003108649,"about_ca_system_score_codex":0.00023857626,"about_ca_system_score_gemma":0.0001728436,"threshold_uncertainty_score":0.010399461},"labels":[],"label_agreement":null},{"id":"W2000105603","doi":"10.1007/s00373-010-0940-y","title":"König–Egerváry Graphs are Non-Edmonds","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Combinatorics; Mathematics; Mathematical proof; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.01007385019446178,"score_gpt":0.24956467204907634,"score_spread":0.23949082185461457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000105603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5766516,0.0012646687,0.15784322,0.0025232097,0.00088582025,0.00016226446,0.0010733866,0.0009312507,0.25866464],"genre_scores_gemma":[0.87517095,0.00080928986,0.045995496,0.00074696686,0.00017305872,0.00013452643,0.0008061686,0.00027896787,0.07588458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993543,0.00012141956,0.000046986243,0.00020717824,0.000106611136,0.0001635029],"domain_scores_gemma":[0.9978656,0.00059513515,0.00030369463,0.00055653596,0.00042402098,0.0002549519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005251064,0.0009004458,0.0010365058,0.0017871489,0.0033097318,0.003228236,0.0015126135,0.0017253277,0.009978699],"category_scores_gemma":[0.0023490475,0.0007059624,0.0009278521,0.0017216392,0.002793395,0.00535517,0.0020917829,0.0031350637,0.0019009047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059778307,0.000018078732,0.00041832362,0.00004655868,0.000015352896,0.0002480513,0.00020660636,0.00036332474,0.0012094908,0.98795694,0.0020037661,0.007453749],"study_design_scores_gemma":[0.000015173617,0.000011680685,0.00039176212,0.000023771718,0.000019663854,0.00040524593,0.00026163744,0.0014733475,0.0011991558,0.9862412,0.009942459,0.00001491585],"about_ca_topic_score_codex":0.0011305345,"about_ca_topic_score_gemma":0.0018383388,"teacher_disagreement_score":0.009978699,"about_ca_system_score_codex":0.00087511534,"about_ca_system_score_gemma":0.0005852947,"threshold_uncertainty_score":0.033382118},"labels":[],"label_agreement":null},{"id":"W2000356104","doi":"10.1016/j.aml.2007.02.004","title":"Maximum fractional factors in graphs","year":2007,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.021361806272424247,"score_gpt":0.27780491159254783,"score_spread":0.2564431053201236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000356104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5255507,0.0047574113,0.21890123,0.0058389446,0.0006685798,0.0001171652,0.00064811175,0.0010957256,0.24242212],"genre_scores_gemma":[0.9411383,0.0011941643,0.03297872,0.00045425803,0.00041146742,0.00009361592,0.00029206014,0.00018909025,0.023248203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917597,0.00021097409,0.000037544025,0.00020445912,0.00017944543,0.00019157892],"domain_scores_gemma":[0.99735224,0.0015679123,0.00022807636,0.00028034375,0.00022357753,0.00034800335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010039347,0.00084391714,0.0011594003,0.002627617,0.0030709812,0.0042857206,0.00092370063,0.0013490244,0.010131665],"category_scores_gemma":[0.0056253634,0.0006870597,0.0010326402,0.0024939373,0.0032377432,0.0049757874,0.001830284,0.002296845,0.0010274692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117690994,0.000023640014,0.00025368168,0.00007179077,0.000011565356,0.000054363092,0.0003141256,0.0013837044,0.0013114087,0.98402065,0.0020585747,0.010378722],"study_design_scores_gemma":[0.0000149203925,0.000009504513,0.00012663068,0.00001444838,0.000011185967,0.00007298517,0.00007299741,0.0020168314,0.0005535869,0.9936022,0.0034978546,0.000006879668],"about_ca_topic_score_codex":0.0013057317,"about_ca_topic_score_gemma":0.0020391664,"teacher_disagreement_score":0.010131665,"about_ca_system_score_codex":0.001818883,"about_ca_system_score_gemma":0.0006587489,"threshold_uncertainty_score":0.033893764},"labels":[],"label_agreement":null},{"id":"W2000440641","doi":"10.1016/j.disc.2003.10.024","title":"Absorbing sets in arc-coloured tournaments","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Université de Montréal","funders":"","keywords":"Tournament; Mathematics; Vertex (graph theory); Monochromatic color; Combinatorics; Arc (geometry); Path (computing); Section (typography); Discrete mathematics; Graph; Geometry; Computer science","score_opus":0.027925092144595185,"score_gpt":0.3189830667795664,"score_spread":0.2910579746349712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000440641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.725018,0.00064485875,0.21481988,0.0011872333,0.00020884267,0.00012393619,0.00049043226,0.00053278706,0.056974005],"genre_scores_gemma":[0.9612313,0.00040223432,0.021680737,0.00025977707,0.00016565905,0.00019590888,0.00062004273,0.00015361278,0.015290618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974137,0.000760931,0.0001685856,0.00047416013,0.0005619868,0.0006206112],"domain_scores_gemma":[0.9851864,0.010104545,0.0012780793,0.00082017074,0.00078648695,0.0018242231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002340972,0.0009015271,0.0019536882,0.0026961595,0.0042364225,0.010731755,0.0029910423,0.0026135524,0.011243109],"category_scores_gemma":[0.010576804,0.0017853072,0.001938443,0.0031192757,0.0038118132,0.0052987626,0.003164876,0.0037783182,0.00097417383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004058385,0.00019876524,0.001537726,0.000113414055,0.000085585176,0.0003083993,0.00090897013,0.012875487,0.002607506,0.97007465,0.0026565674,0.00822704],"study_design_scores_gemma":[0.0001451085,0.000054519838,0.0006189186,0.000027828833,0.000063317624,0.00018316077,0.00019566788,0.042839352,0.0007891644,0.95321643,0.0018411016,0.000025404737],"about_ca_topic_score_codex":0.0020513837,"about_ca_topic_score_gemma":0.0021806601,"teacher_disagreement_score":0.011243109,"about_ca_system_score_codex":0.0021663865,"about_ca_system_score_gemma":0.00089451426,"threshold_uncertainty_score":0.03761196},"labels":[],"label_agreement":null},{"id":"W2000945011","doi":"10.1016/j.jcss.2007.01.003","title":"Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Treewidth; Bounded function; Combinatorics; Mathematics; Induced subgraph isomorphism problem; Isomorphism (crystallography); Discrete mathematics; Subgraph isomorphism problem; Graph; Pathwidth; Line graph; Chemistry","score_opus":0.020491964852345043,"score_gpt":0.29002053605459854,"score_spread":0.2695285712022535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000945011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8342232,0.0012124794,0.14832939,0.0028965815,0.00005921538,0.000047019614,0.00060024776,0.00065788097,0.01197405],"genre_scores_gemma":[0.98668355,0.00030950416,0.010063555,0.0001970684,0.000065766275,0.000046799054,0.00040213874,0.00008537599,0.002146215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884367,0.0003120771,0.000048198206,0.000280448,0.0002514121,0.00026421208],"domain_scores_gemma":[0.9771149,0.014076579,0.003409563,0.0029173887,0.00094192824,0.0015395448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001335811,0.0004564684,0.0011811312,0.0016941266,0.0016149215,0.0024149215,0.0022120608,0.001585045,0.005310069],"category_scores_gemma":[0.015740907,0.00065292534,0.0005592134,0.0034359414,0.0032851507,0.009846379,0.0024404817,0.0023449678,0.0003532892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068971445,0.00027752185,0.012348228,0.00023746758,0.000078629535,0.0008025469,0.0014447423,0.06647235,0.0059184595,0.8732298,0.005127444,0.033372976],"study_design_scores_gemma":[0.000049935963,0.00004196372,0.001764941,0.000016790926,0.000025177742,0.0005754491,0.00036174234,0.04176764,0.0009247343,0.9532379,0.0012142457,0.000019520583],"about_ca_topic_score_codex":0.0024850103,"about_ca_topic_score_gemma":0.0024613803,"teacher_disagreement_score":0.005310069,"about_ca_system_score_codex":0.0018570474,"about_ca_system_score_gemma":0.0010805323,"threshold_uncertainty_score":0.017763913},"labels":[],"label_agreement":null},{"id":"W2001146041","doi":"10.1016/j.jda.2013.08.002","title":"Acyclic coloring with few division vertices","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Wheel graph; Subdivision; Path graph; Complete coloring; Discrete mathematics; Graph; Graph power; Line graph","score_opus":0.01441011631649932,"score_gpt":0.27871174020359285,"score_spread":0.26430162388709355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001146041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37623456,0.0006020745,0.47156513,0.0032689928,0.00067229546,0.00048463847,0.0025791477,0.0022410075,0.14235213],"genre_scores_gemma":[0.6899803,0.00047343943,0.25547883,0.00095683377,0.00021265578,0.00041429026,0.0021125488,0.00062030094,0.049750794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990349,0.00031755673,0.000043289176,0.00023414497,0.00014763126,0.00022250667],"domain_scores_gemma":[0.99496067,0.0020717445,0.0002927521,0.0013822501,0.00048666666,0.00080594147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066801923,0.0006165542,0.0007246393,0.0008296596,0.0024684668,0.0022061467,0.0019215259,0.0009757162,0.019273436],"category_scores_gemma":[0.0040191785,0.00067463913,0.00054894394,0.0015599821,0.0010543796,0.0028417057,0.0019016803,0.0019508564,0.0028721346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001385681,0.0006151773,0.0031526529,0.00053957367,0.000086312524,0.0005544487,0.00054219953,0.029282559,0.019400142,0.776055,0.037448883,0.13093741],"study_design_scores_gemma":[0.00024086316,0.00012483631,0.0010668995,0.000060022,0.00007186633,0.00051393453,0.00032660377,0.08267267,0.00953932,0.8757714,0.029573422,0.000038137863],"about_ca_topic_score_codex":0.001991882,"about_ca_topic_score_gemma":0.0048731277,"teacher_disagreement_score":0.019273436,"about_ca_system_score_codex":0.0012777123,"about_ca_system_score_gemma":0.0014369246,"threshold_uncertainty_score":0.06447607},"labels":[],"label_agreement":null},{"id":"W2001490112","doi":"10.1007/s10479-010-0813-z","title":"Using size for bounding expressions of graph invariants","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Bounding overwatch; Vertex (graph theory); Graph; Theory of computation; Upper and lower bounds; Discrete mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.41827483331012116,"score_gpt":0.5393114654582573,"score_spread":0.12103663214813609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001490112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047388397,0.00069120986,0.9284413,0.0019129687,0.00037040832,0.00013685948,0.00044206053,0.003275906,0.017340973],"genre_scores_gemma":[0.6038042,0.00096859114,0.3734495,0.0012524965,0.0012053346,0.00058134453,0.0011290365,0.004019737,0.01358981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9846288,0.0047455905,0.0009485051,0.0021757379,0.005112728,0.002388685],"domain_scores_gemma":[0.92533755,0.05490307,0.0033208393,0.01165543,0.0034910163,0.0012920531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010270313,0.0021533186,0.0025051225,0.004427638,0.0018752374,0.005652477,0.0047113383,0.0023372977,0.0092278365],"category_scores_gemma":[0.06294374,0.001993329,0.0035735911,0.0041597583,0.0068881675,0.026862867,0.010734185,0.0059589725,0.001456683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050487777,0.00009654793,0.0026964447,0.00022584893,0.00006760049,0.00013171679,0.00059744186,0.04659582,0.0053916527,0.85703474,0.005415017,0.08124229],"study_design_scores_gemma":[0.000036796286,0.000092771945,0.0003547996,0.00007735038,0.000106883585,0.00007887349,0.000099930476,0.17691858,0.0078016995,0.80851585,0.005856701,0.000059719656],"about_ca_topic_score_codex":0.0027116,"about_ca_topic_score_gemma":0.0024968858,"teacher_disagreement_score":0.010270313,"about_ca_system_score_codex":0.004484502,"about_ca_system_score_gemma":0.0031589423,"threshold_uncertainty_score":0.05431527},"labels":[],"label_agreement":null},{"id":"W2001998099","doi":"10.7151/dmgt.1377","title":"Couterexample to a conjecture on the structure of bipartite partionable graphs","year":2007,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Cartesian product; Conjecture; Disjoint sets; Partition (number theory); Counterexample; Discrete mathematics; Vertex (graph theory); Graph; Edge-transitive graph; Graph power; Line graph","score_opus":0.021057523586209024,"score_gpt":0.28829805335352093,"score_spread":0.2672405297673119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001998099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7968459,0.00084246765,0.14328139,0.008364063,0.0001773623,0.00007602598,0.0008591223,0.0005268766,0.04902686],"genre_scores_gemma":[0.96782607,0.000568997,0.02118454,0.000802987,0.00019858686,0.000053133677,0.00085167016,0.000069347574,0.008444825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.00020812002,0.000023979575,0.00024868522,0.00014800641,0.00013039193],"domain_scores_gemma":[0.9937748,0.0036706615,0.0005264907,0.001137856,0.00046923384,0.00042101063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011071402,0.00034376048,0.00045096406,0.0010744225,0.0020951,0.0021107942,0.0011066245,0.0015768823,0.007097662],"category_scores_gemma":[0.0055958945,0.00059142703,0.0006410779,0.0019146602,0.0046566743,0.0046318015,0.0016315418,0.0020958888,0.00062242063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019056113,0.00006500139,0.002983578,0.00012648175,0.000024101304,0.00029602495,0.0011439034,0.0076615633,0.002685885,0.9698167,0.005342266,0.009663908],"study_design_scores_gemma":[0.000048740076,0.00005643916,0.002155188,0.00003634643,0.000020138385,0.00030102424,0.0005097312,0.02177044,0.0015012213,0.96672374,0.006859459,0.000017429033],"about_ca_topic_score_codex":0.002366618,"about_ca_topic_score_gemma":0.0025001168,"teacher_disagreement_score":0.007097662,"about_ca_system_score_codex":0.0012888752,"about_ca_system_score_gemma":0.0005621893,"threshold_uncertainty_score":0.023744047},"labels":[],"label_agreement":null},{"id":"W2002026379","doi":"10.1006/jctb.2002.2112","title":"The Quadrangulation Conjecture for Orientable Surfaces","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bijection, injection and surjection; Bijection; Combinatorics; Mathematics; Conjecture; Bipartite graph; Planar; Integer (computer science); Genus; Graph","score_opus":0.016320060838556773,"score_gpt":0.26806094596182506,"score_spread":0.2517408851232683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002026379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7235877,0.0025281643,0.035693314,0.012112138,0.0009361235,0.00005461165,0.0007322947,0.00047187344,0.22388367],"genre_scores_gemma":[0.9732676,0.001128921,0.005685341,0.001112873,0.00044415623,0.000028873545,0.0008755548,0.00011235771,0.017344387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993734,0.00012710397,0.000027765911,0.00014831884,0.00015808,0.00016541808],"domain_scores_gemma":[0.99822253,0.00095359155,0.00017328886,0.00032945062,0.00012885548,0.00019223374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005860505,0.0007437188,0.0010787746,0.0009967923,0.0018561417,0.004465227,0.0012813788,0.0021873603,0.014280276],"category_scores_gemma":[0.0034225918,0.00062035315,0.000676039,0.0012518694,0.003108893,0.0065645142,0.0026105908,0.0040824977,0.0020826487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020631714,0.00009090459,0.0016338979,0.000143138,0.000021970567,0.00033234258,0.00034817797,0.0034678716,0.0013845172,0.9613609,0.011697455,0.019312559],"study_design_scores_gemma":[0.000024766925,0.000012503217,0.00040671986,0.000017094515,0.000008104511,0.00013221006,0.00017321731,0.003585997,0.0003176452,0.9906026,0.0047101406,0.000008899315],"about_ca_topic_score_codex":0.0016484328,"about_ca_topic_score_gemma":0.0016517785,"teacher_disagreement_score":0.014280276,"about_ca_system_score_codex":0.0009419427,"about_ca_system_score_gemma":0.00037808513,"threshold_uncertainty_score":0.047772348},"labels":[],"label_agreement":null},{"id":"W2003347187","doi":"10.1155/2008/597408","title":"Bipartite Toughness and <i>k</i>‐Factors in Bipartite Graphs","year":2008,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Algorithm; Bipartite graph; Artificial intelligence; Computer science; Mathematics; Graph; Combinatorics","score_opus":0.04947404051399971,"score_gpt":0.33014125648272574,"score_spread":0.280667215968726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003347187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70145494,0.00058572704,0.23984213,0.00090817333,0.00025328202,0.00009122697,0.0005373155,0.0006380369,0.055689003],"genre_scores_gemma":[0.97845614,0.00020128279,0.015461997,0.00017513639,0.00013429325,0.00007770429,0.0002903762,0.00012411381,0.0050789835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896824,0.0001296122,0.00006383062,0.00025961272,0.0001961711,0.00038261505],"domain_scores_gemma":[0.99607795,0.0010444655,0.00093543803,0.00039316143,0.00039346018,0.0011554103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007883628,0.00062091684,0.0005771495,0.0021151025,0.0014675034,0.0023957028,0.0009004836,0.00096442585,0.0063241557],"category_scores_gemma":[0.003283988,0.00045266526,0.0010499781,0.0010786996,0.004423852,0.0030541571,0.0018122791,0.001782373,0.0007494425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013680966,0.00005126322,0.0017753748,0.000073939096,0.000022650222,0.00023187259,0.0005589334,0.003998914,0.0064358828,0.9768996,0.0018570188,0.007957724],"study_design_scores_gemma":[0.000032505774,0.00008139245,0.0022468793,0.000045485707,0.000025374015,0.00048696855,0.00045392365,0.021688938,0.0039331797,0.96554416,0.0053910757,0.00007015203],"about_ca_topic_score_codex":0.0020252727,"about_ca_topic_score_gemma":0.0012777008,"teacher_disagreement_score":0.0063241557,"about_ca_system_score_codex":0.0010616336,"about_ca_system_score_gemma":0.00057071814,"threshold_uncertainty_score":0.02115637},"labels":[],"label_agreement":null},{"id":"W200335736","doi":"","title":"A family of chromatically unique 5-bridge graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bridge (graph theory); Biology; Anatomy","score_opus":0.026595281798719724,"score_gpt":0.27698040310182404,"score_spread":0.2503851213031043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W200335736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56762284,0.0024277074,0.10586509,0.0025890733,0.00051132694,0.00014410897,0.0028261472,0.0010163453,0.31699738],"genre_scores_gemma":[0.9226057,0.0008161431,0.030765582,0.0006057188,0.00007468993,0.000104996325,0.0025544858,0.00016100104,0.042311605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999706,0.000044571843,0.000010077709,0.00009921483,0.000066797664,0.000073226714],"domain_scores_gemma":[0.99929047,0.00024553356,0.00009839178,0.00010249779,0.00010765736,0.00015536227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002765344,0.00038863384,0.00027598077,0.0011342539,0.0017250855,0.001161909,0.0008724195,0.00089632627,0.015344707],"category_scores_gemma":[0.0012683244,0.00036034486,0.00043332737,0.00087163475,0.00072741415,0.0014337711,0.0012753687,0.0012426339,0.0017541568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015400216,0.00006518406,0.0020934616,0.00015659077,0.000035516998,0.0010670985,0.00065248273,0.0017455025,0.007905911,0.92938244,0.01964272,0.037098996],"study_design_scores_gemma":[0.000087765045,0.00008998267,0.005678601,0.0001446253,0.00006312815,0.0046024267,0.0008576848,0.011341384,0.005290813,0.8398931,0.1318939,0.00005649346],"about_ca_topic_score_codex":0.0009708789,"about_ca_topic_score_gemma":0.001811816,"teacher_disagreement_score":0.015344707,"about_ca_system_score_codex":0.0007341215,"about_ca_system_score_gemma":0.00043812368,"threshold_uncertainty_score":0.05133319},"labels":[],"label_agreement":null},{"id":"W2004476852","doi":"10.1016/j.dam.2012.03.019","title":"Hardness results on the gapped consecutive-ones property problem","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Logical matrix; Time complexity; Algebraic number; Binary number; Integer (computer science); Polynomial; Discrete mathematics; Computational complexity theory; Algebraic combinatorics; Computer science; Algorithm; Arithmetic","score_opus":0.048037758935888325,"score_gpt":0.2913822552962249,"score_spread":0.2433444963603366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004476852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26027992,0.003266949,0.5446147,0.024210675,0.0018146989,0.0006347306,0.0077480227,0.0022412862,0.15518907],"genre_scores_gemma":[0.837886,0.003014152,0.11616235,0.003952953,0.002064121,0.00064088084,0.007938711,0.00094782736,0.027393043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704236,0.0006553611,0.00015309814,0.0009241716,0.0007032554,0.000521758],"domain_scores_gemma":[0.9826738,0.012973223,0.0008130976,0.002077284,0.0006591859,0.0008033366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018025596,0.0018063509,0.0025137318,0.0011502069,0.0026064608,0.004526955,0.00554908,0.0035307053,0.020356815],"category_scores_gemma":[0.014134621,0.0010435088,0.002676009,0.0029079863,0.0032210187,0.016691128,0.005107971,0.008732852,0.002253885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002035227,0.00087968714,0.0022108871,0.0020648495,0.00032910908,0.0010961524,0.0008872929,0.070951596,0.0069564665,0.74970925,0.07619767,0.08668176],"study_design_scores_gemma":[0.00027551423,0.00010805253,0.0005503271,0.00007540635,0.00008787826,0.00041151338,0.00022367002,0.055935334,0.001809618,0.9325645,0.007918478,0.00003969318],"about_ca_topic_score_codex":0.0014016351,"about_ca_topic_score_gemma":0.0013160068,"teacher_disagreement_score":0.020356815,"about_ca_system_score_codex":0.0015452935,"about_ca_system_score_gemma":0.0019135781,"threshold_uncertainty_score":0.06810027},"labels":[],"label_agreement":null},{"id":"W2004536047","doi":"10.5555/365411.365806","title":"On universally easy classes for NP-complete problems","year":2001,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Time complexity; NP-complete; Computer science; P versus NP problem; Mathematics; Polynomial; Regular language; Discrete mathematics; Theoretical computer science; Combinatorics; Automaton","score_opus":0.05071034637469949,"score_gpt":0.3023161627498708,"score_spread":0.25160581637517127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004536047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11698808,0.005504546,0.7919891,0.014947159,0.00044335955,0.0004316847,0.0010973014,0.0013589968,0.06723985],"genre_scores_gemma":[0.74852103,0.0053908876,0.22043979,0.003526448,0.0036839924,0.0011369165,0.0027608885,0.0007417215,0.013798381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901462,0.0023808316,0.0007107112,0.0027175718,0.0025803382,0.0014643769],"domain_scores_gemma":[0.9578591,0.03485473,0.001981272,0.0026649563,0.0011918196,0.0014480911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065375827,0.001694654,0.002127688,0.003956982,0.004744254,0.009918581,0.0034399522,0.0034241602,0.009410855],"category_scores_gemma":[0.031983517,0.0016496393,0.0037511683,0.0035860655,0.01109318,0.028232025,0.011178469,0.012684265,0.0010673479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010817412,0.00015171514,0.0018665947,0.0003188229,0.00004100231,0.00023816321,0.00091524475,0.0061682686,0.0008864738,0.96256495,0.0035961352,0.023144402],"study_design_scores_gemma":[0.000028345488,0.0000383528,0.0006028687,0.00007307439,0.000029394756,0.00023368398,0.00034759808,0.011022351,0.0005035465,0.9806583,0.0064302585,0.00003222888],"about_ca_topic_score_codex":0.0019188996,"about_ca_topic_score_gemma":0.0012785048,"teacher_disagreement_score":0.009918581,"about_ca_system_score_codex":0.003800997,"about_ca_system_score_gemma":0.0015875613,"threshold_uncertainty_score":0.03457445},"labels":[],"label_agreement":null},{"id":"W2004911149","doi":"10.1016/j.disc.2006.03.036","title":"Building blocks for the variety of absolute retracts","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"","keywords":"Mathematics; Variety (cybernetics); Absolute (philosophy); Combinatorics; Discrete mathematics; Statistics","score_opus":0.023892377948431385,"score_gpt":0.30585175003877385,"score_spread":0.28195937209034244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004911149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30516985,0.0027347347,0.40173152,0.0032927357,0.00082066463,0.00012578203,0.0008301246,0.0018661671,0.2834285],"genre_scores_gemma":[0.9079424,0.0008248154,0.046049107,0.0006855328,0.00043460072,0.0001330631,0.0006325316,0.0005955504,0.0427025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989041,0.00020300012,0.00007904761,0.0002986622,0.00033368575,0.00018145572],"domain_scores_gemma":[0.9986519,0.0005643279,0.00014051089,0.00026496826,0.00017130919,0.00020698861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011484841,0.0007493197,0.0008644126,0.0029110129,0.0024544145,0.0038597705,0.0016117694,0.0013520586,0.017743172],"category_scores_gemma":[0.002875239,0.0007109159,0.0012596695,0.0015786603,0.0039017643,0.007976509,0.0036787956,0.0043628397,0.0029201547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011099096,0.000006346985,0.0000581789,0.000011720019,0.0000028850857,0.000033768545,0.0001215179,0.00015009767,0.00023970698,0.9957943,0.00045285735,0.0031176582],"study_design_scores_gemma":[0.000008823136,0.000013057159,0.00011577212,0.000010247177,0.000006387178,0.000084253326,0.00006646877,0.0010133517,0.0003815188,0.9937994,0.004491831,0.00000901154],"about_ca_topic_score_codex":0.0005892771,"about_ca_topic_score_gemma":0.00055660645,"teacher_disagreement_score":0.017743172,"about_ca_system_score_codex":0.0012180709,"about_ca_system_score_gemma":0.00043364946,"threshold_uncertainty_score":0.05935681},"labels":[],"label_agreement":null},{"id":"W2005110454","doi":"10.1016/j.dam.2011.04.006","title":"The<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-extended graft construction","year":2011,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Homomorphism; Digraph; Enumeration; Bipartite graph; Algorithm; Mathematics; Combinatorics; Computer science; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.022255737254391842,"score_gpt":0.25491510821285335,"score_spread":0.2326593709584615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005110454","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040855454,0.0003469022,0.34054607,0.004505695,0.0021820734,0.00032804633,0.055967957,0.066569,0.5254687],"genre_scores_gemma":[0.061713103,0.0014768586,0.23599851,0.0019423921,0.0010117503,0.0006902493,0.11097966,0.07437615,0.5118113],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995128,0.00008529755,0.000040708772,0.00008449891,0.00021262481,0.00006410865],"domain_scores_gemma":[0.99863476,0.0003194719,0.000056137687,0.0004180866,0.00041471672,0.00015670368],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007007025,0.0007999113,0.00064115116,0.0015305191,0.0010735722,0.0033899026,0.0018719202,0.0009500445,0.34730577],"category_scores_gemma":[0.0027327414,0.0007446042,0.0008624771,0.0023839648,0.0007296299,0.004084096,0.002179264,0.002749376,0.24410418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011374847,0.00005743453,0.0002449499,0.00026254612,0.0000095545265,0.00009132661,0.0002232786,0.0005509305,0.004858007,0.13742518,0.79228604,0.06387708],"study_design_scores_gemma":[0.00003492808,0.000015350639,0.0003484266,0.00003835858,0.000006597513,0.00014414851,0.000060248643,0.0021854443,0.0054701804,0.04081957,0.9508429,0.00003376614],"about_ca_topic_score_codex":0.0037450239,"about_ca_topic_score_gemma":0.0048725614,"teacher_disagreement_score":0.34730577,"about_ca_system_score_codex":0.0015815814,"about_ca_system_score_gemma":0.0013775082,"threshold_uncertainty_score":0.9309891},"labels":[],"label_agreement":null},{"id":"W2005291561","doi":"10.1016/j.disc.2008.05.050","title":"Secure domination critical graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Dominating set; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.029806303907930015,"score_gpt":0.3212700661383915,"score_spread":0.29146376223046144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005291561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45394817,0.0010015143,0.4109427,0.011315579,0.00051877345,0.00056189497,0.0015685998,0.002202552,0.11794022],"genre_scores_gemma":[0.9690782,0.00024832727,0.012121993,0.0005586517,0.00011907557,0.00012928428,0.00040102497,0.00014438627,0.017199095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981273,0.0003675031,0.00007658776,0.00035844013,0.0006505708,0.00041952447],"domain_scores_gemma":[0.9905376,0.0044032596,0.0006534991,0.0026949297,0.0010051631,0.00070568855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014715763,0.00066099904,0.00077631185,0.0010792048,0.0019211363,0.0029523463,0.0011852623,0.0011108821,0.010739006],"category_scores_gemma":[0.008580901,0.00045838306,0.00045720456,0.00095212506,0.0022670375,0.0059618317,0.0047808206,0.0032105658,0.0016328612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045958106,0.00006903561,0.000661384,0.00009538942,0.00002761489,0.000113609225,0.00036203032,0.0064057005,0.005490303,0.9503767,0.00919875,0.026739942],"study_design_scores_gemma":[0.00005838304,0.00003486513,0.0001377786,0.000022725435,0.00002222722,0.00009922939,0.000104211314,0.018413039,0.0047307787,0.96880496,0.0075579328,0.000013846704],"about_ca_topic_score_codex":0.0006734485,"about_ca_topic_score_gemma":0.0011203032,"teacher_disagreement_score":0.010739006,"about_ca_system_score_codex":0.0020260746,"about_ca_system_score_gemma":0.0016739283,"threshold_uncertainty_score":0.035925508},"labels":[],"label_agreement":null},{"id":"W2005353392","doi":"10.1016/j.comgeo.2008.11.004","title":"Not being (super)thin or solid is hard: A study of grid Hamiltonicity","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Shahrekord University of Medical Sciences; Academy of Finland; National Science Foundation","keywords":"Hamiltonian path; Combinatorics; Bipartite graph; Mathematics; Planar graph; Hamiltonian (control theory); Hamiltonian path problem; Grid; Discrete mathematics; Regular polygon; Square tiling; Graph; Mathematical optimization; Geometry","score_opus":0.060117465416775547,"score_gpt":0.336238186652695,"score_spread":0.27612072123591946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005353392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8567235,0.00041496524,0.090031594,0.0028110938,0.00011541277,0.000067397465,0.00021241912,0.00016186896,0.049461745],"genre_scores_gemma":[0.9831526,0.00021240447,0.010883347,0.00015534864,0.00003810967,0.00003740997,0.00010119252,0.00007578058,0.0053437985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966705,0.00010722733,0.000011455221,0.000051220293,0.000065573004,0.00009747045],"domain_scores_gemma":[0.99425876,0.0037214395,0.00055917853,0.00059082906,0.00028885127,0.00058094756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056547264,0.0002638655,0.0007132302,0.00066557736,0.0017070206,0.0014324022,0.0015220462,0.0011623275,0.007391803],"category_scores_gemma":[0.007298572,0.00048598897,0.00062300224,0.0009036724,0.0030530554,0.00250713,0.0018318815,0.001549118,0.00025424172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011187025,0.000040993848,0.0016837302,0.00006747048,0.000025715217,0.00027149406,0.0004902077,0.03732656,0.0006824497,0.950672,0.0029412115,0.0056862133],"study_design_scores_gemma":[0.00006268042,0.000034094257,0.0009407436,0.000021529428,0.000017282826,0.00014156348,0.0006245627,0.12486422,0.00031643332,0.8709207,0.0020419874,0.000014169753],"about_ca_topic_score_codex":0.006638553,"about_ca_topic_score_gemma":0.0063208095,"teacher_disagreement_score":0.007391803,"about_ca_system_score_codex":0.0008768331,"about_ca_system_score_gemma":0.0010638377,"threshold_uncertainty_score":0.02472806},"labels":[],"label_agreement":null},{"id":"W2005620597","doi":"10.1016/j.disc.2006.09.042","title":"Reachability problems in edge-colored digraphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Reachability; Tournament; Vertex (graph theory); Colored; Monochromatic color; Discrete mathematics; Arc (geometry); Graph; Geometry; Physics","score_opus":0.02504517896934749,"score_gpt":0.3048842009482493,"score_spread":0.2798390219789018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005620597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34810945,0.0016278053,0.6021798,0.004037122,0.00023332014,0.00044082192,0.0022234877,0.00084427686,0.040303938],"genre_scores_gemma":[0.82892036,0.0017457844,0.14236946,0.00076372846,0.000201324,0.0003133409,0.0028176662,0.00027333,0.022595033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820447,0.0005527616,0.000114972725,0.00049613795,0.00028156894,0.0003500917],"domain_scores_gemma":[0.986445,0.011420878,0.0005536516,0.00041020298,0.0005052642,0.00066504214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018531926,0.00133798,0.0016360757,0.001894164,0.0026117195,0.005143184,0.0030896477,0.0034064292,0.0073462436],"category_scores_gemma":[0.011431711,0.0015729511,0.0021677755,0.0032131227,0.0029624274,0.007696259,0.003214638,0.0037999952,0.00059695577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043004504,0.00032448303,0.0015417545,0.0007586165,0.00017857438,0.0007037094,0.0010152766,0.22247809,0.0027099825,0.73421806,0.006680819,0.028960677],"study_design_scores_gemma":[0.000098446246,0.00003409116,0.00026106279,0.00006231664,0.000070945716,0.00011290481,0.00029432526,0.15126926,0.0013774878,0.84439003,0.0020028322,0.00002621329],"about_ca_topic_score_codex":0.009384399,"about_ca_topic_score_gemma":0.00966273,"teacher_disagreement_score":0.009384399,"about_ca_system_score_codex":0.0036397683,"about_ca_system_score_gemma":0.0022486525,"threshold_uncertainty_score":0.026408494},"labels":[],"label_agreement":null},{"id":"W2005661925","doi":"10.1016/j.jctb.2015.02.004","title":"Projective geometries in exponentially dense matroids. II","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Rank (graph theory); Combinatorics; Graphic matroid; Mathematics; Integer (computer science); Constant (computer programming); Prime (order theory); Prime power; Projective plane; Matroid partitioning; Discrete mathematics; Computer science; Geometry","score_opus":0.023206630527263093,"score_gpt":0.28658820357473674,"score_spread":0.26338157304747367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005661925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5700492,0.009037418,0.09869093,0.008611471,0.0008414386,0.00010518418,0.001805449,0.00042168616,0.31043726],"genre_scores_gemma":[0.9586747,0.0022287758,0.010946017,0.00040343506,0.00096666854,0.00005917047,0.0008142628,0.000099974946,0.025806911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936134,0.00018400057,0.000026468011,0.00013799932,0.0001410932,0.00014913233],"domain_scores_gemma":[0.9977926,0.0011920262,0.00025435045,0.00022193896,0.0001924743,0.00034669897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004787917,0.0004943353,0.00060306786,0.0011886009,0.0012787118,0.0032502473,0.0007582252,0.00074881606,0.0111473985],"category_scores_gemma":[0.0031993035,0.00065305736,0.0005342392,0.0011612716,0.0027623563,0.0059039113,0.002377921,0.003211475,0.0014051502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041764604,0.000025676522,0.0009009715,0.00007694385,0.000007952016,0.00008852636,0.00026346272,0.0012849487,0.0006530018,0.9845955,0.0055400315,0.006521188],"study_design_scores_gemma":[0.000013607948,0.00002325823,0.0012916897,0.000031270996,0.000008488506,0.00031843528,0.00020872625,0.003168643,0.00037533784,0.9883067,0.00624447,0.000009332924],"about_ca_topic_score_codex":0.00085808337,"about_ca_topic_score_gemma":0.0009396367,"teacher_disagreement_score":0.0111473985,"about_ca_system_score_codex":0.0011254187,"about_ca_system_score_gemma":0.0003830025,"threshold_uncertainty_score":0.037291825},"labels":[],"label_agreement":null},{"id":"W2005947941","doi":"10.1007/s11083-010-9163-3","title":"Dualities and Dual Pairs in Heyting Algebras","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heyting algebra; Mathematics; Homomorphism; Dual (grammatical number); Core (optical fiber); Algebra over a field; Pure mathematics; Discrete mathematics; Combinatorics; Computer science; Linguistics","score_opus":0.016288944898138293,"score_gpt":0.2882060357094795,"score_spread":0.2719170908113412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005947941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6511936,0.0024411678,0.16208288,0.0038425915,0.0009049009,0.00013090769,0.00067266927,0.00036864082,0.17836253],"genre_scores_gemma":[0.9446641,0.00069892535,0.018576719,0.0005703864,0.00047476843,0.00007600063,0.00033211368,0.00012804482,0.034479007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988549,0.0003227945,0.000075960015,0.00023286408,0.00024223574,0.0002713517],"domain_scores_gemma":[0.9985676,0.00047398914,0.00018118658,0.00015913475,0.000251882,0.0003662304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014388758,0.0009154545,0.0010990812,0.0037289362,0.004018942,0.005678746,0.0011975933,0.0014908556,0.0096317325],"category_scores_gemma":[0.002293661,0.00086947466,0.0012739592,0.002910848,0.005506545,0.011343897,0.0027537188,0.004325836,0.0011013105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026412674,0.000018528353,0.00008790406,0.000011525217,0.000003831068,0.000031016727,0.00019564849,0.00010639172,0.0002111329,0.9978751,0.00028087216,0.0011515948],"study_design_scores_gemma":[0.000010774127,0.0000066644766,0.00005523378,0.0000052880982,0.000006261472,0.00004434478,0.00010349965,0.0004968782,0.00023135856,0.99804425,0.0009874711,0.000007930544],"about_ca_topic_score_codex":0.0014134194,"about_ca_topic_score_gemma":0.0015160152,"teacher_disagreement_score":0.0096317325,"about_ca_system_score_codex":0.0016963029,"about_ca_system_score_gemma":0.00080676255,"threshold_uncertainty_score":0.032221317},"labels":[],"label_agreement":null},{"id":"W2006186391","doi":"10.1016/j.tcs.2015.01.028","title":"Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Mathematics; Combinatorics; Injective function; Bijection; Treewidth; Homomorphism; Bounded function; Surjective function; Discrete mathematics; Algebra homomorphism; Graph; Tree-depth; 1-planar graph; Pathwidth; Chordal graph; Line graph","score_opus":0.04165431843452008,"score_gpt":0.29213325162119763,"score_spread":0.2504789331866776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006186391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6674292,0.0005214927,0.3144975,0.00077432767,0.000067013716,0.00009912744,0.00043340636,0.0008634724,0.015314522],"genre_scores_gemma":[0.948377,0.00028013482,0.04164994,0.0002601636,0.00010017753,0.0001725951,0.00040507762,0.00034634976,0.0084086545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871826,0.00038624034,0.000063371444,0.0003681379,0.00023551613,0.00022853015],"domain_scores_gemma":[0.990617,0.005240397,0.0011194695,0.0012365559,0.00049003673,0.0012965273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001122106,0.0005759798,0.00094996847,0.001595998,0.0016815596,0.0023975028,0.0020580834,0.0011516886,0.0063291825],"category_scores_gemma":[0.0076540657,0.00088662776,0.00065581605,0.0017778507,0.002016506,0.008713353,0.0033907355,0.0026990857,0.0007412017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033168547,0.00013966377,0.0011242541,0.00015451972,0.000032648728,0.000282897,0.0011506926,0.009493007,0.00964148,0.9573382,0.0013800255,0.018930824],"study_design_scores_gemma":[0.00003981552,0.000043873704,0.0005218117,0.000020026097,0.000021625185,0.00017603808,0.00028103427,0.025220364,0.0027244922,0.9692347,0.0016880253,0.000028184282],"about_ca_topic_score_codex":0.0011347564,"about_ca_topic_score_gemma":0.0014915862,"teacher_disagreement_score":0.0063291825,"about_ca_system_score_codex":0.001134203,"about_ca_system_score_gemma":0.0006215581,"threshold_uncertainty_score":0.021173239},"labels":[],"label_agreement":null},{"id":"W2006409610","doi":"10.1016/j.dam.2009.04.014","title":"Limited packings in graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Packing problems; Graph; Upper and lower bounds; Set packing; Simple graph; Discrete mathematics; Computer science","score_opus":0.01961147427158829,"score_gpt":0.2841082372443037,"score_spread":0.2644967629727154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006409610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7490939,0.002238124,0.13031153,0.0027975738,0.00030395552,0.00009489719,0.0006990217,0.0004985538,0.1139624],"genre_scores_gemma":[0.9487356,0.0011920838,0.025728932,0.00046005298,0.00038449132,0.0001500278,0.0008286496,0.00019031786,0.022329822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991179,0.00030641627,0.000057855057,0.00015643061,0.00025494854,0.00010639985],"domain_scores_gemma":[0.9951047,0.0028370728,0.0006417054,0.0005284368,0.00025114,0.0006370251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076354586,0.00062989513,0.0013901342,0.0026600144,0.0019261148,0.003517343,0.0014659809,0.0017228248,0.010593104],"category_scores_gemma":[0.006562344,0.0012336927,0.0009256966,0.002836917,0.0029156986,0.0060005174,0.0029314682,0.0029129288,0.0011250023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013305299,0.00006319827,0.0005886456,0.00011793735,0.000022120457,0.0001969857,0.0004427147,0.006511579,0.0012837305,0.97614384,0.003447657,0.011048606],"study_design_scores_gemma":[0.000015613174,0.000018427507,0.000359781,0.00002285014,0.000009077515,0.00017339484,0.00012705525,0.013646062,0.0003357746,0.98373127,0.0015534167,0.0000072383305],"about_ca_topic_score_codex":0.0006581406,"about_ca_topic_score_gemma":0.0007585627,"teacher_disagreement_score":0.010593104,"about_ca_system_score_codex":0.00091003353,"about_ca_system_score_gemma":0.00029983209,"threshold_uncertainty_score":0.035437524},"labels":[],"label_agreement":null},{"id":"W2006429817","doi":"10.1002/net.21490","title":"Shortest paths avoiding forbidden subpaths","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shortest path problem; Distance; K shortest path routing; Combinatorics; Yen's algorithm; Longest path problem; Euclidean shortest path; Constrained Shortest Path First; Shortest Path Faster Algorithm; Widest path problem; Path (computing); Mathematics; Discrete mathematics; Computer science; Graph; Dijkstra's algorithm; Computer network","score_opus":0.01678287490000113,"score_gpt":0.25743815220359384,"score_spread":0.2406552773035927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006429817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29106057,0.0003520849,0.7035205,0.0002758702,0.00004856269,0.000119774115,0.00027016416,0.00035664698,0.0039958474],"genre_scores_gemma":[0.70068175,0.00033847126,0.2931855,0.00008674918,0.000043683587,0.00019991749,0.00052874914,0.00018526692,0.004749924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925715,0.0001972626,0.000050544826,0.0002254813,0.00016361818,0.00010590353],"domain_scores_gemma":[0.9955069,0.0028613696,0.0005720556,0.00043837755,0.00038458518,0.0002367592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007935676,0.00052036246,0.00073919527,0.0009028212,0.00069320993,0.00089516223,0.0011203998,0.0008457865,0.0026172628],"category_scores_gemma":[0.006578774,0.00043965763,0.00072786555,0.0008087144,0.0009861487,0.0020572843,0.0014513534,0.0010265342,0.0002786198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039266035,0.00011388979,0.0036308207,0.00038050328,0.0001338269,0.0006397299,0.0004887427,0.70318216,0.009099549,0.1888394,0.0025964705,0.09050222],"study_design_scores_gemma":[0.000039764443,0.00007289992,0.0004192113,0.00002755272,0.000025984495,0.00016187534,0.00009962167,0.7235097,0.002867743,0.26947764,0.0032805903,0.000017322482],"about_ca_topic_score_codex":0.0016766103,"about_ca_topic_score_gemma":0.0014579903,"teacher_disagreement_score":0.0026172628,"about_ca_system_score_codex":0.0006793559,"about_ca_system_score_gemma":0.00076457387,"threshold_uncertainty_score":0.008755624},"labels":[],"label_agreement":null},{"id":"W2006528126","doi":"10.1016/j.disc.2007.11.062","title":"Factor-critical property in 3-dominating-critical graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Vertex (graph theory); Discrete mathematics; Conjecture; Neighbourhood (mathematics); Graph","score_opus":0.05002103674915585,"score_gpt":0.33888864272112684,"score_spread":0.288867605971971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006528126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86602265,0.00082528347,0.08096264,0.0014051739,0.000115711686,0.00014843937,0.00081648194,0.00031624857,0.049387377],"genre_scores_gemma":[0.9822029,0.00047270572,0.010791245,0.000269011,0.00008218531,0.00006596342,0.00056082837,0.0000900337,0.0054650824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961025,0.000055397893,0.000019649242,0.00012984885,0.000080229285,0.0001046413],"domain_scores_gemma":[0.99665654,0.001588943,0.0003987599,0.00024586264,0.00046091314,0.0006490666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005637731,0.00072388974,0.00082780025,0.0020417133,0.0022872037,0.0025632435,0.0010253789,0.0009311589,0.006782408],"category_scores_gemma":[0.0035560522,0.00059884146,0.00068734784,0.0015928122,0.002305111,0.0031443916,0.0013557367,0.001366645,0.000640173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005471634,0.000093799055,0.004559076,0.00033576612,0.00005818015,0.00073767174,0.0016658151,0.0070331017,0.018331084,0.9422962,0.006703357,0.017638795],"study_design_scores_gemma":[0.00011695328,0.00006411005,0.001888854,0.000054772678,0.000075111886,0.0007306249,0.000732881,0.01428153,0.008227055,0.9668549,0.0069395592,0.00003373179],"about_ca_topic_score_codex":0.0026008983,"about_ca_topic_score_gemma":0.002436496,"teacher_disagreement_score":0.006782408,"about_ca_system_score_codex":0.0013504454,"about_ca_system_score_gemma":0.00072092423,"threshold_uncertainty_score":0.022689402},"labels":[],"label_agreement":null},{"id":"W2006587062","doi":"10.1006/jctb.2001.2082","title":"Branch-Width and Well-Quasi-Ordering in Matroids and Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Bounded function; Combinatorics; Mathematics; Class (philosophy); Graphic matroid; Discrete mathematics; Tree (set theory); Computer science; Mathematical analysis","score_opus":0.010457935432773438,"score_gpt":0.24424879096954472,"score_spread":0.23379085553677129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006587062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79460114,0.004547735,0.16012399,0.0053791706,0.0002354747,0.00006848399,0.0009044652,0.00030571935,0.03383383],"genre_scores_gemma":[0.95273936,0.0024091431,0.034360033,0.0003991278,0.000643298,0.000094441566,0.00064377853,0.00013292219,0.008577941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988065,0.00042045058,0.00010310347,0.00025356282,0.00022556195,0.00019093855],"domain_scores_gemma":[0.98123986,0.012665428,0.0023674867,0.0010327406,0.0008835479,0.001810873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028094358,0.0010192591,0.0016122544,0.0032427993,0.0025417819,0.008045029,0.0023164635,0.0022587348,0.006433443],"category_scores_gemma":[0.011419539,0.0015960109,0.0010284455,0.0052124774,0.0054263845,0.019595087,0.0019373408,0.004855806,0.00059174304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001529174,0.000098306875,0.0022380624,0.000099582045,0.000018854644,0.00009318272,0.0006619357,0.0029229128,0.0012036227,0.98159814,0.0013472518,0.009565394],"study_design_scores_gemma":[0.000018510204,0.000015743704,0.00049682305,0.000014289341,0.000012194403,0.000077136225,0.00017779773,0.0057385894,0.00022291686,0.992585,0.0006315815,0.000009483037],"about_ca_topic_score_codex":0.0012781944,"about_ca_topic_score_gemma":0.002283999,"teacher_disagreement_score":0.008045029,"about_ca_system_score_codex":0.0017587686,"about_ca_system_score_gemma":0.00093202974,"threshold_uncertainty_score":0.021522045},"labels":[],"label_agreement":null},{"id":"W2006938312","doi":"10.1016/j.disc.2005.03.024","title":"Brian Alspach and his work","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Lethbridge","funders":"","keywords":"Mathematics; Work (physics); Discrete mathematics; Mathematical economics; Calculus (dental); Engineering; Medicine","score_opus":0.02155731934103933,"score_gpt":0.2930603300607516,"score_spread":0.2715030107197123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006938312","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00696951,0.029487371,0.05570668,0.37788236,0.055882335,0.0000557552,0.00048187788,0.0007602971,0.4727738],"genre_scores_gemma":[0.122735746,0.021822255,0.022875585,0.038827766,0.019452505,0.000073304334,0.00052292534,0.00090596545,0.77278394],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949064,0.0015176666,0.00010898225,0.0008031531,0.0023898324,0.00027391763],"domain_scores_gemma":[0.9905723,0.0030566128,0.00031776304,0.0010788246,0.0035185793,0.0014559557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024869803,0.00062512443,0.0005968204,0.0017403805,0.0033410583,0.0045970418,0.0011156528,0.0021187249,0.043427393],"category_scores_gemma":[0.014793773,0.00044210214,0.00030466352,0.0018852387,0.0033151805,0.0056977705,0.0025187295,0.0042854357,0.016370345],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003935,0.00003848379,0.00041082985,0.000092738206,0.0000146819375,0.00013605165,0.000618011,0.00034170385,0.00033706648,0.36273646,0.56636566,0.06886891],"study_design_scores_gemma":[0.000009131717,0.0000061306805,0.00014581153,0.0000691524,0.000007214117,0.00023781741,0.00036555235,0.00036246606,0.00078638725,0.15489441,0.8430882,0.000027685726],"about_ca_topic_score_codex":0.0031668819,"about_ca_topic_score_gemma":0.003945746,"teacher_disagreement_score":0.043427393,"about_ca_system_score_codex":0.0032910034,"about_ca_system_score_gemma":0.0016272638,"threshold_uncertainty_score":0.14527905},"labels":[],"label_agreement":null},{"id":"W2007560929","doi":"10.1016/j.dam.2008.01.026","title":"Polarity of chordal graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Indifference graph; Pathwidth; Cograph; Bipartite graph; Split graph; Interval graph; Discrete mathematics; Maximal independent set; Distance-hereditary graph; Strong perfect graph theorem; Treewidth; Modular decomposition; Graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.027902754545618,"score_gpt":0.27988077025463104,"score_spread":0.251978015709013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007560929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64461476,0.0007199217,0.05334927,0.0036754508,0.0007114132,0.00014442627,0.0010758009,0.00022648645,0.2954825],"genre_scores_gemma":[0.97586864,0.0005322589,0.0048170476,0.00035824455,0.0003407103,0.000058435377,0.0006884129,0.00008706622,0.017249094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961406,0.00008391247,0.000015622727,0.00006817671,0.000118637596,0.00009955439],"domain_scores_gemma":[0.9979814,0.0009425315,0.00021363769,0.000117990276,0.00038775767,0.00035662306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003264837,0.0003214451,0.00042161407,0.0013794433,0.0014222512,0.0035404358,0.00071974454,0.0007609265,0.008453153],"category_scores_gemma":[0.0032837945,0.00031301606,0.000316202,0.0008421081,0.0019384071,0.003392233,0.0011797644,0.0019517804,0.0010677914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014154734,0.000017121014,0.0005567502,0.00004990472,0.000004689221,0.00013254525,0.00030623455,0.0004644364,0.0024054707,0.9862882,0.0024486864,0.00718445],"study_design_scores_gemma":[0.000030321851,0.000017142927,0.0007934286,0.000014582407,0.000009674684,0.00017165153,0.00033143605,0.0023357957,0.0011214347,0.9889944,0.006168709,0.000011457745],"about_ca_topic_score_codex":0.00087655906,"about_ca_topic_score_gemma":0.00072611857,"teacher_disagreement_score":0.008453153,"about_ca_system_score_codex":0.0008588384,"about_ca_system_score_gemma":0.00047708536,"threshold_uncertainty_score":0.028278649},"labels":[],"label_agreement":null},{"id":"W2008238596","doi":"10.1145/1250790.1250847","title":"Interval completion with few edges","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Computation; Minification; Graph; Interval (graph theory); Mathematics; Algorithm; Discrete mathematics; NP-complete; Computer science; Time complexity; Mathematical optimization","score_opus":0.03496718699044837,"score_gpt":0.3128576553151562,"score_spread":0.2778904683247078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008238596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020526107,0.00021699535,0.9639945,0.00035777254,0.000086946726,0.00021042001,0.001039122,0.0063783834,0.0071897786],"genre_scores_gemma":[0.16463363,0.00016168378,0.8221948,0.00016010048,0.00009116797,0.00025324413,0.0041375067,0.0011383482,0.0072295163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987839,0.00020968422,0.00007386106,0.0004234205,0.00035678153,0.00015240093],"domain_scores_gemma":[0.9969715,0.00083605724,0.00019107039,0.0014404977,0.00033518553,0.00022568327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010800106,0.00079980347,0.0011688153,0.00075101573,0.000635223,0.0013401231,0.0017468443,0.00080783415,0.015644502],"category_scores_gemma":[0.004658054,0.0004815558,0.0012788153,0.001066795,0.0007334652,0.0026955314,0.0027844487,0.0021615587,0.0057100826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009414497,0.0005608956,0.0014533491,0.0007432282,0.00008102653,0.0002208524,0.00045405122,0.09015311,0.012557638,0.056613024,0.04183704,0.79438436],"study_design_scores_gemma":[0.0004069759,0.0004987036,0.0010187966,0.00007872853,0.000057814697,0.00045567338,0.0003703996,0.59316105,0.017723795,0.34721747,0.03891945,0.00009121658],"about_ca_topic_score_codex":0.0015072512,"about_ca_topic_score_gemma":0.0018043572,"teacher_disagreement_score":0.015644502,"about_ca_system_score_codex":0.00044696103,"about_ca_system_score_gemma":0.0010911869,"threshold_uncertainty_score":0.052336037},"labels":[],"label_agreement":null},{"id":"W2008773627","doi":"10.1016/j.jctb.2005.11.001","title":"Obstructions to branch-decomposition of matroids","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Net (polyhedron); Characterization (materials science); Class (philosophy); Minor (academic); Set (abstract data type); Pairwise comparison; Discrete mathematics; Computer science; Physics; Geometry","score_opus":0.009228262069560421,"score_gpt":0.29100298755742676,"score_spread":0.28177472548786636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008773627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7858309,0.000618477,0.062888354,0.0037305162,0.00038142328,0.00010476179,0.00045589157,0.0005222323,0.14546742],"genre_scores_gemma":[0.95182186,0.0005905347,0.014619194,0.00036920884,0.0004305651,0.00008473205,0.00066202885,0.0002526601,0.031169055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894446,0.000254005,0.000053778313,0.00012506515,0.00032653977,0.0002960793],"domain_scores_gemma":[0.9967686,0.0011971755,0.00043397603,0.0002980416,0.00023765188,0.0010646599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095661654,0.0007750002,0.001372253,0.003163942,0.0033606885,0.0057105212,0.0014892479,0.002296958,0.0137454625],"category_scores_gemma":[0.0043071928,0.001073386,0.0013248533,0.0022007748,0.003311343,0.0049215974,0.0046655126,0.0058427523,0.0016193282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053409094,0.00005772631,0.00037658747,0.000025648676,0.000007545862,0.00011546457,0.0002795574,0.0009148052,0.00070887466,0.99327046,0.0018106358,0.0023791485],"study_design_scores_gemma":[0.000025859572,0.000010562283,0.0002689964,0.000011106779,0.0000071445284,0.00009314912,0.00012512955,0.0044528265,0.00023406479,0.99286383,0.001899618,0.000007731601],"about_ca_topic_score_codex":0.0012562446,"about_ca_topic_score_gemma":0.0018207817,"teacher_disagreement_score":0.0137454625,"about_ca_system_score_codex":0.0016772848,"about_ca_system_score_gemma":0.0006991915,"threshold_uncertainty_score":0.045983136},"labels":[],"label_agreement":null},{"id":"W2008914847","doi":"10.1016/s0166-218x(99)00163-8","title":"Pancyclicity and NP-completeness in planar graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Completeness (order theory); Combinatorics; NP-complete; Planar; Planar graph; Discrete mathematics; Graph; Time complexity; Computer science","score_opus":0.018394195643940105,"score_gpt":0.2686029003853998,"score_spread":0.2502087047414597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008914847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6702852,0.004962166,0.18437283,0.022771863,0.0004307103,0.0002879383,0.005047226,0.0008636931,0.11097832],"genre_scores_gemma":[0.9601173,0.0024838874,0.022931298,0.0011686127,0.00068607344,0.00027036096,0.002958929,0.00018457987,0.00919896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963899,0.0009428677,0.00023496192,0.0009491872,0.00084500585,0.00063810765],"domain_scores_gemma":[0.9628369,0.028701717,0.002772479,0.0027132065,0.0017152008,0.0012604612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021294206,0.0010171201,0.002261951,0.0016315434,0.0033627509,0.0060956087,0.003199153,0.0026216093,0.0077225957],"category_scores_gemma":[0.019134738,0.001936209,0.0021235682,0.004081083,0.0065512797,0.014378612,0.0043362486,0.008282867,0.0008989169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009749017,0.00038801256,0.004536015,0.0010512508,0.00024398752,0.0005701539,0.0021378784,0.03169466,0.0035016728,0.9107521,0.016334726,0.027814724],"study_design_scores_gemma":[0.00007184711,0.000026451147,0.00064246537,0.000022344097,0.000038896393,0.00021944639,0.00019859581,0.0114508085,0.0006219237,0.98471594,0.0019733156,0.000017996927],"about_ca_topic_score_codex":0.0033222036,"about_ca_topic_score_gemma":0.0033034582,"teacher_disagreement_score":0.0077225957,"about_ca_system_score_codex":0.0022117388,"about_ca_system_score_gemma":0.001837947,"threshold_uncertainty_score":0.02583462},"labels":[],"label_agreement":null},{"id":"W2009261722","doi":"10.1016/s0012-365x(01)00369-7","title":"Total domination in complements of graphs containing no K4,4","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.03916226416454757,"score_gpt":0.3101956242073229,"score_spread":0.27103336004277534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009261722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92523694,0.0002899114,0.022244863,0.0004200629,0.00006216131,0.00006895225,0.00086873496,0.00015713253,0.050651167],"genre_scores_gemma":[0.9672308,0.0002961911,0.012298171,0.00017931862,0.000048570422,0.000113398215,0.0015282131,0.00016970393,0.01813563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987777,0.00022221253,0.000059470814,0.00023824106,0.0003100098,0.0003924202],"domain_scores_gemma":[0.9937803,0.00333915,0.00067071815,0.00040848902,0.0007798265,0.0010213486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011100058,0.0006113991,0.0010592197,0.002111836,0.004341279,0.005398529,0.001434527,0.0010939253,0.009224462],"category_scores_gemma":[0.004478677,0.0008854922,0.0012737444,0.0016563975,0.0028098016,0.0031717024,0.0021775642,0.0013126426,0.00072793075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017612939,0.00016870932,0.010020807,0.00043733476,0.0001820255,0.001339085,0.0032148676,0.0094749285,0.01793384,0.9267168,0.007914142,0.020836227],"study_design_scores_gemma":[0.00020777967,0.00013611911,0.0066508516,0.00019442772,0.0002908023,0.0018522027,0.0028175032,0.035109214,0.01549505,0.9215685,0.015576694,0.00010076854],"about_ca_topic_score_codex":0.005653675,"about_ca_topic_score_gemma":0.008227459,"teacher_disagreement_score":0.009224462,"about_ca_system_score_codex":0.0015694915,"about_ca_system_score_gemma":0.0017126268,"threshold_uncertainty_score":0.030858934},"labels":[],"label_agreement":null},{"id":"W2009792106","doi":"10.1002/jgt.20123","title":"Spanning subgraphs of graphs partitioned into two isomorphic pieces","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Countable set; Induced subgraph; Cograph; Discrete mathematics; Induced subgraph isomorphism problem; Graph; Pathwidth; Line graph; Voltage graph; Vertex (graph theory)","score_opus":0.01714410709455434,"score_gpt":0.2990813890537635,"score_spread":0.2819372819592092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009792106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9551487,0.00006640875,0.03875627,0.000070715345,0.0000047749813,0.0000355554,0.00019449179,0.00011397808,0.0056089438],"genre_scores_gemma":[0.9878878,0.000034188506,0.010471245,0.00001978581,0.000007538124,0.00002068451,0.00045113984,0.000018032064,0.0010895664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976605,0.000048964965,0.000018488377,0.0000739633,0.000053576827,0.000038956827],"domain_scores_gemma":[0.9992943,0.0002531151,0.00016159759,0.00013409897,0.00007967614,0.000077145705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013200106,0.00014247803,0.00022845047,0.0006599114,0.00058156875,0.00045537294,0.00029570243,0.00024690732,0.001862641],"category_scores_gemma":[0.0009232369,0.00020568594,0.00024284543,0.00067114155,0.0005866924,0.00090104144,0.0006891579,0.00018825835,0.00012170668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005115916,0.00014470765,0.02118608,0.00035764067,0.00016439315,0.002630254,0.0031505954,0.03884465,0.13974765,0.6999862,0.004323305,0.08895288],"study_design_scores_gemma":[0.0000727593,0.00018258138,0.024197405,0.000046763005,0.00019667507,0.0030101675,0.0017723256,0.17503156,0.04380588,0.73585325,0.0157877,0.000043050288],"about_ca_topic_score_codex":0.0015638318,"about_ca_topic_score_gemma":0.0014652789,"teacher_disagreement_score":0.001862641,"about_ca_system_score_codex":0.00035933987,"about_ca_system_score_gemma":0.00017769785,"threshold_uncertainty_score":0.006231189},"labels":[],"label_agreement":null},{"id":"W2010049762","doi":"10.1016/j.disopt.2006.01.001","title":"Facets of the independent path-matching polytope","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Matching (statistics); Mathematics; Combinatorics; Path (computing); Birkhoff polytope; Convex polytope; Independent set; Convex hull; Intersection (aeronautics); Matroid; Regular polygon; Convex set; Computer science; Convex optimization; Graph","score_opus":0.007936245868375578,"score_gpt":0.2477247421725551,"score_spread":0.23978849630417953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010049762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2948464,0.001334479,0.49676433,0.001645313,0.00020502541,0.00034372185,0.0044392026,0.00038428264,0.2000372],"genre_scores_gemma":[0.837739,0.00231117,0.100171365,0.0002928028,0.00031341278,0.000534986,0.005022324,0.00042001266,0.053195067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993808,0.00010484381,0.00002213613,0.00012544142,0.00025781384,0.000108929176],"domain_scores_gemma":[0.9990507,0.0004244855,0.00015404439,0.000094771225,0.00009549312,0.00018058786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045176604,0.0008311935,0.0014266865,0.0012700792,0.0010580593,0.0040884656,0.0015331475,0.0011574185,0.01815318],"category_scores_gemma":[0.0027418544,0.00071895996,0.0009373374,0.0018236665,0.0014421132,0.002670493,0.0019297953,0.0026020885,0.0017777864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025083765,0.00016188086,0.0017072128,0.0002976272,0.00007302772,0.00023985094,0.0002490979,0.09438392,0.0028731339,0.84865034,0.013555108,0.037558053],"study_design_scores_gemma":[0.00007428816,0.000062375926,0.0016060924,0.00007364309,0.00003313332,0.00024228967,0.00023152251,0.2179206,0.0015350741,0.766916,0.011273847,0.000031232623],"about_ca_topic_score_codex":0.003912771,"about_ca_topic_score_gemma":0.0023574291,"teacher_disagreement_score":0.01815318,"about_ca_system_score_codex":0.0012961156,"about_ca_system_score_gemma":0.0009530027,"threshold_uncertainty_score":0.06072849},"labels":[],"label_agreement":null},{"id":"W2010884279","doi":"10.1007/s10878-013-9656-2","title":"A 0.5358-approximation for Bandpass-2","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates - Technology Futures","keywords":"Partition (number theory); Theory of computation; Mathematics; Matching (statistics); Travelling salesman problem; Combinatorics; Approximation algorithm; Band-pass filter; Partition problem; Bipartite graph; Discrete mathematics; Algorithm; Graph; Physics; Optics","score_opus":0.013518144185773052,"score_gpt":0.27259833383196913,"score_spread":0.25908018964619606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010884279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21158814,0.006556508,0.4931699,0.0130217085,0.0037421167,0.001153007,0.007479816,0.015535321,0.24775353],"genre_scores_gemma":[0.4804068,0.0018001058,0.43287972,0.004198416,0.0009001383,0.0009745187,0.0091841165,0.002352558,0.067303695],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709976,0.00051411404,0.00012474506,0.00056463847,0.0008685464,0.0008283256],"domain_scores_gemma":[0.99695575,0.0014923026,0.00012588393,0.00079607463,0.00035836652,0.00027164986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020015836,0.002804708,0.0026626938,0.0017611429,0.001796167,0.003950847,0.0032090917,0.0037112723,0.05365356],"category_scores_gemma":[0.009624103,0.0007428055,0.0026620848,0.0021966887,0.0013343958,0.003993653,0.0038556876,0.0038970062,0.016369846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005879266,0.00288479,0.0039816233,0.0015962798,0.00039188864,0.0005302994,0.00061533874,0.10271859,0.023964975,0.11413372,0.20847185,0.5348314],"study_design_scores_gemma":[0.0014988512,0.001269312,0.0031882166,0.0006352766,0.00046664057,0.0009988359,0.0008367957,0.5601469,0.013269085,0.349604,0.06794044,0.0001455773],"about_ca_topic_score_codex":0.0041588834,"about_ca_topic_score_gemma":0.008509673,"teacher_disagreement_score":0.05365356,"about_ca_system_score_codex":0.0035565388,"about_ca_system_score_gemma":0.005565645,"threshold_uncertainty_score":0.17948908},"labels":[],"label_agreement":null},{"id":"W2011612932","doi":"10.1007/s10589-007-9122-0","title":"Benders, metric and cutset inequalities for multicommodity capacitated network design","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; HEC Montréal","funders":"","keywords":"Mathematics; Metric (unit); Inequality; Context (archaeology); Mathematical optimization; Mathematical analysis","score_opus":0.059124732364864485,"score_gpt":0.325472630503332,"score_spread":0.26634789813846754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011612932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005615289,0.0013779649,0.9827088,0.0006809293,0.00019208068,0.00007368125,0.00021884669,0.00009195544,0.009040496],"genre_scores_gemma":[0.2937178,0.004729947,0.6729834,0.00073973223,0.0008199826,0.0007495534,0.0008440393,0.0002702924,0.025145223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815184,0.0008490554,0.00008140564,0.00024550862,0.00055003806,0.00012205118],"domain_scores_gemma":[0.99717015,0.0018280997,0.0002730145,0.00017326193,0.0004088213,0.00014669685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031340267,0.0024575524,0.0014561808,0.0015950241,0.0007670219,0.0023544142,0.0021190604,0.0020827497,0.0062647974],"category_scores_gemma":[0.008454911,0.0011134635,0.0012254805,0.003053726,0.001358568,0.0036951026,0.001537401,0.0038289297,0.00072869007],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017429527,0.00012834629,0.0003642575,0.0003122517,0.00008212854,0.000085825464,0.00011294247,0.53229964,0.0018866537,0.36956412,0.009133499,0.085856125],"study_design_scores_gemma":[0.000020182733,0.00006452552,0.0001665792,0.000048822778,0.000024680767,0.000042318323,0.000027775646,0.74636376,0.00067746197,0.24703997,0.0055024484,0.000021372503],"about_ca_topic_score_codex":0.003643798,"about_ca_topic_score_gemma":0.0042499513,"teacher_disagreement_score":0.0062647974,"about_ca_system_score_codex":0.0021674167,"about_ca_system_score_gemma":0.0017071781,"threshold_uncertainty_score":0.020957887},"labels":[],"label_agreement":null},{"id":"W2011663983","doi":"10.1016/s0012-365x(00)00127-8","title":"On constructible graphs, infinite bridged graphs and weakly cop-win graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Vertex (graph theory); Induced subgraph; Retract; Graph; Discrete mathematics; Bipartite graph; Pure mathematics","score_opus":0.016283508460044168,"score_gpt":0.2735630802026106,"score_spread":0.25727957174256644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011663983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46551648,0.002947299,0.32717124,0.0069797803,0.00040200655,0.00015812363,0.0006351627,0.00033190317,0.195858],"genre_scores_gemma":[0.91563237,0.003068748,0.04009464,0.0012385114,0.0005178231,0.0002624988,0.00117302,0.00025296607,0.037759397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917114,0.00024862803,0.00003921069,0.0001871549,0.00016196398,0.00019195344],"domain_scores_gemma":[0.9966433,0.0019548677,0.00036839893,0.00033831893,0.0002728864,0.00042222807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010795057,0.0011605031,0.0013082089,0.0027143774,0.0035187653,0.0036756457,0.0019884412,0.0020408148,0.008243455],"category_scores_gemma":[0.0048510134,0.0008622388,0.0012901912,0.003801584,0.0059572924,0.009782222,0.0040374487,0.0049687712,0.00079192425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018871104,0.000017935035,0.00017759312,0.000033554672,0.000005295366,0.000049082024,0.00025389766,0.0013087086,0.0002683666,0.9941895,0.0008413498,0.0028359105],"study_design_scores_gemma":[0.0000050299836,0.0000046859836,0.00009439458,0.000011425825,0.000004336022,0.000020400501,0.00009530865,0.0019874687,0.00007191386,0.99667203,0.0010291616,0.0000038468147],"about_ca_topic_score_codex":0.0031552403,"about_ca_topic_score_gemma":0.0037888954,"teacher_disagreement_score":0.008243455,"about_ca_system_score_codex":0.002498921,"about_ca_system_score_gemma":0.0008991431,"threshold_uncertainty_score":0.027577043},"labels":[],"label_agreement":null},{"id":"W2012753180","doi":"10.1007/s00373-014-1497-y","title":"Graphical Representations of Graphic Frame Matroids","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matroid; Graphic matroid; Combinatorics; Mathematics; Graph; Matroid partitioning; Discrete mathematics; Dual graph; Planar graph","score_opus":0.02808379344953137,"score_gpt":0.29715217956220635,"score_spread":0.269068386112675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012753180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06463175,0.0006898252,0.78289914,0.0015362508,0.00034134465,0.00018742944,0.002707493,0.003122122,0.14388464],"genre_scores_gemma":[0.6888068,0.001310236,0.24987446,0.00064097054,0.00041357658,0.00058360974,0.0042417897,0.00094323093,0.05318539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971646,0.00007919614,0.000015555239,0.000059403766,0.00006424059,0.00006507226],"domain_scores_gemma":[0.9994803,0.0001441133,0.00009334339,0.00009671315,0.00011817368,0.00006741416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023137625,0.00080595765,0.00051522173,0.0019576484,0.00071405765,0.0034227967,0.0010395343,0.0010201256,0.036975704],"category_scores_gemma":[0.0012407233,0.0003927334,0.00069543,0.0017810999,0.0007712793,0.002332854,0.0009582553,0.0012592953,0.0042163585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052426578,0.000027389397,0.000104109284,0.0000646885,0.0000061691267,0.00010746182,0.00029432226,0.0040829317,0.0017338002,0.9638147,0.005925868,0.023786277],"study_design_scores_gemma":[0.000032812986,0.000036041936,0.00020341828,0.00006410517,0.000022077591,0.00014701791,0.00026957644,0.03685428,0.0013565501,0.9178143,0.04317814,0.000021723976],"about_ca_topic_score_codex":0.0012742522,"about_ca_topic_score_gemma":0.0015858911,"teacher_disagreement_score":0.036975704,"about_ca_system_score_codex":0.0006776904,"about_ca_system_score_gemma":0.00036578177,"threshold_uncertainty_score":0.12369609},"labels":[],"label_agreement":null},{"id":"W2013280510","doi":"10.1007/s10878-015-9871-0","title":"New analysis and computational study for the planar connected dominating set problem","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Matrix multiplication; Planar; Matrix (chemical analysis); Discrete mathematics; Algorithm; Graph; Computer science; Physics","score_opus":0.028811646897640365,"score_gpt":0.31579021679778535,"score_spread":0.286978569900145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013280510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08857974,0.008299173,0.8228117,0.011470922,0.0011868554,0.0006685224,0.0017468171,0.0006452249,0.064591035],"genre_scores_gemma":[0.6093247,0.008389079,0.33800793,0.0029708461,0.00493384,0.0012014355,0.003538021,0.0008766684,0.030757584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959604,0.0013650681,0.00015581942,0.00073546666,0.0012600453,0.00052317436],"domain_scores_gemma":[0.96401924,0.0303876,0.001324675,0.0018626478,0.0015606539,0.00084521604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005587839,0.0026594023,0.0028878257,0.005138592,0.002508128,0.0061858096,0.006903014,0.0026989202,0.0178081],"category_scores_gemma":[0.03837359,0.0014460945,0.0039039762,0.0071470276,0.00411703,0.017101685,0.00488955,0.009501214,0.001400629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004953234,0.0012194789,0.0039940206,0.001210088,0.00026222278,0.0003166243,0.0005158785,0.2679532,0.0021647604,0.59230244,0.034757055,0.094809],"study_design_scores_gemma":[0.000057512152,0.00007344757,0.00071285205,0.00008749798,0.00010599007,0.00014970933,0.00018085107,0.7153601,0.00045521528,0.27726054,0.00552064,0.00003554003],"about_ca_topic_score_codex":0.0049219127,"about_ca_topic_score_gemma":0.006939509,"teacher_disagreement_score":0.0178081,"about_ca_system_score_codex":0.0049158446,"about_ca_system_score_gemma":0.0034535269,"threshold_uncertainty_score":0.059574068},"labels":[],"label_agreement":null},{"id":"W2013329579","doi":"10.1155/2011/135481","title":"The Modified Negative Decision Number in Graphs","year":2011,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Algorithm; Computer science","score_opus":0.06287889222005405,"score_gpt":0.3579722105927675,"score_spread":0.29509331837271346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013329579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5526276,0.0034510233,0.38474935,0.0020443574,0.0003356604,0.00009899003,0.0011098401,0.00053088,0.055052295],"genre_scores_gemma":[0.9315233,0.0005580143,0.06177651,0.00024415698,0.00017638638,0.00011642786,0.00035603077,0.00006462153,0.005184534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824,0.000491304,0.00008429687,0.00049139536,0.00046813718,0.00022496068],"domain_scores_gemma":[0.9944622,0.003575181,0.0006245304,0.0004317456,0.0004287033,0.00047764502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013749124,0.00070078595,0.00061153463,0.0015732904,0.00074493675,0.0017803962,0.0011971837,0.0006950473,0.0031936713],"category_scores_gemma":[0.009726804,0.0003992751,0.0002939039,0.0013351451,0.0023301768,0.0034167643,0.0013723654,0.0014229212,0.00044179612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001206866,0.00010245234,0.0045995014,0.0004197314,0.00006188612,0.00049584615,0.0003380033,0.079707265,0.0184773,0.79689753,0.0069717476,0.090721846],"study_design_scores_gemma":[0.000044280467,0.00013910318,0.002011438,0.00006010203,0.000025915071,0.00064353674,0.00007415271,0.15900971,0.0043195086,0.82357943,0.010027648,0.000065052016],"about_ca_topic_score_codex":0.00041835778,"about_ca_topic_score_gemma":0.0005802889,"teacher_disagreement_score":0.0031936713,"about_ca_system_score_codex":0.0011296613,"about_ca_system_score_gemma":0.00046248586,"threshold_uncertainty_score":0.010683894},"labels":[],"label_agreement":null},{"id":"W2013432272","doi":"10.1007/s00373-009-0870-8","title":"Fast Winning Strategies in Avoider-Enforcer Games","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Graph; Mathematical economics; Complete graph; Planarity testing; Set (abstract data type); Complete bipartite graph; Order (exchange); Computer science; Economics","score_opus":0.013567615020505925,"score_gpt":0.26867636386001625,"score_spread":0.25510874883951035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013432272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.577843,0.00039737823,0.3781675,0.0014713047,0.00012909356,0.00026456633,0.00037491904,0.0010730936,0.040279057],"genre_scores_gemma":[0.9240576,0.0003045607,0.05286359,0.0002520588,0.00007045832,0.00022843391,0.00038759582,0.00033224726,0.021503434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970811,0.00079758296,0.00016014825,0.00040527302,0.00075461366,0.00080131117],"domain_scores_gemma":[0.9849258,0.010794198,0.0009288835,0.0012117386,0.0007273431,0.00141203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003351054,0.0014821981,0.002714127,0.0016941017,0.0023796626,0.004901634,0.003306265,0.0026730797,0.009024154],"category_scores_gemma":[0.016774522,0.0013436959,0.0014722575,0.0015475898,0.0022952098,0.0071223294,0.0038309526,0.0048075984,0.0014192875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012373576,0.00036558122,0.0025177062,0.0002866384,0.0001159336,0.00046591516,0.00095464115,0.0449893,0.006534694,0.89704543,0.0058110217,0.039675772],"study_design_scores_gemma":[0.00019162401,0.00008369821,0.0004193398,0.000022152071,0.000048141916,0.00013466833,0.00015204008,0.12755515,0.0013790022,0.8687814,0.0012014837,0.000031396525],"about_ca_topic_score_codex":0.003364586,"about_ca_topic_score_gemma":0.005281482,"teacher_disagreement_score":0.009024154,"about_ca_system_score_codex":0.0018642411,"about_ca_system_score_gemma":0.0024734184,"threshold_uncertainty_score":0.03018874},"labels":[],"label_agreement":null},{"id":"W2013441256","doi":"10.1016/j.disc.2011.02.017","title":"Helly theorems for 3-Steiner and 3-monophonic convexity in graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Steiner tree problem; Discrete mathematics; Graph","score_opus":0.04527375080292364,"score_gpt":0.2889499057836746,"score_spread":0.24367615498075093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013441256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48859704,0.0021317827,0.34133998,0.011156558,0.0005615557,0.00018378133,0.0014383354,0.00039946652,0.15419157],"genre_scores_gemma":[0.92753375,0.0019377208,0.040451717,0.0016627668,0.0008202056,0.000361749,0.0008207753,0.00027622408,0.026135007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990398,0.00025808543,0.000058954523,0.00018933362,0.00025687486,0.00019683452],"domain_scores_gemma":[0.9931772,0.0047991327,0.00049362704,0.0004862448,0.00039880208,0.0006451053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018534333,0.0010022498,0.0015687189,0.0031965203,0.0034950636,0.004176824,0.0020151562,0.0018129263,0.010217629],"category_scores_gemma":[0.006162873,0.0011285992,0.0022856677,0.0026371276,0.0058932947,0.009767379,0.0046680192,0.007841356,0.0007834783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003456399,0.000015524098,0.00029963706,0.000037382604,0.000013474419,0.000058887526,0.00023705751,0.001539094,0.00033013715,0.9932152,0.0015829538,0.0026361963],"study_design_scores_gemma":[0.000014075923,0.000006811808,0.0002531559,0.000006694852,0.000010409614,0.00003926783,0.000064417385,0.003113041,0.0001821017,0.9953166,0.0009854526,0.000007974762],"about_ca_topic_score_codex":0.002218101,"about_ca_topic_score_gemma":0.0027385629,"teacher_disagreement_score":0.010217629,"about_ca_system_score_codex":0.0026795352,"about_ca_system_score_gemma":0.0010785105,"threshold_uncertainty_score":0.034181416},"labels":[],"label_agreement":null},{"id":"W2013473240","doi":"10.4153/cmb-2009-045-6","title":"Hamiltonian Properties of Generalized Halin Graphs","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.025002392929088308,"score_gpt":0.24698558806614634,"score_spread":0.22198319513705803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013473240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9465457,0.0002272356,0.03443294,0.00021164856,0.000017584971,0.000047885358,0.00021474548,0.00010384572,0.018198494],"genre_scores_gemma":[0.9954613,0.000059986454,0.0030315367,0.00003497024,0.000011625722,0.000019551122,0.00008160079,0.000012894483,0.0012865097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998634,0.00003770881,0.000006226206,0.000032942884,0.000029532794,0.000030206342],"domain_scores_gemma":[0.99946064,0.00020201423,0.00013085642,0.00004814655,0.00007032156,0.000088091445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013233667,0.00018643595,0.00021226025,0.00073837896,0.00063323014,0.00078571646,0.0003370251,0.00029432817,0.0037698452],"category_scores_gemma":[0.00057769817,0.00012890334,0.00012406259,0.000384789,0.00091395807,0.0009524889,0.00045547955,0.00029476456,0.00012717782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017896891,0.00006161916,0.0067716143,0.00015973787,0.000031260828,0.00088710646,0.0010149723,0.018720776,0.020394038,0.93223715,0.0025922256,0.016950604],"study_design_scores_gemma":[0.000052937598,0.000078219164,0.0071393684,0.00004089234,0.000022565628,0.0010310028,0.0014968177,0.07575982,0.009468393,0.89479595,0.010076999,0.00003706564],"about_ca_topic_score_codex":0.0007307697,"about_ca_topic_score_gemma":0.0010455761,"teacher_disagreement_score":0.0037698452,"about_ca_system_score_codex":0.00053912157,"about_ca_system_score_gemma":0.00013432815,"threshold_uncertainty_score":0.012611389},"labels":[],"label_agreement":null},{"id":"W2013474931","doi":"10.1016/j.dam.2008.01.011","title":"Efficient algorithms for Roman domination on some classes of graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Interval graph; Domination analysis; Graph; Time complexity; Minimum weight; Chordal graph; Discrete mathematics; 1-planar graph","score_opus":0.03393014591615173,"score_gpt":0.3040478813041502,"score_spread":0.2701177353879985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013474931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38192153,0.0012211632,0.5233786,0.004804255,0.00022311347,0.00082609366,0.0017566473,0.0033432092,0.08252535],"genre_scores_gemma":[0.6327989,0.000808168,0.32874745,0.00076836644,0.0002511514,0.0005417937,0.003217842,0.0012074678,0.03165882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976278,0.0006503209,0.000114831484,0.0005662228,0.00046034247,0.00058049016],"domain_scores_gemma":[0.99228716,0.005002394,0.00046013904,0.0013805092,0.00040157896,0.0004682574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018852862,0.0013410617,0.0017996054,0.002005762,0.0029035222,0.0044473303,0.0038649621,0.001987881,0.017929321],"category_scores_gemma":[0.009383907,0.0011496417,0.0023787606,0.0028296555,0.0021151528,0.008684833,0.004548259,0.003886957,0.002229047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012713755,0.00081812835,0.0041606803,0.00084717834,0.0002126072,0.00026271868,0.00172975,0.070204735,0.010159851,0.575121,0.0383324,0.29687956],"study_design_scores_gemma":[0.00036161713,0.00008444775,0.00079323305,0.00006456059,0.00010798622,0.00024556147,0.00039146718,0.2587507,0.004384482,0.7234728,0.011299034,0.00004415276],"about_ca_topic_score_codex":0.0027313838,"about_ca_topic_score_gemma":0.0069870814,"teacher_disagreement_score":0.017929321,"about_ca_system_score_codex":0.0032749448,"about_ca_system_score_gemma":0.00231747,"threshold_uncertainty_score":0.059979558},"labels":[],"label_agreement":null},{"id":"W2013664277","doi":"10.1006/jctb.2002.2128","title":"Packing Odd Circuits in Eulerian Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minor (academic); Eulerian path; Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Integer (computer science); Discrete mathematics; Computer science; Mathematical analysis; Telecommunications","score_opus":0.02289851368456595,"score_gpt":0.26171793746704963,"score_spread":0.2388194237824837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013664277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9479059,0.00054393505,0.024321556,0.0004977477,0.00013926257,0.0000400336,0.00025033628,0.00016750488,0.026133768],"genre_scores_gemma":[0.97375715,0.0006489903,0.012829712,0.00020369918,0.00009536905,0.00004114336,0.0005006654,0.00013790074,0.011785382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956447,0.00008169713,0.000029046287,0.000081407576,0.00008307275,0.00016028658],"domain_scores_gemma":[0.99817514,0.0009705227,0.00028345117,0.00023154762,0.00008246146,0.00025687244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034529946,0.00064747414,0.0010017615,0.0015487515,0.001702553,0.0035288385,0.0010830691,0.0012728203,0.0072131543],"category_scores_gemma":[0.0026435382,0.0008145893,0.00044540243,0.0022452062,0.0015294054,0.0037153384,0.0019502772,0.0013568862,0.0005025328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009163974,0.00036858424,0.0093867285,0.0003600439,0.00007446269,0.0014171096,0.0013913579,0.032324832,0.015918285,0.86710376,0.009306399,0.061431948],"study_design_scores_gemma":[0.000085097075,0.000102803424,0.0030501331,0.00006901882,0.00007266158,0.00046750312,0.0007212976,0.042699985,0.004897802,0.9414343,0.0063759424,0.0000234023],"about_ca_topic_score_codex":0.0013219953,"about_ca_topic_score_gemma":0.0026675265,"teacher_disagreement_score":0.0072131543,"about_ca_system_score_codex":0.0008672126,"about_ca_system_score_gemma":0.00038489208,"threshold_uncertainty_score":0.024130404},"labels":[],"label_agreement":null},{"id":"W2013713597","doi":"10.1016/s0012-365x(99)00355-6","title":"On hamiltonian connectedness of K1,4-free graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Social connectedness; Pancyclic graph; Discrete mathematics; Graph; Hamiltonian (control theory); Connectivity; Pathwidth; Line graph","score_opus":0.017383883880047038,"score_gpt":0.28031229433020755,"score_spread":0.2629284104501605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013713597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92975533,0.0009297645,0.018699935,0.0015436935,0.00009441121,0.000051662322,0.0005855113,0.00010528917,0.048234247],"genre_scores_gemma":[0.986212,0.000773602,0.004826534,0.00033286205,0.00012990365,0.00007099861,0.00064011285,0.00006920224,0.0069446666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994684,0.00012490434,0.00002838586,0.00016314897,0.00009514209,0.00012007054],"domain_scores_gemma":[0.9942358,0.0038361773,0.00081652624,0.00026400393,0.000281855,0.0005656212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006420895,0.0006914625,0.00075163116,0.0029656445,0.002318757,0.0028351585,0.0018194858,0.0015497073,0.01174868],"category_scores_gemma":[0.0048972564,0.000775343,0.0006323782,0.0029254465,0.0030103219,0.0044870595,0.0019686879,0.0016990959,0.0005537843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031385748,0.00011096423,0.003822892,0.00030271732,0.000053450265,0.00048157133,0.0021282146,0.008582224,0.004698275,0.96088,0.004276466,0.01434947],"study_design_scores_gemma":[0.00005103768,0.000028464834,0.0025266642,0.000051506795,0.000033319255,0.00018813058,0.0005666774,0.009477689,0.00073440064,0.98473465,0.0015844149,0.000022998429],"about_ca_topic_score_codex":0.0020006571,"about_ca_topic_score_gemma":0.002783915,"teacher_disagreement_score":0.01174868,"about_ca_system_score_codex":0.0012677315,"about_ca_system_score_gemma":0.0005153008,"threshold_uncertainty_score":0.039303243},"labels":[],"label_agreement":null},{"id":"W2013957545","doi":"10.1016/j.disc.2011.02.008","title":"Extending precolourings of circular cliques","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Conjecture; Clique number; Chromatic scale; Clique; Graph; Discrete mathematics","score_opus":0.05201806543424768,"score_gpt":0.305140009474376,"score_spread":0.2531219440401283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013957545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2914748,0.0006091124,0.6037153,0.00089838036,0.0004759589,0.00021048081,0.00081690174,0.0015548711,0.10024423],"genre_scores_gemma":[0.78655547,0.00057587447,0.17724712,0.00040951424,0.0005105428,0.00011429696,0.0009806728,0.0010260498,0.032580458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907744,0.00019297925,0.000050486215,0.00029236366,0.0002040529,0.00018271936],"domain_scores_gemma":[0.99279344,0.0030130239,0.00041298315,0.0025505384,0.0006719059,0.00055814354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010386766,0.0004814739,0.0006283581,0.0011969745,0.0016760349,0.0016772513,0.0016091105,0.00067453634,0.011146378],"category_scores_gemma":[0.006413531,0.0006222243,0.0011078465,0.001288137,0.0022799303,0.0042605707,0.0025658794,0.0022566465,0.0012472811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025328994,0.00008860012,0.0006503415,0.00014457126,0.000020527867,0.00016784304,0.00066606264,0.008640589,0.005985504,0.9181267,0.004767775,0.06048814],"study_design_scores_gemma":[0.000040157127,0.00007408997,0.0004676195,0.000036002148,0.00003022539,0.0001600493,0.00015397927,0.029544495,0.004080706,0.94275504,0.022632387,0.000025262134],"about_ca_topic_score_codex":0.0016433883,"about_ca_topic_score_gemma":0.0024601559,"teacher_disagreement_score":0.011146378,"about_ca_system_score_codex":0.0007130023,"about_ca_system_score_gemma":0.0005374047,"threshold_uncertainty_score":0.03728831},"labels":[],"label_agreement":null},{"id":"W2014252825","doi":"10.1016/s0304-3975(98)00342-9","title":"The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Victoria","funders":"","keywords":"Colored; Combinatorics; Parameterized complexity; Chordal graph; Mathematics; Pathwidth; Vertex (graph theory); Discrete mathematics; Upper and lower bounds; Tree (set theory); Bounded function; Graph; Line graph","score_opus":0.021004933285101487,"score_gpt":0.28023671478497736,"score_spread":0.25923178149987586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014252825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5958303,0.002371463,0.29499564,0.021803575,0.0005100415,0.0003459823,0.0035717457,0.0012093453,0.07936185],"genre_scores_gemma":[0.9016251,0.0019730339,0.06625857,0.0014560526,0.000540078,0.0003081066,0.0021748191,0.0006036123,0.02506068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975539,0.0007970872,0.00012668698,0.00059070723,0.00042095158,0.00051074434],"domain_scores_gemma":[0.97012264,0.023866525,0.0018666139,0.0021976717,0.0006371749,0.0013092064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021386682,0.0012654298,0.0026719244,0.0013353893,0.0042068674,0.0054447693,0.005073055,0.0048702103,0.012031528],"category_scores_gemma":[0.026075576,0.0028269014,0.0025441162,0.0033785836,0.005901365,0.01808124,0.0047995606,0.0072582955,0.0009839929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000991159,0.00034926567,0.0025531205,0.00073181617,0.00015089355,0.0005443658,0.0013057934,0.17688982,0.003196326,0.7516,0.026203671,0.03548376],"study_design_scores_gemma":[0.00014913079,0.000043559383,0.0007723354,0.00005245573,0.000055029996,0.00017394614,0.00037415416,0.069188386,0.0009484345,0.92549676,0.0027174153,0.000028327551],"about_ca_topic_score_codex":0.008095568,"about_ca_topic_score_gemma":0.0075670253,"teacher_disagreement_score":0.012031528,"about_ca_system_score_codex":0.0030118607,"about_ca_system_score_gemma":0.0023767462,"threshold_uncertainty_score":0.040249467},"labels":[],"label_agreement":null},{"id":"W2014294736","doi":"10.1287/moor.1080.0337","title":"Finding the Exact Integrality Gap for Small Traveling Salesman Problems","year":2008,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Travelling salesman problem; Mathematics; Conjecture; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Graph; Relaxation (psychology); Combinatorial optimization; Metric (unit); Discrete mathematics; Mathematical optimization","score_opus":0.38378126360936615,"score_gpt":0.4339300606441794,"score_spread":0.05014879703481323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014294736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5655209,0.0040274607,0.34999338,0.0056743915,0.000295096,0.00019024668,0.0005399194,0.00078986987,0.07296878],"genre_scores_gemma":[0.93391097,0.0011016448,0.059763014,0.00057838194,0.00022036597,0.00021338364,0.00048295074,0.00024599594,0.0034833457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798155,0.00056334166,0.000087002656,0.0004654783,0.00043899543,0.00046361276],"domain_scores_gemma":[0.9777876,0.018462695,0.0010907826,0.0010324382,0.00055300735,0.0010734814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00347508,0.0010951057,0.0016756441,0.0018624726,0.0014308569,0.00304957,0.00283243,0.0016485881,0.0073512495],"category_scores_gemma":[0.028632443,0.00086871575,0.0009512319,0.0014117708,0.003396806,0.009632628,0.0028080747,0.0052268654,0.00055088196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079827115,0.0005432645,0.0026572368,0.0006288911,0.00011513486,0.00027743864,0.0006921478,0.15526852,0.0055342684,0.7895217,0.006044392,0.0379187],"study_design_scores_gemma":[0.000049993276,0.00008010439,0.0005701035,0.000051568182,0.000027983922,0.0001385855,0.00015906888,0.24883094,0.0015695449,0.74682045,0.0016802625,0.000021311147],"about_ca_topic_score_codex":0.0009313293,"about_ca_topic_score_gemma":0.00073676725,"teacher_disagreement_score":0.0073512495,"about_ca_system_score_codex":0.0023989917,"about_ca_system_score_gemma":0.001433021,"threshold_uncertainty_score":0.0245924},"labels":[],"label_agreement":null},{"id":"W2014824669","doi":"10.1016/j.jctb.2012.10.002","title":"Cops and robbers in a random graph","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Hungarian Scientific Research Fund; Nemzeti Kutatási és Technológiai Hivatal; Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Random graph; Random regular graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.010801777342243853,"score_gpt":0.2653487859544998,"score_spread":0.25454700861225593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014824669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6336055,0.0018219594,0.29321337,0.0090360865,0.00037359892,0.0003007069,0.001262003,0.0009758963,0.059411004],"genre_scores_gemma":[0.91135734,0.0010686356,0.04363501,0.0009168173,0.00050059176,0.00030910553,0.0007224867,0.0005743926,0.04091556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974124,0.0011115499,0.000093131785,0.0005129141,0.0004836761,0.00038640358],"domain_scores_gemma":[0.97870857,0.01494321,0.0017184855,0.0018475063,0.000799266,0.0019829224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021679972,0.0011016347,0.0030806898,0.0038343954,0.0033790716,0.004467277,0.0028403006,0.0037742925,0.0140975],"category_scores_gemma":[0.019529622,0.0017406,0.001479895,0.0031694314,0.004133927,0.0077403123,0.0031250448,0.003434815,0.001704815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018033257,0.00009922913,0.0008545773,0.00015067206,0.000056177818,0.00037832235,0.00047573668,0.02518841,0.001202033,0.9555551,0.008449584,0.007409831],"study_design_scores_gemma":[0.00006965754,0.00003817173,0.00063280936,0.000047689056,0.00004940632,0.00034297386,0.0002105798,0.11443888,0.00062657124,0.87990934,0.0035925913,0.000041270847],"about_ca_topic_score_codex":0.002403682,"about_ca_topic_score_gemma":0.0028953338,"teacher_disagreement_score":0.0140975,"about_ca_system_score_codex":0.0014589438,"about_ca_system_score_gemma":0.0009412738,"threshold_uncertainty_score":0.047160864},"labels":[],"label_agreement":null},{"id":"W2014924232","doi":"10.1016/j.jctb.2014.06.004","title":"Colouring graphs when the number of colours is almost the maximum degree","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Degree (music); Chromatic scale; Constant (computer programming); Discrete mathematics","score_opus":0.018647920120497957,"score_gpt":0.27657573051166157,"score_spread":0.25792781039116364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014924232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84378827,0.0006149602,0.10312096,0.0030974708,0.00023626242,0.00008979731,0.000610539,0.00087219116,0.047569588],"genre_scores_gemma":[0.97630036,0.00024290157,0.016344417,0.00034816883,0.00014312427,0.000058046786,0.00026338143,0.00017152439,0.0061280373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862635,0.0003849586,0.00007304663,0.00030205262,0.0002082936,0.0004052107],"domain_scores_gemma":[0.97998786,0.013731999,0.001524555,0.0021103062,0.0009113402,0.0017339712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014135567,0.0006897903,0.0010521951,0.0014348221,0.0016707304,0.0038296846,0.0019117884,0.0028742196,0.0076286537],"category_scores_gemma":[0.013028931,0.0010174147,0.000841559,0.0012462034,0.002578736,0.0051854067,0.0019448346,0.002199729,0.0006877748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001034924,0.00019276112,0.0063826772,0.00029722755,0.00009263751,0.00115225,0.00077882863,0.0382226,0.02590752,0.8912535,0.010663788,0.024021331],"study_design_scores_gemma":[0.00010605911,0.000058567442,0.0020254792,0.00004464295,0.000057172,0.0010510694,0.00031256783,0.07899788,0.005601724,0.9085528,0.0031461462,0.000045921995],"about_ca_topic_score_codex":0.001091789,"about_ca_topic_score_gemma":0.0017764498,"teacher_disagreement_score":0.0076286537,"about_ca_system_score_codex":0.0013516576,"about_ca_system_score_gemma":0.00070851826,"threshold_uncertainty_score":0.025520384},"labels":[],"label_agreement":null},{"id":"W2015119735","doi":"10.1016/j.aam.2013.10.001","title":"Dominating circuits in regular matroids","year":2013,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Vertex (graph theory); Disjoint sets; Simple graph; Graphic matroid; Graph; Matroid partitioning; Discrete mathematics; Connectivity","score_opus":0.011976984798428804,"score_gpt":0.2799651368871039,"score_spread":0.2679881520886751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015119735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7178017,0.001921599,0.20258097,0.0029621883,0.00018735805,0.00012916535,0.0009819355,0.00043503597,0.07300003],"genre_scores_gemma":[0.9468367,0.0011280678,0.027470084,0.00040899182,0.0002837051,0.00011484815,0.00077313336,0.00013111331,0.022853248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999199,0.00020322841,0.000043548313,0.00019717327,0.00021287779,0.00014423316],"domain_scores_gemma":[0.9961887,0.002435677,0.00035791067,0.00029897984,0.00030169226,0.00041706214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071129034,0.00059208774,0.0009807895,0.0013505657,0.0012819483,0.0039720414,0.0014873013,0.0011250286,0.0059597553],"category_scores_gemma":[0.004559939,0.0007762068,0.00061983656,0.0018175261,0.001965811,0.004092699,0.0014717963,0.0022283993,0.0005650023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001557739,0.00006636086,0.0008465671,0.00015733813,0.000028685283,0.00018327382,0.00048191936,0.0060069193,0.0022502898,0.971384,0.0027791758,0.015659684],"study_design_scores_gemma":[0.000050297156,0.000019872783,0.00032823495,0.000014057484,0.000026644151,0.00016625493,0.00012271422,0.01544893,0.000739515,0.98008895,0.0029854653,0.000009080964],"about_ca_topic_score_codex":0.00095543097,"about_ca_topic_score_gemma":0.0015079495,"teacher_disagreement_score":0.0059597553,"about_ca_system_score_codex":0.001585811,"about_ca_system_score_gemma":0.00046380016,"threshold_uncertainty_score":0.019937336},"labels":[],"label_agreement":null},{"id":"W2015142077","doi":"10.1016/s0166-218x(01)00299-2","title":"Pushing vertices in digraphs without long induced cycles","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Digraph; Bipartite graph; Mathematics; Chordal graph; Characterization (materials science); Discrete mathematics; Permutation (music); Class (philosophy); Permutation graph; Graph; Computer science","score_opus":0.04205290952623685,"score_gpt":0.29742326292808546,"score_spread":0.2553703534018486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015142077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55040026,0.0005619467,0.40046325,0.0012182193,0.00036595334,0.0003275144,0.00070821546,0.0012446335,0.044710107],"genre_scores_gemma":[0.78500056,0.00084559206,0.17468457,0.0005287675,0.000101995094,0.00039792,0.0008439042,0.0005490343,0.037047632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991929,0.0001695588,0.000065244305,0.00023784512,0.00017106233,0.00016342007],"domain_scores_gemma":[0.9945129,0.0029018363,0.0005089601,0.0006505653,0.00042471365,0.0010010882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079578377,0.00090483035,0.0011045466,0.0021424976,0.003164441,0.003326936,0.0020011635,0.0025447335,0.008625426],"category_scores_gemma":[0.0081335325,0.0015946855,0.0011873088,0.0024331005,0.0016436662,0.005204445,0.0039423103,0.002764644,0.0016003691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028008953,0.00019187058,0.0015771852,0.00031291784,0.00007493508,0.0009171835,0.0010475153,0.02132843,0.008665353,0.9140005,0.003490223,0.04811379],"study_design_scores_gemma":[0.00006302869,0.00005738346,0.00038723365,0.000070096394,0.00005462466,0.00019446723,0.00038991024,0.036985558,0.0031948332,0.9520018,0.006567781,0.000033125812],"about_ca_topic_score_codex":0.0015007785,"about_ca_topic_score_gemma":0.0030103335,"teacher_disagreement_score":0.008625426,"about_ca_system_score_codex":0.0010310904,"about_ca_system_score_gemma":0.0008628676,"threshold_uncertainty_score":0.028854907},"labels":[],"label_agreement":null},{"id":"W2015153338","doi":"10.1016/j.disc.2011.06.016","title":"The adaptable choosability number grows with the choosability number","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Multigraph; Integer (computer science); Colored; Infinity; Discrete mathematics; Graph; Computer science","score_opus":0.034086144093716846,"score_gpt":0.2841479216427549,"score_spread":0.250061777549038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015153338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6879053,0.0013509032,0.24866897,0.0036441807,0.0005772561,0.00011694309,0.0013777299,0.002932902,0.05342592],"genre_scores_gemma":[0.9684446,0.00083889166,0.019918185,0.00032641576,0.00024125355,0.00016692448,0.00055178354,0.0005093339,0.009002505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877876,0.00021518116,0.00005688199,0.00041620716,0.00032559846,0.00020729839],"domain_scores_gemma":[0.9812757,0.012683761,0.0011028291,0.0027494752,0.0009027721,0.001285338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011516667,0.00069569075,0.0010800522,0.0014928309,0.0007807111,0.0020652942,0.0020006543,0.0017557248,0.011529954],"category_scores_gemma":[0.015283948,0.00066942093,0.00076451054,0.0011683027,0.0018178333,0.005861525,0.0017398463,0.0034124337,0.0017378994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011008186,0.00052789506,0.01717031,0.0009283483,0.00021019312,0.0011073722,0.0005250425,0.12235816,0.13570997,0.576713,0.012093873,0.13155505],"study_design_scores_gemma":[0.000098653116,0.0002162665,0.0128145255,0.00008797952,0.00013561209,0.0012932122,0.0002202829,0.41478738,0.028313298,0.53143656,0.010453281,0.00014286685],"about_ca_topic_score_codex":0.00046616455,"about_ca_topic_score_gemma":0.0004885843,"teacher_disagreement_score":0.011529954,"about_ca_system_score_codex":0.0009229915,"about_ca_system_score_gemma":0.000688613,"threshold_uncertainty_score":0.038571537},"labels":[],"label_agreement":null},{"id":"W2015471596","doi":"10.1145/2462356.2462381","title":"Robust geometric spanners","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Robustness (evolution); Combinatorics; Treewidth; Mathematics; Computer science; Dimension (graph theory); Graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.04245050275022487,"score_gpt":0.2705574150106879,"score_spread":0.22810691226046304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015471596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2722416,0.0010903568,0.6491559,0.00056549034,0.00025720045,0.00015059592,0.0007191996,0.0014545692,0.074365124],"genre_scores_gemma":[0.8625874,0.0008051599,0.115022056,0.0004436259,0.0002242604,0.00018743734,0.0010173726,0.00031987688,0.019392792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994295,0.00009091787,0.000030805073,0.00018839682,0.00016377834,0.000096481985],"domain_scores_gemma":[0.9985435,0.00038635216,0.00032105562,0.00043954345,0.00014497688,0.00016459991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032568013,0.00061415666,0.00045579227,0.00071606244,0.0005430792,0.0009663546,0.00073225494,0.0009307971,0.008675239],"category_scores_gemma":[0.0023883658,0.00034071231,0.000541679,0.0005870499,0.0013514741,0.002545449,0.0021537452,0.0011159058,0.0018923528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012229332,0.000056374447,0.00083086133,0.00022693329,0.000039297276,0.00044220654,0.00019273709,0.033771824,0.048628066,0.86262834,0.0042107287,0.048850305],"study_design_scores_gemma":[0.000035114685,0.00030718974,0.0012071895,0.00006684996,0.00004384412,0.0013510613,0.00022291376,0.08027175,0.032602847,0.8514374,0.032400373,0.00005351767],"about_ca_topic_score_codex":0.000109688444,"about_ca_topic_score_gemma":0.00017231291,"teacher_disagreement_score":0.008675239,"about_ca_system_score_codex":0.00029827253,"about_ca_system_score_gemma":0.00017914835,"threshold_uncertainty_score":0.02902162},"labels":[],"label_agreement":null},{"id":"W2015501288","doi":"10.1287/opre.1080.0635","title":"Conflict Resolution in the Scheduling of Television Commercials","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Association of Canadian Universities for Research in Astronomy","keywords":"Weighting; Combinatorics; Scheduling (production processes); Partition (number theory); Mathematics; Extension (predicate logic); Computer science; Upper and lower bounds; Generalization; Mathematical optimization","score_opus":0.15234418232633448,"score_gpt":0.45514144534738327,"score_spread":0.3027972630210488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015501288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1556595,0.00057609915,0.83269596,0.0005830234,0.000075694414,0.00019204228,0.00019672398,0.0004077693,0.009613128],"genre_scores_gemma":[0.81414753,0.0002446173,0.18109608,0.0001378836,0.000045246245,0.00019821769,0.00023891267,0.00016380486,0.003727705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847966,0.00067034265,0.00005598201,0.0002930924,0.00023328041,0.00026764156],"domain_scores_gemma":[0.99764997,0.0014728876,0.00024136162,0.00019662423,0.00019908223,0.00024011658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016237948,0.00074351014,0.0009827431,0.0005567818,0.0008148367,0.0014493543,0.0027535788,0.0009477093,0.0052853483],"category_scores_gemma":[0.0040119584,0.0008439348,0.0006531635,0.0017769701,0.00094067276,0.0019000139,0.0010940117,0.001697366,0.00045309134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042009517,0.00016915592,0.00083172024,0.00015911307,0.00006297675,0.0002246256,0.00025297882,0.9292693,0.0039696675,0.02760984,0.0020198748,0.03501067],"study_design_scores_gemma":[0.000039704642,0.00006231882,0.00020996446,0.0000069151133,0.000013710466,0.000062024796,0.00005431579,0.98663425,0.001148737,0.010508717,0.001249799,0.000009495802],"about_ca_topic_score_codex":0.0037074273,"about_ca_topic_score_gemma":0.0031427343,"teacher_disagreement_score":0.0052853483,"about_ca_system_score_codex":0.0013473174,"about_ca_system_score_gemma":0.0010529362,"threshold_uncertainty_score":0.017681241},"labels":[],"label_agreement":null},{"id":"W2015593095","doi":"10.1002/jgt.10079","title":"3‐colorability of 4‐regular hamiltonian graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Pancyclic graph; Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.02249071109048013,"score_gpt":0.2640508079551846,"score_spread":0.24156009686470448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015593095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9526653,0.00016985148,0.036916997,0.00042228607,0.00002911067,0.000054161774,0.0002230887,0.00013786025,0.009381223],"genre_scores_gemma":[0.9907012,0.000085739826,0.0066867,0.00007750839,0.000026503443,0.000033120457,0.00022514547,0.000040714083,0.0021234488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948055,0.00014278702,0.000021952068,0.000114266,0.00011473336,0.00012574668],"domain_scores_gemma":[0.9970074,0.0016025489,0.00053722964,0.00032642414,0.00022382445,0.00030254666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005861908,0.00043532276,0.00063301984,0.00094947487,0.0009575165,0.0019790235,0.0012320898,0.0010844747,0.0053027547],"category_scores_gemma":[0.0030153422,0.00050814636,0.0007755185,0.00065382494,0.0018184729,0.0022599064,0.0009927966,0.0009773071,0.00022017895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014617906,0.0003551767,0.015449761,0.00046847097,0.00021590611,0.0020487474,0.0020062288,0.20156115,0.052747164,0.663988,0.0058542155,0.053843487],"study_design_scores_gemma":[0.0001920583,0.00009341572,0.0028122948,0.00003611381,0.000065249886,0.0007544232,0.0005507923,0.23007388,0.016322616,0.7446772,0.0043728864,0.000049136666],"about_ca_topic_score_codex":0.0037478749,"about_ca_topic_score_gemma":0.0029780539,"teacher_disagreement_score":0.0053027547,"about_ca_system_score_codex":0.0010643131,"about_ca_system_score_gemma":0.000514896,"threshold_uncertainty_score":0.017739475},"labels":[],"label_agreement":null},{"id":"W2015635736","doi":"10.1016/s0012-365x(01)00073-5","title":"Homomorphisms to powers of digraphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Bishop's University","funders":"","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Chromatic scale; Discrete mathematics; Homomorphic encryption; Path (computing); Polynomial; Power (physics); Computer science; Encryption","score_opus":0.029800373251303396,"score_gpt":0.2820215675189948,"score_spread":0.2522211942676914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015635736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30392084,0.002111721,0.47117752,0.003052371,0.0012246714,0.0002730527,0.00094148534,0.0013634666,0.21593495],"genre_scores_gemma":[0.87804425,0.0020617102,0.059065495,0.0008664034,0.0010034959,0.00025379536,0.0005980233,0.0005620551,0.057544835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985207,0.00046622707,0.00011383881,0.00039415024,0.00026818115,0.00023695701],"domain_scores_gemma":[0.994558,0.0029564663,0.00042202626,0.0007325018,0.00043614762,0.0008947726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013323792,0.0008140889,0.00083327043,0.0031167634,0.0016002998,0.0032529398,0.0013158745,0.00077299366,0.012318636],"category_scores_gemma":[0.0057556443,0.0009696586,0.0013139779,0.0020596618,0.0037198882,0.008952962,0.003553078,0.003388846,0.0018464124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035287183,0.000036352394,0.00014450452,0.000044725643,0.000009962828,0.000117320786,0.00048032394,0.00046353083,0.00064675993,0.9883286,0.0012996604,0.008392895],"study_design_scores_gemma":[0.000014591538,0.000011582068,0.00008765433,0.0000096638805,0.0000073587535,0.00010855135,0.00007937281,0.0009773867,0.0003216899,0.99359494,0.004780958,0.000006256536],"about_ca_topic_score_codex":0.000493347,"about_ca_topic_score_gemma":0.0005836886,"teacher_disagreement_score":0.012318636,"about_ca_system_score_codex":0.0011434915,"about_ca_system_score_gemma":0.0003952203,"threshold_uncertainty_score":0.041209936},"labels":[],"label_agreement":null},{"id":"W2015784652","doi":"10.1016/j.disc.2009.05.007","title":"The firefighter problem for cubic graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Vertex (graph theory); Graph; Discrete mathematics; Time complexity","score_opus":0.02183635650630993,"score_gpt":0.30538479815737224,"score_spread":0.2835484416510623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015784652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51715714,0.003064744,0.3092707,0.022111647,0.0010830498,0.0005818178,0.0032927976,0.00078732404,0.14265081],"genre_scores_gemma":[0.78683436,0.0032091553,0.11504591,0.0014617539,0.0007256344,0.0003247284,0.0037605106,0.00051309454,0.08812491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991003,0.00022845322,0.000027694468,0.00020714317,0.00013408484,0.0003022735],"domain_scores_gemma":[0.99686545,0.0018863133,0.00024250026,0.0003214712,0.00019019202,0.0004940503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121996,0.00093809585,0.0017511761,0.000904645,0.0034191862,0.0034465312,0.0036279163,0.0047933925,0.02336435],"category_scores_gemma":[0.008272689,0.00090450404,0.001314575,0.0017352691,0.0024818482,0.006566482,0.0028399755,0.004750664,0.0018273471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011235558,0.00052982214,0.0020105976,0.0008556183,0.000094525945,0.00071459904,0.00094833254,0.1179171,0.0021978905,0.6807911,0.107949205,0.08486775],"study_design_scores_gemma":[0.00023657492,0.000089364185,0.0006224769,0.0001067678,0.00004159571,0.0003225668,0.0010659175,0.14203134,0.0013477809,0.8346056,0.019492323,0.000037827554],"about_ca_topic_score_codex":0.012606808,"about_ca_topic_score_gemma":0.010669731,"teacher_disagreement_score":0.02336435,"about_ca_system_score_codex":0.0024361196,"about_ca_system_score_gemma":0.0023383896,"threshold_uncertainty_score":0.07816148},"labels":[],"label_agreement":null},{"id":"W2015967296","doi":"10.1016/j.disopt.2005.08.008","title":"Berge’s theorem for the maximum charge problem","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Mathematics; Generalization; Combinatorics; Charge (physics); Graph; Matching (statistics); Discrete mathematics; Mathematical analysis; Statistics; Quantum mechanics; Physics","score_opus":0.011853492358565813,"score_gpt":0.2624375729190806,"score_spread":0.2505840805605148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015967296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022380486,0.006463703,0.61823255,0.025867408,0.0017276802,0.00014152344,0.0007357322,0.0003115726,0.32413927],"genre_scores_gemma":[0.6043118,0.012187117,0.21057191,0.0109692635,0.004367849,0.0010846809,0.0011186855,0.00110178,0.15428688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888545,0.0002933838,0.00004405513,0.00023480847,0.0003559097,0.00018634708],"domain_scores_gemma":[0.99722123,0.0019927842,0.000096630385,0.00020935657,0.00029717822,0.0001827964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025636565,0.0014897735,0.001894447,0.0023932185,0.0019560542,0.004400865,0.0030589201,0.0036958402,0.022513729],"category_scores_gemma":[0.011761908,0.0007632276,0.0018270515,0.002796119,0.003931021,0.009844839,0.0041295635,0.0076659364,0.0025141276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002111231,0.000020169364,0.000058285506,0.00008803292,0.000015079771,0.000021794434,0.000057481666,0.0025578002,0.0003641837,0.9812639,0.007171996,0.008360308],"study_design_scores_gemma":[0.000018266828,0.000005396663,0.00006664024,0.000015101721,0.000005825842,0.000030149584,0.000017346403,0.006274305,0.00015230205,0.9874325,0.0059742536,0.000007911871],"about_ca_topic_score_codex":0.0016001748,"about_ca_topic_score_gemma":0.0014241346,"teacher_disagreement_score":0.022513729,"about_ca_system_score_codex":0.0022044312,"about_ca_system_score_gemma":0.0012968824,"threshold_uncertainty_score":0.07531589},"labels":[],"label_agreement":null},{"id":"W2016857938","doi":"10.1016/j.disc.2011.05.032","title":"Cycles in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-traceable oriented graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of South Africa","keywords":"Combinatorics; Tournament; Digraph; Mathematics; Conjecture; Vertex (graph theory); Girth (graph theory); Order (exchange); Discrete mathematics; Graph","score_opus":0.025869409061803416,"score_gpt":0.2693643896109582,"score_spread":0.2434949805491548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016857938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013466315,0.0006971895,0.6179825,0.0025024316,0.0015569871,0.0004498021,0.061473567,0.05374988,0.24812128],"genre_scores_gemma":[0.16766652,0.0022659525,0.2989136,0.0020093797,0.00040817403,0.0010275609,0.11742755,0.03928576,0.3709955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995227,0.00007036813,0.00004927558,0.00011529651,0.00018042041,0.0000619024],"domain_scores_gemma":[0.9987293,0.00043228932,0.00010298152,0.00027517526,0.00038662346,0.00007370237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004058033,0.0007823891,0.00044840772,0.0017116341,0.000995837,0.003470331,0.0011186795,0.0008628096,0.10497823],"category_scores_gemma":[0.0030603718,0.00066004344,0.0006322827,0.002613469,0.00055138074,0.0037144402,0.0011719464,0.0015492818,0.029521106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021247071,0.00007502778,0.0006606379,0.0005342483,0.000024788538,0.0002932989,0.0008238356,0.0033616738,0.0053191893,0.53090364,0.34653184,0.11125938],"study_design_scores_gemma":[0.000036132184,0.0000147933915,0.00033828954,0.00012434572,0.000016941452,0.00013452623,0.0001285329,0.0060542524,0.009305155,0.13841712,0.8453934,0.000036565947],"about_ca_topic_score_codex":0.009049147,"about_ca_topic_score_gemma":0.010745899,"teacher_disagreement_score":0.10497823,"about_ca_system_score_codex":0.0013132566,"about_ca_system_score_gemma":0.0014235278,"threshold_uncertainty_score":0.35118717},"labels":[],"label_agreement":null},{"id":"W2016874427","doi":"10.1016/j.disc.2008.02.004","title":"Circle graphs and the cycle double cover conjecture","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Eulerian path; Graph; Cover (algebra); Discrete mathematics; Pure mathematics","score_opus":0.019056370746055845,"score_gpt":0.2714743867348818,"score_spread":0.25241801598882596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016874427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6909776,0.0038597542,0.049926806,0.019320372,0.0007254716,0.000061307066,0.00071931427,0.0006064198,0.233803],"genre_scores_gemma":[0.9811132,0.0013283823,0.0033722273,0.0007592629,0.00055003574,0.00004353895,0.00045797927,0.000081634134,0.012293668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992656,0.0001820227,0.000019510846,0.00016998239,0.00019483783,0.00016798745],"domain_scores_gemma":[0.9959313,0.002580682,0.0003793729,0.00051397947,0.00023318797,0.00036154216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006994705,0.0004658987,0.0009884335,0.001595044,0.0026034652,0.0036277734,0.0009240518,0.0029380973,0.01241348],"category_scores_gemma":[0.0057419813,0.0005319534,0.00058083166,0.0023395158,0.0032423045,0.00583347,0.0026193224,0.0026540137,0.0013438106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015317019,0.000027876014,0.0007621576,0.00007342082,0.000010061555,0.00014213927,0.0003754671,0.0031384735,0.0005533803,0.9793633,0.0070858924,0.008314812],"study_design_scores_gemma":[0.000029466006,0.00000954842,0.00034108016,0.000016046857,0.000008892301,0.000079440855,0.00014754827,0.005036405,0.0004268384,0.9883239,0.0055711893,0.000009725201],"about_ca_topic_score_codex":0.0022385984,"about_ca_topic_score_gemma":0.0013355974,"teacher_disagreement_score":0.01241348,"about_ca_system_score_codex":0.001686171,"about_ca_system_score_gemma":0.00056469545,"threshold_uncertainty_score":0.04152721},"labels":[],"label_agreement":null},{"id":"W2016898545","doi":"10.1007/s00453-010-9435-8","title":"Subgraphs of 4-Regular Planar Graphs","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Planar graph; Combinatorics; Outerplanar graph; Planar straight-line graph; Book embedding; Mathematics; Graph; Line graph; Discrete mathematics; Butterfly graph; Planar; Computer science; Voltage graph; 1-planar graph","score_opus":0.00926994731122339,"score_gpt":0.2584284739058766,"score_spread":0.2491585265946532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016898545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8662361,0.00065004017,0.081522375,0.0012442551,0.00006201416,0.00020054416,0.0017994329,0.00049197016,0.04779318],"genre_scores_gemma":[0.9195622,0.00081395684,0.05020904,0.0003357407,0.00007923787,0.00021358386,0.0052720914,0.00022379661,0.02329025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961,0.00008639952,0.000023803801,0.00010171462,0.000102286016,0.00007579188],"domain_scores_gemma":[0.9990011,0.00038815956,0.00024895038,0.00012942503,0.00011171114,0.000120736026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017929566,0.0004909638,0.00051237806,0.0012322658,0.00087254995,0.0014260284,0.0011493821,0.0006670074,0.00919464],"category_scores_gemma":[0.00168486,0.0006257431,0.0006513731,0.0014716114,0.0008059369,0.0020098477,0.0012335142,0.0008079946,0.0010939471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011278363,0.00035985984,0.0137087535,0.00090614083,0.00021745719,0.0019688825,0.0019838102,0.031869855,0.05212624,0.757519,0.020067334,0.118144885],"study_design_scores_gemma":[0.00015911502,0.0001090348,0.011612834,0.000076655306,0.00023721637,0.0015217036,0.0010511106,0.048254486,0.012376727,0.8975446,0.02702013,0.00003632794],"about_ca_topic_score_codex":0.0015713051,"about_ca_topic_score_gemma":0.0023995815,"teacher_disagreement_score":0.00919464,"about_ca_system_score_codex":0.000581336,"about_ca_system_score_gemma":0.00039463863,"threshold_uncertainty_score":0.030759156},"labels":[],"label_agreement":null},{"id":"W2017143580","doi":"10.1007/s10878-011-9386-2","title":"Some results on the injective chromatic number of graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Injective function; Combinatorics; Mathematics; Chromatic scale; Graph; Vertex (graph theory); Monomorphism; Edge coloring; Brooks' theorem; Discrete mathematics; Graph power; Line graph","score_opus":0.025532179805133403,"score_gpt":0.2815818603931285,"score_spread":0.2560496805879951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017143580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47467095,0.010564827,0.18436192,0.0078035854,0.0010284664,0.00014331262,0.0018358786,0.00063969044,0.3189514],"genre_scores_gemma":[0.93265337,0.0064127953,0.028216597,0.0010559817,0.0017585099,0.00019574593,0.0013909758,0.0004171324,0.027898822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988527,0.00027067008,0.000054970304,0.00030032222,0.0002934702,0.00022775085],"domain_scores_gemma":[0.98283964,0.012883525,0.0011497391,0.0010307502,0.00082643924,0.0012699174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024491595,0.0019463291,0.0011173477,0.0066134124,0.0022828877,0.0047099995,0.0037621043,0.0016155981,0.016074892],"category_scores_gemma":[0.013810696,0.0011312993,0.0016003919,0.0059804237,0.0057632867,0.008120798,0.0030572338,0.0052403477,0.0009495015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036765356,0.00017282064,0.0043389243,0.00051931856,0.000095562405,0.00017350317,0.00072240195,0.02737867,0.00386702,0.92163736,0.01005924,0.03066757],"study_design_scores_gemma":[0.00006587299,0.000073801835,0.0034701095,0.0001117351,0.00010925643,0.00017917497,0.00027713974,0.03713176,0.0019604082,0.94960314,0.006953128,0.00006449241],"about_ca_topic_score_codex":0.003317111,"about_ca_topic_score_gemma":0.0043407846,"teacher_disagreement_score":0.016074892,"about_ca_system_score_codex":0.0035511758,"about_ca_system_score_gemma":0.0012487188,"threshold_uncertainty_score":0.053775907},"labels":[],"label_agreement":null},{"id":"W2017360257","doi":"10.1016/j.tcs.2011.11.010","title":"On sum coloring and sum multi-coloring for restricted families of graphs","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy coloring; Complete coloring; Combinatorics; Graph coloring; Mathematics; Brooks' theorem; Fractional coloring; Edge coloring; List coloring; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.04880908630460297,"score_gpt":0.30058764518823616,"score_spread":0.2517785588836332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017360257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27983236,0.0055031558,0.6220978,0.0071199387,0.001186051,0.0001809949,0.00089151965,0.00064365624,0.08254446],"genre_scores_gemma":[0.800612,0.006665454,0.14077304,0.0022849836,0.0024021699,0.0004333721,0.0018473346,0.00102507,0.04395662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795854,0.0008320044,0.0000890475,0.00042216116,0.00036923986,0.00032895384],"domain_scores_gemma":[0.98623043,0.009938152,0.0007374456,0.0010923826,0.0008549021,0.0011465477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031337647,0.0017925603,0.0024277072,0.0029745416,0.0041637127,0.004494344,0.003669504,0.0023570086,0.010395381],"category_scores_gemma":[0.015677499,0.0016742471,0.0031689133,0.005666581,0.00471671,0.013729065,0.0055132494,0.0069481996,0.0010072773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022567225,0.00012298454,0.0011130649,0.00022850733,0.00005802988,0.00017262445,0.00079183374,0.016579987,0.0008913721,0.95025134,0.008897491,0.020667113],"study_design_scores_gemma":[0.000022640754,0.000022055516,0.00030539613,0.00003682142,0.00004101107,0.0001293755,0.00020925752,0.03371771,0.00021728688,0.96253467,0.00274088,0.000022844064],"about_ca_topic_score_codex":0.0049088215,"about_ca_topic_score_gemma":0.00567999,"teacher_disagreement_score":0.010395381,"about_ca_system_score_codex":0.0032006102,"about_ca_system_score_gemma":0.0015836066,"threshold_uncertainty_score":0.034776032},"labels":[],"label_agreement":null},{"id":"W2017923854","doi":"10.1016/j.disc.2014.10.002","title":"Cycle-maximal triangle-free graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Counterexample; Conjecture; Discrete mathematics; Homomorphism; Upper and lower bounds; Vertex (graph theory); Graph","score_opus":0.019972228845571226,"score_gpt":0.2811180102016201,"score_spread":0.2611457813560489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017923854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.605459,0.0010488693,0.16662976,0.0024779642,0.00023757054,0.00020850454,0.0020768414,0.0007946578,0.2210668],"genre_scores_gemma":[0.92566454,0.0010020781,0.030989993,0.000626407,0.0001450835,0.00015070247,0.002350411,0.00023184762,0.03883895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995697,0.000060453287,0.000021484193,0.00011774921,0.00011736679,0.00011327946],"domain_scores_gemma":[0.99792624,0.0008737033,0.00024938292,0.00022847742,0.00028842123,0.00043380682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003504924,0.0006095815,0.0006579621,0.0012532042,0.0017297255,0.0018105342,0.0017051713,0.0008365911,0.01766662],"category_scores_gemma":[0.0026896005,0.00064731744,0.0005320634,0.0019525486,0.0011774477,0.00294717,0.0016976893,0.0015127157,0.0016826303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031780385,0.00009340797,0.0013527127,0.00028195145,0.000036259516,0.00032964975,0.0007231847,0.0036870693,0.008947949,0.94764376,0.009416783,0.027169496],"study_design_scores_gemma":[0.00007712538,0.000034403318,0.00094534626,0.000037811973,0.00003949042,0.00027005625,0.00030856687,0.007786808,0.0034457152,0.97757643,0.00946274,0.000015564245],"about_ca_topic_score_codex":0.0025698338,"about_ca_topic_score_gemma":0.003996448,"teacher_disagreement_score":0.01766662,"about_ca_system_score_codex":0.0009790242,"about_ca_system_score_gemma":0.00067014643,"threshold_uncertainty_score":0.059100688},"labels":[],"label_agreement":null},{"id":"W2018074536","doi":"10.1017/s0963548301004965","title":"The Chromatic Number of Graph Powers","year":2002,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Mathematics; Graph; Combinatorics; Chromatic scale; Friendship graph; Windmill graph; Discrete mathematics; Graph power; Line graph","score_opus":0.028188386149385156,"score_gpt":0.28389335437364815,"score_spread":0.255704968224263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018074536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80776036,0.0015543096,0.06181247,0.0015480587,0.0001788091,0.000057504167,0.00067245244,0.00038652206,0.12602963],"genre_scores_gemma":[0.98670924,0.00045994384,0.0050791595,0.00006765596,0.00009753381,0.000034882778,0.00016436566,0.00007013771,0.0073172622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994313,0.00010597603,0.000020247668,0.00015388337,0.00013360736,0.00015498947],"domain_scores_gemma":[0.99652916,0.00211589,0.00030622593,0.00044359354,0.00027635437,0.0003288099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048610615,0.00031580852,0.00030988434,0.0016471321,0.0009808906,0.0027087193,0.00069750805,0.0005272326,0.00904639],"category_scores_gemma":[0.00562758,0.0003388518,0.00029178732,0.0012024621,0.0025934118,0.0030821927,0.0012086205,0.00092489476,0.00073279074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004297562,0.000035824887,0.004121155,0.00012778686,0.000025668853,0.00019067552,0.00043378037,0.036635406,0.010821796,0.90876865,0.0053642606,0.033045236],"study_design_scores_gemma":[0.000050232546,0.000057620462,0.002657763,0.000040383544,0.000027277227,0.00035161752,0.00020276563,0.074750535,0.0053771273,0.9057058,0.010733531,0.0000453066],"about_ca_topic_score_codex":0.0021926714,"about_ca_topic_score_gemma":0.0020571551,"teacher_disagreement_score":0.00904639,"about_ca_system_score_codex":0.0016608933,"about_ca_system_score_gemma":0.00058936636,"threshold_uncertainty_score":0.030263126},"labels":[],"label_agreement":null},{"id":"W2018084637","doi":"10.1016/j.ejc.2004.07.014","title":"Homomorphism bounded classes of graphs","year":2005,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Bounded function; Planar graph; Discrete mathematics; 1-planar graph; Graph; Class (philosophy); Chordal graph","score_opus":0.020602692775760423,"score_gpt":0.26433551195402494,"score_spread":0.2437328191782645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018084637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61154014,0.0019395975,0.17256348,0.004779199,0.00051471865,0.00012204357,0.00084376463,0.001277861,0.20641924],"genre_scores_gemma":[0.96210235,0.0005685586,0.010086784,0.00046305574,0.00031378926,0.000116757146,0.0006655611,0.0002070866,0.02547606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981433,0.000488242,0.000082111124,0.00050614536,0.00039941375,0.0003807756],"domain_scores_gemma":[0.9950105,0.0029468546,0.00026685258,0.00055730954,0.0003226245,0.00089586544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013123251,0.00087238004,0.001178973,0.0030472423,0.0029023602,0.0055334275,0.0021920914,0.0015901838,0.014161344],"category_scores_gemma":[0.005747802,0.00090811367,0.0012037525,0.002416635,0.0039204075,0.0103037525,0.005072013,0.004826267,0.0011178827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038635095,0.000025648707,0.00027344192,0.000021550744,0.0000064026376,0.000037746842,0.00030091582,0.00029536363,0.00040358547,0.99457586,0.00095585943,0.0030650692],"study_design_scores_gemma":[0.000021683385,0.000010078096,0.00037446138,0.000010350954,0.000011991696,0.00008154811,0.00010497933,0.0017812978,0.00034507195,0.99433595,0.0029128504,0.000009704016],"about_ca_topic_score_codex":0.0018770064,"about_ca_topic_score_gemma":0.0014441946,"teacher_disagreement_score":0.014161344,"about_ca_system_score_codex":0.0030832277,"about_ca_system_score_gemma":0.0007398366,"threshold_uncertainty_score":0.047374427},"labels":[],"label_agreement":null},{"id":"W2018251139","doi":"10.1016/s0012-365x(00)00083-2","title":"Forbidden minors to graphs with small feedback sets","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Constructive; Treewidth; Pathwidth; Minor (academic); Vertex (graph theory); Discrete mathematics; Chordal graph; 1-planar graph; Constructive proof; Robertson–Seymour theorem; Maximal independent set; Clique-sum; Indifference graph; Graph; Line graph; Computer science","score_opus":0.03692080333076946,"score_gpt":0.29245304638469843,"score_spread":0.25553224305392896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018251139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6587874,0.00070957263,0.29852504,0.0015594929,0.0004280548,0.00033883698,0.0008858407,0.0015389662,0.03722676],"genre_scores_gemma":[0.9293881,0.00043868157,0.045603186,0.00035685976,0.0003277094,0.00045213246,0.00070209533,0.00046687745,0.022264395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912864,0.00028696423,0.00004269681,0.00022096495,0.0001788226,0.00014199449],"domain_scores_gemma":[0.9937359,0.0034683396,0.0007904198,0.0006871331,0.0004791387,0.0008390121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006710335,0.0009767984,0.0009284862,0.0014885404,0.0019815124,0.0018975675,0.0015562115,0.0010821754,0.006348101],"category_scores_gemma":[0.0065175295,0.000941953,0.0010813881,0.00090798433,0.0018418771,0.002523142,0.0020720875,0.0025326237,0.0008167182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005853053,0.00020526786,0.0008408906,0.0002732577,0.000040525785,0.00037746763,0.0011180701,0.009738367,0.012486882,0.9479375,0.005449431,0.02094715],"study_design_scores_gemma":[0.00009990682,0.00009069411,0.00051179394,0.000027666421,0.000030439218,0.0003379021,0.00018486573,0.021793742,0.0032285892,0.9698266,0.0038466027,0.000021252188],"about_ca_topic_score_codex":0.0008231817,"about_ca_topic_score_gemma":0.0014667775,"teacher_disagreement_score":0.006348101,"about_ca_system_score_codex":0.0011251958,"about_ca_system_score_gemma":0.00072047167,"threshold_uncertainty_score":0.021236539},"labels":[],"label_agreement":null},{"id":"W2018547288","doi":"10.1002/jgt.10073","title":"Bi‐arc graphs and the complexity of list homomorphisms","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Homomorphism; Graph homomorphism; Discrete mathematics; Vertex (graph theory); Graph; Line graph; Graph power","score_opus":0.0487071365618233,"score_gpt":0.2748106614581519,"score_spread":0.22610352489632862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018547288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8097314,0.00091721286,0.16473724,0.0046226354,0.00009111419,0.00031194324,0.0045512607,0.0017889543,0.013248253],"genre_scores_gemma":[0.94536495,0.0005611283,0.047097504,0.0003034891,0.00011686728,0.0001951895,0.0031370409,0.00018090509,0.003042907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706984,0.00084733055,0.00023509265,0.00079563056,0.00052708556,0.0005249192],"domain_scores_gemma":[0.97248435,0.020844523,0.0021094782,0.0020266501,0.0012299668,0.0013050728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015426449,0.0006947857,0.0010469396,0.0016807561,0.0013400051,0.0046293447,0.0025508783,0.0018627535,0.0088619515],"category_scores_gemma":[0.012552986,0.00073397043,0.0013334088,0.0026627672,0.0020083457,0.0123412665,0.0025544746,0.0025606905,0.00066301203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022854067,0.0013443414,0.016613381,0.0022711079,0.00042940676,0.0009856003,0.0030151405,0.3876023,0.018068826,0.42181683,0.020319141,0.12524861],"study_design_scores_gemma":[0.00020989758,0.00013400406,0.0023608422,0.000066222914,0.00011262052,0.0004577214,0.00072342565,0.38876823,0.0053931996,0.5965469,0.0051470394,0.0000799785],"about_ca_topic_score_codex":0.0036584102,"about_ca_topic_score_gemma":0.002609501,"teacher_disagreement_score":0.0088619515,"about_ca_system_score_codex":0.0031774035,"about_ca_system_score_gemma":0.0017176414,"threshold_uncertainty_score":0.029646218},"labels":[],"label_agreement":null},{"id":"W2018558025","doi":"10.1016/j.tcs.2014.10.009","title":"Approximation algorithms for digraph width parameters","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Digraph; Pathwidth; Mathematics; Combinatorics; Bounded function; Discrete mathematics; Partial k-tree; Approximation algorithm; Directed graph; Algorithm; Graph","score_opus":0.022550280587743977,"score_gpt":0.29856726809895917,"score_spread":0.2760169875112152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018558025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050668128,0.0021480885,0.91494507,0.003288582,0.0003929959,0.00042050713,0.0022691009,0.006621303,0.019246276],"genre_scores_gemma":[0.32398292,0.0019099461,0.647743,0.0011925733,0.00049314275,0.00087684754,0.00492852,0.0026807003,0.01619236],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961599,0.0007585549,0.00023138202,0.0011913298,0.0009934724,0.00066543685],"domain_scores_gemma":[0.98361397,0.008919162,0.0007854702,0.0048530805,0.0009739207,0.00085441186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036354614,0.0037120518,0.003484661,0.0043386193,0.0020950024,0.008026169,0.008967317,0.004335119,0.023952456],"category_scores_gemma":[0.024980186,0.0024526455,0.0030539061,0.008850542,0.0021518809,0.021226356,0.0060775853,0.0106670745,0.005102795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017239294,0.001381704,0.0035804308,0.0010684041,0.0002688416,0.00014261699,0.00084507157,0.1991279,0.005457881,0.22915806,0.05142839,0.50581676],"study_design_scores_gemma":[0.00039121642,0.00011491162,0.0004740536,0.00013743326,0.00021182456,0.00020016187,0.0003241888,0.5242262,0.0036801135,0.46113494,0.009045859,0.000059154983],"about_ca_topic_score_codex":0.0045750192,"about_ca_topic_score_gemma":0.009072648,"teacher_disagreement_score":0.023952456,"about_ca_system_score_codex":0.007841838,"about_ca_system_score_gemma":0.0045668683,"threshold_uncertainty_score":0.08012897},"labels":[],"label_agreement":null},{"id":"W2019249538","doi":"10.1016/j.dam.2010.01.005","title":"An implicit representation of chordal comparability graphs in linear time","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Comparability; Chordal graph; Representation (politics); Interval graph; Discrete mathematics; Combinatorics; Graph; 1-planar graph","score_opus":0.02053967500338945,"score_gpt":0.3343552338514482,"score_spread":0.3138155588480588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019249538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050383873,0.0001773932,0.9192374,0.0005657604,0.00017756093,0.00015208015,0.0011679826,0.0014240391,0.026713917],"genre_scores_gemma":[0.64803195,0.0003529259,0.3280014,0.00021688771,0.00016748502,0.00028938,0.0021452233,0.00064085657,0.020153835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930644,0.00012749547,0.00005600951,0.00019969254,0.0001769026,0.00013351958],"domain_scores_gemma":[0.9981667,0.0006055352,0.00018428345,0.0005607481,0.00036086421,0.00012178371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005619145,0.00055235595,0.0005646217,0.00071075564,0.0007360135,0.0032236436,0.002103639,0.0008838713,0.018227713],"category_scores_gemma":[0.004510906,0.000335949,0.0006170662,0.0016832431,0.0009498455,0.005775825,0.0015640485,0.0020934767,0.0023066446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022369572,0.00009092157,0.00031638046,0.00018981841,0.000010718508,0.00009675265,0.00047167196,0.025275076,0.0036008547,0.908053,0.0033774585,0.058293685],"study_design_scores_gemma":[0.00005185723,0.00007978982,0.00016581341,0.000049220835,0.000027767263,0.00010210822,0.00022386169,0.16521555,0.0029901373,0.8079592,0.02310884,0.000025942702],"about_ca_topic_score_codex":0.001949007,"about_ca_topic_score_gemma":0.0028023645,"teacher_disagreement_score":0.018227713,"about_ca_system_score_codex":0.0011748575,"about_ca_system_score_gemma":0.0008303591,"threshold_uncertainty_score":0.060977817},"labels":[],"label_agreement":null},{"id":"W2019436781","doi":"10.1016/j.disc.2014.03.024","title":"Elimination schemes and lattices","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Chordal graph; Induced subgraph; Vertex (graph theory); Distributive property; Discrete mathematics; Graph; Pure mathematics","score_opus":0.020247368989053133,"score_gpt":0.3001867631316433,"score_spread":0.27993939414259017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019436781","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16806945,0.029549975,0.18664105,0.03273362,0.0021064598,0.00011061364,0.0010587294,0.00051936775,0.5792108],"genre_scores_gemma":[0.8648842,0.008009954,0.02735089,0.0021372957,0.0019705498,0.00016439872,0.0006763238,0.00017772401,0.09462861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988433,0.0004400639,0.000062463456,0.00020443629,0.0002836531,0.00016597474],"domain_scores_gemma":[0.9982603,0.0009838258,0.00015616046,0.00025118524,0.0002148202,0.00013380458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381003,0.0007863558,0.0010822038,0.0026221569,0.0040152636,0.0058430703,0.0012739004,0.0016591927,0.013553452],"category_scores_gemma":[0.0032607429,0.0008409847,0.00085266656,0.0042426726,0.008706296,0.011347578,0.003096279,0.0055243634,0.0017534323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005842047,0.0000043358878,0.000027144668,0.0000084911435,0.0000013017627,0.0000065334793,0.00010700324,0.000082359395,0.00003936564,0.9974656,0.00079794077,0.0014541583],"study_design_scores_gemma":[0.000004779786,0.0000015929648,0.000028501301,0.000004575302,0.0000016871129,0.000016957469,0.000040772495,0.00014022505,0.000034743367,0.9949537,0.0047699213,0.0000025919576],"about_ca_topic_score_codex":0.0016556445,"about_ca_topic_score_gemma":0.0014184383,"teacher_disagreement_score":0.013553452,"about_ca_system_score_codex":0.0027389978,"about_ca_system_score_gemma":0.0008416096,"threshold_uncertainty_score":0.045340776},"labels":[],"label_agreement":null},{"id":"W2020054908","doi":"10.1016/s0304-3975(00)00005-0","title":"Finding houses and holes in graphs","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Domino; Mathematics; Graph; Discrete mathematics; Chemistry","score_opus":0.023300947401377867,"score_gpt":0.30398486310987827,"score_spread":0.2806839157085004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020054908","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76732486,0.0016226048,0.20918305,0.0022803394,0.0001449183,0.00018758292,0.00129344,0.0006688683,0.01729442],"genre_scores_gemma":[0.8418662,0.0009879064,0.14236063,0.000341285,0.0001377361,0.000083845276,0.001898673,0.00024863795,0.0120752165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992823,0.000164024,0.000040745985,0.00023888804,0.00013277253,0.00014125007],"domain_scores_gemma":[0.9948832,0.0033722064,0.0005666594,0.0005597018,0.00025781684,0.00036041555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064000796,0.00082796393,0.0015334965,0.0019361352,0.0017495647,0.0021910185,0.001892161,0.0020585074,0.006733174],"category_scores_gemma":[0.00614866,0.001709522,0.0010475562,0.0023151734,0.002594226,0.008893655,0.002804764,0.0018827486,0.00087627885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019007329,0.00063410145,0.030099161,0.0017121375,0.0002628567,0.002256442,0.00503798,0.05453166,0.013701666,0.63946956,0.03553878,0.21485499],"study_design_scores_gemma":[0.00015476989,0.0001359259,0.003813829,0.00013308424,0.00014009455,0.00082056725,0.0022311318,0.06779892,0.0049031004,0.9087579,0.011071506,0.000039068636],"about_ca_topic_score_codex":0.0029266928,"about_ca_topic_score_gemma":0.0043340796,"teacher_disagreement_score":0.006733174,"about_ca_system_score_codex":0.000740586,"about_ca_system_score_gemma":0.00049875857,"threshold_uncertainty_score":0.022524714},"labels":[],"label_agreement":null},{"id":"W2020154454","doi":"10.1145/2556646","title":"Constraint Satisfaction Problems Solvable by Local Consistency Methods","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":175,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Narodowe Centrum Nauki; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Constraint satisfaction problem; Local consistency; Consistency (knowledge bases); Constraint (computer-aided design); Constraint satisfaction; Mathematics; Computer science; Weak consistency; Mathematical optimization; Discrete mathematics; Strong consistency; Statistics","score_opus":0.029095741414015133,"score_gpt":0.33548799274915386,"score_spread":0.30639225133513875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020154454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025459727,0.00032872448,0.9617592,0.00078569166,0.000053644937,0.000107035456,0.00022245645,0.0020610227,0.00922256],"genre_scores_gemma":[0.532428,0.00043733907,0.45519727,0.0006478455,0.0002827524,0.00082679145,0.0007962642,0.0007809419,0.008602746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916672,0.0031475227,0.0004053403,0.0018519157,0.0021216653,0.00080632535],"domain_scores_gemma":[0.96112096,0.026627177,0.0023311889,0.0073278914,0.0018567786,0.0007359929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051399986,0.0013999689,0.0015367585,0.0016541572,0.0017615367,0.003309875,0.005314791,0.0015670075,0.011354604],"category_scores_gemma":[0.027912838,0.0009093415,0.0021037003,0.0027445913,0.0036371478,0.008699419,0.0061801695,0.005770674,0.0018773815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005877318,0.00049977785,0.005716462,0.0014610456,0.0003466892,0.0005457805,0.0011487197,0.087576695,0.011814689,0.625686,0.014101275,0.25051513],"study_design_scores_gemma":[0.00019977007,0.00014443025,0.00053428166,0.00012215834,0.00017158272,0.00019339644,0.00021726805,0.48248124,0.01301857,0.49568242,0.007172257,0.0000626502],"about_ca_topic_score_codex":0.0019798242,"about_ca_topic_score_gemma":0.0029834132,"teacher_disagreement_score":0.011354604,"about_ca_system_score_codex":0.0013377138,"about_ca_system_score_gemma":0.0018016419,"threshold_uncertainty_score":0.037984908},"labels":[],"label_agreement":null},{"id":"W2020187144","doi":"","title":"A nearly linear time algorithm for the half integral disjoint paths packing","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Binary logarithm; Bounded function; Mathematics; Disjoint sets; Time complexity; Planar graph; Vertex (graph theory); Running time; Graph; Discrete mathematics; Algorithm","score_opus":0.034362486039546725,"score_gpt":0.294476237236862,"score_spread":0.2601137511973153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020187144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08236894,0.001123406,0.8813034,0.001321718,0.00021488348,0.00061339076,0.0019860354,0.010956623,0.02011159],"genre_scores_gemma":[0.23140083,0.000450377,0.7547995,0.0004032822,0.0001126983,0.00054179126,0.0040796553,0.000831749,0.007380194],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983895,0.00024353365,0.00010993013,0.00056847435,0.00029400317,0.00039457605],"domain_scores_gemma":[0.9986052,0.000604793,0.00011579778,0.00043981508,0.0001203085,0.0001139936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006834271,0.001677764,0.0016005017,0.0008965873,0.0010730451,0.0020902946,0.0029564996,0.0017134675,0.014204887],"category_scores_gemma":[0.0025800634,0.0007522065,0.001055837,0.00267805,0.0006452134,0.005485665,0.0025260262,0.0014213211,0.0036423283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020621007,0.000879591,0.0021275682,0.0011476668,0.00017186796,0.00041412492,0.0005939527,0.17536423,0.023199745,0.045727856,0.047799848,0.7005115],"study_design_scores_gemma":[0.00066529616,0.00044595875,0.0008413268,0.000056849112,0.00008526057,0.00057152624,0.00030102517,0.8654777,0.008604114,0.10357814,0.019308912,0.000063862644],"about_ca_topic_score_codex":0.0028706056,"about_ca_topic_score_gemma":0.0033583192,"teacher_disagreement_score":0.014204887,"about_ca_system_score_codex":0.0016436309,"about_ca_system_score_gemma":0.0022669556,"threshold_uncertainty_score":0.0475201},"labels":[],"label_agreement":null},{"id":"W2020320404","doi":"10.1016/j.disc.2010.05.028","title":"Maximum independent sets in 3- and 4-regular Hamiltonian graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Indifference graph; Maximal independent set; Hamiltonian path; Chordal graph; Hamiltonian path problem; Discrete mathematics; Hamiltonian (control theory); Pathwidth; Independent set; 1-planar graph; Planar graph; Graph; Line graph","score_opus":0.01348230672936073,"score_gpt":0.281595797223699,"score_spread":0.26811349049433825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020320404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8559695,0.0014950966,0.06978468,0.0022225978,0.0001627939,0.00012445435,0.0012734763,0.0003154452,0.068651944],"genre_scores_gemma":[0.9593093,0.00055326044,0.025109144,0.00032559832,0.0001537811,0.00014865368,0.0008271118,0.00012195067,0.013451244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921954,0.00022638163,0.000044515415,0.00014596208,0.00019790034,0.00016570807],"domain_scores_gemma":[0.9945479,0.0037394909,0.00066246075,0.00032519278,0.00019916931,0.00052573305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008574226,0.00068082614,0.0012600968,0.0023292247,0.0025074314,0.0035025466,0.0020899423,0.0017101959,0.008055565],"category_scores_gemma":[0.00462414,0.0013230621,0.0013119577,0.0020612678,0.0023545218,0.0036937934,0.0018479765,0.002351193,0.0006055451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042267508,0.00018113683,0.0020983897,0.00024971695,0.00009920009,0.00039785038,0.000991905,0.018504465,0.005383216,0.95016474,0.005020365,0.016486509],"study_design_scores_gemma":[0.00008840349,0.000028318038,0.002157877,0.000034887697,0.00005617526,0.00020936971,0.000285806,0.034452114,0.0017063807,0.958998,0.001958786,0.000023946015],"about_ca_topic_score_codex":0.0011921517,"about_ca_topic_score_gemma":0.0025212972,"teacher_disagreement_score":0.008055565,"about_ca_system_score_codex":0.0013869981,"about_ca_system_score_gemma":0.0007053195,"threshold_uncertainty_score":0.026948571},"labels":[],"label_agreement":null},{"id":"W2021090044","doi":"10.1155/jamds.2005.107","title":"Minmax strongly connected subgraphs with node penalties","year":2005,"lang":"lv","type":"article","venue":"Journal of Applied Mathematics and Decision Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Computer science","score_opus":0.03769871982691585,"score_gpt":0.31933893997815027,"score_spread":0.2816402201512344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021090044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035205662,0.0008926327,0.9280032,0.0030608512,0.00035758226,0.00047354246,0.0042991545,0.004974721,0.0227327],"genre_scores_gemma":[0.30126676,0.0008739308,0.64360553,0.0014785881,0.0004322248,0.000963614,0.009797502,0.002085388,0.03949644],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978787,0.0007251711,0.00008959737,0.00071463815,0.00035876123,0.00023317357],"domain_scores_gemma":[0.9954455,0.0019940268,0.0002777071,0.001369357,0.0005193865,0.00039412625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023794181,0.0021860995,0.0019941041,0.0012864224,0.0012659945,0.0024077615,0.0041180565,0.0020611433,0.020683808],"category_scores_gemma":[0.009800521,0.0010848591,0.0017625039,0.0023745887,0.0011811261,0.0069857882,0.0036619282,0.0026611798,0.0051260754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012459935,0.0006898126,0.00269479,0.0011433334,0.00027129395,0.00026821307,0.00035105468,0.26505432,0.0054972875,0.25408182,0.102119416,0.36658272],"study_design_scores_gemma":[0.00010803567,0.00023271145,0.0005631813,0.00007569696,0.00008983786,0.00018075875,0.00010271064,0.6186019,0.004294472,0.35071996,0.024997301,0.00003335547],"about_ca_topic_score_codex":0.002520911,"about_ca_topic_score_gemma":0.007849603,"teacher_disagreement_score":0.020683808,"about_ca_system_score_codex":0.0018134217,"about_ca_system_score_gemma":0.0026959018,"threshold_uncertainty_score":0.0691942},"labels":[],"label_agreement":null},{"id":"W2021388036","doi":"10.1155/2013/675057","title":"On the Topological and Uniform Structure of Diversities","year":2013,"lang":"en","type":"article","venue":"Journal of Function Spaces and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Topology (electrical circuits); Pure mathematics; Combinatorics","score_opus":0.015419962705169285,"score_gpt":0.253992109887509,"score_spread":0.23857214718233968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021388036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4374906,0.0013225583,0.49019352,0.0015338163,0.00008502494,0.00006192201,0.00032917922,0.00016156549,0.06882183],"genre_scores_gemma":[0.95827115,0.0008203615,0.029647602,0.00019820021,0.00014569752,0.000086194595,0.0002621153,0.000076862765,0.010491819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989484,0.00035710481,0.0000675406,0.0002225865,0.0002750619,0.00012930519],"domain_scores_gemma":[0.9951037,0.001813342,0.0006742058,0.00068846,0.00090323744,0.0008171459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001971402,0.00042028388,0.00047087262,0.0030247618,0.0017719073,0.002303916,0.00062396284,0.00069061125,0.003282529],"category_scores_gemma":[0.0068224915,0.0002943363,0.00053144485,0.0018848528,0.005956064,0.009347015,0.004560729,0.0015613062,0.00030476958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052516325,0.0000030695842,0.00039666038,0.000010174983,0.0000027084075,0.000039689232,0.00017347933,0.0011131212,0.00030319917,0.99530506,0.00011351843,0.002534021],"study_design_scores_gemma":[0.0000033362828,0.000036058806,0.0011848732,0.000025409014,0.0000062299478,0.00021269268,0.0003546425,0.0131542515,0.00077896635,0.9773118,0.0069157644,0.000015839953],"about_ca_topic_score_codex":0.0010180979,"about_ca_topic_score_gemma":0.00078989833,"teacher_disagreement_score":0.003282529,"about_ca_system_score_codex":0.001220329,"about_ca_system_score_gemma":0.00045978013,"threshold_uncertainty_score":0.0109811425},"labels":[],"label_agreement":null},{"id":"W2022480780","doi":"10.1016/j.disc.2012.12.018","title":"The bondage number of graphs on topological surfaces and Teschner’s conjecture","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Chordal graph; Pathwidth; Vertex (graph theory); 1-planar graph; Discrete mathematics; Indifference graph; Upper and lower bounds; Graph; Line graph","score_opus":0.01831219561700593,"score_gpt":0.3010492263508283,"score_spread":0.2827370307338224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022480780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8332858,0.0012650741,0.034177184,0.008508512,0.00046323103,0.000045507088,0.0004255438,0.00029659102,0.12153259],"genre_scores_gemma":[0.9831198,0.0006529297,0.0052164462,0.00040094354,0.00040552157,0.000063190375,0.0002768346,0.000084232895,0.009780181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913615,0.00023007087,0.000036058842,0.0001966846,0.00020197273,0.00019905031],"domain_scores_gemma":[0.9955682,0.0022556847,0.0006596083,0.0005375301,0.00028352844,0.0006954458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014541231,0.0007806802,0.0014896245,0.0028566062,0.0032749244,0.0040736743,0.0018950178,0.0033869927,0.01213588],"category_scores_gemma":[0.007687407,0.0007479136,0.0009290737,0.0024357673,0.004990633,0.009541925,0.003024792,0.003962221,0.001084979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009456891,0.000023783792,0.0006606537,0.000034832883,0.000008263095,0.000050229046,0.00024071046,0.0018272967,0.00052966486,0.99193525,0.001825621,0.0027691857],"study_design_scores_gemma":[0.000019227038,0.000011819053,0.0003733782,0.000009534528,0.000006084635,0.00003451401,0.00008361281,0.0037440087,0.00020764788,0.9944166,0.0010835316,0.000010014308],"about_ca_topic_score_codex":0.0016835645,"about_ca_topic_score_gemma":0.001303913,"teacher_disagreement_score":0.01213588,"about_ca_system_score_codex":0.0019710953,"about_ca_system_score_gemma":0.00064291956,"threshold_uncertainty_score":0.04059863},"labels":[],"label_agreement":null},{"id":"W2022616211","doi":"10.1016/j.jctb.2005.03.002","title":"Deeply asymmetric planar graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Planar graph; Outerplanar graph; Combinatorics; Mathematics; Graph; Book embedding; Planar; Planar straight-line graph; Automorphism; Simple (philosophy); Graph automorphism; Discrete mathematics; 1-planar graph; Line graph; Computer science; Pathwidth; Voltage graph; Computer graphics (images)","score_opus":0.011642004230155597,"score_gpt":0.26561462763841154,"score_spread":0.25397262340825594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022616211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55773324,0.0007164509,0.055581182,0.0037720914,0.00055868283,0.000100136465,0.0007643389,0.00043958542,0.3803343],"genre_scores_gemma":[0.94728625,0.0005319759,0.008119585,0.00068179134,0.00032388268,0.000050866867,0.00059779437,0.00018247265,0.0422254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995964,0.00007312616,0.000015439724,0.000079348785,0.00014146003,0.000094201074],"domain_scores_gemma":[0.99906844,0.00021041234,0.0001640236,0.00019712569,0.00015002224,0.00020996692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027405616,0.00060922746,0.0006316024,0.00136451,0.0014013702,0.002299292,0.0008106646,0.0012130557,0.015648643],"category_scores_gemma":[0.0020158035,0.00048827514,0.00038251316,0.0010849977,0.0013387314,0.0031317244,0.0023012212,0.0029592572,0.0020424256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003598139,0.000018665512,0.00023483139,0.000021581536,0.000005877824,0.00006297923,0.00008270193,0.0007291696,0.0013192045,0.98935217,0.0029155076,0.0052214153],"study_design_scores_gemma":[0.000011822987,0.00001086935,0.00030181484,0.000010962415,0.000010960691,0.00023800838,0.00009679766,0.0033752439,0.00064287457,0.9891907,0.0061021936,0.000007736907],"about_ca_topic_score_codex":0.00039020806,"about_ca_topic_score_gemma":0.00059815403,"teacher_disagreement_score":0.015648643,"about_ca_system_score_codex":0.00064455793,"about_ca_system_score_gemma":0.00034830646,"threshold_uncertainty_score":0.052349865},"labels":[],"label_agreement":null},{"id":"W2022623224","doi":"10.1016/s0012-365x(00)00213-2","title":"Hedetniemi's conjecture — a survey","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Product (mathematics); Chromatic scale; Discrete mathematics; Geometry","score_opus":0.039637011896771324,"score_gpt":0.3202211428898492,"score_spread":0.2805841309930779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022623224","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04966358,0.450541,0.086902924,0.09117876,0.010646842,0.00013475666,0.0014248872,0.00045149686,0.30905586],"genre_scores_gemma":[0.44200155,0.39999303,0.054868925,0.014981228,0.0200842,0.00021693898,0.004066049,0.0003143976,0.06347357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987005,0.00020660719,0.000077996054,0.00046523605,0.0003532905,0.00019636293],"domain_scores_gemma":[0.99591833,0.0025455186,0.00018714773,0.00056820386,0.00054193754,0.00023884159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028972314,0.0010776324,0.0017522166,0.0031048495,0.0027240084,0.0040127793,0.0024902686,0.0029263562,0.010793672],"category_scores_gemma":[0.0063646166,0.0007965561,0.0008163354,0.0059161116,0.0047675623,0.01233692,0.0032714924,0.005304838,0.0028600811],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013543309,0.00017606455,0.0025277005,0.0011138855,0.00006066689,0.00019703634,0.00027648473,0.0027683142,0.0004453896,0.7380047,0.04867749,0.20561682],"study_design_scores_gemma":[0.000049610593,0.00007097829,0.001785738,0.00041360094,0.00003895362,0.0004737862,0.00043743223,0.0047870157,0.0009963177,0.70958,0.28131226,0.000054304342],"about_ca_topic_score_codex":0.0023870799,"about_ca_topic_score_gemma":0.0018653042,"teacher_disagreement_score":0.010793672,"about_ca_system_score_codex":0.0028709238,"about_ca_system_score_gemma":0.002019376,"threshold_uncertainty_score":0.036108494},"labels":[],"label_agreement":null},{"id":"W2022783208","doi":"10.1016/j.jctb.2007.12.006","title":"Bisimplicial vertices in even-hole-free graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Induced subgraph; Vertex (graph theory); Graph; Neighbourhood (mathematics); Discrete mathematics; Graph power; Line graph","score_opus":0.0179379954215226,"score_gpt":0.2737250461514349,"score_spread":0.2557870507299123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022783208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92065895,0.00031560226,0.037654694,0.0006074462,0.00014171106,0.00005493495,0.0003425309,0.00033323406,0.039890904],"genre_scores_gemma":[0.9829113,0.00022044936,0.008194036,0.00017118732,0.000049913746,0.0000416456,0.00029017095,0.00012055805,0.008000749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957114,0.00007300042,0.000024862977,0.00009560239,0.00009880575,0.00013661511],"domain_scores_gemma":[0.9983347,0.00071521406,0.00026289318,0.00022035626,0.00013172161,0.00033511897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005277731,0.00067942287,0.00078828464,0.0017335155,0.002741535,0.003583948,0.0013981162,0.001213596,0.005537273],"category_scores_gemma":[0.0022119978,0.0008044741,0.0005228898,0.0015086232,0.0024436645,0.0042614588,0.0018065425,0.0018588745,0.000766589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036442824,0.000105006795,0.0028260795,0.000110621,0.000017907394,0.00054923893,0.0012887369,0.0020251034,0.006342941,0.9725046,0.0017049187,0.012160387],"study_design_scores_gemma":[0.000041506515,0.000020860878,0.00075632037,0.000022511653,0.000029605972,0.00016056525,0.00044357489,0.003370616,0.0019632704,0.99112624,0.0020495227,0.000015298385],"about_ca_topic_score_codex":0.0010979563,"about_ca_topic_score_gemma":0.002226622,"teacher_disagreement_score":0.005537273,"about_ca_system_score_codex":0.0007624149,"about_ca_system_score_gemma":0.0005094592,"threshold_uncertainty_score":0.018523991},"labels":[],"label_agreement":null},{"id":"W2022970434","doi":"10.1016/s0012-365x(03)00246-2","title":"Graph covers using t-colourable vertex sets","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Edge cover; Vertex cover; Clique graph; Vertex (graph theory); Graph; Discrete mathematics; Simplex graph; Cover (algebra); Clique; Line graph; Graph power","score_opus":0.038138243317135084,"score_gpt":0.31519214250982835,"score_spread":0.2770538991926933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022970434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56564504,0.0011487677,0.36598495,0.0011792708,0.0002875072,0.00020550562,0.00091410516,0.0016091818,0.06302561],"genre_scores_gemma":[0.90575117,0.000998293,0.075021595,0.0001885919,0.00015422412,0.00019133867,0.00061003456,0.00035206028,0.016732715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998885,0.00016046797,0.00006098762,0.00024235672,0.00032275898,0.00032847634],"domain_scores_gemma":[0.99620384,0.0022460665,0.0002822621,0.00064827764,0.0002275627,0.00039204178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005513458,0.0007041154,0.0009894246,0.0022693283,0.0016928181,0.00399426,0.0011935766,0.0013622722,0.008226896],"category_scores_gemma":[0.004195993,0.0009582333,0.0016251837,0.0025757083,0.0014806709,0.004491264,0.003152864,0.0014759122,0.0009277853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006962315,0.00011088225,0.0017197912,0.00032174712,0.000104379826,0.0008061403,0.00087608735,0.04472057,0.02067104,0.8694074,0.0054820073,0.05508374],"study_design_scores_gemma":[0.000105028885,0.00010203182,0.00125116,0.000083450606,0.00014480985,0.00081283855,0.00025704596,0.11879997,0.014446398,0.85283893,0.011113127,0.000045243585],"about_ca_topic_score_codex":0.0023682758,"about_ca_topic_score_gemma":0.0025196008,"teacher_disagreement_score":0.008226896,"about_ca_system_score_codex":0.0015415193,"about_ca_system_score_gemma":0.0006635,"threshold_uncertainty_score":0.02752173},"labels":[],"label_agreement":null},{"id":"W2023293538","doi":"10.1007/s00453-005-1185-7","title":"Book Embeddability of Series–Parallel Digraphs","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Embedding; Series (stratigraphy); Transitive relation; Discrete mathematics; Monotonic function; Set (abstract data type); Point (geometry); Computer science; Geometry","score_opus":0.00755424390658528,"score_gpt":0.2535625659565984,"score_spread":0.2460083220500131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023293538","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1621358,0.0039858543,0.17140177,0.0034366325,0.0034107943,0.000061424864,0.001392174,0.00141774,0.6527579],"genre_scores_gemma":[0.5520125,0.0030254452,0.032022502,0.0006042027,0.0017097277,0.00005716323,0.0017909533,0.0005797873,0.4081977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998832,0.000013408723,0.000004903643,0.00004783803,0.000038228765,0.000012453235],"domain_scores_gemma":[0.99959856,0.00017851523,0.000029818924,0.000079232654,0.000059411715,0.000054505268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000860575,0.00034777357,0.00034564067,0.00066736183,0.00068630226,0.0012236125,0.00040608252,0.00031345803,0.028900936],"category_scores_gemma":[0.00079683925,0.00033280253,0.00037522553,0.0014035058,0.0004318906,0.0019153375,0.00050820765,0.0012474968,0.0029881997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118518896,0.00006840807,0.0004500341,0.0002647839,0.00004123126,0.00028569525,0.00031593995,0.007617839,0.0069773947,0.8299655,0.056625832,0.097268835],"study_design_scores_gemma":[0.00002749104,0.000055810673,0.0007275826,0.00004589355,0.000044838293,0.00034966736,0.00012740587,0.007989347,0.0040189703,0.8185579,0.16803874,0.000016330347],"about_ca_topic_score_codex":0.0005499875,"about_ca_topic_score_gemma":0.0010400712,"teacher_disagreement_score":0.028900936,"about_ca_system_score_codex":0.000624748,"about_ca_system_score_gemma":0.0002397655,"threshold_uncertainty_score":0.09668332},"labels":[],"label_agreement":null},{"id":"W2024156610","doi":"10.1016/j.disc.2008.05.016","title":"On the complexity of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si15.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>H</mml:mi></mml:math>-colouring planar graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Planar graph; Scroll; Graph; Discrete mathematics; Planar; Algorithm; Computer science; Computer graphics (images); Theology","score_opus":0.040968302843498644,"score_gpt":0.2736410474955918,"score_spread":0.23267274465209317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024156610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43924916,0.0061774477,0.2839231,0.04678773,0.0008963458,0.00050285814,0.012011111,0.0015643958,0.20888783],"genre_scores_gemma":[0.85459393,0.004344634,0.08622764,0.0024975343,0.0019299512,0.000599017,0.009113037,0.0012678567,0.039426353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945056,0.0016312009,0.00035899534,0.0010813805,0.0016371794,0.00078559574],"domain_scores_gemma":[0.92967665,0.06000892,0.0024955203,0.0037208044,0.0021245647,0.0019735976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030659589,0.0013352412,0.0022275639,0.0027244487,0.0032976577,0.011160625,0.0044292337,0.0033205952,0.03016667],"category_scores_gemma":[0.034350835,0.0013146462,0.002558313,0.004683207,0.005067775,0.023871036,0.0064827297,0.0072954674,0.0030984476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073499983,0.00022074845,0.0051883115,0.00093098334,0.00019566239,0.0003993799,0.0012089231,0.04859475,0.002074366,0.84870267,0.04744077,0.044308413],"study_design_scores_gemma":[0.00006705324,0.000030116084,0.0011879646,0.000059036392,0.00006584567,0.00021921864,0.0001975062,0.0455013,0.0006996936,0.9471737,0.004761273,0.000037160924],"about_ca_topic_score_codex":0.0067830896,"about_ca_topic_score_gemma":0.008064017,"teacher_disagreement_score":0.03016667,"about_ca_system_score_codex":0.006494746,"about_ca_system_score_gemma":0.0026750853,"threshold_uncertainty_score":0.10091752},"labels":[],"label_agreement":null},{"id":"W2024656522","doi":"10.1007/s00453-012-9624-8","title":"3-Colouring AT-Free Graphs in Polynomial Time","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Indifference graph; Pathwidth; Interval graph; Combinatorics; Time complexity; Mathematics; Maximal independent set; Cograph; Theory of computation; Discrete mathematics; Split graph; Strong perfect graph theorem; Modular decomposition; Graph; Computer science; 1-planar graph; Line graph; Algorithm","score_opus":0.012299008694531984,"score_gpt":0.2583412557159052,"score_spread":0.24604224702137323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024656522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46708825,0.000974828,0.43211424,0.00713708,0.0006138701,0.0013538452,0.0056651635,0.009675722,0.07537707],"genre_scores_gemma":[0.6082127,0.0008005821,0.34078634,0.0015020552,0.00028668853,0.00075810927,0.007455922,0.0028339229,0.037363548],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745923,0.00046819545,0.0001424814,0.00059102254,0.000543818,0.0007953275],"domain_scores_gemma":[0.98892945,0.0070250123,0.0006341239,0.0020768659,0.0005269455,0.00080754206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014456111,0.0024156498,0.0024443655,0.0014484099,0.002760984,0.0054708803,0.0038258974,0.002785271,0.03406283],"category_scores_gemma":[0.007956152,0.0015150561,0.0040537934,0.003169037,0.0027564073,0.010196529,0.0055062203,0.0045516393,0.0064319563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036751498,0.0020177078,0.009107063,0.0030178616,0.0007631553,0.0011113104,0.0027513842,0.19204748,0.058578063,0.3027697,0.08138828,0.34277293],"study_design_scores_gemma":[0.00075594656,0.00022812861,0.002036908,0.00011652393,0.00050476665,0.000579333,0.00070219464,0.18112165,0.018059684,0.77895176,0.01686009,0.000082947445],"about_ca_topic_score_codex":0.0062192352,"about_ca_topic_score_gemma":0.013870385,"teacher_disagreement_score":0.03406283,"about_ca_system_score_codex":0.0034232587,"about_ca_system_score_gemma":0.0034220715,"threshold_uncertainty_score":0.113951504},"labels":[],"label_agreement":null},{"id":"W2024728183","doi":"10.1016/j.jctb.2006.07.001","title":"Homomorphisms and edge-colourings of planar graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Conjecture; Homomorphism; Mathematics; Planar graph; Graph; Discrete mathematics; Odd graph; 1-planar graph; Chordal graph","score_opus":0.007651886994791469,"score_gpt":0.23357519337335866,"score_spread":0.2259233063785672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024728183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8996384,0.00059054093,0.065586135,0.00081072253,0.00022177104,0.00008016167,0.00026526197,0.0003351908,0.032471843],"genre_scores_gemma":[0.96900743,0.00059766736,0.01784677,0.00021153218,0.00021903218,0.00006199718,0.00035790956,0.00010740303,0.011590278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991573,0.00019706709,0.000055604043,0.00025354038,0.00014605465,0.00019049262],"domain_scores_gemma":[0.99559695,0.002408807,0.00063184777,0.00041647148,0.00027774004,0.0006682349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086773257,0.0004960967,0.0005576066,0.0020359328,0.0017204195,0.0033457805,0.0014587583,0.0011555953,0.0056178835],"category_scores_gemma":[0.004658752,0.000905745,0.00082657696,0.0017851773,0.003046143,0.0049793534,0.0022257948,0.0024682893,0.00048694533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017501789,0.0001383517,0.0016417657,0.00008254245,0.000022785038,0.00027264413,0.0015207275,0.0018534153,0.004924404,0.9698186,0.0011664304,0.01838331],"study_design_scores_gemma":[0.000038651586,0.00004736929,0.0013174177,0.000014816687,0.000027887047,0.00026517423,0.00044279537,0.003477328,0.0016944121,0.98989886,0.0027515367,0.00002376278],"about_ca_topic_score_codex":0.0011501093,"about_ca_topic_score_gemma":0.0010561554,"teacher_disagreement_score":0.0056178835,"about_ca_system_score_codex":0.0010218751,"about_ca_system_score_gemma":0.00046649642,"threshold_uncertainty_score":0.018793702},"labels":[],"label_agreement":null},{"id":"W2025257509","doi":"10.1016/s0166-218x(01)00197-4","title":"Antidirected hamiltonian paths between specified vertices of a tournament","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Tournament; Mathematics; Vertex (graph theory); Hamiltonian path; Combinatorics; Hamiltonian path problem; Hamiltonian (control theory); Neighbourhood (mathematics); Discrete mathematics; Graph; Mathematical optimization; Mathematical analysis","score_opus":0.04023299807498762,"score_gpt":0.27597158219442364,"score_spread":0.23573858411943602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025257509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84481937,0.000093344024,0.12015587,0.00030091745,0.00015048441,0.00012103911,0.00038489525,0.00020485758,0.033769228],"genre_scores_gemma":[0.9459179,0.0000754293,0.043527447,0.00009961874,0.000017304257,0.00009136395,0.00033580372,0.00006010177,0.009874994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995115,0.00012653045,0.000029230843,0.0000990987,0.000101756414,0.00013198986],"domain_scores_gemma":[0.99851006,0.0005069425,0.00019881652,0.00015134833,0.0002014719,0.00043134822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044107207,0.00032488714,0.00037303826,0.0007627542,0.0019002759,0.0022569934,0.0011464844,0.0010742213,0.008424533],"category_scores_gemma":[0.0017687137,0.00037615674,0.00040740296,0.0007417123,0.00087810186,0.0010488353,0.0011058226,0.0008344905,0.0006440596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077816297,0.000332348,0.0063535557,0.00019603784,0.00011185793,0.0013216417,0.0009431666,0.020448493,0.02912845,0.8992944,0.0036798622,0.037412193],"study_design_scores_gemma":[0.00024299635,0.0003740821,0.0032708715,0.000058863134,0.000104190185,0.00072453904,0.0008228935,0.10949389,0.011819899,0.85876507,0.014255256,0.00006748054],"about_ca_topic_score_codex":0.00092534075,"about_ca_topic_score_gemma":0.0017640733,"teacher_disagreement_score":0.008424533,"about_ca_system_score_codex":0.0005512071,"about_ca_system_score_gemma":0.0005111285,"threshold_uncertainty_score":0.028182805},"labels":[],"label_agreement":null},{"id":"W2025282997","doi":"10.1016/j.dam.2004.01.001","title":"Stable skew partition problem","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Mathematics; Skew; Partition (number theory); Combinatorics; Computer science","score_opus":0.0208943018571142,"score_gpt":0.2776431011556697,"score_spread":0.2567487992985555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025282997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5126758,0.0012464294,0.23354588,0.0089037195,0.00079013925,0.00021491457,0.0015525268,0.0004328908,0.24063762],"genre_scores_gemma":[0.9099276,0.0007748454,0.024958925,0.00083905103,0.00067975256,0.00022044082,0.0015643444,0.00032018757,0.060714703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994636,0.00016023952,0.0000204505,0.00011594797,0.00013843489,0.00010128025],"domain_scores_gemma":[0.99876887,0.00058409956,0.00012512106,0.00015742474,0.00014496245,0.00021939042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008043529,0.0006896211,0.0014128112,0.0009531974,0.0019321183,0.0037003043,0.0013834271,0.0019578263,0.025049523],"category_scores_gemma":[0.0035393455,0.00047306382,0.0006710636,0.0012529722,0.0018988259,0.004704316,0.0026422737,0.0028723504,0.0018198859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009306918,0.000042692096,0.00014146858,0.0000503804,0.00001228208,0.00004214919,0.00010843587,0.0036223072,0.0004998683,0.9831323,0.0053148554,0.0069400677],"study_design_scores_gemma":[0.000028737588,0.0000109196735,0.00009685737,0.000008365828,0.000006863557,0.00003579092,0.00008124535,0.015161385,0.00033827865,0.98213655,0.002090121,0.0000048866546],"about_ca_topic_score_codex":0.0005828231,"about_ca_topic_score_gemma":0.0006238692,"teacher_disagreement_score":0.025049523,"about_ca_system_score_codex":0.001061798,"about_ca_system_score_gemma":0.0009647741,"threshold_uncertainty_score":0.083799064},"labels":[],"label_agreement":null},{"id":"W2026675463","doi":"10.1016/s0012-365x(02)00447-8","title":"Vertices contained in all or in no minimum total dominating set of a tree","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Vertex (graph theory); Graph; Tree (set theory); Discrete mathematics","score_opus":0.0440434861314269,"score_gpt":0.3371172881744353,"score_spread":0.2930738020430084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026675463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83401984,0.00080613355,0.13745324,0.0014703854,0.00014630718,0.00015299441,0.0032683148,0.00024337474,0.022439444],"genre_scores_gemma":[0.83269924,0.0009466763,0.1481112,0.00028243792,0.00011255366,0.00015813716,0.0047393125,0.00016474743,0.012785721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993536,0.00009843911,0.000060646285,0.00023056577,0.00014857257,0.00010825927],"domain_scores_gemma":[0.99739516,0.0012563142,0.00025905983,0.0003361191,0.00032462686,0.00042867794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005517798,0.00066115876,0.0012692611,0.00095877075,0.001807499,0.0027374274,0.0012978492,0.0009367119,0.0027876534],"category_scores_gemma":[0.0022041395,0.0006005298,0.00090239337,0.0014566691,0.00084446016,0.0027576748,0.0011665323,0.0010629091,0.0005010561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004842066,0.0009053092,0.026425524,0.004232066,0.0011220434,0.0026720853,0.005480426,0.117329225,0.25910968,0.3841548,0.018268531,0.17545824],"study_design_scores_gemma":[0.0002713251,0.00073995657,0.013296802,0.00027147375,0.0013479204,0.0055141724,0.0032247533,0.17710678,0.08423113,0.67051446,0.043388747,0.000092523296],"about_ca_topic_score_codex":0.0008968825,"about_ca_topic_score_gemma":0.0017034602,"teacher_disagreement_score":0.0027876534,"about_ca_system_score_codex":0.00071763265,"about_ca_system_score_gemma":0.00080147735,"threshold_uncertainty_score":0.0093256235},"labels":[],"label_agreement":null},{"id":"W2026680711","doi":"10.1142/s179383091100136x","title":"DIAMETER-CONSTRAINED STEINER TREES","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Bounded function; Gomory–Hu tree; Tree (set theory); k-minimum spanning tree; Connected dominating set; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; K-ary tree; Minimum spanning tree; Topology (electrical circuits); Tree structure; Computer science; Binary tree; Telecommunications","score_opus":0.034321574150032993,"score_gpt":0.28542185600936626,"score_spread":0.25110028185933325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026680711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11634204,0.00080625556,0.86865526,0.0004441048,0.00007544574,0.00018122741,0.0016964757,0.00049664953,0.011302576],"genre_scores_gemma":[0.5101765,0.0011444242,0.47904274,0.00014553434,0.00007250812,0.00023151607,0.002722628,0.00021642531,0.0062477426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954885,0.00010377477,0.00003401357,0.00012628468,0.00012011479,0.0000670478],"domain_scores_gemma":[0.99918336,0.00032294996,0.00015188775,0.00016549707,0.000097898104,0.000078458055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040858146,0.00065168145,0.00085456955,0.00067745475,0.000608784,0.0009969705,0.0013330678,0.00088831893,0.0039203353],"category_scores_gemma":[0.0031525807,0.00058452814,0.0006324403,0.0015648796,0.00035516662,0.0021971245,0.0013429226,0.000608654,0.000644753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060538534,0.00011066227,0.0019601705,0.000652555,0.000114039256,0.000529323,0.00032090337,0.6480113,0.026243655,0.15503447,0.0153662255,0.15105133],"study_design_scores_gemma":[0.00007053762,0.00016790598,0.0010331458,0.00007029345,0.000045394037,0.0006000488,0.00015452567,0.7753725,0.005434002,0.20389746,0.013124277,0.000029805875],"about_ca_topic_score_codex":0.0009288329,"about_ca_topic_score_gemma":0.0015307224,"teacher_disagreement_score":0.0039203353,"about_ca_system_score_codex":0.00066204654,"about_ca_system_score_gemma":0.0006062066,"threshold_uncertainty_score":0.01311487},"labels":[],"label_agreement":null},{"id":"W2026687552","doi":"10.1016/j.ejc.2014.04.008","title":"Universality of intervals of line graph order","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Mathematics; Combinatorics; Universality (dynamical systems); Line graph; Graph; Discrete mathematics; Physics","score_opus":0.02152212209297294,"score_gpt":0.26989417466615184,"score_spread":0.2483720525731789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026687552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7505735,0.00059613143,0.20544818,0.0005794845,0.00012361981,0.00005648609,0.00072725763,0.0012669587,0.040628314],"genre_scores_gemma":[0.9784143,0.00027450355,0.015966287,0.00013824576,0.00020468236,0.00006199933,0.0004840774,0.00023301368,0.004222871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977278,0.00035106347,0.00017276712,0.000817931,0.0004846617,0.000445714],"domain_scores_gemma":[0.98532957,0.007917439,0.0016013476,0.0021242488,0.0012164878,0.0018108771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012939963,0.00045179055,0.0014801712,0.003203395,0.0018963071,0.005420952,0.002254334,0.001136031,0.006202626],"category_scores_gemma":[0.010917337,0.00089377986,0.0012410862,0.002299806,0.003622558,0.0068704477,0.0023266731,0.0027672208,0.0006042859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015033038,0.00007398254,0.0024436868,0.0000743814,0.0000310221,0.00019773807,0.001210894,0.0017651571,0.0023267365,0.98066497,0.0007305673,0.010330524],"study_design_scores_gemma":[0.00005068708,0.000059749724,0.0017222312,0.00003559846,0.00004492584,0.00036363688,0.00038450988,0.0085825715,0.0017341571,0.98405784,0.002926658,0.000037502738],"about_ca_topic_score_codex":0.001418682,"about_ca_topic_score_gemma":0.0008284023,"teacher_disagreement_score":0.006202626,"about_ca_system_score_codex":0.0013943871,"about_ca_system_score_gemma":0.0006001316,"threshold_uncertainty_score":0.020749867},"labels":[],"label_agreement":null},{"id":"W2027444730","doi":"10.1016/j.dam.2009.06.001","title":"On the packing chromatic number of some lattices","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Vertex (graph theory); Wheel graph; Lattice (music); Integer (computer science); Graph; Planar graph; Set packing; Discrete mathematics; Set (abstract data type); Graph power; Computer science; Physics","score_opus":0.024180041491205256,"score_gpt":0.30785306982656063,"score_spread":0.28367302833535535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027444730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8313873,0.0012342768,0.058039904,0.004214991,0.00030336302,0.000057220506,0.0008291902,0.00031243108,0.103621304],"genre_scores_gemma":[0.96882266,0.0009122826,0.01797799,0.0003888395,0.00041607165,0.000097897304,0.00060351245,0.00018820685,0.010592469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911195,0.00024912957,0.000030687806,0.00018110634,0.0002258544,0.00020123666],"domain_scores_gemma":[0.99360245,0.0040451037,0.00079164875,0.00042801967,0.0003984162,0.0007343078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013624616,0.0008088247,0.00095452525,0.004144846,0.003042295,0.0041224356,0.0020736696,0.0015493606,0.0109785525],"category_scores_gemma":[0.0074743843,0.00080600986,0.0007031917,0.004317333,0.005526743,0.005146633,0.0019058454,0.003534628,0.00067785644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029636375,0.00007214914,0.001894987,0.000109039756,0.000028304117,0.00010807385,0.00047608334,0.018318309,0.0028968204,0.959562,0.005878043,0.010359863],"study_design_scores_gemma":[0.000047195852,0.000040454386,0.0018634583,0.00003924602,0.000028578268,0.000141748,0.00028362268,0.054870237,0.0013758426,0.93817043,0.0030966206,0.00004252237],"about_ca_topic_score_codex":0.0044546053,"about_ca_topic_score_gemma":0.0041094767,"teacher_disagreement_score":0.0109785525,"about_ca_system_score_codex":0.0036050912,"about_ca_system_score_gemma":0.0010581923,"threshold_uncertainty_score":0.036726892},"labels":[],"label_agreement":null},{"id":"W2027568724","doi":"10.1016/j.disc.2008.05.033","title":"Sweeping graphs with large clique number","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Clique; Enhanced Data Rates for GSM Evolution; Monotonic function; Clique number; Discrete mathematics; Upper and lower bounds; Clique-sum; Chordal graph; Graph; Computer science; 1-planar graph","score_opus":0.0245550563354613,"score_gpt":0.29721376348614753,"score_spread":0.27265870715068624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027568724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77369076,0.000582566,0.17582288,0.0020042607,0.00010673377,0.00017681973,0.0013059847,0.00082766364,0.045482375],"genre_scores_gemma":[0.9172217,0.0004928243,0.062398806,0.0003354849,0.00015723021,0.00016510255,0.0013213471,0.00032559692,0.017581875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999353,0.00016040893,0.000023294633,0.0001803595,0.00014809561,0.00013480222],"domain_scores_gemma":[0.9885344,0.008081029,0.0008179655,0.0011458424,0.00040323733,0.0010174845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007027324,0.0005309795,0.0009569205,0.0018747947,0.0016901586,0.002076303,0.0014937709,0.0016315557,0.011955318],"category_scores_gemma":[0.007140994,0.0010230186,0.00076883123,0.0023391687,0.0014913965,0.003445796,0.0018380781,0.001997263,0.0007313319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006849577,0.00024954093,0.005664793,0.0004050192,0.00016720504,0.0011613825,0.00074687746,0.06566279,0.022625513,0.84617025,0.012538502,0.043923087],"study_design_scores_gemma":[0.0001570869,0.00006706517,0.0031251176,0.000034106266,0.00007121357,0.00074327784,0.00034873732,0.16693258,0.00475243,0.8172266,0.0065099755,0.000031836655],"about_ca_topic_score_codex":0.0009808925,"about_ca_topic_score_gemma":0.001903309,"teacher_disagreement_score":0.011955318,"about_ca_system_score_codex":0.0006830902,"about_ca_system_score_gemma":0.0004539482,"threshold_uncertainty_score":0.039994538},"labels":[],"label_agreement":null},{"id":"W2027818420","doi":"10.1007/s00373-008-0806-8","title":"Paired Domination Vertex Critical Graphs","year":2008,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Domination analysis; Graph; Neighbourhood (mathematics); Upper and lower bounds; Discrete mathematics","score_opus":0.025413394764800368,"score_gpt":0.2717497073206486,"score_spread":0.24633631255584826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027818420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6696019,0.0008141309,0.124911875,0.0013559863,0.00037523158,0.00023311072,0.00060463714,0.000555044,0.20154808],"genre_scores_gemma":[0.95883286,0.00022299778,0.01565836,0.00030728002,0.00010759041,0.000113076516,0.00040249137,0.00008705287,0.024268303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996125,0.00008174096,0.000011807996,0.00008921781,0.000100195444,0.00010451857],"domain_scores_gemma":[0.9978382,0.0008590031,0.00020359737,0.0002265262,0.00038245314,0.0004901917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038729038,0.00044862813,0.0004944045,0.0021717078,0.0021861317,0.002176376,0.0009619403,0.0007874475,0.012605206],"category_scores_gemma":[0.002591842,0.0004681509,0.00030528544,0.0010773132,0.0012902158,0.0023633295,0.0017725739,0.0015871138,0.00074120593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010823662,0.000036735895,0.0010058362,0.00006462913,0.000015551694,0.00032453882,0.00026094567,0.0010916156,0.003582391,0.977776,0.0041889604,0.011544618],"study_design_scores_gemma":[0.00005724563,0.000034581877,0.0007129065,0.000043249365,0.000032878917,0.0006055384,0.00033897776,0.007858435,0.0047049588,0.9750636,0.010530098,0.000017353259],"about_ca_topic_score_codex":0.00045700764,"about_ca_topic_score_gemma":0.0008868864,"teacher_disagreement_score":0.012605206,"about_ca_system_score_codex":0.0008398464,"about_ca_system_score_gemma":0.00050529663,"threshold_uncertainty_score":0.042168677},"labels":[],"label_agreement":null},{"id":"W2027879769","doi":"10.1016/j.disc.2007.08.059","title":"Equitable coloring planar graphs with large girth","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Edge coloring; Discrete mathematics; Planar graph; Graph coloring; Graph; Line graph; Graph power","score_opus":0.023172484547257583,"score_gpt":0.2980767138213042,"score_spread":0.2749042292740466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027879769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59884715,0.00063886365,0.32183093,0.002494481,0.00021969812,0.00015693212,0.00073563197,0.0011310249,0.073945366],"genre_scores_gemma":[0.9076029,0.00060291623,0.07143916,0.0005917207,0.00018209488,0.00022911587,0.0008732843,0.0006480103,0.017830808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871814,0.00037497756,0.00005771961,0.0002543107,0.0003031071,0.0002917044],"domain_scores_gemma":[0.98954296,0.0058058742,0.00073925377,0.0023567695,0.0008716027,0.0006834451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092186785,0.0009020426,0.0012029192,0.0011466908,0.0019174517,0.0026613267,0.0021516576,0.0015724405,0.013048671],"category_scores_gemma":[0.008973921,0.0010629669,0.00059076364,0.0022138413,0.0016037128,0.0051135016,0.003673144,0.0028387224,0.0012407115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056165433,0.0002355824,0.0024120014,0.00033785758,0.000059125607,0.00043344157,0.0006507933,0.040162057,0.013634425,0.855968,0.009768718,0.07577628],"study_design_scores_gemma":[0.00009143192,0.000072311086,0.0008007219,0.000028132987,0.000056943856,0.00045246957,0.00030552532,0.044931307,0.0068039456,0.9395488,0.006885557,0.000022852837],"about_ca_topic_score_codex":0.00045111857,"about_ca_topic_score_gemma":0.001166304,"teacher_disagreement_score":0.013048671,"about_ca_system_score_codex":0.0012531099,"about_ca_system_score_gemma":0.0007066483,"threshold_uncertainty_score":0.043652177},"labels":[],"label_agreement":null},{"id":"W2027949548","doi":"10.1155/ijmms.2005.863","title":"A degree condition for the existence of <i>k</i>‐factors with prescribed properties","year":2005,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Algorithm; Artificial intelligence; Mathematics; Computer science","score_opus":0.10370997729914164,"score_gpt":0.3398088615019204,"score_spread":0.23609888420277877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027949548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.778598,0.00074921775,0.15236935,0.001599931,0.00024076895,0.00015690055,0.0014156068,0.00069400435,0.06417624],"genre_scores_gemma":[0.9678935,0.00023409698,0.027807906,0.00022954482,0.0001037893,0.00011694288,0.00056038605,0.00014176253,0.00291208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876606,0.00012786842,0.0001263575,0.00036679403,0.00017412125,0.000438915],"domain_scores_gemma":[0.99014777,0.005423399,0.0010192588,0.0011054256,0.0011432108,0.0011610345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010068829,0.00057798874,0.0007234301,0.00085353106,0.0014325859,0.0018885793,0.0007455983,0.0013863326,0.0052576596],"category_scores_gemma":[0.009639041,0.0006272425,0.0009663445,0.00077858666,0.0024117737,0.002994843,0.0014937381,0.0012804436,0.0013725327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046245884,0.00038302512,0.035412826,0.00096523046,0.0001563765,0.0026082606,0.0021719353,0.021595048,0.1740158,0.6799288,0.011678515,0.0664596],"study_design_scores_gemma":[0.0011334652,0.001280831,0.024755152,0.00029052803,0.0002177451,0.008018401,0.0017980144,0.0615662,0.14638105,0.69982886,0.05433367,0.00039610564],"about_ca_topic_score_codex":0.0010363893,"about_ca_topic_score_gemma":0.00096140744,"teacher_disagreement_score":0.0052576596,"about_ca_system_score_codex":0.00081088865,"about_ca_system_score_gemma":0.00080953026,"threshold_uncertainty_score":0.017588675},"labels":[],"label_agreement":null},{"id":"W2027966825","doi":"10.1016/j.ejc.2013.10.007","title":"Semilattice polymorphisms and chordal graphs","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semilattice; Chordal graph; Mathematics; Combinatorics; Indifference graph; Discrete mathematics; Graph","score_opus":0.013216061297907762,"score_gpt":0.234110532029467,"score_spread":0.22089447073155924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027966825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6723989,0.0017515415,0.20181884,0.0053891465,0.0006098825,0.0000880693,0.00070665684,0.00045981022,0.11677706],"genre_scores_gemma":[0.94449574,0.0007452648,0.033448044,0.00032592943,0.00028753435,0.000067757646,0.00040273735,0.00011497399,0.020111922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890816,0.00029575193,0.00007890867,0.00023634467,0.00028233635,0.00019847421],"domain_scores_gemma":[0.9963903,0.0019577488,0.00036561003,0.00044302526,0.0003215997,0.00052161666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009931552,0.0003395427,0.00077873544,0.0011448027,0.0024938413,0.0042313645,0.0013691155,0.001036689,0.0067290864],"category_scores_gemma":[0.0036687215,0.00054794207,0.00062074023,0.0018232898,0.0039498,0.0057693967,0.0027904238,0.003432369,0.0009985518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006241657,0.000023719118,0.0003926472,0.000032101147,0.000004937107,0.00013476502,0.000454403,0.00046853253,0.0012403167,0.9897815,0.00066823524,0.0067364364],"study_design_scores_gemma":[0.000024017972,0.000011128077,0.00015739606,0.000008598971,0.0000052566966,0.00014528533,0.0002607433,0.0008874959,0.0002736781,0.9946491,0.00356778,0.0000095635605],"about_ca_topic_score_codex":0.0015037976,"about_ca_topic_score_gemma":0.002202918,"teacher_disagreement_score":0.0067290864,"about_ca_system_score_codex":0.001520486,"about_ca_system_score_gemma":0.00093164877,"threshold_uncertainty_score":0.022511065},"labels":[],"label_agreement":null},{"id":"W2028416100","doi":"10.1016/j.dam.2007.03.028","title":"On the restricted homomorphism problem","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Mathematics; Digraph; Combinatorics; Conjecture; Bipartite graph; Algebra homomorphism; Graph homomorphism; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.03203550194932333,"score_gpt":0.26153920296882865,"score_spread":0.22950370101950532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028416100","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28220657,0.0035677366,0.29965058,0.034232326,0.0012869262,0.00014894774,0.00073214417,0.00063478015,0.37754002],"genre_scores_gemma":[0.8782187,0.0026549348,0.043468796,0.0030507096,0.001986068,0.00028640087,0.0014766034,0.0003478825,0.06850986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853575,0.00067835144,0.000048898877,0.00029622758,0.00023357158,0.000207228],"domain_scores_gemma":[0.99567884,0.0030203445,0.00021224396,0.0004626626,0.00023759637,0.00038834673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001809222,0.00076993724,0.0015591282,0.001163736,0.002087674,0.0034198654,0.0023913602,0.0026698732,0.019037057],"category_scores_gemma":[0.008720951,0.00060463964,0.0009422326,0.0018448726,0.003988505,0.011509116,0.0051046913,0.006639625,0.0019972392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000606834,0.000048345006,0.00014328143,0.00006499863,0.0000139030735,0.00005081737,0.00013294732,0.0012084155,0.00018657041,0.9860643,0.004899089,0.007126705],"study_design_scores_gemma":[0.000019170397,0.000005643455,0.000061313505,0.0000075532243,0.00000452381,0.00003838746,0.00005546953,0.0033684617,0.000070600094,0.9947271,0.0016369749,0.000004724069],"about_ca_topic_score_codex":0.001024179,"about_ca_topic_score_gemma":0.0006262079,"teacher_disagreement_score":0.019037057,"about_ca_system_score_codex":0.0011921143,"about_ca_system_score_gemma":0.0008776208,"threshold_uncertainty_score":0.06368536},"labels":[],"label_agreement":null},{"id":"W2028544177","doi":"10.1016/j.disc.2009.08.013","title":"Absolute retracts and varieties generated by chordal graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Mathematics; Chordal graph; Treewidth; Combinatorics; Discrete mathematics; Interval graph; Indifference graph; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.013144400365500943,"score_gpt":0.27025405220967247,"score_spread":0.2571096518441715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028544177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7788654,0.0021316805,0.089096084,0.0017835239,0.00051044853,0.00007366697,0.0003740372,0.00047157067,0.12669359],"genre_scores_gemma":[0.9670036,0.0005982897,0.006682745,0.00016982123,0.00025100823,0.000036469395,0.00026868173,0.00010690918,0.024882555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990834,0.00015878933,0.000050801227,0.00023197856,0.00028396354,0.00019109424],"domain_scores_gemma":[0.9982206,0.000764208,0.00024485117,0.00019671174,0.00017346677,0.00040006268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007713902,0.0006071615,0.0008446022,0.0027292038,0.0031177327,0.004209859,0.001495854,0.00090976176,0.008597044],"category_scores_gemma":[0.0028388817,0.0006399671,0.0008760402,0.002279058,0.004024475,0.006498538,0.0036835542,0.003333385,0.0008739762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051129125,0.000016113538,0.00027597582,0.000019979821,0.0000066538746,0.000107104985,0.000588498,0.000521442,0.00051452086,0.9943719,0.00043821378,0.003088393],"study_design_scores_gemma":[0.00002860343,0.000021958846,0.00045645447,0.000010976936,0.000013213238,0.00015026309,0.00039886168,0.0015608792,0.00046552246,0.9923361,0.004542699,0.000014488851],"about_ca_topic_score_codex":0.001416348,"about_ca_topic_score_gemma":0.0014551233,"teacher_disagreement_score":0.008597044,"about_ca_system_score_codex":0.0017921976,"about_ca_system_score_gemma":0.0004955456,"threshold_uncertainty_score":0.028759956},"labels":[],"label_agreement":null},{"id":"W2028556486","doi":"10.1007/s00224-011-9333-8","title":"The Complexity of the List Homomorphism Problem for Graphs","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Concordia University; McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Constraint satisfaction problem; Homomorphism; Combinatorics; Mathematics; Algebraic number; Discrete mathematics; Computational complexity theory; Graph; Computer science; Algorithm","score_opus":0.09207204870786918,"score_gpt":0.28761644459718155,"score_spread":0.19554439588931238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028556486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56505114,0.0052973717,0.28721857,0.049279455,0.00085116335,0.00035000083,0.006727438,0.0020325615,0.08319226],"genre_scores_gemma":[0.9281599,0.0024700805,0.043677866,0.0015956238,0.0015700496,0.00032336987,0.004295817,0.00071259076,0.017194746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99431133,0.0019678269,0.00026258064,0.0010990624,0.0013112221,0.0010480927],"domain_scores_gemma":[0.94017786,0.051180977,0.0020679245,0.003156691,0.0015319274,0.0018846695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032773411,0.0011743719,0.0027820824,0.0019825369,0.0033450015,0.011169691,0.0056403736,0.00473228,0.021550337],"category_scores_gemma":[0.035728917,0.0014219494,0.0020941205,0.004488461,0.0046464326,0.032872356,0.004825827,0.0076513276,0.002158305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018316942,0.0007348203,0.005048492,0.0012566223,0.00021924586,0.0004312247,0.0016826934,0.092438884,0.0029897366,0.78068304,0.05098648,0.061697032],"study_design_scores_gemma":[0.00012792744,0.00003601535,0.00057714013,0.000034832647,0.00005519955,0.00014684812,0.0002545954,0.08144329,0.00070045935,0.91454506,0.0020392588,0.000039340874],"about_ca_topic_score_codex":0.0054267636,"about_ca_topic_score_gemma":0.004683965,"teacher_disagreement_score":0.021550337,"about_ca_system_score_codex":0.0053049135,"about_ca_system_score_gemma":0.0040263827,"threshold_uncertainty_score":0.07209301},"labels":[],"label_agreement":null},{"id":"W2028666977","doi":"10.1016/j.disc.2009.11.002","title":"Balanced Cayley graphs and balanced planar graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Cayley graph; Chordal graph; Indifference graph; Discrete mathematics; Pathwidth; Clique-sum; Planar graph; 1-planar graph; Graph; Line graph","score_opus":0.016906704231970684,"score_gpt":0.28275048225219723,"score_spread":0.2658437780202266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028666977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5561361,0.006539096,0.23825496,0.0047479616,0.0007274041,0.00014190732,0.0017330995,0.00054000923,0.19117945],"genre_scores_gemma":[0.9204467,0.0045395084,0.03324898,0.0008943277,0.00044385158,0.00011617173,0.0019123007,0.000115628245,0.03828254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972016,0.000052082683,0.000012345923,0.00008177362,0.0000716704,0.00006200391],"domain_scores_gemma":[0.99907315,0.0003088269,0.00022119241,0.0000959647,0.00015511013,0.00014579964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028212013,0.000622474,0.0004878457,0.0016649805,0.0011162929,0.0024028348,0.00077053916,0.0009059332,0.01076301],"category_scores_gemma":[0.0020455858,0.00048275723,0.00033177107,0.0028791202,0.0008586694,0.0031041896,0.0008732832,0.0015007635,0.0011603284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007811759,0.000024243333,0.00050317234,0.00006928687,0.000014432727,0.00010060301,0.00016795438,0.0026898507,0.0030326198,0.9672481,0.004470153,0.02160158],"study_design_scores_gemma":[0.000030114796,0.000012536272,0.0004189062,0.000014587195,0.000018960302,0.00009982466,0.00016258852,0.0052478258,0.00079716026,0.9827948,0.010393169,0.000009475246],"about_ca_topic_score_codex":0.0024602485,"about_ca_topic_score_gemma":0.0034977666,"teacher_disagreement_score":0.01076301,"about_ca_system_score_codex":0.0010121405,"about_ca_system_score_gemma":0.00043976182,"threshold_uncertainty_score":0.036005914},"labels":[],"label_agreement":null},{"id":"W2028766875","doi":"10.1016/j.dam.2014.10.017","title":"On triangulating <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-outerplanar graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Outerplanar graph; Graph; Discrete mathematics; Geometry; Pathwidth; Line graph","score_opus":0.017658212282446108,"score_gpt":0.2632708256364772,"score_spread":0.2456126133540311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028766875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03967202,0.0012166924,0.82905066,0.0013711078,0.0006627106,0.0002160651,0.0013260621,0.0011860303,0.12529859],"genre_scores_gemma":[0.3068716,0.0040006745,0.5778398,0.001158391,0.00064819644,0.00038596135,0.0073608863,0.0034638424,0.09827083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989273,0.00031204728,0.000054703603,0.00019702793,0.00035964203,0.00014936752],"domain_scores_gemma":[0.99707913,0.0015860416,0.00015302918,0.0005946,0.0004351778,0.00015215998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011456962,0.00075876655,0.00092089345,0.00194133,0.0019466616,0.002218584,0.002601428,0.0010557551,0.03380591],"category_scores_gemma":[0.0066628535,0.00072682305,0.0014450599,0.0023191432,0.0021757144,0.0056806905,0.0055974633,0.003031123,0.006199473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009284731,0.00004800415,0.00060010114,0.0002483053,0.000030765874,0.00018963098,0.00058328244,0.022353584,0.0014651584,0.85790265,0.02699285,0.08949293],"study_design_scores_gemma":[0.000017351535,0.00002019724,0.00027643066,0.00008389945,0.000017899309,0.00008974825,0.00029142955,0.030689823,0.0010107363,0.94496655,0.022513654,0.00002229845],"about_ca_topic_score_codex":0.008395095,"about_ca_topic_score_gemma":0.020363878,"teacher_disagreement_score":0.03380591,"about_ca_system_score_codex":0.001376642,"about_ca_system_score_gemma":0.000854291,"threshold_uncertainty_score":0.113092005},"labels":[],"label_agreement":null},{"id":"W2028813890","doi":"10.1016/j.disc.2004.12.005","title":"Disjoint paths in arborescences","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Disjoint sets; Vertex (graph theory); Arc (geometry); Directed graph; Discrete mathematics; Tree (set theory); Graph","score_opus":0.021412973483374637,"score_gpt":0.30044547099507074,"score_spread":0.2790324975116961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028813890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7670091,0.0013584606,0.15841158,0.0016897515,0.00018491411,0.00017107079,0.001372888,0.00045839415,0.069343925],"genre_scores_gemma":[0.86853844,0.0018137239,0.09132009,0.00043947157,0.00017444017,0.0003058876,0.0023660269,0.00029804328,0.034743886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993358,0.00013413346,0.000051771825,0.00020884967,0.0001622645,0.00010709605],"domain_scores_gemma":[0.9944563,0.0035436265,0.00063318596,0.00031633873,0.0004040412,0.00064656115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057427795,0.0007076036,0.0007741374,0.0024149113,0.0021097069,0.002790294,0.00127036,0.0013089542,0.012046751],"category_scores_gemma":[0.005509901,0.0010876594,0.0007716626,0.002859952,0.0018185126,0.0050224056,0.002522049,0.0024878273,0.0010589054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019682561,0.000081928396,0.0023056772,0.0003113611,0.00006310536,0.00075040926,0.001310505,0.005682498,0.0041989502,0.9530255,0.00429399,0.027779251],"study_design_scores_gemma":[0.000056540237,0.000036012512,0.0011748578,0.00006518313,0.000051787298,0.00066191435,0.0004857102,0.009842642,0.0010477466,0.97570634,0.010857073,0.0000142094505],"about_ca_topic_score_codex":0.0010605742,"about_ca_topic_score_gemma":0.002347916,"teacher_disagreement_score":0.012046751,"about_ca_system_score_codex":0.0009396332,"about_ca_system_score_gemma":0.000406983,"threshold_uncertainty_score":0.04030043},"labels":[],"label_agreement":null},{"id":"W2028974574","doi":"10.1016/j.dam.2008.08.003","title":"Tree-width of graphs without a 3×3 grid minor","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Minor (academic); Combinatorics; Grid; Tree (set theory); Treewidth; Discrete mathematics; Graph; Pathwidth; Line graph; Geometry; Humanities","score_opus":0.02752094913056216,"score_gpt":0.27632646765058766,"score_spread":0.2488055185200255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028974574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92077965,0.00034508045,0.055956777,0.00052394735,0.000053954445,0.000056553537,0.0012155663,0.0005219014,0.020546548],"genre_scores_gemma":[0.9657227,0.00019224375,0.027748708,0.00013998654,0.000043933727,0.00008861342,0.00088347786,0.0002758059,0.0049046404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957424,0.000079611935,0.000031922358,0.000116176205,0.00006491686,0.000133031],"domain_scores_gemma":[0.9961039,0.0017735983,0.000670436,0.00047937848,0.00030461565,0.00066818245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006765917,0.0005391275,0.00089594466,0.0009217216,0.0011111218,0.0024625794,0.001635989,0.0010181682,0.00862064],"category_scores_gemma":[0.0042346707,0.00064566004,0.0006791147,0.0010409674,0.00105789,0.0029322908,0.001332378,0.0011587186,0.00096488715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003050055,0.000355483,0.013297969,0.00070749986,0.00015075233,0.0012416057,0.0023045011,0.03870817,0.052284855,0.82740617,0.0134570245,0.047035903],"study_design_scores_gemma":[0.00025983618,0.0002441925,0.007482134,0.00008638904,0.00014445272,0.0014418579,0.0011803856,0.095778815,0.013342379,0.87308747,0.0068934364,0.00005871774],"about_ca_topic_score_codex":0.001280076,"about_ca_topic_score_gemma":0.0016300573,"teacher_disagreement_score":0.00862064,"about_ca_system_score_codex":0.0005949708,"about_ca_system_score_gemma":0.00057788845,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2029352747","doi":"10.1016/j.disc.2007.12.088","title":"On the complexity of crossings in permutations","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Permutation (music); Minification; Discrete mathematics; Rank (graph theory); Complete bipartite graph; Monochromatic color; Graph; Mathematical optimization","score_opus":0.10620018999446688,"score_gpt":0.3393784880129924,"score_spread":0.23317829801852552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029352747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76758116,0.0024556855,0.12792537,0.009480047,0.0003899892,0.00015719669,0.0018128384,0.00047092827,0.08972682],"genre_scores_gemma":[0.9642897,0.0016771957,0.019439999,0.00042987254,0.0005592678,0.00011567689,0.0011646854,0.00022463698,0.01209891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674547,0.00084609416,0.00019384592,0.0005323602,0.0011420338,0.0005403161],"domain_scores_gemma":[0.9530837,0.038077805,0.0026597178,0.0031099417,0.0012975347,0.0017712876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026068785,0.0010577887,0.0021588616,0.0036823608,0.0027074188,0.008707531,0.0033836383,0.0035836077,0.01651454],"category_scores_gemma":[0.028606217,0.0011577306,0.0018224934,0.005691131,0.005555164,0.022534288,0.004660024,0.006013441,0.0010975223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038294843,0.00014042575,0.0037052515,0.00024107727,0.00005775716,0.00022148712,0.00068181596,0.037192676,0.0010443006,0.9288466,0.005627185,0.021858552],"study_design_scores_gemma":[0.00003269109,0.000024870258,0.0006477356,0.00002318048,0.000027206224,0.00014174802,0.00014206715,0.034525935,0.00029994184,0.96271956,0.0013930503,0.000021930186],"about_ca_topic_score_codex":0.0026097952,"about_ca_topic_score_gemma":0.0023143333,"teacher_disagreement_score":0.01651454,"about_ca_system_score_codex":0.0032405807,"about_ca_system_score_gemma":0.0017232889,"threshold_uncertainty_score":0.05524665},"labels":[],"label_agreement":null},{"id":"W2029406200","doi":"10.1007/s00012-004-1819-7","title":"Finite posets and topological spaces in locally finite varieties","year":2005,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Champlain Regional College; Concordia University","funders":"","keywords":"Mathematics; Partially ordered set; Homotopy; Type (biology); Variety (cybernetics); Pure mathematics; Space (punctuation); Star product; Topological space; Topology (electrical circuits); Discrete mathematics; Combinatorics; Computer science","score_opus":0.014693610085184085,"score_gpt":0.2526336100076269,"score_spread":0.23793999992244283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029406200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6627949,0.016806427,0.20336136,0.010449439,0.0008567069,0.000074181014,0.0007080802,0.0004660598,0.104482844],"genre_scores_gemma":[0.9708327,0.0026103228,0.009966427,0.00027211965,0.00062852225,0.00007003616,0.00035275065,0.000054287753,0.015212932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898976,0.00034563508,0.00005864574,0.00025655553,0.00018579564,0.00016362903],"domain_scores_gemma":[0.99643046,0.002286621,0.00031784424,0.00024164846,0.00023046322,0.00049303385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015251865,0.0008303267,0.0013662323,0.003683843,0.0036456648,0.00827231,0.0014807922,0.0018923944,0.007429367],"category_scores_gemma":[0.004461775,0.0008983698,0.0012332927,0.004309148,0.00946051,0.015443464,0.0033489703,0.00448204,0.0005145844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012389792,0.0000101621,0.00016189115,0.000014400386,0.000003559834,0.000033773893,0.00051788765,0.00032019676,0.0001150683,0.99734265,0.0002445416,0.0012235875],"study_design_scores_gemma":[0.0000061178084,0.0000060404186,0.00013104962,0.000007633184,0.000005526384,0.00003239208,0.00021888365,0.00070364634,0.0000809882,0.99756855,0.0012337317,0.0000054962675],"about_ca_topic_score_codex":0.0025777735,"about_ca_topic_score_gemma":0.0028771972,"teacher_disagreement_score":0.00827231,"about_ca_system_score_codex":0.002907748,"about_ca_system_score_gemma":0.0009947333,"threshold_uncertainty_score":0.024853706},"labels":[],"label_agreement":null},{"id":"W2029854525","doi":"10.1016/j.jcss.2003.12.001","title":"Approximation algorithms for classes of graphs excluding single-crossing graphs as minors","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Clique-sum; 1-planar graph; Partial k-tree; Pathwidth; Chordal graph; Combinatorics; Indifference graph; Mathematics; Discrete mathematics; Maximal independent set; Tree-depth; Planar graph; Independent set; Vertex cover; Cograph; Time complexity; Graph; Line graph","score_opus":0.06961559235493293,"score_gpt":0.3323560924359493,"score_spread":0.2627405000810164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029854525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36098495,0.0024332588,0.60413,0.004247173,0.00037299047,0.00060308486,0.0026657102,0.0050112987,0.019551404],"genre_scores_gemma":[0.6311157,0.001291734,0.3464901,0.0009326407,0.00050891034,0.00046634994,0.007504696,0.00143411,0.010255772],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974739,0.0005654928,0.00014036374,0.00075684575,0.00048970134,0.0005737766],"domain_scores_gemma":[0.9835835,0.0099538015,0.0011965049,0.0033659148,0.0009440671,0.00095614465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026398054,0.0025074303,0.0030970208,0.002737481,0.0027202195,0.006190877,0.0070630494,0.003346749,0.011798351],"category_scores_gemma":[0.017351933,0.0017473482,0.003046453,0.004355425,0.0015999806,0.009927894,0.0033568463,0.004235793,0.0019603905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057985056,0.0029341066,0.0122994995,0.0014600571,0.0005174755,0.0003383356,0.0015853969,0.29181644,0.009254125,0.17912297,0.056738745,0.4381344],"study_design_scores_gemma":[0.000600214,0.00024968365,0.0014867826,0.00008688572,0.0002847808,0.0005170754,0.00038563594,0.72869456,0.0035318309,0.25768593,0.006432117,0.000044475004],"about_ca_topic_score_codex":0.0049868836,"about_ca_topic_score_gemma":0.009249376,"teacher_disagreement_score":0.011798351,"about_ca_system_score_codex":0.0043967343,"about_ca_system_score_gemma":0.0033474998,"threshold_uncertainty_score":0.03946942},"labels":[],"label_agreement":null},{"id":"W2029943728","doi":"10.1016/j.jctb.2012.07.004","title":"A generalization of Littleʼs Theorem on Pfaffian orientations","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Pfaffian; Disjoint sets; Matching (statistics); Discrete mathematics; Cograph; Graph; Chordal graph; 1-planar graph","score_opus":0.01697318881866508,"score_gpt":0.2949306128611698,"score_spread":0.2779574240425047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029943728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10715693,0.0024911428,0.45829144,0.011455441,0.0034415494,0.00013320698,0.0009610148,0.00092354295,0.41514578],"genre_scores_gemma":[0.79446256,0.003507006,0.09558795,0.006053631,0.0052581523,0.00027876275,0.00081922,0.0007945219,0.09323823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905676,0.00015994153,0.000057612124,0.00034878348,0.0002277309,0.00014922413],"domain_scores_gemma":[0.9980116,0.0008454288,0.00013595508,0.000384448,0.00037348643,0.00024904442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017072302,0.00081676024,0.0013596474,0.003914052,0.003317855,0.0025992747,0.0018912859,0.0017321826,0.014880178],"category_scores_gemma":[0.005404147,0.00076414703,0.0019876864,0.0024818457,0.0055664186,0.012437681,0.004477508,0.0049449066,0.0020472421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011116467,0.000009841284,0.00014067248,0.000024032095,0.0000050793888,0.000043168056,0.00014829944,0.000216843,0.000274058,0.99046004,0.0022306035,0.0064362683],"study_design_scores_gemma":[0.0000042392485,0.000006003128,0.00012736427,0.0000072439316,0.0000049911127,0.000081112674,0.000032186606,0.00069309253,0.000121170866,0.99337476,0.0055396054,0.000008224247],"about_ca_topic_score_codex":0.0023338655,"about_ca_topic_score_gemma":0.0015972963,"teacher_disagreement_score":0.014880178,"about_ca_system_score_codex":0.0020400446,"about_ca_system_score_gemma":0.0007635262,"threshold_uncertainty_score":0.049779177},"labels":[],"label_agreement":null},{"id":"W2030195206","doi":"10.1007/s11425-011-4222-9","title":"Toughness and [a, b]-factors with inclusion/exclusion properties","year":2011,"lang":"en","type":"article","venue":"Science China Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Graph; Inclusion (mineral); Combinatorics; Toughness; Factor (programming language); Discrete mathematics; Composite material; Physics; Computer science","score_opus":0.04418725558374218,"score_gpt":0.26822547693627613,"score_spread":0.22403822135253396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030195206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71087986,0.0006008846,0.19422127,0.0016271927,0.00039966914,0.00015275882,0.0007784109,0.00075038796,0.09058962],"genre_scores_gemma":[0.9628021,0.0001578103,0.022360096,0.00022743025,0.00019909482,0.00012662903,0.00038590535,0.00016012907,0.013580726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983753,0.00025025962,0.000114073264,0.0005700069,0.0003115161,0.00037891517],"domain_scores_gemma":[0.9918174,0.0033225394,0.001173421,0.0007035657,0.0011685377,0.001814575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011433527,0.00075669313,0.00096165214,0.002712887,0.004548907,0.0034517876,0.0010154736,0.0011484452,0.013130321],"category_scores_gemma":[0.007930408,0.00076646585,0.0011572681,0.0019533974,0.003932679,0.0055666324,0.002063411,0.0018319146,0.0010321169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023920386,0.000072393894,0.0017623571,0.00006227504,0.00003224805,0.00025590413,0.00082814915,0.0009745691,0.0034579812,0.9829565,0.0021469474,0.0072113653],"study_design_scores_gemma":[0.000041652234,0.000027091428,0.00082081696,0.00001218647,0.000021216945,0.00020905754,0.00027277376,0.0030568666,0.0007336661,0.99144745,0.003330819,0.000026475569],"about_ca_topic_score_codex":0.0033523445,"about_ca_topic_score_gemma":0.0023869663,"teacher_disagreement_score":0.013130321,"about_ca_system_score_codex":0.00076331047,"about_ca_system_score_gemma":0.00086950127,"threshold_uncertainty_score":0.043925226},"labels":[],"label_agreement":null},{"id":"W2030552895","doi":"10.1007/s00224-007-1325-3","title":"Algorithms in the W-Hierarchy","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hierarchy; Intersection (aeronautics); Mathematical proof; Extension (predicate logic); Set (abstract data type); Mathematics; Upper and lower bounds; Algorithm; Computer science; State (computer science); Discrete mathematics; Finite-state machine; Combinatorics; Theoretical computer science; Programming language; Engineering","score_opus":0.0302898493409319,"score_gpt":0.31553094789313363,"score_spread":0.2852410985522017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030552895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1013794,0.00585195,0.77856165,0.008783959,0.00042752252,0.00015767638,0.00064325175,0.0013886814,0.10280586],"genre_scores_gemma":[0.6354263,0.004186235,0.31174973,0.0020760077,0.000823997,0.00031400443,0.001025518,0.0007030076,0.043695264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974855,0.00073890615,0.00016885341,0.0004709523,0.00064550224,0.00049017667],"domain_scores_gemma":[0.99389535,0.0034728067,0.00036746447,0.0011680882,0.0006246234,0.00047169873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023772244,0.0007417723,0.0017362937,0.0026832686,0.0026498868,0.0055093365,0.0026677332,0.0018169198,0.011161799],"category_scores_gemma":[0.0116255125,0.000851863,0.0014478914,0.0044082776,0.0032622046,0.015132419,0.003715116,0.0039419415,0.0020423206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003856732,0.000026968013,0.00021939303,0.00008048942,0.000015306005,0.000024393934,0.00015235048,0.0021423807,0.00026417655,0.9721657,0.0035350325,0.021335278],"study_design_scores_gemma":[0.000014151799,0.0000073298024,0.000078190154,0.000015825866,0.0000072476005,0.000024241219,0.00003820046,0.009977609,0.00012570513,0.98681706,0.0028889403,0.0000055090163],"about_ca_topic_score_codex":0.005127763,"about_ca_topic_score_gemma":0.005264961,"teacher_disagreement_score":0.011161799,"about_ca_system_score_codex":0.0032371508,"about_ca_system_score_gemma":0.0020191965,"threshold_uncertainty_score":0.037339926},"labels":[],"label_agreement":null},{"id":"W2031098440","doi":"10.5539/jmr.v5n3p11","title":"On $(2,t)$-Choosability of Triangle-Free Graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Rangsit University","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.1055819822700717,"score_gpt":0.398705257670632,"score_spread":0.29312327540056027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031098440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6320287,0.001151099,0.29364002,0.0025379546,0.00033425225,0.00028548043,0.0013762427,0.0009611865,0.06768505],"genre_scores_gemma":[0.91100633,0.0018813387,0.068018794,0.0010619027,0.0003535728,0.0003602704,0.0022538255,0.00049408944,0.014569886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880624,0.00016487186,0.000072798626,0.0004001863,0.00024408438,0.0003118658],"domain_scores_gemma":[0.99657804,0.0019830612,0.0003738593,0.00046944118,0.0002140473,0.00038144592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068880204,0.001102735,0.000954072,0.00085003907,0.0018344807,0.001999414,0.0013575067,0.0010429914,0.012174098],"category_scores_gemma":[0.0038977265,0.00072974357,0.0019127205,0.0017444454,0.0026563762,0.005276757,0.0027111769,0.0036241778,0.0015720602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012110986,0.00042843874,0.0061568134,0.00076780847,0.00013941614,0.0009987334,0.0020175518,0.055536006,0.04502,0.7958222,0.013206971,0.07869508],"study_design_scores_gemma":[0.0002904722,0.00041125278,0.003991928,0.0000905305,0.0001334086,0.001054278,0.0005296801,0.07895937,0.017795453,0.88185954,0.014733197,0.00015086483],"about_ca_topic_score_codex":0.0033011467,"about_ca_topic_score_gemma":0.0029958526,"teacher_disagreement_score":0.012174098,"about_ca_system_score_codex":0.0017203342,"about_ca_system_score_gemma":0.0010440382,"threshold_uncertainty_score":0.040726423},"labels":[],"label_agreement":null},{"id":"W2031490867","doi":"10.1006/jctb.2000.1967","title":"On the Excluded Minors for Quaternary Matroids","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; National Security Agency","keywords":"Matroid; Disjoint sets; Combinatorics; Minor (academic); Rank (graph theory); Hyperplane; Mathematics; Characterization (materials science); Graphic matroid; Discrete mathematics; Physics; Law; Political science","score_opus":0.01675583223072613,"score_gpt":0.27798542796126846,"score_spread":0.26122959573054233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031490867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64188313,0.0019066735,0.16789569,0.004505302,0.0009256678,0.00016217702,0.0008575736,0.00036031604,0.1815035],"genre_scores_gemma":[0.93975097,0.0011900229,0.021904727,0.00072065595,0.0012404858,0.00011139858,0.00072109356,0.0002320267,0.034128703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912673,0.00027683013,0.000063425905,0.00013324691,0.00024082704,0.00015894166],"domain_scores_gemma":[0.9961915,0.002042453,0.0004594987,0.0002832118,0.00045865393,0.0005646893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012694116,0.001076514,0.0011587214,0.0023066348,0.0027572266,0.0042424775,0.0013640864,0.001473045,0.009572731],"category_scores_gemma":[0.0058680135,0.00077400275,0.0011417505,0.001738515,0.0034182,0.0049658013,0.0024738547,0.0030611372,0.0015032114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090806716,0.000045735444,0.00032985592,0.000047519436,0.000008658472,0.0001361349,0.00032088367,0.0011677991,0.0011429043,0.9889783,0.002855252,0.0048760893],"study_design_scores_gemma":[0.000016895296,0.000019827832,0.00016222817,0.000012958028,0.000005538283,0.0001256398,0.00007062463,0.0034249541,0.0002326275,0.9935726,0.0023468165,0.000009395777],"about_ca_topic_score_codex":0.0010530294,"about_ca_topic_score_gemma":0.0014802184,"teacher_disagreement_score":0.009572731,"about_ca_system_score_codex":0.0013904752,"about_ca_system_score_gemma":0.00067210104,"threshold_uncertainty_score":0.032024026},"labels":[],"label_agreement":null},{"id":"W2031691607","doi":"10.1007/s10878-012-9547-y","title":"Paired versus double domination in K 1,r -free graphs","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Induced subgraph; Vertex (graph theory); Domination analysis; Graph; Bipartite graph; Discrete mathematics","score_opus":0.026302531656783684,"score_gpt":0.29455605431372744,"score_spread":0.26825352265694374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031691607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8999698,0.00070454174,0.05464219,0.001450527,0.0000982898,0.00007856205,0.00045490955,0.00023159721,0.042369697],"genre_scores_gemma":[0.9810364,0.00023118389,0.009337334,0.0002296155,0.00006129433,0.00004748471,0.00022029657,0.000070255264,0.0087660905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987795,0.0003883339,0.000058114776,0.00026862443,0.00019778547,0.00030769786],"domain_scores_gemma":[0.9930541,0.0044481084,0.0008844909,0.00049841346,0.00034481008,0.00077003846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011947533,0.0008204444,0.0011958213,0.0018202852,0.002338698,0.0040779463,0.0018589948,0.0016258917,0.009698358],"category_scores_gemma":[0.0067477184,0.00073982816,0.0006531604,0.0014823865,0.0024730454,0.005399643,0.0022445824,0.0013865584,0.0008348353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015091808,0.0004011176,0.007751084,0.0006215476,0.00017895944,0.0016225701,0.0016339906,0.049485385,0.011372074,0.8615755,0.010792656,0.05305593],"study_design_scores_gemma":[0.000243395,0.00018867105,0.0023880242,0.000108411026,0.00018395035,0.0011379536,0.000998196,0.08777566,0.0053130477,0.8968207,0.004780038,0.0000619307],"about_ca_topic_score_codex":0.0011336835,"about_ca_topic_score_gemma":0.0025136552,"teacher_disagreement_score":0.009698358,"about_ca_system_score_codex":0.0009440819,"about_ca_system_score_gemma":0.00073251384,"threshold_uncertainty_score":0.03244424},"labels":[],"label_agreement":null},{"id":"W2031928820","doi":"10.1007/s00373-012-1224-5","title":"Paired-Domination in Claw-Free Graphs","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Claw; Mathematics; Combinatorics; Discrete mathematics; Biology","score_opus":0.01856724002713184,"score_gpt":0.25932418640361954,"score_spread":0.2407569463764877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031928820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8259933,0.000557732,0.10245025,0.0014247778,0.00011959179,0.00013343949,0.0004912287,0.0005125924,0.06831704],"genre_scores_gemma":[0.96390945,0.00028726287,0.015671851,0.00034089797,0.0000799914,0.00011005292,0.00059155974,0.00012890463,0.018880079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987307,0.0002444146,0.0000636879,0.0003219247,0.0003061106,0.00033319223],"domain_scores_gemma":[0.99449015,0.0030120572,0.00056490453,0.00053056615,0.0005399116,0.0008624016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009903224,0.00068062736,0.00096548453,0.002592593,0.0041235476,0.004164984,0.0022459305,0.001756528,0.009136864],"category_scores_gemma":[0.005401953,0.00112479,0.00078572845,0.0031643796,0.0031077643,0.0065411367,0.003356695,0.0024919666,0.0009811546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022840369,0.00020428335,0.0033797286,0.00019953401,0.000056090288,0.00083962426,0.0017982002,0.005277473,0.0056561087,0.947198,0.0044865515,0.030676099],"study_design_scores_gemma":[0.00005688039,0.000025863983,0.00078803516,0.00003866673,0.00004648232,0.00045267574,0.00050675694,0.009846571,0.0031526801,0.98118883,0.003867031,0.00002953247],"about_ca_topic_score_codex":0.0024443134,"about_ca_topic_score_gemma":0.004382778,"teacher_disagreement_score":0.009136864,"about_ca_system_score_codex":0.0013031667,"about_ca_system_score_gemma":0.0011678815,"threshold_uncertainty_score":0.030565798},"labels":[],"label_agreement":null},{"id":"W2032266235","doi":"10.1007/s11425-010-3079-7","title":"Constructive proof of deficiency theorem of (g, f)-factor","year":2010,"lang":"en","type":"article","venue":"Science in China Series A Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Constructive proof; Constructive; Combinatorics; Discrete mathematics; Graph; Decomposition theorem","score_opus":0.013783485229141917,"score_gpt":0.2927466861251646,"score_spread":0.27896320089602267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032266235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09466364,0.002095755,0.79663986,0.0056551206,0.0014719652,0.00020241155,0.0012333055,0.00086707005,0.097170934],"genre_scores_gemma":[0.7401984,0.0012501917,0.23192039,0.0011115915,0.0005934772,0.00019675022,0.0010265453,0.0002682792,0.023434356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933654,0.00012822778,0.000039417446,0.00020142054,0.00019349874,0.000100830635],"domain_scores_gemma":[0.9982528,0.00088893814,0.00006079095,0.0002498264,0.0004199523,0.0001276244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009037442,0.0007539238,0.00086398434,0.0012494338,0.0010685114,0.0013736521,0.001129615,0.00078091497,0.008491801],"category_scores_gemma":[0.003963351,0.00040608403,0.0011960457,0.0008048582,0.0017052549,0.0035502145,0.0029949467,0.0020782463,0.0008570273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018269621,0.00006273849,0.0010860675,0.00034964498,0.000043949738,0.00043396244,0.0004908712,0.0022685288,0.00939187,0.955881,0.00951458,0.020294035],"study_design_scores_gemma":[0.000103482365,0.00006989892,0.0007414163,0.00005440733,0.000102294915,0.0010356501,0.00026590223,0.01548204,0.009282171,0.9370831,0.035746723,0.000032840293],"about_ca_topic_score_codex":0.0017589444,"about_ca_topic_score_gemma":0.0012709014,"teacher_disagreement_score":0.008491801,"about_ca_system_score_codex":0.001093605,"about_ca_system_score_gemma":0.00084628386,"threshold_uncertainty_score":0.028407931},"labels":[],"label_agreement":null},{"id":"W2032278054","doi":"10.1007/s00224-014-9557-5","title":"On the Parameterized Complexity of Computing Balanced Partitions in Graphs","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Combinatorics; Vertex (graph theory); Partition (number theory); Vertex cover; Mathematics; Neighbourhood (mathematics); Time complexity; Feedback vertex set; Graph partition; Constant (computer programming); Graph; Bisection; Computer science; Geometry","score_opus":0.057347222567492515,"score_gpt":0.30228049710186444,"score_spread":0.24493327453437191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032278054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5070193,0.0035463576,0.4347922,0.013380993,0.00057197304,0.0004178734,0.0042223767,0.0030374853,0.033011496],"genre_scores_gemma":[0.8444405,0.0017553677,0.13468419,0.0011850202,0.00077495043,0.00046939444,0.005368936,0.0015310276,0.009790576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99269694,0.0025455714,0.00047548962,0.0014388433,0.0017073232,0.0011358808],"domain_scores_gemma":[0.9278957,0.05943539,0.0022819263,0.0068723992,0.0018844315,0.0016300371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004428702,0.0021537554,0.0029218853,0.002055075,0.002536935,0.010100155,0.005693849,0.0034022243,0.019805899],"category_scores_gemma":[0.052035145,0.0015225064,0.0026324138,0.005740599,0.0043525263,0.029300563,0.005832007,0.006050079,0.0017591765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003451172,0.0008964982,0.010424595,0.0014483347,0.00042202757,0.00033306328,0.0015496246,0.47063866,0.009396576,0.3376935,0.02786715,0.13587885],"study_design_scores_gemma":[0.00021746701,0.00011061135,0.0012179891,0.000069870104,0.0001234797,0.00011779773,0.00033178198,0.48532295,0.001820855,0.508618,0.002006975,0.0000422309],"about_ca_topic_score_codex":0.0072074775,"about_ca_topic_score_gemma":0.011931054,"teacher_disagreement_score":0.019805899,"about_ca_system_score_codex":0.0074202553,"about_ca_system_score_gemma":0.0054807556,"threshold_uncertainty_score":0.06625736},"labels":[],"label_agreement":null},{"id":"W2032387361","doi":"10.1016/j.ejc.2010.06.002","title":"A conjecture of Welsh revisited","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Combinatorics; Conjecture; Mathematics; Welsh; Simple (philosophy); Discrete mathematics","score_opus":0.011226861763532355,"score_gpt":0.2564675826925108,"score_spread":0.24524072092897845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032387361","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27305138,0.0057191504,0.07740957,0.15786298,0.0066638673,0.00007272037,0.00095037324,0.00065941655,0.4776106],"genre_scores_gemma":[0.9297878,0.0012231529,0.007462267,0.007970051,0.00342133,0.000067518005,0.00038277078,0.00022798263,0.0494572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984328,0.00041462475,0.00005818665,0.00046974246,0.0002641304,0.00036048706],"domain_scores_gemma":[0.99414635,0.0032899347,0.00034898228,0.0010969555,0.00070537685,0.00041239825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023877635,0.0005966258,0.0012902011,0.0016016855,0.005639272,0.0036006046,0.0013873866,0.003807823,0.024078695],"category_scores_gemma":[0.015012773,0.0004997058,0.0010180828,0.002462413,0.0093449885,0.012262453,0.0038383976,0.00469721,0.0027334238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007012635,0.000011834668,0.00026580345,0.00003409371,0.000007132166,0.000045968496,0.00033725734,0.00018415214,0.00010598957,0.9844067,0.010370875,0.00415995],"study_design_scores_gemma":[0.000018336714,0.0000056136323,0.00012910111,0.00001117189,0.000004323164,0.000033453736,0.00011249096,0.00032243205,0.00006855724,0.9928848,0.006402737,0.000006922411],"about_ca_topic_score_codex":0.0035604783,"about_ca_topic_score_gemma":0.0024574192,"teacher_disagreement_score":0.024078695,"about_ca_system_score_codex":0.0020057887,"about_ca_system_score_gemma":0.001164535,"threshold_uncertainty_score":0.08055127},"labels":[],"label_agreement":null},{"id":"W2032487621","doi":"10.1145/1970398.1970400","title":"Complexity of conservative constraint satisfaction problems","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Unary operation; Constraint satisfaction problem; Mathematics; Constraint satisfaction; Constraint (computer-aided design); Constraint logic programming; Set (abstract data type); Constraint programming; Time complexity; Complexity of constraint satisfaction; Mathematical proof; Constraint graph; Local consistency; Constraint satisfaction dual problem; Variable (mathematics); Discrete mathematics; Computer science; Mathematical optimization; Programming language","score_opus":0.16576442378401363,"score_gpt":0.32053909798757435,"score_spread":0.15477467420356072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032487621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3349656,0.0023194824,0.60311246,0.01176129,0.0001729506,0.0007171681,0.004504636,0.0013218585,0.041124586],"genre_scores_gemma":[0.8446661,0.0020024143,0.13244885,0.0011906174,0.00037606552,0.0007913965,0.005834777,0.0003841152,0.012305628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99461234,0.0013875639,0.0003995134,0.0010034388,0.0018475031,0.00074956106],"domain_scores_gemma":[0.975848,0.020016229,0.0013569169,0.0012322778,0.0009512145,0.0005953596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025389898,0.00089916104,0.0015336908,0.0011094623,0.0015916411,0.005028519,0.0024299105,0.001705794,0.007927727],"category_scores_gemma":[0.022341507,0.000780105,0.001836803,0.0024414198,0.0023188684,0.0077291396,0.0032858225,0.0036358363,0.00063872436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000494025,0.00036948652,0.004519505,0.001323546,0.00023223917,0.0008531238,0.0018003023,0.188233,0.0049057896,0.7187564,0.013575383,0.06493719],"study_design_scores_gemma":[0.00010121232,0.00003448502,0.00060933566,0.000043803855,0.00005270306,0.00027306174,0.0003338548,0.16747753,0.0012339813,0.82355076,0.0062622684,0.000027068092],"about_ca_topic_score_codex":0.0036186618,"about_ca_topic_score_gemma":0.00308851,"teacher_disagreement_score":0.007927727,"about_ca_system_score_codex":0.0025490932,"about_ca_system_score_gemma":0.0024126985,"threshold_uncertainty_score":0.026520848},"labels":[],"label_agreement":null},{"id":"W2032633417","doi":"","title":"A fractional model of the border gateway protocol (BGP)","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Border Gateway Protocol; Computer science; Interior gateway protocol; Default-free zone; Routing protocol; Computer network; Path vector protocol; Shortest path problem; Routing (electronic design automation); Distributed computing; Graph; Link-state routing protocol; Theoretical computer science","score_opus":0.04968345540949942,"score_gpt":0.355288407323582,"score_spread":0.3056049519140826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032633417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07863131,0.002355309,0.7163049,0.0063826265,0.00056256365,0.00021551669,0.0008645581,0.00025362897,0.19442953],"genre_scores_gemma":[0.84953743,0.0021732675,0.10569417,0.0010344983,0.0005784767,0.00028712684,0.00052593875,0.00009953679,0.040069453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920577,0.00021808925,0.00002783352,0.0001489478,0.00021962625,0.00017971091],"domain_scores_gemma":[0.99891555,0.00042621727,0.0001764712,0.00019738295,0.00012957066,0.00015484492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083808,0.00067197427,0.00053058437,0.00085248105,0.001704527,0.0029404715,0.0019335091,0.0023431377,0.007664736],"category_scores_gemma":[0.0027270166,0.00033077307,0.0006820471,0.001361105,0.0028854473,0.0054425006,0.0016925258,0.0020872739,0.0009071706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020644322,0.00002518895,0.000118182885,0.00001854108,0.000003397082,0.00008507265,0.00007209192,0.018791305,0.0003402685,0.97649276,0.0015842869,0.0024482887],"study_design_scores_gemma":[0.000022620166,0.000027736964,0.00008546113,0.000019163263,0.000007769227,0.00016377543,0.00006757734,0.16312885,0.00026346988,0.8202979,0.015902922,0.000012769149],"about_ca_topic_score_codex":0.003300864,"about_ca_topic_score_gemma":0.0020482342,"teacher_disagreement_score":0.007664736,"about_ca_system_score_codex":0.0017096561,"about_ca_system_score_gemma":0.0010263842,"threshold_uncertainty_score":0.025641084},"labels":[],"label_agreement":null},{"id":"W2032795059","doi":"10.1504/ijitcc.2011.042124","title":"On the top-down evaluation of tree inclusion problem","year":2011,"lang":"en","type":"article","venue":"International Journal of Information Technology Communications and Convergence","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Tree (set theory); Mathematics; Space (punctuation); Matching (statistics); Node (physics); Set (abstract data type); Discrete mathematics; Computer science; Physics; Statistics","score_opus":0.03999548666942057,"score_gpt":0.32010495912081555,"score_spread":0.28010947245139495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032795059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062215723,0.0013516031,0.8857849,0.0029220781,0.00033741354,0.00056643883,0.0008041319,0.0040143933,0.04200344],"genre_scores_gemma":[0.26720494,0.00084637874,0.7046464,0.0010651613,0.00031162406,0.00039268218,0.0024131848,0.0011355638,0.02198405],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996691,0.0008998852,0.00014903968,0.0005180851,0.0011380324,0.0006040593],"domain_scores_gemma":[0.9956077,0.0025931657,0.00016465843,0.0007203763,0.0006880497,0.00022608708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024008467,0.0011401605,0.0015715378,0.0011597229,0.0015665487,0.003330704,0.0027745531,0.0016879652,0.01638275],"category_scores_gemma":[0.009636965,0.00050116784,0.0013150033,0.0021953615,0.0014673029,0.008608081,0.004905394,0.002739309,0.002491149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015707185,0.00063150417,0.0015803565,0.0011247664,0.00009061304,0.0006244881,0.00045767808,0.114931226,0.00977083,0.20462732,0.04528495,0.61930555],"study_design_scores_gemma":[0.00019478876,0.00021770736,0.00047331073,0.00014157756,0.00011391058,0.00037934308,0.00036909548,0.6237407,0.011329134,0.33958602,0.023410887,0.000043490574],"about_ca_topic_score_codex":0.004446834,"about_ca_topic_score_gemma":0.0055718003,"teacher_disagreement_score":0.01638275,"about_ca_system_score_codex":0.0016997958,"about_ca_system_score_gemma":0.0019143743,"threshold_uncertainty_score":0.054805756},"labels":[],"label_agreement":null},{"id":"W2033055525","doi":"10.5555/365411.365423","title":"I/O-efficient algorithms for graphs of bounded treewidth","year":2001,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Treewidth; Tree decomposition; Partial k-tree; Bounded function; Computer science; Tree-depth; Shortest path problem; Combinatorics; Pathwidth; 1-planar graph; Graph algorithms; Algorithm; Graph; Discrete mathematics; Mathematics; Chordal graph; Theoretical computer science; Line graph","score_opus":0.042809701453073244,"score_gpt":0.32966203564579555,"score_spread":0.2868523341927223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033055525","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016829167,0.0006463595,0.96642524,0.00047635456,0.00006660226,0.00022476913,0.0004205015,0.0056295167,0.0092814015],"genre_scores_gemma":[0.10504022,0.0005069967,0.88748795,0.0002809402,0.000056930454,0.00045280549,0.0012553256,0.0007468747,0.0041720127],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986796,0.00019181914,0.00010380543,0.000348521,0.0003077434,0.0003684759],"domain_scores_gemma":[0.9980806,0.00072678406,0.000268585,0.000661492,0.00017840469,0.000084207095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072094286,0.0020576527,0.0009973847,0.0015191624,0.0011902358,0.0020812203,0.0037707158,0.0015874133,0.007581509],"category_scores_gemma":[0.0033259226,0.00095582794,0.0021543694,0.0032580998,0.0011187956,0.00531927,0.0027271542,0.0022142194,0.003484146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007344051,0.0006519811,0.0017843596,0.0011242395,0.00017754208,0.00019291631,0.0004328559,0.14250886,0.03923863,0.1418935,0.035917073,0.6353436],"study_design_scores_gemma":[0.0004106784,0.00026127344,0.0010881786,0.00011081483,0.00016701053,0.00046129755,0.0002441116,0.6211895,0.036313824,0.31360692,0.026071846,0.000074526724],"about_ca_topic_score_codex":0.0034844936,"about_ca_topic_score_gemma":0.0069601433,"teacher_disagreement_score":0.007581509,"about_ca_system_score_codex":0.0027919477,"about_ca_system_score_gemma":0.0031668113,"threshold_uncertainty_score":0.02536267},"labels":[],"label_agreement":null},{"id":"W2033177498","doi":"10.1016/j.jctb.2004.11.001","title":"Planar graphs without cycles of length from 4 to 7 are 3-colorable","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Planar graph; Combinatorics; Mathematics; Conjecture; Graph coloring; Graph; Plane (geometry); Discrete mathematics; Geometry","score_opus":0.014152304707623579,"score_gpt":0.2708427278237021,"score_spread":0.25669042311607854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033177498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90921307,0.00064462674,0.02354571,0.0011561908,0.00018909511,0.00018709681,0.0020785402,0.0013752128,0.06161039],"genre_scores_gemma":[0.9531533,0.00068598887,0.020485075,0.0005459235,0.0000801855,0.00021893428,0.0026674452,0.000523128,0.021639962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905115,0.00011708762,0.000048499107,0.00025253498,0.00021397728,0.00031673803],"domain_scores_gemma":[0.9925841,0.0034182705,0.0016848175,0.00090642984,0.000614716,0.00079166907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009266,0.001487324,0.001335011,0.0015381471,0.0033037977,0.0055494197,0.002260242,0.002163276,0.016875938],"category_scores_gemma":[0.00336873,0.0020551505,0.0017502668,0.0026079526,0.00319445,0.0039068917,0.0017501245,0.0032817351,0.0024116498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055486825,0.0017529862,0.020986501,0.0016072742,0.00065726205,0.0026055914,0.003357837,0.034047388,0.12651476,0.62390196,0.03648137,0.14253843],"study_design_scores_gemma":[0.00071588863,0.0005079602,0.022946773,0.00020785572,0.000635317,0.002218532,0.0019261249,0.026530728,0.05720811,0.85906076,0.027735846,0.0003061438],"about_ca_topic_score_codex":0.0043875407,"about_ca_topic_score_gemma":0.008460042,"teacher_disagreement_score":0.016875938,"about_ca_system_score_codex":0.0024190764,"about_ca_system_score_gemma":0.0018790495,"threshold_uncertainty_score":0.05645567},"labels":[],"label_agreement":null},{"id":"W2033972173","doi":"10.7151/dmgt.1205","title":"On maximal finite antichains in the homomorphism order of directed graphs","year":2003,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Homomorphism; Mathematics; Combinatorics; Algebra homomorphism; Tree (set theory); Discrete mathematics; Order (exchange); Dual (grammatical number)","score_opus":0.019116565520654952,"score_gpt":0.2735449358042366,"score_spread":0.2544283702835817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033972173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8320497,0.0011457044,0.12313957,0.00049815205,0.00015728238,0.000042596585,0.00039587988,0.00031945918,0.04225165],"genre_scores_gemma":[0.96459955,0.00043714113,0.028547319,0.00014888376,0.00014970101,0.000063278196,0.00044934012,0.00007248185,0.0055323155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895644,0.0002558023,0.00006445196,0.00029882256,0.0002038757,0.00022066094],"domain_scores_gemma":[0.9961333,0.0020783443,0.00057147356,0.00027962672,0.00035301302,0.0005843092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092816155,0.00049929606,0.000573813,0.0018476811,0.0018175772,0.0025714794,0.00074647914,0.00068035396,0.0035906946],"category_scores_gemma":[0.0025951774,0.00047006292,0.00067510415,0.0013836793,0.0024784908,0.006216212,0.0018418053,0.0014706335,0.00040861222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007324857,0.000044229655,0.0012464672,0.00006051753,0.000009586832,0.0001974807,0.0006438529,0.0010202146,0.0032609564,0.9873383,0.00042434825,0.0056807986],"study_design_scores_gemma":[0.000018671208,0.000046157504,0.0011149098,0.000021346465,0.0000125549,0.00025893064,0.00025435773,0.0054821763,0.001730215,0.98738587,0.0036580253,0.000016726965],"about_ca_topic_score_codex":0.0013620777,"about_ca_topic_score_gemma":0.001996343,"teacher_disagreement_score":0.0035906946,"about_ca_system_score_codex":0.0011648601,"about_ca_system_score_gemma":0.000503242,"threshold_uncertainty_score":0.012012124},"labels":[],"label_agreement":null},{"id":"W2034079307","doi":"10.1007/s00012-007-2012-6","title":"Bounded width problems and algebras","year":2007,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Homomorphism; Bounded function; Mathematics; Partially ordered set; Combinatorics; Discrete mathematics; Type (biology); Variety (cybernetics)","score_opus":0.01613953013336916,"score_gpt":0.25178421176180993,"score_spread":0.23564468162844077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034079307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20249303,0.025699126,0.43854803,0.036707144,0.0012348156,0.00010346238,0.0010211751,0.00092940044,0.29326382],"genre_scores_gemma":[0.8962865,0.006869851,0.050112464,0.0029751477,0.0024984123,0.00024147629,0.0010009048,0.00037559943,0.039639633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978369,0.0007373985,0.000111074616,0.00054510933,0.0004887419,0.00028071788],"domain_scores_gemma":[0.99398154,0.0040309625,0.00033035784,0.0007745562,0.00041416285,0.0004684468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027340373,0.0010180905,0.0018622342,0.0024404735,0.004852441,0.0069135125,0.0026605318,0.0030314282,0.0126128765],"category_scores_gemma":[0.010245192,0.0012523768,0.0016440426,0.005186993,0.010010456,0.027457383,0.0053148563,0.009756782,0.0012384075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009499839,0.000007877016,0.000048413956,0.000017537684,0.0000033165552,0.000008163056,0.00010482467,0.00020060522,0.00004953111,0.99707174,0.0008488758,0.0016295089],"study_design_scores_gemma":[0.0000031008763,0.0000011028998,0.000017301125,0.0000038455946,0.0000022124896,0.000006122679,0.000023256529,0.00032523263,0.000025311165,0.9987589,0.0008318609,0.0000018507582],"about_ca_topic_score_codex":0.002339626,"about_ca_topic_score_gemma":0.001618199,"teacher_disagreement_score":0.0126128765,"about_ca_system_score_codex":0.003721567,"about_ca_system_score_gemma":0.0011655177,"threshold_uncertainty_score":0.042194307},"labels":[],"label_agreement":null},{"id":"W2034251757","doi":"10.1016/j.disc.2008.01.038","title":"Maximal planar graphs of inscribable type and diagonal flips","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Diagonal; Combinatorics; Type (biology); Planar; Discrete mathematics; Chordal graph; Graph; Geometry; Computer science","score_opus":0.038431571477227956,"score_gpt":0.2788313624387978,"score_spread":0.24039979096156985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034251757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7488152,0.00033365138,0.11932568,0.001166415,0.00020037532,0.00011048757,0.0014486501,0.0006604234,0.12793913],"genre_scores_gemma":[0.94760686,0.00034920644,0.022211371,0.00025206403,0.000078583325,0.000080536,0.0009969419,0.00018034522,0.028244078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996921,0.00004462779,0.000015071658,0.00007440622,0.00008045645,0.00009339781],"domain_scores_gemma":[0.99879265,0.00036922315,0.00024230611,0.00023162326,0.00014592924,0.00021814843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002687661,0.00048604846,0.0006244676,0.0010982701,0.001651654,0.0022677493,0.001260233,0.001148635,0.011607435],"category_scores_gemma":[0.0018267601,0.00070549396,0.00056284375,0.001299157,0.0018862403,0.002771577,0.0016688791,0.0020678786,0.0011325992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016327188,0.000038217553,0.00083098,0.00007186583,0.000010553688,0.00019599388,0.00021929476,0.0015535045,0.0037822954,0.9812859,0.0021080412,0.00974019],"study_design_scores_gemma":[0.000065079854,0.000032979766,0.0011266905,0.000032476823,0.00004198507,0.0003829489,0.00047304272,0.005465417,0.0049289293,0.9799637,0.007461906,0.000024871299],"about_ca_topic_score_codex":0.0009649424,"about_ca_topic_score_gemma":0.0015782439,"teacher_disagreement_score":0.011607435,"about_ca_system_score_codex":0.00074678793,"about_ca_system_score_gemma":0.0005017048,"threshold_uncertainty_score":0.038830757},"labels":[],"label_agreement":null},{"id":"W2034408278","doi":"10.1007/s10878-008-9151-3","title":"Computing monotone disjoint paths on polytopes","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polytope; Digraph; Combinatorics; Disjoint sets; Mathematics; Monotone polygon; Vertex (graph theory); Polyhedron; Discrete mathematics; Cardinality (data modeling); Submodular set function; Time complexity; Degeneracy (biology); Convex polytope; Regular polygon; Graph; Computer science; Convex set; Convex optimization","score_opus":0.018289594816103014,"score_gpt":0.272463716427228,"score_spread":0.25417412161112496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034408278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5537844,0.0013172647,0.41441104,0.0021063245,0.00022380755,0.00074272277,0.0045732255,0.0029918042,0.01984947],"genre_scores_gemma":[0.53218913,0.00070423185,0.45074078,0.00038798395,0.00012383965,0.00033089131,0.006746495,0.0008414497,0.007935199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984157,0.0003520229,0.00008646518,0.0005334481,0.00032864223,0.00028376377],"domain_scores_gemma":[0.99284947,0.005440923,0.00035792188,0.0005560424,0.00037841816,0.00041726077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011564454,0.0021078235,0.002876995,0.002276751,0.0016986689,0.0033177368,0.002910534,0.0028243593,0.018652664],"category_scores_gemma":[0.009826774,0.0020073566,0.0024847882,0.0037610857,0.0017447959,0.008858945,0.00419208,0.0032829815,0.0014624685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016293973,0.0009972343,0.0065846783,0.0017769784,0.00039971736,0.00051917,0.00075175654,0.59251547,0.009283179,0.10642637,0.02053373,0.25858232],"study_design_scores_gemma":[0.00023007287,0.00027358986,0.00090693263,0.0001129231,0.000097270815,0.000157763,0.00048957247,0.7228134,0.0028042037,0.26803997,0.0040423376,0.00003199045],"about_ca_topic_score_codex":0.0052404967,"about_ca_topic_score_gemma":0.012700183,"teacher_disagreement_score":0.018652664,"about_ca_system_score_codex":0.001998792,"about_ca_system_score_gemma":0.0015508396,"threshold_uncertainty_score":0.062399447},"labels":[],"label_agreement":null},{"id":"W2034904496","doi":"10.1016/j.dam.2006.07.019","title":"Efficient algorithms for finding critical subgraphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Algorithm; Combinatorics","score_opus":0.04092502635496184,"score_gpt":0.3561048761321663,"score_spread":0.3151798497772045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034904496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070607014,0.0010779344,0.91389865,0.0008165407,0.00009965171,0.0005922348,0.001065806,0.0030658776,0.008776224],"genre_scores_gemma":[0.24152622,0.00061118626,0.74679476,0.00018934283,0.00010042744,0.0005103308,0.0035074102,0.00054060953,0.0062197344],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884725,0.00022415367,0.000081894905,0.0003457938,0.00030699855,0.000193881],"domain_scores_gemma":[0.9935045,0.0042065554,0.0004506915,0.0008948057,0.0006835168,0.0002599564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009973975,0.0018342503,0.0015639463,0.0038429801,0.001762347,0.002359949,0.0033697193,0.0016464879,0.009637757],"category_scores_gemma":[0.008211685,0.0011268632,0.0013656729,0.0035012288,0.0013083384,0.004683338,0.0030624745,0.0019695181,0.001861994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011318139,0.0006047138,0.0038399221,0.001228,0.00016912108,0.00032235688,0.0008450105,0.078978956,0.020170666,0.11449356,0.036072783,0.7421432],"study_design_scores_gemma":[0.0005994813,0.00020902402,0.0015203493,0.00012952858,0.00023353132,0.00046985238,0.0005785859,0.4772247,0.015504001,0.4901829,0.013292308,0.000055730594],"about_ca_topic_score_codex":0.0035603838,"about_ca_topic_score_gemma":0.007312667,"teacher_disagreement_score":0.009637757,"about_ca_system_score_codex":0.0020426852,"about_ca_system_score_gemma":0.0022487263,"threshold_uncertainty_score":0.032241464},"labels":[],"label_agreement":null},{"id":"W2035099047","doi":"10.1109/focs.2011.30","title":"Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Royal Military College Saint-Jean","funders":"","keywords":"Disjoint sets; Logarithm; Computer science; Linear programming relaxation; Constant (computer programming); Network congestion; Approximation algorithm; Combinatorics; Steiner tree problem; Cluster analysis; Mathematics; Discrete mathematics; Linear programming; Algorithm; Computer network; Network packet","score_opus":0.03368651481046178,"score_gpt":0.25387899571054057,"score_spread":0.22019248090007879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035099047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27954972,0.0018019314,0.6966133,0.002088667,0.000060246097,0.00027145684,0.0006473447,0.00063547323,0.018331828],"genre_scores_gemma":[0.7531393,0.0022521256,0.23362313,0.00028308827,0.00012535373,0.00025167875,0.0009264887,0.00020316926,0.009195624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993656,0.00020726003,0.000021567577,0.00014871059,0.000121902085,0.00013493588],"domain_scores_gemma":[0.99813974,0.0013061789,0.0002640866,0.00009993139,0.00009029314,0.00009974087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006501569,0.0009140104,0.0008233948,0.00086869666,0.0007485386,0.0010596223,0.0012313648,0.0010276508,0.0030820596],"category_scores_gemma":[0.0045764917,0.00067117513,0.0007467406,0.0019201959,0.0009739988,0.002971041,0.0017775291,0.0014072425,0.0003142255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027067508,0.00011670193,0.0008560104,0.0004291707,0.000071353825,0.00035188923,0.00033226042,0.7562488,0.005415064,0.1948917,0.004625435,0.03639089],"study_design_scores_gemma":[0.000105585175,0.00013690475,0.0007711685,0.000039301678,0.00005421578,0.00031883808,0.00025394597,0.7138272,0.0033633327,0.26980132,0.011297649,0.000030473846],"about_ca_topic_score_codex":0.00250689,"about_ca_topic_score_gemma":0.002139227,"teacher_disagreement_score":0.0030820596,"about_ca_system_score_codex":0.0013998216,"about_ca_system_score_gemma":0.0006236617,"threshold_uncertainty_score":0.010310531},"labels":[],"label_agreement":null},{"id":"W2035278325","doi":"10.1016/j.jctb.2004.12.005","title":"A bound on the chromatic number of the square of a planar graph","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":195,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta; University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Bounded function; Square (algebra); Chromatic scale; Planar; Graph; Upper and lower bounds; Quadratic equation; Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.012947762145866733,"score_gpt":0.27311524414740057,"score_spread":0.26016748200153383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035278325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37349552,0.012027208,0.28129578,0.019762214,0.0024618995,0.00026657424,0.005239333,0.004382169,0.30106923],"genre_scores_gemma":[0.8824086,0.004376871,0.069725536,0.0023290084,0.0022568274,0.00035907948,0.0030125128,0.0014229866,0.034108542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976051,0.00038337556,0.0000757665,0.00074176147,0.00061844214,0.00057564164],"domain_scores_gemma":[0.9745525,0.019019544,0.00068264856,0.0023546503,0.0013632342,0.0020274334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020909728,0.0024213812,0.0018447004,0.004098985,0.0027021437,0.005390184,0.0044415933,0.0027589197,0.022834055],"category_scores_gemma":[0.017322743,0.0013720145,0.0014263625,0.0033100103,0.004141273,0.008908731,0.004757629,0.0058484906,0.0038141806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038360783,0.0004925319,0.010052989,0.0016193809,0.00041111963,0.00074546743,0.0011419223,0.11802254,0.06760109,0.5813319,0.09475394,0.11999105],"study_design_scores_gemma":[0.00029882748,0.00049923535,0.008850593,0.00033971595,0.0004664924,0.00092514977,0.0004895223,0.3293917,0.017570676,0.5976596,0.043221354,0.00028721624],"about_ca_topic_score_codex":0.0056608636,"about_ca_topic_score_gemma":0.010153476,"teacher_disagreement_score":0.022834055,"about_ca_system_score_codex":0.004412813,"about_ca_system_score_gemma":0.002094559,"threshold_uncertainty_score":0.076387525},"labels":[],"label_agreement":null},{"id":"W2035362312","doi":"10.1016/s0304-3975(02)00725-9","title":"Algorithms for vertex-partitioning problems on graphs with fixed clique-width","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Chordal graph; Independent set; Time complexity; Maximal independent set; Induced subgraph isomorphism problem; Discrete mathematics; Vertex (graph theory); Treewidth; Indifference graph; Clique-width; Pathwidth; 1-planar graph; Graph; Line graph","score_opus":0.024320585121181022,"score_gpt":0.29363236843299273,"score_spread":0.2693117833118117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035362312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07377375,0.0018470389,0.89833,0.0024782722,0.00028333583,0.0009849309,0.0011061205,0.005054749,0.016141811],"genre_scores_gemma":[0.15709563,0.00090850884,0.8297023,0.00048692455,0.00026767945,0.000978273,0.0030405286,0.0011866598,0.006333411],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703264,0.0006969977,0.00017348734,0.0009330667,0.0005675518,0.0005962198],"domain_scores_gemma":[0.9854995,0.00977908,0.0007087439,0.0024676516,0.00084999314,0.00069505343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037760288,0.0035342518,0.0028891058,0.0029268751,0.0030484826,0.0056909504,0.010045751,0.0057325405,0.0149802035],"category_scores_gemma":[0.018041348,0.0026561816,0.0032516583,0.0058746627,0.0022714399,0.015975568,0.006683946,0.006238681,0.0033376857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002549442,0.0015859046,0.002495109,0.0018414429,0.0003668764,0.00016690827,0.0012040408,0.28900063,0.008547848,0.11287009,0.039550997,0.5398207],"study_design_scores_gemma":[0.0009756737,0.00018281316,0.00060830684,0.00012739033,0.00021303957,0.00015452852,0.00042800425,0.70982635,0.004332874,0.27700737,0.0060840775,0.000059546568],"about_ca_topic_score_codex":0.0056152632,"about_ca_topic_score_gemma":0.011082456,"teacher_disagreement_score":0.0149802035,"about_ca_system_score_codex":0.0044946084,"about_ca_system_score_gemma":0.004218818,"threshold_uncertainty_score":0.050113738},"labels":[],"label_agreement":null},{"id":"W2035398735","doi":"10.48550/arxiv.1407.7017","title":"On the Complexity of the Positive Semidefinite Zero Forcing Number","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Chordal graph; Forcing (mathematics); Combinatorics; Zero (linguistics); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.11534970538443647,"score_gpt":0.22891752316699493,"score_spread":0.11356781778255846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035398735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6704069,0.00077368674,0.2894681,0.0073311087,0.0001593736,0.00021126057,0.0026297735,0.0014059185,0.027614018],"genre_scores_gemma":[0.9335712,0.00047172653,0.058026332,0.00050557876,0.00024495757,0.00024238141,0.0017503031,0.000348707,0.0048388224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973143,0.00068930537,0.00015280973,0.00078645657,0.00068824843,0.00036887446],"domain_scores_gemma":[0.9572496,0.037030697,0.0017770476,0.0022086017,0.0009724046,0.0007617104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021015273,0.00074194657,0.001385309,0.0011515471,0.0015957967,0.005496782,0.0023777075,0.0015706851,0.009007348],"category_scores_gemma":[0.020080814,0.0007583459,0.0013691859,0.0018098294,0.0046137883,0.0097501,0.0029823284,0.0037218959,0.0009419759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010025038,0.00030017042,0.008975983,0.0008847874,0.00011418796,0.0007369995,0.0012256522,0.16846184,0.008704971,0.74095356,0.014183643,0.05445572],"study_design_scores_gemma":[0.000070684946,0.000041600837,0.0007194448,0.00003617809,0.000028894074,0.00027314766,0.00013565499,0.15930954,0.001982453,0.8361226,0.0012413327,0.00003866226],"about_ca_topic_score_codex":0.0019160832,"about_ca_topic_score_gemma":0.0019319529,"teacher_disagreement_score":0.009007348,"about_ca_system_score_codex":0.002616342,"about_ca_system_score_gemma":0.0015823487,"threshold_uncertainty_score":0.030132532},"labels":[],"label_agreement":null},{"id":"W2035543139","doi":"10.1016/j.jda.2011.03.004","title":"Parameterized complexity of even/odd subgraph problems","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Parameterized complexity; Combinatorics; Induced subgraph isomorphism problem; Mathematics; Cograph; Vertex (graph theory); Pathwidth; Eulerian path; Discrete mathematics; Induced subgraph; Graph; Line graph; Voltage graph; Lagrangian","score_opus":0.10129136067345934,"score_gpt":0.3090173922446653,"score_spread":0.20772603157120595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035543139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6755803,0.0020348185,0.23605542,0.014515264,0.0003957155,0.00041056846,0.0060060015,0.001905368,0.06309648],"genre_scores_gemma":[0.925298,0.0009059237,0.056447703,0.00075143325,0.00035825156,0.00025974808,0.004598765,0.0007876042,0.010592614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674076,0.0009015426,0.00016064798,0.0007621826,0.00067316863,0.0007617332],"domain_scores_gemma":[0.9829411,0.012280161,0.0010146406,0.0020992237,0.000623445,0.0010413638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023347104,0.0012686508,0.0020510275,0.0010098635,0.0019163004,0.0071900976,0.004351818,0.0023374744,0.020271763],"category_scores_gemma":[0.018070571,0.00093865074,0.0019675556,0.002741106,0.002241719,0.012872361,0.003325801,0.0046341987,0.0013588888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030443503,0.0010722518,0.010851038,0.0010294324,0.00032077671,0.0005897239,0.001186388,0.2475374,0.010344329,0.55983716,0.043953758,0.12023341],"study_design_scores_gemma":[0.000297459,0.00006957945,0.0013203968,0.00004165757,0.0001223728,0.00023462407,0.00034701804,0.27405888,0.0026723049,0.71634287,0.004458941,0.000033798515],"about_ca_topic_score_codex":0.004514843,"about_ca_topic_score_gemma":0.0065097995,"teacher_disagreement_score":0.020271763,"about_ca_system_score_codex":0.004877095,"about_ca_system_score_gemma":0.0035354393,"threshold_uncertainty_score":0.06781578},"labels":[],"label_agreement":null},{"id":"W2035562488","doi":"10.1016/j.laa.2014.02.005","title":"Integrally normalizable matrices and zero–nonzero patterns","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integrally closed; Mathematics; Diagonal; Zero (linguistics); Matrix (chemical analysis); Combinatorics; Integer (computer science); Diagonal matrix; Geometry; Computer science","score_opus":0.011184300179782948,"score_gpt":0.2670817599558682,"score_spread":0.25589745977608525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035562488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58417785,0.0011600154,0.25284553,0.0052912836,0.0013290753,0.00009204387,0.00042069823,0.0008003197,0.15388314],"genre_scores_gemma":[0.93632656,0.00052199693,0.02385105,0.0007033554,0.00078201556,0.000052070493,0.00026782881,0.0001945941,0.03730044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992543,0.00016413377,0.00004095654,0.00021339042,0.00019200274,0.00013511955],"domain_scores_gemma":[0.99775,0.0006761064,0.0004305027,0.00039264874,0.00038928338,0.0003615663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067665876,0.0009727802,0.0007200039,0.0019382051,0.0015240823,0.003410315,0.0013971626,0.0013074701,0.0117495945],"category_scores_gemma":[0.0043450054,0.00059879007,0.00054874615,0.0017553605,0.0052287993,0.0051599587,0.0018442587,0.0030680485,0.0014609117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003333108,0.000030988536,0.00014245702,0.000017427876,0.0000037785944,0.00006384764,0.00017867638,0.000197614,0.0013265602,0.99290705,0.0008620377,0.0042362227],"study_design_scores_gemma":[0.0000054039137,0.0000062166046,0.00007259278,0.0000034826392,0.0000020396246,0.00007573946,0.00006260253,0.00097258715,0.00045982594,0.99755245,0.00078044593,0.0000066217963],"about_ca_topic_score_codex":0.00063157384,"about_ca_topic_score_gemma":0.0006652964,"teacher_disagreement_score":0.0117495945,"about_ca_system_score_codex":0.0006940528,"about_ca_system_score_gemma":0.00064787106,"threshold_uncertainty_score":0.039306283},"labels":[],"label_agreement":null},{"id":"W2035616518","doi":"10.1109/bdcloud.2014.118","title":"On the Graph Decomposition","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Directed acyclic graph; Disjoint sets; Node (physics); Graph; Path (computing); Decomposition; Directed graph; Combinatorics; Algorithm; Theoretical computer science; Mathematics; Computer network; Chemistry","score_opus":0.01674793590351749,"score_gpt":0.30186062514033907,"score_spread":0.2851126892368216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035616518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032310465,0.0028743607,0.97826046,0.001188885,0.00039539408,0.00010760227,0.00022345199,0.00051312346,0.013205708],"genre_scores_gemma":[0.055781923,0.005598812,0.9221986,0.0010520578,0.0006748203,0.00024618476,0.0012925208,0.00057365187,0.012581443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812716,0.0006499968,0.00009097267,0.00052482024,0.0004255279,0.00018150228],"domain_scores_gemma":[0.99840564,0.00069050794,0.00009494063,0.00048339096,0.00023692337,0.00008859632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013437235,0.0019028905,0.0012749084,0.0020652823,0.0011500053,0.0022039004,0.0015804876,0.001277006,0.009101721],"category_scores_gemma":[0.0047861575,0.00090314855,0.0018061384,0.0027726355,0.0020551288,0.005913406,0.003751172,0.0035095366,0.0042865877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016309242,0.000105072366,0.0005097645,0.0007368492,0.0001248963,0.00022414433,0.0002992929,0.07093725,0.004139016,0.5629239,0.03629348,0.3235432],"study_design_scores_gemma":[0.000036768055,0.000050372768,0.00020909676,0.00017444718,0.00005285,0.00029071674,0.00009234149,0.11516706,0.0014045788,0.8040248,0.078469925,0.00002705517],"about_ca_topic_score_codex":0.0029363781,"about_ca_topic_score_gemma":0.0026794586,"teacher_disagreement_score":0.009101721,"about_ca_system_score_codex":0.0014704494,"about_ca_system_score_gemma":0.0013353836,"threshold_uncertainty_score":0.030448258},"labels":[],"label_agreement":null},{"id":"W2035637517","doi":"10.1016/j.tcs.2007.09.031","title":"On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Split graph; Chordal graph; Mathematics; Combinatorics; Clique problem; Treewidth; Cograph; Independent set; Clique graph; Block graph; Perfect graph; Discrete mathematics; Graph; Pathwidth; 1-planar graph; Line graph; Graph power","score_opus":0.00919946598330105,"score_gpt":0.27909322103857703,"score_spread":0.26989375505527596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035637517","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43761232,0.004400612,0.43239528,0.015456685,0.0004683647,0.00032034994,0.0021129735,0.0005203362,0.10671306],"genre_scores_gemma":[0.87064147,0.003959969,0.092268415,0.001098891,0.0011340574,0.00034988672,0.0025790015,0.00029087238,0.02767737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877363,0.00041659278,0.000038913924,0.00027549785,0.00030057723,0.00019471237],"domain_scores_gemma":[0.99003816,0.007398937,0.00090288825,0.0005869502,0.00038026666,0.00069288275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014389243,0.0010070038,0.0017164088,0.0016989673,0.002859381,0.0040849843,0.0030158225,0.0033809976,0.010781149],"category_scores_gemma":[0.012573838,0.00087100454,0.0009044687,0.0050082975,0.0031131166,0.00955731,0.0033494318,0.0035446014,0.00092190295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003642424,0.00019438103,0.001082585,0.00030444044,0.000069333946,0.00016262717,0.0005209263,0.047666803,0.0014691659,0.90235823,0.0154312495,0.030376052],"study_design_scores_gemma":[0.000058214646,0.00002152765,0.00024963764,0.000021687516,0.000015896945,0.00006895138,0.00015007504,0.048707824,0.00025263906,0.94768584,0.0027552398,0.000012387805],"about_ca_topic_score_codex":0.002554165,"about_ca_topic_score_gemma":0.0030142686,"teacher_disagreement_score":0.010781149,"about_ca_system_score_codex":0.001999529,"about_ca_system_score_gemma":0.0012160196,"threshold_uncertainty_score":0.036066532},"labels":[],"label_agreement":null},{"id":"W2035672135","doi":"10.1142/s0218196713500215","title":"CSP DICHOTOMY FOR SPECIAL POLYADS","year":2013,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Conjecture; Homomorphism; Bounded function; Class (philosophy); Discrete mathematics; Constraint satisfaction problem; Unanimity; Computer science","score_opus":0.014575788118619308,"score_gpt":0.31065270864338135,"score_spread":0.29607692052476203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035672135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56682295,0.0016024592,0.35992098,0.009001725,0.00024921555,0.00023721714,0.0034518102,0.001718978,0.056994714],"genre_scores_gemma":[0.9538783,0.00046293598,0.03590884,0.0008608482,0.00021906277,0.00025851664,0.0016793099,0.0001598518,0.00657241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976427,0.00044706717,0.00012890474,0.00083422515,0.0005144703,0.0004325244],"domain_scores_gemma":[0.9919139,0.0054783304,0.0005334742,0.000974455,0.00048584497,0.0006139021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011245282,0.0003889624,0.00078491727,0.0008762777,0.0019729966,0.0041734376,0.001193522,0.0012282991,0.008576407],"category_scores_gemma":[0.008262782,0.00054551027,0.0013398291,0.0013304669,0.0022617867,0.0072177993,0.0025419272,0.0057242513,0.0005887665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023986517,0.000166638,0.0014799234,0.00020063417,0.000036743244,0.0002711628,0.000641477,0.01044011,0.0033225098,0.9583949,0.00657671,0.018229324],"study_design_scores_gemma":[0.000051335213,0.000029981797,0.00054152607,0.000022506227,0.000020580204,0.0002475089,0.000228206,0.034120962,0.0014953924,0.9573466,0.00587671,0.000018572144],"about_ca_topic_score_codex":0.0017662512,"about_ca_topic_score_gemma":0.0015683449,"teacher_disagreement_score":0.008576407,"about_ca_system_score_codex":0.002198055,"about_ca_system_score_gemma":0.0012955342,"threshold_uncertainty_score":0.028690875},"labels":[],"label_agreement":null},{"id":"W2035697452","doi":"10.1016/j.jctb.2015.03.005","title":"Matroids denser than a clique","year":2015,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Matroid; Combinatorics; Mathematics; Function (biology); Clique; Rank (graph theory); Exponential function; Integer (computer science); Simple (philosophy); Quadratic equation; Discrete mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.023236955092811526,"score_gpt":0.3042449549892352,"score_spread":0.28100799989642367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035697452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6932576,0.0022877343,0.13207933,0.009994005,0.00072315795,0.00022048154,0.0028926926,0.001002055,0.15754297],"genre_scores_gemma":[0.900337,0.0010474407,0.06130747,0.0018436337,0.0010815624,0.00016567278,0.0022396808,0.00041940066,0.031558145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818414,0.0004319899,0.00009623805,0.00064386934,0.00037186695,0.0002718808],"domain_scores_gemma":[0.9886087,0.006344103,0.0011821808,0.0018974532,0.0008472181,0.0011203102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011425775,0.0009026105,0.0019985228,0.0019013119,0.002567637,0.0055470592,0.0018980579,0.002117485,0.018916626],"category_scores_gemma":[0.007441949,0.0014429443,0.0010605383,0.0020946148,0.0024673843,0.008393365,0.002586413,0.004504151,0.0016574551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037279073,0.00020433599,0.0015012855,0.00028951076,0.000076215605,0.00034873892,0.00056023314,0.0041304496,0.007204545,0.9590226,0.012105013,0.014184366],"study_design_scores_gemma":[0.00011319062,0.00006569915,0.0011863447,0.00005440608,0.00005612851,0.0009808044,0.0005118207,0.017767072,0.002036424,0.9655356,0.011668226,0.000024273268],"about_ca_topic_score_codex":0.0013977668,"about_ca_topic_score_gemma":0.0020606008,"teacher_disagreement_score":0.018916626,"about_ca_system_score_codex":0.0012574226,"about_ca_system_score_gemma":0.00054468785,"threshold_uncertainty_score":0.06328243},"labels":[],"label_agreement":null},{"id":"W2035974993","doi":"10.1016/j.dam.2004.02.014","title":"Multi-terminal multipath flows: synthesis","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Path (computing); Flow network; Disjoint sets; Shortest path problem; Undirected graph; Flow (mathematics); Enhanced Data Rates for GSM Evolution; Polynomial; Discrete mathematics; Maximum flow problem; Multi-commodity flow problem; Topology (electrical circuits); Graph; Computer science; Geometry; Telecommunications","score_opus":0.02898757932986056,"score_gpt":0.2962409616097549,"score_spread":0.2672533822798943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035974993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019228503,0.0003358272,0.963252,0.00020532054,0.00018208494,0.000040962997,0.00007049345,0.00033468165,0.01635015],"genre_scores_gemma":[0.68758464,0.001133725,0.28802365,0.00016622109,0.00023216647,0.00012264418,0.00014090394,0.00015281084,0.02244324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987173,0.00002728124,0.0000052632495,0.000028448003,0.000048415597,0.00001886441],"domain_scores_gemma":[0.99963176,0.00015147845,0.000036889393,0.000046361274,0.00010456585,0.00002888735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026077006,0.00055512186,0.00036105717,0.0005056691,0.0004069822,0.00084895844,0.00045094747,0.0007533194,0.0047444296],"category_scores_gemma":[0.001205813,0.00035620746,0.00035760368,0.0005233196,0.00038053168,0.00074322394,0.00073258503,0.0006932935,0.0009148277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020906392,0.00008303514,0.0007053539,0.00018244593,0.000035147455,0.00022049395,0.0001858827,0.4135503,0.032645583,0.3775379,0.0037070436,0.17093778],"study_design_scores_gemma":[0.000021157275,0.000060062324,0.00014443477,0.000033710487,0.00002253521,0.0001691742,0.00003697151,0.9204259,0.008363565,0.06406335,0.0066396953,0.00001940803],"about_ca_topic_score_codex":0.00044112466,"about_ca_topic_score_gemma":0.0007286574,"teacher_disagreement_score":0.0047444296,"about_ca_system_score_codex":0.00057495385,"about_ca_system_score_gemma":0.0004393267,"threshold_uncertainty_score":0.015871763},"labels":[],"label_agreement":null},{"id":"W2036371515","doi":"10.1016/s0012-365x(01)00273-4","title":"The stable set polytope and some operations on graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Polytope; Mathematics; Chordal graph; Independent set; Discrete mathematics; Indifference graph; Split graph; Set (abstract data type); Maximal independent set; Clique; 1-planar graph; Graph; Computer science","score_opus":0.03863547424493796,"score_gpt":0.29495089754384707,"score_spread":0.2563154232989091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036371515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42775485,0.003545613,0.40469342,0.0060730963,0.00069587864,0.00016667116,0.0014083543,0.0003111761,0.15535085],"genre_scores_gemma":[0.885768,0.0031159143,0.06605876,0.0005458418,0.0010298582,0.00032400162,0.0011460835,0.00024112526,0.041770473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993585,0.0001353778,0.000038313752,0.0001640504,0.0001931744,0.00011044874],"domain_scores_gemma":[0.99872667,0.0006976301,0.00013237147,0.00011378588,0.00012362005,0.00020588444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064687955,0.0008058329,0.0013027691,0.0029777326,0.0033023579,0.0050890804,0.0015975412,0.0013680422,0.009673897],"category_scores_gemma":[0.0019729384,0.00071681454,0.0016845386,0.004811049,0.0043189204,0.008242028,0.002358479,0.004295972,0.00071258657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020323354,0.00001970649,0.00008227161,0.000025320964,0.0000064812484,0.00002968137,0.00013758508,0.0011542808,0.00026676242,0.9928027,0.0011237375,0.004331066],"study_design_scores_gemma":[0.0000100595435,0.0000135581195,0.00013009322,0.000007644203,0.0000071227073,0.000046824272,0.00011984647,0.0041564675,0.0002157823,0.9929618,0.0023225148,0.000008249477],"about_ca_topic_score_codex":0.0017065703,"about_ca_topic_score_gemma":0.0016264204,"teacher_disagreement_score":0.009673897,"about_ca_system_score_codex":0.0017137562,"about_ca_system_score_gemma":0.0007253727,"threshold_uncertainty_score":0.0323624},"labels":[],"label_agreement":null},{"id":"W2036553843","doi":"10.1016/j.disc.2010.03.033","title":"The complexity of colouring by locally semicomplete digraphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Homomorphism; Mathematics; Discrete mathematics; Combinatorics; Polynomial","score_opus":0.03142701722840945,"score_gpt":0.2938779925286236,"score_spread":0.26245097530021416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036553843","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8337234,0.00087342336,0.124456145,0.00592657,0.00013964355,0.00012876386,0.00184357,0.00063533627,0.032273177],"genre_scores_gemma":[0.9737127,0.0006000113,0.016493917,0.0003617867,0.00019646212,0.00010616767,0.0011690959,0.00020373455,0.0071560573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960109,0.0011644972,0.00025094257,0.0007784923,0.0011071906,0.0006880717],"domain_scores_gemma":[0.9413835,0.047317673,0.0031920949,0.004367793,0.0013233697,0.0024155588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023334092,0.00095092476,0.002716074,0.0020830352,0.0029287487,0.009784374,0.003933843,0.0037860454,0.014107],"category_scores_gemma":[0.024272064,0.001741462,0.0023839048,0.0040148688,0.0057276255,0.017212808,0.0048464397,0.005603143,0.00087469775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005289897,0.00016496878,0.0032196187,0.00025735624,0.00009414297,0.00032265132,0.0010362935,0.065389104,0.0022057828,0.9084797,0.0041592787,0.014142202],"study_design_scores_gemma":[0.00007716718,0.000020853793,0.0004959904,0.000018639992,0.000034703913,0.000086120606,0.000119431,0.06017783,0.00055420876,0.9376449,0.0007436132,0.00002656404],"about_ca_topic_score_codex":0.0047069713,"about_ca_topic_score_gemma":0.0044644703,"teacher_disagreement_score":0.014107,"about_ca_system_score_codex":0.0047428743,"about_ca_system_score_gemma":0.0021413055,"threshold_uncertainty_score":0.047192574},"labels":[],"label_agreement":null},{"id":"W2037002007","doi":"10.1016/s0012-365x(00)00260-0","title":"Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Cubic graph; Corollary; Combinatorics; Discrete mathematics; Planar graph; Exponential function; Constructive; Hamiltonian path; Algorithm; Hamiltonian (control theory); Graph; Line graph; Voltage graph; Mathematical analysis; Computer science","score_opus":0.04762917201134028,"score_gpt":0.3176212309829411,"score_spread":0.26999205897160083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037002007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124455616,0.0005797027,0.75312984,0.0033964415,0.0004598399,0.0008935865,0.0015010654,0.009826693,0.10575722],"genre_scores_gemma":[0.37141356,0.00042542454,0.5602246,0.00068003655,0.00013829728,0.00050279393,0.0023885183,0.0020009882,0.06222568],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989919,0.0001044017,0.000055767312,0.00025902435,0.00035276156,0.00023618535],"domain_scores_gemma":[0.9980533,0.000797856,0.00008972183,0.00069816987,0.00022607105,0.00013493102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006457142,0.0013814837,0.0011084371,0.0015593999,0.0020238408,0.0026027062,0.0039093494,0.0017828819,0.028540174],"category_scores_gemma":[0.0030482712,0.0009810228,0.0020639356,0.002813112,0.0016183894,0.0054505467,0.002893963,0.0028757025,0.004202711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012980902,0.000487085,0.0016832807,0.00073719025,0.00019187083,0.00029462,0.00076581194,0.05893021,0.022333203,0.30349433,0.044677574,0.56510675],"study_design_scores_gemma":[0.0005503261,0.00028945357,0.0016174951,0.000082418686,0.0003746929,0.00046758645,0.0006226666,0.50378513,0.036905114,0.40977767,0.045399964,0.00012758136],"about_ca_topic_score_codex":0.011040919,"about_ca_topic_score_gemma":0.033694934,"teacher_disagreement_score":0.028540174,"about_ca_system_score_codex":0.0037783163,"about_ca_system_score_gemma":0.004688286,"threshold_uncertainty_score":0.09547639},"labels":[],"label_agreement":null},{"id":"W2037328176","doi":"10.1007/s00453-001-0017-7","title":"On Rooted Node-Connectivity Problems","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Node (physics); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Physics","score_opus":0.020230128070829564,"score_gpt":0.2773567718637909,"score_spread":0.2571266437929613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037328176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21884198,0.008582391,0.6145981,0.015797295,0.0008255163,0.00029274475,0.0012700703,0.0003699113,0.139422],"genre_scores_gemma":[0.73890203,0.013807832,0.17793624,0.0026861255,0.0025190713,0.00066554465,0.003592809,0.00066731405,0.059223015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984761,0.00061162893,0.000058899124,0.00033251598,0.0003405962,0.00018025762],"domain_scores_gemma":[0.9849031,0.012487523,0.00077344634,0.0005523521,0.00054002955,0.0007434185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002012878,0.0014153119,0.0016522463,0.0023712239,0.0021563484,0.00372112,0.0036869384,0.0035115683,0.015734436],"category_scores_gemma":[0.020621369,0.001000779,0.0012454013,0.004922618,0.0040034405,0.013565251,0.004498151,0.006005719,0.0014695947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010320508,0.00009922561,0.0007409197,0.00028787283,0.000037036272,0.00015392258,0.0004146958,0.026105657,0.00053600816,0.93959457,0.010277748,0.021649228],"study_design_scores_gemma":[0.000028021419,0.000017339511,0.00016462256,0.000041119587,0.000019161194,0.00008611883,0.00010564418,0.02681203,0.00014531604,0.9691591,0.0034137487,0.000007838408],"about_ca_topic_score_codex":0.0012978727,"about_ca_topic_score_gemma":0.0015238465,"teacher_disagreement_score":0.015734436,"about_ca_system_score_codex":0.0018814695,"about_ca_system_score_gemma":0.00081265345,"threshold_uncertainty_score":0.05263692},"labels":[],"label_agreement":null},{"id":"W2037789845","doi":"10.1016/j.jctb.2003.09.001","title":"Excluding any graph as a minor allows a low tree-width 2-coloring","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Graph minor; Graph; Edge coloring; Graph coloring; Conjecture; Fractional coloring; Discrete mathematics; List coloring; Graph power; Graph factorization; Line graph","score_opus":0.015315810349520103,"score_gpt":0.2745306702123444,"score_spread":0.2592148598628243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037789845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4770519,0.00046353717,0.46683624,0.0020787267,0.00052498555,0.00026272907,0.0013447572,0.0069513246,0.044485763],"genre_scores_gemma":[0.7450749,0.00044329022,0.23209092,0.00088939664,0.0002654312,0.0003006557,0.0014753278,0.0030018282,0.016458234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901044,0.00020667052,0.000053432126,0.00028994345,0.0001417908,0.00029763192],"domain_scores_gemma":[0.99266654,0.003070028,0.0003890358,0.0027584129,0.00027823827,0.0008377832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010651316,0.00167732,0.0018441519,0.0006302581,0.002153913,0.0031918485,0.0021603454,0.0016264608,0.010172073],"category_scores_gemma":[0.0045805294,0.0012029938,0.0022003204,0.0011227453,0.0013018933,0.0038375806,0.0025004526,0.0031862962,0.002913677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046706055,0.0015653276,0.0062330593,0.0013638781,0.00029972658,0.0012567857,0.0012322317,0.06785268,0.24131697,0.50955397,0.03559519,0.12905961],"study_design_scores_gemma":[0.0005332749,0.00036513255,0.0017392543,0.00009852812,0.0003765367,0.0013018327,0.00033338377,0.13462035,0.045648977,0.79641217,0.01847865,0.00009196592],"about_ca_topic_score_codex":0.0007183956,"about_ca_topic_score_gemma":0.0023118078,"teacher_disagreement_score":0.010172073,"about_ca_system_score_codex":0.0006774247,"about_ca_system_score_gemma":0.0013229306,"threshold_uncertainty_score":0.034028947},"labels":[],"label_agreement":null},{"id":"W2037821860","doi":"10.1016/s0012-365x(00)00247-8","title":"Characterization of Zm-well-covered graphs for some classes of graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Combinatorics; Characterization (materials science); Discrete mathematics; Indifference graph; Chordal graph; Graph","score_opus":0.027794869945388264,"score_gpt":0.29900215391933355,"score_spread":0.2712072839739453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037821860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8545688,0.0009805496,0.08664011,0.003240587,0.000093693234,0.00011542305,0.0019461162,0.00047763114,0.05193711],"genre_scores_gemma":[0.97251815,0.0007027082,0.0148702115,0.00040860745,0.00023433336,0.00013654238,0.0020430032,0.00014034245,0.008946098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915946,0.00011917612,0.000043407228,0.00027463507,0.00021813407,0.00018535429],"domain_scores_gemma":[0.99560153,0.0022613723,0.0007775028,0.00035272146,0.00036580238,0.00064103166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007203082,0.00083035836,0.00091818883,0.0040655746,0.0019754856,0.003957044,0.0016137863,0.0012819415,0.010060857],"category_scores_gemma":[0.0040286034,0.0008479265,0.0009610906,0.002926451,0.0017055033,0.0055180904,0.0017026115,0.002258192,0.00073767774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016681585,0.000088729255,0.00465529,0.00019543058,0.000054028988,0.0002842278,0.00091909827,0.0036618207,0.005692716,0.96399254,0.005357388,0.014932051],"study_design_scores_gemma":[0.000049384184,0.000060289614,0.0068495213,0.0000762452,0.000091144495,0.0011497184,0.0008106366,0.033208705,0.00409202,0.94228244,0.011281617,0.00004824563],"about_ca_topic_score_codex":0.0009166682,"about_ca_topic_score_gemma":0.0009956411,"teacher_disagreement_score":0.010060857,"about_ca_system_score_codex":0.001651166,"about_ca_system_score_gemma":0.00050165487,"threshold_uncertainty_score":0.033656895},"labels":[],"label_agreement":null},{"id":"W2038115433","doi":"10.1007/s11083-012-9278-9","title":"On Infinite–finite Duality Pairs of Directed Graphs","year":2012,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Royal Military College of Canada","funders":"","keywords":"Antichain; Duality (order theory); Directed graph; Constraint satisfaction problem; Construct (python library); Constraint (computer-aided design)","score_opus":0.03131159960911015,"score_gpt":0.30981490368774756,"score_spread":0.27850330407863744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038115433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49796313,0.0011488664,0.40854245,0.0017628111,0.00039039354,0.000096803786,0.00043502235,0.00033300414,0.08932752],"genre_scores_gemma":[0.91705596,0.0006007171,0.062327266,0.00053980516,0.0003016489,0.00014497818,0.00072814256,0.00023497299,0.018066581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794835,0.0008378295,0.000115817675,0.00040780928,0.00034766766,0.0003425832],"domain_scores_gemma":[0.9926144,0.0044288724,0.0007001258,0.00057507935,0.0006634194,0.0010180414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018952588,0.00093304174,0.0011179157,0.003650469,0.0029417523,0.004773,0.0015372268,0.0016916913,0.0054878797],"category_scores_gemma":[0.007492525,0.001039989,0.0014120652,0.0022229182,0.004840519,0.010365134,0.003549794,0.0042403974,0.0006474143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032136122,0.00001978088,0.00020005017,0.000021010943,0.0000042996667,0.000086120795,0.00022038344,0.0005326725,0.00028215226,0.9964042,0.00031741633,0.0018797922],"study_design_scores_gemma":[0.000008831992,0.000009473194,0.00007674023,0.0000145660215,0.000005631512,0.000073454474,0.000116857635,0.002580459,0.0002667538,0.995804,0.0010358677,0.0000072830076],"about_ca_topic_score_codex":0.0010824641,"about_ca_topic_score_gemma":0.0013500487,"teacher_disagreement_score":0.0054878797,"about_ca_system_score_codex":0.002091562,"about_ca_system_score_gemma":0.0008723805,"threshold_uncertainty_score":0.018358827},"labels":[],"label_agreement":null},{"id":"W2038193038","doi":"10.1016/j.ejc.2011.09.024","title":"A stability theorem on fractional covering of triangles by edges","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Disjoint sets; Graph; Discrete mathematics","score_opus":0.05720135198896756,"score_gpt":0.2618078043544493,"score_spread":0.20460645236548172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038193038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5696169,0.0009877601,0.3630454,0.0020297465,0.0004374221,0.00007570322,0.00053091365,0.0004823474,0.06279383],"genre_scores_gemma":[0.954439,0.00055436237,0.024240162,0.00038519347,0.00042014496,0.00010238559,0.00045796155,0.0002195874,0.019181196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995728,0.0000680671,0.000020733256,0.00012789313,0.000109209854,0.00010120586],"domain_scores_gemma":[0.9968466,0.0019260007,0.00023981479,0.0002610611,0.00041906966,0.00030738662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006646411,0.00057427364,0.00080244214,0.0018000364,0.001909836,0.0021148922,0.0013889108,0.001260008,0.009972369],"category_scores_gemma":[0.0056050136,0.00047965258,0.0011082292,0.0010305876,0.001620825,0.0031305086,0.0023432316,0.0014745959,0.00082922174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037343905,0.000056521894,0.0019641866,0.00015603159,0.00004964993,0.00031925872,0.0007966453,0.012420009,0.01939603,0.9329308,0.0052953945,0.02624198],"study_design_scores_gemma":[0.00006454666,0.000115621384,0.0014096728,0.000040703013,0.00004741676,0.00048253514,0.00032441944,0.12565103,0.0069579715,0.85807806,0.006793807,0.000034235385],"about_ca_topic_score_codex":0.0022398895,"about_ca_topic_score_gemma":0.0011631193,"teacher_disagreement_score":0.009972369,"about_ca_system_score_codex":0.0010742776,"about_ca_system_score_gemma":0.00036239103,"threshold_uncertainty_score":0.0333609},"labels":[],"label_agreement":null},{"id":"W2038298858","doi":"10.1016/j.dam.2011.11.034","title":"Vertex covers and eternal dominating sets","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Neighbourhood (mathematics); Dominating set; Vertex cover; Domination analysis; Guard (computer science); Graph; Discrete mathematics; Computer science","score_opus":0.032096494888659774,"score_gpt":0.2774815119098863,"score_spread":0.2453850170212265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038298858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72648025,0.005199327,0.16404682,0.0039471076,0.00033809972,0.000119388336,0.0014557523,0.00022611956,0.09818703],"genre_scores_gemma":[0.94616604,0.0027894464,0.024538925,0.0005513931,0.0005954844,0.0001598801,0.0010439153,0.00009291475,0.024061883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872214,0.0003133767,0.00006524411,0.0002670079,0.0004035954,0.00022857614],"domain_scores_gemma":[0.99308103,0.004930171,0.0006552809,0.00045553685,0.00033648236,0.0005415211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012619747,0.001017854,0.0013503073,0.0025652058,0.0021962738,0.0043142335,0.0017093616,0.0013050528,0.0057051172],"category_scores_gemma":[0.006457169,0.0009412572,0.0010678296,0.0035404456,0.0032668465,0.0065041245,0.003062574,0.0024629484,0.0005042011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032519468,0.00007324179,0.0019288519,0.00017703153,0.000070120936,0.0002667242,0.0006731783,0.01187066,0.001588588,0.96527725,0.0028424666,0.014906711],"study_design_scores_gemma":[0.000055371063,0.000034644247,0.0012531625,0.00003775287,0.000062173836,0.00058591465,0.0002891265,0.023420215,0.00084691466,0.96731365,0.0060843495,0.000016708123],"about_ca_topic_score_codex":0.0010239211,"about_ca_topic_score_gemma":0.0010875086,"teacher_disagreement_score":0.0057051172,"about_ca_system_score_codex":0.001536883,"about_ca_system_score_gemma":0.0004984639,"threshold_uncertainty_score":0.019085526},"labels":[],"label_agreement":null},{"id":"W2038330747","doi":"10.1016/j.laa.2010.12.024","title":"On the graph complement conjecture for minimum rank","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Complement (music); Complement graph; Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.050713857503554616,"score_gpt":0.3019592891236169,"score_spread":0.2512454316200623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038330747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36785862,0.0049987365,0.19034801,0.073523924,0.0030620066,0.00015052412,0.0026178246,0.0013358992,0.35610446],"genre_scores_gemma":[0.92100567,0.0025220418,0.028690098,0.0062924274,0.0045129145,0.00020963576,0.002879853,0.0004961546,0.033391293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975962,0.0007798574,0.00007111468,0.0005442616,0.0006407051,0.00036773816],"domain_scores_gemma":[0.9835999,0.012178892,0.0007790849,0.0014147643,0.0010198564,0.0010075758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026852973,0.0010749963,0.002921574,0.0027499069,0.003573294,0.0064397617,0.0031719909,0.0048394557,0.024045851],"category_scores_gemma":[0.018100364,0.0009200317,0.001399541,0.0037370531,0.008290351,0.019457135,0.0048947404,0.008449421,0.0024323645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017777184,0.000063671134,0.00042449005,0.0001296275,0.000016289143,0.00007978385,0.00018836334,0.0016877119,0.00032737342,0.9775081,0.01237702,0.0070198346],"study_design_scores_gemma":[0.000022671253,0.0000061332375,0.000100411424,0.000013574144,0.0000050090357,0.00003339932,0.00004220914,0.0024154827,0.000086879365,0.9961132,0.001153366,0.0000076219103],"about_ca_topic_score_codex":0.0028468177,"about_ca_topic_score_gemma":0.002649965,"teacher_disagreement_score":0.024045851,"about_ca_system_score_codex":0.0020854364,"about_ca_system_score_gemma":0.0015372093,"threshold_uncertainty_score":0.080441415},"labels":[],"label_agreement":null},{"id":"W2038607380","doi":"10.1007/s00454-003-2872-2","title":"Metric Embeddings?Beyond One-Dimensional Distortion","year":2004,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Defense Advanced Research Projects Agency; Hebrew University of Jerusalem; National Science Foundation","keywords":"Pairwise comparison; Mathematics; Embedding; Distortion (music); Metric (unit); Combinatorics; Graph; Metric space; Discrete mathematics; Computer science; Artificial intelligence; Statistics","score_opus":0.016334324780769453,"score_gpt":0.29402775613076054,"score_spread":0.2776934313499911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038607380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15601513,0.02418074,0.57294583,0.051904812,0.0043351096,0.00009020942,0.0016403458,0.0012238483,0.18766391],"genre_scores_gemma":[0.8875622,0.010501822,0.053321254,0.0030803184,0.0033624086,0.00009760929,0.00065884675,0.0007375663,0.040677924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987859,0.00041467627,0.00006139857,0.000230601,0.00039158453,0.00011583818],"domain_scores_gemma":[0.9944277,0.0022970822,0.0006131669,0.0016131056,0.0005891813,0.00045983808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015677736,0.00094857207,0.001395297,0.0013862962,0.0010851098,0.0040073725,0.001811116,0.0021997467,0.009957184],"category_scores_gemma":[0.013834252,0.00048586554,0.00059672224,0.0015542426,0.0046618157,0.019026143,0.004345401,0.0047268793,0.0017343592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014174462,0.0000057015895,0.000071588154,0.000034021356,0.000004788621,0.00001610289,0.000045541103,0.0007806248,0.000103617516,0.98858124,0.002173202,0.008169425],"study_design_scores_gemma":[0.000005034263,0.0000066370762,0.0000490342,0.000011037436,0.0000030746346,0.00006882699,0.00004282426,0.0035527607,0.00012627317,0.9914586,0.0046677142,0.000008339435],"about_ca_topic_score_codex":0.00065369,"about_ca_topic_score_gemma":0.00042577233,"teacher_disagreement_score":0.009957184,"about_ca_system_score_codex":0.0015138793,"about_ca_system_score_gemma":0.000538012,"threshold_uncertainty_score":0.033310115},"labels":[],"label_agreement":null},{"id":"W203922734","doi":"","title":"On the (r, s) domination number of a graph.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph; Vertex (graph theory)","score_opus":0.01994224594606359,"score_gpt":0.28376223699266157,"score_spread":0.263819991046598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203922734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6286889,0.0036221142,0.116101824,0.0069977297,0.00067409297,0.00010292215,0.0023306897,0.0005302005,0.24095163],"genre_scores_gemma":[0.9604099,0.001612066,0.018927801,0.0004160863,0.0005503901,0.00015148826,0.0006015346,0.00014120853,0.017189583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871886,0.00040999823,0.00007019885,0.0002772809,0.0002838959,0.00023967499],"domain_scores_gemma":[0.9882826,0.008732977,0.00096183934,0.0006182889,0.00052706763,0.0008772234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001644109,0.00067899755,0.0008101063,0.0039606523,0.001699688,0.002954961,0.001400069,0.0013411804,0.011090606],"category_scores_gemma":[0.0104735475,0.00038289517,0.0004449736,0.0026415435,0.0033840535,0.006484081,0.0018894353,0.0020472938,0.0012537087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035197064,0.000052726708,0.0029175535,0.00020483749,0.000040190745,0.00015035216,0.00045081592,0.0107321795,0.0031073848,0.9336471,0.011053269,0.037291553],"study_design_scores_gemma":[0.000050807084,0.000057433008,0.0024006893,0.00008532637,0.000038486614,0.0004447968,0.00021930654,0.027268505,0.0020375804,0.9587157,0.0086317565,0.000049553328],"about_ca_topic_score_codex":0.0012323444,"about_ca_topic_score_gemma":0.0015618013,"teacher_disagreement_score":0.011090606,"about_ca_system_score_codex":0.002015627,"about_ca_system_score_gemma":0.0006892732,"threshold_uncertainty_score":0.037101746},"labels":[],"label_agreement":null},{"id":"W2039459495","doi":"10.1016/j.tcs.2013.11.010","title":"Approximating the minimum independent dominating set in perturbed graphs","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dominating set; Mathematics; Combinatorics; Set (abstract data type); Maximal independent set; Independent set; Discrete mathematics; Chordal graph; Computer science; Graph; 1-planar graph; Vertex (graph theory)","score_opus":0.015547689309879731,"score_gpt":0.2804480771253872,"score_spread":0.2649003878155075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039459495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49306887,0.0014420612,0.4960995,0.0011371217,0.0001488678,0.00015684738,0.000939783,0.00070824975,0.006298733],"genre_scores_gemma":[0.86341316,0.0005674815,0.13189678,0.0001628472,0.00007996376,0.00010804928,0.0010635491,0.00017412005,0.0025340214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987301,0.000442016,0.000046307483,0.00029451717,0.00032680455,0.00016026341],"domain_scores_gemma":[0.99289954,0.0050240275,0.00056619494,0.0006110816,0.00048755514,0.0004115638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537614,0.0016879331,0.002023474,0.0019080045,0.00080872915,0.0021479577,0.0031343962,0.0018215672,0.0016924477],"category_scores_gemma":[0.0126543045,0.0010495036,0.0007934153,0.0019725536,0.001279369,0.0027694758,0.0022628186,0.001852696,0.00041119198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075356686,0.00013926456,0.0022313835,0.00028603864,0.00009199964,0.0001663244,0.00020501553,0.94299287,0.005548942,0.019726425,0.0025353355,0.025322933],"study_design_scores_gemma":[0.000018190385,0.000046030254,0.0003069929,0.000013550859,0.000016060583,0.000068228284,0.000057149104,0.97032654,0.0011719806,0.02763601,0.0003338261,0.000005390437],"about_ca_topic_score_codex":0.00243039,"about_ca_topic_score_gemma":0.0024067082,"teacher_disagreement_score":0.0031343962,"about_ca_system_score_codex":0.0024405306,"about_ca_system_score_gemma":0.0007587199,"threshold_uncertainty_score":0.017707348},"labels":[],"label_agreement":null},{"id":"W2039582686","doi":"10.1007/s004530010019","title":"Linear-Time Algorithms for Partial \\boldmath k -Tree Complements","year":2000,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Time complexity; Combinatorics; Complement (music); Discrete mathematics; Algorithm; Graph; Vertex (graph theory); Theory of computation","score_opus":0.03424946569837089,"score_gpt":0.32753183504768374,"score_spread":0.29328236934931284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039582686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29062536,0.0019719985,0.58623636,0.0060841725,0.00049919786,0.00073116744,0.0046343827,0.006311352,0.102906026],"genre_scores_gemma":[0.5370952,0.0007905515,0.42866895,0.0007581774,0.00016789482,0.0004050247,0.00599483,0.0011741482,0.02494517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986971,0.00026305686,0.00008319506,0.00035128996,0.00030441297,0.00030090896],"domain_scores_gemma":[0.99542123,0.002950317,0.00019673299,0.00071645575,0.00044183587,0.00027346355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010419318,0.0011850123,0.0014296195,0.0014330919,0.0026497117,0.0056224912,0.0032807542,0.0020287752,0.028715085],"category_scores_gemma":[0.007070203,0.0011283531,0.0017113341,0.0027349659,0.002011903,0.010610315,0.004230856,0.0032957946,0.0034522717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012403262,0.0007219981,0.002468083,0.0013981144,0.00017511658,0.0003401991,0.0010613778,0.0408654,0.006036394,0.62044305,0.054862145,0.27038777],"study_design_scores_gemma":[0.0002744627,0.00009321832,0.0006777193,0.00015557063,0.00016491124,0.00038097016,0.00071526185,0.14383446,0.0077220183,0.82648957,0.019432753,0.00005913084],"about_ca_topic_score_codex":0.004948277,"about_ca_topic_score_gemma":0.011968019,"teacher_disagreement_score":0.028715085,"about_ca_system_score_codex":0.002716919,"about_ca_system_score_gemma":0.0028875635,"threshold_uncertainty_score":0.09606147},"labels":[],"label_agreement":null},{"id":"W2039732465","doi":"10.1007/s00373-006-0684-x","title":"Some Recent Progress and Applications in Graph Minor Theory","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Graph minor; Minor (academic); Combinatorics; Robertson–Seymour theorem; Mathematics; Extremal graph theory; Discrete mathematics; Conjecture; Graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.014278547458238774,"score_gpt":0.2798043015966379,"score_spread":0.26552575413839913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039732465","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016305696,0.71301556,0.12414125,0.033846643,0.009815825,0.000073324016,0.00036512918,0.00037603188,0.10206053],"genre_scores_gemma":[0.20574854,0.61228544,0.094741,0.008601346,0.04725742,0.00014543628,0.00076131715,0.00029184963,0.030167634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887806,0.00035042985,0.00007643127,0.0002982903,0.00029915865,0.00009762191],"domain_scores_gemma":[0.99341327,0.0047447584,0.00024252279,0.00052751193,0.0007755972,0.00029636064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031131876,0.0010723093,0.0012842531,0.004154722,0.0015525188,0.0039734435,0.0021864148,0.002086398,0.0064667887],"category_scores_gemma":[0.00804512,0.0006078969,0.00097628246,0.007620554,0.0054901806,0.00914024,0.0023969419,0.0043113953,0.0021450622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009099136,0.000119412696,0.00084512157,0.0019690795,0.000051524778,0.00016445309,0.0004947169,0.0029779787,0.001064594,0.740546,0.03438351,0.21729265],"study_design_scores_gemma":[0.000013721565,0.000050152743,0.00056342065,0.00020598403,0.000030971725,0.00025565593,0.00019659106,0.004053659,0.0004895847,0.8171568,0.17695333,0.000030163776],"about_ca_topic_score_codex":0.0009917156,"about_ca_topic_score_gemma":0.0010977826,"teacher_disagreement_score":0.0064667887,"about_ca_system_score_codex":0.0017936204,"about_ca_system_score_gemma":0.000874409,"threshold_uncertainty_score":0.021633506},"labels":[],"label_agreement":null},{"id":"W2039826584","doi":"10.3390/a6010043","title":"Computational Study on a PTAS for Planar Dominating Set Problem","year":2013,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dominating set; Mathematics; Polynomial-time approximation scheme; Approximation algorithm; Planar; Planar graph; Combinatorics; Planar straight-line graph; Bounded function; Computational complexity theory; Graph; Independent set; Discrete mathematics; Algorithm; Pathwidth; Computer science; Line graph; Mathematical analysis","score_opus":0.03896625998283992,"score_gpt":0.3349611390252531,"score_spread":0.2959948790424132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039826584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.248001,0.002204252,0.6970792,0.006480894,0.00045327347,0.0007706762,0.0014803481,0.001916028,0.04161446],"genre_scores_gemma":[0.5408916,0.0012237673,0.44623172,0.0007376338,0.0002867905,0.0006220341,0.0024323144,0.00032737077,0.007246755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970265,0.00091538887,0.0001574731,0.000737637,0.0007777147,0.00038532694],"domain_scores_gemma":[0.9871911,0.009089769,0.0005946016,0.001875913,0.00081892684,0.0004295609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024359515,0.0016302484,0.0017340834,0.0014502903,0.001671491,0.0027143955,0.00391308,0.0016971494,0.01218719],"category_scores_gemma":[0.014441641,0.0006801861,0.002206258,0.0038473906,0.0019200597,0.0075427094,0.002702533,0.003690019,0.0011849462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021642079,0.00084761094,0.0037056985,0.0011702151,0.00017960949,0.00037819325,0.00024632164,0.72954345,0.008346844,0.11743486,0.018888941,0.117094085],"study_design_scores_gemma":[0.00014870171,0.0001643846,0.0004492305,0.000018493285,0.000057927788,0.00016839894,0.00006864205,0.9592011,0.0016368526,0.03498666,0.003079748,0.000019862457],"about_ca_topic_score_codex":0.0058486685,"about_ca_topic_score_gemma":0.00579113,"teacher_disagreement_score":0.01218719,"about_ca_system_score_codex":0.0030847376,"about_ca_system_score_gemma":0.0032474,"threshold_uncertainty_score":0.040770173},"labels":[],"label_agreement":null},{"id":"W2040122307","doi":"10.1016/j.tcs.2011.05.021","title":"Shortest paths between shortest paths","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"K shortest path routing; Shortest path problem; Shortest Path Faster Algorithm; Combinatorics; Yen's algorithm; Euclidean shortest path; Mathematics; Distance; Sequence (biology); Vertex (graph theory); Control reconfiguration; Floyd–Warshall algorithm; Longest path problem; Discrete mathematics; Graph; Computer science; Dijkstra's algorithm; Biology","score_opus":0.03888412546932748,"score_gpt":0.2914092214865761,"score_spread":0.25252509601724865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040122307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17243601,0.0029106068,0.7291766,0.0024524296,0.0008299299,0.0010518045,0.015891908,0.0020100554,0.073240675],"genre_scores_gemma":[0.38622513,0.0036635515,0.5438222,0.00047993485,0.000229311,0.0009422189,0.015252436,0.0005980786,0.04878704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914324,0.00014307382,0.00006354314,0.00029115722,0.0002577904,0.00010125667],"domain_scores_gemma":[0.9976671,0.0012019244,0.00028807504,0.00024584078,0.00039244915,0.00020468413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046993818,0.0010272636,0.0007465656,0.0031408824,0.0013737346,0.0017937064,0.0012518764,0.0012425794,0.019688062],"category_scores_gemma":[0.0052101016,0.00067971204,0.0008577683,0.0039188587,0.000705689,0.0038632976,0.0021021273,0.0016719254,0.0030567325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079927675,0.0002992497,0.0028209502,0.0025839037,0.00036807722,0.0008509616,0.001079338,0.06016086,0.018665694,0.5042873,0.039238047,0.3688464],"study_design_scores_gemma":[0.00014641756,0.00024371612,0.0016669402,0.00027962998,0.0001592707,0.0006763691,0.0006537906,0.059023883,0.0075455755,0.80444366,0.12510167,0.000059109607],"about_ca_topic_score_codex":0.001375475,"about_ca_topic_score_gemma":0.002414416,"teacher_disagreement_score":0.019688062,"about_ca_system_score_codex":0.00093006704,"about_ca_system_score_gemma":0.0013009277,"threshold_uncertainty_score":0.06586313},"labels":[],"label_agreement":null},{"id":"W2040241884","doi":"10.1016/j.disc.2007.10.002","title":"Open irredundance and maximum degree in graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Vertex (graph theory); Graph; Cardinality (data modeling); Discrete mathematics; Independent set; Computer science","score_opus":0.07577418455312727,"score_gpt":0.3270013896165228,"score_spread":0.2512272050633955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040241884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8791969,0.0018410292,0.07712783,0.0037685547,0.0001476075,0.000042917083,0.000426051,0.00024128165,0.037207976],"genre_scores_gemma":[0.990743,0.00060218235,0.005032801,0.00014183928,0.00021780103,0.00003403782,0.00018258662,0.00004287751,0.003002878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872905,0.0003406843,0.00007268153,0.00031478485,0.00026331627,0.0002794419],"domain_scores_gemma":[0.982979,0.012197646,0.0015801449,0.00092974486,0.0007657732,0.0015476327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023305004,0.0007997711,0.0014986992,0.0031466328,0.0034372266,0.0043465877,0.0020246133,0.0014539971,0.0040217848],"category_scores_gemma":[0.011123771,0.0010138472,0.0009989543,0.0028140189,0.008545183,0.009384169,0.0028705115,0.003993306,0.00034746405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001769009,0.000058867205,0.0025975872,0.000116531955,0.000019691566,0.00015839384,0.0018449167,0.002668023,0.0017618831,0.9816243,0.0007781748,0.008194756],"study_design_scores_gemma":[0.000012921686,0.000011024692,0.00046936134,0.000010741948,0.000009356758,0.00007330275,0.00018040843,0.001505413,0.00035369635,0.99685764,0.0005081038,0.000008039288],"about_ca_topic_score_codex":0.0011223942,"about_ca_topic_score_gemma":0.001638296,"teacher_disagreement_score":0.0043465877,"about_ca_system_score_codex":0.001385321,"about_ca_system_score_gemma":0.0005627343,"threshold_uncertainty_score":0.013454258},"labels":[],"label_agreement":null},{"id":"W2040255444","doi":"10.1016/j.jctb.2011.09.001","title":"Decomposing locally semicomplete digraphs into strong spanning subdigraphs","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Digraph; Combinatorics; Partition (number theory); Disjoint sets; Arc (geometry); Discrete mathematics","score_opus":0.02491616962830137,"score_gpt":0.27327887964117825,"score_spread":0.24836271001287688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040255444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5586319,0.00028275274,0.40228486,0.00035672277,0.00007938918,0.00017538603,0.0007258901,0.0005709347,0.03689217],"genre_scores_gemma":[0.866774,0.00035621977,0.11407646,0.0002496479,0.000079489284,0.00012858176,0.0013592518,0.00021285343,0.01676341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997296,0.00004451792,0.000021922302,0.000082870916,0.00006178922,0.00005931165],"domain_scores_gemma":[0.99853516,0.00061563496,0.0001594483,0.00026839998,0.00017829132,0.00024300512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032680167,0.0004223925,0.00057201914,0.0011061371,0.0008191433,0.0013663026,0.00065397605,0.0005616931,0.0068833176],"category_scores_gemma":[0.0016095549,0.00050308375,0.0005746857,0.0012590374,0.0008604853,0.0024518054,0.001543697,0.0015136112,0.0008355579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012465456,0.000117513926,0.0017989303,0.00021288847,0.000039333456,0.0005644419,0.0010219616,0.014610404,0.010708917,0.924351,0.0027210186,0.04372896],"study_design_scores_gemma":[0.00001994094,0.00004981858,0.0009509217,0.000032141925,0.00003508496,0.00028389684,0.0003651163,0.03892407,0.002031664,0.95253843,0.0047573075,0.000011594788],"about_ca_topic_score_codex":0.00064606906,"about_ca_topic_score_gemma":0.001775253,"teacher_disagreement_score":0.0068833176,"about_ca_system_score_codex":0.00039734907,"about_ca_system_score_gemma":0.0004307244,"threshold_uncertainty_score":0.023027003},"labels":[],"label_agreement":null},{"id":"W2040573390","doi":"10.1007/s003730070024","title":"Longest Cycles in Almost Claw-Free Graphs","year":2000,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Claw; Mathematics; Chordal graph; Graph; Pancyclic graph; Clique-sum; Discrete mathematics; 1-planar graph; Biology","score_opus":0.01351657810913522,"score_gpt":0.2533493710628817,"score_spread":0.23983279295374646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040573390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9297163,0.0012648196,0.041156672,0.0009888016,0.00008111038,0.000092682305,0.0008841577,0.0004647153,0.025350738],"genre_scores_gemma":[0.9674246,0.0007975895,0.01638059,0.00041591542,0.00008934917,0.00011517058,0.0012072168,0.00018517658,0.013384385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936885,0.00010334429,0.000044294426,0.00016514417,0.0001582929,0.00016004001],"domain_scores_gemma":[0.995968,0.0020013403,0.0006892012,0.00029401007,0.00042400748,0.00062342925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044372556,0.0007134961,0.0007748588,0.0028457267,0.0020900278,0.002777418,0.0015602665,0.0013276942,0.0059773372],"category_scores_gemma":[0.0039270404,0.001046141,0.0005990035,0.0036341802,0.0014941535,0.004626366,0.0020599274,0.001239623,0.0006384325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073883036,0.00026054168,0.0069409506,0.00068189343,0.00012931754,0.0008864616,0.0021579643,0.018949566,0.01760135,0.8660512,0.009677511,0.07592437],"study_design_scores_gemma":[0.000058516052,0.000056524284,0.0018395965,0.00006270281,0.000060709463,0.0003414642,0.00046435808,0.016102655,0.0034067284,0.97259605,0.0049775303,0.000033113887],"about_ca_topic_score_codex":0.0031877777,"about_ca_topic_score_gemma":0.0062562954,"teacher_disagreement_score":0.0059773372,"about_ca_system_score_codex":0.0013103893,"about_ca_system_score_gemma":0.0008444939,"threshold_uncertainty_score":0.019996166},"labels":[],"label_agreement":null},{"id":"W2040632432","doi":"10.1016/j.ejc.2015.02.009","title":"Planar emulators conjecture is nearly true for cubic graphs","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Cubic graph; Planar; Planar graph; Polyhedral graph; Graph; Discrete mathematics; 1-planar graph; Chordal graph; Computer science; Line graph; Computer graphics (images)","score_opus":0.040647873983149146,"score_gpt":0.28536969998990297,"score_spread":0.24472182600675382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040632432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4867101,0.0055083456,0.10870385,0.061223365,0.0029671402,0.00016954007,0.006124205,0.0036618575,0.32493153],"genre_scores_gemma":[0.9525164,0.002118299,0.015208469,0.0057490687,0.0013326667,0.00012539614,0.0032566749,0.0006192631,0.019073712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977465,0.00043364783,0.00008629111,0.0007368411,0.0005034927,0.0004933076],"domain_scores_gemma":[0.9901984,0.0055629057,0.0006652357,0.0023332033,0.0007472865,0.00049292954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015123816,0.0011708573,0.0018700084,0.0013388474,0.0036767425,0.0056039775,0.0028461898,0.003795907,0.020632718],"category_scores_gemma":[0.017032323,0.0010290717,0.0014309018,0.0021932882,0.004351673,0.015159612,0.005200255,0.007555521,0.0036480748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012180287,0.00013991649,0.003941486,0.0008330767,0.00014024219,0.0005296191,0.0005478096,0.009827381,0.0030551115,0.8795639,0.058934662,0.041268736],"study_design_scores_gemma":[0.00007079233,0.00002495737,0.0005412002,0.000052396896,0.00005023074,0.00019707756,0.00026535694,0.0053739017,0.0013965645,0.98047274,0.011530919,0.000023867486],"about_ca_topic_score_codex":0.002068603,"about_ca_topic_score_gemma":0.002275625,"teacher_disagreement_score":0.020632718,"about_ca_system_score_codex":0.0016145717,"about_ca_system_score_gemma":0.0011468546,"threshold_uncertainty_score":0.06902331},"labels":[],"label_agreement":null},{"id":"W2040720394","doi":"10.1016/j.jctb.2012.05.002","title":"Spectrally degenerate graphs: Hereditary case","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Degenerate energy levels; Combinatorics; Upper and lower bounds; Converse; Mathematics; Spectral radius; Vertex (graph theory); Graph; Degree (music); Discrete mathematics; Physics; Quantum mechanics; Mathematical analysis; Geometry","score_opus":0.016353382331158694,"score_gpt":0.27266766040740703,"score_spread":0.25631427807624835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040720394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7804892,0.00051986624,0.06524559,0.002324192,0.0001842903,0.00005246676,0.00046270192,0.0003225367,0.15039915],"genre_scores_gemma":[0.98789513,0.00020211817,0.005032214,0.00021021154,0.00013757011,0.000020789044,0.00015115966,0.00003736087,0.0063134627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990085,0.00019912551,0.00006187516,0.00022126395,0.00027162905,0.00023753465],"domain_scores_gemma":[0.99682355,0.0012321229,0.0005316511,0.00052030873,0.00034261378,0.0005497571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010345028,0.00042062855,0.0007142139,0.0018742123,0.00257083,0.0025811004,0.0014709983,0.0015659506,0.00929267],"category_scores_gemma":[0.0059917583,0.00062544504,0.00051120186,0.0016418737,0.0036350128,0.0037612075,0.0018620349,0.0011703076,0.0006418157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041283918,0.00005414825,0.0011748704,0.00005300601,0.000011686896,0.0006126039,0.00025550334,0.0010325768,0.000578268,0.99127215,0.0016116254,0.0033022128],"study_design_scores_gemma":[0.000028528397,0.000014299033,0.0006004991,0.0000155891,0.000017249768,0.0012793824,0.0003023702,0.009201671,0.0004674868,0.9866137,0.0014482212,0.00001093491],"about_ca_topic_score_codex":0.0010152821,"about_ca_topic_score_gemma":0.0013005349,"teacher_disagreement_score":0.00929267,"about_ca_system_score_codex":0.00068902224,"about_ca_system_score_gemma":0.00062206003,"threshold_uncertainty_score":0.03108704},"labels":[],"label_agreement":null},{"id":"W2041621858","doi":"10.1007/s10878-008-9203-8","title":"Well paired-dominated graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Prince Edward Island","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Induced subgraph; Matching (statistics); Cardinality (data modeling); Set (abstract data type); Discrete mathematics; Theory of computation; Graph; Computer science; Vertex (graph theory); Algorithm","score_opus":0.014786778482132978,"score_gpt":0.2552395727820874,"score_spread":0.24045279429995445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041621858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30706415,0.0020684733,0.4268905,0.007892941,0.00056869775,0.00038916385,0.00240141,0.00097349385,0.2517512],"genre_scores_gemma":[0.80444443,0.0020246024,0.111572586,0.0035451306,0.0007543435,0.000717059,0.0026774295,0.0004927433,0.073771596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997624,0.00092185044,0.00009573882,0.00053605216,0.0005168615,0.00030556647],"domain_scores_gemma":[0.9866572,0.00812238,0.00076236,0.0012136603,0.0016217014,0.0016226637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027200747,0.001874339,0.0023198163,0.0024379082,0.002821644,0.0059825783,0.0026889225,0.003111797,0.01945089],"category_scores_gemma":[0.014876872,0.0017177067,0.0013164148,0.002126603,0.0026480085,0.00879354,0.003413986,0.005694233,0.0032063457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035477564,0.00022365351,0.0011544354,0.00023710699,0.0001087419,0.00022910953,0.00028161771,0.009961997,0.0027484193,0.94716406,0.01803073,0.019505396],"study_design_scores_gemma":[0.000059388276,0.000043361884,0.0002927149,0.00003069658,0.00004156076,0.00028940514,0.00010735884,0.019626236,0.0011490918,0.9741169,0.0042271796,0.000016176471],"about_ca_topic_score_codex":0.00042193633,"about_ca_topic_score_gemma":0.0008870237,"teacher_disagreement_score":0.01945089,"about_ca_system_score_codex":0.0015286927,"about_ca_system_score_gemma":0.0011191885,"threshold_uncertainty_score":0.065069735},"labels":[],"label_agreement":null},{"id":"W2042269609","doi":"10.1016/j.disc.2004.05.003","title":"Tight bounds on maximal and maximum matchings","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Upper and lower bounds; Planar graph; Discrete mathematics; Graph; Class (philosophy); Degree (music); Computer science","score_opus":0.01734329773186264,"score_gpt":0.28195897687854693,"score_spread":0.26461567914668427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042269609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1612966,0.021846801,0.56750935,0.027868807,0.0016001167,0.0004744592,0.007836405,0.004339767,0.20722772],"genre_scores_gemma":[0.7987635,0.0121235745,0.13111036,0.0051195915,0.0045152777,0.0009646643,0.005775406,0.0032560807,0.038371596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9852771,0.00317545,0.0006759708,0.0029248092,0.0039940896,0.0039525223],"domain_scores_gemma":[0.87085557,0.10057786,0.0053874883,0.010896371,0.0042832294,0.007999386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013264155,0.0064377575,0.009555369,0.010631209,0.006363899,0.01740915,0.01592717,0.0072685387,0.03597095],"category_scores_gemma":[0.105882466,0.0068228566,0.0046717036,0.01629426,0.0100085605,0.049508348,0.018229863,0.017414501,0.0058210245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025434436,0.00047979408,0.0019039705,0.0012636901,0.00024701003,0.00017750892,0.00091689755,0.047097106,0.0033100517,0.8682785,0.028185217,0.045596845],"study_design_scores_gemma":[0.000104804014,0.000060111488,0.000560595,0.00013941462,0.00013844491,0.00011787028,0.00011614064,0.04067389,0.0011470105,0.95219076,0.0047101644,0.0000408239],"about_ca_topic_score_codex":0.0031885933,"about_ca_topic_score_gemma":0.0052214605,"teacher_disagreement_score":0.03597095,"about_ca_system_score_codex":0.009890309,"about_ca_system_score_gemma":0.004043132,"threshold_uncertainty_score":0.12033486},"labels":[],"label_agreement":null},{"id":"W2042465032","doi":"10.1016/j.ejc.2011.03.013","title":"Interleaved adjoints of directed graphs","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.039698541488880044,"score_gpt":0.25137634195446207,"score_spread":0.21167780046558202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042465032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30460566,0.00040804918,0.6293769,0.000654697,0.00054248376,0.00009391756,0.00023483274,0.0009941201,0.06308933],"genre_scores_gemma":[0.87741685,0.00034698978,0.093462676,0.00037197876,0.00020374903,0.00011353728,0.00033848823,0.00040461138,0.02734109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828917,0.0004552041,0.0001159607,0.000326309,0.00044573026,0.00036774014],"domain_scores_gemma":[0.9958807,0.0020649466,0.000297275,0.00049599994,0.0006286726,0.00063238334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017911887,0.00056777225,0.00058124785,0.0023151548,0.0016027328,0.0032952495,0.0012993241,0.001315971,0.007781953],"category_scores_gemma":[0.004893498,0.00067679683,0.0009948096,0.0012068019,0.0026132665,0.0051548183,0.0032745262,0.0031129906,0.0011112251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038928698,0.000045884357,0.00018210913,0.000017111886,0.000004988769,0.00012287736,0.00036633015,0.0008989785,0.0013807828,0.98969406,0.00041207604,0.0068358565],"study_design_scores_gemma":[0.000012610942,0.00001602073,0.00007003617,0.000011206908,0.000007718123,0.00007374943,0.00012031821,0.0055345343,0.0010235482,0.99046993,0.0026488656,0.000011403557],"about_ca_topic_score_codex":0.00076344435,"about_ca_topic_score_gemma":0.0010119057,"teacher_disagreement_score":0.007781953,"about_ca_system_score_codex":0.00085419137,"about_ca_system_score_gemma":0.00061090203,"threshold_uncertainty_score":0.026033223},"labels":[],"label_agreement":null},{"id":"W2042811967","doi":"10.1016/j.dam.2006.10.015","title":"Generalization of matching extensions in graphs (II)","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Generalization; Matching (statistics); Discrete mathematics; Graph","score_opus":0.015407767139256798,"score_gpt":0.27308289447956163,"score_spread":0.25767512734030484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042811967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30108544,0.0014805758,0.41290656,0.0037301425,0.0013830662,0.00026318833,0.001309467,0.0014166061,0.27642494],"genre_scores_gemma":[0.85717326,0.0015529802,0.08128564,0.0015836734,0.0012779353,0.00019114019,0.0010043178,0.00038550707,0.055545576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937576,0.00012088594,0.000044647295,0.00024261781,0.0001146627,0.00010150679],"domain_scores_gemma":[0.9987991,0.00028823141,0.0001546759,0.00036470633,0.0001794087,0.00021381008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007856955,0.0005706311,0.00067014963,0.0013036683,0.0012405744,0.0016599031,0.0011244521,0.0010121424,0.009786847],"category_scores_gemma":[0.0027487932,0.00032012153,0.0015730065,0.001341956,0.0013297803,0.0053733606,0.0029141451,0.00324148,0.0013522169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053749405,0.00005314601,0.00034760713,0.00009424179,0.000014327851,0.00019539816,0.00029154442,0.0013457147,0.0022681395,0.97631615,0.0036205554,0.015399346],"study_design_scores_gemma":[0.000013168219,0.00002250795,0.00037371437,0.000022523755,0.0000143906145,0.00035240303,0.00009678597,0.004299923,0.00082536705,0.9829008,0.011067735,0.000010611216],"about_ca_topic_score_codex":0.0010006416,"about_ca_topic_score_gemma":0.00079174916,"teacher_disagreement_score":0.009786847,"about_ca_system_score_codex":0.0007700132,"about_ca_system_score_gemma":0.0005054079,"threshold_uncertainty_score":0.032740235},"labels":[],"label_agreement":null},{"id":"W204285469","doi":"","title":"Packing Three-Vertex Paths in 2-Connected Cubic Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Polyhedral graph; Cubic graph; Chordal graph; 1-planar graph; Graph; Line graph","score_opus":0.02290155658983611,"score_gpt":0.2636769478942789,"score_spread":0.2407753913044428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204285469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75584906,0.0017116048,0.13654996,0.0011645345,0.0004158799,0.00024868894,0.0022991428,0.0014977831,0.10026331],"genre_scores_gemma":[0.92104995,0.00080305134,0.058552135,0.00024774487,0.000051145184,0.000114367824,0.0012756432,0.00018769482,0.017718222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995733,0.000080965736,0.000021627078,0.00006819292,0.00010140754,0.000154525],"domain_scores_gemma":[0.99913967,0.0003979094,0.0001321624,0.00015017882,0.00005633645,0.00012368661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001779885,0.00048183135,0.00057375606,0.0009966372,0.0014387545,0.0013708626,0.0009756465,0.001493763,0.014561352],"category_scores_gemma":[0.002028667,0.0004985119,0.0004458901,0.0021235996,0.00066357845,0.0021433022,0.002060393,0.0008576449,0.0020450747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015625812,0.00052688806,0.0052792244,0.0011686623,0.00014548379,0.0028194084,0.001688341,0.16926292,0.025573924,0.43474576,0.041855175,0.31537163],"study_design_scores_gemma":[0.00019968727,0.00031611556,0.0033250041,0.00019424268,0.00006724997,0.0012278752,0.0012265071,0.24880375,0.011419713,0.7022122,0.03093315,0.00007455266],"about_ca_topic_score_codex":0.0031067482,"about_ca_topic_score_gemma":0.005610087,"teacher_disagreement_score":0.014561352,"about_ca_system_score_codex":0.0006046278,"about_ca_system_score_gemma":0.000656753,"threshold_uncertainty_score":0.04871261},"labels":[],"label_agreement":null},{"id":"W2042880596","doi":"10.1016/s0012-365x(00)00075-3","title":"Stable 2-pairs and (X,Y)-intersection graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Intersection (aeronautics); Discrete mathematics","score_opus":0.022613387874989576,"score_gpt":0.286789227492788,"score_spread":0.26417583961779845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042880596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.675548,0.0013376378,0.1771453,0.0035557474,0.00039147877,0.00017896116,0.0012357379,0.00064412993,0.13996306],"genre_scores_gemma":[0.94034445,0.0007411145,0.032615382,0.0004707132,0.00015654233,0.00021860741,0.0011426153,0.00018903385,0.024121555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912757,0.0002376969,0.000048819165,0.0002120679,0.00016839875,0.00020543899],"domain_scores_gemma":[0.9980574,0.00079475367,0.00045073032,0.00015399195,0.0002544711,0.00028860715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079142366,0.00088327687,0.0009718428,0.002864875,0.005036768,0.0053339964,0.0014106749,0.0022633667,0.0136926845],"category_scores_gemma":[0.0025442154,0.0010746921,0.0010028258,0.0034998462,0.002686485,0.007845248,0.0033740492,0.0028143974,0.0017141781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104712155,0.000024324594,0.0006747389,0.000036961937,0.000014532443,0.00019449442,0.00044444704,0.000732689,0.00076953607,0.9905992,0.001688484,0.0047159763],"study_design_scores_gemma":[0.000032060725,0.000021895252,0.00043567608,0.000016654489,0.0000192217,0.0002464793,0.0004971626,0.0026397398,0.0012525704,0.9900267,0.004795649,0.000016223988],"about_ca_topic_score_codex":0.0012885869,"about_ca_topic_score_gemma":0.0012515653,"teacher_disagreement_score":0.0136926845,"about_ca_system_score_codex":0.001403211,"about_ca_system_score_gemma":0.0006082846,"threshold_uncertainty_score":0.045806587},"labels":[],"label_agreement":null},{"id":"W2043020651","doi":"10.1016/s0012-365x(03)00084-0","title":"On upper domination Ramsey numbers for graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Ramsey's theorem; Mathematics; Domination analysis; Graph; Independence number; Integer (computer science); Dominating set; Upper and lower bounds; Cardinality (data modeling); Discrete mathematics; Vertex (graph theory)","score_opus":0.020983167306812715,"score_gpt":0.3109859675149543,"score_spread":0.29000280020814156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043020651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48047918,0.008601656,0.23370971,0.010601157,0.0008755241,0.0001538818,0.0011670138,0.0009724888,0.26343936],"genre_scores_gemma":[0.93058753,0.004021445,0.034967646,0.0015389605,0.0010879507,0.0002914456,0.0006945042,0.00027955812,0.026530974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982331,0.0004926904,0.00008176653,0.00033911024,0.00045030777,0.00040304358],"domain_scores_gemma":[0.9819318,0.014078929,0.00091097696,0.0010891171,0.00068501546,0.0013042685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004030835,0.0013184751,0.0017886168,0.004595892,0.0033866372,0.0052995095,0.0024304434,0.0017182963,0.0136022065],"category_scores_gemma":[0.015945604,0.0010239055,0.001048269,0.00434206,0.005235113,0.014286526,0.005066092,0.0068236734,0.0012300109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019153592,0.000056846984,0.0006476432,0.00013422595,0.000013814397,0.000053182634,0.000605732,0.003556812,0.000957182,0.9747107,0.0039935084,0.015078785],"study_design_scores_gemma":[0.000018125353,0.000018179364,0.00037499232,0.000034370296,0.000011579777,0.00005253615,0.00010118152,0.005082288,0.0003038094,0.99141276,0.0025743307,0.000015763897],"about_ca_topic_score_codex":0.0015584016,"about_ca_topic_score_gemma":0.0025814774,"teacher_disagreement_score":0.0136022065,"about_ca_system_score_codex":0.0031451688,"about_ca_system_score_gemma":0.0010165423,"threshold_uncertainty_score":0.045503855},"labels":[],"label_agreement":null},{"id":"W2043779144","doi":"10.1006/jctb.2001.2077","title":"The Numbers of Dependent k-Sets in a Graph Are Log Concave","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Graph; Mathematics; Complement graph; Discrete mathematics; Graph power; Line graph","score_opus":0.01685087307057495,"score_gpt":0.2667885007855626,"score_spread":0.24993762771498765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043779144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68407005,0.00076670485,0.24828741,0.006290983,0.00024886776,0.00020254738,0.0022731104,0.0007945524,0.057065826],"genre_scores_gemma":[0.9234638,0.0009208487,0.04739185,0.0006158799,0.00038733456,0.00058176694,0.0012620019,0.00051305426,0.024863513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976502,0.0007234448,0.00016872933,0.0004986626,0.00060680637,0.0003521407],"domain_scores_gemma":[0.9442139,0.043478787,0.0033086594,0.0036825463,0.0024904434,0.0028255712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024483837,0.0011621973,0.0018341264,0.0023809548,0.002914216,0.0069128806,0.0049047424,0.0023981268,0.0110607315],"category_scores_gemma":[0.035435494,0.002169702,0.0013686202,0.0022347355,0.005684131,0.012867151,0.0024674595,0.004247252,0.0019117576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006198315,0.00014819982,0.0062371283,0.00033382155,0.000063072315,0.0003078856,0.0005296022,0.025475284,0.005886496,0.9323593,0.0075963265,0.020443097],"study_design_scores_gemma":[0.00008724918,0.00006855186,0.0044189175,0.00007323598,0.00006025935,0.00095515593,0.00024166505,0.12937523,0.0032846704,0.8571576,0.004200444,0.00007692762],"about_ca_topic_score_codex":0.0009710889,"about_ca_topic_score_gemma":0.0015320961,"teacher_disagreement_score":0.0110607315,"about_ca_system_score_codex":0.0032587969,"about_ca_system_score_gemma":0.0012967483,"threshold_uncertainty_score":0.03700185},"labels":[],"label_agreement":null},{"id":"W2044097137","doi":"10.1002/jgt.10133","title":"Graphs embedded in the plane with a bounded number of accumulation points","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Embedding; Bounded function; Planar graph; Vertex (graph theory); 1-planar graph; Discrete mathematics; Plane (geometry); Chordal graph; Characterization (materials science); Graph; Geometry; Mathematical analysis; Computer science","score_opus":0.027516363535805933,"score_gpt":0.3258557425078503,"score_spread":0.2983393789720444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044097137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9185014,0.00026565802,0.06745741,0.00018731563,0.000012500106,0.00002881608,0.00026151392,0.0001843887,0.013101106],"genre_scores_gemma":[0.9876446,0.00017713747,0.008472314,0.000022749446,0.000013553904,0.000030874784,0.00032380773,0.000021459804,0.0032935077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996755,0.00004796769,0.000026035994,0.00007880257,0.00008720304,0.000084490915],"domain_scores_gemma":[0.998887,0.00035587512,0.00025976993,0.00012481764,0.00018589919,0.00018663798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018568072,0.0005129451,0.00054949516,0.0018257328,0.0009423389,0.0019906047,0.000643847,0.0004374228,0.0023729333],"category_scores_gemma":[0.0010674471,0.00034293855,0.00047160374,0.0010050179,0.0016849033,0.0027300008,0.0014965929,0.0007299741,0.00041774186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067229127,0.00009703171,0.006444877,0.00016766488,0.000084152,0.0014617557,0.0010737907,0.041359786,0.03598677,0.8808314,0.001688024,0.030132422],"study_design_scores_gemma":[0.000052563177,0.00013656572,0.003951519,0.0000597942,0.000069148235,0.0011221314,0.000668198,0.077683814,0.019855749,0.8873376,0.009012491,0.00005042029],"about_ca_topic_score_codex":0.0014256584,"about_ca_topic_score_gemma":0.001232733,"teacher_disagreement_score":0.0023729333,"about_ca_system_score_codex":0.00081017416,"about_ca_system_score_gemma":0.00026208686,"threshold_uncertainty_score":0.007938206},"labels":[],"label_agreement":null},{"id":"W2044878800","doi":"10.1016/s0012-365x(99)00323-4","title":"On the girth of digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Girth (graph theory); Counterexample; Order (exchange); Discrete mathematics","score_opus":0.020229973716509912,"score_gpt":0.2800074361875158,"score_spread":0.25977746247100586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044878800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7393777,0.0034230084,0.13828112,0.004863621,0.0005661475,0.000087679335,0.0012339117,0.00048771792,0.111679144],"genre_scores_gemma":[0.95339435,0.0032348745,0.02354716,0.0007082845,0.0007156992,0.00010963562,0.0008448905,0.00029645718,0.017148564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864596,0.00043329745,0.00005646989,0.00026042896,0.0003519362,0.00025204598],"domain_scores_gemma":[0.9858635,0.010484507,0.0008415199,0.00096757675,0.0006257433,0.0012172661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013584619,0.0010116088,0.0016959953,0.0046512475,0.0020756489,0.0034204586,0.002123452,0.0017409514,0.010218001],"category_scores_gemma":[0.0115082525,0.0012841014,0.00100951,0.0036350074,0.004555476,0.0065493244,0.0048831133,0.0043975213,0.0012416726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017309819,0.000049725215,0.0017020496,0.00015666898,0.000039305996,0.00014553356,0.00076078234,0.011921982,0.0015474741,0.95974654,0.004190703,0.019566078],"study_design_scores_gemma":[0.000016058124,0.000021509673,0.00044033726,0.000033443626,0.000015546058,0.00009686607,0.000102046,0.008111181,0.00025164062,0.98879236,0.0021075842,0.000011459556],"about_ca_topic_score_codex":0.0010522958,"about_ca_topic_score_gemma":0.0012035146,"teacher_disagreement_score":0.010218001,"about_ca_system_score_codex":0.0017081512,"about_ca_system_score_gemma":0.0005526635,"threshold_uncertainty_score":0.034182608},"labels":[],"label_agreement":null},{"id":"W2045037050","doi":"10.1016/j.ipl.2010.05.019","title":"Upper signed k-domination in a general graph","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Domination analysis; Mathematics; Upper and lower bounds; Graph; Computer science; Discrete mathematics; Vertex (graph theory)","score_opus":0.007070255514333437,"score_gpt":0.258272288875039,"score_spread":0.25120203336070557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045037050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7867482,0.00055759563,0.14041893,0.0015294753,0.00014101129,0.00009047973,0.00067724806,0.0003407295,0.06949632],"genre_scores_gemma":[0.9519784,0.00032481342,0.022403505,0.00038340144,0.00009103786,0.00009631465,0.0004724687,0.0001574482,0.024092535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998973,0.00021557572,0.000055242224,0.00022222736,0.00029215834,0.00024179305],"domain_scores_gemma":[0.99430865,0.0031244054,0.00065311685,0.0005630928,0.00062485156,0.0007258331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008527856,0.0005880472,0.0009431824,0.0019819255,0.0019302572,0.0029881713,0.001537516,0.0011240231,0.008715075],"category_scores_gemma":[0.005084471,0.0004340846,0.0006036245,0.0017405429,0.0019321193,0.003757482,0.0019623963,0.0016805906,0.0009060994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038365173,0.00013147542,0.0018607593,0.00024660814,0.000040925115,0.0009789754,0.0009230611,0.014766041,0.013286034,0.9366478,0.0047218306,0.026012855],"study_design_scores_gemma":[0.0000438241,0.000042005508,0.0011878825,0.00003614108,0.000023794233,0.0005162722,0.00022184048,0.049293343,0.0032703865,0.9421041,0.0032284604,0.000031969394],"about_ca_topic_score_codex":0.0010409262,"about_ca_topic_score_gemma":0.0019700937,"teacher_disagreement_score":0.008715075,"about_ca_system_score_codex":0.0011378098,"about_ca_system_score_gemma":0.0007163931,"threshold_uncertainty_score":0.029154778},"labels":[],"label_agreement":null},{"id":"W2045237424","doi":"10.1016/j.jctb.2008.01.003","title":"Locally planar graphs are 5-choosable","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar graph; Planar; Enhanced Data Rates for GSM Evolution; Graph; Computer science; Mathematics; Combinatorics; Telecommunications; Computer graphics (images)","score_opus":0.01650812458121698,"score_gpt":0.25320838278942615,"score_spread":0.23670025820820917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045237424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80297726,0.0007390592,0.036213152,0.0013374685,0.00014477813,0.00017768012,0.0027107056,0.0016058775,0.15409401],"genre_scores_gemma":[0.9431272,0.0005377575,0.012562148,0.0003489329,0.00008899524,0.00016281032,0.0030450337,0.00037889532,0.039748173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942446,0.000056117016,0.000043356387,0.00017664059,0.00015479917,0.00014468249],"domain_scores_gemma":[0.9979759,0.0010280615,0.00037804377,0.00020932227,0.00012998986,0.0002786117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031946847,0.0008646873,0.0014552445,0.0011051617,0.0016218207,0.0041682073,0.0019086257,0.0014071522,0.033528943],"category_scores_gemma":[0.0016375374,0.0015226962,0.0010499432,0.0020011885,0.0014909372,0.003365664,0.0017511626,0.00282109,0.0040096403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017473778,0.00050165626,0.008823639,0.0012298453,0.00023435529,0.0028361036,0.002101134,0.012210384,0.04289496,0.8450538,0.016442878,0.06592384],"study_design_scores_gemma":[0.0006595769,0.00030266048,0.016588803,0.0001668246,0.000530776,0.0035443245,0.0019157247,0.023926051,0.026603382,0.8965342,0.029032156,0.00019549673],"about_ca_topic_score_codex":0.0014842128,"about_ca_topic_score_gemma":0.003258473,"teacher_disagreement_score":0.033528943,"about_ca_system_score_codex":0.0014377136,"about_ca_system_score_gemma":0.00070696283,"threshold_uncertainty_score":0.11216551},"labels":[],"label_agreement":null},{"id":"W2045251507","doi":"10.1016/j.disc.2009.01.018","title":"Vertex domination of generalized Petersen graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Dominating set; Vertex (graph theory); Mathematics; Domination analysis; Neighbourhood (mathematics); Modulo; Discrete mathematics; Graph","score_opus":0.01943357779614378,"score_gpt":0.30040339959807083,"score_spread":0.28096982180192703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045251507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9516018,0.00026817247,0.018373325,0.00041946647,0.00003190331,0.00002781128,0.0001649925,0.00007724877,0.029035224],"genre_scores_gemma":[0.9916938,0.00020988968,0.0025442191,0.000058802147,0.000037931357,0.00002414651,0.00013439012,0.000025976078,0.005270747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994394,0.000121773046,0.000018964241,0.000106079526,0.00015542218,0.0001583213],"domain_scores_gemma":[0.9975936,0.0013234512,0.00034946442,0.00021364349,0.0001932661,0.00032648744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005440937,0.0003684133,0.0007363591,0.0016604055,0.0018132109,0.0025964293,0.00093221845,0.0007747251,0.004121226],"category_scores_gemma":[0.0031128428,0.00047464474,0.00051902304,0.0015805432,0.0017718223,0.0022427528,0.0016002716,0.0011590696,0.00024081844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023568766,0.00005005801,0.0028168417,0.00010645923,0.000050127568,0.00049586984,0.00089799287,0.013348358,0.006116419,0.961218,0.002183178,0.012481114],"study_design_scores_gemma":[0.0000532918,0.000027755046,0.0021008102,0.000020659523,0.00004201492,0.00038782036,0.00039414072,0.038604047,0.0024418295,0.9532592,0.0026466579,0.00002171837],"about_ca_topic_score_codex":0.0013232178,"about_ca_topic_score_gemma":0.0017905298,"teacher_disagreement_score":0.004121226,"about_ca_system_score_codex":0.0008781457,"about_ca_system_score_gemma":0.00047764665,"threshold_uncertainty_score":0.013786852},"labels":[],"label_agreement":null},{"id":"W2045836875","doi":"10.1016/j.disc.2013.02.021","title":"Hamilton paths in generalized Petersen graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.021707420690217437,"score_gpt":0.2835553962889854,"score_spread":0.261847975598768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045836875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79984933,0.00086508034,0.09263781,0.0017981845,0.00020459486,0.00016506128,0.0007316556,0.00036541896,0.10338284],"genre_scores_gemma":[0.9470869,0.001037017,0.021108327,0.0003403679,0.00011874506,0.00013236009,0.00049144396,0.000099549885,0.029585313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997322,0.00006487636,0.00001195891,0.00005065018,0.00007601042,0.00006434111],"domain_scores_gemma":[0.99928373,0.0003288969,0.00013345672,0.00006221473,0.0000703124,0.000121439705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028749203,0.0005207922,0.0004680264,0.0019675507,0.0017953243,0.001902916,0.000767604,0.00094425824,0.009342142],"category_scores_gemma":[0.0018087141,0.0005610703,0.0005479617,0.0019261983,0.0017237648,0.0027425233,0.0014767647,0.0014051407,0.00066886964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041544787,0.000015990583,0.00027429423,0.000042411077,0.000009633643,0.00011925886,0.0002353971,0.0025362808,0.00057321886,0.98802173,0.0013234921,0.0068066423],"study_design_scores_gemma":[0.000013940504,0.0000062989384,0.00017609185,0.0000071225163,0.0000057939956,0.000035332378,0.000085732536,0.0040043,0.00016390992,0.9942192,0.0012775493,0.000004702702],"about_ca_topic_score_codex":0.0026040012,"about_ca_topic_score_gemma":0.0042673065,"teacher_disagreement_score":0.009342142,"about_ca_system_score_codex":0.0009538788,"about_ca_system_score_gemma":0.00076429895,"threshold_uncertainty_score":0.031252563},"labels":[],"label_agreement":null},{"id":"W2046344378","doi":"10.1016/j.aml.2010.05.007","title":"A note on graph minors and strong products","year":2010,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Cartesian product; Graph; Graph minor; Distance-regular graph; Symmetric graph; Voltage graph; Minor (academic); Line graph; Discrete mathematics; Petersen graph; Humanities","score_opus":0.015458386186772864,"score_gpt":0.26141048036740355,"score_spread":0.2459520941806307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046344378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072260484,0.022304405,0.5143706,0.060747962,0.034143113,0.00015740053,0.0012427834,0.0011232471,0.29364997],"genre_scores_gemma":[0.6292991,0.020925863,0.1647191,0.011378828,0.04109413,0.00029425044,0.0011821776,0.0013901509,0.12971644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915385,0.00024103877,0.0000618605,0.00026333384,0.00019645301,0.00008357347],"domain_scores_gemma":[0.9952857,0.0031275277,0.00015294387,0.00071706425,0.00040260138,0.00031419657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014248724,0.0012186895,0.0014575683,0.0017042996,0.0027898864,0.0025757316,0.0018622918,0.0016569669,0.010454346],"category_scores_gemma":[0.0051123854,0.0007547677,0.0019823029,0.0024577733,0.0050061042,0.012476315,0.004118494,0.0066289976,0.0018979704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058244852,0.000022163913,0.00018184246,0.00013470754,0.000013681108,0.0001925578,0.00032941235,0.00045002537,0.0011307844,0.962283,0.02055747,0.014646093],"study_design_scores_gemma":[0.0000069929924,0.000018512053,0.00014551627,0.000012671733,0.000012100509,0.00017078526,0.00005021748,0.0006368055,0.000292106,0.9726581,0.025983576,0.000012566228],"about_ca_topic_score_codex":0.0010865745,"about_ca_topic_score_gemma":0.0015621582,"teacher_disagreement_score":0.010454346,"about_ca_system_score_codex":0.001000645,"about_ca_system_score_gemma":0.00055604253,"threshold_uncertainty_score":0.034973323},"labels":[],"label_agreement":null},{"id":"W2046384546","doi":"10.1016/j.dam.2006.04.018","title":"Minimum edge ranking spanning trees of split graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum spanning tree; Discrete mathematics; Chordal graph; k-minimum spanning tree; Indifference graph; Time complexity; Graph; K-ary tree; Tree structure; Binary tree","score_opus":0.01762151411447972,"score_gpt":0.27094719792071237,"score_spread":0.25332568380623266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046384546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7312375,0.0012734891,0.2456714,0.0012961596,0.00009737041,0.00017690503,0.0023465261,0.00075861474,0.017141957],"genre_scores_gemma":[0.83536774,0.00086460216,0.1473979,0.00034603698,0.0001270526,0.00017056034,0.00504966,0.0004340208,0.010242422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926776,0.00022096581,0.00004399132,0.00017545337,0.00015293364,0.00013894813],"domain_scores_gemma":[0.99475926,0.0026497766,0.00072277524,0.00058338186,0.00062520034,0.0006596168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010435609,0.0006444357,0.0017173503,0.0015511726,0.0013097591,0.0026602598,0.0014721013,0.0016689729,0.0061750896],"category_scores_gemma":[0.007437966,0.00092105404,0.0005810659,0.0020024441,0.00077088905,0.0041994113,0.0010769777,0.0018101317,0.0011705941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017178657,0.0008286567,0.010587387,0.0016307401,0.0003866785,0.0010309175,0.0021473486,0.10705709,0.035434846,0.5578475,0.038727067,0.24260403],"study_design_scores_gemma":[0.00010831978,0.00018722763,0.0032797467,0.00008262379,0.00013090755,0.0005464921,0.00061198405,0.17582487,0.0039804564,0.8092255,0.005994873,0.000026984122],"about_ca_topic_score_codex":0.0005902982,"about_ca_topic_score_gemma":0.0016798355,"teacher_disagreement_score":0.0061750896,"about_ca_system_score_codex":0.00072389183,"about_ca_system_score_gemma":0.0007153903,"threshold_uncertainty_score":0.020657778},"labels":[],"label_agreement":null},{"id":"W2046684958","doi":"10.1137/100803870","title":"Gallai's Theorem for List Coloring of Digraphs","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Complete coloring; Fractional coloring; Greedy coloring; Vertex (graph theory); List coloring; Discrete mathematics; Generalization; Brooks' theorem; Graph; Graph coloring; Graph power; Line graph","score_opus":0.058209093472088747,"score_gpt":0.311648151051908,"score_spread":0.25343905757981927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046684958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0378347,0.004147639,0.7891356,0.007491629,0.0014282463,0.000280343,0.002275729,0.0021268248,0.1552794],"genre_scores_gemma":[0.5564198,0.008243797,0.32199678,0.008526322,0.00205316,0.0012491947,0.0036565026,0.0015173331,0.09633708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985783,0.0002327339,0.000091877155,0.00045939762,0.00036929199,0.00026839494],"domain_scores_gemma":[0.99596244,0.0023166104,0.00020359525,0.00067785004,0.00047279833,0.00036671685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016487536,0.001355627,0.0014210275,0.0030145035,0.0036386135,0.0045005735,0.0022181133,0.002185196,0.012546663],"category_scores_gemma":[0.008651676,0.0010411007,0.002863664,0.004094388,0.0033903264,0.007580003,0.0036711465,0.0053644488,0.0034074038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053807475,0.00002484534,0.00027661092,0.00017602995,0.000029702589,0.00013820795,0.00033761765,0.0046686484,0.0011849063,0.9540148,0.017641341,0.021453584],"study_design_scores_gemma":[0.00003581617,0.000019858064,0.00020175602,0.000046190275,0.00003440458,0.00023233028,0.00006050332,0.013799722,0.0011334893,0.95064443,0.033763144,0.00002848179],"about_ca_topic_score_codex":0.005006943,"about_ca_topic_score_gemma":0.0045164917,"teacher_disagreement_score":0.012546663,"about_ca_system_score_codex":0.0037581658,"about_ca_system_score_gemma":0.0016144435,"threshold_uncertainty_score":0.041972756},"labels":[],"label_agreement":null},{"id":"W2046755592","doi":"10.1016/j.disc.2008.05.031","title":"Brambles and independent packings in chordal graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Indifference graph; Treewidth; Discrete mathematics; Pathwidth; Disjoint sets; Maximal independent set; Interval graph; Independent set; Cograph; Graph; 1-planar graph; Line graph","score_opus":0.027302086804797048,"score_gpt":0.28550113844060665,"score_spread":0.2581990516358096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046755592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.722846,0.0031260464,0.16133025,0.0025762042,0.0006356859,0.0001788189,0.00057800923,0.00046111975,0.10826788],"genre_scores_gemma":[0.9386962,0.0015206411,0.030238165,0.00044515784,0.00038978062,0.00018916195,0.0007185899,0.00019244982,0.027609894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991456,0.00015948706,0.00004613219,0.00017528525,0.00028407358,0.00018939287],"domain_scores_gemma":[0.9956281,0.0023217162,0.0006963193,0.0004685967,0.00026703093,0.0006182006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057431764,0.00084150734,0.0015270129,0.0030163154,0.0033439621,0.0049664024,0.0022377935,0.0021618025,0.01035536],"category_scores_gemma":[0.0073047383,0.001612236,0.0009901026,0.0038299465,0.0043554413,0.005965874,0.0032264707,0.0040807263,0.0014850766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015917406,0.000057694346,0.0006850253,0.00010965726,0.00002010811,0.00019122449,0.000833661,0.0038120747,0.0011706506,0.9774071,0.0028702598,0.012683398],"study_design_scores_gemma":[0.00003851253,0.0000195878,0.00043611779,0.000025057074,0.000014645854,0.00015636419,0.00032120434,0.007843696,0.0003272885,0.9879362,0.0028681157,0.000013175106],"about_ca_topic_score_codex":0.0018101361,"about_ca_topic_score_gemma":0.0025933897,"teacher_disagreement_score":0.01035536,"about_ca_system_score_codex":0.0010911177,"about_ca_system_score_gemma":0.00057738554,"threshold_uncertainty_score":0.0346421},"labels":[],"label_agreement":null},{"id":"W2047259180","doi":"10.1016/j.laa.2008.10.006","title":"Primitive digraphs with the largest scrambling index","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Scrambling; Digraph; Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Multipartite; Integer (computer science); Ergodic theory; Order (exchange); Discrete mathematics; Graph; Pure mathematics; Physics","score_opus":0.020602022031945,"score_gpt":0.2681112607611701,"score_spread":0.2475092387292251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047259180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60534585,0.0006028543,0.24089378,0.0011438364,0.00033334445,0.00023228211,0.0016789297,0.0017782728,0.14799084],"genre_scores_gemma":[0.92723626,0.00032803658,0.047349174,0.00028537793,0.00012595051,0.00012137852,0.00079710124,0.00026442145,0.023492321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952996,0.00009328973,0.00003277824,0.00010080448,0.00012296665,0.00012028481],"domain_scores_gemma":[0.99710363,0.0011224156,0.00029369787,0.0006223054,0.00040996587,0.00044798892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036400175,0.00046513704,0.00077278446,0.001769037,0.0017137742,0.0022712736,0.000804115,0.0010568942,0.009434829],"category_scores_gemma":[0.0028393366,0.0004102566,0.00053104275,0.001326182,0.0011492656,0.0022868076,0.000972203,0.0015122687,0.0021234904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000221848,0.00007223826,0.00041084102,0.00014030354,0.000017144237,0.0004121077,0.0002600891,0.0022645358,0.012296191,0.9535271,0.0039401283,0.026437541],"study_design_scores_gemma":[0.000055504162,0.000074333715,0.0004969142,0.000027162501,0.000028110362,0.0006021959,0.00012129424,0.012814016,0.010135131,0.96572787,0.009869845,0.00004755185],"about_ca_topic_score_codex":0.00050571153,"about_ca_topic_score_gemma":0.0010173062,"teacher_disagreement_score":0.009434829,"about_ca_system_score_codex":0.00087135367,"about_ca_system_score_gemma":0.000885785,"threshold_uncertainty_score":0.031562626},"labels":[],"label_agreement":null},{"id":"W2047444378","doi":"10.1016/j.dam.2006.02.003","title":"Improved bottleneck domination algorithms","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Bottleneck; Dominating set; Chordal graph; Mathematics; Combinatorics; Treewidth; Time complexity; Independent set; Maximal independent set; Interval graph; Discrete mathematics; Algorithm; Graph; Pathwidth; 1-planar graph; Computer science; Vertex (graph theory); Line graph","score_opus":0.01158698130081266,"score_gpt":0.2668749870525507,"score_spread":0.25528800575173805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047444378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06437522,0.0017677605,0.8658007,0.0019395186,0.0006623459,0.00038155672,0.0010268617,0.0062506613,0.057795405],"genre_scores_gemma":[0.4625618,0.0009961001,0.49015918,0.0011600405,0.0007576851,0.00085657986,0.0022368322,0.0019427098,0.03932896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494815,0.0015679398,0.0002517887,0.001033424,0.0013645387,0.0008341202],"domain_scores_gemma":[0.9856111,0.0066955322,0.00048362275,0.0045317635,0.0017526225,0.0009253824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005077902,0.00196073,0.0027424386,0.0028368267,0.002548967,0.003884078,0.00720961,0.002571334,0.02257573],"category_scores_gemma":[0.019684186,0.0011356717,0.0019696222,0.00378927,0.0021030977,0.007543852,0.008013256,0.005036971,0.0046005035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002285381,0.0011061927,0.0017305613,0.0007328328,0.00024634696,0.00010193406,0.00068867765,0.1108878,0.01126833,0.38461494,0.062663674,0.42367333],"study_design_scores_gemma":[0.00044554364,0.00017152503,0.00058338617,0.00007087713,0.00015605189,0.00010640231,0.00008426722,0.53769106,0.0056694513,0.44034982,0.014610159,0.00006149918],"about_ca_topic_score_codex":0.0024889305,"about_ca_topic_score_gemma":0.003848709,"teacher_disagreement_score":0.02257573,"about_ca_system_score_codex":0.0032342812,"about_ca_system_score_gemma":0.0038583183,"threshold_uncertainty_score":0.07552338},"labels":[],"label_agreement":null},{"id":"W2047516023","doi":"10.1109/csss.2012.30","title":"A Linear-Space Top-Down Algorithm for Tree Inclusion Problem","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Tree (set theory); Matching (statistics); Space (punctuation); Algorithm; Set (abstract data type); Mathematics; Node (physics); Discrete mathematics; Computer science; Physics; Statistics","score_opus":0.02293158598130023,"score_gpt":0.31821254069168653,"score_spread":0.2952809547103863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047516023","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014894712,0.0012697899,0.95108503,0.00206196,0.0003567434,0.00093847583,0.0022565785,0.014219432,0.012917293],"genre_scores_gemma":[0.059779365,0.0005440669,0.9228626,0.00079743145,0.00016004332,0.00070513284,0.0049862904,0.0009688806,0.009196188],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736553,0.00040658913,0.00017624845,0.00093029905,0.0006075642,0.0005138628],"domain_scores_gemma":[0.99780494,0.0010186551,0.00013272856,0.0005768903,0.00030100878,0.00016572046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001318906,0.0029949099,0.0022502546,0.0017513118,0.001988516,0.0037189003,0.004555041,0.0031791301,0.024188198],"category_scores_gemma":[0.004368859,0.0011102199,0.0026403705,0.003684195,0.001063252,0.007936395,0.003836753,0.0038245162,0.009365981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010056319,0.0011251474,0.00079837185,0.0014006853,0.00017074062,0.0002937629,0.00032903958,0.07587141,0.010879599,0.03611781,0.095316835,0.776691],"study_design_scores_gemma":[0.0007470476,0.00044182874,0.00066899485,0.0001462646,0.00021953923,0.0006338466,0.00056433823,0.7533138,0.0108012995,0.19334501,0.03900764,0.000110387795],"about_ca_topic_score_codex":0.0073442827,"about_ca_topic_score_gemma":0.011191948,"teacher_disagreement_score":0.024188198,"about_ca_system_score_codex":0.002440851,"about_ca_system_score_gemma":0.004034315,"threshold_uncertainty_score":0.08091754},"labels":[],"label_agreement":null},{"id":"W2047779705","doi":"10.1016/j.jctb.2003.11.001","title":"A short proof of non-GF(5)-representability of matroids","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada; National Security Agency","keywords":"Matroid; Proof of concept; GF(2); Mathematics; Combinatorics; Computer science; Finite field","score_opus":0.012493688221346536,"score_gpt":0.29328536457964816,"score_spread":0.2807916763583016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047779705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09869986,0.011382138,0.42205632,0.042958282,0.01379336,0.00059459725,0.004243717,0.0037459764,0.4025258],"genre_scores_gemma":[0.75383437,0.009319998,0.14661881,0.012701528,0.010524234,0.00086667296,0.0041060294,0.0013360291,0.060692325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978131,0.0003698715,0.0001496003,0.00044789616,0.0008677408,0.00035173245],"domain_scores_gemma":[0.9921171,0.005245686,0.00036234764,0.000896901,0.0009673575,0.00041060697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016257826,0.002543637,0.0013248577,0.0018916604,0.0025787852,0.0035139269,0.0022568088,0.0027058034,0.028619349],"category_scores_gemma":[0.008285633,0.0013924051,0.0036344463,0.0023806624,0.003891511,0.008420579,0.0051307464,0.009461322,0.004111062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043049167,0.00034029013,0.00084781565,0.0013963735,0.00018177283,0.001734147,0.0005920881,0.004764761,0.015774012,0.85354626,0.05176997,0.06862211],"study_design_scores_gemma":[0.00006447582,0.00009948113,0.00089050864,0.00013308263,0.000083674575,0.00068394124,0.00009556328,0.0042761457,0.005369184,0.9510916,0.037152294,0.0000601155],"about_ca_topic_score_codex":0.0010755039,"about_ca_topic_score_gemma":0.0012064914,"teacher_disagreement_score":0.028619349,"about_ca_system_score_codex":0.0020541188,"about_ca_system_score_gemma":0.0009609551,"threshold_uncertainty_score":0.09574127},"labels":[],"label_agreement":null},{"id":"W2048023919","doi":"10.2298/yjor130704039h","title":"A note on r-equitable k-colorings of trees","year":2013,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Partition (number theory); Mathematics; Graph; Order (exchange); Discrete mathematics; Economics","score_opus":0.08322712656480684,"score_gpt":0.4109221989972904,"score_spread":0.3276950724324835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048023919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2085714,0.0038670334,0.65785295,0.0034991435,0.0011033927,0.00012599296,0.00043006308,0.00081291597,0.123737134],"genre_scores_gemma":[0.7826814,0.00393183,0.19768842,0.0008590282,0.0006852847,0.00011777832,0.00037179093,0.00035978487,0.0133046545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861836,0.00044093045,0.00010011547,0.0002994705,0.00029737584,0.00024372122],"domain_scores_gemma":[0.99690104,0.0015076122,0.00025542453,0.00070541585,0.00042582327,0.00020475998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001289071,0.00050046155,0.00051044446,0.00061330793,0.0013894248,0.0012342164,0.001103139,0.00044152723,0.003192307],"category_scores_gemma":[0.0045642243,0.0004836985,0.00063684187,0.0012669589,0.001761718,0.002732401,0.0017181401,0.002775733,0.00066666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034934614,0.00011532215,0.0024559197,0.0003232725,0.00004045163,0.00077800493,0.0011471831,0.031136433,0.019451397,0.84922385,0.010388829,0.08458996],"study_design_scores_gemma":[0.00005746243,0.00023359049,0.002768316,0.00012287538,0.00007675901,0.0014464865,0.0006834556,0.06378946,0.015628943,0.8429469,0.072161354,0.00008439353],"about_ca_topic_score_codex":0.0030412772,"about_ca_topic_score_gemma":0.0035825502,"teacher_disagreement_score":0.003192307,"about_ca_system_score_codex":0.0010410006,"about_ca_system_score_gemma":0.00065755716,"threshold_uncertainty_score":0.010679305},"labels":[],"label_agreement":null},{"id":"W2048261494","doi":"10.1016/j.tcs.2008.01.038","title":"Partitioned probe comparability graphs","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Combinatorics; Cograph; Split graph; Mathematics; Discrete mathematics; Pathwidth; Comparability graph; Indifference graph; Chordal graph; Line graph; Graph","score_opus":0.031434286364695405,"score_gpt":0.29781324708134405,"score_spread":0.2663789607166486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048261494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15494204,0.00048817066,0.75483316,0.0040302766,0.00025803165,0.0012641924,0.009460177,0.0071833404,0.06754066],"genre_scores_gemma":[0.79527324,0.0003471193,0.15993151,0.0019272452,0.0002657996,0.0013301531,0.014481239,0.0017546689,0.024689015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949468,0.0013721996,0.00018972461,0.0017146051,0.0010371315,0.0007395716],"domain_scores_gemma":[0.9760223,0.010419007,0.0013660411,0.00857298,0.0023675011,0.0012521322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002145636,0.0010774743,0.0014953691,0.001841019,0.001937306,0.003675057,0.0039092903,0.0027432344,0.04564754],"category_scores_gemma":[0.018054865,0.0010972996,0.0012505768,0.002958426,0.0020836222,0.009936662,0.0042852405,0.0037160232,0.0051614637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004419804,0.001030127,0.004274139,0.0009702209,0.00023729564,0.00096058514,0.0010513375,0.04729903,0.049351208,0.6699417,0.049353313,0.17111123],"study_design_scores_gemma":[0.00026878226,0.00037934788,0.0016817668,0.00008227102,0.00011183919,0.0004526188,0.00052953704,0.09847316,0.021477671,0.84723276,0.029260956,0.000049382645],"about_ca_topic_score_codex":0.001236233,"about_ca_topic_score_gemma":0.0015396175,"teacher_disagreement_score":0.04564754,"about_ca_system_score_codex":0.0021152776,"about_ca_system_score_gemma":0.0016291157,"threshold_uncertainty_score":0.1527062},"labels":[],"label_agreement":null},{"id":"W2048457435","doi":"10.1016/j.dam.2007.06.002","title":"Fire containment in grids of dimension three and higher","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Manitoba","keywords":"Conjecture; Mathematics; Combinatorics; Outbreak; Vertex (graph theory); Lattice (music); Square lattice; Integer (computer science); Discrete mathematics; Computer science; Graph","score_opus":0.017490995095231006,"score_gpt":0.28066873052227853,"score_spread":0.26317773542704753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048457435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68665767,0.00089756463,0.26046252,0.0010930551,0.00025856405,0.000050835708,0.00049841544,0.0006569078,0.049424402],"genre_scores_gemma":[0.96613634,0.00020841292,0.024001261,0.00015993371,0.000056509107,0.00004076686,0.0002756482,0.0001339081,0.008987127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995808,0.00007473088,0.00001906987,0.000098034594,0.00008463169,0.00014277818],"domain_scores_gemma":[0.99718875,0.0011924477,0.00045788722,0.0003753905,0.00030288377,0.0004826144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031043467,0.00030772813,0.0007880665,0.00086398073,0.0012609347,0.0027390032,0.001037469,0.0010702875,0.007239519],"category_scores_gemma":[0.0026951048,0.0004635747,0.00050330197,0.0007564022,0.001849555,0.0019575963,0.0016631752,0.001414977,0.00070838083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066088524,0.00011731385,0.00726998,0.00014038019,0.00004837379,0.0005773022,0.00085309165,0.07904752,0.009224981,0.8734988,0.0070175747,0.021543743],"study_design_scores_gemma":[0.000119876866,0.00009286744,0.0037321367,0.000044205754,0.000028504768,0.00077631144,0.0011528346,0.2690029,0.0070739025,0.70815176,0.009774576,0.00005006589],"about_ca_topic_score_codex":0.0038562026,"about_ca_topic_score_gemma":0.002406367,"teacher_disagreement_score":0.007239519,"about_ca_system_score_codex":0.0009620512,"about_ca_system_score_gemma":0.00048084944,"threshold_uncertainty_score":0.024218619},"labels":[],"label_agreement":null},{"id":"W2048794017","doi":"10.1145/1367064.1367070","title":"Optimal branch-decomposition of planar graphs in <i>O</i> ( <i>n</i> <sup>3</sup> ) Time","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar; Decomposition; Planar graph; Mathematics; Graph; Discrete mathematics; Computer science","score_opus":0.017709346758674253,"score_gpt":0.2716123867468868,"score_spread":0.25390303998821256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048794017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21178867,0.0009976897,0.757351,0.00080730906,0.000078014375,0.0002837073,0.001416344,0.003803969,0.02347323],"genre_scores_gemma":[0.25555125,0.00065478537,0.7319876,0.00018570032,0.000036860034,0.0002611397,0.0039686533,0.0006295289,0.0067245006],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996754,0.000048306752,0.000018330174,0.000071470065,0.00008910106,0.000097322656],"domain_scores_gemma":[0.9994868,0.00020965058,0.00005681672,0.00011121278,0.00006282515,0.0000727031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030421888,0.0011361283,0.0011264929,0.0007801069,0.0005761846,0.0011932924,0.0009247511,0.0008166653,0.008687625],"category_scores_gemma":[0.0013618525,0.00056985545,0.0009843821,0.001268467,0.00046667166,0.0021575533,0.0016258925,0.0011911382,0.0028580774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001258836,0.00032326285,0.0025896826,0.0011657267,0.0001199964,0.0003667648,0.0006210859,0.14579009,0.08544161,0.04970964,0.033417493,0.6791958],"study_design_scores_gemma":[0.0004637433,0.00043433046,0.0026222172,0.00017167121,0.00013938016,0.00058976567,0.00070213963,0.706715,0.045773428,0.22208206,0.020247517,0.000058777154],"about_ca_topic_score_codex":0.0015479589,"about_ca_topic_score_gemma":0.0033200257,"teacher_disagreement_score":0.008687625,"about_ca_system_score_codex":0.00063800154,"about_ca_system_score_gemma":0.0007178057,"threshold_uncertainty_score":0.029062986},"labels":[],"label_agreement":null},{"id":"W2048827438","doi":"10.1016/j.dam.2007.05.054","title":"Skew partitions in perfect graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Skew; Mathematics; Combinatorics; Discrete mathematics; Computer science","score_opus":0.02124849550104199,"score_gpt":0.3031963948444367,"score_spread":0.28194789934339476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048827438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85911894,0.0008694113,0.08661397,0.0013366437,0.000303161,0.00007884514,0.00051510544,0.0003881919,0.05077573],"genre_scores_gemma":[0.97799575,0.00042249085,0.009336274,0.00022971688,0.00017168597,0.00005676183,0.0003213649,0.00012235009,0.011343497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923015,0.00023495535,0.000044944598,0.00013270105,0.00018751774,0.00016985077],"domain_scores_gemma":[0.9965798,0.0015025283,0.0006123008,0.00044566632,0.00028552278,0.00057425105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010229469,0.00048268453,0.00087641925,0.002193667,0.0023863497,0.0037278929,0.0007119519,0.0011160711,0.0071592154],"category_scores_gemma":[0.0048002396,0.0008793775,0.00060900854,0.0019723733,0.003121459,0.0050389385,0.0022909944,0.001497093,0.0006968493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009098219,0.000016006683,0.0005253968,0.000029974344,0.000006067605,0.00008231449,0.00035691986,0.002144178,0.00068224705,0.99118716,0.0011553175,0.0037234474],"study_design_scores_gemma":[0.00001602925,0.000013006446,0.00034656198,0.000011272405,0.000008061327,0.00009533763,0.00020009953,0.004085019,0.00040232806,0.9934521,0.0013620841,0.0000081238095],"about_ca_topic_score_codex":0.0008716497,"about_ca_topic_score_gemma":0.0013462239,"teacher_disagreement_score":0.0071592154,"about_ca_system_score_codex":0.0011658008,"about_ca_system_score_gemma":0.0007259709,"threshold_uncertainty_score":0.023949921},"labels":[],"label_agreement":null},{"id":"W2048900104","doi":"10.46298/dmtcs.3401","title":"An upper bound for the chromatic number of line graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Multigraph; Mathematics; Line graph; Discrete mathematics; Graph; Bounded function; Upper and lower bounds; Chromatic polynomial; Chromatic scale; Clique number; Perfect graph; Friendship graph; Bound graph; Critical graph; Graph power","score_opus":0.018968031415611628,"score_gpt":0.33203150706922924,"score_spread":0.3130634756536176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048900104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24896847,0.0045359135,0.6302558,0.004838462,0.0003601855,0.00021434773,0.0015864698,0.0060311323,0.103209116],"genre_scores_gemma":[0.811545,0.0019787662,0.16210571,0.0011637072,0.0004196732,0.00034831668,0.0015996154,0.0010062186,0.019832911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789196,0.0002501184,0.000062083425,0.0007535231,0.00050800707,0.0005343299],"domain_scores_gemma":[0.98876023,0.0073370016,0.000607557,0.0019439062,0.0007711101,0.00058026175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011353138,0.0011840402,0.0010270219,0.002196097,0.001971829,0.003195299,0.0029661888,0.001851566,0.018785454],"category_scores_gemma":[0.008318988,0.00081466354,0.0010232467,0.002186809,0.0026793694,0.006995245,0.0025423984,0.0039159507,0.003208886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025227007,0.00063369324,0.010308429,0.0009871166,0.00021444549,0.00085835723,0.0012355912,0.17833565,0.12297567,0.4614407,0.03680919,0.18367857],"study_design_scores_gemma":[0.00020988876,0.00045202015,0.0055496553,0.00023926976,0.00015690795,0.0010949163,0.00023981322,0.50816643,0.04689321,0.3885009,0.048313763,0.00018324972],"about_ca_topic_score_codex":0.003884462,"about_ca_topic_score_gemma":0.0048809126,"teacher_disagreement_score":0.018785454,"about_ca_system_score_codex":0.0029803638,"about_ca_system_score_gemma":0.0010713026,"threshold_uncertainty_score":0.06284356},"labels":[],"label_agreement":null},{"id":"W2048988825","doi":"10.1016/j.dam.2006.02.009","title":"Digraph matrix partitions and trigraph homomorphisms","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University; Simon Fraser University","funders":"","keywords":"Digraph; Homomorphism; Mathematics; Combinatorics; Partition (number theory); Graph homomorphism; Directed graph; Matrix (chemical analysis); Discrete mathematics; Undirected graph; Graph; Algebra over a field; Line graph; Voltage graph; Pure mathematics","score_opus":0.012057152574411534,"score_gpt":0.26709409134703294,"score_spread":0.2550369387726214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048988825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50001407,0.0009509647,0.35500595,0.0019266477,0.00066068565,0.00018079531,0.0008484772,0.0012353632,0.13917711],"genre_scores_gemma":[0.92182213,0.000522292,0.035424713,0.000466818,0.0003547366,0.0001468279,0.00062180066,0.00031026808,0.040330477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994081,0.000133783,0.00003220028,0.00017921995,0.000108537686,0.00013820558],"domain_scores_gemma":[0.9982364,0.00071442,0.00022278621,0.0002823602,0.00017283607,0.0003711767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042738975,0.0005216542,0.00074397295,0.0019854656,0.0021573522,0.003302273,0.0010025701,0.0009913893,0.015570267],"category_scores_gemma":[0.0028109404,0.00051397487,0.00082445226,0.0019351772,0.0016721331,0.0047280705,0.0016458797,0.0019405659,0.0017481212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005322332,0.000032419084,0.0001542886,0.000027457572,0.000006322828,0.00008376702,0.0003045504,0.00079004874,0.0009872846,0.9882386,0.0014976751,0.007824397],"study_design_scores_gemma":[0.000016104555,0.000016970494,0.00022555387,0.000009007531,0.0000099456975,0.0001717541,0.00015790047,0.0062573664,0.0007724889,0.98940897,0.0029400985,0.000013837592],"about_ca_topic_score_codex":0.0010890181,"about_ca_topic_score_gemma":0.0013756604,"teacher_disagreement_score":0.015570267,"about_ca_system_score_codex":0.0009480313,"about_ca_system_score_gemma":0.00049134117,"threshold_uncertainty_score":0.052087665},"labels":[],"label_agreement":null},{"id":"W2049572715","doi":"10.1137/13090465x","title":"On List Coloring and List Homomorphism of Permutation and Interval Graphs","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Permutation graph; Discrete mathematics; Indifference graph; Chordal graph; Bipartite graph; Graph coloring; Interval graph; Pathwidth; 1-planar graph; Homomorphism; Cograph; Maximal independent set; Interval (graph theory); Edge coloring; Time complexity; Graph; Line graph; Graph power","score_opus":0.018303993312181067,"score_gpt":0.2873615626007403,"score_spread":0.26905756928855923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049572715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10596487,0.00096504873,0.8718886,0.00193888,0.00017293233,0.00032203438,0.0008298844,0.0018354653,0.016082376],"genre_scores_gemma":[0.5628833,0.0019046388,0.41891623,0.0007357,0.000534762,0.000442997,0.0030923553,0.0006631563,0.010826886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848735,0.00045922174,0.000066109096,0.00041094492,0.0002634429,0.00031296405],"domain_scores_gemma":[0.99222094,0.005816622,0.00043618196,0.0008586582,0.0002997633,0.00036782806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013327269,0.0011435732,0.0009773741,0.0007427764,0.0014025117,0.0026051893,0.002128575,0.0012591839,0.008791491],"category_scores_gemma":[0.007133938,0.000601113,0.0014103089,0.0021817207,0.0019967451,0.0075533544,0.0025412864,0.00322136,0.0014572879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012759422,0.0013209088,0.0032178662,0.0010049714,0.00012923357,0.0006630488,0.00077743107,0.27727002,0.01517304,0.38497803,0.028538972,0.28565067],"study_design_scores_gemma":[0.0001889331,0.00021148771,0.0007658989,0.000050500905,0.00006457187,0.0005037683,0.0002991395,0.36655256,0.010135275,0.6118752,0.009281942,0.00007078683],"about_ca_topic_score_codex":0.0027907037,"about_ca_topic_score_gemma":0.0027029957,"teacher_disagreement_score":0.008791491,"about_ca_system_score_codex":0.001829246,"about_ca_system_score_gemma":0.0020140077,"threshold_uncertainty_score":0.029410422},"labels":[],"label_agreement":null},{"id":"W2049916150","doi":"10.1016/j.disc.2010.01.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si37.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>G</mml:mi></mml:math>-parking functions, acyclic orientations and spanning trees","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Bijection; Mathematics; Graph; Combinatorics; Vertex (graph theory); Discrete mathematics; Function (biology)","score_opus":0.020716285225112926,"score_gpt":0.2785681418201496,"score_spread":0.2578518565950367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049916150","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025459488,0.0006333984,0.2698095,0.0060603595,0.0015753271,0.0002794302,0.12984286,0.074076556,0.51517653],"genre_scores_gemma":[0.047097415,0.0027232969,0.22488976,0.002769338,0.0011932104,0.0006618643,0.19507037,0.076989874,0.44860482],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960595,0.00007065629,0.000040348918,0.00006483094,0.0001791744,0.000039022052],"domain_scores_gemma":[0.9986608,0.00046058584,0.000097994074,0.0002773835,0.00039345495,0.000109795896],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005556298,0.0011896715,0.0009888818,0.0019987072,0.00074687373,0.004260854,0.0023719177,0.0014891267,0.53079885],"category_scores_gemma":[0.003371001,0.0007724378,0.0007883489,0.004138057,0.00064281846,0.005095354,0.0015467479,0.0020866233,0.31044003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057923662,0.000035380315,0.00015333855,0.00028960427,0.000007968664,0.000059389367,0.00010321649,0.0006112561,0.00132495,0.075229615,0.8704144,0.051712926],"study_design_scores_gemma":[0.00004317618,0.00001498409,0.0005576647,0.00007765756,0.000006463923,0.00020572427,0.00006559223,0.004060093,0.003547832,0.07270196,0.9186804,0.000038454393],"about_ca_topic_score_codex":0.0053084777,"about_ca_topic_score_gemma":0.007841627,"teacher_disagreement_score":0.53079885,"about_ca_system_score_codex":0.0016518027,"about_ca_system_score_gemma":0.001001323,"threshold_uncertainty_score":0.6692585},"labels":[],"label_agreement":null},{"id":"W2050352628","doi":"10.1145/1806689.1806785","title":"Odd cycle packing","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Packing problems; Digraph; Disjoint sets; Mathematics; Feedback arc set; Vertex (graph theory); Directed graph; Upper and lower bounds; Graph; Integer (computer science); Discrete mathematics; Computer science; Line graph","score_opus":0.014804844332414633,"score_gpt":0.30164827369806535,"score_spread":0.2868434293656507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050352628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123952195,0.0020279996,0.7937041,0.0022556956,0.0007275499,0.00058028515,0.0024892327,0.0020002879,0.07226261],"genre_scores_gemma":[0.48651063,0.002290106,0.47839803,0.0009247447,0.0002725434,0.0003820419,0.0057414514,0.0007079514,0.024772488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990202,0.00013163907,0.000056078705,0.0002995987,0.00021201638,0.00028045045],"domain_scores_gemma":[0.998906,0.00039823804,0.00013494227,0.00029239213,0.00011970055,0.0001487897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004918827,0.0012281261,0.0011467633,0.0009157538,0.0012539541,0.0023090006,0.0021121767,0.0013354371,0.015210468],"category_scores_gemma":[0.0027343065,0.0005627587,0.0011659579,0.0022159584,0.0007299563,0.004836281,0.0023689,0.0013779085,0.0016798194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079906586,0.0005009001,0.0029478373,0.0011849217,0.00016460518,0.00096827926,0.00047740826,0.3651634,0.012376434,0.22386648,0.053427,0.33812368],"study_design_scores_gemma":[0.00010269741,0.00028077798,0.00097596965,0.0001443456,0.000099323624,0.0011228967,0.00040603726,0.58638465,0.011243127,0.30724114,0.09194502,0.00005405841],"about_ca_topic_score_codex":0.0026210544,"about_ca_topic_score_gemma":0.002243821,"teacher_disagreement_score":0.015210468,"about_ca_system_score_codex":0.0013949025,"about_ca_system_score_gemma":0.0010007918,"threshold_uncertainty_score":0.050884128},"labels":[],"label_agreement":null},{"id":"W2050872937","doi":"10.1007/s00453-013-9745-8","title":"Practical and Efficient Circle Graph Recognition","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ackermann function; Circle graph; Lexicographical order; Combinatorics; Mathematics; Algorithm; Theory of computation; Computer science; Graph; Pathwidth; Discrete mathematics; Inverse; Line graph","score_opus":0.02781378277119005,"score_gpt":0.2996522708988027,"score_spread":0.27183848812761263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050872937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042369585,0.0003599172,0.9161922,0.00092017965,0.00021564512,0.0002672147,0.00089035986,0.015998824,0.022786047],"genre_scores_gemma":[0.23785995,0.00026373094,0.7347919,0.00024208026,0.00014206703,0.00017577033,0.0037642994,0.001235927,0.0215244],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832827,0.00025243338,0.000103676524,0.0004963744,0.00058042153,0.00023890681],"domain_scores_gemma":[0.99604565,0.0008904107,0.00014616072,0.0020661259,0.0006606752,0.00019093156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004944567,0.0010943047,0.001272641,0.0015192218,0.0014330735,0.002628538,0.0027570429,0.0017249484,0.032126065],"category_scores_gemma":[0.005092029,0.0007226989,0.0010304477,0.0021263387,0.00091589516,0.0042969063,0.0034952261,0.0016237523,0.0157214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045833588,0.0003067956,0.001651908,0.00030175902,0.000040672134,0.0002040453,0.00020711648,0.020511387,0.030590672,0.038985778,0.0493814,0.8573601],"study_design_scores_gemma":[0.00018851557,0.00030653802,0.0024582036,0.000055321714,0.000091795446,0.0011000878,0.00076044485,0.68317384,0.08831816,0.15376417,0.069673166,0.00010976401],"about_ca_topic_score_codex":0.0030355933,"about_ca_topic_score_gemma":0.007305419,"teacher_disagreement_score":0.032126065,"about_ca_system_score_codex":0.0007707513,"about_ca_system_score_gemma":0.0017178113,"threshold_uncertainty_score":0.10747242},"labels":[],"label_agreement":null},{"id":"W2051028069","doi":"10.1016/j.jcss.2004.07.003","title":"A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computational complexity theory; Bipartite graph; Compaction; Mathematics; Equivalence (formal languages); Combinatorics; Computational problem; Constraint satisfaction problem; Computer science; Chordal graph; Time complexity; Discrete mathematics; Theoretical computer science; Graph; Algorithm; Artificial intelligence","score_opus":0.10570888928428386,"score_gpt":0.33144506100960225,"score_spread":0.2257361717253184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051028069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21399619,0.00822619,0.6965058,0.013950706,0.0010296087,0.0009787044,0.0065743458,0.004338326,0.054400112],"genre_scores_gemma":[0.6303601,0.0078070504,0.28800166,0.0051264088,0.005697992,0.001777112,0.018462509,0.0031386053,0.039628554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922769,0.0015257075,0.0005384776,0.0021358964,0.0018377466,0.0016853244],"domain_scores_gemma":[0.94462764,0.03820443,0.0030047682,0.009690098,0.0025695434,0.001903594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004157807,0.004156761,0.006141479,0.004064625,0.0032596984,0.00930065,0.0087187495,0.0062285964,0.01937025],"category_scores_gemma":[0.035438005,0.0018797257,0.007871991,0.0072808014,0.004935041,0.026786618,0.0068046665,0.011165589,0.0032563615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025418117,0.0013379661,0.0061447443,0.002570001,0.00041456122,0.0004446494,0.0012339788,0.115720786,0.011117514,0.51844853,0.09558494,0.24444047],"study_design_scores_gemma":[0.00022776994,0.00026962283,0.0024230198,0.000121957644,0.00025061026,0.0006149181,0.00030874636,0.17235072,0.004117335,0.81105536,0.00812298,0.0001369731],"about_ca_topic_score_codex":0.0025053227,"about_ca_topic_score_gemma":0.0025679888,"teacher_disagreement_score":0.01937025,"about_ca_system_score_codex":0.0039272155,"about_ca_system_score_gemma":0.0042831535,"threshold_uncertainty_score":0.064799964},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2051748292","doi":"10.1006/jcta.2001.3225","title":"The Largest Small Octagon","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Quadratic growth; Conjecture; Combinatorics; Unit (ring theory); Mathematics; Quadratic equation; Computer science; Geometry; Algorithm; Mathematics education","score_opus":0.019666642754590416,"score_gpt":0.2502709973929753,"score_spread":0.2306043546383849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051748292","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38807613,0.0020023657,0.10678275,0.0037617038,0.0014779972,0.00018468825,0.0018815363,0.0011018993,0.49473086],"genre_scores_gemma":[0.84868234,0.00093922275,0.045157097,0.0008118597,0.0002916145,0.000112304806,0.001685796,0.0005634606,0.10175629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997379,0.000040599127,0.000012402196,0.00008154269,0.00007355529,0.000053993197],"domain_scores_gemma":[0.99966264,0.00008986976,0.000030963314,0.00006409992,0.0000694404,0.000082973376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010792897,0.00046332955,0.0007073797,0.00082880544,0.0017879725,0.0024811046,0.0007204466,0.0008043591,0.027791275],"category_scores_gemma":[0.0012330877,0.0004207659,0.00045223162,0.0008189654,0.0013129483,0.0017265051,0.0013919517,0.0018672859,0.004986254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005233211,0.000102123035,0.0012547369,0.00030750263,0.000027172193,0.0004686768,0.0004118275,0.0029984545,0.012599892,0.8326873,0.036786865,0.11183202],"study_design_scores_gemma":[0.00008902894,0.000098361554,0.0010862238,0.00008710013,0.000043085838,0.0007698389,0.0007520666,0.008683192,0.00474275,0.8617042,0.121908344,0.0000358318],"about_ca_topic_score_codex":0.00094952056,"about_ca_topic_score_gemma":0.0014532524,"teacher_disagreement_score":0.027791275,"about_ca_system_score_codex":0.00037522515,"about_ca_system_score_gemma":0.0004538744,"threshold_uncertainty_score":0.09297103},"labels":[],"label_agreement":null},{"id":"W2052065965","doi":"10.4171/owr/2007/40","title":"Mini-Workshop: Topology of closed one-forms and Cohomology Jumping Loci","year":2008,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cohomology; Jumping; Topology (electrical circuits); Mathematics; Computer science; Pure mathematics; Biology; Combinatorics; Paleontology","score_opus":0.04119857093019811,"score_gpt":0.2976651709787299,"score_spread":0.2564666000485318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052065965","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1911755,0.059003282,0.1919519,0.059903167,0.09412758,0.0004100435,0.003977535,0.002337699,0.39711338],"genre_scores_gemma":[0.5289949,0.013491349,0.034479227,0.003585802,0.020779572,0.000433864,0.0062858737,0.0020463117,0.38990304],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991984,0.00031035286,0.00003389972,0.00017651712,0.00015333208,0.00012753093],"domain_scores_gemma":[0.99852103,0.00039746836,0.000043442007,0.00013973657,0.0002984634,0.0005999547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019884706,0.0010571656,0.00085198844,0.00097489246,0.0012179009,0.0032580101,0.0022606656,0.0014025725,0.036185],"category_scores_gemma":[0.002585167,0.00040402074,0.0014567113,0.0005698981,0.0008572837,0.0033630386,0.0030358846,0.0022829312,0.007945662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009967965,0.0002537918,0.0013903567,0.0010235162,0.00017071352,0.0013371502,0.002092421,0.005225062,0.017568033,0.25771987,0.5895963,0.12262599],"study_design_scores_gemma":[0.00012762898,0.00062173797,0.006506745,0.00079732796,0.00011214173,0.00195261,0.0020008506,0.014683041,0.010583905,0.26384374,0.6986294,0.00014085793],"about_ca_topic_score_codex":0.00048577454,"about_ca_topic_score_gemma":0.00064485223,"teacher_disagreement_score":0.036185,"about_ca_system_score_codex":0.0012442991,"about_ca_system_score_gemma":0.0009288578,"threshold_uncertainty_score":0.121050894},"labels":[],"label_agreement":null},{"id":"W2052404722","doi":"10.7151/dmgt.1808","title":"Bipartition polynomials, the Ising model and domination in graphs","year":2015,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"European Social Fund; Austrian Science Fund; Vienna Science and Technology Fund","keywords":"Mathematics; Combinatorics; Ising model; Discrete mathematics; Statistical physics; Physics","score_opus":0.039834455206508294,"score_gpt":0.3003661581116008,"score_spread":0.2605317029050925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052404722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49378312,0.009210811,0.30815527,0.006968074,0.0006659101,0.000053446813,0.00054341956,0.0005827204,0.1800372],"genre_scores_gemma":[0.98002416,0.0021378212,0.009479474,0.00025521906,0.00041453182,0.000014808218,0.00012061102,0.000064670574,0.007488626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961025,0.00008936151,0.000012586372,0.0000562544,0.00014894601,0.00008252436],"domain_scores_gemma":[0.99917054,0.0003968632,0.000112531896,0.00012657442,0.000081022146,0.0001124909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049417274,0.00029910746,0.00033715265,0.0014348058,0.0009351969,0.0014643973,0.0006422382,0.000845919,0.0028273708],"category_scores_gemma":[0.002684032,0.0001730943,0.00046711115,0.0019168622,0.0021758967,0.0029635064,0.0011811047,0.0017000281,0.0003119971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014898094,0.000008381776,0.00011128619,0.00002135275,0.0000028910981,0.000038132788,0.0001053315,0.0029565017,0.00073904864,0.9909429,0.00076126604,0.0042979345],"study_design_scores_gemma":[0.0000034835243,0.0000053605586,0.00014063629,0.000005361136,0.000002301244,0.000060250633,0.00003692864,0.009526988,0.00021443266,0.9875929,0.0024048507,0.000006372101],"about_ca_topic_score_codex":0.0028245032,"about_ca_topic_score_gemma":0.0019070648,"teacher_disagreement_score":0.0028273708,"about_ca_system_score_codex":0.0011295505,"about_ca_system_score_gemma":0.00060389726,"threshold_uncertainty_score":0.009458542},"labels":[],"label_agreement":null},{"id":"W2052776056","doi":"10.1016/j.dam.2011.04.016","title":"Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Homomorphism; Combinatorics; Mathematics; Digraph; Discrete mathematics; Interval (graph theory); Interval graph; Characterization (materials science); Conjecture; Time complexity; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.053733698770790504,"score_gpt":0.2908855560509496,"score_spread":0.2371518572801591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052776056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24215244,0.0011626609,0.69523823,0.00094239955,0.0002819537,0.00009078576,0.0009685834,0.0010957075,0.058067303],"genre_scores_gemma":[0.87381226,0.0008773003,0.10580499,0.00040676398,0.00019436295,0.00013035367,0.00081292144,0.00018233566,0.017778734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994234,0.00013346875,0.000043908683,0.00018571451,0.00012502074,0.000088574554],"domain_scores_gemma":[0.9977514,0.00086688815,0.00042617857,0.00035012022,0.000318827,0.0002865783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006231816,0.00035268985,0.00037838728,0.0015742044,0.0010684391,0.0020567097,0.0010911153,0.0005412205,0.007518295],"category_scores_gemma":[0.0032178038,0.0003060122,0.00059353246,0.0018607724,0.0012191039,0.0047289664,0.0011750236,0.0014581978,0.0007468773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064732914,0.000035810746,0.0004002572,0.000058549515,0.000014595589,0.00009805657,0.00028334535,0.0021765756,0.0015442759,0.9747433,0.0012413197,0.019339113],"study_design_scores_gemma":[0.000020851141,0.000029471048,0.00039398597,0.000013181574,0.000021014215,0.0001560165,0.00016575055,0.008955892,0.00096816017,0.9825418,0.006711598,0.000022261087],"about_ca_topic_score_codex":0.0011876882,"about_ca_topic_score_gemma":0.0011814435,"teacher_disagreement_score":0.007518295,"about_ca_system_score_codex":0.0008039005,"about_ca_system_score_gemma":0.00040595615,"threshold_uncertainty_score":0.025151193},"labels":[],"label_agreement":null},{"id":"W2052851790","doi":"10.1016/j.disc.2006.11.026","title":"On realizations of point determining graphs, and obstructions to full homomorphisms","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph homomorphism; Vertex (graph theory); Graph; Homomorphism; Discrete mathematics; Induced subgraph; Wheel graph; Graph power; Line graph","score_opus":0.022561029521324626,"score_gpt":0.30560892087986674,"score_spread":0.28304789135854214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052851790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72836137,0.00095204316,0.13477768,0.0037233958,0.000307968,0.00015328826,0.0005561948,0.0007100389,0.1304581],"genre_scores_gemma":[0.96129143,0.000608847,0.016129304,0.00032851868,0.0003320075,0.00013935975,0.00048863725,0.000199873,0.020481952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998343,0.00046339468,0.00007703435,0.00033205876,0.0003891928,0.00039542202],"domain_scores_gemma":[0.9963625,0.0017581391,0.0003491121,0.00046509114,0.00029394455,0.0007711817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016363856,0.0007336896,0.0011275633,0.0023672364,0.004453345,0.0047452515,0.0014657896,0.0021372542,0.006381148],"category_scores_gemma":[0.0057853567,0.00094314956,0.0014920066,0.0018178653,0.006142236,0.008247206,0.0054496364,0.004640879,0.00068538915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014259905,0.0000115348585,0.000112426285,0.000009780866,0.0000020550945,0.000036364454,0.00025678956,0.00032700557,0.00015315456,0.99795496,0.00026994006,0.0008517245],"study_design_scores_gemma":[0.000012555478,0.000007658464,0.00015493976,0.0000050911044,0.0000046486293,0.00004880965,0.00015134107,0.0013230173,0.0001460143,0.9970796,0.0010577297,0.000008651609],"about_ca_topic_score_codex":0.002323818,"about_ca_topic_score_gemma":0.001905428,"teacher_disagreement_score":0.006381148,"about_ca_system_score_codex":0.0019449373,"about_ca_system_score_gemma":0.001064131,"threshold_uncertainty_score":0.021347106},"labels":[],"label_agreement":null},{"id":"W2053148324","doi":"10.1007/s102550200048","title":"On the Monotonicity of (k;g,h)-graphs","year":2002,"lang":"en","type":"article","venue":"Acta Mathematicae Applicatae Sinica English Series","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Monotonic function; Combinatorics; Mathematics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.026956837628792533,"score_gpt":0.26021423666772836,"score_spread":0.23325739903893583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053148324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62723815,0.0043825577,0.1789452,0.013992074,0.00056288857,0.00016625566,0.0020848918,0.00042136523,0.17220657],"genre_scores_gemma":[0.9135026,0.003916189,0.061366733,0.001957386,0.0007824756,0.000242317,0.0014028808,0.00034715238,0.01648234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789524,0.0009261259,0.00011330809,0.00041236117,0.00030822164,0.00034461688],"domain_scores_gemma":[0.97657233,0.017240558,0.0011520904,0.0014887775,0.0022887266,0.0012574912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034053107,0.00066175393,0.0013893527,0.0025490206,0.0029080291,0.0036340335,0.002421682,0.0021505072,0.011356665],"category_scores_gemma":[0.023520375,0.0010312707,0.0012776484,0.002481717,0.00515364,0.013026564,0.0031611368,0.0044214856,0.00093760894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020944886,0.00006264702,0.0019335536,0.00021141715,0.000023493976,0.00024451676,0.0007572201,0.0021324863,0.0018218887,0.9706979,0.00494046,0.016965108],"study_design_scores_gemma":[0.000031961867,0.00004084727,0.0015239177,0.00006180843,0.00002578963,0.0004127331,0.00038970957,0.009882575,0.000778056,0.98199695,0.0048338757,0.000021636259],"about_ca_topic_score_codex":0.0035377166,"about_ca_topic_score_gemma":0.0026253962,"teacher_disagreement_score":0.011356665,"about_ca_system_score_codex":0.0015134938,"about_ca_system_score_gemma":0.001192167,"threshold_uncertainty_score":0.037991762},"labels":[],"label_agreement":null},{"id":"W2053642853","doi":"10.1137/130929229","title":"Homological Face-Width Condition Forcing $K_6$-Minors in Graphs on Surfaces","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Mathematics; Combinatorics; Projective plane; Face (sociological concept); Graph; Minor (academic); Discrete mathematics; Surface (topology); Plane (geometry); Geometry","score_opus":0.0269461334175931,"score_gpt":0.3094823273796334,"score_spread":0.28253619396204027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053642853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9498968,0.00016011028,0.03011572,0.0004890449,0.00008997713,0.00002588634,0.00014415456,0.00030870896,0.018769529],"genre_scores_gemma":[0.9871867,0.00009956276,0.008234305,0.000112818314,0.00009012297,0.000030798958,0.00026298425,0.000108294116,0.00387428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994709,0.00007894891,0.00003313914,0.00013316817,0.00013239535,0.00015154597],"domain_scores_gemma":[0.9981108,0.00083901745,0.0002080015,0.0002754936,0.00022689816,0.00033977954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048265624,0.00046783278,0.00064631016,0.00090916466,0.0011810866,0.0016622427,0.0009049269,0.00090626045,0.005915963],"category_scores_gemma":[0.0026209261,0.00045103068,0.0009591897,0.0004239947,0.0018676593,0.0024287826,0.0025122722,0.001768787,0.0006354589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000567223,0.000122941,0.004676041,0.0002104084,0.00004968336,0.0010329947,0.00156516,0.009498205,0.045060337,0.91304696,0.0034503585,0.020719642],"study_design_scores_gemma":[0.00007113416,0.00016546383,0.003416041,0.00002721877,0.000037874666,0.000759955,0.0008753596,0.020749275,0.018364167,0.9481677,0.007304901,0.00006105015],"about_ca_topic_score_codex":0.00077587366,"about_ca_topic_score_gemma":0.0008871153,"teacher_disagreement_score":0.005915963,"about_ca_system_score_codex":0.0007353868,"about_ca_system_score_gemma":0.00032621055,"threshold_uncertainty_score":0.019790888},"labels":[],"label_agreement":null},{"id":"W2054709282","doi":"10.1016/j.disc.2011.06.011","title":"Finite Sholander trees, trees, and their betweenness","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Canada Research Chairs","keywords":"Betweenness centrality; Mathematics; Tree (set theory); Intersection (aeronautics); Characterization (materials science); Combinatorics; Discrete mathematics; Order (exchange)","score_opus":0.056277129533041564,"score_gpt":0.2814007296774125,"score_spread":0.2251236001443709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054709282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52924305,0.0053503793,0.31976944,0.0057518347,0.00032358285,0.000057228954,0.00074887864,0.0003247759,0.13843073],"genre_scores_gemma":[0.95662946,0.0012299287,0.025676465,0.00049616187,0.00027508324,0.000060221006,0.00048451673,0.0001092535,0.0150388805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887305,0.0003133571,0.0000794229,0.00031101107,0.00027007505,0.00015302713],"domain_scores_gemma":[0.9950088,0.003069638,0.0004953143,0.0005996574,0.00041774774,0.00040874814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014190179,0.0003625536,0.0008045515,0.0022994364,0.0028878273,0.003777699,0.0009489616,0.0013390867,0.006492359],"category_scores_gemma":[0.0063547306,0.00055801915,0.0008709141,0.0021416417,0.0051646554,0.009555842,0.0021331944,0.0026795452,0.0005926484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001102321,0.0000053196895,0.0001739373,0.000012928825,0.0000037878558,0.000018723165,0.00020446094,0.00030492467,0.00016486531,0.9969195,0.00028326528,0.0018972353],"study_design_scores_gemma":[0.000003962499,0.0000041316434,0.000106634056,0.0000057876136,0.0000040761042,0.00004560976,0.000074389274,0.0008067155,0.000074568765,0.9971765,0.0016938059,0.000003629825],"about_ca_topic_score_codex":0.0012120706,"about_ca_topic_score_gemma":0.0015561249,"teacher_disagreement_score":0.006492359,"about_ca_system_score_codex":0.0011683166,"about_ca_system_score_gemma":0.00059147744,"threshold_uncertainty_score":0.021719038},"labels":[],"label_agreement":null},{"id":"W2054737785","doi":"10.2991/iccnce.2013.31","title":"On the Decomposition of Posets into Minimum Set Node-Disjoint Chains","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Disjoint sets; Node (physics); Decomposition; Set (abstract data type); Computer science; Combinatorics; Theoretical computer science; Mathematics; Engineering; Programming language; Chemistry","score_opus":0.02070350863579198,"score_gpt":0.3068935041415692,"score_spread":0.28618999550577723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054737785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07443501,0.0007320124,0.9137638,0.0006143688,0.000059765025,0.00018170036,0.0005463093,0.0008405883,0.008826387],"genre_scores_gemma":[0.18338922,0.00078874134,0.8071676,0.00021089512,0.00010087159,0.00024790884,0.0020905712,0.00048726823,0.0055168904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991497,0.00027836938,0.00006042097,0.0002112474,0.00017276421,0.00012763045],"domain_scores_gemma":[0.9976482,0.0014222639,0.00020398089,0.00041782513,0.00014105767,0.0001667443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010534739,0.0011533508,0.0010646847,0.0012766551,0.0011048075,0.0016616494,0.00089681876,0.00093217887,0.006651675],"category_scores_gemma":[0.0036464185,0.0007760108,0.0012276033,0.0016449906,0.0017445799,0.0044258833,0.002403324,0.001363254,0.0013103274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070317416,0.00035553257,0.002187078,0.0011015557,0.0001226949,0.00031579725,0.0013491702,0.19006439,0.032989178,0.36792028,0.017436177,0.38545492],"study_design_scores_gemma":[0.000113319344,0.00022112053,0.00062079873,0.00012728023,0.000053922322,0.00035434577,0.00026622403,0.20085415,0.008582237,0.77579474,0.0129755605,0.000036269605],"about_ca_topic_score_codex":0.0010357541,"about_ca_topic_score_gemma":0.0017568199,"teacher_disagreement_score":0.006651675,"about_ca_system_score_codex":0.00070317485,"about_ca_system_score_gemma":0.0009537311,"threshold_uncertainty_score":0.022252023},"labels":[],"label_agreement":null},{"id":"W2054772581","doi":"10.1016/s0166-218x(99)00183-3","title":"The even adjacency split problem for graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Saskatchewan","funders":"","keywords":"Mathematics; Adjacency list; Combinatorics; Discrete mathematics","score_opus":0.016811688592944133,"score_gpt":0.2797410441744027,"score_spread":0.2629293555814586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054772581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6713323,0.0019552426,0.2485321,0.0066929236,0.0003777409,0.000120533856,0.0010654564,0.00041034014,0.069513425],"genre_scores_gemma":[0.9297605,0.0015071551,0.045042265,0.0007610366,0.00039301437,0.00012795269,0.0015079408,0.00029257,0.020607604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993412,0.00019230387,0.000028542883,0.0001662229,0.00011738753,0.0001543205],"domain_scores_gemma":[0.9953087,0.003170722,0.00036303516,0.00043230376,0.00022806966,0.0004971339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010133152,0.00081599085,0.0011297888,0.0009822292,0.0015205316,0.0033206062,0.0015869818,0.0018876339,0.012435233],"category_scores_gemma":[0.0064722197,0.00059768726,0.00056953565,0.0013402048,0.0020916467,0.0075472943,0.0021503381,0.0029908775,0.0011657531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048458696,0.0001750814,0.0013109884,0.00034637106,0.00005834224,0.00036631938,0.00070489,0.021363033,0.003526644,0.8940733,0.016468711,0.06112163],"study_design_scores_gemma":[0.000026443604,0.000014296334,0.00015094041,0.000013471674,0.0000102480635,0.00007252824,0.0001810078,0.016735386,0.00045422197,0.98050183,0.0018337672,0.0000057363695],"about_ca_topic_score_codex":0.00090773223,"about_ca_topic_score_gemma":0.0010441537,"teacher_disagreement_score":0.012435233,"about_ca_system_score_codex":0.00084668276,"about_ca_system_score_gemma":0.0008421427,"threshold_uncertainty_score":0.04159999},"labels":[],"label_agreement":null},{"id":"W2055422348","doi":"10.1016/j.dam.2011.07.016","title":"Maximizing edge-ratio is NP-complete","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Maximum cut; Graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.06736649496454762,"score_gpt":0.2829218158582461,"score_spread":0.2155553208936985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055422348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17589109,0.0038923589,0.67517424,0.016380591,0.00073816354,0.0012775906,0.009916999,0.005210405,0.11151856],"genre_scores_gemma":[0.6313169,0.0031740607,0.32632402,0.0026650487,0.0011292681,0.0010434848,0.004709524,0.0026914098,0.026946282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579227,0.0012944082,0.00019619243,0.0010792477,0.0009103487,0.0007274495],"domain_scores_gemma":[0.97914803,0.017269395,0.0009102275,0.0010808298,0.00090380065,0.0006877563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030601548,0.003689849,0.0058175623,0.0018332091,0.0016306402,0.006627032,0.006576799,0.0049527115,0.017692598],"category_scores_gemma":[0.019408088,0.0019871017,0.0021624835,0.005327827,0.0021510373,0.011502217,0.0031243507,0.005059679,0.0028876858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020489623,0.0015910122,0.00341835,0.0036100242,0.0007446544,0.0008773868,0.00057630613,0.37737006,0.012754351,0.23206826,0.10224831,0.2626924],"study_design_scores_gemma":[0.00060249266,0.00024723474,0.000926494,0.00013680458,0.00027910445,0.0012935873,0.00034863793,0.4468991,0.008509417,0.52805984,0.012626968,0.00007021254],"about_ca_topic_score_codex":0.0018325164,"about_ca_topic_score_gemma":0.002278345,"teacher_disagreement_score":0.017692598,"about_ca_system_score_codex":0.0031900166,"about_ca_system_score_gemma":0.0023546193,"threshold_uncertainty_score":0.05918765},"labels":[],"label_agreement":null},{"id":"W2055446353","doi":"10.4171/jems/320","title":"Triangle-intersecting families of graphs","year":2012,"lang":"en","type":"article","venue":"Journal of the European Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Mathematics; Combinatorics","score_opus":0.03325261629935669,"score_gpt":0.2902592949186205,"score_spread":0.25700667861926385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055446353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93256575,0.0004117475,0.052807648,0.00029224012,0.000018425473,0.00003532238,0.0006145217,0.0001883385,0.013065992],"genre_scores_gemma":[0.98234624,0.00021361613,0.014592982,0.00006354787,0.000041049236,0.000049695118,0.0007641764,0.0000487015,0.0018799761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989507,0.00020491857,0.000060436592,0.00035535792,0.00024185985,0.00018665753],"domain_scores_gemma":[0.9898072,0.005297962,0.0014734719,0.001219014,0.0011671662,0.0010351767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077669584,0.00030799725,0.0004265511,0.002297902,0.0024178226,0.0018447065,0.00097421,0.000618773,0.004423241],"category_scores_gemma":[0.0075832033,0.00056973845,0.0005408458,0.0017244985,0.0017843532,0.0023805073,0.0010718197,0.00065264077,0.00024190372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067067373,0.000116890566,0.04623416,0.00026995037,0.00016339529,0.0015395595,0.0028034092,0.03893253,0.02760751,0.8247246,0.006756752,0.050180618],"study_design_scores_gemma":[0.00007639559,0.00015722698,0.02328186,0.00010262704,0.00009072019,0.004400023,0.0017512317,0.18444668,0.015849516,0.75269324,0.017055916,0.0000946761],"about_ca_topic_score_codex":0.0023794668,"about_ca_topic_score_gemma":0.0018399495,"teacher_disagreement_score":0.004423241,"about_ca_system_score_codex":0.0013629983,"about_ca_system_score_gemma":0.00034251084,"threshold_uncertainty_score":0.014797211},"labels":[],"label_agreement":null},{"id":"W2055499237","doi":"10.1006/jctb.2001.2091","title":"On a Conjecture of Lovász Concerning Bricks","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Brick; Petersen graph; Cubic graph; Matching (statistics); Graph; Discrete mathematics; Line graph; Voltage graph; Engineering","score_opus":0.01866125685222832,"score_gpt":0.2619885753374605,"score_spread":0.24332731848523217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055499237","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36709207,0.0042937747,0.09565188,0.150806,0.0063265595,0.00016432202,0.0015669717,0.0009442243,0.37315428],"genre_scores_gemma":[0.9215782,0.0019291644,0.016742155,0.009422974,0.0037517261,0.00018191194,0.0012209055,0.00039871616,0.0447742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796045,0.00052510406,0.00010150292,0.00059787516,0.0003637359,0.00045136956],"domain_scores_gemma":[0.98907274,0.007614699,0.00071720884,0.0012482657,0.00075787725,0.00058918144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029137114,0.0008601029,0.00270635,0.002315503,0.0067956904,0.0055340677,0.0028709783,0.0068612043,0.023505408],"category_scores_gemma":[0.021109756,0.0011505098,0.0019318388,0.003336328,0.010911149,0.021840248,0.0061253207,0.00903349,0.003226762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009374405,0.000027140579,0.00021147197,0.000058470832,0.00000796017,0.00005714338,0.0003363036,0.00037043833,0.00017568664,0.98663956,0.009376123,0.002645903],"study_design_scores_gemma":[0.000037374357,0.000009329156,0.00010971533,0.000019879679,0.000009603014,0.00004078952,0.00012079763,0.0006754474,0.00008927307,0.99422693,0.0046481965,0.000012639512],"about_ca_topic_score_codex":0.0026324815,"about_ca_topic_score_gemma":0.0017491867,"teacher_disagreement_score":0.023505408,"about_ca_system_score_codex":0.0027178817,"about_ca_system_score_gemma":0.0012328447,"threshold_uncertainty_score":0.07863349},"labels":[],"label_agreement":null},{"id":"W2055572845","doi":"10.1002/net.20450","title":"Proximity and remoteness in graphs: Results and conjectures","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Independence number; Vertex (graph theory); Upper and lower bounds; Matching (statistics); Graph; Order (exchange); Connectivity; Discrete mathematics; Statistics","score_opus":0.02974784007176186,"score_gpt":0.25870406774043736,"score_spread":0.2289562276686755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055572845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6751546,0.016317455,0.2510732,0.008525638,0.00027054021,0.000079716985,0.0005820337,0.0006513596,0.047345486],"genre_scores_gemma":[0.9855387,0.0020737913,0.009934866,0.0002185289,0.00062605075,0.00004089525,0.00015686444,0.00006564275,0.0013446604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954346,0.0012663943,0.0002626119,0.0014088068,0.0012394697,0.0003880938],"domain_scores_gemma":[0.90842813,0.07462793,0.007042942,0.005068421,0.0020559363,0.0027766326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051155076,0.0008453965,0.0016656155,0.00455146,0.0019644538,0.0040619425,0.0027761962,0.0020391624,0.005649029],"category_scores_gemma":[0.043425184,0.0008752967,0.0010200536,0.0043416605,0.0067900703,0.016908413,0.0051933234,0.0036454604,0.000744013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013025055,0.00043481612,0.019376226,0.001207233,0.0001547792,0.00072723516,0.002994637,0.067564644,0.0064264205,0.8378381,0.0046465676,0.057326913],"study_design_scores_gemma":[0.0000553613,0.0002993711,0.006052748,0.00013400521,0.00007950532,0.0009313673,0.0008495835,0.05673743,0.0031826084,0.9277935,0.0038278303,0.000056677563],"about_ca_topic_score_codex":0.0006370892,"about_ca_topic_score_gemma":0.00041270643,"teacher_disagreement_score":0.005649029,"about_ca_system_score_codex":0.0015289984,"about_ca_system_score_gemma":0.00036643425,"threshold_uncertainty_score":0.027053714},"labels":[],"label_agreement":null},{"id":"W2055646787","doi":"10.1016/j.endm.2009.02.012","title":"Adjusted Interval Digraphs","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Mathematics; Interval (graph theory); Combinatorics; Discrete mathematics","score_opus":0.018577106685052972,"score_gpt":0.3012789117041017,"score_spread":0.28270180501904874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055646787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2786234,0.0010017033,0.43972808,0.0012053719,0.00069579255,0.00018698254,0.0021678887,0.0011641497,0.27522662],"genre_scores_gemma":[0.8525325,0.00073202106,0.07052076,0.00048661118,0.00021539745,0.0001757669,0.0018800054,0.0002825525,0.073174395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962056,0.00005663286,0.000023968476,0.000117015115,0.000105070874,0.00007669152],"domain_scores_gemma":[0.99872357,0.0003179705,0.00018932097,0.00018089115,0.00023847228,0.00034982793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002903471,0.00046240562,0.0005244221,0.0018353097,0.001090962,0.0019206803,0.0010252157,0.00074613665,0.020214826],"category_scores_gemma":[0.0023877635,0.00038530616,0.00054096564,0.0017403689,0.000640353,0.002006352,0.0012124752,0.002281051,0.0022186441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081056314,0.00003922731,0.00029979044,0.00004779751,0.000014333839,0.000109475666,0.00013040043,0.002040015,0.0020468384,0.9724089,0.0032272264,0.01955512],"study_design_scores_gemma":[0.00003118391,0.0000426303,0.0009280149,0.000018476225,0.000022253153,0.00020964128,0.00011813596,0.014724128,0.0011283061,0.9612131,0.02153876,0.000025266436],"about_ca_topic_score_codex":0.0009097959,"about_ca_topic_score_gemma":0.0009976485,"teacher_disagreement_score":0.020214826,"about_ca_system_score_codex":0.0008368471,"about_ca_system_score_gemma":0.00030256092,"threshold_uncertainty_score":0.067625344},"labels":[],"label_agreement":null},{"id":"W2055751002","doi":"10.1016/j.disc.2014.03.015","title":"Recognition of prime graphs from a prime subgraph","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Prime (order theory); Vertex (graph theory); Graph; Discrete mathematics; Singleton","score_opus":0.025591788007199887,"score_gpt":0.27737762576300273,"score_spread":0.2517858377558028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055751002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30794346,0.00047967065,0.6639799,0.0012959831,0.0002826068,0.00022131306,0.0018782213,0.003382809,0.02053606],"genre_scores_gemma":[0.7679127,0.000478419,0.21236002,0.00042163394,0.00021868532,0.00012426055,0.005923638,0.0007850274,0.011775642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995395,0.00007395967,0.00002760747,0.00019099432,0.00008965171,0.000078307334],"domain_scores_gemma":[0.99850696,0.0004726665,0.0001574722,0.00049728376,0.00021067004,0.0001548433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003199235,0.0005782427,0.00085846905,0.0010488004,0.0007354996,0.0020406186,0.00093676866,0.00093328493,0.0060204244],"category_scores_gemma":[0.0025933932,0.0004953369,0.0009359978,0.0010945027,0.0008633713,0.0034521287,0.0016349248,0.0018272498,0.0020501306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019468775,0.00046949156,0.011169178,0.0009425278,0.000120963065,0.0020443965,0.0020490459,0.03237253,0.123721875,0.45453703,0.03249324,0.33813277],"study_design_scores_gemma":[0.00006317331,0.00020147808,0.0036611005,0.00006606026,0.00009954351,0.001548266,0.00078553497,0.15167129,0.037793018,0.7760758,0.027963703,0.00007110276],"about_ca_topic_score_codex":0.0009753505,"about_ca_topic_score_gemma":0.0010819352,"teacher_disagreement_score":0.0060204244,"about_ca_system_score_codex":0.000419122,"about_ca_system_score_gemma":0.0004821998,"threshold_uncertainty_score":0.02014035},"labels":[],"label_agreement":null},{"id":"W205629517","doi":"","title":"Spanning trails that join given edges in 3-edge-connected graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Computer science; Telecommunications","score_opus":0.026175743226512723,"score_gpt":0.27252693756401697,"score_spread":0.24635119433750424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205629517","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6434781,0.0008244365,0.26121265,0.0008097857,0.0006837468,0.0005032415,0.002219367,0.0017571003,0.088511586],"genre_scores_gemma":[0.8027378,0.00068065344,0.15691665,0.00029263596,0.0000913647,0.00023166148,0.002221067,0.00027164552,0.036556523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965644,0.0000608354,0.00003585139,0.00006530832,0.00008102561,0.00010054829],"domain_scores_gemma":[0.9982097,0.00046606164,0.000386666,0.00035530466,0.00021998918,0.00036231554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004063317,0.00030720985,0.00032272312,0.0013227244,0.0017280392,0.0016719118,0.0007059197,0.0009074131,0.012062356],"category_scores_gemma":[0.0026402287,0.00041223952,0.0004974145,0.0014989418,0.00077636587,0.002163315,0.0016118024,0.0008858387,0.0026337348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010412186,0.000602906,0.006161952,0.0008006166,0.00013669765,0.002938852,0.0019946387,0.01898417,0.046003964,0.6720797,0.028782094,0.22047336],"study_design_scores_gemma":[0.00019930098,0.00044388982,0.004865086,0.00042010657,0.00019175508,0.0023538382,0.0020459185,0.06976669,0.031977516,0.8030142,0.084627084,0.00009466475],"about_ca_topic_score_codex":0.0007224865,"about_ca_topic_score_gemma":0.0023149885,"teacher_disagreement_score":0.012062356,"about_ca_system_score_codex":0.0003926505,"about_ca_system_score_gemma":0.0006139577,"threshold_uncertainty_score":0.040352523},"labels":[],"label_agreement":null},{"id":"W2056603572","doi":"10.1002/jgt.20125","title":"Erratum to: Factorizations and characterizations of induced‐hereditary and compositive properties","year":2005,"lang":"en","type":"erratum","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.024301531156611444,"score_gpt":0.27298535546477193,"score_spread":0.2486838243081605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056603572","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024329236,0.012869662,0.0809918,0.10972621,0.5938009,0.0002876999,0.007299011,0.0019857094,0.16870971],"genre_scores_gemma":[0.2603838,0.019103985,0.11726167,0.034074597,0.075918585,0.00052912085,0.016417973,0.004108794,0.4722014],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998329,0.0002658227,0.0002652299,0.00031724526,0.0007265161,0.00009610645],"domain_scores_gemma":[0.98633933,0.0061469935,0.0006210197,0.0011784226,0.005399361,0.0003149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532625,0.0010802246,0.0009357063,0.0026486863,0.002479585,0.0028205211,0.0011982082,0.0016350329,0.04446899],"category_scores_gemma":[0.022712935,0.000588256,0.000843197,0.0024707948,0.0022036415,0.004416252,0.001111996,0.0045649675,0.0125041455],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021756628,0.000048088823,0.00060614303,0.000398642,0.000023670362,0.0008384237,0.00035442977,0.0004970448,0.0011459471,0.082163885,0.864562,0.049144235],"study_design_scores_gemma":[0.000070559974,0.000078988916,0.0026660287,0.00047870833,0.00007362872,0.0029383216,0.00064385124,0.0027279807,0.0034409838,0.09623681,0.89052033,0.00012379623],"about_ca_topic_score_codex":0.0020973384,"about_ca_topic_score_gemma":0.0030404546,"teacher_disagreement_score":0.04446899,"about_ca_system_score_codex":0.0020801658,"about_ca_system_score_gemma":0.0010526673,"threshold_uncertainty_score":0.1487636},"labels":[],"label_agreement":null},{"id":"W2057066268","doi":"10.1016/s0012-365x(01)00158-3","title":"A family of universal pseudo-homogeneous G-colourable graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Countable set; Homogeneous; Discrete mathematics; Graph isomorphism; Graph; Line graph","score_opus":0.028750135858627665,"score_gpt":0.26149008944714447,"score_spread":0.2327399535885168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057066268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82093817,0.0014840217,0.10237067,0.0012327835,0.00016203235,0.000107250155,0.0010017734,0.0007343596,0.071968846],"genre_scores_gemma":[0.9752363,0.0005852628,0.011861992,0.0002102119,0.000057463858,0.000078584235,0.0005817542,0.00009338297,0.011295036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995567,0.000069733724,0.000017408162,0.00015424416,0.0000880858,0.00011378903],"domain_scores_gemma":[0.99866974,0.0005198245,0.00015980151,0.00017419066,0.00015565123,0.00032087244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039757942,0.0006174372,0.0006170645,0.0014361639,0.0019300587,0.001836401,0.0009942558,0.0006723618,0.004216765],"category_scores_gemma":[0.0019043175,0.0004756944,0.0006456087,0.0014358656,0.0014113857,0.0015989222,0.001504357,0.0010828468,0.00029970778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018181374,0.000034505785,0.0016660626,0.00015171677,0.00003696071,0.0007496753,0.0008695698,0.0023633006,0.006160019,0.9704376,0.0028547614,0.0144940885],"study_design_scores_gemma":[0.00009593091,0.00008410852,0.0050596176,0.00007695844,0.000099726865,0.0022193547,0.00059985847,0.017258484,0.0060356227,0.94340944,0.02500689,0.000054058488],"about_ca_topic_score_codex":0.0011725667,"about_ca_topic_score_gemma":0.00093059224,"teacher_disagreement_score":0.004216765,"about_ca_system_score_codex":0.0011320993,"about_ca_system_score_gemma":0.0004885214,"threshold_uncertainty_score":0.014106452},"labels":[],"label_agreement":null},{"id":"W2057179567","doi":"10.1016/j.disc.2011.03.026","title":"Graphs with equal eternal vertex cover and eternal domination numbers","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex cover; Vertex (graph theory); Domination analysis; Cover (algebra); Graph; Discrete mathematics","score_opus":0.029087318685136275,"score_gpt":0.2742533542844277,"score_spread":0.24516603559929143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057179567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7682256,0.0007113043,0.11709693,0.0021455176,0.00013311168,0.00008980412,0.0013708735,0.00033290885,0.10989394],"genre_scores_gemma":[0.9626986,0.0003970599,0.019752404,0.00031722954,0.00010676994,0.00012682362,0.0005813277,0.00008593028,0.015933866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983442,0.0003318407,0.000098188706,0.0003375908,0.00045534948,0.00043280478],"domain_scores_gemma":[0.99161035,0.0049894373,0.0009232652,0.00097359944,0.00072541006,0.000777982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012802674,0.00067862496,0.0010432026,0.0024533756,0.002139638,0.0038185313,0.0018261864,0.0012063414,0.010394189],"category_scores_gemma":[0.0076872585,0.0006894111,0.0006595571,0.0024786415,0.0032395257,0.0058473735,0.0025847799,0.0020886648,0.0007574293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040931764,0.00006353803,0.0015569741,0.00009913095,0.000034229157,0.00019740958,0.0003988329,0.005073835,0.0030420313,0.9737413,0.0020971028,0.013286217],"study_design_scores_gemma":[0.00008927843,0.00003010908,0.0015489325,0.00003617582,0.000049293514,0.0006361567,0.000231655,0.01521029,0.0029519317,0.97470677,0.0044783168,0.000031134423],"about_ca_topic_score_codex":0.001015109,"about_ca_topic_score_gemma":0.0013562797,"teacher_disagreement_score":0.010394189,"about_ca_system_score_codex":0.0014096266,"about_ca_system_score_gemma":0.0006250589,"threshold_uncertainty_score":0.03477204},"labels":[],"label_agreement":null},{"id":"W2057654888","doi":"10.1016/j.jctb.2008.08.006","title":"Growth rates of minor-closed classes of matroids","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Rank (graph theory); Minor (academic); Graphic matroid; Simple (philosophy); Class (philosophy); Matroid partitioning; Discrete mathematics","score_opus":0.020051602701198497,"score_gpt":0.281127115789744,"score_spread":0.2610755130885455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057654888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9290145,0.00090855843,0.04208681,0.002536584,0.00013487719,0.000083448576,0.0012671899,0.0004983387,0.023469716],"genre_scores_gemma":[0.978434,0.00081246515,0.009661959,0.00016213483,0.00029977356,0.00012726217,0.0011591824,0.0002710668,0.0090721045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985668,0.00034817687,0.00006477299,0.00024670252,0.00038168408,0.0003919529],"domain_scores_gemma":[0.9686177,0.019456772,0.0027078397,0.0017743786,0.0027387426,0.0047045015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026119608,0.0008773232,0.001385573,0.004297727,0.00281726,0.006644527,0.0026912354,0.0018060156,0.010303373],"category_scores_gemma":[0.032166865,0.0010094311,0.0010656193,0.0019698096,0.0027205583,0.005954421,0.0025458762,0.0028361792,0.0008537682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004917885,0.00014666391,0.010666577,0.00019130915,0.00004914884,0.00024069754,0.0013004842,0.017725965,0.008106807,0.9306289,0.010752738,0.019698925],"study_design_scores_gemma":[0.00007978146,0.00007576918,0.005766363,0.00006703949,0.00004626331,0.00088129856,0.00050145894,0.16726358,0.0036533026,0.816331,0.0052788607,0.000055220327],"about_ca_topic_score_codex":0.0019414048,"about_ca_topic_score_gemma":0.0018693,"teacher_disagreement_score":0.010303373,"about_ca_system_score_codex":0.0029729202,"about_ca_system_score_gemma":0.00085600954,"threshold_uncertainty_score":0.034468234},"labels":[],"label_agreement":null},{"id":"W2058105885","doi":"10.1145/1150334.1150337","title":"Bipartite roots of graphs","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Graph isomorphism; Complete bipartite graph; Discrete mathematics; Cograph; Time complexity; Edge-transitive graph; Line graph; Isomorphism (crystallography); Graph; Pathwidth; Voltage graph","score_opus":0.019697867541191533,"score_gpt":0.2844186336568095,"score_spread":0.264720766115618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058105885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2150124,0.0018275422,0.7003769,0.0031770177,0.00041728307,0.00061150757,0.0046535376,0.0029873226,0.07093643],"genre_scores_gemma":[0.62188816,0.0011193221,0.34352475,0.0009328423,0.00032956016,0.0003540957,0.0055742813,0.0005080441,0.025768874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986707,0.00024771984,0.00007102466,0.00047685928,0.0003216875,0.00021200285],"domain_scores_gemma":[0.9978502,0.0009854913,0.00024425107,0.00040405104,0.00033314174,0.00018291624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004444755,0.00043747138,0.0006981249,0.0010316952,0.0010033012,0.0017685445,0.0009484112,0.0012597949,0.0089331325],"category_scores_gemma":[0.004084856,0.00046985506,0.00053823466,0.0012673923,0.0015721149,0.004104979,0.0021996798,0.0017960535,0.001998168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031621743,0.000120052195,0.0033683204,0.0006592502,0.000067646346,0.0004898788,0.0010956572,0.013530064,0.024406582,0.80087113,0.028162371,0.12691288],"study_design_scores_gemma":[0.00004110606,0.00006690862,0.0015894867,0.000063872176,0.000027793867,0.0007855562,0.0004499484,0.037222415,0.0071620992,0.8991502,0.053410877,0.0000297621],"about_ca_topic_score_codex":0.0014621803,"about_ca_topic_score_gemma":0.0017490733,"teacher_disagreement_score":0.0089331325,"about_ca_system_score_codex":0.0008094882,"about_ca_system_score_gemma":0.0005835646,"threshold_uncertainty_score":0.029884279},"labels":[],"label_agreement":null},{"id":"W2058216532","doi":"10.1016/j.disc.2007.12.002","title":"On a cycle partition problem","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Partition (number theory); Circumference; Vertex (graph theory); Discrete mathematics; Graph; Chordal graph; Pathwidth; Line graph","score_opus":0.029932927174198425,"score_gpt":0.29276310488968144,"score_spread":0.262830177715483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058216532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4181418,0.0026978652,0.29649764,0.022937596,0.0011093911,0.00044759316,0.0015648556,0.00044014567,0.2561632],"genre_scores_gemma":[0.8131742,0.0032010435,0.082011364,0.0026186535,0.0013516359,0.0006096372,0.0034141382,0.0006573933,0.09296205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913067,0.0003000353,0.000028735194,0.00020967584,0.00017099996,0.00015984479],"domain_scores_gemma":[0.99606186,0.0027033759,0.00024285282,0.0003332924,0.00022249114,0.00043616106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010196203,0.0012504136,0.0019572824,0.0015224208,0.0027810442,0.004108825,0.0027141953,0.0043083504,0.028112397],"category_scores_gemma":[0.008865395,0.00091968424,0.001337394,0.003230509,0.0027826577,0.0084744105,0.0039160047,0.0049143117,0.001691659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024884604,0.00015181652,0.0004401264,0.00020158797,0.000048194008,0.00014926626,0.00033258702,0.01758387,0.0007545127,0.93338645,0.023182198,0.023520663],"study_design_scores_gemma":[0.00005541705,0.000020335514,0.00016014,0.000032318934,0.000019096871,0.00005620467,0.00014418767,0.026257731,0.00018602023,0.9690372,0.0040228465,0.000008436094],"about_ca_topic_score_codex":0.0022109246,"about_ca_topic_score_gemma":0.0018603456,"teacher_disagreement_score":0.028112397,"about_ca_system_score_codex":0.0016256286,"about_ca_system_score_gemma":0.0010163342,"threshold_uncertainty_score":0.09404528},"labels":[],"label_agreement":null},{"id":"W2058537654","doi":"10.1016/j.disc.2004.06.019","title":"On minimal prime extensions of a four-vertex graph in a prime graph","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Circulant graph; Neighbourhood (mathematics); Vertex (graph theory); Discrete mathematics; Graph; Prime (order theory); Complement graph; Graph power; Line graph","score_opus":0.030063820658872933,"score_gpt":0.29746555709682104,"score_spread":0.2674017364379481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058537654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8121806,0.00048770066,0.08217791,0.0019304963,0.00028966132,0.00012162634,0.0004894771,0.00022890091,0.10209366],"genre_scores_gemma":[0.93380296,0.00056325505,0.039650705,0.00041841457,0.00026553485,0.00013027566,0.0007792967,0.00015060202,0.024238946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958783,0.0001314101,0.000017479306,0.00010640179,0.00007501194,0.00008176194],"domain_scores_gemma":[0.9986324,0.0005314229,0.00021869891,0.00012773626,0.00012937651,0.0003603185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069496216,0.0009356198,0.0011531162,0.0014138792,0.0026769522,0.0017594208,0.00152626,0.0010615607,0.005944472],"category_scores_gemma":[0.002074778,0.0005444117,0.0011988803,0.001311744,0.0022954394,0.0037752609,0.0022247212,0.003090879,0.00063118717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001582889,0.00004843134,0.00036330277,0.00007175033,0.00001258449,0.0003093435,0.0005141307,0.002806044,0.0017423215,0.9872384,0.0016914365,0.0050438754],"study_design_scores_gemma":[0.00002192519,0.000025636298,0.00033509216,0.000022476834,0.000017233882,0.00015523117,0.00017631649,0.0057630762,0.00053844793,0.990222,0.002711423,0.000011262005],"about_ca_topic_score_codex":0.001242757,"about_ca_topic_score_gemma":0.0019196941,"teacher_disagreement_score":0.005944472,"about_ca_system_score_codex":0.00091758615,"about_ca_system_score_gemma":0.0005211423,"threshold_uncertainty_score":0.019886196},"labels":[],"label_agreement":null},{"id":"W2059051297","doi":"10.1016/j.ipl.2009.02.013","title":"An algorithm for computing simple k-factors","year":2009,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Simple (philosophy); Combinatorics; Algorithm; SIMPLE algorithm; Factor (programming language); Degenerate energy levels; Graphics; Computer science; Simple graph; Mathematics; Graph theory; Factor graph; Graph; Discrete mathematics","score_opus":0.01734897957320729,"score_gpt":0.30848656557231624,"score_spread":0.29113758599910894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059051297","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03138113,0.00056192634,0.94416803,0.00043963213,0.00027461408,0.00034035518,0.000849052,0.00717116,0.014814024],"genre_scores_gemma":[0.10823012,0.00026949434,0.8788674,0.00014575667,0.000078176716,0.00028505866,0.0015920491,0.00063975394,0.009892128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999141,0.00010299843,0.00007338928,0.00022547635,0.0002777414,0.00017935036],"domain_scores_gemma":[0.99859995,0.00040878795,0.000069611844,0.00046731243,0.00035045375,0.00010391205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054379925,0.00165392,0.0013884658,0.0016810994,0.0014967973,0.0022782919,0.001754211,0.0011476317,0.019425536],"category_scores_gemma":[0.003259314,0.00065292855,0.0015655385,0.0030574417,0.0010400341,0.003938685,0.0026007735,0.001397804,0.009580457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010788526,0.00024896357,0.0014638047,0.00058132055,0.000118201606,0.00017119193,0.00046164912,0.009890327,0.020759847,0.090918,0.028851256,0.84545654],"study_design_scores_gemma":[0.00079367595,0.00057903473,0.0019921192,0.00016882067,0.00032393806,0.0010487139,0.0006151956,0.1549061,0.037134647,0.7183349,0.083858594,0.00024422156],"about_ca_topic_score_codex":0.0026963009,"about_ca_topic_score_gemma":0.0050735315,"teacher_disagreement_score":0.019425536,"about_ca_system_score_codex":0.0010157088,"about_ca_system_score_gemma":0.001839313,"threshold_uncertainty_score":0.06498492},"labels":[],"label_agreement":null},{"id":"W2059398229","doi":"10.1137/110846828","title":"Planar Graphs Have Exponentially Many 3-Arboricities","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Planar graph; Combinatorics; Planar; Exponential growth; Colored; Projective test; Graph; Discrete mathematics; Class (philosophy); Planar straight-line graph; Outerplanar graph; 1-planar graph; Pathwidth; Line graph; Pure mathematics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.03082149681854752,"score_gpt":0.29916580342904087,"score_spread":0.26834430661049335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059398229","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71113217,0.0051248036,0.1904526,0.0074746045,0.0002513545,0.00011848692,0.004249568,0.0031216596,0.0780748],"genre_scores_gemma":[0.93757266,0.002997765,0.035421733,0.0011546243,0.00022206387,0.00024080678,0.002725901,0.0006211694,0.019043297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998546,0.00024392703,0.00008269288,0.00029412948,0.0004609268,0.00037232187],"domain_scores_gemma":[0.9884957,0.007548463,0.0010078799,0.0015821706,0.00084880815,0.00051700184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069979485,0.00089595356,0.0010061791,0.0010187663,0.0014797117,0.0030850645,0.0014795187,0.001371814,0.012785467],"category_scores_gemma":[0.007906805,0.0008732042,0.0012915473,0.001714538,0.0017313005,0.0062603313,0.0030841422,0.0027568855,0.0019548743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012960499,0.00030305615,0.013644527,0.0012891012,0.00022058508,0.0014104862,0.0009454847,0.053984832,0.029939458,0.74228525,0.03369189,0.12098925],"study_design_scores_gemma":[0.0001336505,0.00009869743,0.004752224,0.00013898234,0.00014397388,0.0023430404,0.00036744462,0.060277194,0.009952903,0.8912372,0.030478634,0.00007615598],"about_ca_topic_score_codex":0.0006458505,"about_ca_topic_score_gemma":0.0014489919,"teacher_disagreement_score":0.012785467,"about_ca_system_score_codex":0.0012844279,"about_ca_system_score_gemma":0.00042025218,"threshold_uncertainty_score":0.042771637},"labels":[],"label_agreement":null},{"id":"W2059447100","doi":"10.4153/cmb-2015-021-4","title":"On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold","year":2015,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Monopoly; Integer (computer science); Upper and lower bounds; Degree (music); Discrete mathematics; Physics; Mathematical analysis; Computer science","score_opus":0.0221388638266732,"score_gpt":0.2591739011194038,"score_spread":0.2370350372927306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059447100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80678046,0.0010997842,0.16782923,0.002006338,0.00006575837,0.00028124335,0.0020987026,0.00046254485,0.019375931],"genre_scores_gemma":[0.95371866,0.00043450692,0.041252315,0.00018423349,0.000104845625,0.00018683661,0.00078563986,0.00016169113,0.0031712162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986652,0.0003741824,0.000061116836,0.00035399772,0.0001730276,0.00037261145],"domain_scores_gemma":[0.98900294,0.0072203614,0.0013411152,0.00070716476,0.00039856602,0.0013298178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021511866,0.00092618755,0.001783905,0.0019669665,0.0014127163,0.0033644165,0.0020980232,0.001193613,0.0065307794],"category_scores_gemma":[0.011342384,0.00097088586,0.00082662574,0.0024927089,0.0016112599,0.004975872,0.0018604499,0.0014812696,0.00038974613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021873233,0.0006844309,0.009328216,0.0012628544,0.00029296472,0.0009556154,0.0010836466,0.44999042,0.031478193,0.41770384,0.018915795,0.06611676],"study_design_scores_gemma":[0.00017330804,0.000210951,0.002962867,0.00009090202,0.00007583105,0.0007139573,0.000575936,0.5854151,0.004931163,0.40031248,0.004480298,0.00005713671],"about_ca_topic_score_codex":0.002032835,"about_ca_topic_score_gemma":0.002350958,"teacher_disagreement_score":0.0065307794,"about_ca_system_score_codex":0.0025851966,"about_ca_system_score_gemma":0.0010810307,"threshold_uncertainty_score":0.021847665},"labels":[],"label_agreement":null},{"id":"W2059590924","doi":"10.1016/j.tcs.2010.07.017","title":"Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>ϵ</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math>time","year":2010,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constant (computer programming); Minor (academic); Scroll; Grid; Planar; Mathematics; Factor (programming language); Combinatorics; Computer science; Discrete mathematics; Computer graphics (images); Geometry; Programming language; Humanities; Engineering","score_opus":0.013831030640454033,"score_gpt":0.2509247616131342,"score_spread":0.23709373097268016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059590924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22558501,0.000980017,0.7177659,0.0008873031,0.00022438537,0.00014075261,0.0031409604,0.0030940045,0.04818158],"genre_scores_gemma":[0.61310947,0.00058723154,0.35771465,0.00019019043,0.00010060397,0.00014906238,0.006505663,0.0015463694,0.020096775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972755,0.000054029882,0.000010284932,0.00006308738,0.00008591075,0.00005916989],"domain_scores_gemma":[0.99852484,0.0007152421,0.000106798914,0.00029791,0.0002287846,0.00012653196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046579257,0.0010573147,0.0006859874,0.0012047866,0.0005867732,0.0017029268,0.0012281734,0.00073341205,0.019761518],"category_scores_gemma":[0.0049784863,0.00035629966,0.00076616684,0.0011846324,0.00064622273,0.0019748511,0.0011211818,0.0013946408,0.004334903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018230731,0.0003108999,0.006601824,0.0008292653,0.00011113819,0.00038368907,0.000936586,0.4038379,0.013585289,0.22886509,0.08353597,0.25917935],"study_design_scores_gemma":[0.00008576962,0.00007594921,0.0010758009,0.00006936747,0.00002569332,0.00015079648,0.00023604344,0.8202035,0.0030410627,0.16458565,0.010432387,0.000018069511],"about_ca_topic_score_codex":0.008267238,"about_ca_topic_score_gemma":0.017118886,"teacher_disagreement_score":0.019761518,"about_ca_system_score_codex":0.0014876081,"about_ca_system_score_gemma":0.000994082,"threshold_uncertainty_score":0.06610894},"labels":[],"label_agreement":null},{"id":"W2059685480","doi":"10.1016/j.disc.2004.02.022","title":"A generalization of the theorem of Lekkerkerker and Boland","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Mathematics; Generalization; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.015036969796973682,"score_gpt":0.2766363574825042,"score_spread":0.26159938768553054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059685480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013895952,0.004342235,0.88158655,0.004466783,0.0035340113,0.00009097366,0.0005001949,0.00048570833,0.0910976],"genre_scores_gemma":[0.47925153,0.01118499,0.3302444,0.0070344466,0.0075512514,0.00044472024,0.0010948064,0.0016783958,0.16151536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991672,0.00018253113,0.000041516087,0.00027225318,0.00025071812,0.00008568167],"domain_scores_gemma":[0.99868053,0.0005844145,0.00009409807,0.00024266995,0.00026781208,0.00013044315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014390567,0.0014721334,0.0016026474,0.002353907,0.0016200838,0.0019290413,0.00201847,0.0015880361,0.0109376535],"category_scores_gemma":[0.0044657737,0.0004955877,0.002112608,0.001643825,0.0027240496,0.0057965824,0.004280909,0.004542921,0.003340596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004275001,0.000044163822,0.00017995475,0.00022539568,0.00003265075,0.00012435144,0.0002250754,0.0038207376,0.002822167,0.95539457,0.009835555,0.02725266],"study_design_scores_gemma":[0.000015588801,0.000029651432,0.00022537634,0.000028845692,0.000023386167,0.00020558358,0.000042781052,0.026004188,0.00089027034,0.9453199,0.027189383,0.000025165804],"about_ca_topic_score_codex":0.0016057639,"about_ca_topic_score_gemma":0.001293719,"teacher_disagreement_score":0.0109376535,"about_ca_system_score_codex":0.0010672895,"about_ca_system_score_gemma":0.0008769359,"threshold_uncertainty_score":0.0365901},"labels":[],"label_agreement":null},{"id":"W2059686109","doi":"10.1016/j.laa.2004.03.016","title":"On the even permutation polytope","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Polytope; Birkhoff polytope; Combinatorics; Permutation (music); Convex polytope; Permutation matrix; Uniform k 21 polytope; Regular polygon; Geometry; Convex analysis; Convex optimization; Convex set","score_opus":0.018182293792979764,"score_gpt":0.28678242200097576,"score_spread":0.268600128207996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059686109","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3361127,0.0026044445,0.21821742,0.005449,0.0010684552,0.00007819934,0.0009301576,0.00030119982,0.43523833],"genre_scores_gemma":[0.8279017,0.0036670459,0.039234746,0.0013683357,0.0012657263,0.00012439159,0.0013804914,0.00041316592,0.124644384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996069,0.000085881875,0.000012448725,0.000085251086,0.00010580368,0.000103771796],"domain_scores_gemma":[0.999474,0.00026299647,0.000065028005,0.00005780507,0.000053098564,0.00008709488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003772973,0.00084411865,0.0009952636,0.0012268638,0.0018450683,0.002606142,0.0010206073,0.0007607177,0.020683084],"category_scores_gemma":[0.001145264,0.0004411709,0.0007020901,0.0017426179,0.0025774387,0.003944095,0.0017724338,0.0034120479,0.002650028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003089917,0.00002438328,0.000099404635,0.00003421838,0.000004931882,0.000066935914,0.000095281124,0.0022887127,0.00040478492,0.9851592,0.0040033604,0.0077878195],"study_design_scores_gemma":[0.0000066622342,0.00000774436,0.0000894938,0.000007917079,0.0000025397173,0.00004112789,0.000042896416,0.0033363379,0.00010974351,0.9921445,0.0042045345,0.000006551113],"about_ca_topic_score_codex":0.0019857935,"about_ca_topic_score_gemma":0.0019605397,"teacher_disagreement_score":0.020683084,"about_ca_system_score_codex":0.0010731079,"about_ca_system_score_gemma":0.0005744754,"threshold_uncertainty_score":0.06919181},"labels":[],"label_agreement":null},{"id":"W2059857922","doi":"10.1016/j.dam.2008.08.017","title":"On probe permutation graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"National Science Council","keywords":"Combinatorics; Chordal graph; Mathematics; Permutation graph; Pathwidth; Split graph; Indifference graph; Treewidth; Discrete mathematics; Partial k-tree; Cograph; 1-planar graph; Graph; Line graph","score_opus":0.01724167408746066,"score_gpt":0.2901345644692842,"score_spread":0.27289289038182357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059857922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30356568,0.0013509449,0.44494945,0.007241411,0.00080669107,0.00026853336,0.0013024785,0.0014081646,0.23910668],"genre_scores_gemma":[0.80802417,0.0016418456,0.067104355,0.0026164493,0.0007144922,0.0004193011,0.002484984,0.0014276257,0.11556675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919504,0.00028731689,0.000022613884,0.00019188007,0.00017600365,0.00012711124],"domain_scores_gemma":[0.9958211,0.002076767,0.00041418412,0.0009230154,0.0003055782,0.00045930376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007437971,0.0012365533,0.0011592988,0.0020980572,0.002215367,0.0027684344,0.0018551913,0.0024792051,0.02067784],"category_scores_gemma":[0.0076499092,0.0009478705,0.0010704742,0.0022042706,0.0028337569,0.006483962,0.0043168827,0.0041024787,0.0026452623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092942864,0.000028750705,0.00022240535,0.000041788648,0.0000075641287,0.00006306738,0.00017895194,0.0025103241,0.0012530523,0.98146844,0.0046247924,0.0095078545],"study_design_scores_gemma":[0.000009944983,0.000012771168,0.000121691184,0.000012193287,0.0000056902754,0.00006149173,0.00006185056,0.0091571575,0.00040026047,0.98691595,0.0032340533,0.0000067909045],"about_ca_topic_score_codex":0.0010033036,"about_ca_topic_score_gemma":0.0009777402,"teacher_disagreement_score":0.02067784,"about_ca_system_score_codex":0.0013933112,"about_ca_system_score_gemma":0.000645234,"threshold_uncertainty_score":0.06917423},"labels":[],"label_agreement":null},{"id":"W2060148847","doi":"10.1016/s1570-8667(03)00002-9","title":"Algorithms for shortest paths and d-cycle problems","year":2003,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Shortest path problem; Cyclomatic complexity; Mathematics; Yen's algorithm; Path (computing); Widest path problem; Combinatorics; Graph; Shortest Path Faster Algorithm; Algorithm; K shortest path routing; Dijkstra's algorithm; Computer science; Discrete mathematics; Software","score_opus":0.026545878178149074,"score_gpt":0.3063723455624698,"score_spread":0.2798264673843207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060148847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037603874,0.0032538215,0.9251349,0.0028381215,0.00036648125,0.0005091241,0.0009412488,0.0018529341,0.027499473],"genre_scores_gemma":[0.17879407,0.0026550696,0.80083406,0.00075895764,0.00032042232,0.0008547705,0.0025278402,0.000601767,0.012653042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830186,0.00041870642,0.00013123629,0.00051684753,0.0003794758,0.00025178524],"domain_scores_gemma":[0.9936481,0.0043118135,0.0003298693,0.00089551206,0.0004679798,0.0003466466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017864828,0.0017343921,0.0015749729,0.0026987586,0.0016926321,0.0039748554,0.004661305,0.0032181786,0.014982258],"category_scores_gemma":[0.013382533,0.0011637289,0.0017410839,0.0056377235,0.0014649212,0.009707578,0.004349643,0.0038993133,0.0026642848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009431257,0.00053031475,0.0013683815,0.0013433768,0.00017795536,0.00010451961,0.0004686407,0.1331412,0.0029957057,0.35458726,0.034105103,0.47023433],"study_design_scores_gemma":[0.00039031482,0.00008302995,0.00030941502,0.000107248685,0.000089890804,0.00015395753,0.00020258036,0.29990935,0.0019467644,0.6789866,0.017786134,0.000034752105],"about_ca_topic_score_codex":0.0040763295,"about_ca_topic_score_gemma":0.0054995925,"teacher_disagreement_score":0.014982258,"about_ca_system_score_codex":0.0027815758,"about_ca_system_score_gemma":0.002861757,"threshold_uncertainty_score":0.05012065},"labels":[],"label_agreement":null},{"id":"W2060176530","doi":"10.1016/j.disc.2007.12.053","title":"Claw-free graphs are not universal fixers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.035678591440143834,"score_gpt":0.27477813120168937,"score_spread":0.23909953976154552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060176530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63661784,0.0025738713,0.19539799,0.0036312393,0.0007126191,0.00030677396,0.001416243,0.0036268681,0.15571654],"genre_scores_gemma":[0.9312517,0.0008154143,0.025170544,0.00095420546,0.00018823372,0.00027755406,0.0011997154,0.0009086287,0.039233916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997603,0.0002047233,0.00010553117,0.0009350636,0.00037902646,0.000772698],"domain_scores_gemma":[0.98971844,0.00473221,0.0009127421,0.0024775565,0.0010226414,0.0011363891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019747391,0.0015892067,0.0024084237,0.0045937044,0.0065068123,0.0071786526,0.0029813573,0.003923407,0.0189415],"category_scores_gemma":[0.009562312,0.0028512,0.002434734,0.0031658572,0.0077125505,0.019574191,0.008163446,0.006675625,0.0026076995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013721341,0.00004182877,0.0008177785,0.000121643316,0.000063217536,0.00016390454,0.0006522552,0.00064067205,0.0017939534,0.9859211,0.0022992752,0.007347086],"study_design_scores_gemma":[0.000048352016,0.000021306776,0.0004015914,0.000051151066,0.00008126799,0.00024325785,0.0004446356,0.0012044812,0.0022489037,0.98943007,0.005785635,0.00003933635],"about_ca_topic_score_codex":0.0021102761,"about_ca_topic_score_gemma":0.0028054737,"teacher_disagreement_score":0.0189415,"about_ca_system_score_codex":0.0026167426,"about_ca_system_score_gemma":0.0012389348,"threshold_uncertainty_score":0.06336558},"labels":[],"label_agreement":null},{"id":"W2060658636","doi":"","title":"Complexity of generalized colourings of chordal graphs","year":2008,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Split graph; Treewidth; Pathwidth; Indifference graph; Discrete mathematics; Interval graph; Time complexity; Graph; 1-planar graph; Line graph","score_opus":0.02899952163028764,"score_gpt":0.2599973221002231,"score_spread":0.23099780046993545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060658636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91789156,0.0006398187,0.067242846,0.0023345149,0.00008383567,0.0002926278,0.0023695882,0.00067288894,0.008472333],"genre_scores_gemma":[0.95675427,0.0004883084,0.034707416,0.0002487773,0.00010728471,0.00018337778,0.0033234034,0.00018695285,0.004000052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973091,0.0006296536,0.0001844295,0.00087377976,0.00046980885,0.0005332783],"domain_scores_gemma":[0.98479974,0.010941811,0.0012656193,0.0016245544,0.00051599485,0.00085231726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011925293,0.0010311101,0.0015035865,0.0006912164,0.001215172,0.004820071,0.0027209271,0.0022310428,0.0055985777],"category_scores_gemma":[0.012122865,0.00070908025,0.0016759152,0.0017084869,0.002481626,0.006676311,0.0027141748,0.0023668108,0.00040158132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022217713,0.000513562,0.014961879,0.0014966354,0.0003757153,0.0011095108,0.002036585,0.65376586,0.021689747,0.20950012,0.015601043,0.07672761],"study_design_scores_gemma":[0.0003380135,0.00012259469,0.0028958227,0.00004476753,0.00009520026,0.0004940995,0.0005801402,0.4746315,0.004595381,0.51310384,0.0030515157,0.000047178135],"about_ca_topic_score_codex":0.0056771794,"about_ca_topic_score_gemma":0.004468486,"teacher_disagreement_score":0.0056771794,"about_ca_system_score_codex":0.0031998707,"about_ca_system_score_gemma":0.0016672703,"threshold_uncertainty_score":0.023216844},"labels":[],"label_agreement":null},{"id":"W2060877605","doi":"10.1006/jctb.2001.2032","title":"Matroid 4-Connectivity: A Deletion–Contraction Theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Combinatorics; Mathematics; Element (criminal law); Contraction (grammar); Discrete mathematics","score_opus":0.01198728508842466,"score_gpt":0.269787487247202,"score_spread":0.2578002021587773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060877605","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5363524,0.0015055469,0.30255064,0.007656615,0.00039454692,0.00017189876,0.0008689516,0.0005639771,0.14993545],"genre_scores_gemma":[0.8899928,0.0016301592,0.07468415,0.0018668589,0.0006960605,0.00035702824,0.0015868141,0.00040046324,0.028785748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936014,0.00012603142,0.000034479068,0.00019931133,0.00017843777,0.00010161233],"domain_scores_gemma":[0.99596196,0.002530174,0.00037102777,0.00040761396,0.0003694297,0.00035972786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074935326,0.00083402905,0.0013412788,0.001568716,0.0018950305,0.0024894397,0.0027966218,0.0017958604,0.011305415],"category_scores_gemma":[0.004098339,0.0011353694,0.0012028734,0.001859032,0.0027522042,0.0074414555,0.003586476,0.004929576,0.0011356685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014819563,0.00008316399,0.0009544861,0.00014700844,0.00002482715,0.00035480445,0.0006408808,0.002450692,0.004743226,0.96860605,0.005251432,0.01659524],"study_design_scores_gemma":[0.00005592992,0.00004581545,0.00082755135,0.000023493798,0.00005132007,0.0008933984,0.0002499289,0.013911574,0.0019534514,0.97320807,0.0087581575,0.000021199025],"about_ca_topic_score_codex":0.0007505854,"about_ca_topic_score_gemma":0.00070520525,"teacher_disagreement_score":0.011305415,"about_ca_system_score_codex":0.00075538974,"about_ca_system_score_gemma":0.00049485883,"threshold_uncertainty_score":0.0378204},"labels":[],"label_agreement":null},{"id":"W2061151678","doi":"10.7151/dmgt.1503","title":"Structure of the set of all minimal total dominating functions of some classes of graphs","year":2010,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Set (abstract data type); Discrete mathematics; Graph; Vertex (graph theory); Computer science","score_opus":0.0143643200391098,"score_gpt":0.2804135836343913,"score_spread":0.26604926359528147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061151678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8890593,0.0009956749,0.06887754,0.0021074796,0.00006763592,0.00006142601,0.0028507442,0.00023366117,0.035746574],"genre_scores_gemma":[0.9686022,0.000771233,0.0139883915,0.00029653296,0.00024442273,0.0001844947,0.0035679054,0.000119922646,0.012224879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999213,0.00020061484,0.00004407638,0.0002259423,0.00016635237,0.00014997314],"domain_scores_gemma":[0.9950972,0.0029839305,0.0005260946,0.0002903642,0.00053970795,0.0005625809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011688169,0.0010490027,0.0014150719,0.0049350336,0.0025445581,0.005984263,0.0019306357,0.001341326,0.0065410035],"category_scores_gemma":[0.0041790083,0.0008324189,0.0013083657,0.0027355682,0.0028015277,0.003978587,0.0014852824,0.002459048,0.0006102136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017741961,0.00009153366,0.0022330256,0.000154105,0.00008323401,0.00012766023,0.0006662201,0.0036671,0.0026991914,0.9782265,0.0028795642,0.008994452],"study_design_scores_gemma":[0.00005050779,0.000052146577,0.0025122345,0.00004082428,0.000056197612,0.00040677594,0.00028575724,0.016325207,0.0014390328,0.9758445,0.002957692,0.000029103878],"about_ca_topic_score_codex":0.0010371909,"about_ca_topic_score_gemma":0.0007663381,"teacher_disagreement_score":0.0065410035,"about_ca_system_score_codex":0.002328984,"about_ca_system_score_gemma":0.00092701614,"threshold_uncertainty_score":0.021881878},"labels":[],"label_agreement":null},{"id":"W2061237693","doi":"10.1007/s10107-005-0649-5","title":"Independent packings in structured graphs","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Indifference graph; Pathwidth; Mathematics; Cograph; Clique-sum; Split graph; 1-planar graph; Maximal independent set; Modular decomposition; Disjoint sets; Discrete mathematics; Interval graph; Treewidth; Partial k-tree; Graph; Line graph","score_opus":0.02153618353391824,"score_gpt":0.30257266948494643,"score_spread":0.2810364859510282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061237693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35064954,0.0011523599,0.5818549,0.0022445277,0.00026098342,0.00017417324,0.0005350356,0.0005171574,0.06261131],"genre_scores_gemma":[0.7716635,0.0015881581,0.18584682,0.0007713171,0.0006192485,0.00038115916,0.001356688,0.0005100138,0.03726307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998852,0.00036760757,0.00006571654,0.0002163751,0.00033827798,0.00015999142],"domain_scores_gemma":[0.9936941,0.00405974,0.0009184103,0.000509718,0.00033334055,0.00048464997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011380705,0.0009032221,0.0014403001,0.0028027897,0.0019169871,0.004409209,0.0018893884,0.0022145072,0.008522787],"category_scores_gemma":[0.008069434,0.002237722,0.0014572886,0.00390013,0.0028589321,0.007931883,0.0027060132,0.00390689,0.0012595953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004752861,0.00006972908,0.0004031584,0.0000946503,0.00002342815,0.00011346938,0.00033764524,0.013755254,0.00051104417,0.9690699,0.0036672354,0.011906951],"study_design_scores_gemma":[0.000012004503,0.000011909766,0.00011742697,0.000015794649,0.0000111844765,0.00006431706,0.00007970171,0.03169609,0.000232189,0.96668565,0.0010675857,0.0000061936666],"about_ca_topic_score_codex":0.000705414,"about_ca_topic_score_gemma":0.0011304122,"teacher_disagreement_score":0.008522787,"about_ca_system_score_codex":0.0011268111,"about_ca_system_score_gemma":0.00059068704,"threshold_uncertainty_score":0.028511524},"labels":[],"label_agreement":null},{"id":"W2061275745","doi":"10.1016/j.jctb.2011.06.004","title":"On the maximum size of a minimal k-edge connected augmentation","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Simple (philosophy); Mathematics; Undirected graph; Graph; Generalization; Enhanced Data Rates for GSM Evolution; Connectivity; Vertex connectivity; Simple graph; Degree (music); Discrete mathematics; Computer science; Physics; Artificial intelligence","score_opus":0.025940067529460615,"score_gpt":0.2665166091183068,"score_spread":0.2405765415888462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061275745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85303664,0.00071998435,0.06851745,0.0033397856,0.00016544698,0.00015561617,0.003031885,0.00071731623,0.07031591],"genre_scores_gemma":[0.94933814,0.0005036007,0.040426705,0.0003748933,0.00019749349,0.00023890265,0.0015546648,0.0003034936,0.007062094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900323,0.00027878204,0.00006655227,0.00024470757,0.00019890696,0.00020784428],"domain_scores_gemma":[0.98615867,0.010476565,0.000836438,0.00089857954,0.0005463879,0.0010833073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012778906,0.000826095,0.0013903473,0.0013218977,0.0017998487,0.004481089,0.0024734915,0.0018146702,0.014385696],"category_scores_gemma":[0.009718269,0.0010537193,0.0010666634,0.0015069362,0.0023796163,0.006083418,0.0024255314,0.0018640246,0.0012051585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029902903,0.00035995076,0.008468644,0.0012014366,0.00019385156,0.000685689,0.0014200254,0.05773506,0.051238604,0.80250275,0.0191564,0.05404716],"study_design_scores_gemma":[0.00019670864,0.00022449091,0.0038858382,0.0001666567,0.00019103239,0.00094186055,0.0005911539,0.099694304,0.009185796,0.8774692,0.0073896535,0.00006339271],"about_ca_topic_score_codex":0.00059547287,"about_ca_topic_score_gemma":0.0008998124,"teacher_disagreement_score":0.014385696,"about_ca_system_score_codex":0.0011262767,"about_ca_system_score_gemma":0.0008588495,"threshold_uncertainty_score":0.04812497},"labels":[],"label_agreement":null},{"id":"W2061450212","doi":"10.1017/s0963548312000272","title":"Connectivity for Bridge-Addable Monotone Graph Classes","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Monotone polygon; Mathematics; Vertex (graph theory); Graph; Monotonic function; Discrete mathematics; Geometry","score_opus":0.058127070442409265,"score_gpt":0.3213482555105076,"score_spread":0.26322118506809833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061450212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8915918,0.0002389794,0.09371302,0.0010503143,0.000031115494,0.00007711316,0.0003543244,0.00016072695,0.012782597],"genre_scores_gemma":[0.9908494,0.00014378474,0.007288808,0.00013495456,0.000087040775,0.00008996671,0.00027757374,0.000038575297,0.0010898568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982247,0.0004141481,0.000074278374,0.00047002584,0.00050645793,0.00031042082],"domain_scores_gemma":[0.97678214,0.015877448,0.0025712808,0.0018530169,0.0011037394,0.001812365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019712762,0.00032068146,0.00059930276,0.0018528565,0.0014650403,0.0020270457,0.0014980094,0.0013861437,0.0058579664],"category_scores_gemma":[0.021573935,0.00046175264,0.00076010684,0.00079017907,0.0023170004,0.004023502,0.0019946604,0.0018856127,0.0002758274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006605704,0.00020555954,0.024396908,0.00026329706,0.00007724739,0.0004764939,0.0013707918,0.02630849,0.011656225,0.89399606,0.00424294,0.036345337],"study_design_scores_gemma":[0.0001256235,0.00023226769,0.008214235,0.00006333516,0.00006712039,0.0011817195,0.00032218095,0.2684784,0.0039025242,0.71256316,0.004803846,0.00004551457],"about_ca_topic_score_codex":0.0008046209,"about_ca_topic_score_gemma":0.00084401766,"teacher_disagreement_score":0.0058579664,"about_ca_system_score_codex":0.0011635255,"about_ca_system_score_gemma":0.00042830457,"threshold_uncertainty_score":0.019596875},"labels":[],"label_agreement":null},{"id":"W2061817817","doi":"10.1016/j.aim.2012.10.006","title":"Corrigendum to “Polytopes of high rank for the symmetric groups” [Adv. Math. 228 (2011) 3207–3222]","year":2012,"lang":"en","type":"erratum","venue":"Advances in Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Polytope; Rank (graph theory); Pure mathematics; Combinatorics","score_opus":0.03295857409913792,"score_gpt":0.314688810456261,"score_spread":0.2817302363571231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061817817","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004412633,0.008681917,0.003987482,0.083752364,0.8663821,0.000111688285,0.0019342566,0.0009190965,0.033789787],"genre_scores_gemma":[0.022438634,0.02335783,0.009051203,0.076750055,0.32281798,0.00049400993,0.0053211357,0.0021655082,0.5376036],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99628866,0.0006857994,0.0003607595,0.0007941525,0.0015095755,0.000361087],"domain_scores_gemma":[0.99312264,0.0016465323,0.00033594336,0.0006384138,0.003681883,0.0005745343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025165107,0.0029761926,0.0037303127,0.0048365607,0.0036015662,0.003299699,0.0047185975,0.004118076,0.14569448],"category_scores_gemma":[0.015295707,0.0013658128,0.0031715957,0.0029183617,0.0028079252,0.005302041,0.002766071,0.0057954225,0.057160776],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039247396,0.000013397031,0.00004229183,0.00021018789,0.00002661905,0.00009293992,0.000019940777,0.000090283684,0.00009242162,0.003984535,0.99026746,0.0051207105],"study_design_scores_gemma":[0.00007447971,0.00007873493,0.001683235,0.00024145168,0.00008597509,0.00045869692,0.0000700176,0.0009370557,0.00074759097,0.027728237,0.96778417,0.0001102733],"about_ca_topic_score_codex":0.011136812,"about_ca_topic_score_gemma":0.015166946,"teacher_disagreement_score":0.14569448,"about_ca_system_score_codex":0.005955948,"about_ca_system_score_gemma":0.0024371638,"threshold_uncertainty_score":0.4873966},"labels":[],"label_agreement":null},{"id":"W206221419","doi":"","title":"A note on critical sets","year":2002,"lang":"es","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Counterexample; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.06425381317664465,"score_gpt":0.37009303445390607,"score_spread":0.30583922127726143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206221419","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07675177,0.07920053,0.30882698,0.088425584,0.022676017,0.00019848683,0.0014329018,0.001148326,0.42133933],"genre_scores_gemma":[0.6363102,0.041246276,0.14694089,0.015877554,0.013278721,0.00036084282,0.0014931591,0.00077055226,0.14372177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888843,0.00027806498,0.000055238917,0.0002547702,0.000388185,0.00013530845],"domain_scores_gemma":[0.9956519,0.0029447665,0.00008780866,0.00033160197,0.00071885803,0.00026499256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012830977,0.00066908513,0.00068201555,0.002623374,0.003685037,0.0025455977,0.0010817524,0.001089029,0.013764933],"category_scores_gemma":[0.0062252292,0.00046978344,0.00061438465,0.0026452118,0.0028043105,0.004458244,0.0027990898,0.0047606686,0.0016257765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039758193,0.000019155728,0.0005161116,0.00015410046,0.000010042366,0.00031465373,0.0004468372,0.0010511931,0.0011615895,0.89326036,0.060537435,0.04248876],"study_design_scores_gemma":[0.000012425323,0.000030427807,0.0004343762,0.000107571046,0.000011698275,0.0002888937,0.0002342504,0.002112144,0.0013400883,0.7235864,0.27182117,0.000020599877],"about_ca_topic_score_codex":0.006365597,"about_ca_topic_score_gemma":0.0075030494,"teacher_disagreement_score":0.013764933,"about_ca_system_score_codex":0.0024840438,"about_ca_system_score_gemma":0.0013715489,"threshold_uncertainty_score":0.046048343},"labels":[],"label_agreement":null},{"id":"W2062277114","doi":"10.1016/s0012-365x(02)00806-3","title":"Changing upper irredundance by edge addition","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of South Africa; National Research Foundation","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Vertex (graph theory); Graph; Discrete mathematics; Computer science","score_opus":0.01799772471379416,"score_gpt":0.2838632688220105,"score_spread":0.26586554410821633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062277114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47207433,0.0008435726,0.2672488,0.0029926903,0.0017764295,0.000080212674,0.0003821204,0.0029606465,0.25164112],"genre_scores_gemma":[0.92071533,0.0005845424,0.04379968,0.0011149461,0.00046139862,0.00006228866,0.00025334343,0.0016206534,0.03138776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984359,0.00027587576,0.00007852373,0.00040608348,0.0003619357,0.00044158247],"domain_scores_gemma":[0.9933339,0.0028400584,0.00040250624,0.002037553,0.00059710507,0.0007890541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013481207,0.0011082608,0.0012542605,0.0023912007,0.0030832933,0.0037008915,0.0023730563,0.0018172459,0.028168987],"category_scores_gemma":[0.01107332,0.00088138774,0.001473435,0.0017090124,0.0032114738,0.009422531,0.004109098,0.004397469,0.0026904664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034803202,0.00014424653,0.0004364155,0.000090859314,0.000017272556,0.00023325534,0.00029591707,0.0035731692,0.010861786,0.95102507,0.00359057,0.029383557],"study_design_scores_gemma":[0.000021973474,0.00004355061,0.00023658025,0.000021692595,0.000020282334,0.00016575182,0.000112115966,0.009116168,0.0064671123,0.9788261,0.00494094,0.000027805962],"about_ca_topic_score_codex":0.0007630428,"about_ca_topic_score_gemma":0.0009938754,"teacher_disagreement_score":0.028168987,"about_ca_system_score_codex":0.001005778,"about_ca_system_score_gemma":0.00054327026,"threshold_uncertainty_score":0.094234586},"labels":[],"label_agreement":null},{"id":"W2062659098","doi":"10.1007/s00453-010-9442-9","title":"Complexity of Finding Graph Roots with Girth Conditions","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Discrete mathematics; Graph; Theory of computation; Graph power; Line graph; Algorithm","score_opus":0.03151075115654251,"score_gpt":0.30656467509930185,"score_spread":0.27505392394275935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062659098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7379958,0.0014072744,0.20817284,0.012186713,0.00036556265,0.00059380376,0.0059828865,0.0029608682,0.03033427],"genre_scores_gemma":[0.8634877,0.0009091246,0.11536207,0.0007470151,0.0006013671,0.00036380056,0.007250994,0.00090021675,0.010377664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594504,0.0009907114,0.00024644934,0.0010442904,0.0010913468,0.0006821175],"domain_scores_gemma":[0.9514175,0.04214189,0.0015426107,0.0026944177,0.0010795107,0.0011240535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020687713,0.0014828227,0.0027456696,0.0017658544,0.0021839733,0.007308778,0.004469884,0.004021594,0.02558992],"category_scores_gemma":[0.029776799,0.0012031083,0.002644198,0.0031149285,0.00324774,0.012333277,0.004331609,0.0043525966,0.0023808945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006056318,0.0015951473,0.020557256,0.0032442694,0.0007126484,0.0015039389,0.00233379,0.43613753,0.020115985,0.2190507,0.06203205,0.22666042],"study_design_scores_gemma":[0.0008592776,0.00023938567,0.0023306387,0.000081695354,0.00028322852,0.0006270587,0.00083768513,0.37531188,0.005118792,0.6114576,0.0027766114,0.000076115546],"about_ca_topic_score_codex":0.0043902663,"about_ca_topic_score_gemma":0.00547319,"teacher_disagreement_score":0.02558992,"about_ca_system_score_codex":0.0027108546,"about_ca_system_score_gemma":0.003919782,"threshold_uncertainty_score":0.08560681},"labels":[],"label_agreement":null},{"id":"W2062725515","doi":"10.1016/j.crma.2010.06.022","title":"Inversion dans les tournois","year":2010,"lang":"fr","type":"article","venue":"Comptes Rendus Mathématique","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Humanities; Physics; Philosophy","score_opus":0.034483484929260635,"score_gpt":0.29527650946981404,"score_spread":0.2607930245405534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062725515","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07888442,0.0017569456,0.4384614,0.0042598103,0.0015984721,0.00018361649,0.00029539067,0.0012460285,0.47331393],"genre_scores_gemma":[0.5768094,0.0016695076,0.0938012,0.0012456288,0.00042331815,0.0003453948,0.000350277,0.0010480073,0.32430732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980565,0.00064161967,0.00006719651,0.00033110473,0.0006689392,0.000234719],"domain_scores_gemma":[0.99882156,0.00044690145,0.00007002245,0.00022309758,0.0003665724,0.000071756986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001436365,0.0008931473,0.000466175,0.00097403507,0.0023140307,0.0038553986,0.0007334806,0.001384879,0.021876676],"category_scores_gemma":[0.0052187145,0.00047027896,0.0011320065,0.0008589714,0.004850408,0.0027468381,0.0017993356,0.0042367303,0.0040833084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094547635,0.00001946952,0.0004074881,0.00009151574,0.000014971854,0.00025425915,0.0020563158,0.002482892,0.0041689747,0.9378809,0.004973457,0.047555327],"study_design_scores_gemma":[0.000070548536,0.0001225533,0.000842511,0.00011086699,0.000039860646,0.0006162788,0.0031674958,0.00888381,0.013707823,0.39625603,0.5761235,0.000058894824],"about_ca_topic_score_codex":0.0104088895,"about_ca_topic_score_gemma":0.010257201,"teacher_disagreement_score":0.021876676,"about_ca_system_score_codex":0.0028101024,"about_ca_system_score_gemma":0.0015648111,"threshold_uncertainty_score":0.07318473},"labels":[],"label_agreement":null},{"id":"W2063676786","doi":"10.5539/jmr.v2n4p79","title":"On Tape Graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Ribbon; Indifference graph; 1-planar graph; Chordal graph; Graph; Representation (politics); Discrete mathematics; Geometry","score_opus":0.08339038348370366,"score_gpt":0.4216306515457202,"score_spread":0.33824026806201657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063676786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18305479,0.0018630886,0.5543338,0.0015143213,0.0012849384,0.00017592596,0.0009690565,0.0012153696,0.25558865],"genre_scores_gemma":[0.79223096,0.0032961047,0.093195595,0.0012230023,0.0009793252,0.00027481533,0.0012305449,0.00069664436,0.10687304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994393,0.00014937155,0.000022386159,0.00012093559,0.00014527905,0.00012270236],"domain_scores_gemma":[0.99925154,0.0001840869,0.00011467306,0.00017421953,0.00016030748,0.00011511858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025617465,0.00053858565,0.0003186001,0.0011691549,0.0014685504,0.0012934185,0.00071863015,0.0006720402,0.012182719],"category_scores_gemma":[0.0016980399,0.00024387958,0.0005655883,0.0013856086,0.0013144047,0.0029463754,0.001449667,0.0013943147,0.0020868508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056914236,0.000021803446,0.000305517,0.000096202144,0.000009304179,0.0003664771,0.00043271648,0.0035250096,0.0034465,0.9625062,0.005306058,0.023927348],"study_design_scores_gemma":[0.00001684578,0.000058875816,0.00054935506,0.000058477784,0.000020262163,0.0006991564,0.00041708615,0.0118938275,0.0025435071,0.9279143,0.055800978,0.000027349943],"about_ca_topic_score_codex":0.002201579,"about_ca_topic_score_gemma":0.0017274314,"teacher_disagreement_score":0.012182719,"about_ca_system_score_codex":0.00067179656,"about_ca_system_score_gemma":0.00035082534,"threshold_uncertainty_score":0.040755212},"labels":[],"label_agreement":null},{"id":"W2063861912","doi":"10.1016/j.jda.2012.06.001","title":"Acyclic colorings of graph subdivisions revisited","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Subdivision; Directed acyclic graph; Graph coloring; Complete coloring; Edge coloring; List coloring; Greedy coloring; Discrete mathematics; Graph; Graph power; Line graph","score_opus":0.026209169668095143,"score_gpt":0.32118895212746473,"score_spread":0.29497978245936957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063861912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39915752,0.0028547405,0.46864942,0.0045444327,0.0007066693,0.0001693719,0.0005544643,0.00063984696,0.12272354],"genre_scores_gemma":[0.8585276,0.001981871,0.108164385,0.0008647004,0.0005151742,0.00014409007,0.00057948835,0.0003638666,0.02885874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903786,0.00037547646,0.000049831764,0.00019233681,0.0001852531,0.00015931389],"domain_scores_gemma":[0.9912407,0.0050861523,0.0007899328,0.0013541023,0.0008521943,0.0006769182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013866198,0.00048500762,0.0008558725,0.0019620536,0.002147044,0.0030380604,0.0021075788,0.0014875273,0.010963082],"category_scores_gemma":[0.010411734,0.0010468184,0.0011883678,0.002953753,0.003025678,0.0038056676,0.001895302,0.0032859582,0.00068588543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003999106,0.000019954869,0.0005326404,0.00004260385,0.0000074198165,0.00005639794,0.00035530544,0.0038226834,0.00047585153,0.98263115,0.0018980986,0.010118092],"study_design_scores_gemma":[0.000020147747,0.0000128755855,0.00043880125,0.000027800417,0.000017016418,0.000090419344,0.00024944448,0.01785052,0.00027185926,0.97549635,0.0055148397,0.000009801545],"about_ca_topic_score_codex":0.0058754846,"about_ca_topic_score_gemma":0.006799306,"teacher_disagreement_score":0.010963082,"about_ca_system_score_codex":0.0016626725,"about_ca_system_score_gemma":0.0009662327,"threshold_uncertainty_score":0.036675155},"labels":[],"label_agreement":null},{"id":"W2064696340","doi":"10.1016/j.disc.2011.08.022","title":"List monopolar partitions of claw-free graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Graph; Discrete mathematics; Claw","score_opus":0.05239536688332093,"score_gpt":0.29177298737165336,"score_spread":0.23937762048833244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064696340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8305345,0.00059732585,0.08123893,0.0011687763,0.00019698034,0.00014548916,0.0014421062,0.00070688594,0.083969004],"genre_scores_gemma":[0.93542427,0.0003531513,0.023046285,0.0005939363,0.00015779435,0.00018569238,0.0025027555,0.000353345,0.03738278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993563,0.00012159176,0.000041942476,0.00011223179,0.0001565396,0.00021141545],"domain_scores_gemma":[0.9976826,0.0008948931,0.00031530453,0.00030480145,0.00033296476,0.0004693537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048156775,0.00052533066,0.00071543595,0.003245365,0.0032172196,0.0040764147,0.0017145926,0.0015994239,0.018428294],"category_scores_gemma":[0.0025355297,0.00066919863,0.0006202077,0.0023956513,0.0014951947,0.0035879146,0.0021028374,0.0014387416,0.0026551925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041830333,0.000097274904,0.00092980854,0.0001546275,0.000026882588,0.00028756942,0.0009634735,0.0023166935,0.008386013,0.9620272,0.0071375184,0.01725452],"study_design_scores_gemma":[0.000080577665,0.00005013804,0.0008608137,0.00004588577,0.00003386523,0.00023873738,0.000569757,0.008234857,0.0030304936,0.979882,0.0069385,0.00003437351],"about_ca_topic_score_codex":0.0010441273,"about_ca_topic_score_gemma":0.0025061546,"teacher_disagreement_score":0.018428294,"about_ca_system_score_codex":0.0010227789,"about_ca_system_score_gemma":0.0005471958,"threshold_uncertainty_score":0.061648786},"labels":[],"label_agreement":null},{"id":"W2064861714","doi":"10.1006/jctb.2002.2127","title":"A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Property (philosophy); Mathematics; Characterization (materials science); Minor (academic); Combinatorics; Flow (mathematics); Binary number; Graphic matroid; Set (abstract data type); Discrete mathematics; Computer science; Arithmetic; Law; Physics; Philosophy; Geometry","score_opus":0.01270040050646915,"score_gpt":0.22484422133202656,"score_spread":0.2121438208255574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064861714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023132375,0.032104935,0.6487492,0.050110567,0.02041369,0.0006284909,0.0036232937,0.0017924815,0.21944508],"genre_scores_gemma":[0.48361602,0.0338539,0.32386217,0.028758299,0.03568946,0.0019457121,0.0036084491,0.0016285819,0.08703745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882215,0.00022664429,0.000084613435,0.00031231958,0.0004026051,0.00015166341],"domain_scores_gemma":[0.9952702,0.0030469191,0.00029321545,0.00034621323,0.0007047745,0.0003387977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023756733,0.003099844,0.0017425158,0.002894933,0.0026721887,0.0036445374,0.002008576,0.002764091,0.018825356],"category_scores_gemma":[0.008997071,0.0012888495,0.0032556497,0.0045595495,0.004187659,0.008129329,0.0053269523,0.009428938,0.0037553937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019532687,0.00019602498,0.00059933093,0.0011698848,0.00014637974,0.00083427527,0.00040778663,0.0040232707,0.006060693,0.8596462,0.06363837,0.063082464],"study_design_scores_gemma":[0.00003467276,0.000090823545,0.0011689143,0.0001450938,0.000079571226,0.00043770394,0.00007847629,0.0036535596,0.0014458122,0.92349243,0.069309734,0.00006331042],"about_ca_topic_score_codex":0.00223486,"about_ca_topic_score_gemma":0.0020719345,"teacher_disagreement_score":0.018825356,"about_ca_system_score_codex":0.0024664092,"about_ca_system_score_gemma":0.0013172796,"threshold_uncertainty_score":0.062977076},"labels":[],"label_agreement":null},{"id":"W2065002346","doi":"10.1016/s0095-8956(02)00009-6","title":"Cliques in dense GF(q)-representable matroids","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Integer (computer science); Combinatorics; Finite field; Mathematics; Simple (philosophy); Minor (academic); GF(2); Discrete mathematics; Graphic matroid; Computer science; Humanities","score_opus":0.012786337624303767,"score_gpt":0.28651307951657945,"score_spread":0.2737267418922757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065002346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8566668,0.0005057147,0.099765256,0.0027714302,0.000097911216,0.00023526329,0.002055598,0.00073321623,0.037168782],"genre_scores_gemma":[0.95580137,0.0002739462,0.03327971,0.00028295885,0.00012727248,0.00016964445,0.0012756041,0.00010945259,0.008680099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999131,0.00021986006,0.000041980118,0.00019039027,0.000191769,0.00022509963],"domain_scores_gemma":[0.9953896,0.0027713592,0.0006721625,0.00047098324,0.00029731408,0.00039850257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066433277,0.0004936859,0.00084497884,0.0011864626,0.0019325424,0.003259638,0.0012118691,0.0012062599,0.0074609006],"category_scores_gemma":[0.0042362874,0.00086827425,0.0006189216,0.0023121256,0.0013473756,0.0034717906,0.0013461623,0.0019519848,0.0006660342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009555352,0.00053727545,0.0031517756,0.0003994823,0.00009034088,0.00080641406,0.0014728882,0.028086366,0.014980744,0.8892375,0.015035648,0.04524611],"study_design_scores_gemma":[0.00021727763,0.00007541007,0.0014517924,0.00004887761,0.000051357954,0.000426861,0.0003895254,0.07113823,0.0029900288,0.91732806,0.005853425,0.000029205588],"about_ca_topic_score_codex":0.0023929703,"about_ca_topic_score_gemma":0.004977686,"teacher_disagreement_score":0.0074609006,"about_ca_system_score_codex":0.0012866233,"about_ca_system_score_gemma":0.00083480583,"threshold_uncertainty_score":0.024959147},"labels":[],"label_agreement":null},{"id":"W2065074947","doi":"10.1016/j.dam.2005.02.013","title":"On uniform k-partition problems","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Partition (number theory); Cardinality (data modeling); Combinatorics; Partition problem; Discrete mathematics; Scheduling (production processes); Set (abstract data type); Mathematical optimization; Computer science; Data mining","score_opus":0.021193475896767008,"score_gpt":0.2787988693872797,"score_spread":0.2576053934905127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065074947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36808762,0.0068946066,0.40862894,0.015054123,0.0011101721,0.00029758507,0.0013563674,0.00046961207,0.19810104],"genre_scores_gemma":[0.86077297,0.005404207,0.05978722,0.0021184736,0.0014731255,0.00060123985,0.0022882568,0.00065355655,0.066900946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980926,0.00085063436,0.000073792056,0.0003352448,0.00031895973,0.00032875873],"domain_scores_gemma":[0.9898364,0.007619924,0.00063164433,0.0006544055,0.00043322388,0.0008245139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002432089,0.0017229108,0.002698072,0.002244296,0.0033542472,0.0057070465,0.0040579014,0.0036039352,0.022395825],"category_scores_gemma":[0.017514588,0.0013231542,0.0014335192,0.004701031,0.00530741,0.012386794,0.0064825667,0.0070100497,0.0018565773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025517406,0.00007388704,0.00038426134,0.00019502168,0.00002911511,0.00008160365,0.00029828885,0.0150321,0.000401209,0.9631488,0.007998566,0.012101877],"study_design_scores_gemma":[0.00004742714,0.000018817882,0.00023370607,0.000042971496,0.000013870303,0.000055986526,0.00012469839,0.025117597,0.0001615092,0.9721605,0.0020115438,0.0000114778495],"about_ca_topic_score_codex":0.001831722,"about_ca_topic_score_gemma":0.0016195764,"teacher_disagreement_score":0.022395825,"about_ca_system_score_codex":0.0026834207,"about_ca_system_score_gemma":0.0010403775,"threshold_uncertainty_score":0.07492149},"labels":[],"label_agreement":null},{"id":"W2065185671","doi":"10.1016/j.endm.2013.05.133","title":"On the approximability of two capacitated vehicle routing problems","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orienteering; Regret; Vehicle routing problem; Mathematics; Euclidean geometry; Mathematical optimization; Chen; Combinatorics; Euclidean distance; Approximation algorithm; Discrete mathematics; Computer science; Routing (electronic design automation)","score_opus":0.02151688624129685,"score_gpt":0.2811482681370374,"score_spread":0.2596313818957406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065185671","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4386121,0.0017150487,0.5198922,0.004421884,0.00032891144,0.00014967904,0.00041079285,0.00055337715,0.033916004],"genre_scores_gemma":[0.92682195,0.0005245568,0.06472361,0.00021294701,0.00015086401,0.00010213374,0.0004735831,0.00012466659,0.0068657165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977729,0.0008110972,0.000107860054,0.00043526775,0.00046472726,0.000408097],"domain_scores_gemma":[0.97343564,0.023197899,0.0008914292,0.0009201872,0.0008235139,0.00073122355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003520801,0.0014879275,0.001740547,0.0015508861,0.00088917004,0.0040126424,0.0029883517,0.0028906323,0.0071180547],"category_scores_gemma":[0.026166309,0.0006953355,0.0019063598,0.0016443126,0.0026550754,0.0045257714,0.0027103866,0.0051643006,0.00027342746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012374928,0.00035743095,0.002557919,0.00042255866,0.00014598238,0.00022465369,0.00054935936,0.63329583,0.001775921,0.32084206,0.0028084028,0.035782404],"study_design_scores_gemma":[0.000060898383,0.00007459739,0.0003626571,0.00002917175,0.00003701809,0.00005399853,0.000102550395,0.8363314,0.00046533864,0.16180955,0.0006565216,0.000016302576],"about_ca_topic_score_codex":0.0047787135,"about_ca_topic_score_gemma":0.0027808866,"teacher_disagreement_score":0.0071180547,"about_ca_system_score_codex":0.0037016158,"about_ca_system_score_gemma":0.0019962955,"threshold_uncertainty_score":0.026857197},"labels":[],"label_agreement":null},{"id":"W2065242306","doi":"10.1016/s0020-0190(01)00325-8","title":"A note on the Consecutive Ones Submatrix problem","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Permutation (music); Completeness (order theory); Row; Property (philosophy); Logical matrix; Column (typography); Existential quantification; Mathematics; Integer (computer science); Binary number; Matrix (chemical analysis); Row and column spaces; Discrete mathematics; Computer science; Arithmetic; Group (periodic table); Chemistry; Database; Programming language; Philosophy","score_opus":0.022599517655816973,"score_gpt":0.26169837773065996,"score_spread":0.239098860074843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065242306","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01994889,0.008294348,0.80017865,0.03872738,0.01817252,0.00029270165,0.0014794646,0.0007870437,0.112119004],"genre_scores_gemma":[0.18891263,0.013605672,0.65084267,0.014033111,0.028201906,0.0007620925,0.0039477893,0.0017681344,0.09792595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974017,0.00088669243,0.00015876656,0.0006190813,0.00067227945,0.00026157065],"domain_scores_gemma":[0.9902228,0.006364984,0.00033098646,0.001986915,0.00064880645,0.00044550395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027391333,0.0014197303,0.0019641726,0.0012436439,0.0028662018,0.003243991,0.0037426797,0.003364428,0.022781147],"category_scores_gemma":[0.014616989,0.0006348481,0.0016433422,0.0036991586,0.003384602,0.0097867455,0.005178334,0.010193161,0.0073305955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004008892,0.00023305936,0.00053167006,0.000735669,0.000077344004,0.0007397339,0.00026639158,0.014112633,0.002701612,0.6061083,0.18309082,0.19100188],"study_design_scores_gemma":[0.000053359698,0.00008510753,0.00021362655,0.0000807616,0.000018387636,0.0003880074,0.00010575301,0.017388001,0.0009651649,0.9359885,0.044667646,0.000045758294],"about_ca_topic_score_codex":0.0014265663,"about_ca_topic_score_gemma":0.0016653746,"teacher_disagreement_score":0.022781147,"about_ca_system_score_codex":0.0007060015,"about_ca_system_score_gemma":0.0015953575,"threshold_uncertainty_score":0.0762105},"labels":[],"label_agreement":null},{"id":"W2065255395","doi":"10.1016/j.disopt.2009.01.004","title":"On the feedback vertex set polytope of a series–parallel graph","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Chordal graph; Polytope; Pathwidth; Indifference graph; Feedback vertex set; Discrete mathematics; Subdivision; Graph; Line graph","score_opus":0.016480448800378945,"score_gpt":0.2701992797922433,"score_spread":0.2537188309918643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065255395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.347326,0.0009199039,0.57005715,0.0021097704,0.0002634404,0.00030220192,0.002033721,0.00047004735,0.076517746],"genre_scores_gemma":[0.8441724,0.0014119972,0.108877495,0.00039363655,0.00023801085,0.0006080429,0.0015912085,0.0003874477,0.04231974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999413,0.00016006496,0.00001441904,0.00013149556,0.00018501062,0.000096048636],"domain_scores_gemma":[0.9982838,0.00096016587,0.00025975917,0.00009142768,0.00014643873,0.00025833078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063384965,0.0014666609,0.0020364667,0.0013553868,0.0013249126,0.0021440724,0.0019626915,0.0018493694,0.016261961],"category_scores_gemma":[0.0030035349,0.0007766892,0.0009082391,0.0016330386,0.0019610436,0.0018832613,0.001577706,0.0021561761,0.001044888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018594672,0.00014910776,0.00046638216,0.00024997655,0.00004675616,0.00020572515,0.00012777944,0.65163857,0.0024216443,0.32391983,0.0064747594,0.014113444],"study_design_scores_gemma":[0.00005772416,0.00006758711,0.0003018497,0.00003850164,0.000013788421,0.00007948965,0.000072175644,0.7513703,0.00061437703,0.2452726,0.0020906136,0.000020925574],"about_ca_topic_score_codex":0.0060419613,"about_ca_topic_score_gemma":0.0047736955,"teacher_disagreement_score":0.016261961,"about_ca_system_score_codex":0.002272152,"about_ca_system_score_gemma":0.0011302367,"threshold_uncertainty_score":0.054401696},"labels":[],"label_agreement":null},{"id":"W2065396130","doi":"10.1016/j.disc.2012.05.023","title":"Obstructions to partitions of chordal graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chordal graph; Combinatorics; Discrete mathematics; Treewidth; Outerplanar graph; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.03427589843562042,"score_gpt":0.3221639786332235,"score_spread":0.2878880801976031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065396130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81369144,0.00082198984,0.08666907,0.002773781,0.00052500976,0.00012906324,0.0004802993,0.00046337224,0.094445944],"genre_scores_gemma":[0.9694392,0.0005166346,0.009912864,0.00029257024,0.00034428335,0.00010691742,0.000532873,0.00023399436,0.018620545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981981,0.00034818772,0.00008839394,0.0002590304,0.0005531549,0.00055311486],"domain_scores_gemma":[0.9943639,0.002739695,0.00071080576,0.0005686061,0.0002770833,0.0013398739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015571,0.0007359911,0.0012162003,0.0027443224,0.004365565,0.005467835,0.0018113529,0.0019465291,0.010242742],"category_scores_gemma":[0.0071746265,0.0010816776,0.0014576411,0.0021369339,0.005518889,0.0054839225,0.0074057407,0.00476811,0.0009781986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006876893,0.000027881726,0.0003562225,0.000032114294,0.0000075790417,0.00012918656,0.0005520985,0.0010678321,0.000671685,0.9941988,0.0009991465,0.0018886791],"study_design_scores_gemma":[0.000033768487,0.00001268137,0.00041749884,0.000013122709,0.000010854246,0.00009086641,0.0002846651,0.0026467377,0.00029426767,0.9936638,0.002519076,0.000012723067],"about_ca_topic_score_codex":0.0020967168,"about_ca_topic_score_gemma":0.003128078,"teacher_disagreement_score":0.010242742,"about_ca_system_score_codex":0.0020419932,"about_ca_system_score_gemma":0.0008123894,"threshold_uncertainty_score":0.03426534},"labels":[],"label_agreement":null},{"id":"W2065415255","doi":"10.1016/j.tcs.2014.06.014","title":"H-coloring degree-bounded (acyclic) digraphs","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bounded function; Degree (music); Homomorphism; Conjecture; Upper and lower bounds; Discrete mathematics; Time complexity; Physics","score_opus":0.024553383233821717,"score_gpt":0.2900484033323826,"score_spread":0.26549502009856085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065415255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49953592,0.00050436467,0.419744,0.0018703819,0.00022426459,0.00028676886,0.0058597196,0.0014219591,0.07055264],"genre_scores_gemma":[0.887519,0.00038785566,0.08833804,0.00057972287,0.000091392154,0.0001624201,0.0028671967,0.0001643928,0.019889995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942386,0.00013723363,0.000027844244,0.00016141936,0.00008854741,0.00016107368],"domain_scores_gemma":[0.99421704,0.0032666444,0.00034369863,0.0007494472,0.0006074347,0.00081574346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005289188,0.00052113633,0.0005243434,0.0007929923,0.0009808672,0.0016961019,0.0014184173,0.0007204586,0.010755712],"category_scores_gemma":[0.0032124615,0.0004672113,0.0004063228,0.0012372619,0.00077944,0.0015690178,0.0010577162,0.0011652408,0.0009824366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007956618,0.000402137,0.005764487,0.0005937913,0.00009585472,0.0008340302,0.00069946767,0.06913441,0.020511044,0.8047536,0.024619304,0.071796186],"study_design_scores_gemma":[0.00016430844,0.00011038577,0.0021131583,0.000058975016,0.00005815368,0.0005511241,0.00040766952,0.13031007,0.007979563,0.8433712,0.014835801,0.000039467508],"about_ca_topic_score_codex":0.0026639374,"about_ca_topic_score_gemma":0.0054734754,"teacher_disagreement_score":0.010755712,"about_ca_system_score_codex":0.0012071242,"about_ca_system_score_gemma":0.0009265291,"threshold_uncertainty_score":0.035981476},"labels":[],"label_agreement":null},{"id":"W2065521247","doi":"10.1016/j.ejc.2007.11.017","title":"Generalised dualities and maximal finite antichains in the homomorphism order of relational structures","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Homomorphism; Finitary; Digraph; Mathematics; Duality (order theory); Algebra homomorphism; Order (exchange); Discrete mathematics; Combinatorics; Partially ordered set; Treewidth; Pathwidth; Graph","score_opus":0.04494834000764881,"score_gpt":0.25531751028673677,"score_spread":0.21036917027908797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065521247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7798339,0.0011108827,0.14676069,0.0013941459,0.00020828473,0.00008216898,0.00046979068,0.0003534405,0.06978665],"genre_scores_gemma":[0.97039276,0.00021600813,0.021223307,0.00019577751,0.00011087771,0.00004542044,0.00026171582,0.00007488364,0.007479251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998027,0.0006141343,0.00017189074,0.0004769541,0.00036413153,0.00034578476],"domain_scores_gemma":[0.99492115,0.002422916,0.0005508221,0.0007218575,0.0006921384,0.0006910831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018838842,0.00044509344,0.0009518539,0.0021785456,0.0029160425,0.0063859667,0.0012427262,0.001392648,0.005125025],"category_scores_gemma":[0.004706882,0.0011665102,0.0012066339,0.001614903,0.0057759895,0.010717291,0.0031492964,0.00426912,0.00052342855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005243031,0.00002580741,0.00043365767,0.00002595595,0.000008411753,0.00009503215,0.00066597015,0.00021943916,0.0009328547,0.994873,0.00015122505,0.002516218],"study_design_scores_gemma":[0.0000195068,0.000015134357,0.0003324657,0.000015066285,0.000015793805,0.000111951435,0.00024919937,0.0011925781,0.0008535563,0.9959895,0.0011918123,0.000013447177],"about_ca_topic_score_codex":0.0016822458,"about_ca_topic_score_gemma":0.0031704186,"teacher_disagreement_score":0.0063859667,"about_ca_system_score_codex":0.0019304914,"about_ca_system_score_gemma":0.0008934486,"threshold_uncertainty_score":0.017144859},"labels":[],"label_agreement":null},{"id":"W2065561033","doi":"10.1016/j.camwa.2010.02.001","title":"Nordhaus–Gaddum relations for proximity and remoteness in graphs","year":2010,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015481601845962855,"score_gpt":0.27990784235674704,"score_spread":0.26442624051078417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065561033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2050911,0.00686814,0.6816292,0.005358236,0.0009952602,0.00024934905,0.0014152988,0.00047730023,0.09791616],"genre_scores_gemma":[0.803542,0.003226866,0.17065212,0.0014111552,0.0012772462,0.000411611,0.0009501084,0.00017073276,0.018358218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967804,0.000913092,0.00036553296,0.0010848179,0.00053324323,0.00032289152],"domain_scores_gemma":[0.99117565,0.005400658,0.00068988896,0.001390125,0.0007328064,0.0006107879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033988666,0.000985096,0.0024934844,0.008366944,0.006383616,0.004257636,0.0024753134,0.0032332833,0.0077592805],"category_scores_gemma":[0.011517341,0.0011759037,0.0025792292,0.0074781454,0.0078100776,0.017136298,0.0066555073,0.007424281,0.0012671448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021268708,0.000012713771,0.00019981503,0.000053696822,0.000009384664,0.0000640364,0.00047374764,0.0005206572,0.00023239352,0.99264246,0.00076022017,0.005009638],"study_design_scores_gemma":[0.000009173441,0.000015028633,0.00024534203,0.000030475696,0.000022446864,0.0001766241,0.00016368977,0.0023514298,0.00025204124,0.99261683,0.004097462,0.00001932326],"about_ca_topic_score_codex":0.001501627,"about_ca_topic_score_gemma":0.0014591848,"teacher_disagreement_score":0.008366944,"about_ca_system_score_codex":0.0017011039,"about_ca_system_score_gemma":0.00083156076,"threshold_uncertainty_score":0.025957346},"labels":[],"label_agreement":null},{"id":"W2065615449","doi":"10.1016/j.jctb.2010.10.004","title":"Twins of rayless graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Cograph; Induced subgraph isomorphism problem; Graph; Discrete mathematics; Chordal graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.010228694232689501,"score_gpt":0.2727172146198766,"score_spread":0.26248852038718706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065615449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8385702,0.0005256214,0.07185699,0.0008709862,0.00051156513,0.00008680784,0.00034013914,0.00027395197,0.08696383],"genre_scores_gemma":[0.94271904,0.00030378852,0.020413218,0.00030440016,0.00022862639,0.00006798216,0.00042628188,0.00023635644,0.03530039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995065,0.00012762524,0.000024739138,0.0001228851,0.00012333806,0.00009485643],"domain_scores_gemma":[0.9985475,0.00048062735,0.00022499241,0.00015773335,0.0002015819,0.00038762586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048151086,0.0005014275,0.0009862079,0.0020719543,0.0020848042,0.0029843014,0.001186758,0.0012479727,0.007226186],"category_scores_gemma":[0.0029609362,0.0007381229,0.000834473,0.00093719177,0.001864801,0.0028632542,0.0020887721,0.0022231943,0.0009284273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111916284,0.000027257454,0.0004904216,0.000024004796,0.00001094117,0.00016528847,0.00026473473,0.0004607963,0.0016763972,0.99279517,0.0010967996,0.002876232],"study_design_scores_gemma":[0.000036093403,0.00003297276,0.00048330147,0.000017746228,0.00002772687,0.00023624973,0.0003195319,0.003981889,0.0011265676,0.990522,0.0032011736,0.000014710835],"about_ca_topic_score_codex":0.00079304073,"about_ca_topic_score_gemma":0.0010138087,"teacher_disagreement_score":0.007226186,"about_ca_system_score_codex":0.000665103,"about_ca_system_score_gemma":0.00043850933,"threshold_uncertainty_score":0.024174035},"labels":[],"label_agreement":null},{"id":"W2066238480","doi":"10.1016/j.ejc.2009.09.003","title":"Homomorphisms of random paths","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; Nemzeti Kutatási és Technológiai Hivatal; National Science Foundation","keywords":"Homomorphism; Mathematics; Path (computing); Combinatorics; Core (optical fiber); Constraint (computer-aided design); Discrete mathematics; Constraint satisfaction problem; Algebra homomorphism; Computer science; Statistics","score_opus":0.015739098610519562,"score_gpt":0.25282456104128,"score_spread":0.23708546243076042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066238480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48207465,0.0010662331,0.3826166,0.0034369717,0.0006405838,0.0002763066,0.0008971949,0.0018079495,0.12718359],"genre_scores_gemma":[0.91411215,0.0006666692,0.031735446,0.00068896275,0.00048036384,0.0002816313,0.00070861407,0.0005530357,0.05077308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969631,0.00094504445,0.00015972556,0.00088548043,0.00061055477,0.00043613292],"domain_scores_gemma":[0.98955137,0.005999265,0.0009988648,0.0012092051,0.0007353794,0.0015059089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017903699,0.0008278023,0.0011036667,0.0033238588,0.0024837435,0.0042832186,0.0019076666,0.0016846114,0.013689537],"category_scores_gemma":[0.011778292,0.001048317,0.0017273938,0.0019942997,0.0029492767,0.009066451,0.005171488,0.003913232,0.0017509226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060397953,0.000036245012,0.00024165887,0.000029649735,0.000012032863,0.0000921247,0.0002923434,0.00057146646,0.00055449817,0.9928479,0.0006874406,0.004574222],"study_design_scores_gemma":[0.0000328601,0.000027247077,0.00023796382,0.000012831853,0.000020197951,0.0002902557,0.000110173474,0.0046381536,0.0007242873,0.9909815,0.0029051243,0.0000193512],"about_ca_topic_score_codex":0.0005916784,"about_ca_topic_score_gemma":0.00035846603,"teacher_disagreement_score":0.013689537,"about_ca_system_score_codex":0.001495884,"about_ca_system_score_gemma":0.0007283915,"threshold_uncertainty_score":0.045796096},"labels":[],"label_agreement":null},{"id":"W2066380283","doi":"10.1016/s0012-365x(99)00354-4","title":"Embedding trees into graphs of large girth","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Conjecture; Embedding; Discrete mathematics; Graph; Tree (set theory); Degree (music); Computer science","score_opus":0.015694521293340452,"score_gpt":0.3198006587394579,"score_spread":0.3041061374461175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066380283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5359748,0.0015918562,0.43150774,0.0017389206,0.00024196997,0.000099650075,0.00051979447,0.0011362584,0.027189018],"genre_scores_gemma":[0.8803445,0.0018125159,0.10182192,0.00042048132,0.00023362233,0.00011267692,0.0005960535,0.00074566546,0.013912641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996357,0.00011104376,0.000016760223,0.00009558311,0.00008745766,0.000053369746],"domain_scores_gemma":[0.9962452,0.0022914421,0.0004084421,0.00049034227,0.00022074117,0.00034382122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032941575,0.00060830376,0.0005635668,0.0013321013,0.00060699374,0.001870376,0.00083780417,0.0011165214,0.004964016],"category_scores_gemma":[0.0041760723,0.00090257224,0.00047614676,0.0014746962,0.0012391489,0.0045233658,0.0024269419,0.0025242404,0.001071936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020082157,0.00009851342,0.0012861304,0.00025226988,0.000033949193,0.00029578654,0.0010427203,0.021833638,0.018182624,0.9008542,0.004363295,0.051556163],"study_design_scores_gemma":[0.000019637975,0.000045894965,0.0005839055,0.000030483725,0.000025746953,0.00023851029,0.00019178608,0.031548463,0.002779356,0.95864666,0.0058759316,0.000013581426],"about_ca_topic_score_codex":0.00023192202,"about_ca_topic_score_gemma":0.00052490423,"teacher_disagreement_score":0.004964016,"about_ca_system_score_codex":0.00043132302,"about_ca_system_score_gemma":0.00021749485,"threshold_uncertainty_score":0.01660633},"labels":[],"label_agreement":null},{"id":"W2066393114","doi":"10.1016/j.disc.2011.02.022","title":"Structure of 4-connected claw-free graphs not containing a subdivision of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subdivision; Mathematics; Scroll; Combinatorics; Discrete mathematics","score_opus":0.025372589599595936,"score_gpt":0.25995595225731705,"score_spread":0.23458336265772112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066393114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84444064,0.00042589064,0.05361523,0.0008481996,0.00010765655,0.00018651407,0.0036790075,0.0008598215,0.095837034],"genre_scores_gemma":[0.9276076,0.00019955389,0.021532843,0.00028231714,0.000046182835,0.00016603454,0.008622447,0.00021282509,0.04133017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997836,0.000031811906,0.000016592363,0.00006445226,0.00004832175,0.00005536118],"domain_scores_gemma":[0.9984921,0.00042037337,0.00035191642,0.00021398097,0.00026423653,0.00025730958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018763651,0.0005157435,0.0003843463,0.0019452575,0.0014797265,0.0015493222,0.001386058,0.0010744971,0.021388117],"category_scores_gemma":[0.0011557819,0.00048234966,0.0005073923,0.0013123194,0.0012846023,0.0016748266,0.0013192985,0.0010000966,0.00320166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063181913,0.00016596689,0.0038372546,0.00033203114,0.00005842444,0.0015784238,0.0017678908,0.007926628,0.018882625,0.9210498,0.013557572,0.030211518],"study_design_scores_gemma":[0.00013956668,0.00012312712,0.0065283147,0.0001112974,0.000074705655,0.0009766992,0.0008507847,0.020064844,0.009737444,0.9353423,0.025988206,0.00006269584],"about_ca_topic_score_codex":0.0024966826,"about_ca_topic_score_gemma":0.0032022733,"teacher_disagreement_score":0.021388117,"about_ca_system_score_codex":0.0007718987,"about_ca_system_score_gemma":0.00063499756,"threshold_uncertainty_score":0.07155037},"labels":[],"label_agreement":null},{"id":"W2066414833","doi":"10.1016/j.dam.2014.01.024","title":"Brushing without capacity restrictions","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Memorial University of Newfoundland; Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Traverse; Graph; Mathematics; Vertex (graph theory); Brush; Cartesian product; Combinatorics","score_opus":0.030951904321558123,"score_gpt":0.28422814721289763,"score_spread":0.2532762428913395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066414833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04989829,0.0007054133,0.6612274,0.0009003867,0.0012708894,0.00025197928,0.0010354487,0.0044983677,0.28021184],"genre_scores_gemma":[0.5041919,0.0010199966,0.18119198,0.0007432639,0.00039138208,0.00043200748,0.0017098224,0.0038462717,0.30647343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991999,0.000060734357,0.00004309472,0.00027135923,0.00026643343,0.00015837092],"domain_scores_gemma":[0.9982973,0.0003101809,0.000069519505,0.000811067,0.0002911258,0.00022090664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039433138,0.0011843324,0.0013085945,0.0013515186,0.0017035445,0.002448216,0.0017451023,0.0015614801,0.08316367],"category_scores_gemma":[0.0037934065,0.00071340223,0.0009194603,0.0011149202,0.0014254337,0.004877053,0.0039707324,0.0026371465,0.013464342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042296379,0.00020908353,0.00032684932,0.0004548818,0.000036676847,0.00032268994,0.00030912276,0.015031668,0.050667696,0.6524709,0.0258733,0.25387418],"study_design_scores_gemma":[0.000065737244,0.00014249464,0.00039562484,0.00013257474,0.000034060187,0.00033454562,0.00027184328,0.091087095,0.028603664,0.78136355,0.09750917,0.0000596431],"about_ca_topic_score_codex":0.0010802632,"about_ca_topic_score_gemma":0.0015176269,"teacher_disagreement_score":0.08316367,"about_ca_system_score_codex":0.0005211048,"about_ca_system_score_gemma":0.0005263165,"threshold_uncertainty_score":0.27821022},"labels":[],"label_agreement":null},{"id":"W2066530434","doi":"10.1016/j.endm.2007.07.020","title":"Graph coloring with no large monochromatic components","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Graph; Graph coloring; Discrete mathematics; Physics; Optics","score_opus":0.015671258234954296,"score_gpt":0.28858253892977803,"score_spread":0.27291128069482373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066530434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49949607,0.0010654964,0.346234,0.0032383504,0.0008922253,0.00058281166,0.002690968,0.00269546,0.14310451],"genre_scores_gemma":[0.7745077,0.00055956433,0.18618272,0.00095822103,0.0002138861,0.00038283106,0.0016344906,0.0008080885,0.034752477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899596,0.00021794825,0.000051510036,0.00030920614,0.000190776,0.00023452693],"domain_scores_gemma":[0.99463767,0.0021459442,0.00042321483,0.0017008494,0.0005157806,0.0005765693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006063895,0.0010372007,0.0014853942,0.00095212914,0.002380171,0.0024787288,0.0020908674,0.0013581165,0.015174577],"category_scores_gemma":[0.004173,0.0010930654,0.0007612594,0.0016821224,0.0012272473,0.003338487,0.0018766847,0.002130643,0.0021329436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020854692,0.00043463975,0.0029692154,0.0013642684,0.00017830096,0.001223889,0.0006622824,0.027304728,0.04770365,0.7464188,0.046255052,0.12339966],"study_design_scores_gemma":[0.0003580425,0.00015745257,0.0018364437,0.00007109231,0.00012136038,0.0010703646,0.00030838334,0.06649378,0.016326776,0.8944452,0.018746875,0.000064195694],"about_ca_topic_score_codex":0.0018519782,"about_ca_topic_score_gemma":0.0040403814,"teacher_disagreement_score":0.015174577,"about_ca_system_score_codex":0.0013174772,"about_ca_system_score_gemma":0.0011854436,"threshold_uncertainty_score":0.050763965},"labels":[],"label_agreement":null},{"id":"W2066586325","doi":"10.1016/j.disc.2007.03.083","title":"The structure of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si23.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-subdivision-free toroidal graphs","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Vertex (graph theory); Toroid; Torus; Discrete mathematics; Graph; Geometry; Physics","score_opus":0.016993430092239498,"score_gpt":0.25766892586190454,"score_spread":0.24067549576966504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066586325","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037613357,0.00064247503,0.2039901,0.0064288084,0.003904056,0.00045201957,0.1569883,0.06149169,0.5623413],"genre_scores_gemma":[0.043333445,0.0020493236,0.113015175,0.0024617084,0.0014639571,0.00079128845,0.23745102,0.053515516,0.5459186],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995565,0.00007787448,0.000052482028,0.00009943223,0.00014884243,0.00006498737],"domain_scores_gemma":[0.9974911,0.0007268201,0.00015971267,0.0006349633,0.00078904757,0.00019829077],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006792442,0.00094905525,0.00096259906,0.0023888166,0.0012987062,0.004560465,0.001925454,0.0012939582,0.44102642],"category_scores_gemma":[0.004632736,0.0009320355,0.00069238525,0.0049192486,0.000816372,0.005396427,0.0017855936,0.002694737,0.29401326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011209615,0.000061336454,0.00020577938,0.00030369038,0.000008186411,0.000086035914,0.0002691089,0.00066477223,0.0021510099,0.107702665,0.831451,0.056984406],"study_design_scores_gemma":[0.000033077402,0.000016034222,0.00042764333,0.00006526157,0.00000654625,0.0001173179,0.000082114595,0.0018312209,0.0025194313,0.04117373,0.9536897,0.0000379624],"about_ca_topic_score_codex":0.007948583,"about_ca_topic_score_gemma":0.006364421,"teacher_disagreement_score":0.44102642,"about_ca_system_score_codex":0.0020301214,"about_ca_system_score_gemma":0.0019395365,"threshold_uncertainty_score":0.79730797},"labels":[],"label_agreement":null},{"id":"W2066666508","doi":"10.1016/j.ejc.2011.09.004","title":"Polynomial treewidth forces a large grid-like-minor","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Australian Research Council","keywords":"Treewidth; Combinatorics; Mathematics; Partial k-tree; Minor (academic); Graph minor; Tree-depth; Tree decomposition; 1-planar graph; Discrete mathematics; Graph; Clique-sum; Pathwidth; Chordal graph; Line graph; Graph power","score_opus":0.032144537609966384,"score_gpt":0.25239588175131195,"score_spread":0.22025134414134556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066666508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5682385,0.00023810288,0.30660573,0.008499104,0.0010567943,0.00033017376,0.0014042036,0.0035298779,0.11009744],"genre_scores_gemma":[0.91217357,0.00011091736,0.058033,0.00088910374,0.00020624833,0.00012636815,0.0007076004,0.0009868502,0.02676632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991775,0.00011033211,0.00003705926,0.00022241918,0.00019362464,0.00025894993],"domain_scores_gemma":[0.9962559,0.0017764082,0.00024596218,0.00076736405,0.00033490133,0.0006194614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064265303,0.00061392196,0.001231688,0.00042843382,0.0021041748,0.002150585,0.0017464177,0.0019905241,0.026573136],"category_scores_gemma":[0.005653868,0.00080068386,0.0012470465,0.0006178121,0.001525487,0.0038725298,0.0031529013,0.0031538773,0.0032324507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008682834,0.00027676017,0.00195823,0.00033951655,0.0000539269,0.0010376795,0.00072977884,0.010220454,0.03141451,0.8935058,0.037995182,0.021600002],"study_design_scores_gemma":[0.0002973296,0.000119131684,0.0007326514,0.000020912918,0.000038222228,0.00097281416,0.00035386923,0.0451258,0.0065536555,0.929687,0.016064169,0.00003432943],"about_ca_topic_score_codex":0.0012799345,"about_ca_topic_score_gemma":0.002543191,"teacher_disagreement_score":0.026573136,"about_ca_system_score_codex":0.00083300413,"about_ca_system_score_gemma":0.00082342804,"threshold_uncertainty_score":0.088896036},"labels":[],"label_agreement":null},{"id":"W2066869105","doi":"10.1016/j.disc.2010.03.013","title":"Ultracritical and hypercritical binary structures","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Vertex (graph theory); Binary number; Discrete mathematics; Arithmetic; Graph","score_opus":0.016442633351885966,"score_gpt":0.31152094399518226,"score_spread":0.2950783106432963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066869105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74353206,0.0018604259,0.0542278,0.00519239,0.00042884084,0.000069200905,0.00039151125,0.00023415811,0.1940637],"genre_scores_gemma":[0.9792813,0.00048446617,0.0049723675,0.0004999325,0.00044227662,0.000055109576,0.00020423035,0.000057005484,0.014003222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954885,0.0001006977,0.00001662052,0.00006723682,0.00014899965,0.00011764203],"domain_scores_gemma":[0.99709237,0.0012864098,0.00038861038,0.0002279243,0.00043463483,0.00056999916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064814964,0.00041088986,0.0006078708,0.0033047807,0.0029075146,0.003612713,0.00097319647,0.001349072,0.007981143],"category_scores_gemma":[0.0062374747,0.00046237386,0.00032801463,0.0013211922,0.003937907,0.003761059,0.0021617778,0.0029267084,0.0004927675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019683157,0.000008616116,0.00017027103,0.000010435149,0.0000015108787,0.000028072289,0.000099444456,0.00021733803,0.0002059816,0.9976478,0.0006811724,0.00090966624],"study_design_scores_gemma":[0.000008518534,0.0000034698483,0.00022113787,0.0000075854396,0.0000025441404,0.000051158207,0.000087210974,0.0020262941,0.00018092865,0.9965005,0.0009059037,0.0000046883197],"about_ca_topic_score_codex":0.001513764,"about_ca_topic_score_gemma":0.0018707213,"teacher_disagreement_score":0.007981143,"about_ca_system_score_codex":0.0015434861,"about_ca_system_score_gemma":0.00076582225,"threshold_uncertainty_score":0.026699603},"labels":[],"label_agreement":null},{"id":"W2066946142","doi":"10.1016/j.dam.2007.02.006","title":"Lower bounds on the pathwidth of some grid-like graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Victoria","funders":"","keywords":"Mathematics; Pathwidth; Combinatorics; Upper and lower bounds; Vertex (graph theory); Chordal graph; Mathematical proof; Discrete mathematics; Matching (statistics); Grid; Graph; Line graph; Statistics","score_opus":0.02064470322813984,"score_gpt":0.27836073905114567,"score_spread":0.25771603582300584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066946142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5427961,0.009254667,0.35284877,0.010240747,0.00041066666,0.00016860518,0.004290728,0.0016550791,0.07833462],"genre_scores_gemma":[0.869776,0.0052767457,0.1088758,0.0014383316,0.0005992354,0.0003090191,0.003350804,0.0008092537,0.009564899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998659,0.00033732166,0.000056825076,0.00028481174,0.00036051817,0.00030157375],"domain_scores_gemma":[0.9756874,0.019274864,0.0013387123,0.0016217384,0.0008363876,0.0012408606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020249055,0.0017419683,0.0015743162,0.002993764,0.0016968942,0.0035423336,0.004112524,0.0017934198,0.009138953],"category_scores_gemma":[0.015746057,0.0011278264,0.0012657185,0.0038933686,0.0024961326,0.007031804,0.00285475,0.005367833,0.0010160988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019101738,0.00044044602,0.008649021,0.0014306596,0.00035010302,0.00054255046,0.0012047247,0.21612135,0.022458918,0.6364169,0.03124342,0.079231784],"study_design_scores_gemma":[0.00011681808,0.00013553035,0.0023560012,0.00012640543,0.00013068403,0.0005663418,0.00032691326,0.24830729,0.003765953,0.7363285,0.0077927983,0.00004678652],"about_ca_topic_score_codex":0.0016680238,"about_ca_topic_score_gemma":0.0027196866,"teacher_disagreement_score":0.009138953,"about_ca_system_score_codex":0.002459621,"about_ca_system_score_gemma":0.0009537765,"threshold_uncertainty_score":0.030572832},"labels":[],"label_agreement":null},{"id":"W2067092314","doi":"10.2478/spma-2014-0004","title":"On the Relationships between Zero Forcing Numbers and Certain Graph Coverings","year":2014,"lang":"en","type":"article","venue":"Special Matrices","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Cubic graph; Line graph; Voltage graph; Butterfly graph; Upper and lower bounds; Mathematical analysis","score_opus":0.02862864413862354,"score_gpt":0.2698224245484369,"score_spread":0.24119378040981337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067092314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83346784,0.00027996444,0.13560033,0.0005131636,0.00006037525,0.000042988468,0.00019742266,0.00020871944,0.02962917],"genre_scores_gemma":[0.985036,0.00014016268,0.012793274,0.00007620562,0.00005758071,0.000033644876,0.00011460392,0.000047114387,0.0017015212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992161,0.0001819068,0.00004784105,0.00017365698,0.00021831042,0.00016206782],"domain_scores_gemma":[0.9885435,0.008333103,0.0012106913,0.00065659545,0.0005310577,0.0007251202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011133399,0.00042349176,0.00046420973,0.0020440044,0.0011120712,0.0017995199,0.0006901224,0.0007460635,0.004692959],"category_scores_gemma":[0.0084366705,0.00035948842,0.00039051933,0.0010474385,0.0035502817,0.0029650792,0.0013546196,0.0010962423,0.0003753461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011244816,0.000031037613,0.0019944957,0.00005927857,0.0000092593045,0.00016674992,0.00030943612,0.011130421,0.006858617,0.96975595,0.00079793745,0.00877456],"study_design_scores_gemma":[0.000018149487,0.00006388278,0.001300628,0.00002802407,0.000010147207,0.0003239922,0.00014560932,0.03938442,0.004045307,0.9527772,0.0018724792,0.000030071978],"about_ca_topic_score_codex":0.0006982264,"about_ca_topic_score_gemma":0.0009002519,"teacher_disagreement_score":0.004692959,"about_ca_system_score_codex":0.001203306,"about_ca_system_score_gemma":0.00040792546,"threshold_uncertainty_score":0.015699565},"labels":[],"label_agreement":null},{"id":"W2067133893","doi":"10.1016/j.disc.2004.03.020","title":"Minimum chromaticity of circulant graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Circulant matrix; Combinatorics; Mathematics; Circulant graph; Chromaticity; Chromatic scale; Discrete mathematics; Graph; Graph power; Line graph; Computer science; Artificial intelligence","score_opus":0.02417981242639211,"score_gpt":0.2962456602513835,"score_spread":0.2720658478249914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067133893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8988854,0.0005311732,0.050236616,0.0019309503,0.00012077748,0.00008184373,0.0012397224,0.00040428742,0.046569224],"genre_scores_gemma":[0.9637596,0.00045258005,0.025166754,0.00034582298,0.00017635178,0.00011756696,0.0012666138,0.00029208703,0.008422666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989792,0.0002360137,0.00003593842,0.0002812441,0.00020831474,0.0002593587],"domain_scores_gemma":[0.991197,0.004709988,0.0009841002,0.0008368541,0.0010242795,0.0012476977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093151565,0.00085823186,0.0012830268,0.0024920532,0.003269304,0.005453248,0.0023682422,0.0019204646,0.010349962],"category_scores_gemma":[0.0073823067,0.0011472163,0.00069350173,0.0026734052,0.0026965416,0.0033658368,0.0014567703,0.0025299704,0.00077817315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009179665,0.00021640502,0.004442289,0.0004442655,0.00007400416,0.00023244739,0.0010994147,0.024927713,0.025587054,0.9054012,0.013573629,0.023083508],"study_design_scores_gemma":[0.0002102396,0.00009396266,0.0034596748,0.000077818186,0.000070410766,0.00028638757,0.0004748679,0.061404016,0.006376379,0.92227745,0.0052092075,0.00005946095],"about_ca_topic_score_codex":0.004805438,"about_ca_topic_score_gemma":0.009477817,"teacher_disagreement_score":0.010349962,"about_ca_system_score_codex":0.0032492094,"about_ca_system_score_gemma":0.0016633414,"threshold_uncertainty_score":0.03462404},"labels":[],"label_agreement":null},{"id":"W206723634","doi":"10.1007/0-387-22444-0_1","title":"The Matching Lattice","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Lattice (music); Matching (statistics); Statistical physics; Computer science; Mathematics; Physics; Statistics","score_opus":0.029548271597124504,"score_gpt":0.2875761927472078,"score_spread":0.25802792115008333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206723634","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003941194,0.00661115,0.047474258,0.0028703464,0.0008123373,0.000043574808,0.00025511294,0.00032295214,0.9376691],"genre_scores_gemma":[0.2600108,0.012150177,0.072418034,0.0022752162,0.002260592,0.00029666064,0.0012085598,0.00072950294,0.64865035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942744,0.00015253914,0.000025028012,0.00013753034,0.00019701457,0.000060409817],"domain_scores_gemma":[0.99966085,0.000102066995,0.000022668504,0.000107945074,0.00006208348,0.000044458942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005061354,0.0006510674,0.0008050473,0.001540625,0.0023874957,0.0052372767,0.0010516034,0.0010875356,0.028637392],"category_scores_gemma":[0.0017777347,0.00059592683,0.0005833716,0.002651183,0.004213853,0.008041829,0.0017291114,0.0030578137,0.009306442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064140545,0.000006662327,0.000016070246,0.000017054432,0.0000015373909,0.000010522695,0.00006311829,0.00020149544,0.00007938672,0.9761933,0.010856059,0.012548382],"study_design_scores_gemma":[0.0000037256013,0.0000028427503,0.000017453776,0.000015876196,0.0000016029221,0.000030482832,0.000041942127,0.00046684343,0.00008990036,0.9196851,0.07964134,0.000002900049],"about_ca_topic_score_codex":0.001964927,"about_ca_topic_score_gemma":0.0017672015,"teacher_disagreement_score":0.028637392,"about_ca_system_score_codex":0.002599057,"about_ca_system_score_gemma":0.0014830098,"threshold_uncertainty_score":0.09580159},"labels":[],"label_agreement":null},{"id":"W2067309928","doi":"10.1016/j.jctb.2003.12.005","title":"Inequivalent representations of matroids having no U3,6-minor","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Minor (academic); Combinatorics; Prime (order theory); Prime power; Graphic matroid; Discrete mathematics; Humanities","score_opus":0.015323233040096635,"score_gpt":0.29648798703544577,"score_spread":0.2811647539953491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067309928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88431877,0.00027892887,0.027347995,0.0014538573,0.00043577986,0.0000778377,0.00044916428,0.0003133962,0.08532423],"genre_scores_gemma":[0.9624426,0.00022519329,0.013215108,0.0005224952,0.0003025995,0.000085585394,0.0008503806,0.00023588554,0.022120284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888915,0.00022583395,0.000085952575,0.00020679644,0.00024693474,0.0003453265],"domain_scores_gemma":[0.9984169,0.0005233949,0.00026647002,0.00020225393,0.00018504562,0.00040591255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008190703,0.0010775097,0.00090241834,0.0017813329,0.002578665,0.005965164,0.0017686137,0.0025857834,0.015970232],"category_scores_gemma":[0.0023192689,0.0007663158,0.0011982973,0.0014686448,0.0022116664,0.004364715,0.0022693023,0.003297789,0.0016865723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031032332,0.00016524729,0.0005387268,0.000050919283,0.000014404857,0.00040360645,0.00078933575,0.0009315202,0.0058119465,0.97789985,0.003188092,0.009895934],"study_design_scores_gemma":[0.0001083906,0.000090285714,0.0008285451,0.000028747698,0.000029510455,0.0005500276,0.00064387673,0.007914139,0.0019309561,0.98364455,0.004192252,0.000038767164],"about_ca_topic_score_codex":0.00049692043,"about_ca_topic_score_gemma":0.00085795793,"teacher_disagreement_score":0.015970232,"about_ca_system_score_codex":0.0014256279,"about_ca_system_score_gemma":0.0005232542,"threshold_uncertainty_score":0.05342573},"labels":[],"label_agreement":null},{"id":"W2067443412","doi":"10.1016/j.disc.2008.03.009","title":"Vertex arboricity of integer distance graph <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2008,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Arboricity; Combinatorics; Vertex (graph theory); Mathematics; Graph; Integer (computer science); Discrete mathematics; Planar graph; Computer science","score_opus":0.021571592716490357,"score_gpt":0.2563671469383798,"score_spread":0.23479555422188944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067443412","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7492185,0.0005248546,0.11210903,0.0015192849,0.00012969776,0.00008147842,0.0040959576,0.0004988439,0.13182226],"genre_scores_gemma":[0.9562489,0.0004439052,0.022657791,0.00016999537,0.00008404305,0.00007246145,0.0029299117,0.00011768612,0.017275462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966705,0.00006113883,0.000018075674,0.00009852747,0.0000814975,0.000073658666],"domain_scores_gemma":[0.99805695,0.0008988536,0.00037150658,0.00014840768,0.00028318795,0.00024109261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023894166,0.0003147457,0.0002979539,0.0011979241,0.00084185984,0.001670216,0.00053824874,0.00042611116,0.010323202],"category_scores_gemma":[0.0023648601,0.00018884895,0.00025018104,0.0013393046,0.0006646807,0.0013929523,0.00054873206,0.0006725079,0.0014915932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062119064,0.00010113163,0.00943025,0.00039570927,0.000040196355,0.001025674,0.0007517339,0.024864279,0.009618914,0.87137043,0.020380925,0.06139952],"study_design_scores_gemma":[0.000083871055,0.00013864152,0.006112521,0.0000740956,0.00005385252,0.0014099568,0.0005959456,0.083166756,0.007449209,0.8760047,0.024872258,0.000038101196],"about_ca_topic_score_codex":0.0019403842,"about_ca_topic_score_gemma":0.001961414,"teacher_disagreement_score":0.010323202,"about_ca_system_score_codex":0.0007939583,"about_ca_system_score_gemma":0.00038380624,"threshold_uncertainty_score":0.034534514},"labels":[],"label_agreement":null},{"id":"W2067475075","doi":"10.1016/j.dam.2011.03.020","title":"Polynomial-time recognition of clique-width ≤3 graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Treewidth; Combinatorics; Mathematics; Clique-sum; Chordal graph; Bounded function; Discrete mathematics; Clique-width; Partial k-tree; 1-planar graph; Pathwidth; Graph; Line graph","score_opus":0.039311531153480864,"score_gpt":0.26537067493229455,"score_spread":0.2260591437788137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067475075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7125812,0.0007024782,0.25541368,0.0017534677,0.00017411789,0.0003357771,0.0050836178,0.0065696426,0.017386017],"genre_scores_gemma":[0.83529526,0.00025863445,0.14522113,0.00032730238,0.000086212014,0.00013016458,0.010754126,0.0008012301,0.0071260193],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991528,0.00010303845,0.000054841228,0.00030543117,0.0001446851,0.00023924417],"domain_scores_gemma":[0.99708754,0.0013243463,0.0003374282,0.00074474944,0.00028168174,0.00022428326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003969487,0.0007650936,0.0010651138,0.0006463062,0.0010106845,0.0025461523,0.001953533,0.0013070643,0.01061054],"category_scores_gemma":[0.0032629536,0.0005857914,0.0017424345,0.0013196013,0.00050940603,0.0037800882,0.0013925981,0.0014708204,0.0022615583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004185727,0.0011920047,0.02585453,0.001376743,0.00038092182,0.0011014537,0.001111743,0.12486937,0.20835173,0.072800286,0.0596428,0.49913266],"study_design_scores_gemma":[0.00028386322,0.00026308533,0.012290675,0.000069679474,0.0001251973,0.0008724753,0.0007542781,0.6933016,0.08306341,0.19103317,0.017843533,0.00009897435],"about_ca_topic_score_codex":0.0051247356,"about_ca_topic_score_gemma":0.010598948,"teacher_disagreement_score":0.01061054,"about_ca_system_score_codex":0.0011910904,"about_ca_system_score_gemma":0.0013440077,"threshold_uncertainty_score":0.035495818},"labels":[],"label_agreement":null},{"id":"W2067491157","doi":"10.1016/s0020-0190(02)00478-7","title":"On the complexity of digraph packings","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Computer science; Combinatorics; Theoretical computer science; Mathematics","score_opus":0.03886923167219776,"score_gpt":0.2733865819034409,"score_spread":0.23451735023124315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067491157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72979033,0.0036647613,0.16164887,0.010367946,0.0005435913,0.00027757147,0.0049904957,0.0011029349,0.08761344],"genre_scores_gemma":[0.914411,0.0029397376,0.059068285,0.0006508891,0.00061140774,0.0002240374,0.0043654917,0.0005840228,0.017145032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971834,0.0007059081,0.00020066231,0.00040760764,0.00093618507,0.00056634285],"domain_scores_gemma":[0.9624023,0.03013725,0.0020443934,0.0027984458,0.0011334182,0.0014842716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016956563,0.0012889619,0.0024781453,0.002931605,0.002349973,0.008083901,0.0030510894,0.0029825468,0.022064045],"category_scores_gemma":[0.02649535,0.001492293,0.0017431786,0.0058776657,0.0029198783,0.015587012,0.0045364546,0.00427413,0.0017835771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001152253,0.0005334754,0.007363934,0.0008583978,0.00014870016,0.00053583365,0.001094824,0.22608331,0.0032494173,0.6251023,0.036074333,0.0978033],"study_design_scores_gemma":[0.000083389066,0.00006434719,0.0010386191,0.000051680363,0.000048254115,0.00026410163,0.00026675724,0.21460697,0.00083747675,0.7791457,0.0035563072,0.000036365804],"about_ca_topic_score_codex":0.0033625867,"about_ca_topic_score_gemma":0.0039865086,"teacher_disagreement_score":0.022064045,"about_ca_system_score_codex":0.0034817464,"about_ca_system_score_gemma":0.0016811186,"threshold_uncertainty_score":0.07381165},"labels":[],"label_agreement":null},{"id":"W2067731498","doi":"10.1016/s0166-218x(02)00415-8","title":"Stability number of bull- and chair-free graphs revisited","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Independent set; Chordal graph; Clique; Graph; Split graph; Discrete mathematics; Bounded function; 1-planar graph","score_opus":0.020516878573116577,"score_gpt":0.2839838116839609,"score_spread":0.26346693311084435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067731498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86525357,0.0014347788,0.05880214,0.0052024913,0.00027610373,0.000070060996,0.0010605215,0.0004962086,0.06740413],"genre_scores_gemma":[0.9872765,0.00033419312,0.0043337643,0.0002071834,0.00017781212,0.000053951335,0.00030878303,0.00007860511,0.00722926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934095,0.00016589755,0.000021291402,0.00019438184,0.00014720068,0.00013015266],"domain_scores_gemma":[0.99290186,0.0038623884,0.00080666196,0.00056976185,0.00072094426,0.0011383354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012545807,0.00046209345,0.0009695765,0.0023905546,0.0028555968,0.0029431833,0.0026733063,0.0016461672,0.014105568],"category_scores_gemma":[0.008719401,0.00057682913,0.0006137962,0.001740958,0.0020642783,0.004639225,0.0012629379,0.0019344764,0.0010222183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030815948,0.00006259911,0.0023333284,0.00014678623,0.00004222777,0.00008410258,0.00059973914,0.00907542,0.0043204,0.96430814,0.008446678,0.010272356],"study_design_scores_gemma":[0.00007915652,0.000060886487,0.0024886192,0.00003213012,0.000058012803,0.00015648318,0.00041115805,0.07755341,0.0041493964,0.91233903,0.0026350652,0.00003657782],"about_ca_topic_score_codex":0.0023098763,"about_ca_topic_score_gemma":0.002201133,"teacher_disagreement_score":0.014105568,"about_ca_system_score_codex":0.0017098531,"about_ca_system_score_gemma":0.0011132382,"threshold_uncertainty_score":0.047187805},"labels":[],"label_agreement":null},{"id":"W2068571612","doi":"10.1007/s00039-007-0599-6","title":"Szemerédi’s Lemma for the Analyst","year":2007,"lang":"hu","type":"article","venue":"Geometric and Functional Analysis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":229,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lemma (botany); Mathematics; Combinatorics; Graph; Graph theory; Discrete mathematics; Extremal graph theory; Line graph; Voltage graph","score_opus":0.04175281659476747,"score_gpt":0.2951102300940967,"score_spread":0.2533574134993292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068571612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050822653,0.004766816,0.5496439,0.04174871,0.0025734792,0.00011345217,0.0011769858,0.0005909165,0.3485631],"genre_scores_gemma":[0.74542236,0.0057864618,0.09621192,0.007195945,0.0035548254,0.0003513417,0.00076837995,0.00073837413,0.13997032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900204,0.00026854826,0.00006456983,0.0002956816,0.00023759386,0.00013167095],"domain_scores_gemma":[0.99776447,0.001245568,0.00012493113,0.00029598552,0.00045475704,0.00011433621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017643237,0.00070148817,0.0009356359,0.0027408183,0.0022081346,0.0035161031,0.0010392576,0.0018733694,0.015619377],"category_scores_gemma":[0.007031564,0.00049769925,0.0014275848,0.0022068645,0.0042370115,0.009435488,0.003263487,0.006082034,0.003054173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010595991,0.000005031773,0.000059755297,0.000015124998,0.0000042832503,0.0000260704,0.00007623739,0.00009288372,0.00025051355,0.99360186,0.003033156,0.002824458],"study_design_scores_gemma":[0.000007349114,0.0000047191043,0.0000795696,0.0000052827777,0.0000058390488,0.00008919868,0.000031007716,0.00068359735,0.00028104533,0.9854816,0.013324119,0.0000067179353],"about_ca_topic_score_codex":0.0010304374,"about_ca_topic_score_gemma":0.0005135752,"teacher_disagreement_score":0.015619377,"about_ca_system_score_codex":0.0015492397,"about_ca_system_score_gemma":0.0008971026,"threshold_uncertainty_score":0.052251995},"labels":[],"label_agreement":null},{"id":"W20688002","doi":"","title":"Minimum cost homomorphisms to oriented cycles with some loops","year":2009,"lang":"en","type":"article","venue":"Computing: The Australasian Theory Symposium","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Partition (number theory); Algebra homomorphism; Mathematics; Loop (graph theory); Discrete mathematics; Vertex (graph theory); Graph homomorphism; Directed graph; Graph; Line graph","score_opus":0.014754832187541159,"score_gpt":0.27610765207257515,"score_spread":0.261352819885034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20688002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8128856,0.0003921156,0.1632298,0.00091183,0.00011186154,0.00014491388,0.00037630228,0.00043513923,0.021512458],"genre_scores_gemma":[0.95207024,0.00018692912,0.03863323,0.00015420557,0.00008953889,0.00008553824,0.00032700173,0.000084452324,0.008368922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960643,0.00010516212,0.000027563357,0.00008406281,0.00007530349,0.000101569545],"domain_scores_gemma":[0.9979448,0.0011525918,0.00023849889,0.00022348839,0.00021187663,0.00022874483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004120796,0.00031991405,0.00037719536,0.0009544952,0.0007956545,0.0010308871,0.00077645684,0.00072823535,0.003780171],"category_scores_gemma":[0.004598949,0.00028286266,0.00045276663,0.000832426,0.0007773923,0.0016131487,0.0012229326,0.000725004,0.00034485976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004894591,0.00025029253,0.0034871032,0.0003728576,0.00009870448,0.0018138967,0.0016463123,0.07931995,0.010199156,0.8083416,0.0067055095,0.087275185],"study_design_scores_gemma":[0.000078591,0.00010381841,0.00090769626,0.000029336634,0.000037276524,0.00057226827,0.00032196756,0.14560156,0.0029286053,0.84283864,0.0065558436,0.000024332732],"about_ca_topic_score_codex":0.000953361,"about_ca_topic_score_gemma":0.0010695354,"teacher_disagreement_score":0.003780171,"about_ca_system_score_codex":0.0007249743,"about_ca_system_score_gemma":0.00039850833,"threshold_uncertainty_score":0.0126459},"labels":[],"label_agreement":null},{"id":"W2068854468","doi":"10.1016/j.aam.2008.05.002","title":"Some open problems on excluding a uniform matroid","year":2008,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Minor (academic); Mathematics; Combinatorics; Graphic matroid; Discrete mathematics; Humanities","score_opus":0.0561847561376672,"score_gpt":0.33206183607365786,"score_spread":0.27587707993599064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068854468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3861657,0.0075128814,0.29292637,0.045215074,0.002013861,0.00020612545,0.0026004855,0.0006874863,0.262672],"genre_scores_gemma":[0.798373,0.0057974504,0.09928968,0.0069637015,0.0062514767,0.00043289186,0.00584762,0.0007862115,0.07625802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672014,0.0011068869,0.00024059364,0.00085428916,0.0005607906,0.00051724707],"domain_scores_gemma":[0.9805815,0.014741898,0.0010011119,0.0012962981,0.0011936907,0.0011855263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004495709,0.0013605361,0.003522344,0.0026141678,0.0077623352,0.0071951062,0.005656619,0.0059114024,0.0212238],"category_scores_gemma":[0.023148809,0.0016130705,0.0032417544,0.006240534,0.0068617365,0.023727095,0.0063489224,0.012934754,0.001871042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015009791,0.00010842227,0.00066508533,0.00026700084,0.00004031802,0.0001663441,0.000394256,0.0040547177,0.000335385,0.97026116,0.011969475,0.011587938],"study_design_scores_gemma":[0.000036337187,0.00002288868,0.00022999212,0.000037515085,0.000022880997,0.0001128979,0.00018800182,0.0057933666,0.00018036834,0.9887398,0.0046207537,0.000015156797],"about_ca_topic_score_codex":0.0024056195,"about_ca_topic_score_gemma":0.0021705385,"teacher_disagreement_score":0.0212238,"about_ca_system_score_codex":0.0026475238,"about_ca_system_score_gemma":0.0013433818,"threshold_uncertainty_score":0.071000755},"labels":[],"label_agreement":null},{"id":"W2069229408","doi":"10.1016/j.tcs.2011.12.018","title":"Coloring vertices of a graph or finding a Meyniel obstruction","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Graph factorization; Graph power; Discrete mathematics; Graph coloring; Line graph","score_opus":0.05662253399805527,"score_gpt":0.3083479634721874,"score_spread":0.2517254294741321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069229408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43455717,0.00076674635,0.40461448,0.0075223492,0.001052845,0.0002732909,0.0006921062,0.0019437709,0.14857726],"genre_scores_gemma":[0.8334249,0.00044308574,0.119632445,0.001093704,0.00018140882,0.0001227196,0.0005514659,0.0004760462,0.044074122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994948,0.000108318665,0.000020016483,0.00013061476,0.00007574037,0.00017049925],"domain_scores_gemma":[0.99932706,0.00031948526,0.00005711625,0.00015108279,0.000048320093,0.000096920914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045631005,0.0006875952,0.0009002523,0.0007696277,0.0022577732,0.001739409,0.0010366194,0.0017356426,0.013053143],"category_scores_gemma":[0.0025270467,0.00039784407,0.00084835675,0.0007270426,0.0019054881,0.0034993405,0.003102989,0.002275863,0.0016385807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045373186,0.00010238641,0.0014527175,0.0002900421,0.00004399601,0.0005324558,0.0007709631,0.006689913,0.007448344,0.9189886,0.013363847,0.049862955],"study_design_scores_gemma":[0.00006747355,0.0000739283,0.0004900435,0.00004041544,0.00004307818,0.00024402239,0.00050263567,0.012939283,0.005004057,0.95804197,0.022517532,0.000035556874],"about_ca_topic_score_codex":0.001318096,"about_ca_topic_score_gemma":0.0018768053,"teacher_disagreement_score":0.013053143,"about_ca_system_score_codex":0.00081777223,"about_ca_system_score_gemma":0.0008261506,"threshold_uncertainty_score":0.043667138},"labels":[],"label_agreement":null},{"id":"W2069232411","doi":"10.5539/jmr.v2n2p104","title":"Clique Partitions of Glued Graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Clique-sum; Partition (number theory); Disjoint sets; Clique; Split graph; Cograph; Block graph; clone (Java method); Clique number; Chordal graph; Discrete mathematics; Graph; 1-planar graph","score_opus":0.09954003932687781,"score_gpt":0.4357319284140703,"score_spread":0.3361918890871925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069232411","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86113006,0.00051096926,0.112167485,0.0002593806,0.000055710396,0.0000878952,0.0008145906,0.00038182866,0.024592083],"genre_scores_gemma":[0.9600533,0.0002989882,0.03347311,0.0001063914,0.000057481553,0.0001558653,0.0013088251,0.00016904372,0.004376992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986615,0.00025610728,0.000058820242,0.00034018658,0.00035753034,0.0003258485],"domain_scores_gemma":[0.9950393,0.002335153,0.0006872884,0.0007481306,0.00044451893,0.00074570597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006045982,0.00078699226,0.0007558593,0.0028559433,0.0020361624,0.0025826048,0.0011452935,0.0012138272,0.0076217335],"category_scores_gemma":[0.004621371,0.0008185624,0.0008785383,0.0018387745,0.0019606387,0.0028728545,0.0026495329,0.0012398922,0.0006748539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010801007,0.00015504437,0.010105609,0.00045066298,0.00016627109,0.0016655765,0.0021173963,0.0563651,0.0648511,0.81554985,0.006670396,0.040822838],"study_design_scores_gemma":[0.00010053754,0.0001492549,0.011962824,0.00011010216,0.000107367494,0.0013478793,0.0007992842,0.16663603,0.019843578,0.78620327,0.012650603,0.000089181136],"about_ca_topic_score_codex":0.0013776801,"about_ca_topic_score_gemma":0.001950164,"teacher_disagreement_score":0.0076217335,"about_ca_system_score_codex":0.0013419464,"about_ca_system_score_gemma":0.000332293,"threshold_uncertainty_score":0.025497258},"labels":[],"label_agreement":null},{"id":"W2069262458","doi":"10.1016/s0012-365x(02)00495-8","title":"On the monotonicity of the broadcast function","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Conjecture; Monotonic function; Broadcasting (networking); Graph; Function (biology); Discrete mathematics; Computer science; Computer network","score_opus":0.024571823278013213,"score_gpt":0.2714664504881405,"score_spread":0.24689462721012728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069262458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2373815,0.0048583485,0.5160241,0.017468518,0.0007389437,0.00015718112,0.0011723178,0.00057563704,0.22162338],"genre_scores_gemma":[0.8730456,0.006257923,0.074708894,0.0031821674,0.0016529962,0.00039681612,0.0010070896,0.00092502154,0.03882349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966176,0.0014545871,0.00015769868,0.00047773807,0.0006895478,0.00060282194],"domain_scores_gemma":[0.9495077,0.040465966,0.0017472854,0.0028141716,0.0040573105,0.0014074971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056840065,0.0009287215,0.0022879012,0.0022646259,0.002880214,0.003953133,0.0027923337,0.0027693901,0.013543631],"category_scores_gemma":[0.041728027,0.0011510354,0.0017571562,0.0026296773,0.006399405,0.0162178,0.0035476207,0.0065644793,0.0020235647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020007388,0.00004935518,0.00056835293,0.00013707968,0.000016168264,0.00010447695,0.00035645074,0.0031386951,0.00158806,0.9771145,0.003855863,0.012870926],"study_design_scores_gemma":[0.00004580535,0.000047583082,0.0005802891,0.000065736895,0.000027041475,0.00031258631,0.00019613549,0.023870382,0.0010676071,0.96781844,0.0059428792,0.00002555118],"about_ca_topic_score_codex":0.0034958739,"about_ca_topic_score_gemma":0.0018153198,"teacher_disagreement_score":0.013543631,"about_ca_system_score_codex":0.002532831,"about_ca_system_score_gemma":0.0021888232,"threshold_uncertainty_score":0.045307994},"labels":[],"label_agreement":null},{"id":"W2069386249","doi":"10.1016/j.dam.2014.06.004","title":"Chasing robbers on random geometric graphs—An alternative approach","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Tel Aviv University; Ryerson University","keywords":"Mathematics; Combinatorics; Random graph; Random regular graph; Vertex (graph theory); Euclidean geometry; Graph; Upper and lower bounds; Discrete mathematics; Pathwidth; Line graph; Geometry","score_opus":0.02754310243246816,"score_gpt":0.2856310862076679,"score_spread":0.25808798377519976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069386249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023197021,0.00041002774,0.9485964,0.0017756902,0.00026089745,0.00012457711,0.0001850075,0.00023380562,0.025216583],"genre_scores_gemma":[0.5921803,0.001236143,0.345407,0.0017336907,0.0012545233,0.0006271911,0.0005009902,0.0005526835,0.056507487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99273527,0.0029479102,0.00024109789,0.0015370232,0.0017393293,0.00079950184],"domain_scores_gemma":[0.9688496,0.020307511,0.0015502018,0.0054474506,0.0023761182,0.0014691427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043715895,0.0024039873,0.0040667197,0.0050292704,0.0024570932,0.0064120907,0.00870866,0.0076233884,0.019792719],"category_scores_gemma":[0.024225604,0.0019858556,0.0034525574,0.004037378,0.008166581,0.015153938,0.009640292,0.005822918,0.0023491136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016211608,0.0001057609,0.00027599998,0.00023908439,0.0000768599,0.000140566,0.00029712878,0.049612887,0.001422665,0.9317432,0.0030245346,0.012899143],"study_design_scores_gemma":[0.00006112945,0.00014036805,0.00013956647,0.000056055964,0.0000509904,0.00015989509,0.00016733882,0.3564564,0.0008610734,0.6386098,0.0032360544,0.0000613305],"about_ca_topic_score_codex":0.0020356723,"about_ca_topic_score_gemma":0.0030338992,"teacher_disagreement_score":0.019792719,"about_ca_system_score_codex":0.0023232861,"about_ca_system_score_gemma":0.002331321,"threshold_uncertainty_score":0.06621319},"labels":[],"label_agreement":null},{"id":"W2069528460","doi":"10.1016/j.disc.2007.11.044","title":"List-edge and list-total colorings of graphs embedded on hyperbolic surfaces","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Euler's formula; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.03229358121360019,"score_gpt":0.28555978410736266,"score_spread":0.25326620289376245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069528460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9250274,0.00018752937,0.047211662,0.0004800683,0.00009468317,0.00003624919,0.000679087,0.0003914756,0.02589181],"genre_scores_gemma":[0.9592102,0.0001962013,0.016002828,0.00017614698,0.00006963078,0.000046133344,0.00096366386,0.00032074176,0.023014337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996068,0.00006606151,0.000017564056,0.000078310586,0.00010062598,0.00013075715],"domain_scores_gemma":[0.996869,0.0011230389,0.0004281994,0.00041500782,0.00055359607,0.00061120006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039263626,0.0005734086,0.00046295428,0.0017188159,0.0016512743,0.0026874053,0.0013618966,0.00085527456,0.009085196],"category_scores_gemma":[0.0026367176,0.0006332938,0.00055721606,0.0015552347,0.0016877323,0.002201465,0.0012497832,0.0012762613,0.0008138399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004546822,0.00011276041,0.0059893206,0.00013632332,0.00003132489,0.00035406768,0.0013197897,0.020116882,0.010159439,0.9377921,0.0066793496,0.016853884],"study_design_scores_gemma":[0.00007194688,0.000059709233,0.0048569916,0.000039646085,0.000041778043,0.00025352804,0.0011026181,0.062033374,0.0048120846,0.92121404,0.005462514,0.000051710664],"about_ca_topic_score_codex":0.0046300697,"about_ca_topic_score_gemma":0.007613885,"teacher_disagreement_score":0.009085196,"about_ca_system_score_codex":0.0014186923,"about_ca_system_score_gemma":0.00069456454,"threshold_uncertainty_score":0.030393064},"labels":[],"label_agreement":null},{"id":"W2069703039","doi":"10.1007/s00373-012-1246-z","title":"A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Infimum and supremum; Upper and lower bounds; Graph; Klein bottle; Surface (topology); Projective plane","score_opus":0.016220047580076866,"score_gpt":0.26878955691163486,"score_spread":0.252569509331558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069703039","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13549891,0.008088638,0.2922118,0.029791277,0.010394818,0.00020333599,0.0005946542,0.00040545932,0.5228111],"genre_scores_gemma":[0.7464399,0.010001126,0.07331722,0.003645685,0.0061530946,0.00027651797,0.000517638,0.0005224482,0.15912637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907243,0.00030166548,0.000040427807,0.00019959817,0.00024045802,0.00014549702],"domain_scores_gemma":[0.998338,0.0011271898,0.00007152293,0.00014634128,0.000110524044,0.00020633375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078383606,0.0014348433,0.001955841,0.0011664507,0.0026849539,0.0039054204,0.0026293772,0.0033348033,0.010976109],"category_scores_gemma":[0.004626208,0.00061700924,0.0014601065,0.0017630871,0.004192444,0.008940794,0.004066376,0.0052339607,0.0015554759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000694815,0.000046595473,0.00016787887,0.00013559352,0.000027348007,0.00036207616,0.00026900572,0.012988786,0.0012460377,0.9595374,0.015459739,0.009690054],"study_design_scores_gemma":[0.000016678108,0.00002954567,0.00017214709,0.000036358884,0.000016405558,0.00008435847,0.00015853609,0.0159363,0.00031298024,0.9650272,0.018178893,0.000030525818],"about_ca_topic_score_codex":0.0057957773,"about_ca_topic_score_gemma":0.0069269612,"teacher_disagreement_score":0.010976109,"about_ca_system_score_codex":0.0020919424,"about_ca_system_score_gemma":0.0008971244,"threshold_uncertainty_score":0.036718726},"labels":[],"label_agreement":null},{"id":"W2070158492","doi":"10.1016/s0166-218x(03)00275-0","title":"On simplicial and co-simplicial vertices in graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; h-vector; Vertex (graph theory); Abstract simplicial complex; Simplicial homology; Simplicial complex; Neighbourhood (mathematics); Chordal graph; Independent set; Simplicial set; Simplicial manifold; Simplicial approximation theorem; Discrete mathematics; Graph; Pure mathematics","score_opus":0.019054387248265452,"score_gpt":0.3035012931768905,"score_spread":0.28444690592862504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070158492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46412683,0.007928752,0.334146,0.008318649,0.0011943446,0.00016194825,0.001117028,0.00038502493,0.18262145],"genre_scores_gemma":[0.9098222,0.00451844,0.041308958,0.00080305495,0.0009826879,0.00014994622,0.0007703833,0.00026641882,0.041377977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868494,0.00035487834,0.00007990049,0.00029233244,0.000342158,0.00024582233],"domain_scores_gemma":[0.9925799,0.004690817,0.00059032236,0.0005770068,0.00063197827,0.00093006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015565916,0.0012043478,0.00156166,0.0049378094,0.0042000795,0.0072734337,0.0024675569,0.003460553,0.010512631],"category_scores_gemma":[0.00814619,0.0011340237,0.0013995763,0.006155471,0.007612412,0.012329542,0.0054749446,0.004679537,0.0011219302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020813404,0.000013261182,0.00022792908,0.000033888038,0.000004461388,0.00004830952,0.0003740852,0.0010382301,0.00021191683,0.9944457,0.00057933404,0.0030019588],"study_design_scores_gemma":[0.0000031998545,0.0000026884131,0.00010179738,0.000012775065,0.0000048401957,0.000026458589,0.000117678144,0.0019764702,0.00006373294,0.99653435,0.0011510884,0.0000048623338],"about_ca_topic_score_codex":0.003936643,"about_ca_topic_score_gemma":0.0057224412,"teacher_disagreement_score":0.010512631,"about_ca_system_score_codex":0.002842385,"about_ca_system_score_gemma":0.0008911123,"threshold_uncertainty_score":0.03516823},"labels":[],"label_agreement":null},{"id":"W2070606919","doi":"10.1007/s00454-007-1318-7","title":"Graph Treewidth and Geometric Thickness Parameters","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Centre de Recherches Mathématiques","keywords":"Arboricity; Treewidth; Combinatorics; Mathematics; Regular polygon; Conjecture; Upper and lower bounds; Partial k-tree; 1-planar graph; Graph; Crossing number (knot theory); Planar graph; Discrete mathematics; Pathwidth; Geometry; Chordal graph; Mathematical analysis; Line graph","score_opus":0.019270224172990538,"score_gpt":0.2982417351459352,"score_spread":0.2789715109729447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070606919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7035707,0.0036328794,0.24178506,0.0029725425,0.0001839173,0.000069500114,0.0012974899,0.00077232806,0.045715556],"genre_scores_gemma":[0.96603596,0.0011932676,0.025695093,0.00017484075,0.0001878897,0.00007765041,0.00044100848,0.0004966522,0.00569756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990646,0.00022363379,0.00004385484,0.00028118017,0.00020780215,0.00017892288],"domain_scores_gemma":[0.9858293,0.0083977515,0.0025525715,0.0014898578,0.0006137388,0.0011168617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014910038,0.00088171917,0.0009109561,0.0024158808,0.0011038034,0.0038969414,0.0026516921,0.0021008693,0.01155046],"category_scores_gemma":[0.018061271,0.0012895622,0.0004993408,0.0037012184,0.0027082763,0.014987172,0.0027936473,0.0030594117,0.0011669769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005645897,0.00011286901,0.010518388,0.00022420946,0.000057570553,0.0002701755,0.0007402247,0.06902786,0.011231747,0.8582587,0.0058879307,0.04310566],"study_design_scores_gemma":[0.000049927523,0.0000652826,0.003859151,0.00008592439,0.000084074236,0.0008667205,0.0005630611,0.10723857,0.00664705,0.87503046,0.0054429313,0.00006681837],"about_ca_topic_score_codex":0.0007967501,"about_ca_topic_score_gemma":0.0010622037,"teacher_disagreement_score":0.01155046,"about_ca_system_score_codex":0.0013030277,"about_ca_system_score_gemma":0.00056802423,"threshold_uncertainty_score":0.03864014},"labels":[],"label_agreement":null},{"id":"W2070790034","doi":"10.1016/s0166-218x(02)00198-1","title":"Edge dominating set and colorings on graphs with fixed clique-width","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Chordal graph; Discrete mathematics; Clique-sum; 1-planar graph; Brooks' theorem; Graph coloring; Indifference graph; Edge coloring; Independent set; Maximal independent set; Vertex (graph theory); Pathwidth; Dominating set; Bounded function; Graph; Line graph; Graph power","score_opus":0.02828176812337445,"score_gpt":0.26735332624816743,"score_spread":0.23907155812479297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070790034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63664323,0.003753552,0.31736866,0.006663655,0.00038657562,0.00019718023,0.0024075597,0.00059641025,0.031983193],"genre_scores_gemma":[0.9093967,0.0020101403,0.07463661,0.00069513026,0.00067249924,0.00029675328,0.0013384606,0.00035242742,0.010601261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976004,0.0007232152,0.00010332092,0.00077422435,0.00038304593,0.0004157881],"domain_scores_gemma":[0.9696275,0.022711217,0.0023771282,0.002070511,0.0010992258,0.002114451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045958874,0.0020395536,0.002866206,0.003311982,0.0035872755,0.0064344765,0.005371348,0.0030379782,0.0051987283],"category_scores_gemma":[0.025733653,0.0029791244,0.0021936637,0.005223938,0.005356824,0.011390721,0.0034652657,0.004943234,0.00042065338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006780269,0.00019147119,0.0025582847,0.00032278933,0.00013403452,0.00013658848,0.00081129343,0.058126334,0.0024157611,0.9156207,0.005633475,0.013371389],"study_design_scores_gemma":[0.0001327111,0.000040763498,0.000853604,0.00005103223,0.00007363366,0.00018188237,0.00021408303,0.103672124,0.0006973271,0.8925911,0.0014599662,0.00003174828],"about_ca_topic_score_codex":0.0032285554,"about_ca_topic_score_gemma":0.0042018928,"teacher_disagreement_score":0.0064344765,"about_ca_system_score_codex":0.004996044,"about_ca_system_score_gemma":0.0021061662,"threshold_uncertainty_score":0.03624904},"labels":[],"label_agreement":null},{"id":"W2071287219","doi":"10.1016/j.endm.2009.07.035","title":"Coloring a set of touching strings","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Monotone polygon; Plane (geometry); Planar graph; Bounded function; Discrete geometry; Integer (computer science); Line segment; Line (geometry); Point (geometry); Set (abstract data type); Discrete mathematics; Geometry; Graph; Mathematical analysis; Computer science","score_opus":0.019808836336700223,"score_gpt":0.31220657841205546,"score_spread":0.29239774207535524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071287219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50504184,0.00038739864,0.41212294,0.00085254456,0.00070444215,0.00027924802,0.0020902597,0.0027094285,0.07581189],"genre_scores_gemma":[0.718972,0.0004019886,0.21757357,0.00051532546,0.00014902062,0.0006422844,0.0025372189,0.00087813026,0.05833051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891305,0.00016503297,0.000068985646,0.0003236527,0.00026902856,0.0002603248],"domain_scores_gemma":[0.996238,0.0013792976,0.00026752445,0.0010295457,0.00055922184,0.00052636984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039151593,0.0010044164,0.0011786799,0.0014385298,0.002639001,0.0033635183,0.0021240755,0.0020631382,0.020221014],"category_scores_gemma":[0.003134919,0.00085561775,0.0010953675,0.0031261903,0.0014040205,0.0029232262,0.0025350945,0.0017796109,0.0032757402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014126053,0.00063662784,0.005124311,0.0008334482,0.00020223689,0.0016235304,0.0013626725,0.039870903,0.0858389,0.70711017,0.015870757,0.14011389],"study_design_scores_gemma":[0.00021872412,0.00037592172,0.0025595021,0.00017060377,0.000110295245,0.00084717764,0.0009967786,0.13048187,0.037096564,0.7966211,0.030396452,0.00012489987],"about_ca_topic_score_codex":0.00095046824,"about_ca_topic_score_gemma":0.0010091735,"teacher_disagreement_score":0.020221014,"about_ca_system_score_codex":0.0008377359,"about_ca_system_score_gemma":0.0007237849,"threshold_uncertainty_score":0.067646086},"labels":[],"label_agreement":null},{"id":"W2071324240","doi":"10.1016/s0166-218x(02)00249-4","title":"On sum coloring of graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Greedy coloring; Combinatorics; Complete coloring; Edge coloring; Brooks' theorem; Graph coloring; Fractional coloring; List coloring; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Line graph","score_opus":0.023378729893770576,"score_gpt":0.28389298125915063,"score_spread":0.26051425136538003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071324240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2804921,0.0043043653,0.4619822,0.007322516,0.0029981039,0.00013313632,0.0008683782,0.0009599372,0.24093921],"genre_scores_gemma":[0.7554056,0.004867444,0.1116369,0.0029312691,0.0033450213,0.0002673503,0.0021183477,0.0014232632,0.1180047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876875,0.00045448818,0.000046174726,0.00024194173,0.00030361026,0.00018503758],"domain_scores_gemma":[0.99521625,0.0028899284,0.0002610224,0.00053082645,0.00047921768,0.0006227743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273924,0.0014586722,0.0016457613,0.0026052175,0.002582994,0.003878529,0.0022112296,0.0014229091,0.010598678],"category_scores_gemma":[0.0063537126,0.0011058332,0.0015885426,0.0037164877,0.0030442453,0.006899217,0.0042896233,0.005916619,0.0016427977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010354851,0.000050625553,0.00039146017,0.00011537755,0.00002171559,0.00008008633,0.00033843823,0.0046232804,0.0009382146,0.96681464,0.0077836416,0.01873901],"study_design_scores_gemma":[0.000007377003,0.0000090994845,0.00012480088,0.000013953188,0.000011123581,0.000042552285,0.000056558452,0.0069869217,0.00017595346,0.9895111,0.0030544684,0.0000061628584],"about_ca_topic_score_codex":0.002333075,"about_ca_topic_score_gemma":0.0029225799,"teacher_disagreement_score":0.010598678,"about_ca_system_score_codex":0.0020153422,"about_ca_system_score_gemma":0.0008954608,"threshold_uncertainty_score":0.03545612},"labels":[],"label_agreement":null},{"id":"W2071645752","doi":"10.1016/j.jda.2008.11.002","title":"Threshold dominating cliques in random graphs and interval routing","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Interval graph; Discrete mathematics; Interval (graph theory); Indifference graph; Chordal graph; Block graph; Split graph; Routing (electronic design automation); Clique; Pathwidth; Graph; Computer science; Line graph; 1-planar graph","score_opus":0.024496507497742983,"score_gpt":0.30680819512786284,"score_spread":0.2823116876301199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071645752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31652248,0.0018649237,0.6600009,0.002900584,0.00020446428,0.00022948527,0.00064937165,0.00037387435,0.017253796],"genre_scores_gemma":[0.92121464,0.0012634235,0.06540851,0.00039760064,0.00041579214,0.00025469676,0.0005966496,0.00015092385,0.010297846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973659,0.0010507623,0.000119791446,0.0006259927,0.00051352696,0.00032404947],"domain_scores_gemma":[0.9710231,0.022016186,0.0028547177,0.0016073278,0.0010929332,0.0014057525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003746054,0.0007598396,0.0020329403,0.0020416996,0.0017232635,0.0044719325,0.0040407977,0.0022329988,0.0056752735],"category_scores_gemma":[0.025270391,0.0015255765,0.0014655922,0.0033222905,0.0028856064,0.007072366,0.002624355,0.0028594015,0.0004849119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048297818,0.00016587129,0.0027165946,0.00020245134,0.000115701005,0.00030664806,0.0007087884,0.14230137,0.0020829292,0.83061635,0.0040972163,0.016203087],"study_design_scores_gemma":[0.00013303866,0.000060156992,0.00082480424,0.000032319458,0.00007148794,0.00032058722,0.0002282469,0.39867306,0.00063391885,0.5970002,0.0019907919,0.00003135079],"about_ca_topic_score_codex":0.0014766586,"about_ca_topic_score_gemma":0.0019002452,"teacher_disagreement_score":0.0056752735,"about_ca_system_score_codex":0.0019579188,"about_ca_system_score_gemma":0.00093858136,"threshold_uncertainty_score":0.019811213},"labels":[],"label_agreement":null},{"id":"W2071725273","doi":"10.1002/jgt.20554","title":"The plane-width of graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wheel graph; Chromatic scale; Vertex (graph theory); Graph; Windmill graph; Graph power; Geometric graph theory; Bound graph; Independent set","score_opus":0.028823839862715587,"score_gpt":0.2675951910981415,"score_spread":0.23877135123542592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071725273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5575203,0.0045258943,0.38679373,0.0015667528,0.00017620019,0.00010644574,0.0021681585,0.0005873284,0.0465553],"genre_scores_gemma":[0.9126681,0.0020962593,0.07744002,0.0002698841,0.00025290935,0.00010511087,0.0009029934,0.00024203194,0.0060226326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999215,0.00017513768,0.000046753983,0.00029234844,0.00013868292,0.00013200621],"domain_scores_gemma":[0.99601245,0.0018989478,0.00066780444,0.0006122222,0.00035000767,0.00045864913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006558498,0.000584614,0.00053115614,0.0015735846,0.0007953949,0.0027530496,0.0011539765,0.0008914571,0.0037249206],"category_scores_gemma":[0.0051454613,0.00048091248,0.00046847315,0.0019422717,0.0023008534,0.0050944597,0.0016077138,0.0013970708,0.0006788504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005198033,0.000067955174,0.0037682054,0.00032446484,0.0000750077,0.00019346079,0.00079635327,0.039148334,0.015452146,0.8674626,0.00680329,0.06538833],"study_design_scores_gemma":[0.000052019943,0.000120959216,0.0025668559,0.00008261802,0.00005936457,0.00085944426,0.00048798823,0.061331835,0.0076264422,0.9001761,0.026585808,0.000050554943],"about_ca_topic_score_codex":0.0009855279,"about_ca_topic_score_gemma":0.00064523803,"teacher_disagreement_score":0.0037249206,"about_ca_system_score_codex":0.0010278975,"about_ca_system_score_gemma":0.0003751799,"threshold_uncertainty_score":0.012461126},"labels":[],"label_agreement":null},{"id":"W2071879725","doi":"10.1007/s10107-010-0370-x","title":"Small Chvátal Rank","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Polytope; Combinatorics; Polyhedron; Mathematics; Facet (psychology); Unit cube; Context (archaeology); Rank (graph theory); Set (abstract data type); Integer (computer science); Graph; Integer programming; Birkhoff polytope; Cube (algebra); Polyhedral combinatorics; Discrete mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.03691911983242624,"score_gpt":0.3022590057215975,"score_spread":0.26533988588917123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071879725","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28770557,0.0012216854,0.19579841,0.008468649,0.0010407744,0.00022982403,0.0014038368,0.0027021687,0.501429],"genre_scores_gemma":[0.89664364,0.00037309053,0.013145556,0.0012364784,0.0006389526,0.00014809975,0.0003872822,0.00064505066,0.0867818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862254,0.0003333974,0.000041148804,0.0002760953,0.00038514295,0.0003417036],"domain_scores_gemma":[0.99205536,0.0036432538,0.00056940556,0.0015200751,0.0010347854,0.0011770704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010065074,0.0008508364,0.0014816964,0.0024717506,0.002257,0.004821924,0.0017307098,0.0018742281,0.04695028],"category_scores_gemma":[0.012868314,0.0006272541,0.00061087345,0.0009633601,0.0037245438,0.0056033474,0.003680883,0.0040408056,0.0052805725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009428721,0.000036949325,0.0002911916,0.00006591718,0.000012741052,0.000095819705,0.00010745953,0.001541444,0.0021462627,0.9780059,0.0079165185,0.009685489],"study_design_scores_gemma":[0.00002145255,0.000026466678,0.00025466728,0.000013175531,0.00000997758,0.00015057616,0.00008518522,0.007825191,0.001328595,0.98507047,0.0051985946,0.00001568456],"about_ca_topic_score_codex":0.0007245488,"about_ca_topic_score_gemma":0.0011233567,"teacher_disagreement_score":0.04695028,"about_ca_system_score_codex":0.0008971094,"about_ca_system_score_gemma":0.00113882,"threshold_uncertainty_score":0.15706432},"labels":[],"label_agreement":null},{"id":"W2072137480","doi":"10.1007/bf02773060","title":"The number of 2-sat functions","year":2003,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Monotone polygon; Upper and lower bounds; Combinatorics; Boolean function; Cube (algebra); Set (abstract data type); Discrete mathematics; Unit cube","score_opus":0.029281526372517862,"score_gpt":0.3220856672973955,"score_spread":0.29280414092487766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072137480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65789664,0.0029461773,0.17286214,0.018971179,0.0012425316,0.0002784287,0.0070002545,0.0024505828,0.13635206],"genre_scores_gemma":[0.9263323,0.0010054243,0.03478263,0.0016343172,0.0007962338,0.00041948448,0.0038732665,0.00075054733,0.03040583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994408,0.0019540524,0.00029071097,0.0012962394,0.0009530773,0.0010979691],"domain_scores_gemma":[0.9561899,0.034102652,0.0019216355,0.0042198864,0.0016653447,0.0019006339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003363251,0.0017461601,0.0023463392,0.0026306368,0.0032059036,0.007950219,0.0046493495,0.004575139,0.03230318],"category_scores_gemma":[0.027039707,0.0015386443,0.003222838,0.0024613615,0.003737511,0.014244162,0.0030734024,0.006679455,0.0045277653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030565758,0.0006562202,0.017661614,0.0011506648,0.0005449793,0.0005596187,0.00074080605,0.04016626,0.014675618,0.7649567,0.0433799,0.11245106],"study_design_scores_gemma":[0.00034446188,0.0001953512,0.0064097955,0.00014288028,0.00036446983,0.0013864138,0.0003710945,0.08193116,0.010619061,0.88396496,0.014167568,0.0001027853],"about_ca_topic_score_codex":0.0006384608,"about_ca_topic_score_gemma":0.0009360464,"teacher_disagreement_score":0.03230318,"about_ca_system_score_codex":0.0027400048,"about_ca_system_score_gemma":0.0023829287,"threshold_uncertainty_score":0.10806489},"labels":[],"label_agreement":null},{"id":"W2072209133","doi":"10.1016/j.disc.2004.10.026","title":"The recognition of bound quivers using edge-coloured homomorphisms","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University; Thompson Rivers University","funders":"","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Upper and lower bounds; Quiver; Discrete mathematics; Directed graph; Enhanced Data Rates for GSM Evolution; Graph; Time complexity; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.048571281772499336,"score_gpt":0.3108193656923948,"score_spread":0.2622480839198955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072209133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39235374,0.0004855105,0.56898814,0.0006192115,0.00047135935,0.0001292731,0.00044340926,0.0039596297,0.03254969],"genre_scores_gemma":[0.87950677,0.0002682519,0.102271795,0.0002908372,0.00009055474,0.0001027814,0.00101211,0.0007616462,0.015695252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987118,0.00024877506,0.00010304161,0.0003456332,0.00027680045,0.0003139891],"domain_scores_gemma":[0.9962717,0.0016369921,0.00022605024,0.001089873,0.0004040071,0.0003713563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007241033,0.0006767932,0.0012899454,0.0013939263,0.0017264754,0.005647114,0.0021969574,0.0021795544,0.00823067],"category_scores_gemma":[0.005167496,0.00093472743,0.0011011384,0.0014199297,0.0027039805,0.007609685,0.0038657333,0.0026695775,0.002262162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006310505,0.00027777467,0.0025321925,0.00023773879,0.00006183048,0.00049169705,0.0016851372,0.01723184,0.026081204,0.8307548,0.010729399,0.10928534],"study_design_scores_gemma":[0.000044311993,0.00008173122,0.00078310404,0.0000547202,0.000040006977,0.0002321083,0.00041648353,0.07964915,0.01821211,0.89107114,0.009336318,0.00007879791],"about_ca_topic_score_codex":0.0014049227,"about_ca_topic_score_gemma":0.0017405222,"teacher_disagreement_score":0.00823067,"about_ca_system_score_codex":0.00086351397,"about_ca_system_score_gemma":0.00047508336,"threshold_uncertainty_score":0.027534306},"labels":[],"label_agreement":null},{"id":"W2072365573","doi":"10.1016/s0304-3975(97)00300-9","title":"On computing graph minor obstruction sets","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","score_opus":0.013123453322863778,"score_gpt":0.28759454073442914,"score_spread":0.27447108741156534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072365573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3953034,0.0012826977,0.54918045,0.0026999773,0.00052754226,0.0005182238,0.0016710421,0.0063094157,0.042507254],"genre_scores_gemma":[0.70665526,0.00064445124,0.2674308,0.000666451,0.000520796,0.00032363427,0.004584015,0.0012789898,0.017895548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791247,0.0004132123,0.000115315466,0.000468209,0.0006421925,0.00044868575],"domain_scores_gemma":[0.9910925,0.005299067,0.00036372905,0.0019371299,0.0006175034,0.0006899633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016425382,0.00150325,0.0025743172,0.0045861206,0.0026201548,0.0042746714,0.0035984546,0.0015909236,0.016330497],"category_scores_gemma":[0.011115396,0.0009643987,0.002385746,0.004524762,0.0033489957,0.0106474515,0.0072493576,0.0032076433,0.0023223548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026210886,0.0011280582,0.01266177,0.0008983549,0.0002314379,0.00037379444,0.002128313,0.062502064,0.014454083,0.5124937,0.033924125,0.3565832],"study_design_scores_gemma":[0.00012940724,0.00022813557,0.0027178356,0.00008345938,0.00013217193,0.00022538955,0.00045656122,0.17809047,0.0045903362,0.80262274,0.010664794,0.000058775804],"about_ca_topic_score_codex":0.0029525468,"about_ca_topic_score_gemma":0.0068654753,"teacher_disagreement_score":0.016330497,"about_ca_system_score_codex":0.0021962267,"about_ca_system_score_gemma":0.0015304929,"threshold_uncertainty_score":0.054630995},"labels":[],"label_agreement":null},{"id":"W2074364524","doi":"10.1002/jgt.20571","title":"On characterizing Vizing's edge colouring bound","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Domination analysis; Logarithm; Bounded function; Upper and lower bounds; Multiplicity (mathematics); Graph; Edge coloring; Discrete mathematics; Vertex (graph theory); Line graph; Graph power; Geometry","score_opus":0.038400955960673284,"score_gpt":0.27935740087532934,"score_spread":0.24095644491465606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074364524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.709662,0.0015707919,0.2394908,0.0022770064,0.00012593022,0.00007401666,0.0004589275,0.0006070529,0.045733403],"genre_scores_gemma":[0.9844899,0.00022590214,0.0134878,0.00025194595,0.00004043306,0.000028026208,0.00014169824,0.00007881733,0.0012553531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705577,0.0007978745,0.000113149305,0.0007410381,0.00049375836,0.0007984493],"domain_scores_gemma":[0.9710724,0.019871699,0.0016259716,0.0045399014,0.0014082963,0.0014816271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048050736,0.0006803851,0.00095629983,0.0022124809,0.0014543016,0.0025960046,0.0030741566,0.0018960428,0.0051379143],"category_scores_gemma":[0.029639555,0.0005962728,0.0007894544,0.0023519113,0.0040823584,0.0065954556,0.0033482462,0.0025495756,0.0004601221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087667885,0.000090939626,0.015427179,0.00024495463,0.000065239336,0.0003012788,0.0006739822,0.05281001,0.014767591,0.882658,0.004391759,0.027692404],"study_design_scores_gemma":[0.000040911138,0.0001232873,0.005158978,0.000083206796,0.000064267435,0.00047299676,0.00029452157,0.19479586,0.012947079,0.7811474,0.004812635,0.00005882519],"about_ca_topic_score_codex":0.0017021252,"about_ca_topic_score_gemma":0.0013933125,"teacher_disagreement_score":0.0051379143,"about_ca_system_score_codex":0.0026725854,"about_ca_system_score_gemma":0.00062958786,"threshold_uncertainty_score":0.025411963},"labels":[],"label_agreement":null},{"id":"W2074524916","doi":"10.1007/s10732-013-9224-z","title":"Applying local search to the feedback vertex set problem","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Feedback arc set; Feedback vertex set; Directed acyclic graph; Local search (optimization); Vertex (graph theory); Simulated annealing; Set (abstract data type); Bidirectional search; Heuristic; Mathematical optimization; Representation (politics); Computer science; Graph; Greedy algorithm; Mathematics; Algorithm; Search algorithm; Theoretical computer science; Beam search; Best-first search; Line graph","score_opus":0.028701437529020143,"score_gpt":0.3008019868948117,"score_spread":0.27210054936579153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074524916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12729459,0.0009956525,0.8601606,0.0008554762,0.00013181638,0.0002520696,0.00014471798,0.001000555,0.009164511],"genre_scores_gemma":[0.6932683,0.0002871495,0.30087838,0.00027014795,0.00009840208,0.00028505677,0.0002829663,0.00022256991,0.0044070254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986192,0.00075147697,0.000048543832,0.00017147405,0.00023316243,0.00017605111],"domain_scores_gemma":[0.99196273,0.00666165,0.00030212483,0.00038126958,0.00044215246,0.00025014346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002357106,0.0007995538,0.0022236884,0.0017891199,0.0010283348,0.001408892,0.0026894712,0.0021726587,0.0047761924],"category_scores_gemma":[0.0133909965,0.0007022042,0.0008695111,0.0020272878,0.0011399855,0.0025283007,0.002139285,0.0015300987,0.00047873968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004307115,0.00044338655,0.0009922876,0.00024811452,0.000084996806,0.0001399165,0.0001499328,0.86994714,0.0012630776,0.022355957,0.003529556,0.10041488],"study_design_scores_gemma":[0.00007773259,0.00007898253,0.00007328917,0.000014986528,0.000017757102,0.000018265959,0.000035038523,0.9773285,0.00030384038,0.0217068,0.00033883317,0.000005848772],"about_ca_topic_score_codex":0.006891348,"about_ca_topic_score_gemma":0.007388662,"teacher_disagreement_score":0.006891348,"about_ca_system_score_codex":0.0013713522,"about_ca_system_score_gemma":0.0019342529,"threshold_uncertainty_score":0.01597792},"labels":[],"label_agreement":null},{"id":"W2074859673","doi":"10.1006/jctb.2002.2130","title":"Branch-Width and Rota's Conjecture","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Conjecture; Finite field; Integer (computer science); Combinatorics; Mathematics; Field (mathematics); Finite set; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.011884428037992422,"score_gpt":0.24380569174866168,"score_spread":0.23192126371066926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074859673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4386936,0.0047358642,0.08031688,0.04021264,0.0014761989,0.00013117281,0.0016468975,0.0015664739,0.4312203],"genre_scores_gemma":[0.95089084,0.002095029,0.017619913,0.0028690144,0.0015357462,0.00016628804,0.0011183973,0.00040685188,0.023297992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985524,0.00038512138,0.00006367682,0.00041681284,0.0002518729,0.00033011028],"domain_scores_gemma":[0.98960894,0.00722336,0.00061474106,0.0013622773,0.0004509419,0.0007397626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002399238,0.00095808407,0.0025008675,0.002043107,0.004235578,0.005846498,0.0030787808,0.00446793,0.028365934],"category_scores_gemma":[0.014846845,0.001217172,0.0015928146,0.0034501757,0.0059754592,0.018312065,0.0046197814,0.0078084343,0.0033351916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021647569,0.000082008184,0.0008794482,0.00012862534,0.00001784137,0.00009028336,0.0002988311,0.001742826,0.0005324855,0.9735372,0.011878475,0.010595522],"study_design_scores_gemma":[0.000034366843,0.0000074378677,0.00016839482,0.000016900207,0.000010118481,0.000048118047,0.00007652168,0.0022056883,0.00012218965,0.99520254,0.002100646,0.000007002186],"about_ca_topic_score_codex":0.0012716522,"about_ca_topic_score_gemma":0.0012162477,"teacher_disagreement_score":0.028365934,"about_ca_system_score_codex":0.0016389575,"about_ca_system_score_gemma":0.0009079657,"threshold_uncertainty_score":0.094893515},"labels":[],"label_agreement":null},{"id":"W2074892433","doi":"10.1016/j.ipl.2007.08.005","title":"Approximation and inapproximability results for maximum clique of disc graphs in high dimensions","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Combinatorics; Clique; Mathematics; Approximation algorithm; Set (abstract data type); Euclidean geometry; Euclidean space; Time complexity; Space (punctuation); Independent set; Euclidean distance; Discrete mathematics; Graph; Computer science; Geometry","score_opus":0.014009683904518814,"score_gpt":0.278734077731017,"score_spread":0.2647243938264982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074892433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29430476,0.016347144,0.5678044,0.030172782,0.001172613,0.000834918,0.0066856146,0.0031040232,0.0795737],"genre_scores_gemma":[0.77587295,0.0067880116,0.18809363,0.0034390835,0.0024885924,0.0011233483,0.00578039,0.0012080012,0.015206065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99168056,0.0028687438,0.00030657387,0.0015601777,0.0017564114,0.0018276455],"domain_scores_gemma":[0.9305681,0.05533617,0.0028680887,0.0059690257,0.0021005908,0.0031579921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009136013,0.0059579476,0.006631098,0.005781055,0.004499454,0.011043533,0.014060772,0.00643522,0.013822333],"category_scores_gemma":[0.054354303,0.0030799855,0.004496695,0.00948178,0.0067615774,0.020902311,0.009021281,0.0139059285,0.0023874468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006013601,0.0025817992,0.010166364,0.003347413,0.0008061339,0.00046248318,0.0024731061,0.39195716,0.006755308,0.4093305,0.07686062,0.08924552],"study_design_scores_gemma":[0.00034300337,0.00016293,0.00096931733,0.00012903301,0.00022120244,0.00022814788,0.00039637668,0.6060913,0.0019008045,0.38557667,0.003919283,0.00006189099],"about_ca_topic_score_codex":0.0064542517,"about_ca_topic_score_gemma":0.007487541,"teacher_disagreement_score":0.014060772,"about_ca_system_score_codex":0.008481152,"about_ca_system_score_gemma":0.0044865934,"threshold_uncertainty_score":0.061535418},"labels":[],"label_agreement":null},{"id":"W2075240586","doi":"10.1002/net.21505","title":"Optimal edge‐coloring with edge rate constraints","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Time complexity; Mathematics; Discrete mathematics; Indifference graph; Pooling; Sequence (biology); Matching (statistics); Chordal graph; Pathwidth; Computer science; Graph; Line graph","score_opus":0.01747177441735967,"score_gpt":0.25795359369669935,"score_spread":0.24048181927933968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075240586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24454233,0.0010190145,0.73222435,0.0011296044,0.00024164771,0.00023860317,0.0013227754,0.0009880338,0.018293729],"genre_scores_gemma":[0.7373891,0.00080510817,0.249925,0.00037714958,0.00013649088,0.00017360772,0.000992333,0.00034501695,0.0098562995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991013,0.00025238824,0.000029254732,0.0002499181,0.000111160865,0.00025601927],"domain_scores_gemma":[0.9983961,0.0009026932,0.000163816,0.00026034616,0.00010327974,0.00017381772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009951148,0.0013569955,0.0014430418,0.00047600426,0.0006827784,0.0012635629,0.001758464,0.0012543949,0.005026551],"category_scores_gemma":[0.0035827481,0.0005532048,0.0006812107,0.0014261941,0.00077795883,0.0024561677,0.0009373673,0.0012375094,0.0007584181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004425199,0.00021469734,0.0011361768,0.00030336555,0.00006427561,0.0002115781,0.00010597914,0.8738826,0.0076410426,0.05925254,0.0073341248,0.04941114],"study_design_scores_gemma":[0.00007429695,0.00010837777,0.000342313,0.000014644175,0.00002771058,0.00010057249,0.00006359811,0.91165036,0.00244925,0.08215043,0.002999077,0.00001931863],"about_ca_topic_score_codex":0.0037631642,"about_ca_topic_score_gemma":0.004544936,"teacher_disagreement_score":0.005026551,"about_ca_system_score_codex":0.0015275576,"about_ca_system_score_gemma":0.0013915627,"threshold_uncertainty_score":0.016815484},"labels":[],"label_agreement":null},{"id":"W2075457919","doi":"10.1016/j.jcss.2004.03.007","title":"A refined search tree technique for Dominating Set on planar graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Parameterized complexity; Vertex (graph theory); Independent set; Feedback vertex set; Planar graph; Discrete mathematics; Maximal independent set; Vertex cover; Time complexity; Chordal graph; Undirected graph; Graph; 1-planar graph","score_opus":0.04379541596315799,"score_gpt":0.331260597960581,"score_spread":0.287465181997423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075457919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017134385,0.00055465585,0.9787375,0.00019714457,0.00006911402,0.00017397068,0.00023848399,0.0005711879,0.0023236743],"genre_scores_gemma":[0.10903771,0.00059558824,0.88449395,0.00015869999,0.00009680997,0.00019750796,0.00074354344,0.0002992372,0.004376913],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985253,0.00037971427,0.000100849524,0.00025618591,0.00060108607,0.00013687924],"domain_scores_gemma":[0.99650925,0.0017786953,0.00015277218,0.0009012489,0.00054475165,0.00011318654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015772779,0.0007934795,0.0017621028,0.0027660695,0.0008088821,0.0012334466,0.002838049,0.001166033,0.004535197],"category_scores_gemma":[0.007490596,0.00086858793,0.0019180677,0.0035637363,0.0008490365,0.0037872454,0.0024711946,0.0021990864,0.0011164284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007451332,0.00038637724,0.0015739802,0.0012292775,0.00029878056,0.00031035626,0.0009449994,0.21359518,0.06543542,0.18224767,0.014647567,0.51858526],"study_design_scores_gemma":[0.00014614596,0.00031803313,0.0008233048,0.00008986198,0.00022389618,0.0003965127,0.00014174965,0.86489516,0.012731042,0.10600734,0.014166669,0.0000602154],"about_ca_topic_score_codex":0.0025467773,"about_ca_topic_score_gemma":0.004051043,"teacher_disagreement_score":0.004535197,"about_ca_system_score_codex":0.0009042701,"about_ca_system_score_gemma":0.0011299826,"threshold_uncertainty_score":0.015171766},"labels":[],"label_agreement":null},{"id":"W2075729213","doi":"10.1016/j.comgeo.2015.01.002","title":"Reprint of: Theta-3 is connected","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Austrian Science Fund","keywords":"Reprint; Graph; Computer science; Combinatorics; Connectivity; Mathematics; Physics","score_opus":0.0636802617194288,"score_gpt":0.3320432321922343,"score_spread":0.2683629704728055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075729213","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009532383,0.002065129,0.008848214,0.023568934,0.051986534,0.000039159375,0.0059787505,0.0009921388,0.8969889],"genre_scores_gemma":[0.26009905,0.003688185,0.0064518643,0.0074870205,0.02269215,0.00011272571,0.007924735,0.0022067055,0.68933755],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996542,0.00006255764,0.000024771007,0.00008625383,0.00011485193,0.000057408255],"domain_scores_gemma":[0.9986307,0.0005232195,0.00009938999,0.0002764933,0.00032420893,0.0001460246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023569562,0.0007661453,0.00075105904,0.0016538209,0.0016585294,0.0029663187,0.0008470623,0.001315436,0.2657263],"category_scores_gemma":[0.0032135944,0.00029753946,0.0006165906,0.0032699753,0.0014054284,0.0029250388,0.0010280071,0.0032809991,0.061383095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018198956,0.000023441655,0.0001502599,0.0002344453,0.000020880441,0.00024067117,0.00021906111,0.0002652532,0.0007221004,0.41227606,0.55199844,0.033667333],"study_design_scores_gemma":[0.000033849155,0.00002340043,0.000672788,0.000077017736,0.000017981884,0.00057060836,0.00020502579,0.00034130405,0.00076317537,0.2836006,0.71367735,0.000016783895],"about_ca_topic_score_codex":0.0008648125,"about_ca_topic_score_gemma":0.0012246975,"teacher_disagreement_score":0.2657263,"about_ca_system_score_codex":0.0011116925,"about_ca_system_score_gemma":0.0005783778,"threshold_uncertainty_score":0.888943},"labels":[],"label_agreement":null},{"id":"W2076192504","doi":"10.1016/s0020-0190(02)00364-2","title":"Parametric analysis of overall min-cuts and applications in undirected networks","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Minimum cut; Parametric statistics; Combinatorics; Maximum cut; Algorithm; Cut; Function (biology); Arc (geometry); Discrete mathematics; Ranging; Undirected graph; Computer science; Graph; Artificial intelligence; Geometry; Telecommunications; Statistics","score_opus":0.013917309012479045,"score_gpt":0.25349634715455605,"score_spread":0.239579038142077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076192504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080109276,0.0006972893,0.91487193,0.0003553275,0.000036858906,0.00005047239,0.00020808636,0.00017795074,0.0034928245],"genre_scores_gemma":[0.83908683,0.0014744417,0.15245643,0.00011350135,0.00027685886,0.00024608936,0.00057370705,0.00032868228,0.0054434454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980463,0.0008678807,0.00007669454,0.0004191297,0.00038604712,0.00020391036],"domain_scores_gemma":[0.9695011,0.0234324,0.002609568,0.0018016127,0.001906926,0.0007483946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004443536,0.0012785243,0.00180423,0.002908105,0.0009652265,0.0025049627,0.0042521995,0.0017388304,0.0047964845],"category_scores_gemma":[0.04388451,0.0012148138,0.0014073993,0.0038040823,0.0023408895,0.005587932,0.0026306966,0.003020115,0.0002994016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024131211,0.00009338719,0.0035264315,0.00023450216,0.00009590791,0.00014400063,0.00042922972,0.6646263,0.0026392115,0.24372911,0.0017130311,0.08252757],"study_design_scores_gemma":[0.000006947818,0.00006216309,0.0014822705,0.000027279302,0.000034834236,0.000109618784,0.00011907203,0.7488411,0.00058234675,0.24776259,0.00095053995,0.000021247755],"about_ca_topic_score_codex":0.0015971473,"about_ca_topic_score_gemma":0.0015713313,"teacher_disagreement_score":0.0047964845,"about_ca_system_score_codex":0.0012388439,"about_ca_system_score_gemma":0.0007344332,"threshold_uncertainty_score":0.023499966},"labels":[],"label_agreement":null},{"id":"W2076369652","doi":"10.1007/s004930100002","title":"Optimal Edge-Colourings for a Class of Planar Multigraphs","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Multigraph; Polytope; Discrete mathematics; Planar graph; Graph","score_opus":0.02340767389095119,"score_gpt":0.28925956485033,"score_spread":0.2658518909593788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076369652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72933996,0.0017660768,0.20876472,0.0025923082,0.00021113548,0.000245766,0.0014886317,0.0011899755,0.054401472],"genre_scores_gemma":[0.8489399,0.0022510386,0.12973918,0.0005979817,0.00026097414,0.00020783074,0.0016374442,0.00054643425,0.015819173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991509,0.00013797526,0.000049037662,0.00023148459,0.0001798418,0.00025068797],"domain_scores_gemma":[0.9968966,0.0016271506,0.00039868406,0.00050207163,0.00016136507,0.00041402687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008782608,0.0011654273,0.0013634118,0.0014407617,0.0018585286,0.0035747543,0.0018394958,0.0019463763,0.0080172485],"category_scores_gemma":[0.004359775,0.0011114454,0.0010452603,0.0022490711,0.001592951,0.0038762926,0.0019531138,0.002938758,0.0006464685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011336325,0.00070442166,0.0037606955,0.0008294079,0.00016790768,0.0004567842,0.0007695348,0.08133876,0.023647605,0.6909845,0.024268502,0.17193824],"study_design_scores_gemma":[0.00023861803,0.00016489888,0.0027046034,0.00009328932,0.00013440507,0.0004575705,0.00028783735,0.09571022,0.0052604894,0.8833721,0.0115299765,0.000045983055],"about_ca_topic_score_codex":0.0011906532,"about_ca_topic_score_gemma":0.0025594754,"teacher_disagreement_score":0.0080172485,"about_ca_system_score_codex":0.0020697825,"about_ca_system_score_gemma":0.00095743214,"threshold_uncertainty_score":0.026820362},"labels":[],"label_agreement":null},{"id":"W2076853283","doi":"10.5555/365411.365510","title":"Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)","year":2001,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Combinatorics; Chordal graph; Treewidth; Mathematics; 1-planar graph; Graph coloring; Indifference graph; Discrete mathematics; Clique-sum; Brooks' theorem; Pathwidth; Independent set; Edge coloring; Maximal independent set; Split graph; Bounded function; Graph; Line graph; Graph power","score_opus":0.04164874076968241,"score_gpt":0.3105006895413826,"score_spread":0.2688519487717002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076853283","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09517541,0.0013638455,0.8854513,0.0018827925,0.000124229,0.00033095144,0.00088640425,0.0020492226,0.012735865],"genre_scores_gemma":[0.3418513,0.0011326158,0.6457777,0.00035057135,0.000188659,0.00043901693,0.0028799975,0.00046954604,0.006910498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991202,0.00023805584,0.00003603324,0.00022764503,0.0001354186,0.0002426622],"domain_scores_gemma":[0.9977258,0.0015000864,0.0001869644,0.00034311033,0.00014142143,0.000102647544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010763566,0.001218708,0.000886664,0.00083695917,0.001399805,0.0022905902,0.00223838,0.001439707,0.0060125426],"category_scores_gemma":[0.004177895,0.00062819786,0.0012329814,0.0024429788,0.0013530827,0.004289984,0.002038722,0.0017670696,0.0014412963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009575795,0.00065344735,0.0017224493,0.0010003509,0.00014818832,0.00022908144,0.0007730526,0.47812003,0.013135763,0.22742118,0.032022372,0.24381652],"study_design_scores_gemma":[0.00034911468,0.00009960287,0.0006108512,0.0000459384,0.000052997857,0.00016121844,0.00015772205,0.69789994,0.0040500346,0.29035255,0.006192793,0.000027222299],"about_ca_topic_score_codex":0.009307893,"about_ca_topic_score_gemma":0.0109754,"teacher_disagreement_score":0.009307893,"about_ca_system_score_codex":0.0027189676,"about_ca_system_score_gemma":0.0017958388,"threshold_uncertainty_score":0.020113885},"labels":[],"label_agreement":null},{"id":"W2076955343","doi":"10.1016/j.disc.2013.07.018","title":"List-homomorphism problems on graphs and arc consistency","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Homomorphism; Mathematics; Semilattice; Combinatorics; Bipartite graph; Discrete mathematics; Graph homomorphism; Consistency (knowledge bases); Idempotence; Arc (geometry); Graph; Line graph; Voltage graph","score_opus":0.02610413603892978,"score_gpt":0.267608695764183,"score_spread":0.24150455972525323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076955343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21869113,0.0025844343,0.68274313,0.020983983,0.00064106676,0.00024171062,0.0018184988,0.0010295607,0.07126654],"genre_scores_gemma":[0.8166083,0.0028200722,0.13781689,0.0020513507,0.0012396934,0.0004430928,0.0024252764,0.00067572354,0.035919636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970757,0.0012645615,0.000159581,0.00060508744,0.0005344517,0.00036070705],"domain_scores_gemma":[0.9755164,0.01899588,0.0012520412,0.0020505674,0.001130132,0.0010550728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004312171,0.00091736193,0.0022679286,0.0019881213,0.003804391,0.0062278435,0.005820015,0.0048273844,0.01824675],"category_scores_gemma":[0.027795017,0.001390942,0.001883279,0.0063973316,0.0048262784,0.025652824,0.0053522983,0.0085948985,0.0013212073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007908126,0.00006190985,0.0003321669,0.000112554495,0.00001807915,0.00006324082,0.00028877193,0.0039392062,0.00021597101,0.9821047,0.003530923,0.009253352],"study_design_scores_gemma":[0.000029273166,0.000007718232,0.000060231847,0.00001302092,0.00001206466,0.000049237216,0.00011021143,0.0058626067,0.00022073304,0.99256974,0.0010567602,0.000008473763],"about_ca_topic_score_codex":0.0017373783,"about_ca_topic_score_gemma":0.0011334422,"teacher_disagreement_score":0.01824675,"about_ca_system_score_codex":0.0022915145,"about_ca_system_score_gemma":0.0019535394,"threshold_uncertainty_score":0.061041415},"labels":[],"label_agreement":null},{"id":"W2077159664","doi":"10.1016/j.disc.2010.03.034","title":"The complexity of locally injective homomorphisms","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Injective function; Digraph; Homomorphism; Mathematics; Combinatorics; Tournament; Vertex (graph theory); Discrete mathematics; Antichain; Graph; Partially ordered set","score_opus":0.037456553879670465,"score_gpt":0.30552801845569166,"score_spread":0.2680714645760212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077159664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.787567,0.0029402436,0.10497082,0.014264993,0.0002592704,0.00007495754,0.0015404532,0.00043635766,0.08794585],"genre_scores_gemma":[0.98025584,0.0011195315,0.0071089505,0.00038762725,0.0005403343,0.00009348064,0.0007376734,0.00011640546,0.00964012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964457,0.0009282178,0.0001679493,0.00066253915,0.0012228043,0.00057286216],"domain_scores_gemma":[0.9691686,0.024959732,0.00141563,0.0019558053,0.0009776545,0.0015225443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022847024,0.00086443074,0.0019151241,0.002672213,0.002357863,0.0083945,0.00344118,0.0024443227,0.011941858],"category_scores_gemma":[0.015613228,0.0010558708,0.0014164675,0.0032005874,0.006350029,0.027413767,0.0049911374,0.0067093363,0.0009197688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001811634,0.00008038786,0.0017859157,0.00012824156,0.000039452596,0.00011072924,0.000761902,0.005917915,0.00079691457,0.9791973,0.002435156,0.008564848],"study_design_scores_gemma":[0.000024757433,0.000012448357,0.0005147504,0.00000983436,0.000016703874,0.00007441322,0.00010362166,0.009158597,0.0003287504,0.9889159,0.0008242941,0.000015879565],"about_ca_topic_score_codex":0.0017265782,"about_ca_topic_score_gemma":0.0012083868,"teacher_disagreement_score":0.011941858,"about_ca_system_score_codex":0.0034065635,"about_ca_system_score_gemma":0.0012678324,"threshold_uncertainty_score":0.039949477},"labels":[],"label_agreement":null},{"id":"W2077203993","doi":"10.5555/338219.338231","title":"Weakly chordal graph algorithms via handles","year":2000,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Chordal graph; Algorithm; Graph; Theoretical computer science","score_opus":0.01185173105347955,"score_gpt":0.27164410304080705,"score_spread":0.2597923719873275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077203993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08970794,0.0008590531,0.83448756,0.002575716,0.0005825108,0.0005414442,0.0007822179,0.0045914277,0.065872185],"genre_scores_gemma":[0.54827,0.0010756179,0.40156925,0.0011038982,0.000832236,0.0011958088,0.0021588868,0.0025397784,0.04125455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955088,0.0010675533,0.00031985104,0.0010696354,0.0013689661,0.0006651754],"domain_scores_gemma":[0.9879736,0.006176192,0.00045116202,0.0036104876,0.00074377866,0.0010448059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028929862,0.0015831951,0.0030055386,0.002659206,0.0036216835,0.008698296,0.0063291737,0.0023668061,0.015164196],"category_scores_gemma":[0.014802046,0.0013102051,0.0023851534,0.0042622825,0.0032890614,0.013714231,0.017835144,0.006533889,0.004226431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011063338,0.0004310793,0.0011702774,0.00042495452,0.00011329359,0.00012383913,0.00096074946,0.016082026,0.0059721945,0.824084,0.0135319205,0.13599929],"study_design_scores_gemma":[0.00013668684,0.000102887265,0.00015480009,0.000043051543,0.00006408094,0.00008001499,0.00020724896,0.04950787,0.003850693,0.9357324,0.0100931665,0.000027138443],"about_ca_topic_score_codex":0.0010144226,"about_ca_topic_score_gemma":0.0016320079,"teacher_disagreement_score":0.015164196,"about_ca_system_score_codex":0.0029476844,"about_ca_system_score_gemma":0.0020305696,"threshold_uncertainty_score":0.050729275},"labels":[],"label_agreement":null},{"id":"W2077761942","doi":"10.1016/j.jcss.2005.02.003","title":"Kernels in planar digraphs","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Digraph; Combinatorics; Kernel (algebra); Vertex (graph theory); Mathematics; Planar; Set (abstract data type); Discrete mathematics; Computer science; Graph","score_opus":0.02316245338529533,"score_gpt":0.29162058749459785,"score_spread":0.2684581341093025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077761942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7882263,0.0006168362,0.16754995,0.0010246508,0.00012961417,0.0001271187,0.0006825824,0.00096387183,0.040679093],"genre_scores_gemma":[0.9628567,0.00052998646,0.016959889,0.00014533417,0.00006836497,0.00005507327,0.00036828557,0.00014736081,0.018868944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958163,0.00006705012,0.000030244635,0.000103564824,0.000097157186,0.00012036711],"domain_scores_gemma":[0.99705195,0.00127697,0.0005117678,0.00021052141,0.00031066113,0.00063803676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032430474,0.0004557484,0.0009201316,0.002547188,0.0013359975,0.0031346346,0.001031062,0.0011585134,0.0073854937],"category_scores_gemma":[0.0035862036,0.0006754565,0.000667022,0.0018295331,0.0013420027,0.003976062,0.0017768678,0.0015435419,0.0010621899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011852183,0.00009679191,0.0012622717,0.00014895087,0.000023632361,0.00033931973,0.00067208824,0.007246508,0.0021333473,0.96740997,0.0031553647,0.017393418],"study_design_scores_gemma":[0.000037482394,0.00003105083,0.0007831658,0.00002464035,0.000031160023,0.0003617004,0.00034315835,0.031612262,0.0009290719,0.9624391,0.0033846656,0.000022375187],"about_ca_topic_score_codex":0.0023296324,"about_ca_topic_score_gemma":0.002495087,"teacher_disagreement_score":0.0073854937,"about_ca_system_score_codex":0.0012771831,"about_ca_system_score_gemma":0.0005353155,"threshold_uncertainty_score":0.02470696},"labels":[],"label_agreement":null},{"id":"W2077948344","doi":"10.1017/s0013091514000455","title":"Computational Complexity of Topological Invariants","year":2014,"lang":"en","type":"article","venue":"Proceedings of the Edinburgh Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computational complexity theory; Topological complexity; Reduction (mathematics); Mathematics; Space (punctuation); Graph; Theoretical computer science; Combinatorics; Discrete mathematics; Computer science; Algorithm; Pure mathematics; Geometry","score_opus":0.04770772190545817,"score_gpt":0.29962590540659545,"score_spread":0.25191818350113726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077948344","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80768085,0.001190471,0.12562366,0.018117528,0.00022618764,0.0002051914,0.0059431605,0.0012595922,0.03975335],"genre_scores_gemma":[0.97616255,0.00024002475,0.017692646,0.00040196042,0.00020506415,0.0001494746,0.0021843887,0.00016625776,0.0027976846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945574,0.0015677507,0.00029303558,0.0013742256,0.0012823388,0.0009252535],"domain_scores_gemma":[0.96224034,0.029593322,0.0016044411,0.004294606,0.0012156903,0.0010517221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025713462,0.00066468323,0.0018630187,0.0016316109,0.0019250463,0.009749763,0.0037863893,0.0023636322,0.013015222],"category_scores_gemma":[0.022447068,0.00063243456,0.0017804845,0.0028129271,0.0047519715,0.014861763,0.0039710435,0.0039958255,0.00092172733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012796007,0.00032354624,0.0075980453,0.00075462036,0.00019815553,0.0002815657,0.001120344,0.08658515,0.003993209,0.8480341,0.01537389,0.03445781],"study_design_scores_gemma":[0.00008894857,0.000037090704,0.0010381597,0.000027814353,0.00004676656,0.00010944033,0.00022888402,0.15210396,0.0015343694,0.8427356,0.0020183702,0.000030607785],"about_ca_topic_score_codex":0.0022007485,"about_ca_topic_score_gemma":0.0019537134,"teacher_disagreement_score":0.013015222,"about_ca_system_score_codex":0.0038771257,"about_ca_system_score_gemma":0.0025018204,"threshold_uncertainty_score":0.04354024},"labels":[],"label_agreement":null},{"id":"W2079074189","doi":"10.1016/j.endm.2013.10.053","title":"Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs","year":2013,"lang":"nl","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Strong perfect graph theorem; Bipartite graph; Operator (biology); Characterization (materials science); Conjecture; Discrete mathematics; Chordal graph; 1-planar graph; Graph","score_opus":0.01201657952695493,"score_gpt":0.27144248370935536,"score_spread":0.2594259041824004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079074189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7312559,0.0011364672,0.080880135,0.0046397033,0.00073130836,0.00007560096,0.00042114544,0.00054502016,0.18031476],"genre_scores_gemma":[0.9811828,0.0002892157,0.007281246,0.00040797234,0.00030061693,0.00003535786,0.00014383646,0.00005429012,0.010304567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949145,0.00010635228,0.000027888807,0.00008561316,0.00017217004,0.000116535084],"domain_scores_gemma":[0.9992028,0.00021738965,0.00010990536,0.0001289145,0.00011880941,0.00022227723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007353654,0.00044763874,0.0009288662,0.0019199263,0.0023441012,0.002741131,0.0011260428,0.0013116621,0.005920701],"category_scores_gemma":[0.0018847783,0.00034493313,0.0008082665,0.0009872862,0.0032551624,0.0032529552,0.0018766855,0.001975195,0.00044646428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008611635,0.000007728252,0.000054093398,0.00000798402,0.0000023402924,0.000037406815,0.00004933868,0.00030095413,0.00020845605,0.9982346,0.00035248004,0.0007360298],"study_design_scores_gemma":[0.0000066503108,0.0000043738096,0.00006428829,0.00000389773,0.0000017811254,0.000044759963,0.000041685238,0.0023133757,0.000073385854,0.9969415,0.0005000991,0.0000041729486],"about_ca_topic_score_codex":0.002348528,"about_ca_topic_score_gemma":0.0020716537,"teacher_disagreement_score":0.005920701,"about_ca_system_score_codex":0.001349701,"about_ca_system_score_gemma":0.0011446587,"threshold_uncertainty_score":0.019806743},"labels":[],"label_agreement":null},{"id":"W2079295608","doi":"10.1016/j.disc.2005.12.035","title":"Matrix partitions of perfect graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matrix (chemical analysis); Discrete mathematics","score_opus":0.016787369410474616,"score_gpt":0.303388922085106,"score_spread":0.2866015526746314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079295608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7442579,0.0009273181,0.13762188,0.0016857636,0.0003884573,0.00012992632,0.0012193854,0.00056268135,0.11320664],"genre_scores_gemma":[0.95701915,0.00042996253,0.016814109,0.00030153582,0.00025844268,0.00010971335,0.00084779056,0.00016282235,0.024056392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931705,0.00017476862,0.000034970097,0.00012442275,0.00018112797,0.00016763009],"domain_scores_gemma":[0.9981931,0.0007285798,0.0003226837,0.00022901874,0.00020589771,0.00032070337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050502556,0.00051930314,0.0006363201,0.0019138604,0.0015115314,0.003261662,0.0008487048,0.0009237952,0.010270477],"category_scores_gemma":[0.0028705741,0.00055732176,0.00050628884,0.0013586611,0.0015212195,0.0028307254,0.001313951,0.0010578673,0.0010448577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010689072,0.00002334086,0.000215663,0.000046428668,0.000009398264,0.00007255932,0.00024714193,0.0025957385,0.0020921642,0.98640615,0.0030314182,0.005153116],"study_design_scores_gemma":[0.000024746954,0.00002254136,0.00043755557,0.000014790404,0.0000099582285,0.00010426868,0.00016169314,0.009630296,0.0009044505,0.98563933,0.003037058,0.0000132911],"about_ca_topic_score_codex":0.00088699284,"about_ca_topic_score_gemma":0.0015038155,"teacher_disagreement_score":0.010270477,"about_ca_system_score_codex":0.00093314267,"about_ca_system_score_gemma":0.0004757967,"threshold_uncertainty_score":0.034358144},"labels":[],"label_agreement":null},{"id":"W2079313211","doi":"10.1016/j.jalgor.2004.02.001","title":"The dominating set problem is fixed parameter tractable for graphs of bounded genus","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Victoria","funders":"","keywords":"Bounded function; Mathematics; Combinatorics; Genus; Planar graph; Maximal independent set; Dominating set; Discrete mathematics; Set (abstract data type); Planar; Pathwidth; Chordal graph; 1-planar graph; Graph; Computer science; Line graph","score_opus":0.029409478559451214,"score_gpt":0.31751576923085983,"score_spread":0.28810629067140864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079313211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35343346,0.0030454353,0.5834812,0.017870594,0.0004166491,0.00063563464,0.0044376794,0.0027058665,0.033973493],"genre_scores_gemma":[0.88752985,0.0020673198,0.093691796,0.0011246395,0.00050615636,0.0006409017,0.0032793754,0.0010988209,0.010061255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939733,0.001726135,0.00028880718,0.0017684626,0.001056172,0.0011871192],"domain_scores_gemma":[0.9497848,0.039760668,0.0028465702,0.004899869,0.0011486955,0.0015594168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005410391,0.0026374839,0.0066724606,0.0020151725,0.0033187792,0.011721704,0.0068592452,0.00441841,0.008042263],"category_scores_gemma":[0.04245352,0.0023547816,0.0034999975,0.0047814604,0.004835324,0.02252527,0.0054792124,0.008321325,0.0011858897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002644379,0.0006937794,0.003860446,0.0016296798,0.0005840788,0.000700853,0.0013968786,0.5924103,0.007828128,0.31657594,0.021897748,0.049777757],"study_design_scores_gemma":[0.0002892918,0.00009639654,0.00044920677,0.000080171725,0.00018749041,0.00027019533,0.00028984636,0.41336426,0.0020455744,0.5798382,0.0030483431,0.000040944466],"about_ca_topic_score_codex":0.004508059,"about_ca_topic_score_gemma":0.005988204,"teacher_disagreement_score":0.011721704,"about_ca_system_score_codex":0.0072146803,"about_ca_system_score_gemma":0.004382796,"threshold_uncertainty_score":0.05234641},"labels":[],"label_agreement":null},{"id":"W2079531625","doi":"10.1007/s00373-013-1306-z","title":"On the Roots of Domination Polynomials","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Bipartite graph; Limiting; Closure (psychology); Order (exchange); Graph; Plane (geometry); Discrete mathematics; Vertex (graph theory); Geometry","score_opus":0.012877419538516972,"score_gpt":0.24061513584615798,"score_spread":0.227737716307641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079531625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4390591,0.0065621776,0.21021956,0.009412669,0.0008130234,0.00006944435,0.0005850361,0.000441055,0.33283794],"genre_scores_gemma":[0.946195,0.0029515622,0.012964594,0.00053703424,0.00090927654,0.00004630688,0.0002507328,0.00016501191,0.035980552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933726,0.0001787539,0.00001657773,0.000111804155,0.00018035872,0.0001752191],"domain_scores_gemma":[0.9952578,0.003517419,0.00029620613,0.00029229437,0.0003409497,0.00029530807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008278093,0.0006193276,0.0008344388,0.0021817717,0.0015349224,0.0021365606,0.0010861647,0.0009935764,0.010173038],"category_scores_gemma":[0.008664157,0.0004297888,0.0004410927,0.0025856332,0.0036150855,0.004921574,0.0020775748,0.0038151208,0.0015522076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004827033,0.000025714975,0.00033979316,0.000053560987,0.00000616971,0.000068732035,0.00033522674,0.0034279441,0.00072844053,0.9733224,0.0034766719,0.018167045],"study_design_scores_gemma":[0.00000891236,0.0000051513334,0.00018189441,0.000015317915,0.0000036792103,0.00004419891,0.00006206507,0.0041051432,0.00017654728,0.9925107,0.002878973,0.00000740298],"about_ca_topic_score_codex":0.001962531,"about_ca_topic_score_gemma":0.002478222,"teacher_disagreement_score":0.010173038,"about_ca_system_score_codex":0.0014900033,"about_ca_system_score_gemma":0.0006982703,"threshold_uncertainty_score":0.034032226},"labels":[],"label_agreement":null},{"id":"W2079563996","doi":"10.1016/s0166-218x(03)00395-0","title":"Stable sets in two subclasses of banner-free graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Banner; Mathematics; Combinatorics; Chordal graph; Cograph; Characterization (materials science); Indifference graph; Discrete mathematics; Class (philosophy); Graph; Split graph; Maximal independent set; Time complexity; 1-planar graph; Computer science; Artificial intelligence","score_opus":0.022515680311258036,"score_gpt":0.3050782653327763,"score_spread":0.28256258502151826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079563996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8511673,0.0008092355,0.06614744,0.0014040797,0.00011129191,0.00011670814,0.00066010666,0.000307529,0.079276286],"genre_scores_gemma":[0.9741048,0.00036889248,0.012395878,0.00026996422,0.000089417335,0.00011009245,0.0008401504,0.00008633546,0.011734565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991621,0.00011458102,0.000059379883,0.00024219287,0.00025321177,0.0001685511],"domain_scores_gemma":[0.9973248,0.0013599615,0.00030422208,0.0002661816,0.00026769578,0.00047703506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067587086,0.00048800177,0.0010480504,0.002855809,0.0030858873,0.0040200315,0.0018870706,0.0017798999,0.0067211427],"category_scores_gemma":[0.0028480876,0.0009122429,0.0010584242,0.0021002637,0.0024284523,0.0045407373,0.0020749182,0.002064795,0.0005300875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014260384,0.00008043214,0.0014443812,0.00006332782,0.000023383838,0.00023621976,0.00097410183,0.001256594,0.002522577,0.98651254,0.0012849312,0.005458903],"study_design_scores_gemma":[0.00005289199,0.000024246014,0.00200993,0.000029857882,0.000035831545,0.00040041216,0.00058989134,0.008767029,0.0014609513,0.98289514,0.00370877,0.000025069856],"about_ca_topic_score_codex":0.002155178,"about_ca_topic_score_gemma":0.0028728612,"teacher_disagreement_score":0.0067211427,"about_ca_system_score_codex":0.001358601,"about_ca_system_score_gemma":0.0005015203,"threshold_uncertainty_score":0.022484422},"labels":[],"label_agreement":null},{"id":"W2079618965","doi":"10.1016/s0095-8956(02)00046-1","title":"On the excluded minors for the matroids of branch-width k","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Class (philosophy); Mathematics; Computer science; Artificial intelligence","score_opus":0.018968047861716613,"score_gpt":0.27656494701472645,"score_spread":0.2575968991530098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079618965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80242306,0.0012690872,0.12729114,0.0028906171,0.0003012043,0.00016489696,0.0011544519,0.00035742167,0.06414804],"genre_scores_gemma":[0.94200146,0.00094071473,0.032234598,0.00048312865,0.00065549,0.00017196208,0.0013791888,0.00026817876,0.021865258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991404,0.0002722786,0.0000604814,0.00016208678,0.00020660752,0.00015810932],"domain_scores_gemma":[0.9930506,0.003992796,0.00096673873,0.000420318,0.0005461012,0.0010235629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013409206,0.0011825423,0.0010963468,0.0021246993,0.0023821127,0.005287708,0.0019772868,0.0019328429,0.010745357],"category_scores_gemma":[0.008572548,0.0011506485,0.0012798955,0.0016245216,0.003183936,0.0052861357,0.0020554038,0.003249583,0.0014646993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036169382,0.00012120206,0.0018425137,0.000120038276,0.000031994077,0.00026647712,0.00096853933,0.003443518,0.0033397563,0.9722853,0.005335834,0.011883117],"study_design_scores_gemma":[0.000049119106,0.000044726014,0.0007915946,0.000029122873,0.000016930358,0.0002905498,0.0002536411,0.013290445,0.0005941488,0.981437,0.003180462,0.000022382646],"about_ca_topic_score_codex":0.0015255683,"about_ca_topic_score_gemma":0.002081115,"teacher_disagreement_score":0.010745357,"about_ca_system_score_codex":0.0013343387,"about_ca_system_score_gemma":0.00069884915,"threshold_uncertainty_score":0.035946786},"labels":[],"label_agreement":null},{"id":"W2080300451","doi":"10.1016/j.dam.2011.10.013","title":"Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Clique-sum; Random graph; Partial k-tree; Chordal graph; 1-planar graph; Vertex (graph theory); Discrete mathematics; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.020404195276392634,"score_gpt":0.2513674268184035,"score_spread":0.23096323154201087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080300451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76950526,0.004416769,0.20824708,0.0041316934,0.00008395001,0.000085078376,0.0012286447,0.00041210765,0.011889392],"genre_scores_gemma":[0.97979695,0.0017471189,0.014351181,0.000336287,0.00020505257,0.0001249798,0.00072259153,0.00014263303,0.0025732322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979236,0.00083704886,0.00009295852,0.00048686922,0.00040560967,0.0002539146],"domain_scores_gemma":[0.9627995,0.026875796,0.0047267266,0.002499606,0.0015190248,0.0015792701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004943077,0.00074716844,0.0019071512,0.003144771,0.0016095188,0.0037349127,0.0038180542,0.0016536012,0.0035620318],"category_scores_gemma":[0.030539416,0.0012514312,0.001031853,0.0036943515,0.0029584754,0.009423702,0.0021464855,0.002817694,0.00037398524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003387056,0.00010754945,0.006779609,0.00018680927,0.00012926481,0.0001992249,0.0008069225,0.06724839,0.0020401662,0.9030114,0.0041983975,0.014953516],"study_design_scores_gemma":[0.00007482045,0.000037901504,0.0021835784,0.000041625666,0.00006969605,0.0003349268,0.00025584945,0.18862589,0.00072536274,0.80553615,0.0020778999,0.00003622866],"about_ca_topic_score_codex":0.0014473784,"about_ca_topic_score_gemma":0.0015752998,"teacher_disagreement_score":0.004943077,"about_ca_system_score_codex":0.0021076018,"about_ca_system_score_gemma":0.00084256724,"threshold_uncertainty_score":0.026141763},"labels":[],"label_agreement":null},{"id":"W2080513783","doi":"10.1016/j.ecj.2006.06.009","title":"K 5 -free bound for the class of planar graphs","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Vertex (graph theory); Outerplanar graph; Homomorphism; Discrete mathematics; Line graph; Pathwidth","score_opus":0.022848952033645193,"score_gpt":0.28644739144764986,"score_spread":0.2635984394140047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080513783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.568266,0.0045423973,0.23506881,0.0053644297,0.0003173531,0.00020885454,0.005127014,0.0026722448,0.17843285],"genre_scores_gemma":[0.94685364,0.0014934964,0.022507444,0.0008212136,0.00030498707,0.0002572656,0.0037914088,0.00036689272,0.023603544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810696,0.00014482562,0.000087860455,0.0006589987,0.00042408472,0.0005773518],"domain_scores_gemma":[0.9944547,0.0028668696,0.0006133101,0.0006129272,0.00040709454,0.0010450672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009998787,0.0011844859,0.0013355376,0.0033300032,0.003039287,0.004760969,0.0036468585,0.0015609078,0.024549857],"category_scores_gemma":[0.0052177836,0.0010823997,0.0017145926,0.0022878011,0.002903663,0.006392411,0.0047704093,0.0032003394,0.0027820189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005922258,0.00015739154,0.0041879774,0.00054293475,0.00014933455,0.000523443,0.0010457082,0.010828855,0.005510405,0.9314334,0.016893491,0.02813503],"study_design_scores_gemma":[0.000109351844,0.00010750311,0.004089802,0.00011984722,0.00018509146,0.001006227,0.00031243046,0.024795502,0.00501447,0.9330153,0.031145383,0.000099046905],"about_ca_topic_score_codex":0.0036367208,"about_ca_topic_score_gemma":0.002256579,"teacher_disagreement_score":0.024549857,"about_ca_system_score_codex":0.0027352194,"about_ca_system_score_gemma":0.0009854429,"threshold_uncertainty_score":0.08212751},"labels":[],"label_agreement":null},{"id":"W2080527130","doi":"10.1016/s0024-3795(00)00088-4","title":"P-matrix completions under weak symmetry assumptions","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Symmetric matrix; Combinatorics; Nonnegative matrix; Matrix (chemical analysis); Sign (mathematics); Hollow matrix; Involutory matrix; Integer matrix; Centrosymmetric matrix; Pascal matrix; Square matrix; Skew-symmetric matrix; Block matrix; Discrete mathematics; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.02234872726635052,"score_gpt":0.315504700188579,"score_spread":0.2931559729222285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080527130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1720703,0.00065055164,0.6685363,0.006216909,0.00084000337,0.00022878757,0.0017176619,0.00097022176,0.14876916],"genre_scores_gemma":[0.83984804,0.0009902165,0.073118776,0.0017053598,0.0015099043,0.000385435,0.0016647753,0.00059919676,0.08017837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977921,0.0006766814,0.00010735783,0.00046587887,0.0006004219,0.00035749853],"domain_scores_gemma":[0.9941049,0.002196026,0.00067239313,0.001015326,0.0010650281,0.00094638614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024095238,0.0010578803,0.0010869374,0.0015664465,0.0021393958,0.0036140243,0.001635666,0.001471067,0.013391854],"category_scores_gemma":[0.0074326457,0.0007730438,0.001422034,0.0016560993,0.003479973,0.009748451,0.0037561131,0.0050077867,0.0030616596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004217578,0.000034483655,0.000045740835,0.000022585253,0.0000053549456,0.000042238695,0.00008973805,0.00045163275,0.00043756198,0.9940017,0.0024761504,0.0023506775],"study_design_scores_gemma":[0.000013700901,0.000012813318,0.0000467986,0.0000030675892,0.000002479223,0.000059003127,0.00002880018,0.0029907562,0.0002640942,0.9954839,0.0010873823,0.000007199118],"about_ca_topic_score_codex":0.0006975992,"about_ca_topic_score_gemma":0.00047968893,"teacher_disagreement_score":0.013391854,"about_ca_system_score_codex":0.00077576196,"about_ca_system_score_gemma":0.0012628278,"threshold_uncertainty_score":0.044800222},"labels":[],"label_agreement":null},{"id":"W2080754473","doi":"10.1016/j.dam.2011.03.017","title":"Acyclic chromatic indices of planar graphs with large girth","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Edge coloring; Mathematics; Girth (graph theory); Planar graph; Directed acyclic graph; Graph; Chromatic scale; Discrete mathematics; Graph power; Line graph","score_opus":0.023512222786875547,"score_gpt":0.25689347813527696,"score_spread":0.23338125534840143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080754473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9394887,0.00039530903,0.028534682,0.0005272449,0.000063898035,0.00004608578,0.00076836976,0.00030347053,0.029872242],"genre_scores_gemma":[0.9827608,0.00036084506,0.01201058,0.00010076879,0.00008847591,0.00008364813,0.0006778313,0.00013758271,0.0037795398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960214,0.000094643656,0.000022299879,0.00007666699,0.00010826833,0.0000959434],"domain_scores_gemma":[0.99425757,0.0031205541,0.001005433,0.0004858689,0.00052998186,0.00060057733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063440984,0.00045192175,0.0005474743,0.0033764506,0.0014300586,0.0029580786,0.0013800813,0.0009991132,0.00569488],"category_scores_gemma":[0.0058232658,0.0007655019,0.0003485476,0.0027251588,0.0014648143,0.0023188784,0.0012400693,0.0014874211,0.0005677422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006341095,0.00014844991,0.012424268,0.00019739135,0.00004565309,0.00028929304,0.0009262733,0.024619704,0.017597966,0.8986239,0.007860078,0.03663289],"study_design_scores_gemma":[0.00010056989,0.0000868119,0.009119992,0.0000524211,0.000080985374,0.00039492143,0.000648103,0.07582224,0.00515144,0.90256345,0.0059237746,0.000055328343],"about_ca_topic_score_codex":0.0014716008,"about_ca_topic_score_gemma":0.003326003,"teacher_disagreement_score":0.00569488,"about_ca_system_score_codex":0.0013810114,"about_ca_system_score_gemma":0.0008779655,"threshold_uncertainty_score":0.019051254},"labels":[],"label_agreement":null},{"id":"W2081110589","doi":"10.1016/j.disc.2015.01.034","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>-Degree free spanning forests in graphs","year":2015,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Honjo International Scholarship Foundation","keywords":"Combinatorics; Mathematics; Degree (music); Spanning tree; Minimum degree spanning tree; Connected dominating set; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.034849909263913265,"score_gpt":0.27708938093796787,"score_spread":0.2422394716740546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081110589","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001963601,0.0003868376,0.12913074,0.0056436737,0.001457415,0.0003937147,0.19402672,0.14726235,0.519735],"genre_scores_gemma":[0.027457949,0.001562337,0.11343408,0.002357637,0.00096474134,0.0007709911,0.24102929,0.12753555,0.4848874],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999458,0.00008705687,0.000055285072,0.00009722005,0.0002354475,0.000066995555],"domain_scores_gemma":[0.9977003,0.00062229246,0.00013376522,0.0005249759,0.0007547015,0.00026398592],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082471786,0.0015774559,0.0012913517,0.0021892649,0.0010501806,0.0054576593,0.0031251425,0.0015922405,0.67955345],"category_scores_gemma":[0.0051153526,0.001060352,0.0010197992,0.0041217795,0.0006789368,0.005064105,0.0026689034,0.002583063,0.58948374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004924717,0.000025928824,0.00013957298,0.00017430905,0.0000066089274,0.000033558554,0.000069563124,0.0002952633,0.0008586074,0.01848733,0.9480393,0.03182062],"study_design_scores_gemma":[0.00004430362,0.000013144372,0.0006756755,0.00007077073,0.0000063975267,0.00011638169,0.0000607113,0.0022148674,0.0028065767,0.023976553,0.9699827,0.000032026368],"about_ca_topic_score_codex":0.007581614,"about_ca_topic_score_gemma":0.009793503,"teacher_disagreement_score":0.67955345,"about_ca_system_score_codex":0.0025263291,"about_ca_system_score_gemma":0.0013238165,"threshold_uncertainty_score":0.4570781},"labels":[],"label_agreement":null},{"id":"W2081191210","doi":"10.1016/j.ejc.2013.06.023","title":"Obstructions to locally injective oriented improper colourings","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Injective function; Mathematics; Substructure; Combinatorics; Time complexity; Decision problem; Discrete mathematics; Algorithm","score_opus":0.010618255854592492,"score_gpt":0.23893658910515012,"score_spread":0.22831833325055761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081191210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7836333,0.00040045654,0.06873111,0.001806252,0.0004687485,0.00010452852,0.00032701038,0.0013682056,0.14316027],"genre_scores_gemma":[0.96994823,0.00030493928,0.0059375796,0.00024205669,0.00016151724,0.000059742288,0.00024019426,0.00041867082,0.022687035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975696,0.00035459883,0.0001299506,0.00030575471,0.0007285529,0.0009115414],"domain_scores_gemma":[0.9940329,0.002840055,0.00060876383,0.00086888974,0.00035136717,0.001298082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012763554,0.0011232606,0.0012264415,0.0028248096,0.0038353882,0.0056031034,0.0017414446,0.0024105406,0.01496308],"category_scores_gemma":[0.006236127,0.001488566,0.001647042,0.002325626,0.0056161657,0.0056751096,0.009472018,0.0059655854,0.0017402257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012835154,0.000092674134,0.0013527845,0.00007484623,0.00001695586,0.00080044183,0.0013142646,0.0012170045,0.0022994813,0.9868123,0.0017482166,0.004142804],"study_design_scores_gemma":[0.00006910822,0.000026881175,0.0011850062,0.00003439083,0.0000542629,0.0005541381,0.00061660126,0.0041553206,0.0021981485,0.9849978,0.006060777,0.000047595044],"about_ca_topic_score_codex":0.001607456,"about_ca_topic_score_gemma":0.0019403083,"teacher_disagreement_score":0.01496308,"about_ca_system_score_codex":0.0015829931,"about_ca_system_score_gemma":0.0007373717,"threshold_uncertainty_score":0.050056517},"labels":[],"label_agreement":null},{"id":"W2081625090","doi":"10.1016/j.disc.2014.03.006","title":"Edge-critical cops and robber in planar graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.01873342575711553,"score_gpt":0.30105570400728,"score_spread":0.2823222782501645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081625090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7139003,0.0023732048,0.16588421,0.0034791655,0.00031107283,0.00018500359,0.0005796882,0.0006340595,0.11265324],"genre_scores_gemma":[0.952564,0.0010094233,0.019213103,0.00038665687,0.00020683682,0.00010383719,0.00046177444,0.00022254609,0.025831861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934965,0.00013000828,0.000023958757,0.00015402056,0.0001332783,0.00020902493],"domain_scores_gemma":[0.9966413,0.001642299,0.0005640014,0.00022423784,0.00029542597,0.0006327287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064037775,0.00090480916,0.001699388,0.0026725356,0.0030792493,0.0033037756,0.0017402413,0.0024753355,0.011993296],"category_scores_gemma":[0.0065165106,0.0011314949,0.0008071839,0.0019102622,0.003898078,0.0048093665,0.002919018,0.002510731,0.001145992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013592519,0.00005993032,0.0007037393,0.00016778837,0.000020263351,0.0003183414,0.0005032231,0.008661546,0.001242224,0.97419226,0.0056484225,0.008346318],"study_design_scores_gemma":[0.000038915805,0.000029034456,0.0005477772,0.00003730975,0.000022204496,0.0002744101,0.00043723767,0.022997469,0.00086627365,0.97020054,0.0045280154,0.000020704329],"about_ca_topic_score_codex":0.0029946594,"about_ca_topic_score_gemma":0.003073062,"teacher_disagreement_score":0.011993296,"about_ca_system_score_codex":0.0010946472,"about_ca_system_score_gemma":0.00074066094,"threshold_uncertainty_score":0.040121555},"labels":[],"label_agreement":null},{"id":"W2081923266","doi":"10.1016/j.disopt.2005.11.001","title":"Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Edmond de Rothschild Foundation; University of Haifa","keywords":"Digraph; Combinatorics; Mathematics; Disjoint sets; Transitive relation; Vertex (graph theory); Discrete mathematics; Time complexity; Graph","score_opus":0.010924037940400132,"score_gpt":0.2639048718195904,"score_spread":0.25298083387919024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081923266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6039449,0.00041605456,0.38478726,0.0005140217,0.000064844506,0.0002567594,0.001285538,0.00038956103,0.008341034],"genre_scores_gemma":[0.78730744,0.0003657086,0.20130406,0.00017777456,0.000046614394,0.0002051372,0.0015396511,0.0002277161,0.008825887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994549,0.0001538443,0.00003378087,0.00017175343,0.00008910978,0.00009655872],"domain_scores_gemma":[0.99525285,0.0031218522,0.0004496333,0.00041336313,0.00030679014,0.0004554611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089633313,0.0011153101,0.0016674561,0.0020664306,0.0010873553,0.0021771332,0.0019239079,0.0013115323,0.005562891],"category_scores_gemma":[0.0059163556,0.0012326504,0.00108259,0.0019967165,0.0010877858,0.0038043098,0.001524634,0.00158139,0.0003739166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011228609,0.00062544853,0.006453107,0.0011701065,0.00036130482,0.00075087795,0.00103203,0.4009295,0.010134067,0.4409981,0.0083185155,0.12810393],"study_design_scores_gemma":[0.00010728362,0.00013091683,0.0008426612,0.00007117749,0.00007745277,0.00013236543,0.0002427657,0.5455662,0.0026607856,0.44855675,0.0015852936,0.000026433881],"about_ca_topic_score_codex":0.0027828682,"about_ca_topic_score_gemma":0.0063097016,"teacher_disagreement_score":0.005562891,"about_ca_system_score_codex":0.0012396076,"about_ca_system_score_gemma":0.0011230242,"threshold_uncertainty_score":0.018609762},"labels":[],"label_agreement":null},{"id":"W2082259377","doi":"10.1002/net.21590","title":"Formulations and exact solution approaches for the degree preserving spanning tree problem","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Spanning tree; Degree (music); Minimum spanning tree; Mathematical optimization; Tree (set theory); Mathematics; Computer science; Minimum degree spanning tree; Distributed minimum spanning tree; Combinatorics","score_opus":0.22542077035339705,"score_gpt":0.3143817814222265,"score_spread":0.08896101106882945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082259377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002655867,0.00046491897,0.99229324,0.00024141563,0.000032585485,0.00009232761,0.00009986889,0.00008818444,0.004031612],"genre_scores_gemma":[0.0789391,0.0019493189,0.91520643,0.00021947372,0.00014406207,0.0004711377,0.00048922264,0.00012857962,0.0024526864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788374,0.00077393034,0.00012941977,0.0003044135,0.0007030291,0.00020548029],"domain_scores_gemma":[0.9969259,0.0020309074,0.00029656678,0.00031784005,0.00035866932,0.00007018417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027502093,0.0019284328,0.0009946086,0.0012861063,0.0006938279,0.002813861,0.0022641434,0.0017726151,0.00623301],"category_scores_gemma":[0.009639959,0.00094699935,0.001306014,0.00258785,0.0010786986,0.004054203,0.0018091835,0.004204781,0.0008638708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008196949,0.00022673009,0.00039980852,0.00044714005,0.000051763276,0.0000798078,0.00018341544,0.5727537,0.0017203449,0.27801538,0.004380669,0.14165927],"study_design_scores_gemma":[0.000039636434,0.000055906457,0.00010045529,0.000063743995,0.000023487819,0.00006592645,0.00008366574,0.8426584,0.0011752974,0.15052705,0.005190363,0.00001606215],"about_ca_topic_score_codex":0.0025240711,"about_ca_topic_score_gemma":0.0030927204,"teacher_disagreement_score":0.00623301,"about_ca_system_score_codex":0.0019198403,"about_ca_system_score_gemma":0.0026054806,"threshold_uncertainty_score":0.020851493},"labels":[],"label_agreement":null},{"id":"W2082273344","doi":"10.1016/s0304-3975(02)00577-7","title":"On the k-path partition of graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Indifference graph; Longest path problem; Discrete mathematics; Bipartite graph; Cograph; Pathwidth; Hamiltonian path problem; Complete bipartite graph; Partition (number theory); Frequency partition of a graph; Hamiltonian path; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.017306891891451286,"score_gpt":0.28038951099357523,"score_spread":0.26308261910212394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082273344","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7016447,0.0021103285,0.18987915,0.003538862,0.00034950822,0.00016581283,0.0019656015,0.00045466266,0.09989133],"genre_scores_gemma":[0.9174067,0.0022249403,0.045298614,0.0007707077,0.00063373166,0.00024823964,0.003881537,0.00052129297,0.029014206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991115,0.0002608751,0.000036738005,0.00019476078,0.0001840955,0.00021208085],"domain_scores_gemma":[0.9961068,0.0023018455,0.00039373754,0.000489263,0.00027607923,0.00043219695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086996774,0.00088103814,0.0015377919,0.0023491147,0.0028248765,0.004203948,0.0017838513,0.0017281175,0.014798152],"category_scores_gemma":[0.0060677053,0.00090316875,0.0009625889,0.0036162108,0.0034686099,0.008397033,0.0029307783,0.0028753087,0.0019846617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041178236,0.00006513715,0.0012319975,0.00017816095,0.000032525662,0.00015557787,0.0010245452,0.013817813,0.0019251109,0.94942826,0.009774955,0.021954058],"study_design_scores_gemma":[0.00003848272,0.000029448041,0.0007148065,0.00003982018,0.000018794479,0.00010170388,0.00025761247,0.01718157,0.00028980584,0.9782103,0.003103665,0.000013903147],"about_ca_topic_score_codex":0.0031433962,"about_ca_topic_score_gemma":0.003057468,"teacher_disagreement_score":0.014798152,"about_ca_system_score_codex":0.00161028,"about_ca_system_score_gemma":0.00081295357,"threshold_uncertainty_score":0.049504817},"labels":[],"label_agreement":null},{"id":"W2082613046","doi":"10.1002/net.10098","title":"On the power of BFS to determine a graph's diameter","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Lexicographical order; Upper and lower bounds; Graph; Mathematics; Constant (computer programming); Induced subgraph; Discrete mathematics; Algorithm; Computer science","score_opus":0.020818701944480714,"score_gpt":0.27063153885149,"score_spread":0.24981283690700928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082613046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34390962,0.004592921,0.63133407,0.0022831191,0.00012336376,0.0001014095,0.0010566217,0.0021921664,0.0144067155],"genre_scores_gemma":[0.7766128,0.0012921209,0.21834883,0.00030268784,0.00018093226,0.00013188773,0.0009900235,0.00035412586,0.0017865533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980009,0.0007114465,0.000099540004,0.00040952655,0.0005421264,0.00023641258],"domain_scores_gemma":[0.9721281,0.022508455,0.0011249431,0.0024051482,0.0011424895,0.0006909188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028928625,0.00081919454,0.001431402,0.0038347873,0.0009235633,0.0016026878,0.0017129227,0.0011679088,0.0033746746],"category_scores_gemma":[0.026694834,0.0008725089,0.00072641205,0.0019821357,0.0018051647,0.0050748726,0.001614797,0.0018031887,0.0010705506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002036217,0.00026202502,0.042048894,0.0008261831,0.00026933203,0.00035752295,0.000815466,0.4733166,0.038269106,0.14644453,0.016760113,0.27859405],"study_design_scores_gemma":[0.000039824998,0.00007395805,0.0022620591,0.00006731511,0.000022702596,0.00022138539,0.00009926778,0.8836356,0.0054561994,0.104339086,0.0037581103,0.00002449271],"about_ca_topic_score_codex":0.00413882,"about_ca_topic_score_gemma":0.0034626615,"teacher_disagreement_score":0.00413882,"about_ca_system_score_codex":0.0014840623,"about_ca_system_score_gemma":0.00083255296,"threshold_uncertainty_score":0.015299141},"labels":[],"label_agreement":null},{"id":"W2083057776","doi":"10.1016/j.dam.2004.03.001","title":"A polynomial time algorithm for strong edge coloring of partial k-trees","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Time complexity; Combinatorics; Enhanced Data Rates for GSM Evolution; Algorithm; Edge coloring; Polynomial; Discrete mathematics; Computer science; Artificial intelligence; Graph","score_opus":0.021726425792253926,"score_gpt":0.28840991294514706,"score_spread":0.26668348715289314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083057776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113282636,0.00044891806,0.85800993,0.0016514511,0.00023790229,0.00052454864,0.0014775883,0.007961752,0.016405288],"genre_scores_gemma":[0.27565342,0.00025627587,0.7105302,0.00035310833,0.00009687319,0.00033482612,0.0030819736,0.0008988484,0.008794513],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869233,0.00022808657,0.00009039277,0.00040796484,0.00024881365,0.00033245352],"domain_scores_gemma":[0.9964851,0.0015752479,0.00022004369,0.000919188,0.00039209073,0.0004083196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010684696,0.0014467466,0.0013772164,0.0009235141,0.0016158674,0.0030367954,0.0029098534,0.0015016561,0.0112729175],"category_scores_gemma":[0.0035722689,0.0010245446,0.001671623,0.0023568054,0.0011680162,0.0047004754,0.0034224992,0.0025035,0.0026622366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024282427,0.0010456922,0.003132313,0.0013976477,0.00026040385,0.00032197806,0.0008585852,0.10476445,0.043267455,0.10370404,0.047765244,0.691054],"study_design_scores_gemma":[0.0010618875,0.00044940467,0.002194315,0.000100625104,0.00031343178,0.00047227996,0.00066620833,0.6361545,0.02112776,0.31670904,0.020632377,0.000118259435],"about_ca_topic_score_codex":0.005427211,"about_ca_topic_score_gemma":0.012336808,"teacher_disagreement_score":0.0112729175,"about_ca_system_score_codex":0.002599193,"about_ca_system_score_gemma":0.0038017281,"threshold_uncertainty_score":0.03771162},"labels":[],"label_agreement":null},{"id":"W2083082533","doi":"10.1145/1798596.1798599","title":"An approximation algorithm for the maximum leaf spanning arborescence problem","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Subroutine; Spanning tree; Combinatorics; Mathematics; Approximation algorithm; Class (philosophy); Discrete mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.024266179078183056,"score_gpt":0.3062330322091877,"score_spread":0.2819668531310046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083082533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035614166,0.00044652066,0.9537424,0.00056646974,0.0000650227,0.00017824996,0.0003325705,0.003255744,0.0057989014],"genre_scores_gemma":[0.17780451,0.00039121744,0.8147226,0.0002009345,0.00006372639,0.0003054567,0.0017879556,0.00031499035,0.0044086725],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928194,0.00010107967,0.000042271677,0.00019117234,0.00020540273,0.00017813647],"domain_scores_gemma":[0.9992059,0.00026955127,0.0000948648,0.0002188504,0.00011613262,0.00009477284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056462275,0.001098539,0.0009090218,0.00078660273,0.0008000664,0.0010632768,0.0022377688,0.0012321743,0.005508783],"category_scores_gemma":[0.0023372811,0.00047691463,0.0009164027,0.0017444721,0.00036508657,0.002604421,0.0015995693,0.0019318766,0.0017777178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006041865,0.0006900721,0.0021283517,0.00056390086,0.0001313107,0.00034228875,0.00045361335,0.22686912,0.029625712,0.041694455,0.035266828,0.6616302],"study_design_scores_gemma":[0.00022708511,0.0002522837,0.0008354297,0.000036244914,0.00006372584,0.00051291415,0.00012727537,0.9330317,0.007923884,0.044090766,0.012865174,0.000033529508],"about_ca_topic_score_codex":0.0028197018,"about_ca_topic_score_gemma":0.004749451,"teacher_disagreement_score":0.005508783,"about_ca_system_score_codex":0.0012934481,"about_ca_system_score_gemma":0.0012843516,"threshold_uncertainty_score":0.018428683},"labels":[],"label_agreement":null},{"id":"W2083261017","doi":"10.1016/j.disc.2008.06.011","title":"Hamiltonicity in vertex envelopes of plane cubic graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal; Texas A and M University","keywords":"Bipartite graph; Combinatorics; Mathematics; Hamiltonian path problem; Cubic graph; Vertex (graph theory); Discrete mathematics; Pancyclic graph; Hamiltonian path; Foster graph; 1-planar graph; Line graph; Graph; Graph power; Voltage graph","score_opus":0.030867328028344927,"score_gpt":0.2816540099414354,"score_spread":0.2507866819130905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083261017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9506571,0.00019308821,0.02101386,0.00035112893,0.000027862105,0.000050479477,0.0002831395,0.00008519123,0.02733814],"genre_scores_gemma":[0.9869463,0.00021682696,0.004850847,0.00007488917,0.000021078908,0.0000383547,0.00029219917,0.000039048828,0.0075205197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972564,0.000052254658,0.000009648495,0.00003540461,0.00008689874,0.000090112386],"domain_scores_gemma":[0.9990101,0.0004378304,0.00021995402,0.000094828036,0.00008872321,0.0001485344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022872204,0.0002995318,0.0005098114,0.0009511173,0.0012100933,0.0021976463,0.00074490195,0.00093896996,0.0054241414],"category_scores_gemma":[0.0019791846,0.00057877426,0.0003953303,0.0011486794,0.0012732205,0.0012566211,0.0009945225,0.0010090335,0.00053254975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000528496,0.00013572135,0.005024649,0.00013341499,0.000036936344,0.0006779825,0.0013611087,0.038424462,0.0106001785,0.91303176,0.0037875792,0.026257653],"study_design_scores_gemma":[0.000101118836,0.00007427108,0.004515303,0.00004941344,0.000026205389,0.00028776148,0.0011393242,0.079091504,0.0027971962,0.9071984,0.0046897996,0.000029711906],"about_ca_topic_score_codex":0.0053247726,"about_ca_topic_score_gemma":0.005421495,"teacher_disagreement_score":0.0054241414,"about_ca_system_score_codex":0.00093962735,"about_ca_system_score_gemma":0.0005612313,"threshold_uncertainty_score":0.018145561},"labels":[],"label_agreement":null},{"id":"W2083735231","doi":"10.1016/j.jctb.2009.11.003","title":"Crossing-critical graphs with large maximum degree","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Bounded function; Degree (music); Mathematics; Combinatorics; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.01717054544245858,"score_gpt":0.29570413759398356,"score_spread":0.27853359215152496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083735231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89537823,0.00095647905,0.06973153,0.0015772268,0.00014394612,0.00011252363,0.000679141,0.00064592087,0.030774992],"genre_scores_gemma":[0.97965664,0.00055663195,0.014454869,0.00025538506,0.00010057752,0.000059533515,0.00046111306,0.00014247421,0.0043127625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995995,0.000081030725,0.000016823546,0.00010366322,0.00008662988,0.000112415095],"domain_scores_gemma":[0.9923734,0.0041102297,0.0008440241,0.00063224736,0.00060383976,0.0014362608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067955884,0.0007139042,0.0009129707,0.0032169796,0.0019205393,0.002513312,0.0011437355,0.001387978,0.006752623],"category_scores_gemma":[0.007865848,0.0010867241,0.000427292,0.0020200412,0.0016353958,0.0036805926,0.0015756928,0.0017906493,0.00057906006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004519034,0.0001839084,0.0053145285,0.00034983087,0.00007419,0.001284998,0.00083064113,0.027044399,0.02137814,0.90960044,0.011172697,0.022314355],"study_design_scores_gemma":[0.00009351982,0.000053220167,0.0023108476,0.000048182916,0.000053551663,0.0009422018,0.00044545895,0.04641644,0.0048420792,0.94046634,0.004299396,0.000028731767],"about_ca_topic_score_codex":0.0008994195,"about_ca_topic_score_gemma":0.0016986609,"teacher_disagreement_score":0.006752623,"about_ca_system_score_codex":0.0012241895,"about_ca_system_score_gemma":0.0006666568,"threshold_uncertainty_score":0.022589743},"labels":[],"label_agreement":null},{"id":"W2083970526","doi":"10.1016/s0304-3975(02)00048-8","title":"Structuring the elementary components of graphs having a perfect internal matching","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Structuring; Computer science; Mathematics; Matching (statistics); Combinatorics; Theoretical computer science","score_opus":0.01473154606041251,"score_gpt":0.28159802193216416,"score_spread":0.26686647587175166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083970526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5223445,0.00044347692,0.4178468,0.00040717464,0.000094943316,0.00032305685,0.0007087971,0.0014388589,0.05639233],"genre_scores_gemma":[0.7399063,0.00044750154,0.23493397,0.00018160086,0.000051583625,0.00016472697,0.0017685075,0.0007479497,0.0217978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957687,0.000060169812,0.000029473807,0.0001193012,0.00008663528,0.0001276385],"domain_scores_gemma":[0.9987834,0.00028947202,0.00013154274,0.0003890301,0.00023443857,0.00017210601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030055645,0.0004625348,0.0005234662,0.0012112834,0.0013345438,0.0026519925,0.0010408142,0.0009078671,0.0062038344],"category_scores_gemma":[0.0018791157,0.0006165554,0.00076236215,0.0014328839,0.0013411606,0.0030343696,0.001921717,0.0008964215,0.0021145872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008052713,0.00022096507,0.0040858723,0.0004894067,0.00006843487,0.000690828,0.0027649952,0.010597986,0.087558866,0.7314219,0.006361203,0.15493427],"study_design_scores_gemma":[0.000061276754,0.00020554103,0.0035352898,0.00013873057,0.00019423116,0.00049056223,0.0018105295,0.022992833,0.047862157,0.8828333,0.039829295,0.000046281482],"about_ca_topic_score_codex":0.0012193338,"about_ca_topic_score_gemma":0.0019550016,"teacher_disagreement_score":0.0062038344,"about_ca_system_score_codex":0.0005497199,"about_ca_system_score_gemma":0.00071586255,"threshold_uncertainty_score":0.02075386},"labels":[],"label_agreement":null},{"id":"W2083976285","doi":"10.1007/s00373-007-0706-3","title":"An O(n3)-Time Recognition Algorithm for hhds-free Graphs","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Split graph; Indifference graph; Pathwidth; Mathematics; Time complexity; Discrete mathematics; Maximal independent set; Interval graph; Graph; 1-planar graph; Line graph","score_opus":0.018915110586098665,"score_gpt":0.2779508647299208,"score_spread":0.25903575414382213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083976285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15626031,0.00064047024,0.7882944,0.001398348,0.0002924471,0.0004097106,0.0019729377,0.027157316,0.023574047],"genre_scores_gemma":[0.39597386,0.000245159,0.57329786,0.00058746006,0.00008584938,0.000338388,0.0081440015,0.0016238791,0.01970363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989396,0.000101405705,0.000074557545,0.00041399538,0.00021522731,0.00025535413],"domain_scores_gemma":[0.99831736,0.00057118374,0.000096518386,0.00063433603,0.00023040337,0.0001502431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039862763,0.0012541446,0.0012774415,0.0011338606,0.0012948969,0.0025539994,0.002769688,0.0015489807,0.017906843],"category_scores_gemma":[0.0017626818,0.0008310082,0.0014210106,0.0017661739,0.00075907685,0.004706406,0.0028817893,0.001648067,0.006171021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009724003,0.00047285587,0.0032192538,0.00046966274,0.0001048721,0.00029363178,0.00034456307,0.025386944,0.045858704,0.016899178,0.041610353,0.8643675],"study_design_scores_gemma":[0.00048766262,0.00031331592,0.004091641,0.00009136439,0.0002456889,0.00085684686,0.0009766571,0.73740774,0.0945001,0.122930974,0.037931353,0.00016674139],"about_ca_topic_score_codex":0.0060161115,"about_ca_topic_score_gemma":0.010837719,"teacher_disagreement_score":0.017906843,"about_ca_system_score_codex":0.001574071,"about_ca_system_score_gemma":0.0019161571,"threshold_uncertainty_score":0.059904337},"labels":[],"label_agreement":null},{"id":"W2084817433","doi":"10.5555/982792.982896","title":"The pure literal rule threshold and cores in random hypergraphs","year":2004,"lang":"en","type":"article","venue":"TSpace (University of Toronto)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Literal (mathematical logic); Hypergraph; Core (optical fiber); Mathematics; Combinatorics; Discrete mathematics; Computer science; Algorithm","score_opus":0.011087410286458257,"score_gpt":0.24442863949271748,"score_spread":0.23334122920625922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084817433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4191392,0.00047974256,0.567721,0.0005919129,0.000056787412,0.00014999091,0.00046975963,0.0015970236,0.009794601],"genre_scores_gemma":[0.9031719,0.00017375851,0.09412237,0.00023805164,0.00005286398,0.00020614408,0.00041972435,0.00026036773,0.0013548539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957355,0.0010395234,0.00034329304,0.0009787253,0.0013174529,0.00058541115],"domain_scores_gemma":[0.94251674,0.04110849,0.0047626914,0.0060720346,0.0031689894,0.002371019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040779444,0.0004507135,0.0012026018,0.002848402,0.0010609546,0.0026870028,0.0021315517,0.0013804047,0.0027606492],"category_scores_gemma":[0.045414206,0.00089455594,0.00091184105,0.0017370683,0.0028856543,0.0051003364,0.0018396326,0.0024351974,0.00040206683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001507313,0.00050410815,0.030994965,0.00040433518,0.00020567414,0.0012749699,0.000952083,0.19782826,0.04134575,0.6179583,0.0067462367,0.10027805],"study_design_scores_gemma":[0.00014361864,0.00019982536,0.0044507068,0.00005424473,0.00006104735,0.0009156671,0.0001885292,0.47599426,0.020810077,0.49540034,0.0017025438,0.000079097044],"about_ca_topic_score_codex":0.0010731663,"about_ca_topic_score_gemma":0.0012717618,"teacher_disagreement_score":0.0040779444,"about_ca_system_score_codex":0.001589315,"about_ca_system_score_gemma":0.0010351435,"threshold_uncertainty_score":0.02156645},"labels":[],"label_agreement":null},{"id":"W2084877920","doi":"10.1016/j.dam.2003.04.004","title":"Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Saskatchewan","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Embedding; Complement (music); Discrete mathematics; Domination analysis; Graph; Pathwidth; Trapezoid graph; Dominating set; Chordal graph; 1-planar graph; Line graph; Computer science","score_opus":0.02394368564801446,"score_gpt":0.29349967969196944,"score_spread":0.26955599404395497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084877920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7365158,0.00090815854,0.1850648,0.00066913135,0.00017823213,0.000106274725,0.00078197045,0.00020471866,0.07557087],"genre_scores_gemma":[0.9345538,0.0008932519,0.04738845,0.00023613547,0.000075353826,0.00014732867,0.000967204,0.00015447776,0.015584133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991148,0.00017526915,0.00003981703,0.00017269475,0.00028384058,0.00021362817],"domain_scores_gemma":[0.9959293,0.0018625029,0.00057510124,0.00037516924,0.000651851,0.00060608436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006778525,0.000635999,0.0011065934,0.00148176,0.0018672263,0.0043795807,0.0015253512,0.00099424,0.008548464],"category_scores_gemma":[0.0044805487,0.0008153784,0.00096135534,0.0017187349,0.0028137167,0.0030839895,0.0021312686,0.0019273389,0.00080440816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002562055,0.00003507092,0.0007560405,0.00011094559,0.000024659126,0.00025721142,0.0004585038,0.012146379,0.0036191684,0.9681981,0.0016629235,0.012474752],"study_design_scores_gemma":[0.000043664124,0.00006208765,0.00094544736,0.000096022835,0.000049217873,0.0004826115,0.0009168175,0.04669072,0.0040757433,0.9379062,0.008696212,0.00003523123],"about_ca_topic_score_codex":0.00418998,"about_ca_topic_score_gemma":0.004268214,"teacher_disagreement_score":0.008548464,"about_ca_system_score_codex":0.0012131002,"about_ca_system_score_gemma":0.0011374061,"threshold_uncertainty_score":0.028597474},"labels":[],"label_agreement":null},{"id":"W2084955549","doi":"10.1016/s0304-3975(03)00286-x","title":"On universally easy classes for NP-complete problems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Time complexity; Mathematics; NP-complete; Intersection (aeronautics); P versus NP problem; Polynomial; Combinatorics; Discrete mathematics; Computer science","score_opus":0.026521373393528832,"score_gpt":0.287435863305529,"score_spread":0.26091448991200017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084955549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16690701,0.008317287,0.56879586,0.016326545,0.0015775318,0.0004609929,0.001948107,0.0015805631,0.23408607],"genre_scores_gemma":[0.8233527,0.0063037756,0.10929304,0.0032568714,0.0035564725,0.0009727066,0.0040206136,0.0015074499,0.047736265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99465114,0.001267741,0.00032225644,0.0011220215,0.0014987469,0.0011380676],"domain_scores_gemma":[0.97701913,0.01874487,0.000780729,0.0014881821,0.000811743,0.0011553115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004685966,0.0027332809,0.0029645152,0.0053852084,0.0049350318,0.008233516,0.00405092,0.003318453,0.020369448],"category_scores_gemma":[0.024702687,0.0021747747,0.0037512898,0.0054387003,0.0077223955,0.025969675,0.01081274,0.016648544,0.002048093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018765083,0.00013059187,0.0005795949,0.00025699535,0.00003100205,0.0001183798,0.00065767654,0.0038963556,0.00047490653,0.96748257,0.006457955,0.019726386],"study_design_scores_gemma":[0.00004288232,0.00001871204,0.00028318286,0.000058158712,0.000025120704,0.000061048755,0.00010107129,0.004705921,0.00015972451,0.9903081,0.0042145965,0.00002137402],"about_ca_topic_score_codex":0.0036763563,"about_ca_topic_score_gemma":0.0044288617,"teacher_disagreement_score":0.020369448,"about_ca_system_score_codex":0.005448453,"about_ca_system_score_gemma":0.0017866837,"threshold_uncertainty_score":0.06814259},"labels":[],"label_agreement":null},{"id":"W2085493165","doi":"10.1016/j.dam.2015.01.022","title":"Polynomial-time algorithms for minimum weighted colorings of (<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mover accent=\"false\"><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mo accent=\"true\">¯</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs and similar graph classes","year":2015,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.023608886727163506,"score_gpt":0.25954621043510984,"score_spread":0.23593732370794634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085493165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07266608,0.0008918447,0.8625694,0.003049981,0.00036665783,0.0009380207,0.006402806,0.012419694,0.040695548],"genre_scores_gemma":[0.32126802,0.0007332406,0.63233215,0.00057359546,0.00020602807,0.0006412359,0.014130135,0.0033226104,0.026792984],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819857,0.00031196422,0.00010111367,0.0006393226,0.00035510707,0.00039390905],"domain_scores_gemma":[0.99330044,0.0040374114,0.00041689986,0.0012506172,0.0005895954,0.00040509124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014410719,0.002106968,0.0014913767,0.0020491907,0.0019214053,0.004313889,0.0043615517,0.0020130053,0.034641355],"category_scores_gemma":[0.009546839,0.0013734193,0.0031072414,0.0032551945,0.0012555078,0.005921125,0.0028537416,0.0030616887,0.006074901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017230643,0.0011327793,0.0033021814,0.0021821028,0.00037324257,0.00027640493,0.0009848226,0.13511,0.013943838,0.20926543,0.12916231,0.5025439],"study_design_scores_gemma":[0.00067334756,0.00019522275,0.0012769694,0.00015046577,0.00020792097,0.00031549946,0.0004657766,0.41395697,0.009030973,0.55133635,0.022314738,0.000075825],"about_ca_topic_score_codex":0.009125499,"about_ca_topic_score_gemma":0.022655683,"teacher_disagreement_score":0.034641355,"about_ca_system_score_codex":0.004689092,"about_ca_system_score_gemma":0.0038592077,"threshold_uncertainty_score":0.11588687},"labels":[],"label_agreement":null},{"id":"W2085702149","doi":"10.1007/s00373-013-1356-2","title":"Graphs with a Minimal Number of Convex Sets","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Convex hull; Induced path; Graph; Graph power; Line graph; Regular polygon","score_opus":0.011617081512219712,"score_gpt":0.2556868968321987,"score_spread":0.24406981531997898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085702149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4196138,0.0010677673,0.37212288,0.0082679065,0.00044825886,0.00049534993,0.006911251,0.0019217841,0.189151],"genre_scores_gemma":[0.76951426,0.00065580214,0.18388583,0.0010424278,0.000311428,0.0006063831,0.0043230965,0.00064051215,0.039020278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981086,0.00043735336,0.00012888391,0.0005324867,0.00043092322,0.0003617463],"domain_scores_gemma":[0.9925874,0.0031463432,0.00086179137,0.0014194277,0.00076532736,0.0012198157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009866299,0.0016022887,0.0024353073,0.0018439393,0.0042868196,0.0056446404,0.004268471,0.0022381595,0.018763436],"category_scores_gemma":[0.0063263434,0.0019770872,0.0017049903,0.0022555336,0.0035610045,0.008756776,0.0032251365,0.004140373,0.0026467848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003385933,0.000083904444,0.0008003596,0.00025260757,0.0000727217,0.00025308333,0.00022305618,0.0037989987,0.0046517127,0.97138464,0.0065733213,0.0115669435],"study_design_scores_gemma":[0.00007063353,0.00003155437,0.00071894616,0.000051127958,0.000070246264,0.0004653012,0.00020912381,0.009007524,0.0035692253,0.9785169,0.007259136,0.000030242376],"about_ca_topic_score_codex":0.0012219143,"about_ca_topic_score_gemma":0.0022538085,"teacher_disagreement_score":0.018763436,"about_ca_system_score_codex":0.0022021185,"about_ca_system_score_gemma":0.0015124233,"threshold_uncertainty_score":0.06276989},"labels":[],"label_agreement":null},{"id":"W2086294103","doi":"10.1002/jgt.1021","title":"Counting 5‐connected planar triangulations","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Planar; Enhanced Data Rates for GSM Evolution; Graph; Planar straight-line graph; Discrete mathematics; 1-planar graph; Line graph; Computer science","score_opus":0.023694302774234295,"score_gpt":0.29307900615916244,"score_spread":0.26938470338492815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086294103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82600427,0.0008533674,0.1328089,0.00062153314,0.00014676718,0.00010232417,0.0008788526,0.00039761642,0.038186233],"genre_scores_gemma":[0.9343252,0.00046312052,0.057882164,0.000109357905,0.00007796927,0.00012781919,0.0013367892,0.0000980565,0.00557944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858105,0.00024795288,0.00008598246,0.0002631294,0.0005723525,0.0002496368],"domain_scores_gemma":[0.9961442,0.0016548631,0.00072752853,0.00051202404,0.00067288824,0.00028844617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005847859,0.00027708782,0.0005398299,0.0027090118,0.0010816286,0.001631687,0.0012462029,0.0009408914,0.008702885],"category_scores_gemma":[0.0080769155,0.0003968278,0.00048811972,0.0024084786,0.0011933004,0.002433752,0.0017866427,0.00062083546,0.00063721946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006322171,0.00008950982,0.03436799,0.0007811228,0.00017608803,0.00082379143,0.0011871357,0.072477564,0.03007382,0.6685793,0.012335713,0.17847575],"study_design_scores_gemma":[0.00010005506,0.00013110977,0.015074385,0.00022579238,0.00015527557,0.0024287023,0.0009606408,0.327345,0.023252472,0.600553,0.029668715,0.000105012725],"about_ca_topic_score_codex":0.0016138187,"about_ca_topic_score_gemma":0.0018903526,"teacher_disagreement_score":0.008702885,"about_ca_system_score_codex":0.0010977591,"about_ca_system_score_gemma":0.0004547074,"threshold_uncertainty_score":0.029114008},"labels":[],"label_agreement":null},{"id":"W2086999408","doi":"10.1145/369836.571190","title":"Review of: Modern Graph Theory by Béla Bollobás","year":2000,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Computer science; Discrete mathematics; Graph; Graph theory; Mathematics; Graph property; Theoretical computer science; Combinatorics; Voltage graph; Line graph","score_opus":0.021400278794100717,"score_gpt":0.30653905061984493,"score_spread":0.2851387718257442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086999408","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002047822,0.9111924,0.0012997962,0.05185863,0.022238197,0.000008765788,0.0001657109,0.000076160555,0.012955552],"genre_scores_gemma":[0.0046496466,0.89125764,0.0014075817,0.029686265,0.048271425,0.00003018867,0.00043309393,0.0002113123,0.024052883],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991781,0.00019302612,0.000048099027,0.00021176516,0.00030658056,0.00006238722],"domain_scores_gemma":[0.99549025,0.0025358102,0.0001816897,0.00017297381,0.0011876186,0.00043165233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013044378,0.0010526477,0.0012815687,0.0041023577,0.0013560866,0.0033228023,0.0016841679,0.0025772806,0.017321315],"category_scores_gemma":[0.006006624,0.00066334254,0.0006331058,0.0049456763,0.0025979385,0.0056024124,0.0014685888,0.0071194326,0.018688511],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019934801,0.000017884067,0.00010515772,0.0009549824,0.000013936975,0.00004060487,0.000077756966,0.00020328339,0.00007666448,0.020596024,0.903189,0.07470472],"study_design_scores_gemma":[0.0000038267835,0.0000050885365,0.00018886049,0.00074765517,0.0000062080367,0.00013760942,0.00003017431,0.000060947274,0.000025656052,0.0070494968,0.99173564,0.000008891389],"about_ca_topic_score_codex":0.0041536926,"about_ca_topic_score_gemma":0.0041037337,"teacher_disagreement_score":0.017321315,"about_ca_system_score_codex":0.003670533,"about_ca_system_score_gemma":0.0022577634,"threshold_uncertainty_score":0.05794561},"labels":[],"label_agreement":null},{"id":"W2087046441","doi":"10.7151/dmgt.1638","title":"Minimal trees and monophonic convexity","year":2012,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Convexity; Combinatorics; Tree (set theory)","score_opus":0.02274028201100312,"score_gpt":0.2843460459271388,"score_spread":0.26160576391613566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087046441","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2978203,0.007724663,0.18809958,0.017253602,0.00081905414,0.000072496354,0.0009036504,0.00033145086,0.48697528],"genre_scores_gemma":[0.92483485,0.0028200445,0.022237,0.0013787942,0.0012518407,0.00009551808,0.00047286702,0.00026808106,0.046641063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999579,0.000112748516,0.000020830259,0.00010744819,0.00010246004,0.000077411736],"domain_scores_gemma":[0.9988188,0.000678098,0.00009265443,0.00013256309,0.00012327603,0.00015461007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156541,0.00038245268,0.0009066175,0.0016685494,0.0024913135,0.0032905077,0.00093369896,0.0011701739,0.0131083485],"category_scores_gemma":[0.0020825842,0.0004516829,0.0007916503,0.0020410127,0.003152073,0.0050690593,0.0020824804,0.0033112264,0.000926151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051905317,0.0000034198736,0.00003512902,0.000015398247,0.0000023931098,0.000018161729,0.00005469596,0.00022173718,0.00015142796,0.9972972,0.000796854,0.0013983083],"study_design_scores_gemma":[0.000004223095,0.0000013360074,0.00008201887,0.0000044058133,0.0000032774337,0.000032886725,0.000035552617,0.00045221232,0.00006206781,0.996714,0.0026052834,0.000002705236],"about_ca_topic_score_codex":0.0013245606,"about_ca_topic_score_gemma":0.0019256602,"teacher_disagreement_score":0.0131083485,"about_ca_system_score_codex":0.0017374941,"about_ca_system_score_gemma":0.0006160018,"threshold_uncertainty_score":0.043851793},"labels":[],"label_agreement":null},{"id":"W2087113704","doi":"10.2478/s11533-013-0234-8","title":"New bounds for the broadcast domination number of a graph","year":2013,"lang":"en","type":"article","venue":"Open Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Domination analysis; Graph; Upper and lower bounds; Connectivity; Cardinality (data modeling); Dominating set; Discrete mathematics; Computer science","score_opus":0.040585166385431685,"score_gpt":0.35892841162195,"score_spread":0.3183432452365183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087113704","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3480503,0.010367743,0.48773682,0.007378075,0.0005749786,0.00039701018,0.0030223702,0.0014660611,0.14100675],"genre_scores_gemma":[0.88926494,0.0022861767,0.096188456,0.0006186187,0.0007731156,0.000367059,0.00084151997,0.00041714372,0.009242901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959888,0.0008447861,0.0001571648,0.0007907542,0.0014015752,0.0008168251],"domain_scores_gemma":[0.96276975,0.028641133,0.002400795,0.0020833102,0.002428695,0.0016763472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037518297,0.001457374,0.0014189855,0.0044079013,0.0015689244,0.0038650744,0.0031787977,0.0013108623,0.0067472993],"category_scores_gemma":[0.026299689,0.00079588307,0.0009477265,0.0031606697,0.0027710025,0.0056711533,0.0025324926,0.0039312937,0.00076679717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028552122,0.0004982165,0.011361855,0.0013862127,0.00025655626,0.0005426041,0.0011376535,0.27712747,0.037276905,0.5288982,0.022255054,0.11640401],"study_design_scores_gemma":[0.000105249615,0.00026218107,0.003961373,0.00023961678,0.00014419279,0.00059188996,0.0002508429,0.6392083,0.012363104,0.32540253,0.017382152,0.00008855437],"about_ca_topic_score_codex":0.002400078,"about_ca_topic_score_gemma":0.0028422477,"teacher_disagreement_score":0.0067472993,"about_ca_system_score_codex":0.00639491,"about_ca_system_score_gemma":0.0012406724,"threshold_uncertainty_score":0.04639852},"labels":[],"label_agreement":null},{"id":"W2087219950","doi":"10.1007/s004930200002","title":"Homomorphisms of Products of Graphs into Graphs Without Four Cycles","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Homomorphism; Indifference graph; Chordal graph; Graph product; Discrete mathematics; 1-planar graph; Graph","score_opus":0.034409806586687866,"score_gpt":0.2682679763669812,"score_spread":0.23385816978029333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087219950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6674883,0.0007472807,0.23937486,0.0006551742,0.00039400044,0.0002441938,0.00039958928,0.0019330082,0.08876359],"genre_scores_gemma":[0.90364444,0.0006852063,0.06497025,0.00034498563,0.00016413146,0.0002146813,0.0004316657,0.00062508456,0.028919464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910396,0.00023995819,0.000068945425,0.00026061974,0.0001449284,0.0001814792],"domain_scores_gemma":[0.997598,0.0010098611,0.0003104094,0.00035588496,0.00024925428,0.0004766256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007730176,0.0006555061,0.00038417688,0.0014070803,0.001120736,0.0023602704,0.0009948574,0.00063430436,0.0078424355],"category_scores_gemma":[0.0026549553,0.0007824834,0.0011776546,0.00091593264,0.0018116023,0.0046655275,0.0027119634,0.0015844045,0.0015248234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024246474,0.00015821676,0.0012806852,0.00015736984,0.000036330035,0.00050386635,0.002245695,0.001066729,0.009736883,0.9455957,0.0025770739,0.036398895],"study_design_scores_gemma":[0.00006476226,0.00017187437,0.0013795245,0.000051471176,0.000079448335,0.0009913294,0.00088684965,0.004415331,0.012385871,0.95645916,0.023060871,0.000053558422],"about_ca_topic_score_codex":0.0005164785,"about_ca_topic_score_gemma":0.0004408968,"teacher_disagreement_score":0.0078424355,"about_ca_system_score_codex":0.00065764145,"about_ca_system_score_gemma":0.00048432645,"threshold_uncertainty_score":0.02623552},"labels":[],"label_agreement":null},{"id":"W2087455919","doi":"10.1007/s10878-008-9150-4","title":"Packing trees in communication networks","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Canadian Imperial Bank of Commerce (Canada); McMaster University","funders":"","keywords":"Mathematics; Solver; Linear programming relaxation; Approximation algorithm; Multicast; Integer programming; Theory of computation; Steiner tree problem; Combinatorics; Spanning tree; Relaxation (psychology); Tree (set theory); Independent set; Block (permutation group theory); Time complexity; k-minimum spanning tree; Linear programming; Discrete mathematics; Graph; Computer science; Mathematical optimization; Algorithm; Tree structure; Binary tree; K-ary tree","score_opus":0.018935291267582425,"score_gpt":0.27444761545684493,"score_spread":0.2555123241892625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087455919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3409415,0.009277644,0.5326977,0.0066293417,0.0010680183,0.00018381281,0.00085731986,0.00070790877,0.10763674],"genre_scores_gemma":[0.870014,0.007276326,0.08249624,0.0009024416,0.0011798046,0.00020927828,0.00089785754,0.00035895483,0.036665104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909925,0.00033665646,0.00004074967,0.0001235866,0.00023837958,0.00016141143],"domain_scores_gemma":[0.9943178,0.0039797407,0.0005257152,0.00039374697,0.000370675,0.00041237302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000868017,0.00064486236,0.0016286519,0.0021489942,0.0019471991,0.004315784,0.0014231225,0.0028805921,0.009074492],"category_scores_gemma":[0.009427005,0.0013777451,0.0007175892,0.0048471666,0.0019657977,0.004925536,0.0016565693,0.0028582446,0.001156831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009738487,0.00008681537,0.00069674896,0.0001789256,0.000029057272,0.00015316832,0.00032697257,0.065323904,0.00091272464,0.8865372,0.012383631,0.03327355],"study_design_scores_gemma":[0.000014542673,0.00001907761,0.00027090186,0.000029564979,0.000015604599,0.00011151727,0.00008048544,0.111617185,0.00019052128,0.88401544,0.003626352,0.000008775285],"about_ca_topic_score_codex":0.001801864,"about_ca_topic_score_gemma":0.0022019686,"teacher_disagreement_score":0.009074492,"about_ca_system_score_codex":0.0013961901,"about_ca_system_score_gemma":0.0008164817,"threshold_uncertainty_score":0.030357182},"labels":[],"label_agreement":null},{"id":"W2088030665","doi":"10.1016/s0166-218x(99)00167-5","title":"Naturally submodular digraphs and forbidden digraph configurations","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Digraph; Submodular set function; Mathematics; Combinatorics; Characterization (materials science); Class (philosophy); Directed graph; Discrete mathematics; Property (philosophy); Graph; Computer science","score_opus":0.010686594292096537,"score_gpt":0.25419747432809087,"score_spread":0.24351088003599433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088030665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58118,0.00066782004,0.3022912,0.001960935,0.0002464299,0.00019348087,0.0021451232,0.0006636251,0.1106514],"genre_scores_gemma":[0.94515926,0.00029905982,0.038913224,0.0003672519,0.000065885084,0.00017292993,0.0010599432,0.00012342703,0.013839073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992893,0.00017969406,0.00004850058,0.00021945345,0.00011723342,0.00014581908],"domain_scores_gemma":[0.99637645,0.0019284373,0.00039614158,0.0004720823,0.0003226034,0.00050427887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058547547,0.00048193237,0.00080701895,0.0012645051,0.0024943538,0.0030280293,0.0013722616,0.001165962,0.00917827],"category_scores_gemma":[0.0038095668,0.0008224424,0.0007003176,0.0017082497,0.001675113,0.0037199482,0.0017438759,0.0027546973,0.0007437632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070236885,0.000041531795,0.00052929256,0.00006625442,0.000013035847,0.0002673141,0.00025850456,0.0019345575,0.0013056631,0.98673636,0.0019109218,0.0068661897],"study_design_scores_gemma":[0.000021646469,0.000010798753,0.00019895624,0.000011484408,0.000008045879,0.00029235944,0.00016122882,0.004696514,0.0005192315,0.9918065,0.0022636787,0.000009607275],"about_ca_topic_score_codex":0.0009658093,"about_ca_topic_score_gemma":0.0021345872,"teacher_disagreement_score":0.00917827,"about_ca_system_score_codex":0.001179996,"about_ca_system_score_gemma":0.0007296493,"threshold_uncertainty_score":0.03070438},"labels":[],"label_agreement":null},{"id":"W2088390361","doi":"10.1016/s0012-365x(00)00190-4","title":"On nice graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; North Atlantic Treaty Organization","keywords":"Mathematics; Combinatorics; Nice; Discrete mathematics; Computer science","score_opus":0.02756542105570989,"score_gpt":0.3109214902902431,"score_spread":0.28335606923453316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088390361","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2831647,0.0027744018,0.15082538,0.011773061,0.0014926877,0.00016658082,0.00084390276,0.0007544624,0.5482049],"genre_scores_gemma":[0.81833106,0.0025563198,0.032665864,0.0020322986,0.0014980145,0.00020387463,0.0013117053,0.0008027666,0.14059809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988398,0.00039766709,0.000038321963,0.00019771235,0.0003428183,0.0001836788],"domain_scores_gemma":[0.99701405,0.0011338042,0.00035403212,0.00045095183,0.00043472214,0.0006123436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008739787,0.0010772444,0.0015345673,0.0030826486,0.0036020298,0.0038690711,0.001753524,0.0022936533,0.015538927],"category_scores_gemma":[0.0052389805,0.0009975163,0.001672931,0.0023355081,0.004119128,0.007606409,0.005107108,0.0052552805,0.0018499056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014807404,0.0000064309856,0.00007245555,0.000023209943,0.0000034249917,0.000020667008,0.00011464455,0.00027604937,0.00014593717,0.99571025,0.0018266449,0.0017855554],"study_design_scores_gemma":[0.0000057193406,0.0000056389413,0.00010870365,0.000010701085,0.0000055348123,0.000056559416,0.00006882608,0.001351256,0.000068522386,0.9950658,0.0032478909,0.0000047205335],"about_ca_topic_score_codex":0.0017162364,"about_ca_topic_score_gemma":0.002078176,"teacher_disagreement_score":0.015538927,"about_ca_system_score_codex":0.0018905372,"about_ca_system_score_gemma":0.0006515889,"threshold_uncertainty_score":0.05198288},"labels":[],"label_agreement":null},{"id":"W2088429527","doi":"10.1016/j.disc.2007.07.033","title":"A generalised upper bound for the k-tuple domination number","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Tuple; Upper and lower bounds; Domination analysis; Degree (music); Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.029152086963418405,"score_gpt":0.34070622518997407,"score_spread":0.31155413822655564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088429527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04825212,0.008838053,0.8393561,0.0059588198,0.0011510774,0.00019809898,0.0023046823,0.0016110833,0.092329934],"genre_scores_gemma":[0.691987,0.007654959,0.26167282,0.002315239,0.002847613,0.000952136,0.0023790454,0.001244684,0.028946485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902953,0.0020634208,0.00050433114,0.002157442,0.0028915561,0.0020880005],"domain_scores_gemma":[0.9595144,0.028210023,0.0013000668,0.006412985,0.0025044752,0.002057971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005973013,0.0024268078,0.003876921,0.0056677284,0.0029425707,0.009391144,0.008847288,0.004317682,0.01664148],"category_scores_gemma":[0.03668623,0.0013067917,0.002786083,0.007371417,0.0061352854,0.01636765,0.010078895,0.0096445,0.0060441634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009696909,0.00015094747,0.0024521635,0.0011070607,0.0001824031,0.0004106184,0.0009478521,0.053290237,0.0102416305,0.8305863,0.018592706,0.08106832],"study_design_scores_gemma":[0.000043637774,0.00012048627,0.0011804136,0.0002557195,0.0001511653,0.00054603926,0.00013149234,0.10800997,0.0041098297,0.8679022,0.017411178,0.0001377208],"about_ca_topic_score_codex":0.0011786782,"about_ca_topic_score_gemma":0.0013734748,"teacher_disagreement_score":0.01664148,"about_ca_system_score_codex":0.0046149115,"about_ca_system_score_gemma":0.0020853996,"threshold_uncertainty_score":0.055671275},"labels":[],"label_agreement":null},{"id":"W2088470271","doi":"10.1016/j.disopt.2012.07.004","title":"Total domination and the Caccetta–Häggkvist conjecture","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université de Montréal; Polytechnique Montréal; Giro (Canada)","funders":"","keywords":"Mathematics; Conjecture; Combinatorics","score_opus":0.00744222266980682,"score_gpt":0.2617487429915411,"score_spread":0.2543065203217343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088470271","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37366208,0.0049404814,0.17637064,0.042150952,0.00090574316,0.000098880126,0.0010798611,0.00050528126,0.4002861],"genre_scores_gemma":[0.95072985,0.0014393404,0.013258081,0.0023745054,0.000609168,0.00016401884,0.0004532724,0.00019231916,0.030779429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981914,0.00058697734,0.000038297854,0.0003549681,0.00043306572,0.0003953303],"domain_scores_gemma":[0.9882365,0.008342726,0.00046196807,0.0015655746,0.0006852579,0.0007079894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024977173,0.00061990274,0.0016525147,0.0015898356,0.0035446808,0.004166626,0.0021655343,0.003262003,0.01255256],"category_scores_gemma":[0.01676644,0.00061109185,0.0014349718,0.002247657,0.006385897,0.006452118,0.0032703949,0.00533975,0.0009709594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049474835,0.000021983635,0.00041934985,0.00004169267,0.000012392381,0.000045534252,0.00018442428,0.0045062476,0.00020900642,0.9843997,0.0062646014,0.0038457124],"study_design_scores_gemma":[0.000019959225,0.0000030215306,0.00015151566,0.000011618732,0.000004626101,0.000027276734,0.000036978203,0.009000808,0.000076065255,0.98890054,0.0017623996,0.0000051139023],"about_ca_topic_score_codex":0.0057501784,"about_ca_topic_score_gemma":0.006082568,"teacher_disagreement_score":0.01255256,"about_ca_system_score_codex":0.0028415408,"about_ca_system_score_gemma":0.0016041257,"threshold_uncertainty_score":0.041992486},"labels":[],"label_agreement":null},{"id":"W2089778934","doi":"10.1016/j.disc.2015.01.024","title":"On the spectrum and number of convex sets in graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Cograph; Split graph; Block graph; Convex set; Vertex (graph theory); Line graph; Graph; Regular polygon; Pathwidth; Convex optimization","score_opus":0.038613218446952,"score_gpt":0.32228538706123816,"score_spread":0.2836721686142862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089778934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7217984,0.003838296,0.18507242,0.010496962,0.00060855807,0.00007097179,0.001174074,0.00033213964,0.076608054],"genre_scores_gemma":[0.97042733,0.0016014224,0.018495027,0.00041578183,0.00089788967,0.0001065325,0.00043104045,0.00017092888,0.0074539646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980282,0.00075403927,0.00008281506,0.00039583867,0.00047528962,0.0002637229],"domain_scores_gemma":[0.9683915,0.025016267,0.0018651044,0.0011311481,0.0011104901,0.002485529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027262191,0.0011761659,0.0020684996,0.0058104433,0.0022342072,0.004721476,0.003955952,0.0021851927,0.011346989],"category_scores_gemma":[0.01898863,0.0011008143,0.001100981,0.0034788207,0.00823243,0.011911429,0.0037139498,0.0032214182,0.0006709254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013873828,0.00004429696,0.0010110539,0.000075836564,0.000021225902,0.000061138555,0.0002614275,0.0070319735,0.0009968006,0.9826251,0.001936827,0.005795539],"study_design_scores_gemma":[0.000019860061,0.000017032778,0.0007436991,0.000038473598,0.000012608832,0.000106528096,0.00013491504,0.028103532,0.0002934412,0.9696406,0.0008708403,0.00001841979],"about_ca_topic_score_codex":0.001397872,"about_ca_topic_score_gemma":0.001122044,"teacher_disagreement_score":0.011346989,"about_ca_system_score_codex":0.0029601888,"about_ca_system_score_gemma":0.00078724837,"threshold_uncertainty_score":0.037959456},"labels":[],"label_agreement":null},{"id":"W2090123683","doi":"10.1016/j.disc.2011.03.009","title":"The order of hypotraceable oriented graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of South Africa","keywords":"Mathematics; Digraph; Combinatorics; Order (exchange); Graph; Discrete mathematics","score_opus":0.03619054761954036,"score_gpt":0.28107950846148855,"score_spread":0.2448889608419482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090123683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8706192,0.00038998327,0.06562143,0.00084094354,0.00020856323,0.00006830446,0.00082753575,0.000374284,0.061049722],"genre_scores_gemma":[0.9529685,0.00061895733,0.017564818,0.00039579943,0.0002575801,0.000061196275,0.0013292397,0.0002906626,0.02651324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992244,0.00014007633,0.00006743522,0.00014630814,0.00023585651,0.00018587013],"domain_scores_gemma":[0.99424744,0.0024857828,0.0009269065,0.0008338508,0.0006796326,0.00082648004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006318998,0.0004542897,0.000707285,0.002162472,0.001545863,0.0038492393,0.001007344,0.0008565097,0.007116572],"category_scores_gemma":[0.0033092394,0.00059793855,0.00059287297,0.0014850065,0.002628957,0.0047015552,0.0011584333,0.0018235102,0.0012902607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002395656,0.00007609695,0.0015679192,0.00006895056,0.0000139225585,0.00034084127,0.0011671532,0.002397702,0.006771974,0.97306395,0.0016910555,0.012600946],"study_design_scores_gemma":[0.000028790846,0.00006385372,0.0011951714,0.00002332074,0.000016839498,0.00019650743,0.00034507114,0.005173326,0.003096174,0.98522896,0.0046094162,0.000022485696],"about_ca_topic_score_codex":0.0018815983,"about_ca_topic_score_gemma":0.0026879408,"teacher_disagreement_score":0.007116572,"about_ca_system_score_codex":0.0010640763,"about_ca_system_score_gemma":0.00084660284,"threshold_uncertainty_score":0.023807347},"labels":[],"label_agreement":null},{"id":"W2090354123","doi":"10.1016/j.dam.2008.08.020","title":"Finding a maximum-weight induced <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-partite subgraph of an <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>i</mml:mi></mml:math>-triangulated graph","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Clique graph; Block graph; Complete bipartite graph; Discrete mathematics; Graph; Line graph; Induced subgraph isomorphism problem; Induced subgraph; Cograph; Split graph; Algorithm; Pathwidth; Graph power; Voltage graph; Vertex (graph theory)","score_opus":0.02428673182251163,"score_gpt":0.2640691380083284,"score_spread":0.23978240618581675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090354123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34817654,0.00048361544,0.5986447,0.0023363556,0.0001748329,0.0006927746,0.0067740413,0.0014907526,0.041226406],"genre_scores_gemma":[0.5172837,0.0004968355,0.43884432,0.0003627446,0.000082648745,0.00023758016,0.012394659,0.0007342724,0.029563276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960667,0.00006178032,0.000017030452,0.00015106525,0.00007877611,0.00008472643],"domain_scores_gemma":[0.99855644,0.0006918865,0.00015742022,0.00020814876,0.00021481508,0.00017133316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032501755,0.0006167855,0.00081872154,0.0012856298,0.0017099897,0.0012632994,0.0017231356,0.0011772335,0.013470051],"category_scores_gemma":[0.003277461,0.000566866,0.0011673528,0.0016576216,0.0008154662,0.0019883532,0.0011399639,0.0009841898,0.0029906258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011250048,0.0010333345,0.014122743,0.0031751182,0.00044172714,0.0021337706,0.0025566802,0.1650996,0.058733005,0.3239571,0.13114363,0.29647833],"study_design_scores_gemma":[0.00021199275,0.0003652567,0.004969488,0.00021763082,0.0002477293,0.0010918255,0.0020154403,0.35938457,0.036097053,0.5654508,0.029849462,0.00009861305],"about_ca_topic_score_codex":0.0050150743,"about_ca_topic_score_gemma":0.013213897,"teacher_disagreement_score":0.013470051,"about_ca_system_score_codex":0.0008818889,"about_ca_system_score_gemma":0.0012951092,"threshold_uncertainty_score":0.045061827},"labels":[],"label_agreement":null},{"id":"W2090424186","doi":"10.1016/j.disopt.2007.08.005","title":"The travelling preacher, projection, and a lower bound for the stability number of a graph","year":2007,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Emmanuel Bible College; Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Graph; Interpretation (philosophy); Independent set; Enhanced Data Rates for GSM Evolution; Projection (relational algebra); Stability (learning theory); Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.024395901651674753,"score_gpt":0.315726119814678,"score_spread":0.29133021816300325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090424186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18374239,0.0036970712,0.73451537,0.006674966,0.00057995686,0.0001879934,0.00065417134,0.00051973114,0.069428355],"genre_scores_gemma":[0.8281397,0.0030619083,0.13821103,0.00077940914,0.0009672745,0.00067721214,0.00065698085,0.00051043386,0.026996003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851614,0.0005624004,0.000044021792,0.0003785866,0.00029772279,0.0002011623],"domain_scores_gemma":[0.98027635,0.01573199,0.0007558228,0.0009128795,0.0009834819,0.0013394494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026909346,0.0017467812,0.002009885,0.0035635806,0.002576495,0.0033028242,0.003349403,0.003445927,0.014290058],"category_scores_gemma":[0.025930898,0.0010064006,0.0017717336,0.0026348275,0.0060456195,0.008400262,0.0037621327,0.0070412527,0.0013446503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002947641,0.00006771368,0.0006311082,0.00021923857,0.000044207758,0.00010082614,0.00028780903,0.053195044,0.0033936233,0.9159792,0.007504233,0.018282345],"study_design_scores_gemma":[0.000034208417,0.00012635738,0.00045428742,0.00006766016,0.000034396777,0.00013499724,0.00010439174,0.29955322,0.001975319,0.6951921,0.002275,0.000048008533],"about_ca_topic_score_codex":0.0013637987,"about_ca_topic_score_gemma":0.0014020095,"teacher_disagreement_score":0.014290058,"about_ca_system_score_codex":0.0024747362,"about_ca_system_score_gemma":0.0016940371,"threshold_uncertainty_score":0.04780501},"labels":[],"label_agreement":null},{"id":"W2091047457","doi":"10.1002/rsa.20016","title":"A (1 + ϵ)‐approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma*","year":2004,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Hypergraph; Lemma (botany); Combinatorics; Mathematics; Time complexity; Speedup; Discrete mathematics; Range (aeronautics); Constant (computer programming); Algorithm; Computer science; Parallel computing","score_opus":0.015757152850869025,"score_gpt":0.27120383096649214,"score_spread":0.2554466781156231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091047457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036880568,0.00037498042,0.9529307,0.0007288271,0.00008904629,0.00015151358,0.00022452751,0.0025705239,0.006049174],"genre_scores_gemma":[0.28709584,0.00030923833,0.70366895,0.0004523931,0.00015007507,0.00039052527,0.0014613147,0.00056213595,0.0059095602],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984212,0.0003343368,0.00011006139,0.00047366097,0.00038062414,0.00028008354],"domain_scores_gemma":[0.9972301,0.0011643782,0.00023713104,0.00093837245,0.00024752913,0.00018243022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011791454,0.0010207478,0.0011626469,0.0014325352,0.0010268736,0.002424861,0.0031320774,0.0013693509,0.008305003],"category_scores_gemma":[0.004595984,0.0006866258,0.0014258003,0.0023709813,0.0011468257,0.0053499658,0.00317821,0.0020230715,0.0025823985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016119194,0.00082415505,0.0046040993,0.00066695566,0.00026583773,0.0002849108,0.00072654756,0.17905924,0.04136457,0.22445683,0.04369753,0.5024374],"study_design_scores_gemma":[0.00032728305,0.00024091844,0.00081586814,0.000042055784,0.00009440064,0.00037429403,0.00013697983,0.8438859,0.013294139,0.13142619,0.009308078,0.00005389076],"about_ca_topic_score_codex":0.002295803,"about_ca_topic_score_gemma":0.003788669,"teacher_disagreement_score":0.008305003,"about_ca_system_score_codex":0.0018631892,"about_ca_system_score_gemma":0.0017401619,"threshold_uncertainty_score":0.027783036},"labels":[],"label_agreement":null},{"id":"W2091452762","doi":"10.1016/j.laa.2009.05.027","title":"Eigenvalues and colorings of digraphs","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.01563529270880379,"score_gpt":0.2878938864303953,"score_spread":0.27225859372159156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091452762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6049039,0.00081899104,0.29072526,0.0019083116,0.0005488026,0.000097916825,0.00072751316,0.00078176026,0.09948756],"genre_scores_gemma":[0.9437154,0.0005465874,0.029749578,0.00024868708,0.00028095866,0.0001298828,0.00029686865,0.00021569536,0.024816418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993005,0.00019339619,0.00003415469,0.00014378059,0.00018789203,0.00014024858],"domain_scores_gemma":[0.99651414,0.0018414925,0.00036390772,0.00025892234,0.00044370277,0.0005779182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068503286,0.0005812933,0.00060926983,0.003317215,0.0016831404,0.003274646,0.0009769715,0.0009365821,0.009677658],"category_scores_gemma":[0.004855569,0.00071125646,0.00056121737,0.001585442,0.0020728922,0.0023322008,0.0009982616,0.0013370169,0.0010211885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003640377,0.000037060574,0.00036875394,0.000035296056,0.000007686254,0.00007937555,0.00033419058,0.0030738085,0.0018964031,0.98513734,0.0022214737,0.006772131],"study_design_scores_gemma":[0.0000120264995,0.0000062153563,0.0002751842,0.000010342486,0.0000033407725,0.0000639611,0.0001217347,0.011564008,0.00036617764,0.98640025,0.0011638455,0.000012892919],"about_ca_topic_score_codex":0.001126238,"about_ca_topic_score_gemma":0.0014967296,"teacher_disagreement_score":0.009677658,"about_ca_system_score_codex":0.001273924,"about_ca_system_score_gemma":0.00057416444,"threshold_uncertainty_score":0.032374978},"labels":[],"label_agreement":null},{"id":"W2091504656","doi":"10.1016/s1571-0653(05)80126-x","title":"On i-minus-Edge-Removal-critical graphs","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Corollary; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Graph; Indifference graph; Computer science","score_opus":0.0146321788659135,"score_gpt":0.3085244832909755,"score_spread":0.293892304425062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091504656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6413188,0.0011969458,0.11571629,0.0026696254,0.00060777954,0.00017516174,0.00071508694,0.00052081264,0.2370795],"genre_scores_gemma":[0.9543382,0.0009531328,0.014707824,0.00072422065,0.00031018606,0.00010489512,0.0009138168,0.00018632502,0.027761295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968886,0.000058634363,0.000014007375,0.000073527066,0.000071141294,0.00009382675],"domain_scores_gemma":[0.9984326,0.0006181281,0.0002834326,0.0001300847,0.00018691245,0.00034891444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039242787,0.00089668174,0.00059739716,0.0023820898,0.0024110842,0.0017684536,0.0011813027,0.0009976351,0.007700018],"category_scores_gemma":[0.002227514,0.00045371673,0.00059390144,0.0011903832,0.0019582924,0.0022808837,0.0014927854,0.0017451122,0.0010107851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015852727,0.000054171,0.00077416725,0.00015846062,0.000019398833,0.00059381354,0.0004613508,0.0031889738,0.005880613,0.971626,0.0065398184,0.010544636],"study_design_scores_gemma":[0.000034410645,0.000020930309,0.00048500503,0.000033678145,0.000016922166,0.0003335032,0.00022243313,0.005758167,0.002087708,0.98646903,0.004524342,0.000013833628],"about_ca_topic_score_codex":0.0012059072,"about_ca_topic_score_gemma":0.0014630584,"teacher_disagreement_score":0.007700018,"about_ca_system_score_codex":0.0010110774,"about_ca_system_score_gemma":0.0005375791,"threshold_uncertainty_score":0.02575916},"labels":[],"label_agreement":null},{"id":"W2091551894","doi":"10.1007/s00373-010-0965-2","title":"Cleaning with Brooms","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Brush; Combinatorics; Broom; Graph; Mathematics; Computer science; Geography; Engineering","score_opus":0.0073598170529717115,"score_gpt":0.22958342487961023,"score_spread":0.22222360782663853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091551894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054834537,0.0031302634,0.5990602,0.012395503,0.0048764287,0.0006072142,0.002706986,0.016923295,0.30546564],"genre_scores_gemma":[0.37872267,0.0017385721,0.35064563,0.0055978033,0.00096153596,0.0004430172,0.00516193,0.01010359,0.24662521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663025,0.00071360456,0.0001712419,0.0009663415,0.00091813214,0.0006004284],"domain_scores_gemma":[0.99106824,0.0016567219,0.00030577712,0.005542041,0.0010630079,0.00036418438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019052811,0.0011774095,0.0015036352,0.0034190998,0.00496698,0.0051119854,0.0025194078,0.0035899624,0.07163704],"category_scores_gemma":[0.01686809,0.0013270495,0.001980334,0.002321079,0.0032852977,0.011167848,0.0074853622,0.0042335046,0.021272808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066141214,0.00023157863,0.0024079762,0.00062252395,0.00020631691,0.0009903754,0.0020966518,0.0067610107,0.011259952,0.45712233,0.15991054,0.3577294],"study_design_scores_gemma":[0.00004625367,0.00009148389,0.0010291782,0.00030905879,0.00011121019,0.0007829426,0.0016622429,0.016969092,0.012156014,0.55309963,0.41363612,0.00010672635],"about_ca_topic_score_codex":0.0022097847,"about_ca_topic_score_gemma":0.002948615,"teacher_disagreement_score":0.07163704,"about_ca_system_score_codex":0.0008659711,"about_ca_system_score_gemma":0.0012107274,"threshold_uncertainty_score":0.23964977},"labels":[],"label_agreement":null},{"id":"W2091612923","doi":"10.1016/s0166-218x(00)00281-x","title":"Diameter determination on restricted graph families","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Chordal graph; Interval graph; Mathematics; Combinatorics; Split graph; Pathwidth; Indifference graph; Cograph; Induced subgraph; Block graph; Distance-hereditary graph; Discrete mathematics; Vertex (graph theory); Maximal independent set; Graph; Line graph; 1-planar graph; Graph power","score_opus":0.024168770563783654,"score_gpt":0.28948888538458695,"score_spread":0.2653201148208033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091612923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53777254,0.00080675137,0.4265946,0.0009558475,0.000073339805,0.0001075652,0.00047088435,0.0007474898,0.032471012],"genre_scores_gemma":[0.89262056,0.000803101,0.095071144,0.00019569811,0.00017738524,0.00017178048,0.00068103714,0.00055287965,0.0097263865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982028,0.00055714574,0.00008706428,0.0005543899,0.00038997256,0.00020861288],"domain_scores_gemma":[0.9844751,0.01128416,0.0011476045,0.0015488332,0.0005918979,0.000952412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013328323,0.0005224743,0.0016309066,0.0019027268,0.001926986,0.002183264,0.002291011,0.0014935106,0.004195523],"category_scores_gemma":[0.012008154,0.00134366,0.00094579515,0.002090236,0.0019247395,0.0050207255,0.0031285537,0.0021645885,0.00079416257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004522002,0.00010808732,0.0037894216,0.00035281936,0.00005178949,0.00044900933,0.0013241146,0.03306215,0.014805209,0.888597,0.007175597,0.0498326],"study_design_scores_gemma":[0.00006164243,0.00006152832,0.0017924334,0.00006178957,0.00004719151,0.0007373934,0.00039042108,0.116256796,0.006402258,0.8669243,0.0072239544,0.00004042999],"about_ca_topic_score_codex":0.0007474344,"about_ca_topic_score_gemma":0.0006743788,"teacher_disagreement_score":0.004195523,"about_ca_system_score_codex":0.0011525956,"about_ca_system_score_gemma":0.00039037084,"threshold_uncertainty_score":0.014035404},"labels":[],"label_agreement":null},{"id":"W2091897018","doi":"10.1016/j.tcs.2009.05.013","title":"A 3.4713-approximation algorithm for the capacitated multicast tree routing problem","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Multicast; Computer science; Routing (electronic design automation); Tree (set theory); Destination-Sequenced Distance Vector routing; Mathematics; Approximation algorithm; Algorithm; Link-state routing protocol; Combinatorics; Routing protocol; Distributed computing; Computer network","score_opus":0.020962504307776086,"score_gpt":0.29635319215966927,"score_spread":0.2753906878518932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091897018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13012995,0.003202804,0.72712016,0.0055888263,0.0012311569,0.0013170607,0.0049023274,0.017336069,0.10917158],"genre_scores_gemma":[0.23359726,0.0005562579,0.72962254,0.001197028,0.00023287052,0.00094354217,0.007379446,0.0012649455,0.025206132],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802953,0.00035876926,0.00010466791,0.0004405631,0.00056134525,0.00050504424],"domain_scores_gemma":[0.9984493,0.0005877436,0.00009019384,0.00042519497,0.00028401587,0.00016351289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013705981,0.0020054632,0.001833326,0.00148689,0.001485426,0.002687037,0.0035530038,0.0031477546,0.036743265],"category_scores_gemma":[0.004621152,0.0008469929,0.0018644984,0.0029313052,0.00067229196,0.0039449045,0.0026127049,0.0026085814,0.008689628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035391245,0.0015898518,0.0016346762,0.000672107,0.00019181737,0.00023036914,0.0002831027,0.1579316,0.014305676,0.03745985,0.096847326,0.68531454],"study_design_scores_gemma":[0.0012977821,0.00041749078,0.0014305694,0.000098688724,0.00016298321,0.00041609263,0.00023578187,0.8877842,0.008333956,0.07063845,0.02910462,0.00007941759],"about_ca_topic_score_codex":0.0068931687,"about_ca_topic_score_gemma":0.009646923,"teacher_disagreement_score":0.036743265,"about_ca_system_score_codex":0.0046003005,"about_ca_system_score_gemma":0.0047928668,"threshold_uncertainty_score":0.12291843},"labels":[],"label_agreement":null},{"id":"W2091988189","doi":"10.1016/j.disc.2008.04.063","title":"Edge-disjoint spanners in tori","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Torus; Spanner; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Geometry; Computer science","score_opus":0.03796996279367364,"score_gpt":0.2981838599308869,"score_spread":0.26021389713721327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091988189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8418901,0.00053147256,0.045247942,0.00067731517,0.00038596228,0.00011527372,0.0009806792,0.0006726774,0.10949854],"genre_scores_gemma":[0.9565314,0.00039693384,0.011258736,0.00019705592,0.00012693799,0.00010934759,0.0008700267,0.00015568602,0.030353984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996289,0.00005299225,0.000022180131,0.00008485195,0.00008449221,0.00012653205],"domain_scores_gemma":[0.9993556,0.00016054035,0.00012320706,0.00007905974,0.00007147666,0.00021007795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026295712,0.0007633821,0.00089295115,0.0017911086,0.0027845637,0.0021038505,0.0011452193,0.00094018347,0.013880073],"category_scores_gemma":[0.0011530316,0.0004890619,0.0005132163,0.0016836909,0.0017645924,0.002401652,0.0027233062,0.0012995574,0.0017024899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020802428,0.000060989827,0.0009500891,0.0001271998,0.000028171664,0.0004781327,0.0008111486,0.005609903,0.0023663754,0.96987313,0.0055468227,0.013939996],"study_design_scores_gemma":[0.00003615311,0.000051607873,0.00091431,0.000029388344,0.000033630884,0.0002480795,0.00066343026,0.009457795,0.0011551224,0.9811881,0.006202857,0.000019527948],"about_ca_topic_score_codex":0.0010441332,"about_ca_topic_score_gemma":0.0019401883,"teacher_disagreement_score":0.013880073,"about_ca_system_score_codex":0.0005368607,"about_ca_system_score_gemma":0.0003653101,"threshold_uncertainty_score":0.04643345},"labels":[],"label_agreement":null},{"id":"W2092080501","doi":"10.1016/j.dam.2014.04.016","title":"Finding clubs in graph classes","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Norges Forskningsråd","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Interval graph; Discrete mathematics; Block graph; Treewidth; Distance-hereditary graph; Pathwidth; Cograph; Bipartite graph; Perfect graph; Clique graph; Graph; Line graph; Graph power; 1-planar graph","score_opus":0.02453978569575146,"score_gpt":0.2973679752228418,"score_spread":0.27282818952709037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092080501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7391158,0.0010125194,0.21867219,0.0016390515,0.00021644303,0.00032974017,0.002193423,0.0009519262,0.035868935],"genre_scores_gemma":[0.910698,0.00047008225,0.07217315,0.00022941407,0.00016979419,0.0001242806,0.0025630936,0.00031018548,0.013261992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986796,0.00029429983,0.00006405857,0.00044250017,0.00027825934,0.00024130514],"domain_scores_gemma":[0.9902946,0.0057830582,0.00081121083,0.0009301217,0.0006127923,0.001568215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092828844,0.00069078535,0.0021265887,0.0042114784,0.0037730918,0.004164328,0.002821483,0.002408403,0.012191967],"category_scores_gemma":[0.0097888755,0.0009542147,0.0013998816,0.004281722,0.0027297644,0.006641157,0.0034319498,0.0030615283,0.0012612604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001029735,0.0007764242,0.030880619,0.0012724288,0.00024867227,0.0012090816,0.003403902,0.0222516,0.006450252,0.7588954,0.034985162,0.1385968],"study_design_scores_gemma":[0.000120792996,0.00007571896,0.003219898,0.0001221261,0.00011304926,0.0004845706,0.0016929904,0.055587538,0.0020768049,0.92573094,0.010748757,0.000026820304],"about_ca_topic_score_codex":0.0022552395,"about_ca_topic_score_gemma":0.003548071,"teacher_disagreement_score":0.012191967,"about_ca_system_score_codex":0.0011942829,"about_ca_system_score_gemma":0.00066356827,"threshold_uncertainty_score":0.040786266},"labels":[],"label_agreement":null},{"id":"W2092176968","doi":"10.1287/moor.27.4.693.299","title":"Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids","year":2002,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Matroid; Vertex (graph theory); Polyhedron; Path (computing); Corollary; Ideal (ethics); Graph; Cardinality (data modeling); Discrete mathematics","score_opus":0.06675678196061044,"score_gpt":0.3852024378835007,"score_spread":0.3184456559228903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092176968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8799076,0.00056448416,0.08093725,0.0004978458,0.000051979587,0.000048380858,0.00040634893,0.0001327154,0.03745338],"genre_scores_gemma":[0.9784303,0.00039053723,0.015011647,0.00006379663,0.00011012584,0.000036624424,0.00039164964,0.00002680635,0.005538608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994179,0.00006154111,0.000041271687,0.0001481007,0.00015915457,0.00017205052],"domain_scores_gemma":[0.99805886,0.00047888677,0.0005768564,0.0002090179,0.00020235113,0.00047399555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005079667,0.00029780623,0.00044222694,0.0017862159,0.0011896181,0.0028610593,0.0006551928,0.00046812167,0.002961864],"category_scores_gemma":[0.0020550292,0.00031166803,0.00061845547,0.0013108093,0.0020676523,0.0034446958,0.0012731283,0.0012731665,0.0002218604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011154111,0.000048313585,0.0031238655,0.00004158474,0.000008642171,0.00018960758,0.0005338937,0.004611669,0.003085861,0.9750879,0.0008063315,0.0123507865],"study_design_scores_gemma":[0.000022480926,0.00007885668,0.004361432,0.000042597392,0.0000305174,0.0010164083,0.00063448783,0.0365757,0.003604477,0.94195855,0.011643276,0.000031199084],"about_ca_topic_score_codex":0.00081927684,"about_ca_topic_score_gemma":0.00080516585,"teacher_disagreement_score":0.002961864,"about_ca_system_score_codex":0.0012694902,"about_ca_system_score_gemma":0.0003893074,"threshold_uncertainty_score":0.009908438},"labels":[],"label_agreement":null},{"id":"W2092192150","doi":"10.4153/cmb-2013-020-5","title":"Size, Order, and Connected Domination","year":2013,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Independence number; Upper and lower bounds; Graffiti; Order (exchange); Graph; Discrete mathematics; Robertson–Seymour theorem; Chordal graph; 1-planar graph; Mathematical analysis","score_opus":0.008564300701761592,"score_gpt":0.22774869630158182,"score_spread":0.21918439559982023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092192150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7757412,0.0024958584,0.12504612,0.003776077,0.00014885701,0.00005900604,0.001206638,0.00056225585,0.09096395],"genre_scores_gemma":[0.98876023,0.0004397241,0.006491705,0.00017937663,0.00011336362,0.000027311984,0.00025091952,0.000054119002,0.0036832998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993006,0.00008988203,0.000026052054,0.00018158263,0.0002398434,0.00016204182],"domain_scores_gemma":[0.98973125,0.0070375004,0.00068544346,0.00078088697,0.0007485359,0.0010163408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062607304,0.00035784632,0.000561288,0.0015695705,0.0008726689,0.0020226808,0.0012431435,0.00066245015,0.008840546],"category_scores_gemma":[0.0061852178,0.00033027297,0.00040348497,0.0013332766,0.0021340593,0.0034517485,0.0016820937,0.0013809326,0.00052131445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072962156,0.00019879821,0.02618713,0.00067875895,0.00012169733,0.00070908875,0.0014110402,0.041547302,0.047102433,0.80737543,0.013222291,0.060716484],"study_design_scores_gemma":[0.00008986621,0.00012906705,0.014171937,0.00009680522,0.00009026768,0.0009765803,0.00045290485,0.06444588,0.013584083,0.89395326,0.011949239,0.000060165483],"about_ca_topic_score_codex":0.0029870265,"about_ca_topic_score_gemma":0.0038083657,"teacher_disagreement_score":0.008840546,"about_ca_system_score_codex":0.0014134322,"about_ca_system_score_gemma":0.0004584241,"threshold_uncertainty_score":0.029574513},"labels":[],"label_agreement":null},{"id":"W2092204243","doi":"10.1016/j.disc.2009.12.012","title":"Broadcasts and domination in trees","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01369033957713226,"score_gpt":0.2972594238184539,"score_spread":0.2835690842413216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092204243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75882506,0.0032608157,0.15688457,0.006125349,0.00019563998,0.00009220937,0.00058782904,0.00031369514,0.07371476],"genre_scores_gemma":[0.97297746,0.0010690264,0.0090628425,0.00029981675,0.00028805636,0.000069926165,0.00020799907,0.00009078872,0.015934056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987569,0.0003976974,0.000061720624,0.00021433919,0.0002866267,0.0002827694],"domain_scores_gemma":[0.9785664,0.016843371,0.0014793329,0.0010710434,0.000987016,0.0010528376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015027376,0.00028337687,0.0011208897,0.0017407136,0.002450291,0.0040518106,0.0013178474,0.0012590482,0.0057040895],"category_scores_gemma":[0.012255068,0.0006995735,0.0006276844,0.0029691688,0.003696562,0.005298099,0.0019222943,0.002436048,0.0004581377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018638186,0.000050294624,0.0013104344,0.00010287135,0.00003339989,0.00014399356,0.0017246746,0.008240224,0.0019633304,0.9694249,0.0029325674,0.013886944],"study_design_scores_gemma":[0.000059599963,0.00001340551,0.0005532432,0.000015714686,0.00002745202,0.00013128064,0.00027371102,0.015833825,0.0005224392,0.9791819,0.0033744143,0.0000130768385],"about_ca_topic_score_codex":0.003587183,"about_ca_topic_score_gemma":0.0043620216,"teacher_disagreement_score":0.0057040895,"about_ca_system_score_codex":0.0021847156,"about_ca_system_score_gemma":0.0009955652,"threshold_uncertainty_score":0.01908201},"labels":[],"label_agreement":null},{"id":"W2092649812","doi":"10.1002/jgt.20507","title":"The genus of Petersen powers","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Petersen graph; Mathematics; Conjecture; Counterexample; Genus; Cubic graph; Graph; Projective plane; Discrete mathematics; Line graph; Voltage graph; Botany; Biology; Geometry","score_opus":0.010033350701152684,"score_gpt":0.2752240021314691,"score_spread":0.2651906514303164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092649812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87439954,0.0008280553,0.023911789,0.0005075156,0.000094508876,0.000028775185,0.00012103165,0.00013585716,0.09997294],"genre_scores_gemma":[0.99104214,0.00046301968,0.00355524,0.000039654926,0.00003638337,0.000022713522,0.000055698125,0.00005136856,0.004733706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999603,0.00006658034,0.000020436664,0.000097818614,0.00010851972,0.00010359726],"domain_scores_gemma":[0.99931824,0.00028807667,0.000100619574,0.00012772529,0.00005292382,0.000112404574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036566338,0.000480232,0.00037649772,0.0015301025,0.0017321621,0.002128664,0.0004943372,0.0006686823,0.00459683],"category_scores_gemma":[0.0024923424,0.0005010759,0.0005557241,0.0006716932,0.0034611418,0.0038346306,0.0025299909,0.0010221014,0.0006085908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014025594,0.00002232813,0.0031942572,0.000090318004,0.00002414173,0.0005414847,0.0007548637,0.0050546876,0.00602386,0.96346253,0.0012203739,0.019470949],"study_design_scores_gemma":[0.000019975101,0.000051609033,0.002465313,0.00006113133,0.000041770083,0.00077733595,0.00051887846,0.007916964,0.0068419916,0.9721901,0.009087462,0.000027612392],"about_ca_topic_score_codex":0.0002853957,"about_ca_topic_score_gemma":0.00037377924,"teacher_disagreement_score":0.00459683,"about_ca_system_score_codex":0.0006322333,"about_ca_system_score_gemma":0.0002438326,"threshold_uncertainty_score":0.015377939},"labels":[],"label_agreement":null},{"id":"W2092811992","doi":"10.1016/j.dam.2011.11.026","title":"Some bounds on global alliances in trees","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Dominating set; Graph; Upper and lower bounds; Offensive; Cardinality (data modeling); Simple graph; Alliance; Closed set; Simple (philosophy); Discrete mathematics; Computer science; Operations research; Data mining","score_opus":0.044389517821247136,"score_gpt":0.302027125385454,"score_spread":0.2576376075642069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092811992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19842012,0.017237786,0.4721415,0.021586556,0.0010083148,0.00037107713,0.0039877915,0.0013305591,0.28391618],"genre_scores_gemma":[0.8534454,0.014210482,0.0775249,0.003423565,0.0026502206,0.0010876011,0.002670702,0.0012520647,0.043735106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946234,0.0016158291,0.0003062443,0.0009854413,0.0012391674,0.001229852],"domain_scores_gemma":[0.87116563,0.104693525,0.0041188085,0.006008047,0.0038026802,0.010211294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009811132,0.0029439267,0.006344751,0.007925462,0.0062680994,0.012189177,0.008737802,0.005124908,0.031953685],"category_scores_gemma":[0.0560206,0.0028742726,0.004010128,0.013182664,0.00955795,0.038162816,0.013246312,0.01970248,0.0035322674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001918997,0.00009732713,0.00072684773,0.00032507634,0.00006855889,0.00008205331,0.00089186896,0.008576219,0.00056012755,0.96814203,0.008295749,0.012042316],"study_design_scores_gemma":[0.000034276716,0.000037831134,0.00044021368,0.00010695086,0.00009025908,0.00010028226,0.00024300857,0.016311452,0.00023948147,0.97912735,0.0032390826,0.00002977632],"about_ca_topic_score_codex":0.0017678872,"about_ca_topic_score_gemma":0.0029352407,"teacher_disagreement_score":0.031953685,"about_ca_system_score_codex":0.005161638,"about_ca_system_score_gemma":0.0020102293,"threshold_uncertainty_score":0.106895745},"labels":[],"label_agreement":null},{"id":"W2092888300","doi":"10.48550/arxiv.math/0509004","title":"Counting unlabelled toroidal graphs with no K33-subdivisions","year":2005,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Enumeration; Toroid; Combinatorics; Mathematical proof; Subdivision; Planar; Projective plane; Discrete mathematics; Geometry; Computer science; Computer graphics (images)","score_opus":0.02506889068463987,"score_gpt":0.2795704581418943,"score_spread":0.25450156745725444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092888300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2541436,0.00048527145,0.68391883,0.00050407054,0.0002098509,0.00017030619,0.001160582,0.0007819283,0.05862559],"genre_scores_gemma":[0.67095184,0.0006944277,0.30418977,0.00034292808,0.00012978834,0.00036017675,0.002696542,0.0005228595,0.020111658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992125,0.00011360837,0.000047473917,0.00018214223,0.00028179682,0.00016233965],"domain_scores_gemma":[0.9979836,0.00075455266,0.00024075758,0.0003835993,0.0004738468,0.00016365793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005219802,0.0006107457,0.00060542853,0.0015025008,0.001190054,0.0021941368,0.0015844377,0.00080427446,0.0069273775],"category_scores_gemma":[0.0035922625,0.00041364582,0.0005030557,0.0015449264,0.001292338,0.0039848923,0.0015714737,0.0013455593,0.00097620895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012726743,0.000047626345,0.0016638311,0.00029589966,0.000020964877,0.00025893192,0.00046190195,0.013517644,0.009366796,0.9196554,0.0039517907,0.050632022],"study_design_scores_gemma":[0.000022333013,0.000045333447,0.0014889776,0.00012921098,0.00004230897,0.00040420605,0.0003173969,0.070589304,0.017321328,0.8889092,0.020690568,0.00003985233],"about_ca_topic_score_codex":0.0015057407,"about_ca_topic_score_gemma":0.003898628,"teacher_disagreement_score":0.0069273775,"about_ca_system_score_codex":0.0011858196,"about_ca_system_score_gemma":0.000611676,"threshold_uncertainty_score":0.023174345},"labels":[],"label_agreement":null},{"id":"W2093180783","doi":"10.1016/j.ejc.2014.06.009","title":"The Chen–Chvátal conjecture for metric spaces induced by distance-hereditary graphs","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Conjecture; Metric space; De Bruijn sequence; Discrete mathematics; De Bruijn graph; Generalization; Mathematical analysis","score_opus":0.014858984196394653,"score_gpt":0.2557884431531749,"score_spread":0.24092945895678025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093180783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.780918,0.0016516768,0.0813464,0.013153713,0.00039981143,0.000070622744,0.0011730961,0.00044058493,0.12084598],"genre_scores_gemma":[0.9780895,0.0007104288,0.008236546,0.0010073195,0.00032450145,0.000067093075,0.00085448526,0.0000970611,0.010613147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797636,0.0004921246,0.000085778585,0.00057078915,0.0004740861,0.00040085948],"domain_scores_gemma":[0.99092263,0.0050263503,0.00087651116,0.0012885734,0.0008365443,0.0010493487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014238382,0.00065669726,0.0017384008,0.0018044105,0.0034664266,0.0045498963,0.001961923,0.002864323,0.010039271],"category_scores_gemma":[0.009461693,0.0008338089,0.0013666748,0.002500576,0.0046681347,0.010204334,0.0045806062,0.0044629555,0.0008726648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081239035,0.000031818578,0.00075182103,0.0000839215,0.000017884984,0.00007408463,0.0003254915,0.0030237036,0.00051806186,0.98889565,0.0027974756,0.0033988892],"study_design_scores_gemma":[0.000030035451,0.000013042033,0.00046875403,0.00001576451,0.000011769917,0.00009179023,0.00014402754,0.008275256,0.0003618725,0.9883936,0.002177892,0.000016171281],"about_ca_topic_score_codex":0.0030147787,"about_ca_topic_score_gemma":0.002876114,"teacher_disagreement_score":0.010039271,"about_ca_system_score_codex":0.0024841547,"about_ca_system_score_gemma":0.001066095,"threshold_uncertainty_score":0.033584714},"labels":[],"label_agreement":null},{"id":"W2093495451","doi":"10.1016/s0012-365x(99)00300-3","title":"On P4-transversals of perfect graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Transversal (combinatorics); Conjecture; Graph; Discrete mathematics; Induced subgraph; Chordal graph; Split graph; 1-planar graph","score_opus":0.017158800873379818,"score_gpt":0.28878315858051556,"score_spread":0.2716243577071357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093495451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82311,0.0005861828,0.09411328,0.0015359798,0.00033408226,0.00013457013,0.0010695965,0.000433505,0.07868272],"genre_scores_gemma":[0.9361876,0.0010990372,0.027250191,0.00049679325,0.0003077173,0.00016643379,0.0019526817,0.00030575797,0.0322339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861145,0.00034748003,0.000091627226,0.0002977228,0.00025794946,0.00039367308],"domain_scores_gemma":[0.9945052,0.002287437,0.0011456283,0.00047281824,0.0004814704,0.0011074294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013832801,0.0015119605,0.0012014867,0.0035551856,0.0031137457,0.003980175,0.0017598238,0.0019414538,0.011947135],"category_scores_gemma":[0.0051970324,0.0017361547,0.0018631065,0.0026244149,0.003607752,0.0058323774,0.004395958,0.003951164,0.0015345629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027967745,0.00004951391,0.0011435618,0.00010136744,0.000028846964,0.00045198668,0.00082065794,0.002695084,0.0025333585,0.9837107,0.002129632,0.0060556466],"study_design_scores_gemma":[0.000042571468,0.000047937436,0.0008035413,0.000046262572,0.000026809623,0.00024080503,0.00045711672,0.005048256,0.00086363824,0.9900601,0.002342819,0.000020240692],"about_ca_topic_score_codex":0.0025514099,"about_ca_topic_score_gemma":0.0030278896,"teacher_disagreement_score":0.011947135,"about_ca_system_score_codex":0.0019606114,"about_ca_system_score_gemma":0.0009323304,"threshold_uncertainty_score":0.03996712},"labels":[],"label_agreement":null},{"id":"W2093500811","doi":"10.1016/j.disc.2009.10.006","title":"Rooted directed path graphs are leaf powers","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Wilfrid Laurier University","keywords":"Mathematics; Combinatorics; Discrete mathematics; Graph; Pathwidth; Interval graph; Line graph","score_opus":0.018272626899669405,"score_gpt":0.28614597697249655,"score_spread":0.26787335007282714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093500811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12174988,0.00084566686,0.61173624,0.0017044486,0.00041854318,0.00021173188,0.0013596062,0.0014551362,0.26051873],"genre_scores_gemma":[0.7204345,0.0016737474,0.13265882,0.0010229798,0.0003761463,0.00029174087,0.0018097551,0.0010315194,0.14070074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934846,0.00012535903,0.000036576308,0.00021743627,0.00016943502,0.000102814774],"domain_scores_gemma":[0.99662423,0.0017600504,0.00030382,0.000519716,0.0004893019,0.00030298493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006062149,0.000522421,0.0006935479,0.0014112089,0.001302158,0.0027247986,0.0011046281,0.0009142212,0.019844811],"category_scores_gemma":[0.004557312,0.0007624632,0.0007167049,0.0017182792,0.0020946825,0.007049101,0.001659436,0.0030299358,0.0052967723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033503104,0.000023124076,0.00020341687,0.00008399938,0.000010246051,0.00012832964,0.0003231466,0.0005340006,0.0016311635,0.9759902,0.0038360192,0.01720285],"study_design_scores_gemma":[0.000013458769,0.0000086761365,0.00012125271,0.000019208765,0.000012917547,0.00014916329,0.0000951208,0.002272592,0.00090573117,0.98388994,0.012506138,0.000005725942],"about_ca_topic_score_codex":0.00049086835,"about_ca_topic_score_gemma":0.00079367845,"teacher_disagreement_score":0.019844811,"about_ca_system_score_codex":0.00067599234,"about_ca_system_score_gemma":0.0004538024,"threshold_uncertainty_score":0.066387475},"labels":[],"label_agreement":null},{"id":"W2093939144","doi":"10.1007/s00236-007-0056-x","title":"Solving #SAT using vertex covers","year":2007,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Bounded function; Mathematics; Combinatorics; Discrete mathematics; Cluster analysis; Vertex (graph theory); Time complexity; Graph; Pathwidth; Line graph","score_opus":0.0258547673811828,"score_gpt":0.30543294107014124,"score_spread":0.27957817368895843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093939144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31209928,0.0013951424,0.59956723,0.005592315,0.00037667964,0.00028979752,0.003072188,0.006049828,0.07155762],"genre_scores_gemma":[0.6470575,0.0005848004,0.3299653,0.00054603047,0.00021693217,0.00019409528,0.00407248,0.0009512243,0.016411647],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986847,0.00041702116,0.00005634066,0.0002851093,0.00027597242,0.0002808886],"domain_scores_gemma":[0.99526274,0.003729399,0.0001732357,0.00051819044,0.00018230191,0.00013411332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079022656,0.0011787938,0.0009998627,0.000989345,0.000998929,0.002698715,0.0020268625,0.0014016037,0.0117957825],"category_scores_gemma":[0.005361162,0.0009294452,0.0019534773,0.0019135197,0.00098095,0.0043803942,0.0026048298,0.0026377435,0.0017949278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014272318,0.00048634797,0.0041804025,0.0012597197,0.00039726566,0.00042942984,0.0006126569,0.27195597,0.013961632,0.21801846,0.04130205,0.44596896],"study_design_scores_gemma":[0.00022819254,0.00015790292,0.00092030776,0.000086613734,0.00018909825,0.00020455252,0.0002789052,0.5210271,0.0111104185,0.4515659,0.014199962,0.000031133106],"about_ca_topic_score_codex":0.0043334253,"about_ca_topic_score_gemma":0.008359846,"teacher_disagreement_score":0.0117957825,"about_ca_system_score_codex":0.0013544371,"about_ca_system_score_gemma":0.0016029655,"threshold_uncertainty_score":0.039460838},"labels":[],"label_agreement":null},{"id":"W2093941744","doi":"10.1016/s0020-0190(03)00228-x","title":"From a simple elimination ordering to a strong elimination ordering in linear time","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Simple (philosophy); Chordal graph; Mathematics; Time complexity; Graph; Computer science; Combinatorics; Algorithm","score_opus":0.013666661840455533,"score_gpt":0.2796372488493467,"score_spread":0.2659705870088912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093941744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116519734,0.0008054044,0.8216427,0.003826941,0.0005598551,0.00019062977,0.0009458712,0.0036777821,0.051831085],"genre_scores_gemma":[0.5037665,0.0007945871,0.45901528,0.0014195405,0.00052086246,0.00022236395,0.0015186502,0.0014212352,0.031320956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876106,0.00032771446,0.0000868776,0.00021437956,0.00034808606,0.00026176285],"domain_scores_gemma":[0.9949656,0.003063929,0.00025082126,0.000839212,0.00056395296,0.0003164268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008435296,0.0007923265,0.00078505673,0.0010015238,0.001401176,0.0028025801,0.0012300776,0.00078380987,0.010400626],"category_scores_gemma":[0.004934496,0.0006776904,0.0010111781,0.0019257079,0.0017010731,0.00690529,0.0019796018,0.0031021247,0.0016588941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074824825,0.00034977018,0.00071411085,0.00044496392,0.000058464673,0.00025353595,0.00072548405,0.023422433,0.00801007,0.72651756,0.032005426,0.20674989],"study_design_scores_gemma":[0.0000816464,0.0000711221,0.00014860868,0.000017975384,0.00003537331,0.000084103594,0.00009930344,0.033958264,0.002374391,0.9559115,0.0071983603,0.000019366842],"about_ca_topic_score_codex":0.0026740446,"about_ca_topic_score_gemma":0.0055250847,"teacher_disagreement_score":0.010400626,"about_ca_system_score_codex":0.0012121814,"about_ca_system_score_gemma":0.0023091743,"threshold_uncertainty_score":0.034793556},"labels":[],"label_agreement":null},{"id":"W2094094736","doi":"10.1007/s004930200025","title":"The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Burnaby Hospital; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.038923521854735244,"score_gpt":0.27472123876878557,"score_spread":0.23579771691405033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094094736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87272495,0.0006156513,0.048274484,0.0017265604,0.00039319458,0.000100347745,0.00081584125,0.0008885186,0.07446046],"genre_scores_gemma":[0.95611674,0.000400536,0.027635107,0.00036588343,0.00012521089,0.00014565501,0.0013649031,0.00011514954,0.013730839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994481,0.00006271755,0.00003664494,0.00015259933,0.000094729476,0.00020516553],"domain_scores_gemma":[0.99726474,0.0012748062,0.0003889568,0.00031896553,0.00023047255,0.0005220481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904825,0.0005988012,0.0006352136,0.0010371187,0.0020341314,0.0018827862,0.001032203,0.0015693174,0.01143818],"category_scores_gemma":[0.0022130883,0.00038543256,0.00050424534,0.00086984184,0.0014937879,0.0037504362,0.0010513965,0.0011531942,0.0016744592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004893563,0.000851583,0.01837432,0.0011966705,0.00015210663,0.0015590811,0.000971627,0.01986709,0.14104334,0.5691926,0.024837632,0.2170604],"study_design_scores_gemma":[0.0005313956,0.0010254172,0.020860087,0.00022894873,0.00027966575,0.0033872626,0.0011389864,0.05361933,0.14359711,0.67444795,0.100562066,0.0003218798],"about_ca_topic_score_codex":0.000684053,"about_ca_topic_score_gemma":0.000748845,"teacher_disagreement_score":0.01143818,"about_ca_system_score_codex":0.0008322004,"about_ca_system_score_gemma":0.000952288,"threshold_uncertainty_score":0.038264573},"labels":[],"label_agreement":null},{"id":"W2094202793","doi":"10.1016/j.jctb.2004.08.003","title":"The perfect matching polytope and solid bricks","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Matching (statistics); Perfect graph theorem; Birkhoff polytope; Convex hull; Convex polytope; Degree (music); Regular polygon; Discrete mathematics; Graph; Convex set; Line graph; Convex optimization; Geometry; Physics","score_opus":0.008220812949512369,"score_gpt":0.2701819619439301,"score_spread":0.26196114899441775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094202793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5661296,0.0015482028,0.15660983,0.00280205,0.00043709003,0.00014146457,0.0011066644,0.0003392245,0.27088583],"genre_scores_gemma":[0.9145523,0.001260038,0.034904856,0.0003594853,0.00021453937,0.000115232666,0.0007545455,0.00013220817,0.04770689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999511,0.00008945153,0.000020205976,0.000111166264,0.00015375379,0.00011443798],"domain_scores_gemma":[0.99911875,0.00033526702,0.00019463463,0.00014162537,0.00006237769,0.00014733437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028797484,0.00044554405,0.0009909695,0.0014652146,0.0018574197,0.003540873,0.0012899418,0.0018774353,0.018644635],"category_scores_gemma":[0.0022783482,0.0009321416,0.0006506785,0.0015469946,0.0022162464,0.0037327188,0.0023078949,0.0024658404,0.0020228983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058965965,0.00002597747,0.0001952842,0.000052587704,0.0000099109575,0.00009395599,0.000054136122,0.006120872,0.0007245889,0.9841905,0.0025419737,0.0059313052],"study_design_scores_gemma":[0.000039371003,0.00002492693,0.0003814328,0.000035403053,0.000011756259,0.00019509338,0.00013504435,0.014574571,0.0005953185,0.97639084,0.0076011512,0.000015102162],"about_ca_topic_score_codex":0.001434751,"about_ca_topic_score_gemma":0.001462277,"teacher_disagreement_score":0.018644635,"about_ca_system_score_codex":0.000757717,"about_ca_system_score_gemma":0.0005026921,"threshold_uncertainty_score":0.062372506},"labels":[],"label_agreement":null},{"id":"W2094278957","doi":"10.1016/j.disc.2010.11.007","title":"Well-covered circulant graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Lexicographical order; Mathematics; Combinatorics; Circulant graph; Discrete mathematics; Characterization (materials science); Graph; Line graph; Voltage graph","score_opus":0.016664478147683726,"score_gpt":0.28505904869301746,"score_spread":0.2683945705453337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094278957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7313993,0.0015563478,0.14117384,0.0028888115,0.00036742038,0.00012394965,0.0013188842,0.0007519973,0.12041948],"genre_scores_gemma":[0.9413505,0.0014566925,0.022783436,0.00078383496,0.00065695134,0.00019195434,0.0014402756,0.00033294357,0.031003492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989291,0.0002613,0.00003886857,0.00019460436,0.00032747744,0.00024864892],"domain_scores_gemma":[0.99500835,0.0024777234,0.0005577991,0.0005138785,0.0006411423,0.0008011246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007153848,0.0010328871,0.0012684816,0.0027444242,0.0019999994,0.0030836524,0.0012123967,0.0017918497,0.008848225],"category_scores_gemma":[0.0049973927,0.00083574106,0.0006699548,0.0021685183,0.0017060157,0.0039410093,0.0017444721,0.0025298514,0.0013933297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000929766,0.000040797517,0.0003192161,0.000069362126,0.000018450733,0.00017468478,0.00017886722,0.002230983,0.0031497194,0.9837104,0.0046991096,0.005315349],"study_design_scores_gemma":[0.000041321662,0.00002690437,0.00063743646,0.000023822726,0.000027750943,0.0003820977,0.00010525785,0.018269317,0.0018769521,0.97303253,0.005555863,0.00002075241],"about_ca_topic_score_codex":0.0011575625,"about_ca_topic_score_gemma":0.0014163076,"teacher_disagreement_score":0.008848225,"about_ca_system_score_codex":0.0011036567,"about_ca_system_score_gemma":0.0007013769,"threshold_uncertainty_score":0.029600263},"labels":[],"label_agreement":null},{"id":"W2094337274","doi":"10.1016/j.dam.2002.12.005","title":"Embeddings of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si88.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-connected graphs of pathwidth <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si89.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Mathematics; Scroll; Algorithm; Discrete mathematics; Theology","score_opus":0.018003696424160012,"score_gpt":0.25559724461823347,"score_spread":0.23759354819407347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094337274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08958797,0.0011656053,0.49877125,0.0030497354,0.0014704359,0.00040795104,0.02615917,0.0076017478,0.37178618],"genre_scores_gemma":[0.42861858,0.0021156175,0.24453764,0.0010338082,0.00036603393,0.00059884094,0.053709283,0.006143736,0.2628765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995183,0.00008752164,0.000038836417,0.00014413883,0.0001308466,0.000080363025],"domain_scores_gemma":[0.99867684,0.00036204595,0.00016174758,0.00028816864,0.00036269048,0.00014855269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023961946,0.00087833026,0.00030534426,0.0010490638,0.0008040541,0.0023550114,0.0010977926,0.00082160934,0.06842081],"category_scores_gemma":[0.0030636934,0.0005445643,0.00057962,0.0013420742,0.0006932235,0.0035108163,0.001464034,0.0014002702,0.019308366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038981476,0.00018069368,0.0008282624,0.0005466018,0.000043557266,0.00045727118,0.0010541492,0.008453191,0.009353815,0.73206466,0.14736173,0.09926617],"study_design_scores_gemma":[0.00008321316,0.00006754661,0.0014503384,0.00018846373,0.000047978185,0.0005102679,0.00080800353,0.016840506,0.009833398,0.53626084,0.4338352,0.000074111405],"about_ca_topic_score_codex":0.0022017374,"about_ca_topic_score_gemma":0.0036345273,"teacher_disagreement_score":0.06842081,"about_ca_system_score_codex":0.00096832827,"about_ca_system_score_gemma":0.00065924635,"threshold_uncertainty_score":0.22889042},"labels":[],"label_agreement":null},{"id":"W2094803507","doi":"10.1016/s0012-365x(03)00241-3","title":"Analysis of greedy algorithms on graphs with bounded degrees","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Heuristics; Combinatorics; Bounded function; Sequence (biology); Greedy algorithm; Algorithm; Random graph; Discrete mathematics; Mathematical optimization; Graph","score_opus":0.028575948934962812,"score_gpt":0.2982504229598212,"score_spread":0.2696744740248584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094803507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30260807,0.003397885,0.65959656,0.0051870523,0.000179288,0.00032639736,0.0006274523,0.0010358735,0.027041443],"genre_scores_gemma":[0.8775885,0.0027599917,0.098916054,0.0010100469,0.0005197013,0.00053376984,0.0011249897,0.0009913264,0.016555501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950393,0.0020561912,0.00015007844,0.00063867547,0.0011064239,0.0010093472],"domain_scores_gemma":[0.9196687,0.06784895,0.004102525,0.0027192403,0.0028857242,0.0027747932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061975494,0.0026773685,0.0028653746,0.00407968,0.0021552795,0.005795953,0.006384124,0.003902176,0.009709852],"category_scores_gemma":[0.05447374,0.001860767,0.0019369317,0.0043906104,0.0060759094,0.010511411,0.0041639204,0.004039643,0.0010367379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075796404,0.00027541662,0.002438786,0.00045319228,0.00014252117,0.00014620725,0.0004942596,0.35877007,0.002458944,0.6050373,0.0071131075,0.021912156],"study_design_scores_gemma":[0.00009701376,0.00008046927,0.00046065188,0.000058430698,0.000054604963,0.00007752993,0.00014514117,0.5729127,0.0006120493,0.4243514,0.0011263221,0.000023718307],"about_ca_topic_score_codex":0.0038024345,"about_ca_topic_score_gemma":0.0036406105,"teacher_disagreement_score":0.009709852,"about_ca_system_score_codex":0.0065399376,"about_ca_system_score_gemma":0.004783081,"threshold_uncertainty_score":0.04745084},"labels":[],"label_agreement":null},{"id":"W2095382269","doi":"10.1016/j.dam.2014.12.017","title":"Practical algorithms for branch-decompositions of planar graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; D-Wave Systems (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Mathematics; Planar graph; Algorithm; Time complexity; Graph; Planar; Decomposition; Combinatorics; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.078365028692375,"score_gpt":0.3703406906755415,"score_spread":0.2919756619831665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095382269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035724245,0.00041956248,0.9387159,0.0011719543,0.0001412038,0.00045991477,0.00089645386,0.0031189213,0.01935188],"genre_scores_gemma":[0.14596507,0.00047256474,0.8398857,0.0002599546,0.000130818,0.00042325782,0.002889167,0.0010624932,0.00891093],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980312,0.00057935796,0.00013386691,0.000390774,0.00047394805,0.00039078965],"domain_scores_gemma":[0.9929986,0.0037989707,0.00033369384,0.0016550558,0.00078321685,0.00043049353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022083079,0.002173343,0.0016392111,0.0023195425,0.0018575637,0.003986929,0.003392602,0.0019397562,0.035509795],"category_scores_gemma":[0.012864329,0.0013553888,0.0022397735,0.0031299505,0.0015100489,0.0061619733,0.005886524,0.004713148,0.007645317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011409331,0.00066626945,0.0015777139,0.0009810263,0.0001268311,0.00015826289,0.0008058574,0.10490485,0.009202439,0.20322973,0.04198663,0.63521945],"study_design_scores_gemma":[0.0004034331,0.00013169185,0.00034054896,0.00011529565,0.00008951907,0.00014670314,0.00048381992,0.40374222,0.004566779,0.5781463,0.011801679,0.000031870066],"about_ca_topic_score_codex":0.0027146265,"about_ca_topic_score_gemma":0.0064774556,"teacher_disagreement_score":0.035509795,"about_ca_system_score_codex":0.002127456,"about_ca_system_score_gemma":0.0030778574,"threshold_uncertainty_score":0.11879212},"labels":[],"label_agreement":null},{"id":"W2096004680","doi":"10.1002/jgt.21786","title":"Arc‐Disjoint In‐ and Out‐Branchings With the Same Root in Locally Semicomplete Digraphs","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Arc (geometry); Root (linguistics); Discrete mathematics; Geometry; Linguistics","score_opus":0.010463549243009442,"score_gpt":0.24629843738448523,"score_spread":0.2358348881414758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096004680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8076625,0.00019523995,0.18368515,0.00043797557,0.000023986187,0.00012881002,0.0010121578,0.00037149453,0.006482667],"genre_scores_gemma":[0.954824,0.00010267981,0.041446764,0.000089748384,0.0000131806455,0.00006309363,0.0007741046,0.00003701468,0.0026493594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935406,0.0001131722,0.000058315145,0.0002220816,0.0001307044,0.00012171435],"domain_scores_gemma":[0.99428636,0.0037017912,0.00069583656,0.00042241527,0.00039447082,0.00049911457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267449,0.0002680268,0.0005921016,0.000695948,0.0010907239,0.0015366313,0.0007717568,0.00063218025,0.0033797398],"category_scores_gemma":[0.002993485,0.00043261767,0.0004559876,0.00095439114,0.0012556998,0.002139455,0.0008541071,0.0010335402,0.00020654395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012632508,0.0006383365,0.034176525,0.0010264723,0.00024272557,0.0039060512,0.00264166,0.14275917,0.05927892,0.6757528,0.0049424204,0.07337165],"study_design_scores_gemma":[0.00014943819,0.00020700104,0.0065977657,0.0001273573,0.00013988277,0.0015747757,0.0018227326,0.25563318,0.027710203,0.6974155,0.008554284,0.00006790116],"about_ca_topic_score_codex":0.003111893,"about_ca_topic_score_gemma":0.005000436,"teacher_disagreement_score":0.0033797398,"about_ca_system_score_codex":0.0014807365,"about_ca_system_score_gemma":0.00097314315,"threshold_uncertainty_score":0.011306345},"labels":[],"label_agreement":null},{"id":"W2096146759","doi":"10.1016/j.dam.2005.03.002","title":"Orientable convexity, geodetic and hull numbers in graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Geodetic datum; Combinatorics; Convexity; Hull; Geodesy; Geography; Geology","score_opus":0.014271766572100894,"score_gpt":0.27461718913780303,"score_spread":0.26034542256570214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096146759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8275404,0.0015807723,0.07939577,0.0017869833,0.00018616708,0.000037091264,0.00057075557,0.000114015114,0.08878813],"genre_scores_gemma":[0.9775743,0.0012739293,0.0092422515,0.00016244006,0.00027178437,0.00005232497,0.00044853258,0.000061472,0.010912987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970335,0.000069932976,0.00001414728,0.000070417635,0.000072217044,0.00006988817],"domain_scores_gemma":[0.99735534,0.0015470552,0.00046456116,0.00011416819,0.00017329938,0.0003456252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004040381,0.0006681443,0.00073338416,0.002631396,0.0017754448,0.0035010923,0.0008451343,0.00082669663,0.0048934654],"category_scores_gemma":[0.0027426642,0.0006080916,0.0005278302,0.0025090193,0.0043659247,0.003389632,0.0013928376,0.0024329026,0.0004524543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000724345,0.000019933168,0.0015258455,0.00004916021,0.000009523173,0.00012209383,0.0002989786,0.0065285647,0.0007936035,0.980453,0.0018425818,0.0082841525],"study_design_scores_gemma":[0.000018609195,0.000017749111,0.0025386924,0.00002168065,0.000015330532,0.00014013222,0.00031142894,0.00911356,0.0005075869,0.9841666,0.003133066,0.00001557932],"about_ca_topic_score_codex":0.003987238,"about_ca_topic_score_gemma":0.004901183,"teacher_disagreement_score":0.0048934654,"about_ca_system_score_codex":0.0013770878,"about_ca_system_score_gemma":0.0004818846,"threshold_uncertainty_score":0.016370237},"labels":[],"label_agreement":null},{"id":"W2097049847","doi":"10.1007/3-540-44985-x_12","title":"On Graph Powers for Leaf-Labeled Trees","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tree (set theory); Graph; Gomory–Hu tree; Combinatorics; Computer science; K-ary tree; Path (computing); Basis (linear algebra); Spanning tree; Time complexity; Node (physics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Tree structure; Mathematics; Artificial intelligence; Binary tree; Physics","score_opus":0.020033376454771587,"score_gpt":0.2843146293703784,"score_spread":0.2642812529156068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097049847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045313474,0.0046123,0.63050705,0.0049116504,0.0013523776,0.00021008741,0.00080045074,0.0012482068,0.31104442],"genre_scores_gemma":[0.53528553,0.008634308,0.26527658,0.0025384275,0.003275055,0.00065486296,0.002324511,0.003322514,0.17868815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835277,0.0006083628,0.000100126075,0.00031045204,0.00045687234,0.00017144218],"domain_scores_gemma":[0.9938725,0.0041826153,0.00024173231,0.00094314234,0.00041727026,0.00034270532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017619468,0.0013764461,0.0014965499,0.00263967,0.0019966566,0.0034911563,0.002177472,0.0015479642,0.021802995],"category_scores_gemma":[0.009490051,0.0013579677,0.0018956492,0.0036703236,0.004888738,0.015609659,0.004575395,0.0070744357,0.0059547094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040222185,0.0000270251,0.00014331687,0.00010513414,0.000007617656,0.00007307153,0.00040656724,0.0011294783,0.0005572282,0.9710189,0.006906033,0.019585446],"study_design_scores_gemma":[0.000005213796,0.0000036909419,0.00004253305,0.000016075588,0.000004601848,0.000047094705,0.000031464064,0.0016928343,0.00017261408,0.99202347,0.005956424,0.000004016407],"about_ca_topic_score_codex":0.0012816021,"about_ca_topic_score_gemma":0.0018941351,"teacher_disagreement_score":0.021802995,"about_ca_system_score_codex":0.0014894145,"about_ca_system_score_gemma":0.00048009836,"threshold_uncertainty_score":0.07293826},"labels":[],"label_agreement":null},{"id":"W2098354393","doi":"10.1093/logcom/exl014","title":"First-order Definable Retraction Problems for Posets and Reflexive Graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Reflexivity; Order (exchange); Mathematics; Star product; Combinatorics; Computer science; Discrete mathematics; Sociology; Business","score_opus":0.033400100698425625,"score_gpt":0.3163988984890406,"score_spread":0.282998797790615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098354393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5901038,0.002081094,0.37078932,0.00470073,0.00027242565,0.00029012037,0.00093084975,0.000922395,0.029909207],"genre_scores_gemma":[0.9201797,0.0011163299,0.068653956,0.0004394876,0.00037626535,0.00025102208,0.0017014471,0.0001236126,0.00715805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997174,0.0005826687,0.0003716756,0.0008119903,0.00065086066,0.0004087317],"domain_scores_gemma":[0.9857098,0.010317172,0.001082281,0.001416738,0.00072252733,0.0007515554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035389087,0.0008182287,0.0012906061,0.0015080674,0.0016692581,0.0048854006,0.0015491423,0.002132353,0.0046147294],"category_scores_gemma":[0.013270154,0.0007394179,0.0025435647,0.001596929,0.005480119,0.018683625,0.0042113205,0.0063848263,0.00050091755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017745573,0.00013527661,0.0013255372,0.00022646599,0.000032634856,0.00037934276,0.0011806026,0.0042225756,0.0029713043,0.96856153,0.0011417134,0.0196456],"study_design_scores_gemma":[0.000051848976,0.00006825059,0.00034287,0.00002396214,0.000020602512,0.00035655915,0.00032882512,0.008836099,0.0028663697,0.98464555,0.0024331692,0.00002588685],"about_ca_topic_score_codex":0.0006631286,"about_ca_topic_score_gemma":0.00073355576,"teacher_disagreement_score":0.0048854006,"about_ca_system_score_codex":0.001796568,"about_ca_system_score_gemma":0.0012766666,"threshold_uncertainty_score":0.01871574},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2098531449","doi":"10.1016/j.dam.2014.08.006","title":"Excluding cycles with a fixed number of chords","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Chromatic scale; Chord (peer-to-peer); Graph; Discrete mathematics; Chordal graph; Computer science","score_opus":0.01986480492450143,"score_gpt":0.2981553816262689,"score_spread":0.2782905767017675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098531449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4799707,0.001323345,0.3518762,0.0020521374,0.00057930493,0.00062817626,0.0021200697,0.0014791716,0.15997085],"genre_scores_gemma":[0.78673756,0.0009217061,0.14625151,0.0008061578,0.00031311373,0.00056973787,0.0023573227,0.001169276,0.06087358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760747,0.0005313318,0.00014465889,0.00068673404,0.00037824208,0.0006514827],"domain_scores_gemma":[0.98527205,0.0062719677,0.000963512,0.004170247,0.001515364,0.0018069072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013722426,0.0016662959,0.0024210059,0.0020522273,0.0043540853,0.0043352484,0.0045838095,0.003164133,0.01711656],"category_scores_gemma":[0.014578837,0.0013222377,0.0020226904,0.002526708,0.0024453553,0.005928899,0.0043844488,0.0034434227,0.0038516808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023143918,0.00029173042,0.0035730351,0.0008773264,0.00021188358,0.00097153324,0.0007318929,0.027102636,0.025000188,0.8557623,0.014057524,0.06910557],"study_design_scores_gemma":[0.00029822826,0.00025818986,0.0010206389,0.00016224569,0.00017686369,0.00089795486,0.00037396024,0.04643105,0.0125249,0.9159709,0.021820176,0.0000647179],"about_ca_topic_score_codex":0.0015264119,"about_ca_topic_score_gemma":0.0023946124,"teacher_disagreement_score":0.01711656,"about_ca_system_score_codex":0.001386159,"about_ca_system_score_gemma":0.0017694479,"threshold_uncertainty_score":0.057260573},"labels":[],"label_agreement":null},{"id":"W2099141182","doi":"10.1002/jgt.20062","title":"Factorizations and characterizations of induced‐hereditary and compositive properties","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Factorization; Graph; Discrete mathematics; Algorithm","score_opus":0.023847712417627,"score_gpt":0.26269614179325573,"score_spread":0.23884842937562872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099141182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63606244,0.0012494198,0.29902682,0.00081908325,0.00019597105,0.00022485653,0.0010535216,0.0006783468,0.060689427],"genre_scores_gemma":[0.9602941,0.00028413875,0.033951275,0.00009028278,0.00017489295,0.00005681496,0.00083215244,0.00007180289,0.0042445688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823844,0.00022690164,0.00016165378,0.0004990204,0.0006150269,0.0002589954],"domain_scores_gemma":[0.9949529,0.0020718814,0.00086532446,0.0009147958,0.00078110857,0.0004139734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011353289,0.0005162686,0.0005195576,0.0022804432,0.0012537851,0.0021731278,0.0006396643,0.0005382272,0.005675247],"category_scores_gemma":[0.005831999,0.0004647871,0.0011833649,0.0014401857,0.0023367417,0.004044434,0.0013115797,0.0014290703,0.00048296392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012988856,0.00016779406,0.005552262,0.00011214384,0.000038528167,0.0005108982,0.000980822,0.0037799363,0.005583157,0.9486915,0.0026873203,0.03176569],"study_design_scores_gemma":[0.00003392903,0.000083649604,0.0035971312,0.00006609219,0.00006621886,0.001388626,0.0003821057,0.030295651,0.0065073324,0.94414115,0.013394612,0.00004357243],"about_ca_topic_score_codex":0.0009903503,"about_ca_topic_score_gemma":0.0009961264,"teacher_disagreement_score":0.005675247,"about_ca_system_score_codex":0.0012496832,"about_ca_system_score_gemma":0.00042081744,"threshold_uncertainty_score":0.01898563},"labels":[],"label_agreement":null},{"id":"W2099449032","doi":"10.1007/s00037-011-0032-2","title":"Special Issue In Memory of Misha Alekhnovich. Foreword","year":2011,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Lomonosov Moscow State University","keywords":"Computer science; Mathematics; Discrete mathematics; Theoretical computer science","score_opus":0.10974431150704561,"score_gpt":0.3271698014169991,"score_spread":0.21742548990995347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099449032","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003773428,0.0137255145,0.00076657825,0.07923346,0.8545453,0.00009010718,0.0008968026,0.0003585945,0.050006326],"genre_scores_gemma":[0.0042832065,0.011403027,0.00036735498,0.01948755,0.61893225,0.00010165545,0.0010329416,0.0005101566,0.34388182],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986093,0.00016548562,0.0001560803,0.0004375043,0.0004716549,0.00015990436],"domain_scores_gemma":[0.9929489,0.0018126174,0.0006413704,0.00043928198,0.0024327987,0.0017250173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001440628,0.0020108875,0.0031114358,0.0024831435,0.0020356684,0.0051928773,0.002208973,0.0041975174,0.28732458],"category_scores_gemma":[0.010700812,0.000605183,0.0009397984,0.0016135289,0.00085937337,0.0050022653,0.002484573,0.0048111314,0.21095972],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005537159,0.000011344293,0.000030877185,0.0001566145,0.000006366036,0.000057734327,0.000011431741,0.000019972573,0.00010639424,0.0008512441,0.9879551,0.010737546],"study_design_scores_gemma":[0.000015277892,0.00002370729,0.0002094422,0.00011650668,0.000007834083,0.00012018459,0.000017423838,0.00008274689,0.00018109918,0.001215471,0.9980021,0.000008308576],"about_ca_topic_score_codex":0.00071290956,"about_ca_topic_score_gemma":0.0009189309,"teacher_disagreement_score":0.28732458,"about_ca_system_score_codex":0.002073633,"about_ca_system_score_gemma":0.0013215861,"threshold_uncertainty_score":0.9611965},"labels":[],"label_agreement":null},{"id":"W2099914933","doi":"10.1145/1240233.1240237","title":"Improved algorithms for weakly chordal graphs","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Treewidth; Clique problem; Split graph; Discrete mathematics; Computational complexity theory; Clique; Time complexity; Algorithm; Graph; Pathwidth; Line graph; 1-planar graph","score_opus":0.03253514641846965,"score_gpt":0.32550833371528026,"score_spread":0.2929731872968106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099914933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01402654,0.00022508006,0.9776293,0.00032752546,0.00007475596,0.00017710075,0.00023482696,0.0033356184,0.003969203],"genre_scores_gemma":[0.13808459,0.0002500961,0.85514283,0.00020582038,0.000117773016,0.00033642122,0.001320413,0.000666366,0.0038757573],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961124,0.00063643866,0.0002861823,0.0009800724,0.0013347244,0.0006502772],"domain_scores_gemma":[0.99373144,0.002217069,0.0003902121,0.0025485037,0.0008712628,0.00024141418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014915314,0.0016076165,0.0016818118,0.0017779819,0.0012977738,0.0022837406,0.0056012305,0.0016030181,0.009624567],"category_scores_gemma":[0.009295243,0.0010307236,0.0017401692,0.0023857902,0.001306918,0.007796089,0.00582508,0.00313906,0.002811411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007724832,0.00063105026,0.0017593579,0.0007029701,0.00012335625,0.00027177992,0.0004748056,0.1575901,0.024526503,0.1782455,0.02228723,0.61261487],"study_design_scores_gemma":[0.00021891319,0.0001265358,0.0005537231,0.000044952976,0.00006781543,0.00023358525,0.00012675658,0.6967981,0.013540792,0.27446115,0.013767885,0.0000597845],"about_ca_topic_score_codex":0.0040102587,"about_ca_topic_score_gemma":0.0057007265,"teacher_disagreement_score":0.009624567,"about_ca_system_score_codex":0.0023890599,"about_ca_system_score_gemma":0.0022092643,"threshold_uncertainty_score":0.032197416},"labels":[],"label_agreement":null},{"id":"W2100478405","doi":"10.1016/j.ejc.2011.09.031","title":"Reduced clique graphs of chordal graphs","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Treewidth; Indifference graph; Interval graph; Split graph; Clique-sum; Pathwidth; Discrete mathematics; Clique; Graph; 1-planar graph; Line graph","score_opus":0.039253829072214,"score_gpt":0.2658061011198843,"score_spread":0.22655227204767028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100478405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8029935,0.000898699,0.08991525,0.0018157196,0.0002196974,0.00023804046,0.0019675759,0.00056743436,0.101384126],"genre_scores_gemma":[0.9529288,0.0004224246,0.02342432,0.00030150122,0.00015207366,0.00012674641,0.0025089919,0.00019684805,0.019938376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912304,0.00020539045,0.000027653663,0.00020095737,0.00025979686,0.00018324406],"domain_scores_gemma":[0.99674535,0.0015033268,0.00035066812,0.00048459004,0.0003584628,0.0005576065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042104116,0.00050780375,0.00084675325,0.0014952032,0.0019201026,0.0027689845,0.0024342386,0.0011285885,0.013576798],"category_scores_gemma":[0.0032351313,0.000662705,0.0008788945,0.0015171965,0.0013544892,0.0020469138,0.0015034239,0.002118381,0.0009924244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041022123,0.00019322072,0.0016977029,0.00034822978,0.00010453381,0.000505783,0.00096503866,0.011596434,0.014252382,0.94225055,0.010047378,0.017628444],"study_design_scores_gemma":[0.0001351549,0.00004353633,0.0025288542,0.000036074303,0.0000752617,0.00034583622,0.0004373658,0.03869013,0.003648664,0.94235545,0.011672891,0.00003063984],"about_ca_topic_score_codex":0.0038278496,"about_ca_topic_score_gemma":0.006234085,"teacher_disagreement_score":0.013576798,"about_ca_system_score_codex":0.0014036401,"about_ca_system_score_gemma":0.0008448899,"threshold_uncertainty_score":0.045418918},"labels":[],"label_agreement":null},{"id":"W2101359548","doi":"10.1093/acprof:oso/9780198571278.003.0002","title":"EULERIAN AND BIPARTITE ORIENTABLE MATROIDS","year":2007,"lang":"en","type":"book-chapter","venue":"Oxford University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Bipartite graph; Eulerian path; Matroid; Combinatorics; Mathematics; Computer science; Pure mathematics; Graph","score_opus":0.03567561002324756,"score_gpt":0.2448858804905198,"score_spread":0.20921027046727222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101359548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51089317,0.0045810966,0.28519425,0.0019757734,0.0002916903,0.000086018605,0.0010693899,0.00030712152,0.19560155],"genre_scores_gemma":[0.9312104,0.002049969,0.035566814,0.00035154837,0.00042571523,0.00006844157,0.0006808804,0.00003994321,0.029606199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978966,0.00003338725,0.00001066801,0.000058534733,0.000057027435,0.00005073078],"domain_scores_gemma":[0.9997062,0.000090281894,0.00007326767,0.000034275607,0.000047321133,0.000048544007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018036028,0.0003307961,0.0001688336,0.0006994245,0.00048216098,0.0008895598,0.00030606127,0.0004587861,0.0040695732],"category_scores_gemma":[0.0006687418,0.00018596777,0.00026449066,0.0009564766,0.0011085158,0.0017534856,0.00067904254,0.00071249524,0.0003415701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000209501,0.000015049292,0.0004963324,0.00003867177,0.000002904482,0.00006212106,0.00019480014,0.0038224077,0.0019730504,0.9775925,0.0012199389,0.014561215],"study_design_scores_gemma":[0.0000104487135,0.00003765034,0.0017428255,0.000042826403,0.000009289583,0.00027969474,0.00019180561,0.02381676,0.0017390889,0.9300812,0.04203426,0.000014071145],"about_ca_topic_score_codex":0.0014627123,"about_ca_topic_score_gemma":0.001347273,"teacher_disagreement_score":0.0040695732,"about_ca_system_score_codex":0.00074173557,"about_ca_system_score_gemma":0.00023149032,"threshold_uncertainty_score":0.0136140585},"labels":[],"label_agreement":null},{"id":"W2101632844","doi":"10.1007/s00454-012-9413-9","title":"Linkless and Flat Embeddings in 3-Space","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Japan Society for the Promotion of Science; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Combinatorics; Mathematics; Embedding; Discrete mathematics; Computer science","score_opus":0.016664740178682233,"score_gpt":0.308982869549456,"score_spread":0.2923181293707737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101632844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72015053,0.0011726471,0.17181513,0.002584564,0.00047067265,0.00008001087,0.0011243324,0.0006279491,0.10197413],"genre_scores_gemma":[0.9440923,0.00047856924,0.019315759,0.00040781722,0.00019783349,0.000058339145,0.0007679731,0.00023108661,0.03445029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995017,0.00009622953,0.000027423454,0.00010850003,0.00015010207,0.00011601919],"domain_scores_gemma":[0.9988564,0.00030462944,0.00020507888,0.00016839223,0.00017413036,0.00029140862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037490693,0.0007404273,0.0005644296,0.0022288605,0.0019140089,0.0029334074,0.0012674737,0.0012874275,0.011106542],"category_scores_gemma":[0.0022914796,0.0005180513,0.0005540287,0.0013309498,0.0024148547,0.005552365,0.0031926318,0.0026237061,0.001424865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007451879,0.000025373067,0.0002797056,0.000029759385,0.000004923196,0.00009708587,0.0002576766,0.0017433551,0.00050752115,0.989592,0.0014656341,0.005922497],"study_design_scores_gemma":[0.000013171187,0.000024611967,0.00037267717,0.000011986647,0.000005937087,0.00010922678,0.00023503244,0.0062356675,0.00030315723,0.98979694,0.0028795777,0.000012006886],"about_ca_topic_score_codex":0.0017551024,"about_ca_topic_score_gemma":0.0019526418,"teacher_disagreement_score":0.011106542,"about_ca_system_score_codex":0.0006792659,"about_ca_system_score_gemma":0.00033501972,"threshold_uncertainty_score":0.03715509},"labels":[],"label_agreement":null},{"id":"W2101752896","doi":"10.1016/s0166-218x(02)00251-2","title":"Finding paths in graphs avoiding forbidden transitions","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Graph isomorphism; Line graph","score_opus":0.04135075435661177,"score_gpt":0.2841048643191326,"score_spread":0.24275410996252084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101752896","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7668735,0.0004346855,0.2210319,0.0007564525,0.000074657895,0.00033649494,0.0015791466,0.0010539758,0.007859282],"genre_scores_gemma":[0.7554616,0.0004678488,0.23499209,0.0001978887,0.000031878462,0.0002041038,0.0024856338,0.000273809,0.0058851726],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995828,0.000091652706,0.000029985105,0.00013450957,0.00006727515,0.00009364079],"domain_scores_gemma":[0.99339163,0.005202912,0.0005700132,0.00028444984,0.00025713982,0.0002939997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052692945,0.00080857036,0.00089168554,0.0016114694,0.0015331608,0.001431171,0.0014672385,0.0013772827,0.0044289986],"category_scores_gemma":[0.005622723,0.00091824646,0.0008987277,0.001795767,0.0011906384,0.002815262,0.0016761003,0.0017185246,0.00047451057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046311086,0.0012447876,0.022452414,0.0030549697,0.00044445178,0.0023156889,0.0028540534,0.28086343,0.04127188,0.24359055,0.015572598,0.38170415],"study_design_scores_gemma":[0.0003995111,0.00051752455,0.002916728,0.00023007859,0.00021758984,0.00075394113,0.0012945852,0.29889318,0.016095389,0.6729611,0.005666046,0.000054369455],"about_ca_topic_score_codex":0.0023179296,"about_ca_topic_score_gemma":0.0036659006,"teacher_disagreement_score":0.0044289986,"about_ca_system_score_codex":0.00067626487,"about_ca_system_score_gemma":0.0011488769,"threshold_uncertainty_score":0.014816523},"labels":[],"label_agreement":null},{"id":"W2101880654","doi":"10.1002/jgt.21637","title":"Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Monotone polygon; Combinatorics; Graph; Forcing (mathematics); Path (computing); Minor (academic); Tree (set theory); Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.01925852887274516,"score_gpt":0.28743283386172175,"score_spread":0.2681743049889766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101880654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68517137,0.00032914922,0.29275173,0.0004260092,0.000064788226,0.000043480213,0.00032972006,0.00029087788,0.020592859],"genre_scores_gemma":[0.9729614,0.000120578225,0.024608908,0.00006285182,0.00005626773,0.000066971676,0.00012678509,0.00011108048,0.0018851715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991333,0.00026793245,0.000066217326,0.00020617501,0.00018872917,0.00013763692],"domain_scores_gemma":[0.9893504,0.0068567386,0.0010718805,0.0009969219,0.00076332706,0.00096084946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017513894,0.0004125882,0.00043792615,0.001922545,0.0009369878,0.0021236907,0.0009941747,0.0008648266,0.0034469196],"category_scores_gemma":[0.009235154,0.00033796945,0.0004584446,0.00069793034,0.0030598291,0.0034734143,0.0017014552,0.0014108085,0.00031744948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001525289,0.000043985965,0.004945216,0.00007588397,0.000016124395,0.00014162465,0.00039413088,0.011984931,0.01751662,0.95201623,0.0009329246,0.011779779],"study_design_scores_gemma":[0.000027316148,0.00010472259,0.0028792836,0.00004996852,0.000016843505,0.00045010628,0.00031071942,0.06794512,0.010678129,0.9148034,0.002673722,0.00006081902],"about_ca_topic_score_codex":0.00045455978,"about_ca_topic_score_gemma":0.00063741446,"teacher_disagreement_score":0.0034469196,"about_ca_system_score_codex":0.0007165485,"about_ca_system_score_gemma":0.0003728397,"threshold_uncertainty_score":0.011531055},"labels":[],"label_agreement":null},{"id":"W2102110641","doi":"10.1016/j.jctb.2006.02.008","title":"Mutually embeddable graphs and the tree alternative conjecture","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Wilfrid Laurier University","funders":"Division of Mathematical Sciences","keywords":"Mathematics; Combinatorics; Conjecture; Tree (set theory); Vertex (graph theory); Discrete mathematics; Embedding; Graph; Computer science","score_opus":0.006309784519698531,"score_gpt":0.2422969169776194,"score_spread":0.23598713245792088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102110641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6504841,0.0017157897,0.12068984,0.016237909,0.0005845817,0.000055398777,0.0008434892,0.00045626305,0.20893268],"genre_scores_gemma":[0.9713362,0.0007139892,0.015734421,0.0008269109,0.00027258007,0.00004649006,0.00054431305,0.00008532624,0.010439735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988738,0.0003599635,0.000041986637,0.0002752715,0.00023825218,0.00021063391],"domain_scores_gemma":[0.99340254,0.0041573686,0.00057573605,0.0010934791,0.00035896548,0.0004119396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012590518,0.00045803317,0.0007984088,0.00096843956,0.0021449714,0.0037236346,0.0013849773,0.0028221835,0.012015816],"category_scores_gemma":[0.007378918,0.0006511258,0.00075053534,0.0015026812,0.0034274778,0.008657591,0.0032219419,0.0037596477,0.0011630224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009145852,0.0000311915,0.0005760308,0.00004570922,0.000009631946,0.00017898018,0.00034609728,0.0011720938,0.0005289244,0.9891261,0.002551488,0.005342278],"study_design_scores_gemma":[0.000016729413,0.0000072046655,0.0001600581,0.0000107375,0.000009234287,0.00014172614,0.00017866946,0.0024600239,0.00019766121,0.9944806,0.002330979,0.0000063123953],"about_ca_topic_score_codex":0.00082342344,"about_ca_topic_score_gemma":0.0014988384,"teacher_disagreement_score":0.012015816,"about_ca_system_score_codex":0.0007676471,"about_ca_system_score_gemma":0.0004012442,"threshold_uncertainty_score":0.040196896},"labels":[],"label_agreement":null},{"id":"W2102459557","doi":"10.2168/lmcs-8(1:7)2012","title":"Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Fundacja na rzecz Nauki Polskiej; Grantová Agentura České Republiky","keywords":"Unanimity; Mathematics; Conjecture; Constraint satisfaction problem; Variety (cybernetics); Characterization (materials science); Constraint (computer-aided design); Pure mathematics; Universal algebra; Combinatorics; Discrete mathematics; Algebra over a field","score_opus":0.05866841925032519,"score_gpt":0.3937555524694554,"score_spread":0.33508713321913025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102459557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58176035,0.001128717,0.36276314,0.004775602,0.000087180844,0.0000965666,0.0003510061,0.00036005946,0.048677266],"genre_scores_gemma":[0.9593247,0.00044960773,0.033881683,0.0003321557,0.00013627524,0.0000991691,0.00033289936,0.00004558254,0.0053978534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832124,0.000531459,0.000117167336,0.00032037986,0.00045656302,0.00025315725],"domain_scores_gemma":[0.9959449,0.002658616,0.0004003011,0.00039513616,0.00035498175,0.00024594262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012975365,0.0002438261,0.0004722567,0.0008619681,0.0018622042,0.0021732831,0.0009476263,0.0008182228,0.0024814478],"category_scores_gemma":[0.0042725513,0.0003253167,0.0008561972,0.0011846595,0.004006889,0.006446777,0.0023484095,0.0026822635,0.00031450603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002368919,0.000025028075,0.0003060907,0.000022977172,0.0000053500485,0.00006116818,0.00024698267,0.0022505007,0.00090949406,0.9905691,0.0004466967,0.0051328912],"study_design_scores_gemma":[0.000007847594,0.000011182075,0.000122037054,0.0000068710983,0.0000055328155,0.000059562502,0.00010399373,0.00976914,0.0010371034,0.9872728,0.0015933271,0.000010722492],"about_ca_topic_score_codex":0.0020858136,"about_ca_topic_score_gemma":0.0014376856,"teacher_disagreement_score":0.0024814478,"about_ca_system_score_codex":0.0015624446,"about_ca_system_score_gemma":0.0013526691,"threshold_uncertainty_score":0.011336386},"labels":[],"label_agreement":null},{"id":"W2102761613","doi":"10.1016/j.disc.2009.04.032","title":"Homomorphisms of triangle-free graphs without a <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-minor","year":2009,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Univerzita Karlova v Praze","keywords":"Mathematics; Homomorphism; Combinatorics; Conjecture; Graph; Minor (academic); Graph homomorphism; Discrete mathematics; Planar graph; Graph minor; Line graph; Graph power","score_opus":0.023136840028414683,"score_gpt":0.26391603190692375,"score_spread":0.24077919187850907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102761613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37283084,0.00073941617,0.39354065,0.0012737875,0.0010578651,0.00031523398,0.0018971325,0.003134185,0.22521089],"genre_scores_gemma":[0.88146275,0.00049306825,0.045991857,0.0005678775,0.00033724948,0.00022463579,0.00245959,0.0007056749,0.06775733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990269,0.00020047385,0.00006612963,0.00031198765,0.00020780916,0.00018669401],"domain_scores_gemma":[0.99683577,0.0011848366,0.00035311276,0.0005900389,0.000512957,0.0005232004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007060476,0.00045438783,0.00030013183,0.0012863067,0.0012457756,0.0015507732,0.0011264891,0.00058294256,0.021787105],"category_scores_gemma":[0.0038258808,0.00044653792,0.00092999043,0.0008839049,0.0011533409,0.0039597643,0.0016625988,0.0012572209,0.0032820767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024397619,0.0001348969,0.0009620803,0.00018856218,0.000027719818,0.000552334,0.0011993626,0.0010173598,0.0063852244,0.9451531,0.00896286,0.03517258],"study_design_scores_gemma":[0.00009564705,0.00015466425,0.001640187,0.000057647267,0.000059403555,0.0016130899,0.00074907625,0.0067198174,0.010089272,0.93947214,0.03929229,0.000056703862],"about_ca_topic_score_codex":0.0010703192,"about_ca_topic_score_gemma":0.0011056866,"teacher_disagreement_score":0.021787105,"about_ca_system_score_codex":0.00074463186,"about_ca_system_score_gemma":0.0005153271,"threshold_uncertainty_score":0.072885156},"labels":[],"label_agreement":null},{"id":"W2102862468","doi":"10.1016/j.tcs.2005.10.002","title":"Simplifying the weft hierarchy","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Hierarchy; Normalization (sociology); Monotone polygon; Simple (philosophy); Mathematics; Discrete mathematics; Combinatorics; Calculus (dental); Algebra over a field; Pure mathematics; Philosophy; Epistemology; Geometry","score_opus":0.017219545451255067,"score_gpt":0.3028416063272443,"score_spread":0.2856220608759892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102862468","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17544329,0.0018251548,0.30968413,0.009169406,0.0010509413,0.00007924135,0.00043951007,0.0016969114,0.5006114],"genre_scores_gemma":[0.8566135,0.0013656196,0.053060398,0.0014386011,0.0006084671,0.00008181692,0.00044354628,0.0009858012,0.085402235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899524,0.00022359329,0.000032804914,0.00017596495,0.00028884117,0.00028362777],"domain_scores_gemma":[0.9977804,0.0005978055,0.000114668685,0.0010055786,0.00028521646,0.00021638778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006476661,0.0005749464,0.0010691015,0.0013389323,0.0030267774,0.002468652,0.0015791587,0.0014923776,0.022020139],"category_scores_gemma":[0.004539668,0.0005269256,0.0010677304,0.0011908244,0.0036613804,0.009477835,0.004163448,0.0048791575,0.004411975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022721886,0.000013651626,0.0000585021,0.000021192584,0.0000034019783,0.000025924053,0.00015573014,0.0005549217,0.0004209226,0.9889915,0.0036298153,0.006101634],"study_design_scores_gemma":[0.000008958472,0.000006030066,0.000044321245,0.000011429913,0.0000051233787,0.000030412897,0.000059223483,0.0027451497,0.0002507727,0.98837847,0.008454,0.0000061345954],"about_ca_topic_score_codex":0.003430745,"about_ca_topic_score_gemma":0.004710073,"teacher_disagreement_score":0.022020139,"about_ca_system_score_codex":0.0016054421,"about_ca_system_score_gemma":0.00096812204,"threshold_uncertainty_score":0.073664665},"labels":[],"label_agreement":null},{"id":"W2103183688","doi":"10.1002/jgt.21819","title":"A Proof of a Conjecture of Ohba","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Conjecture; Mathematics; Combinatorics","score_opus":0.010952511875215414,"score_gpt":0.2700981083827483,"score_spread":0.2591455965075329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103183688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37588158,0.0037922864,0.31270623,0.12062004,0.007966127,0.00044137935,0.0026460583,0.0029019348,0.17304441],"genre_scores_gemma":[0.9453357,0.0009232246,0.0348279,0.008007078,0.0023106823,0.0002136556,0.0012918332,0.0002589018,0.0068310914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947307,0.0012239257,0.00024045371,0.0015658346,0.0011082231,0.001130733],"domain_scores_gemma":[0.9458393,0.03641411,0.002047609,0.0067982674,0.0055711744,0.0033295236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004960157,0.0013611666,0.0020819998,0.0017590048,0.004075027,0.0033434615,0.0036958577,0.0037615127,0.02142763],"category_scores_gemma":[0.038014386,0.0010664546,0.0030385356,0.0028026337,0.008511939,0.012401467,0.0075780624,0.009903209,0.0018810137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075444125,0.00061453035,0.006209044,0.0010356177,0.00018680721,0.0009593446,0.0018454749,0.010416607,0.0048425538,0.8845728,0.069377795,0.019184882],"study_design_scores_gemma":[0.00022619436,0.00016470291,0.0016602536,0.00011401841,0.000092509,0.0003995114,0.0005242244,0.019752972,0.0017927369,0.95637184,0.018854557,0.000046475427],"about_ca_topic_score_codex":0.004261022,"about_ca_topic_score_gemma":0.0021396168,"teacher_disagreement_score":0.02142763,"about_ca_system_score_codex":0.0025006735,"about_ca_system_score_gemma":0.0016831831,"threshold_uncertainty_score":0.07168257},"labels":[],"label_agreement":null},{"id":"W2104070086","doi":"10.1007/s10878-012-9462-2","title":"Finding paths with minimum shared edges","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Disjoint sets; Heuristics; Theory of computation; Combinatorics; Mathematics; Approximation algorithm; Generalization; Graph; Maximum flow problem; Constant (computer programming); Discrete mathematics; Computer science; Algorithm; Mathematical optimization","score_opus":0.021607571279802694,"score_gpt":0.2802607690312165,"score_spread":0.2586531977514138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104070086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5900702,0.0007727424,0.37976646,0.0018680901,0.00020524119,0.00085728645,0.003273414,0.0012895047,0.021897044],"genre_scores_gemma":[0.5507021,0.00041191094,0.43530974,0.00021678006,0.00006640264,0.00054052245,0.0030333574,0.00049710966,0.009222184],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988311,0.0003327129,0.000065800086,0.00037478708,0.00017798343,0.00021758895],"domain_scores_gemma":[0.9939507,0.0037241026,0.0005989534,0.0007356146,0.0005010341,0.0004894935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094263884,0.0016242224,0.0018793028,0.0023896545,0.0020272494,0.0018241501,0.0029707048,0.0029339471,0.015695103],"category_scores_gemma":[0.010552505,0.0014645752,0.0016211508,0.0027072227,0.0010891535,0.0052269245,0.0032501456,0.0020832869,0.0017765277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004305201,0.001975148,0.01093813,0.0031364826,0.0007570296,0.0013318716,0.0015332416,0.29829276,0.03552224,0.13764885,0.031642668,0.47291645],"study_design_scores_gemma":[0.0008399746,0.0013430695,0.0036743293,0.00037493222,0.0004342965,0.0010836383,0.0018219431,0.50564384,0.018951686,0.45315388,0.012593009,0.00008543588],"about_ca_topic_score_codex":0.0011108869,"about_ca_topic_score_gemma":0.0024381424,"teacher_disagreement_score":0.015695103,"about_ca_system_score_codex":0.0009910672,"about_ca_system_score_gemma":0.0020551444,"threshold_uncertainty_score":0.052505314},"labels":[],"label_agreement":null},{"id":"W2104859703","doi":"10.1016/j.disc.2006.04.031","title":"Construction of trees and graphs with equal domination parameters","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Constructive; Domination analysis; Characterization (materials science); Combinatorics; Simple (philosophy); Discrete mathematics; Constructive proof; Tree (set theory); Graph; Process (computing); Computer science; Vertex (graph theory)","score_opus":0.012808463335140137,"score_gpt":0.2573611950184089,"score_spread":0.24455273168326874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104859703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22113085,0.00034914608,0.7187222,0.00084823364,0.0001496048,0.00017309454,0.00044541623,0.000863089,0.057318356],"genre_scores_gemma":[0.7036509,0.00043119662,0.2769017,0.00032616634,0.000071872746,0.00022688622,0.00059348205,0.0005689798,0.017228799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993481,0.00016923794,0.00003402335,0.00012687345,0.00018077827,0.00014092312],"domain_scores_gemma":[0.997827,0.00088685733,0.00017542961,0.0005129531,0.0002761022,0.00032160638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064454443,0.00047235147,0.000699049,0.0012203,0.0014078773,0.0020810033,0.0013207827,0.001223971,0.005246314],"category_scores_gemma":[0.003006243,0.00072473637,0.0008313555,0.0013458405,0.0015983081,0.0025085767,0.0025300775,0.0024928534,0.0010988577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084238614,0.00005318186,0.00051577954,0.00007161091,0.000014478354,0.00018025126,0.00042721396,0.0041359165,0.0093361335,0.9595935,0.001845449,0.023742225],"study_design_scores_gemma":[0.000039576313,0.000023071672,0.00039183427,0.000029851552,0.000026944312,0.00023402402,0.00018053132,0.014131826,0.0068487595,0.9678124,0.010256561,0.000024595223],"about_ca_topic_score_codex":0.00044176134,"about_ca_topic_score_gemma":0.0009597236,"teacher_disagreement_score":0.005246314,"about_ca_system_score_codex":0.00093354634,"about_ca_system_score_gemma":0.0007449108,"threshold_uncertainty_score":0.017550647},"labels":[],"label_agreement":null},{"id":"W2105667010","doi":"10.1007/s00453-010-9455-4","title":"Dynamic vs. Oblivious Routing in Network Design","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Static routing; Multipath routing; Theory of computation; Routing (electronic design automation); Polytope; Mathematical optimization; Routing protocol; Computer network; Mathematics; Algorithm; Combinatorics","score_opus":0.013234180198838406,"score_gpt":0.27650703787089886,"score_spread":0.26327285767206043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105667010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15498982,0.008590531,0.762636,0.010685655,0.00046284424,0.0001565478,0.0003023633,0.00049170235,0.061684422],"genre_scores_gemma":[0.9387356,0.002830751,0.047040164,0.0006630771,0.00040544727,0.00015216094,0.000112529815,0.00016853125,0.009891732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979824,0.0009672955,0.00008369125,0.0002781712,0.00042898313,0.00025951662],"domain_scores_gemma":[0.99278414,0.004447991,0.00053423404,0.0016253574,0.00036130784,0.00024694926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029848318,0.00052380835,0.0005904163,0.00079109194,0.0009793713,0.0022573962,0.0013886688,0.001131122,0.0055080755],"category_scores_gemma":[0.00923081,0.00056473044,0.00033520054,0.0009459051,0.0025329576,0.008190613,0.0022150562,0.0016220147,0.0007373878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004968823,0.00009090104,0.00096938136,0.00026882614,0.000045788893,0.00004493967,0.00020148786,0.09180381,0.002826905,0.80351603,0.0043711113,0.09536388],"study_design_scores_gemma":[0.00006983571,0.00016444648,0.00033852848,0.000055143435,0.000056190675,0.00013633235,0.00012756909,0.13882732,0.0029394142,0.8473139,0.009948197,0.00002311014],"about_ca_topic_score_codex":0.00042709833,"about_ca_topic_score_gemma":0.001016412,"teacher_disagreement_score":0.0055080755,"about_ca_system_score_codex":0.0017606181,"about_ca_system_score_gemma":0.0010655608,"threshold_uncertainty_score":0.0184263},"labels":[],"label_agreement":null},{"id":"W2106280765","doi":"10.1016/j.disc.2005.04.004","title":"Edge-disjoint spanners in Cartesian products of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Cartesian product; Mathematics; Disjoint sets; Hypercube; Discrete mathematics; Graph; Cograph; Chordal graph; 1-planar graph","score_opus":0.021931015845525842,"score_gpt":0.2876060824299282,"score_spread":0.2656750665844023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106280765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8358892,0.00065819535,0.13690558,0.0002941242,0.000118890835,0.00005324591,0.00034981835,0.0002866417,0.025444388],"genre_scores_gemma":[0.93170255,0.0007918149,0.049190722,0.00014027358,0.0001313688,0.000091328606,0.0006985926,0.00013904677,0.017114246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903286,0.00022356227,0.00009773448,0.00027016565,0.00022626552,0.00014942136],"domain_scores_gemma":[0.9964205,0.0016276977,0.0006196915,0.00035765374,0.00043848052,0.0005360313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009498513,0.0005868878,0.00080961734,0.0018047531,0.0014428763,0.002316423,0.0009406373,0.00074903696,0.005752534],"category_scores_gemma":[0.003062405,0.0008932801,0.0006021039,0.002038591,0.0019403415,0.004371409,0.0024746058,0.0011603157,0.0008522734],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001868931,0.000072802315,0.00217208,0.00013527411,0.000035805362,0.00040406402,0.0014086297,0.002840673,0.0035670858,0.9684863,0.0014785456,0.019211713],"study_design_scores_gemma":[0.000018903163,0.000066228735,0.0009186964,0.000025503787,0.00003307105,0.00038509656,0.00039802643,0.0044550207,0.0016481281,0.98775357,0.0042835157,0.000014364799],"about_ca_topic_score_codex":0.00049192813,"about_ca_topic_score_gemma":0.00092388503,"teacher_disagreement_score":0.005752534,"about_ca_system_score_codex":0.00037407991,"about_ca_system_score_gemma":0.0003675813,"threshold_uncertainty_score":0.019244134},"labels":[],"label_agreement":null},{"id":"W2107127602","doi":"10.1016/j.disc.2014.12.014","title":"Vertex elimination orderings for hereditary graph classes","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Université de Lyon; EGIDE; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; Providence Health Care; Agence Nationale de la Recherche; Ministère de l'Europe et des Affaires Étrangères","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Property (philosophy); Graph","score_opus":0.049916631788807925,"score_gpt":0.3235960227806383,"score_spread":0.27367939099183036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107127602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68073654,0.0005646997,0.16823475,0.0019964098,0.00033938268,0.00012799937,0.001321378,0.00068251364,0.14599633],"genre_scores_gemma":[0.9300251,0.00054879347,0.029406894,0.0004201999,0.0002900927,0.000120368735,0.0016264169,0.00035810904,0.037203934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904984,0.00016878614,0.000051081577,0.00016681512,0.00026987027,0.00029363923],"domain_scores_gemma":[0.99686605,0.00155884,0.0003183898,0.0003503838,0.00035764807,0.00054867537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008802635,0.00052238913,0.00067208504,0.0024519116,0.0026008885,0.003890293,0.0011695715,0.00083889894,0.009551727],"category_scores_gemma":[0.0028506808,0.00057203165,0.00077396363,0.002229396,0.0023276727,0.0042829746,0.0013274547,0.002632951,0.0008783001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004618582,0.000054827564,0.0007464044,0.000029389821,0.000006859347,0.000070296,0.00035569712,0.0007061812,0.0008571867,0.984797,0.0022275914,0.010102344],"study_design_scores_gemma":[0.000024562949,0.000014569647,0.0007167339,0.000014106902,0.000013456408,0.000088841436,0.00020623107,0.003853591,0.00073289336,0.99001735,0.004306461,0.000011255824],"about_ca_topic_score_codex":0.0027142484,"about_ca_topic_score_gemma":0.0055730212,"teacher_disagreement_score":0.009551727,"about_ca_system_score_codex":0.0019524891,"about_ca_system_score_gemma":0.0010921083,"threshold_uncertainty_score":0.031953752},"labels":[],"label_agreement":null},{"id":"W2108904442","doi":"10.1007/3-540-47867-1_7","title":"Finding the Exact Integrality Gap for Small Traveling Salesman Problems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Travelling salesman problem; Conjecture; Hamiltonian path; Hamiltonian (control theory); Combinatorics; Graph; Relaxation (psychology); Computer science; Exponential function; Combinatorial optimization; Metric (unit); Exact solutions in general relativity; Upper and lower bounds; Mathematics; Discrete mathematics; Algorithm; Mathematical optimization","score_opus":0.08844292964791423,"score_gpt":0.30615174587006055,"score_spread":0.21770881622214633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108904442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42200232,0.005987627,0.42639253,0.006284885,0.00077467656,0.00018333917,0.0006102663,0.0011147797,0.13664955],"genre_scores_gemma":[0.90631247,0.0023686828,0.07505626,0.0006788234,0.0005447149,0.00025828704,0.0006105319,0.00056609145,0.013604147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990969,0.00023608563,0.000035567537,0.00019809224,0.00023117161,0.00020213512],"domain_scores_gemma":[0.98585284,0.01198095,0.00049119216,0.00054172,0.0004382631,0.00069503806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023173387,0.0013881114,0.002112778,0.0022166627,0.0014223007,0.003149928,0.0034743226,0.0018647246,0.012012307],"category_scores_gemma":[0.023734784,0.0011385705,0.0010990629,0.0019295306,0.003103626,0.0114423325,0.0032569263,0.006442563,0.0008706672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047893904,0.00036083837,0.0012156921,0.000662118,0.000067526635,0.00015739782,0.00050613785,0.050384764,0.002874566,0.8846143,0.009650722,0.049027022],"study_design_scores_gemma":[0.00003647189,0.00004653944,0.00030890087,0.00005736571,0.000032118965,0.00009705815,0.00012720075,0.1022492,0.0007513496,0.8945017,0.0017768067,0.000015403444],"about_ca_topic_score_codex":0.0008585055,"about_ca_topic_score_gemma":0.0007907064,"teacher_disagreement_score":0.012012307,"about_ca_system_score_codex":0.002207727,"about_ca_system_score_gemma":0.0012804619,"threshold_uncertainty_score":0.040185153},"labels":[],"label_agreement":null},{"id":"W2109176424","doi":"10.1002/9780470400531.eorms0364","title":"Graph Search Techniques","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Computer science; Combinatorics; Theoretical computer science; Mixed graph; Mathematics; Line graph; Voltage graph","score_opus":0.03820311529316924,"score_gpt":0.3466017202286572,"score_spread":0.308398604935488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109176424","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007725077,0.00699016,0.9200406,0.0020897607,0.00033192398,0.00027144948,0.0006380684,0.0009910128,0.06092198],"genre_scores_gemma":[0.2393578,0.010100785,0.69819194,0.0012649923,0.00063909707,0.0006034786,0.0028023254,0.0007710573,0.04626853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980812,0.00066135713,0.00009888887,0.00053180725,0.00044774462,0.00017906804],"domain_scores_gemma":[0.99729,0.0015175475,0.00014179728,0.0007173529,0.00024356956,0.00008971462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013564904,0.001262327,0.0012427742,0.003129409,0.001266202,0.0026929358,0.002991041,0.001993183,0.021350795],"category_scores_gemma":[0.0063105,0.0006079841,0.0020126377,0.004841112,0.001386658,0.005324485,0.0033904875,0.0026710262,0.0048636612],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085471635,0.00013262253,0.00063951686,0.0007570422,0.00014708145,0.00014303353,0.00026072547,0.06476366,0.0015125091,0.7061038,0.034364514,0.19108993],"study_design_scores_gemma":[0.000057761063,0.000055068547,0.00023661356,0.000184445,0.000063234744,0.0002891862,0.00014793954,0.21436898,0.0010353412,0.7147228,0.068813786,0.000024830812],"about_ca_topic_score_codex":0.003399892,"about_ca_topic_score_gemma":0.0035958707,"teacher_disagreement_score":0.021350795,"about_ca_system_score_codex":0.0020783392,"about_ca_system_score_gemma":0.0016085759,"threshold_uncertainty_score":0.07142556},"labels":[],"label_agreement":null},{"id":"W2109693504","doi":"10.1145/1667053.1667060","title":"A constructive proof of the general lovász local lemma","year":2010,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":468,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Stavros Niarchos Foundation; Hungarian Scientific Research Fund","keywords":"Lemma (botany); Constructive; Constructive proof; Computer science; Mathematics; Discrete mathematics; Calculus (dental); Programming language; Process (computing)","score_opus":0.016981778734048606,"score_gpt":0.29607084622685104,"score_spread":0.27908906749280243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109693504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012964553,0.0016624725,0.89813685,0.0034313586,0.0006600666,0.00017388714,0.00043693298,0.0011837729,0.081350096],"genre_scores_gemma":[0.4710459,0.0029936894,0.48155323,0.0036982787,0.001340128,0.00062801794,0.0009277047,0.0009562234,0.036856763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974287,0.0007497127,0.00010435431,0.00046406966,0.0009269655,0.0003260971],"domain_scores_gemma":[0.99513936,0.0027024925,0.00023418703,0.0006999753,0.0009432478,0.0002807346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002886405,0.0013356495,0.0011799717,0.0020487148,0.0024842636,0.003575466,0.0025932328,0.0012864941,0.016971493],"category_scores_gemma":[0.008677586,0.0009939995,0.002068537,0.0019142184,0.0054966416,0.0046117455,0.006580953,0.0047306474,0.0047153765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004108459,0.000060816852,0.00019289934,0.0002048728,0.000026633099,0.00021302955,0.0003889145,0.0031753948,0.0032056621,0.9642188,0.0072699036,0.021002097],"study_design_scores_gemma":[0.00008719756,0.000064800275,0.00026865833,0.000109679306,0.00006998073,0.0004260482,0.00018477246,0.013097571,0.0055674575,0.92458487,0.055472214,0.00006673629],"about_ca_topic_score_codex":0.0011535402,"about_ca_topic_score_gemma":0.0021246246,"teacher_disagreement_score":0.016971493,"about_ca_system_score_codex":0.0019017129,"about_ca_system_score_gemma":0.002116103,"threshold_uncertainty_score":0.05677533},"labels":[],"label_agreement":null},{"id":"W2109716789","doi":"10.1016/s0166-218x(00)00221-3","title":"On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":208,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bounded function; Treewidth; Combinatorics; Monadic predicate calculus; Enumeration; Discrete mathematics; Clique-width; Time complexity; Graph; Second-order logic; Computational complexity theory; Upper and lower bounds; Clique; Pathwidth; Algorithm; Line graph; Computer science; Theoretical computer science","score_opus":0.061928593949755986,"score_gpt":0.28571349968552445,"score_spread":0.22378490573576848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109716789","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5915334,0.0046225665,0.30334595,0.01649197,0.00034265913,0.00029288398,0.002070631,0.0009757336,0.0803242],"genre_scores_gemma":[0.954481,0.0016812894,0.029021313,0.0006455954,0.00046253036,0.00027684506,0.0015697906,0.00035204925,0.011509603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99376136,0.0021693998,0.00029589844,0.0011172858,0.0014818263,0.0011742475],"domain_scores_gemma":[0.91556174,0.07548557,0.0027406104,0.0032588101,0.0013352752,0.001618057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005181745,0.0017444271,0.0040248744,0.0032079269,0.0033014053,0.012156901,0.0061365822,0.0043926826,0.012251028],"category_scores_gemma":[0.03726053,0.0017663757,0.0036780615,0.005962366,0.007936001,0.034172118,0.0048360215,0.012965173,0.00070692314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005015825,0.0002592842,0.0018998857,0.00037518676,0.00013162183,0.00021003062,0.0009234013,0.048807032,0.0009885556,0.92811245,0.0038303589,0.013960587],"study_design_scores_gemma":[0.00005300789,0.000028455592,0.00047666018,0.000027365058,0.000052267562,0.00005727695,0.00017211711,0.05129047,0.00038929514,0.9466656,0.0007561978,0.000031356398],"about_ca_topic_score_codex":0.0056383573,"about_ca_topic_score_gemma":0.0056739096,"teacher_disagreement_score":0.012251028,"about_ca_system_score_codex":0.008603261,"about_ca_system_score_gemma":0.0031439732,"threshold_uncertainty_score":0.062421322},"labels":[],"label_agreement":null},{"id":"W2109981504","doi":"10.1007/s11083-010-9167-z","title":"A Note on Schnyder’s Theorem","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partially ordered set; Graph; Dimension (graph theory); Ordered set; Antichain; Algebra over a field; Graph theory","score_opus":0.014968786426241274,"score_gpt":0.3140181872646999,"score_spread":0.2990494008384586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109981504","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04203318,0.005870061,0.3001394,0.06014695,0.01212555,0.00010933399,0.0009762189,0.0011761923,0.57742316],"genre_scores_gemma":[0.5813293,0.010095495,0.16734274,0.023385774,0.013670422,0.00032228485,0.001072203,0.0012837071,0.20149808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815136,0.00035679503,0.00009636935,0.00047981876,0.00065475365,0.00026085167],"domain_scores_gemma":[0.9933241,0.0038773033,0.00018341896,0.001229786,0.0010502528,0.0003352476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022935432,0.0008384898,0.0013778743,0.0032534595,0.0051447214,0.0027160186,0.0025371197,0.0023633486,0.016968343],"category_scores_gemma":[0.007136739,0.0006786133,0.0018104695,0.0033702638,0.008039429,0.013250662,0.0045081573,0.006320297,0.002629836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019291558,0.00001210696,0.000079723715,0.00003995405,0.0000075618614,0.000041991174,0.00016506492,0.00030280015,0.00016932712,0.98047835,0.013457054,0.0052267737],"study_design_scores_gemma":[0.0000050139392,0.0000042742563,0.00006897076,0.0000074557292,0.0000062035874,0.000038092327,0.00003376293,0.00038876745,0.00019234486,0.9817067,0.017539257,0.000009171622],"about_ca_topic_score_codex":0.0052827243,"about_ca_topic_score_gemma":0.0050108237,"teacher_disagreement_score":0.016968343,"about_ca_system_score_codex":0.0027389133,"about_ca_system_score_gemma":0.0013927241,"threshold_uncertainty_score":0.056764722},"labels":[],"label_agreement":null},{"id":"W2110393165","doi":"10.37236/3153","title":"Nonrepetitive Colourings of Planar Graphs with $O(\\log n)$ Colours","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Australian Research Council; Australian Government","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Chromatic scale; Graph; Bounded function; Outerplanar graph; Upper and lower bounds; Path (computing); Discrete mathematics; Pathwidth; Line graph; Computer science","score_opus":0.006035786116298683,"score_gpt":0.22902869584575372,"score_spread":0.22299290972945504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110393165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5680768,0.0025412238,0.34596673,0.0029262532,0.00023080508,0.00040117107,0.0015175636,0.00276821,0.075571254],"genre_scores_gemma":[0.7746549,0.001985227,0.19180189,0.00105744,0.00030002673,0.00038127517,0.0031888543,0.0014402423,0.025190197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975581,0.0005972763,0.00013897642,0.000603794,0.0005022448,0.0005996226],"domain_scores_gemma":[0.97877216,0.014264985,0.0020862406,0.0034468763,0.0006897836,0.00073993456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010964737,0.0013925047,0.0008984075,0.0011458544,0.0020787308,0.0031318215,0.004031861,0.0014760864,0.013335426],"category_scores_gemma":[0.011024633,0.0013776126,0.0013606468,0.0018778811,0.0033069048,0.0074772574,0.0036597368,0.002805794,0.002757115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002293495,0.00084946974,0.009880831,0.0021986559,0.00025879202,0.0017122253,0.0023289816,0.16058639,0.095954545,0.5152998,0.033533543,0.17510325],"study_design_scores_gemma":[0.00025501425,0.00036608236,0.0050095255,0.0001582494,0.00021276354,0.001655678,0.0005607019,0.22483225,0.029789768,0.7136522,0.023394037,0.00011381745],"about_ca_topic_score_codex":0.0029682894,"about_ca_topic_score_gemma":0.008144014,"teacher_disagreement_score":0.013335426,"about_ca_system_score_codex":0.0023816037,"about_ca_system_score_gemma":0.001111188,"threshold_uncertainty_score":0.044611454},"labels":[],"label_agreement":null},{"id":"W2111678564","doi":"10.1002/jgt.20613","title":"Kempe Equivalence of Edge‐Colorings in Subcubic and Subquartic Graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Equivalence (formal languages); Edge coloring; Graph; Enhanced Data Rates for GSM Evolution; Cubic graph; Discrete mathematics; Line graph; Voltage graph; Graph power; Computer science","score_opus":0.03657459361179385,"score_gpt":0.2746048405043239,"score_spread":0.23803024689253002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111678564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8791441,0.00027999072,0.05889173,0.00040693287,0.00013543016,0.000100989855,0.0002665188,0.00022395389,0.060550407],"genre_scores_gemma":[0.98471236,0.00016565982,0.009812494,0.000186497,0.00005536508,0.000038937484,0.00022973938,0.000050779596,0.0047482345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886024,0.00023636129,0.00006540446,0.00027008113,0.0003129129,0.0002550306],"domain_scores_gemma":[0.99654156,0.0019321821,0.00033460863,0.00049696513,0.0003584982,0.00033604834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076430803,0.00027831263,0.00047819084,0.0013899774,0.0014771685,0.0015632921,0.0007686086,0.0006434329,0.0070603844],"category_scores_gemma":[0.004356194,0.00033495965,0.00064422964,0.00073404,0.0020037747,0.0021613385,0.0016536635,0.0016443977,0.00053164345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006834705,0.00014413458,0.0031439837,0.00019770388,0.000050527913,0.0007322736,0.0016606671,0.013723108,0.015809312,0.9275639,0.0027189977,0.033571985],"study_design_scores_gemma":[0.000034969566,0.000072666924,0.0019248319,0.000019404613,0.000019535815,0.00031260433,0.00038537133,0.011302286,0.005888949,0.9761187,0.0038901274,0.000030626714],"about_ca_topic_score_codex":0.001456513,"about_ca_topic_score_gemma":0.0013897755,"teacher_disagreement_score":0.0070603844,"about_ca_system_score_codex":0.0008138271,"about_ca_system_score_gemma":0.00050479453,"threshold_uncertainty_score":0.023619294},"labels":[],"label_agreement":null},{"id":"W2112167630","doi":"10.1016/j.tcs.2009.06.003","title":"The complexity of weighted Boolean #CSP with mixed signs","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Parameterized complexity; Discrete mathematics; Sign (mathematics); Partition (number theory); Weight function; Combinatorics; Function (biology); Boolean function; Polynomial; Affine transformation; Pure mathematics","score_opus":0.025818018430684833,"score_gpt":0.28477121299437513,"score_spread":0.2589531945636903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112167630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5732782,0.000763289,0.36568826,0.0103224665,0.00025335656,0.000313499,0.003922222,0.0013258321,0.044132918],"genre_scores_gemma":[0.9225834,0.00048587704,0.059764776,0.0005684887,0.00034089206,0.00030594575,0.0021424585,0.00046414117,0.013343926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995014,0.0015507363,0.00033104213,0.00070741895,0.0015701803,0.000826572],"domain_scores_gemma":[0.9791485,0.015862681,0.0015544151,0.0014424729,0.0010688476,0.00092310214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025152566,0.0011723974,0.0019551876,0.0012260881,0.0017167772,0.008490958,0.0038097985,0.002557851,0.016493883],"category_scores_gemma":[0.018608687,0.0011469583,0.001989974,0.003207155,0.0027228429,0.016545339,0.0042591165,0.0043343552,0.0012196341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012377285,0.00027137285,0.00225051,0.0006159744,0.00017090805,0.00044524312,0.0005167896,0.10613183,0.004686723,0.8286871,0.011093732,0.043892078],"study_design_scores_gemma":[0.00011559966,0.000037114984,0.00034546887,0.00002311539,0.000059588572,0.00013081991,0.0000956328,0.169024,0.0013813195,0.82738686,0.0013654844,0.000035138957],"about_ca_topic_score_codex":0.0053746505,"about_ca_topic_score_gemma":0.005866896,"teacher_disagreement_score":0.016493883,"about_ca_system_score_codex":0.0036543214,"about_ca_system_score_gemma":0.0036494147,"threshold_uncertainty_score":0.05517757},"labels":[],"label_agreement":null},{"id":"W2113016580","doi":"10.1112/s1461157014000400","title":"Computing symmetry groups of polyhedra","year":2014,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Ministry of Education, India; Hausdorff Research Institute for Mathematics; Mathematisches Forschungsinstitut Oberwolfach; University of Cambridge; Alexander von Humboldt-Stiftung","keywords":"Polyhedron; Mathematics; Integer points in convex polyhedra; Symmetry group; Computation; Symmetry (geometry); Automorphism group; Homogeneous space; Linear programming; Polyhedral combinatorics; Group (periodic table); Integer programming; Combinatorics; Tetrahedral symmetry; Discrete mathematics; Automorphism; Algorithm; Regular polygon; Rotational symmetry; Geometry; Branch and price; Convex set","score_opus":0.018218650123161532,"score_gpt":0.30468759706289866,"score_spread":0.2864689469397371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113016580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44098216,0.00022622546,0.5388727,0.0005201263,0.00014223625,0.00021263167,0.00063171185,0.0012221879,0.017190032],"genre_scores_gemma":[0.84715307,0.000120106066,0.14765257,0.00007834002,0.000068864436,0.00007607355,0.001068912,0.00023788806,0.003544231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990349,0.00024313208,0.000059533573,0.00018414689,0.00031982374,0.0001584942],"domain_scores_gemma":[0.9980241,0.0007851549,0.00017369348,0.00061227224,0.00028920753,0.00011553709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006149738,0.000529559,0.00068757427,0.0011342679,0.0008320688,0.0018438629,0.00081871415,0.0005979323,0.006414391],"category_scores_gemma":[0.0033373036,0.0002879177,0.0011535464,0.00095317705,0.0016248124,0.0031248278,0.0016541375,0.0013384694,0.0009634564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082424877,0.00026310302,0.0069404077,0.00039800047,0.00011615959,0.00048427738,0.0012953244,0.13696532,0.023042532,0.6391896,0.0065670214,0.18391405],"study_design_scores_gemma":[0.00007497338,0.0001546164,0.0006434687,0.000032625754,0.000021426058,0.00011448583,0.00036240276,0.20773804,0.012512892,0.771566,0.006752362,0.000026725114],"about_ca_topic_score_codex":0.0018505026,"about_ca_topic_score_gemma":0.001657156,"teacher_disagreement_score":0.006414391,"about_ca_system_score_codex":0.0008195439,"about_ca_system_score_gemma":0.0006823461,"threshold_uncertainty_score":0.021458268},"labels":[],"label_agreement":null},{"id":"W2113147502","doi":"10.37236/874","title":"A Traceability Conjecture for Oriented Graphs","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Conjecture; Mathematics; Graph; Discrete mathematics","score_opus":0.014957630602982191,"score_gpt":0.27097078705346084,"score_spread":0.2560131564504786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113147502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8938882,0.0002947034,0.07340471,0.0026962245,0.00008584852,0.00006253975,0.0004396381,0.00047242502,0.028655734],"genre_scores_gemma":[0.98705715,0.00026047407,0.0067412267,0.0002908116,0.00008970746,0.000039500523,0.00058699417,0.000062108746,0.0048719267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921966,0.00009340203,0.000044264383,0.00028182546,0.00018032099,0.0001804359],"domain_scores_gemma":[0.9950122,0.0025563652,0.000564023,0.0009639229,0.00043600472,0.00046741357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056653353,0.0004670762,0.00038712425,0.00057053316,0.0011731465,0.001935645,0.0010788275,0.0010279132,0.006147189],"category_scores_gemma":[0.0055707335,0.00045024836,0.00077446096,0.0008350541,0.0023984632,0.004924216,0.001372023,0.0015575412,0.0004854808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053560047,0.0004931106,0.023651943,0.00034090874,0.00009365724,0.0014909948,0.0038329693,0.02478207,0.019474119,0.8596096,0.0076770475,0.05801794],"study_design_scores_gemma":[0.00007868485,0.00012715056,0.0038190437,0.00004120384,0.00003840737,0.00062553777,0.0011090438,0.032987878,0.0062151095,0.94705373,0.007870838,0.00003334406],"about_ca_topic_score_codex":0.0037636664,"about_ca_topic_score_gemma":0.0028915121,"teacher_disagreement_score":0.006147189,"about_ca_system_score_codex":0.0009696296,"about_ca_system_score_gemma":0.00066857587,"threshold_uncertainty_score":0.020564377},"labels":[],"label_agreement":null},{"id":"W2113930605","doi":"10.1002/jgt.20568","title":"Domination number of cubic graphs with large girth","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Univerza v Ljubljani","keywords":"Combinatorics; Mathematics; Cubic graph; Girth (graph theory); Domination analysis; Vertex (graph theory); Graph; Upper and lower bounds; Discrete mathematics; Line graph; Voltage graph","score_opus":0.017572267326257954,"score_gpt":0.2775833201858796,"score_spread":0.26001105285962167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113930605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97104686,0.00047986044,0.009825385,0.00045489173,0.00001838439,0.00001594194,0.0004107328,0.00014272291,0.017605122],"genre_scores_gemma":[0.9970054,0.00010203809,0.0016027008,0.000029085539,0.000009992093,0.00001208218,0.00013576557,0.000014216179,0.001088714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995734,0.000073086274,0.00001126814,0.00007221054,0.00013408565,0.000135954],"domain_scores_gemma":[0.99555165,0.0028623566,0.0004814689,0.0003807367,0.00031721249,0.00040654594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003635565,0.00020439911,0.00033230442,0.0010338968,0.00088652264,0.0009859927,0.0006110362,0.0003014136,0.0036373623],"category_scores_gemma":[0.004206055,0.00022363757,0.00020099476,0.00089399656,0.0006981695,0.0008946033,0.000847575,0.0005038958,0.0001741917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026387975,0.0002494367,0.08012803,0.0009150044,0.0002044053,0.0021526827,0.0021211526,0.27516672,0.12820794,0.36176986,0.021865452,0.12458046],"study_design_scores_gemma":[0.00024506394,0.00018632978,0.048457723,0.00008302398,0.00009702572,0.0022243536,0.00067571475,0.527388,0.03244014,0.36896437,0.019125482,0.00011281799],"about_ca_topic_score_codex":0.0044728406,"about_ca_topic_score_gemma":0.0065407734,"teacher_disagreement_score":0.0044728406,"about_ca_system_score_codex":0.0013351172,"about_ca_system_score_gemma":0.00061835203,"threshold_uncertainty_score":0.012168229},"labels":[],"label_agreement":null},{"id":"W2114421280","doi":"10.46298/dmtcs.3513","title":"The Diameter of the Minimum Spanning Tree of a Complete Graph","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum spanning tree; Graph; Independent and identically distributed random variables; Minimum degree spanning tree; Tree (set theory); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Statistics; Random variable","score_opus":0.018335196805992635,"score_gpt":0.27569590814268524,"score_spread":0.2573607113366926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114421280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90314263,0.0011402433,0.084205866,0.0021129758,0.000076864126,0.000030358851,0.0014789022,0.00017433264,0.0076377993],"genre_scores_gemma":[0.9730978,0.0010235688,0.021721937,0.00018201543,0.00017970831,0.00012364193,0.0012378524,0.00010676446,0.0023267486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992588,0.00022736503,0.00004210622,0.00021349356,0.00013260187,0.00012564436],"domain_scores_gemma":[0.99077725,0.0061544217,0.0010044159,0.0005415325,0.00053550996,0.0009869073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364742,0.00040714556,0.00079730176,0.0008747631,0.0008494132,0.0018257769,0.0012071369,0.0008977725,0.0015319064],"category_scores_gemma":[0.010707605,0.00076500827,0.0003667932,0.0007149146,0.0012821137,0.0027631328,0.0011802994,0.0008305669,0.00034563374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030349584,0.00023297124,0.052191097,0.0009924605,0.0005238969,0.0012211826,0.002216189,0.23358718,0.084517255,0.49653423,0.029025445,0.095923096],"study_design_scores_gemma":[0.00018062454,0.00031291734,0.021932714,0.000099121346,0.00014407169,0.0020309936,0.000551069,0.48569682,0.014910671,0.46461764,0.009447921,0.00007542869],"about_ca_topic_score_codex":0.0008896688,"about_ca_topic_score_gemma":0.0007903757,"teacher_disagreement_score":0.0018257769,"about_ca_system_score_codex":0.0010826354,"about_ca_system_score_gemma":0.00043431058,"threshold_uncertainty_score":0.007855058},"labels":[],"label_agreement":null},{"id":"W2114909581","doi":"10.7155/jgaa.00256","title":"Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar straight-line graph; Planar graph; Combinatorics; Vertex (graph theory); Planar; Graph; Outerplanar graph; Computer science; Mathematics; 1-planar graph; Pathwidth; Line graph; Computer graphics (images)","score_opus":0.028244954182113268,"score_gpt":0.3234862292229718,"score_spread":0.29524127504085856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114909581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7965491,0.00039964035,0.19801967,0.0004989425,0.000034332013,0.000105445506,0.0003939612,0.00071950734,0.003279369],"genre_scores_gemma":[0.834935,0.0002448068,0.16149586,0.00007282847,0.00002289487,0.00009903624,0.00056134287,0.00023933893,0.0023288792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945766,0.00014410136,0.00002082904,0.00017786391,0.00007082606,0.00012872757],"domain_scores_gemma":[0.9965642,0.002298053,0.0005275379,0.00022228133,0.0001463783,0.00024152352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060410454,0.00088561204,0.00094415655,0.00051995,0.0007466649,0.0010060592,0.0016464862,0.0011201154,0.0032990274],"category_scores_gemma":[0.0050279964,0.0005354612,0.0005410173,0.0006840266,0.0009355235,0.0021994652,0.00090589345,0.0009038489,0.00033433884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013751114,0.0002057032,0.0032378512,0.00047785122,0.00008707015,0.00032659172,0.00027027575,0.8899449,0.031082194,0.015817113,0.0024199812,0.054755367],"study_design_scores_gemma":[0.00013341337,0.00051647215,0.0010154734,0.000026181362,0.00006576667,0.00019896819,0.0002246235,0.9559646,0.012463752,0.02776963,0.001591382,0.000029625697],"about_ca_topic_score_codex":0.0023896906,"about_ca_topic_score_gemma":0.0037923849,"teacher_disagreement_score":0.0032990274,"about_ca_system_score_codex":0.00134194,"about_ca_system_score_gemma":0.0008040372,"threshold_uncertainty_score":0.011036336},"labels":[],"label_agreement":null},{"id":"W2114935764","doi":"10.1002/jgt.10126","title":"Packing paths in digraphs","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Bishop's University","funders":"","keywords":"Combinatorics; Digraph; Bipartite graph; Mathematics; Packing problems; Disjoint sets; Vertex (graph theory); Matching (statistics); Undirected graph; Graph","score_opus":0.01678610636798969,"score_gpt":0.2814075109099237,"score_spread":0.26462140454193406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114935764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.474082,0.0026619723,0.40641537,0.0028550841,0.00028607313,0.0006992622,0.0060637393,0.0018533367,0.105083175],"genre_scores_gemma":[0.78909117,0.0019539217,0.18007539,0.000698743,0.000109595916,0.00042034007,0.005294287,0.00017933022,0.02217725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991678,0.0001802358,0.0000656078,0.000250884,0.00012414898,0.00021137617],"domain_scores_gemma":[0.99817586,0.00097246486,0.0002221585,0.00025447775,0.00014567967,0.00022942247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048159555,0.00070143736,0.0006340137,0.0018866541,0.0016164173,0.0020744652,0.00085203967,0.00096694357,0.011157926],"category_scores_gemma":[0.002927347,0.0008240706,0.0008389805,0.003419573,0.0010422107,0.003229235,0.0016156397,0.0012615126,0.0010893807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003527988,0.00030618385,0.004102148,0.0006072816,0.00013696615,0.0014225373,0.0010476626,0.11943762,0.00644867,0.68988585,0.02503836,0.15121385],"study_design_scores_gemma":[0.00008471761,0.00016974291,0.0019443951,0.0001779749,0.00007256474,0.0011357554,0.00062492175,0.18732734,0.0031897782,0.7510764,0.05414019,0.000056181707],"about_ca_topic_score_codex":0.0051363157,"about_ca_topic_score_gemma":0.0062508755,"teacher_disagreement_score":0.011157926,"about_ca_system_score_codex":0.0022564984,"about_ca_system_score_gemma":0.0010709051,"threshold_uncertainty_score":0.03732699},"labels":[],"label_agreement":null},{"id":"W2114968511","doi":"10.1016/j.tcs.2005.09.030","title":"List matrix partitions of chordal graphs","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Split graph; Indifference graph; Interval graph; Discrete mathematics; Clique-sum; Pathwidth; Partition (number theory); Cograph; Graph; Line graph; 1-planar graph","score_opus":0.013647279260516391,"score_gpt":0.3137581876164931,"score_spread":0.3001109083559767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114968511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6519583,0.00081429473,0.26307145,0.0011450109,0.00021548326,0.00043933708,0.005021229,0.0020313647,0.07530346],"genre_scores_gemma":[0.84536254,0.0005013861,0.10760007,0.00029954012,0.00015741975,0.0003345696,0.006274668,0.0005578988,0.03891185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993173,0.00012132004,0.00004585721,0.00013734217,0.00018336887,0.0001948282],"domain_scores_gemma":[0.9970188,0.0011298709,0.00029970848,0.00054954656,0.0005660024,0.00043600547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003305962,0.00042773908,0.0006262109,0.001924406,0.0021350393,0.0034717296,0.0014745353,0.0007850489,0.019331086],"category_scores_gemma":[0.0032862832,0.00043553615,0.00039527076,0.0023062713,0.0007765749,0.0031539476,0.001345506,0.0009889407,0.0028193144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019774875,0.00033368033,0.0026334147,0.00054455904,0.00006846646,0.0003864681,0.0016227354,0.018969597,0.0322677,0.7862172,0.033051096,0.12192765],"study_design_scores_gemma":[0.00023411437,0.0002482537,0.0025371492,0.00010671954,0.00008754291,0.0004714852,0.0016151172,0.089074336,0.012214146,0.8614149,0.031925026,0.00007122226],"about_ca_topic_score_codex":0.0024170189,"about_ca_topic_score_gemma":0.005257986,"teacher_disagreement_score":0.019331086,"about_ca_system_score_codex":0.001240204,"about_ca_system_score_gemma":0.0008435585,"threshold_uncertainty_score":0.06466895},"labels":[],"label_agreement":null},{"id":"W2115589427","doi":"10.1016/j.jctb.2011.07.004","title":"The disjoint paths problem in quadratic time","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":203,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Minor (academic); Combinatorics; Time complexity; Mathematics; Mathematical proof; Discrete mathematics; Computer science; Algorithm","score_opus":0.014700443154393136,"score_gpt":0.24615038814903964,"score_spread":0.2314499449946465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115589427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52377665,0.0059330496,0.27760884,0.035578426,0.0015052746,0.0005125385,0.0057970835,0.0022940454,0.1469941],"genre_scores_gemma":[0.79755676,0.0029012514,0.12610479,0.002233285,0.0016070965,0.00043046355,0.0055949464,0.0015084265,0.062063087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540114,0.0012899302,0.0002005296,0.0011300016,0.00087284285,0.0011055392],"domain_scores_gemma":[0.97611,0.01907307,0.0010815659,0.0015049832,0.0008385185,0.0013919522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033235948,0.0016786125,0.0037156788,0.00157924,0.0040731155,0.0073701185,0.004779017,0.0034241779,0.030617582],"category_scores_gemma":[0.022700895,0.0015027291,0.0020306034,0.004203006,0.004101832,0.018826373,0.0037235674,0.0076684393,0.002524596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028278448,0.0011487082,0.0033822835,0.0015981051,0.00036887376,0.000617218,0.0013434831,0.111761816,0.0037672934,0.68884647,0.0776092,0.106728695],"study_design_scores_gemma":[0.0003970301,0.000082962266,0.00055919006,0.000048440128,0.00008046801,0.00016743677,0.00027415212,0.09090938,0.00070760166,0.9014407,0.005304686,0.00002799014],"about_ca_topic_score_codex":0.0072124717,"about_ca_topic_score_gemma":0.011117436,"teacher_disagreement_score":0.030617582,"about_ca_system_score_codex":0.004781063,"about_ca_system_score_gemma":0.0049293004,"threshold_uncertainty_score":0.10242605},"labels":[],"label_agreement":null},{"id":"W2115695686","doi":"10.1007/s00373-010-0917-x","title":"Star-Uniform Graphs","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Star (game theory); Chordal graph; Discrete mathematics; Graph","score_opus":0.011841989009128423,"score_gpt":0.25266698218514294,"score_spread":0.24082499317601452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115695686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37049025,0.0015639971,0.2930626,0.0020395606,0.0005591032,0.00021740605,0.0027259886,0.00154195,0.32779917],"genre_scores_gemma":[0.8638227,0.0010936853,0.04932257,0.0009253487,0.00028000824,0.00015901057,0.002878733,0.00043806277,0.08107999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992292,0.00017154377,0.00004816901,0.00028329378,0.00012895245,0.00013885667],"domain_scores_gemma":[0.99785477,0.0006193182,0.00020979867,0.0005279718,0.00039359974,0.00039442134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048377202,0.0006020301,0.0008245544,0.0014613298,0.0019700534,0.0021301098,0.0010729138,0.0008099152,0.018328149],"category_scores_gemma":[0.002973562,0.00056184304,0.0006681179,0.0021730473,0.0012795043,0.004437878,0.0025251482,0.0015529001,0.0025176182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001055459,0.00003246282,0.00043628816,0.00007047206,0.000013067996,0.000059270853,0.0001406186,0.00088452856,0.0012123347,0.97706044,0.005436383,0.01454862],"study_design_scores_gemma":[0.000019498471,0.000024480363,0.00052184175,0.000016756778,0.000022419541,0.00018185836,0.00011984425,0.0049272734,0.0014783463,0.9809598,0.011717462,0.000010450075],"about_ca_topic_score_codex":0.00083522836,"about_ca_topic_score_gemma":0.0012740259,"teacher_disagreement_score":0.018328149,"about_ca_system_score_codex":0.0007743369,"about_ca_system_score_gemma":0.00047789168,"threshold_uncertainty_score":0.061313808},"labels":[],"label_agreement":null},{"id":"W2116039510","doi":"10.1016/j.jctb.2018.12.007","title":"Treewidth of graphs with balanced separations","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Grantová Agentura České Republiky","keywords":"Treewidth; Combinatorics; Partial k-tree; Mathematics; Graph; Clique-sum; Discrete mathematics; Chordal graph; 1-planar graph; Pathwidth; Line graph","score_opus":0.015484421120492703,"score_gpt":0.29012519452983754,"score_spread":0.27464077340934484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116039510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8446325,0.0016578668,0.11165598,0.0029466415,0.00016410628,0.000062015184,0.0022632102,0.0004307662,0.036186848],"genre_scores_gemma":[0.9530484,0.001394772,0.034298517,0.0005411309,0.00025637922,0.000101972044,0.0017329456,0.00026109326,0.008364778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923396,0.00017388313,0.000048625807,0.00019849029,0.00018168517,0.00016342694],"domain_scores_gemma":[0.996314,0.0020077669,0.000559872,0.00027386236,0.00037536927,0.00046924074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075591693,0.00074516033,0.0008893522,0.0017251471,0.001200089,0.004215676,0.0015907593,0.0015554901,0.009710778],"category_scores_gemma":[0.005797184,0.0008426736,0.0005159427,0.0022223853,0.0010503863,0.0060406956,0.0015280152,0.0016625884,0.0012171523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009586707,0.00019028597,0.004226825,0.0004378337,0.000086958236,0.00040854784,0.0011123178,0.015937649,0.016138475,0.9057193,0.01098925,0.043793935],"study_design_scores_gemma":[0.00007611555,0.00004260812,0.0009199304,0.00005599759,0.00004886153,0.00039283198,0.00034060658,0.027797574,0.0020157057,0.9639709,0.0043231742,0.00001566144],"about_ca_topic_score_codex":0.0007715318,"about_ca_topic_score_gemma":0.001024244,"teacher_disagreement_score":0.009710778,"about_ca_system_score_codex":0.0008857002,"about_ca_system_score_gemma":0.0006944918,"threshold_uncertainty_score":0.032485843},"labels":[],"label_agreement":null},{"id":"W2116052752","doi":"10.37236/728","title":"The Minor Crossing Number of Graphs with an Excluded Minor","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minor (academic); Combinatorics; Mathematics; Crossing number (knot theory); Graph; Robertson–Seymour theorem; Graph minor; Coxeter graph; Discrete mathematics; 1-planar graph; Line graph; Graph power; Voltage graph","score_opus":0.016644143679760092,"score_gpt":0.2882565633769669,"score_spread":0.27161241969720684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116052752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8766461,0.00095189153,0.08790688,0.00046814614,0.00016793128,0.00006190781,0.00095115154,0.0007883913,0.032057513],"genre_scores_gemma":[0.9760686,0.00038039763,0.018313635,0.000103724924,0.0000832376,0.000059911505,0.0007490199,0.00014142689,0.004099995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995271,0.000075946075,0.000026762746,0.00015989921,0.000113558664,0.00009672883],"domain_scores_gemma":[0.9971943,0.0012383887,0.00044525097,0.0003324602,0.0002823041,0.00050720375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045608933,0.00055430765,0.000496127,0.0021254404,0.0009232272,0.0013939244,0.00066208444,0.0006035218,0.0050337412],"category_scores_gemma":[0.003600129,0.0003650072,0.0005210137,0.0010357097,0.0012483228,0.0017100949,0.0008950274,0.00090966764,0.0005873148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023659295,0.00030293703,0.023191597,0.000834714,0.00030714498,0.0020731783,0.0015718063,0.07344292,0.1507136,0.60196584,0.019192297,0.12403803],"study_design_scores_gemma":[0.00012617097,0.0004256902,0.02289821,0.00011088475,0.00022195747,0.005465006,0.0005548527,0.19887102,0.049523458,0.6926469,0.029021574,0.00013429383],"about_ca_topic_score_codex":0.000714719,"about_ca_topic_score_gemma":0.00056696945,"teacher_disagreement_score":0.0050337412,"about_ca_system_score_codex":0.0008951626,"about_ca_system_score_gemma":0.00036328917,"threshold_uncertainty_score":0.016839504},"labels":[],"label_agreement":null},{"id":"W2116103579","doi":"10.1016/j.endm.2013.07.015","title":"Choosability of Graphs with Bounded Order: Ohbaʼs Conjecture and Beyond","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Bounded function; Order (exchange); Discrete mathematics","score_opus":0.007075373172213777,"score_gpt":0.2545845592946737,"score_spread":0.24750918612245995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116103579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6435514,0.002812881,0.17618087,0.01639231,0.0005215434,0.00008402814,0.00094923284,0.0005835249,0.15892425],"genre_scores_gemma":[0.97678953,0.0010531468,0.010176961,0.001153643,0.00047929966,0.00007317454,0.0004605482,0.00012852516,0.009685217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989323,0.00021362356,0.000040870236,0.00030828608,0.00025414533,0.00025078424],"domain_scores_gemma":[0.9884078,0.008150837,0.0005573094,0.0016776694,0.00046353156,0.00074287754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381301,0.0006443338,0.0016881966,0.001291986,0.001773617,0.0034949838,0.0021246911,0.0022823373,0.009052372],"category_scores_gemma":[0.010714435,0.00076834636,0.001542957,0.0016136074,0.005269656,0.009241396,0.002398242,0.004666338,0.00071009557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014445864,0.000055721015,0.0008455265,0.000113456204,0.000015162865,0.00008347526,0.00034446013,0.0045005125,0.0010356101,0.9839188,0.0028000257,0.0061427304],"study_design_scores_gemma":[0.00002883653,0.000008876141,0.00026518793,0.000008830548,0.0000071638306,0.000028364291,0.000059975897,0.0061876853,0.00020755433,0.992454,0.00073543703,0.000008110339],"about_ca_topic_score_codex":0.0034174903,"about_ca_topic_score_gemma":0.0022355863,"teacher_disagreement_score":0.009052372,"about_ca_system_score_codex":0.0015126877,"about_ca_system_score_gemma":0.0010362535,"threshold_uncertainty_score":0.030283153},"labels":[],"label_agreement":null},{"id":"W2116753102","doi":"10.1016/j.dam.2013.07.013","title":"Automated generation of conjectures on forbidden subgraph characterization","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; École de Technologie Supérieure","funders":"","keywords":"Mathematics; Combinatorics; Characterization (materials science); Induced subgraph isomorphism problem; Induced subgraph; Split graph; Cograph; Discrete mathematics; Graph; Heuristic; Distance-hereditary graph; Line graph; Pathwidth; Graph power; Voltage graph; Mathematical optimization","score_opus":0.02682042991999696,"score_gpt":0.27926116335299517,"score_spread":0.2524407334329982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116753102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20412007,0.00034382148,0.74244523,0.007491579,0.00065608555,0.0011154603,0.0058082263,0.015114748,0.022904746],"genre_scores_gemma":[0.70363617,0.00019155981,0.2758969,0.0007763198,0.0003456904,0.0005335039,0.013118154,0.0016987493,0.0038030169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98822045,0.0041203755,0.0006682078,0.002581394,0.0032172806,0.0011923834],"domain_scores_gemma":[0.8870575,0.085489035,0.0035483458,0.01332691,0.0092937285,0.0012844672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005961592,0.0018245121,0.0019962082,0.003387532,0.0019422272,0.0040727886,0.003727337,0.002535491,0.022785742],"category_scores_gemma":[0.07308869,0.0014953065,0.003634819,0.0022933816,0.0033828137,0.008843964,0.0075234133,0.004385856,0.003863883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003876663,0.0020973077,0.022375753,0.0023732542,0.00052543567,0.002731862,0.0032271023,0.14629096,0.025599597,0.34826478,0.10457531,0.33806187],"study_design_scores_gemma":[0.00036341127,0.0001757106,0.0011580929,0.00020190574,0.0001408124,0.0003321116,0.00092241884,0.45665598,0.012806423,0.5168406,0.010331805,0.00007084788],"about_ca_topic_score_codex":0.0021103525,"about_ca_topic_score_gemma":0.003944734,"teacher_disagreement_score":0.022785742,"about_ca_system_score_codex":0.0022242079,"about_ca_system_score_gemma":0.0036512946,"threshold_uncertainty_score":0.07622594},"labels":[],"label_agreement":null},{"id":"W2117485843","doi":"10.1016/j.jda.2009.06.001","title":"Ordered interval routing schemes","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Disjoint sets; Mathematics; Interval graph; Routing (electronic design automation); Equal-cost multi-path routing; Discrete mathematics; Static routing; Computer science; Graph; Line graph; Routing protocol; Computer network; Pathwidth","score_opus":0.020526101915145673,"score_gpt":0.3183674353720518,"score_spread":0.2978413334569061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117485843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091111556,0.0007583059,0.7804334,0.0010531475,0.00051987194,0.00061407965,0.0019448376,0.00268946,0.12087534],"genre_scores_gemma":[0.54342353,0.0009538138,0.40479478,0.00042113083,0.00023606657,0.0004402282,0.0025856504,0.0005354636,0.04660937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986864,0.0002680551,0.00012763844,0.00024637327,0.0004209645,0.0002505829],"domain_scores_gemma":[0.9963858,0.00079454435,0.00022342906,0.0018355731,0.0004657623,0.00029488362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001197214,0.0006489287,0.00096448,0.0013910122,0.0014374466,0.003107631,0.0023593127,0.00102384,0.0220131],"category_scores_gemma":[0.0045912783,0.000493777,0.0006905125,0.0024195414,0.0008574267,0.004164201,0.0026760346,0.0020720598,0.0037594584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064664584,0.00030211356,0.00042358637,0.00019774998,0.00003409608,0.000100568854,0.00028059847,0.025289826,0.0084398305,0.7726931,0.015765334,0.1758266],"study_design_scores_gemma":[0.0002239907,0.00040853408,0.00044492292,0.00011764978,0.000090079884,0.0003604065,0.00029741775,0.15529774,0.01158574,0.7609297,0.07015692,0.000086819535],"about_ca_topic_score_codex":0.000572378,"about_ca_topic_score_gemma":0.00076276914,"teacher_disagreement_score":0.0220131,"about_ca_system_score_codex":0.0013031852,"about_ca_system_score_gemma":0.0010880148,"threshold_uncertainty_score":0.07364112},"labels":[],"label_agreement":null},{"id":"W2118223706","doi":"10.1016/j.tcs.2005.09.011","title":"The complexity of partition functions","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Constraint satisfaction problem; Adjacency matrix; Homomorphism; Partition (number theory); Counting problem; Discrete mathematics; Time complexity; Equivalence (formal languages); Graph","score_opus":0.040453615366782006,"score_gpt":0.3106491400712147,"score_spread":0.2701955247044327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118223706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6649363,0.004320522,0.17880002,0.028886061,0.00045044534,0.00011118087,0.0021272732,0.0005551264,0.11981304],"genre_scores_gemma":[0.97159886,0.0016593514,0.011707709,0.00079984474,0.0009226816,0.00017578805,0.0010350553,0.0002488716,0.011851805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955283,0.0014217196,0.00017059804,0.0007235969,0.0014863196,0.00066940923],"domain_scores_gemma":[0.94770974,0.043735255,0.0020998113,0.0035191088,0.0013515168,0.0015846421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032013466,0.0010941556,0.002753211,0.0034185706,0.0030233273,0.010473621,0.0041396376,0.003963979,0.014119414],"category_scores_gemma":[0.03620664,0.0015038957,0.0017734019,0.004699309,0.007716201,0.026668506,0.004552566,0.0081269955,0.0013345458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113551236,0.00004329123,0.0010242141,0.00007478799,0.000022198703,0.000045993842,0.0002720108,0.0074857567,0.00033024864,0.97991633,0.0035584955,0.0071131163],"study_design_scores_gemma":[0.000019015532,0.000006089757,0.00035084644,0.000010098505,0.000010658989,0.000047285514,0.00004329874,0.015049566,0.00013434506,0.98352355,0.00079460716,0.000010725902],"about_ca_topic_score_codex":0.0019896557,"about_ca_topic_score_gemma":0.0015429843,"teacher_disagreement_score":0.014119414,"about_ca_system_score_codex":0.0047263457,"about_ca_system_score_gemma":0.001832561,"threshold_uncertainty_score":0.047234178},"labels":[],"label_agreement":null},{"id":"W2118486152","doi":"10.1016/s0012-365x(03)00297-8","title":"Well-located graphs: a collection of well-covered ones","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Dominating set; Graph; Maximal independent set; Discrete mathematics; Independent set; Characterization (materials science); Chordal graph; 1-planar graph","score_opus":0.02135974380539746,"score_gpt":0.2823232364815937,"score_spread":0.26096349267619623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118486152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42345557,0.0066204043,0.5016329,0.0016491131,0.0003482972,0.00025574383,0.0032174352,0.0013159863,0.061504573],"genre_scores_gemma":[0.8370781,0.005392264,0.11443816,0.0006465196,0.00087623304,0.00040118018,0.004962478,0.0010780873,0.035126943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755895,0.0003598241,0.00015643236,0.0007347569,0.0008366456,0.00035346937],"domain_scores_gemma":[0.9910059,0.0034527916,0.0010216472,0.0018418637,0.0016416635,0.001036161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012252377,0.0013759801,0.0023491604,0.006290957,0.0029968082,0.004281474,0.002669312,0.0023182407,0.0071698283],"category_scores_gemma":[0.009360594,0.0015512338,0.0014017478,0.0068443157,0.0027935011,0.008962695,0.0038788493,0.0032857086,0.0016408477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002065708,0.00009179155,0.0028379564,0.0004945504,0.000112194764,0.0010896354,0.001611082,0.0059508565,0.0050356206,0.9342453,0.00852925,0.03979532],"study_design_scores_gemma":[0.000030632964,0.00005853246,0.0021476727,0.00009861169,0.00010705862,0.0016124407,0.0006141086,0.017016605,0.0021514592,0.95606196,0.02005391,0.000046973433],"about_ca_topic_score_codex":0.0010470075,"about_ca_topic_score_gemma":0.0013955395,"teacher_disagreement_score":0.0071698283,"about_ca_system_score_codex":0.0011579357,"about_ca_system_score_gemma":0.00074961496,"threshold_uncertainty_score":0.023985505},"labels":[],"label_agreement":null},{"id":"W2118970668","doi":"10.37236/1538","title":"Colouring Planar Mixed Hypergraphs","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Mathematics; Bipartite graph; Chromatic polynomial; Vertex (graph theory); Planar graph; Graph; Planar; Chromatic scale; Computer science","score_opus":0.008014680410700175,"score_gpt":0.2406045820898491,"score_spread":0.23258990167914895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118970668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6358649,0.000754456,0.308637,0.000731262,0.00006337011,0.00010940658,0.001173302,0.0008224594,0.051843792],"genre_scores_gemma":[0.8988758,0.0006022772,0.08534126,0.00026323425,0.0000624502,0.00010089631,0.0012651474,0.00021977606,0.013269187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993457,0.00013379022,0.000029796885,0.00019326704,0.00014972767,0.00014765863],"domain_scores_gemma":[0.9988085,0.0005153902,0.00016853726,0.00018589555,0.00016950908,0.00015214705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033015557,0.00057649665,0.00037938022,0.001488848,0.0008625559,0.002132636,0.0007652282,0.0006886793,0.0065444247],"category_scores_gemma":[0.0021080752,0.00057024637,0.00059879344,0.0016823675,0.0011496876,0.0030606524,0.0021651634,0.0011161068,0.0007411432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039253375,0.000082709805,0.0037781459,0.00033025022,0.00008233991,0.00032646416,0.0007960958,0.037021507,0.029141381,0.85543174,0.0045109345,0.06810599],"study_design_scores_gemma":[0.000054480595,0.00007388714,0.0027389785,0.000076942364,0.00007751543,0.00062605226,0.000518075,0.109536126,0.010449069,0.8564368,0.019361459,0.00005063188],"about_ca_topic_score_codex":0.002575467,"about_ca_topic_score_gemma":0.0030604561,"teacher_disagreement_score":0.0065444247,"about_ca_system_score_codex":0.0016057098,"about_ca_system_score_gemma":0.00044295745,"threshold_uncertainty_score":0.021893263},"labels":[],"label_agreement":null},{"id":"W2119116325","doi":"10.1017/s0963548309990290","title":"Conflict-Free Colourings of Graphs and Hypergraphs","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; Neighbourhood (mathematics); Vertex (graph theory); Lemma (botany); Upper and lower bounds; Graph; Chromatic scale; Discrete mathematics","score_opus":0.022307528566733053,"score_gpt":0.2705696345529421,"score_spread":0.24826210598620904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119116325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16949616,0.003935365,0.7810568,0.0018387439,0.00024730936,0.00027456225,0.0010080108,0.0009321127,0.041210998],"genre_scores_gemma":[0.73406917,0.003832068,0.2422017,0.0009895214,0.00070329965,0.0004586619,0.0013698614,0.0005012023,0.015874472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997095,0.00079357275,0.00017702494,0.000830725,0.0006901456,0.0004135808],"domain_scores_gemma":[0.99019367,0.0055991653,0.001239872,0.0017717875,0.00043901853,0.0007564523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016544053,0.0011352985,0.0007848032,0.0017648687,0.0014279765,0.004319634,0.001944456,0.0017213771,0.008098092],"category_scores_gemma":[0.010479238,0.0012719617,0.0013576942,0.003946762,0.0052838447,0.00771868,0.004039353,0.004149661,0.0011596555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017197515,0.00005740304,0.0011394024,0.00027092465,0.00004402402,0.00025979488,0.0008171726,0.03023293,0.0055056177,0.9180157,0.004888369,0.03859671],"study_design_scores_gemma":[0.000031378757,0.000021892309,0.0005335979,0.000027550888,0.000013820414,0.00025389143,0.00012227107,0.022089232,0.0014456988,0.967602,0.007836103,0.000022580245],"about_ca_topic_score_codex":0.0020974553,"about_ca_topic_score_gemma":0.0020352828,"teacher_disagreement_score":0.008098092,"about_ca_system_score_codex":0.0028952002,"about_ca_system_score_gemma":0.00080353406,"threshold_uncertainty_score":0.027090847},"labels":[],"label_agreement":null},{"id":"W2119305988","doi":"10.1017/s0963548301004758","title":"A Note on Vertex List Colouring","year":2001,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Conjecture; Mathematics; Graph; Discrete mathematics","score_opus":0.032389842811345056,"score_gpt":0.3031178416169424,"score_spread":0.27072799880559734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119305988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08483986,0.015869651,0.5983899,0.035207238,0.010629705,0.00025957444,0.0006002998,0.0026883255,0.2515154],"genre_scores_gemma":[0.6707684,0.01313729,0.26185095,0.007937414,0.0048393034,0.00024526851,0.00052119704,0.0007866382,0.039913557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733704,0.0008280021,0.00013053344,0.0005430761,0.00064257975,0.0005187181],"domain_scores_gemma":[0.9865317,0.009147561,0.0004049576,0.0024600332,0.0009197989,0.0005360684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546254,0.0007093928,0.0009299457,0.0011136072,0.002540449,0.0028874825,0.0019048097,0.001758443,0.0062207207],"category_scores_gemma":[0.01519387,0.0005523718,0.00094953144,0.0022770846,0.005189228,0.008547033,0.0035706973,0.0057351766,0.0018410201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037113926,0.00008750379,0.0022947048,0.00039349849,0.00002855655,0.00048143108,0.00073896314,0.009401885,0.0041403677,0.8514119,0.037523758,0.09312635],"study_design_scores_gemma":[0.000044425982,0.00012286662,0.0007093574,0.00011556106,0.000053808173,0.0004598743,0.00021177661,0.021583958,0.004943327,0.8706885,0.101017326,0.000049156],"about_ca_topic_score_codex":0.003727537,"about_ca_topic_score_gemma":0.0025751009,"teacher_disagreement_score":0.0062207207,"about_ca_system_score_codex":0.00229533,"about_ca_system_score_gemma":0.0010666832,"threshold_uncertainty_score":0.020810425},"labels":[],"label_agreement":null},{"id":"W2120708918","doi":"10.1016/j.dam.2013.10.016","title":"Matrix partitions of split graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Bipartite graph; Chordal graph; Cograph; Discrete mathematics; Complete bipartite graph; Graph; 1-planar graph","score_opus":0.018241546581663645,"score_gpt":0.29076085388082396,"score_spread":0.2725193072991603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120708918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7716526,0.00052194024,0.15742505,0.00082030526,0.00021211672,0.0001223648,0.0008201098,0.00044052527,0.06798499],"genre_scores_gemma":[0.9385304,0.00031696793,0.031286474,0.0002858186,0.00018322455,0.00016424722,0.0012959285,0.0003110614,0.027625876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996018,0.000100080244,0.000017226286,0.00007667413,0.00010861246,0.000095645984],"domain_scores_gemma":[0.9987997,0.00041304933,0.00018458383,0.0001576479,0.0001761842,0.00026886616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039167493,0.00051841786,0.00052642566,0.001805291,0.0011206644,0.0024059743,0.00084291375,0.00084972644,0.012393942],"category_scores_gemma":[0.0019148298,0.00049966434,0.00050360884,0.00095702946,0.0011643609,0.0022077647,0.0012855864,0.0011142598,0.0014441842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020970657,0.000053929674,0.00041591693,0.0000627621,0.000018081588,0.00014996318,0.00047283957,0.004436384,0.006169106,0.9730376,0.0045052385,0.010468444],"study_design_scores_gemma":[0.000038211365,0.0000329065,0.000594045,0.000018833338,0.000013574451,0.00013652873,0.0002977379,0.02413988,0.0014549365,0.96961975,0.0036402908,0.000013376035],"about_ca_topic_score_codex":0.0006294178,"about_ca_topic_score_gemma":0.0013684501,"teacher_disagreement_score":0.012393942,"about_ca_system_score_codex":0.00065318897,"about_ca_system_score_gemma":0.00032147637,"threshold_uncertainty_score":0.041461885},"labels":[],"label_agreement":null},{"id":"W2120958076","doi":"10.1016/j.jctb.2007.10.008","title":"Tangles, tree-decompositions and grids in matroids","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tangle; Matroid; Graphic matroid; Combinatorics; Matroid partitioning; Mathematics; Tree decomposition; Grid; Graph; Tree (set theory); Order (exchange); Finite field; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.007818567983791677,"score_gpt":0.2651665826904393,"score_spread":0.25734801470664764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120958076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7337366,0.0034266412,0.20054357,0.0023016417,0.00034134265,0.00007715245,0.0005825575,0.00042617164,0.058564465],"genre_scores_gemma":[0.9352533,0.0017965853,0.04094493,0.00024438906,0.00031775644,0.0000742472,0.00048510625,0.0001091539,0.02077458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997322,0.000078449586,0.000020476062,0.000061740844,0.00006146853,0.00004564548],"domain_scores_gemma":[0.9978928,0.0010259049,0.000404165,0.00018850151,0.0001442346,0.00034439986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041293274,0.00041897854,0.00074501126,0.001555422,0.0013474057,0.0029564027,0.0007477426,0.00096485636,0.006244957],"category_scores_gemma":[0.0026839375,0.0006280862,0.0005679779,0.0018152108,0.0019158379,0.0036765696,0.0012436557,0.0017865637,0.0006337125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008403602,0.000039415372,0.0010929503,0.00008121524,0.000013796714,0.00015095399,0.0004343018,0.0058469344,0.0011274078,0.9757447,0.0029401942,0.012444059],"study_design_scores_gemma":[0.000016964315,0.0000145536,0.000362297,0.0000146457305,0.000008924556,0.00014352864,0.00014912282,0.00981289,0.00019068534,0.98680633,0.002472751,0.0000072766993],"about_ca_topic_score_codex":0.0011763951,"about_ca_topic_score_gemma":0.0019390788,"teacher_disagreement_score":0.006244957,"about_ca_system_score_codex":0.0006892364,"about_ca_system_score_gemma":0.00032824487,"threshold_uncertainty_score":0.020891488},"labels":[],"label_agreement":null},{"id":"W2121104987","doi":"10.46298/dmtcs.1264","title":"On the Meyniel condition for hamiltonicity in bipartite digraphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Bipartite graph; Combinatorics; Mathematics; Hamiltonian (control theory); Discrete mathematics; Hamiltonian path; Strongly connected component; Graph","score_opus":0.019441468272439758,"score_gpt":0.3031915034484831,"score_spread":0.28375003517604336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121104987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49904385,0.0009510135,0.4045242,0.0034928145,0.00018485649,0.00028140674,0.0013262571,0.0004567643,0.08973873],"genre_scores_gemma":[0.95638514,0.00037697697,0.033380926,0.0005252052,0.00012731257,0.00026688597,0.00047976518,0.00007804699,0.008379628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999316,0.0001703431,0.00005384235,0.00015277806,0.00013817794,0.00016891018],"domain_scores_gemma":[0.9969735,0.001723663,0.00027142756,0.00020096036,0.00044934047,0.00038107144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095300085,0.00044028737,0.0006091377,0.0016008911,0.0012347643,0.0013088732,0.00081140886,0.0010605842,0.009307308],"category_scores_gemma":[0.0056751473,0.00037582178,0.0006654251,0.0008676937,0.0019497807,0.002818702,0.0015767209,0.0015333184,0.0010295523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006830153,0.00003195308,0.0010518664,0.0000767934,0.000012165694,0.00017903786,0.00029982137,0.003850455,0.004052593,0.9827238,0.0016391141,0.006014056],"study_design_scores_gemma":[0.00006152295,0.00007909972,0.0010621859,0.00003905535,0.000014994829,0.00014551579,0.000264827,0.02767735,0.0024107457,0.9627259,0.00549393,0.000024890734],"about_ca_topic_score_codex":0.0022016703,"about_ca_topic_score_gemma":0.0027387335,"teacher_disagreement_score":0.009307308,"about_ca_system_score_codex":0.0013755457,"about_ca_system_score_gemma":0.0007847052,"threshold_uncertainty_score":0.031135976},"labels":[],"label_agreement":null},{"id":"W2121556262","doi":"10.1016/j.tcs.2014.03.034","title":"The cyclical scheduling problem","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Scheduling (production processes); Vertex (graph theory); Combinatorics; Job shop scheduling; Mathematics; Computer science; Matching (statistics); Algorithm; Mathematical optimization; Graph; Schedule","score_opus":0.0113602510684824,"score_gpt":0.2838421154584433,"score_spread":0.2724818643899609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121556262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1975036,0.0030518917,0.57925344,0.016839832,0.0013905825,0.000705957,0.004105154,0.0010206678,0.19612889],"genre_scores_gemma":[0.74393433,0.002612957,0.18637171,0.0019189628,0.0017170863,0.00056040473,0.0046553947,0.00055222184,0.057676934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998004,0.0006713671,0.00008325459,0.0005386156,0.00033956973,0.000363149],"domain_scores_gemma":[0.99178,0.00505663,0.0006822708,0.0010503897,0.0006049974,0.0008257513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017091851,0.00087070296,0.0010788394,0.0009146908,0.0021579394,0.0036932144,0.0024590385,0.0024038386,0.016816737],"category_scores_gemma":[0.011297273,0.00075356645,0.0010086293,0.0026640934,0.0019971547,0.0049648075,0.0019963458,0.0031254485,0.0015491496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047134547,0.00029001723,0.00065943657,0.00046407207,0.000074476055,0.00022028301,0.00027498897,0.055508863,0.0021513635,0.84123415,0.042098742,0.056552295],"study_design_scores_gemma":[0.00011572386,0.000058565685,0.00021826067,0.000040706116,0.000030977033,0.00015394272,0.00016294516,0.089638725,0.0009704389,0.88988566,0.018699974,0.000024031091],"about_ca_topic_score_codex":0.0046033454,"about_ca_topic_score_gemma":0.004489382,"teacher_disagreement_score":0.016816737,"about_ca_system_score_codex":0.0024196303,"about_ca_system_score_gemma":0.004099713,"threshold_uncertainty_score":0.056257606},"labels":[],"label_agreement":null},{"id":"W2121804749","doi":"10.2168/lmcs-6(4:4)2010","title":"The complexity of global cardinality constraints","year":2010,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cardinality (data modeling); Constraint satisfaction problem; Constraint satisfaction dual problem; Constraint (computer-aided design); Set (abstract data type); Constraint satisfaction; Mathematics; Time complexity; Complexity of constraint satisfaction; Constraint logic programming; Computational complexity theory; Local consistency; Computer science; Mathematical optimization; Constraint programming; Discrete mathematics; Algorithm","score_opus":0.16318232241616554,"score_gpt":0.46939488013791036,"score_spread":0.3062125577217448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121804749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45098203,0.0036142473,0.47514215,0.014536242,0.00024557352,0.0003983418,0.0056622108,0.0011304992,0.04828867],"genre_scores_gemma":[0.8727579,0.0031044795,0.10938856,0.0008342149,0.00053281436,0.00060816586,0.004212799,0.0005834104,0.007977629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928109,0.002390409,0.00035724964,0.0013933443,0.002099776,0.0009482573],"domain_scores_gemma":[0.95004225,0.041667566,0.002565023,0.0031857435,0.0015890771,0.0009504449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003089745,0.0012243091,0.0020179544,0.0013383293,0.0018361991,0.0059446073,0.0026339402,0.0025607431,0.008680145],"category_scores_gemma":[0.030323327,0.00096591003,0.0023048676,0.0034733764,0.0028885563,0.014080921,0.0042325216,0.0050480883,0.0006767197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077391777,0.00030353424,0.006033728,0.001308091,0.00038454245,0.00069195864,0.0014000455,0.36834064,0.005358354,0.49594247,0.022010187,0.09745255],"study_design_scores_gemma":[0.00009859611,0.000057573976,0.0013973716,0.00007838608,0.000109704546,0.00033789512,0.00046787213,0.25567016,0.002586096,0.73096424,0.008182933,0.000049153674],"about_ca_topic_score_codex":0.0038105985,"about_ca_topic_score_gemma":0.0031619542,"teacher_disagreement_score":0.008680145,"about_ca_system_score_codex":0.002665831,"about_ca_system_score_gemma":0.002404742,"threshold_uncertainty_score":0.029037952},"labels":[],"label_agreement":null},{"id":"W2121942061","doi":"10.1002/jgt.21823","title":"Embedding a Graph‐Like Continuum in Some Surface","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Embedding; Graph; Pairwise comparison; Surface (topology); Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.013010212310684959,"score_gpt":0.28833193695926046,"score_spread":0.2753217246485755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121942061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8477985,0.00015337275,0.11111306,0.0006335662,0.00012941394,0.000040860625,0.00012882902,0.00041038217,0.039591942],"genre_scores_gemma":[0.96195185,0.00007906892,0.029902631,0.00009188851,0.000030247218,0.000025902085,0.00011409631,0.000096484204,0.007707744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965596,0.000046648678,0.000014158082,0.000091525595,0.00012912089,0.00006250009],"domain_scores_gemma":[0.9995751,0.00010190428,0.00006785247,0.00007918033,0.00007016795,0.00010584057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001876127,0.0003806948,0.0004379416,0.0009952395,0.0011815712,0.0018698117,0.00053848734,0.0009486263,0.0043695974],"category_scores_gemma":[0.0009445538,0.00033269625,0.00035194505,0.00053491537,0.0021664423,0.002198875,0.0022115042,0.0010572285,0.00086701795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018501347,0.00011569924,0.0024686987,0.00011784512,0.000030458608,0.0021299564,0.0012997525,0.019093229,0.04798521,0.9072318,0.0018682848,0.017474104],"study_design_scores_gemma":[0.00005353239,0.00018009845,0.0020015547,0.000064634674,0.000028792894,0.0016180674,0.001797455,0.092726015,0.01133771,0.8670285,0.023108406,0.000055300574],"about_ca_topic_score_codex":0.00047470312,"about_ca_topic_score_gemma":0.00037363422,"teacher_disagreement_score":0.0043695974,"about_ca_system_score_codex":0.00044721717,"about_ca_system_score_gemma":0.00020437494,"threshold_uncertainty_score":0.014617741},"labels":[],"label_agreement":null},{"id":"W2122000012","doi":"10.1017/s0963548306007644","title":"Randomized Algorithms for Determining the Majority on Graphs","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Randomized algorithm; Node (physics); Undirected graph; Combinatorics; Graph; Algorithm; Computer science; Task (project management); Upper and lower bounds; Simple (philosophy); Mathematics; Discrete mathematics; Theoretical computer science","score_opus":0.040548659523731996,"score_gpt":0.30824757233417144,"score_spread":0.26769891281043945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122000012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06777526,0.0017420738,0.9128399,0.003470536,0.0002698044,0.00046858558,0.0007324831,0.0040539866,0.008647351],"genre_scores_gemma":[0.47778878,0.0012484804,0.5058901,0.0015549546,0.0008858436,0.0013077533,0.0020299046,0.0012089863,0.008085332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97978824,0.009686023,0.00091467274,0.0040358156,0.0025982384,0.0029770688],"domain_scores_gemma":[0.9073517,0.07224523,0.004680553,0.011790601,0.0020100132,0.0019219726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010517607,0.0027776568,0.0041367114,0.002581744,0.0029561988,0.0060461573,0.008206433,0.004984918,0.0066475742],"category_scores_gemma":[0.055919956,0.0019638005,0.0024319363,0.0041901157,0.0060895593,0.01606632,0.0067706844,0.006634994,0.0020251493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00360842,0.0009359199,0.0039267563,0.0010722636,0.00048585248,0.00024603744,0.00074139173,0.4135832,0.0073832027,0.36936948,0.026050407,0.17259704],"study_design_scores_gemma":[0.00039913997,0.00012581206,0.00030376876,0.00004468543,0.000071297276,0.000089773144,0.00006693347,0.51133454,0.0019985638,0.48306683,0.0024503744,0.000048346978],"about_ca_topic_score_codex":0.0032414955,"about_ca_topic_score_gemma":0.0043202,"teacher_disagreement_score":0.010517607,"about_ca_system_score_codex":0.005158265,"about_ca_system_score_gemma":0.0047993376,"threshold_uncertainty_score":0.055623114},"labels":[],"label_agreement":null},{"id":"W2122238195","doi":"10.1016/j.ejc.2009.11.008","title":"An improved linear bound on the number of perfect matchings in cubic graphs","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Cubic graph; Perfect graph theorem; Polytope; Matching (statistics); Perfect graph; Trivially perfect graph; Dimension (graph theory); Graph; Upper and lower bounds; Discrete mathematics; Line graph; Pathwidth; Mathematical analysis","score_opus":0.016313602346027672,"score_gpt":0.29190614115601826,"score_spread":0.2755925388099906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122238195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2041208,0.014962373,0.45103344,0.0265358,0.004340289,0.00079830963,0.0122543685,0.013633665,0.27232093],"genre_scores_gemma":[0.7017838,0.0067741815,0.20502439,0.005652887,0.0048864894,0.000987947,0.0076402524,0.0030605404,0.064189486],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99122953,0.0014516542,0.00033117097,0.001798283,0.0029940829,0.0021953257],"domain_scores_gemma":[0.96508425,0.024567833,0.00103666,0.0054764585,0.001950724,0.0018840593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004852087,0.003723394,0.0039012511,0.003821596,0.003057924,0.010292075,0.010537729,0.004473877,0.047898155],"category_scores_gemma":[0.02954782,0.0022212297,0.0031579847,0.0065699304,0.0038815902,0.022720546,0.009821653,0.009096054,0.011531301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0075589195,0.0020111667,0.0072525064,0.004496317,0.00060743245,0.00094496313,0.0009650079,0.19759463,0.042826023,0.28151646,0.15247433,0.30175218],"study_design_scores_gemma":[0.00067486963,0.00050610775,0.0027009272,0.00031031494,0.00053143315,0.00056705537,0.00028340507,0.5064681,0.015361563,0.44324553,0.029137954,0.00021266947],"about_ca_topic_score_codex":0.0061429194,"about_ca_topic_score_gemma":0.011070041,"teacher_disagreement_score":0.047898155,"about_ca_system_score_codex":0.0084687555,"about_ca_system_score_gemma":0.005795266,"threshold_uncertainty_score":0.16023523},"labels":[],"label_agreement":null},{"id":"W2122404357","doi":"10.1007/s00493-014-2806-z","title":"A minimum degree condition forcing complete graph immersion","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Disjoint sets; Simple graph; Immersion (mathematics); Complement graph; Graph power; Line graph; Geometry","score_opus":0.03635824512445577,"score_gpt":0.2841506765625666,"score_spread":0.24779243143811083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122404357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33491817,0.0007871222,0.3687167,0.009550147,0.0011112362,0.00028661493,0.0022387032,0.0018368459,0.28055444],"genre_scores_gemma":[0.89772135,0.0005132464,0.051246855,0.0014279821,0.00056629063,0.00022395427,0.001469593,0.00069711695,0.046133637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842715,0.00018967949,0.00007718763,0.00052479934,0.00041984345,0.00036133328],"domain_scores_gemma":[0.9951448,0.0025459745,0.00025212226,0.00057656626,0.00066118053,0.00081942213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010567427,0.0008652572,0.0019610547,0.0014624185,0.0028527365,0.0033231226,0.0017623705,0.002834312,0.019827975],"category_scores_gemma":[0.005983338,0.001004815,0.00194569,0.0012038826,0.0031364483,0.0087978,0.0068121534,0.0070253937,0.0020520603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009624645,0.000037184247,0.00018390911,0.00009130933,0.000010348316,0.00010128337,0.00026186908,0.0016424799,0.002296034,0.9883663,0.002789904,0.004123098],"study_design_scores_gemma":[0.00003065959,0.000027171414,0.00012688464,0.0000190943,0.000011211234,0.000104768376,0.00010574507,0.0059485184,0.0010294437,0.9889048,0.0036766096,0.000015148821],"about_ca_topic_score_codex":0.0010744008,"about_ca_topic_score_gemma":0.0012008516,"teacher_disagreement_score":0.019827975,"about_ca_system_score_codex":0.0020039196,"about_ca_system_score_gemma":0.0009751362,"threshold_uncertainty_score":0.06633115},"labels":[],"label_agreement":null},{"id":"W2122599841","doi":"10.1016/j.disc.2013.08.032","title":"A Dirac-type characterization of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-chordal graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Characterization (materials science); Graph; Discrete mathematics; Physics","score_opus":0.018689806947235477,"score_gpt":0.2611651905464756,"score_spread":0.2424753835992401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122599841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17578407,0.00076799095,0.470671,0.0020454607,0.00093958207,0.00015522286,0.0022823247,0.0009940105,0.34636036],"genre_scores_gemma":[0.8706885,0.0005154839,0.061774116,0.0009929165,0.00036577586,0.000085775464,0.0017104158,0.00038220952,0.063484915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995085,0.00007454383,0.00004292007,0.00012890119,0.00014732762,0.00009791222],"domain_scores_gemma":[0.99795,0.0005830943,0.00021585605,0.00033197715,0.0005786317,0.00034045213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046586452,0.00040187791,0.00037630665,0.00200212,0.001558254,0.0023833592,0.0014387758,0.0007349419,0.01659812],"category_scores_gemma":[0.0024912509,0.00028899853,0.0004413417,0.001880029,0.0017696543,0.0023086,0.0015874669,0.0017410491,0.0025351753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027411974,0.000008894596,0.00032911642,0.00002826357,0.0000035237015,0.000089262205,0.0001508303,0.0002910995,0.00094875245,0.9895336,0.0025260057,0.0060632285],"study_design_scores_gemma":[0.000016380429,0.00001881923,0.0004791455,0.00003293291,0.000008862344,0.00038140322,0.00029150007,0.004035442,0.0014656223,0.97416806,0.019083312,0.000018547336],"about_ca_topic_score_codex":0.0018695616,"about_ca_topic_score_gemma":0.002173492,"teacher_disagreement_score":0.01659812,"about_ca_system_score_codex":0.0013288055,"about_ca_system_score_gemma":0.0006826138,"threshold_uncertainty_score":0.055526316},"labels":[],"label_agreement":null},{"id":"W2123784540","doi":"10.1007/3-540-44683-4_11","title":"Refined Search Tree Technique for Dominating Set on Planar Graphs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Planar graph; Dominating set; Combinatorics; Reduction (mathematics); Search tree; Computer science; Graph; Mathematics; Tree (set theory); Set (abstract data type); Discrete mathematics; Algorithm; Search algorithm; Vertex (graph theory)","score_opus":0.03720729722806748,"score_gpt":0.31655558615372115,"score_spread":0.27934828892565366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123784540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017724806,0.000900698,0.9743575,0.00021386966,0.000094611925,0.00013168779,0.00030312623,0.00059072766,0.0056829723],"genre_scores_gemma":[0.14651659,0.0014099502,0.8389411,0.00016626736,0.00014073378,0.00023802828,0.0010144155,0.0003773575,0.011195564],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992167,0.00017534003,0.00004595946,0.00013881535,0.00035355182,0.00006965903],"domain_scores_gemma":[0.99852717,0.0007387519,0.00005667562,0.00039159958,0.00023402016,0.000051748975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008106534,0.000636803,0.0013539348,0.0020194491,0.00062896323,0.0010048604,0.0022042738,0.0007579521,0.0054162005],"category_scores_gemma":[0.0033027236,0.0006248843,0.001328154,0.0029021725,0.0006752956,0.0029523408,0.0017488669,0.0020832017,0.0011644618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052447576,0.00023184804,0.0006398643,0.0012399101,0.00017772897,0.00025301514,0.0006812164,0.10239111,0.061450478,0.37519214,0.01846188,0.4387563],"study_design_scores_gemma":[0.0001547483,0.00030303595,0.00086523604,0.00011389649,0.00022533318,0.0006093763,0.00015434434,0.6169104,0.022703337,0.3267517,0.031142106,0.00006657127],"about_ca_topic_score_codex":0.0015300004,"about_ca_topic_score_gemma":0.0021850076,"teacher_disagreement_score":0.0054162005,"about_ca_system_score_codex":0.00081226835,"about_ca_system_score_gemma":0.00075240474,"threshold_uncertainty_score":0.018119037},"labels":[],"label_agreement":null},{"id":"W2123868336","doi":"10.1016/j.tcs.2007.02.033","title":"Efficient algorithms for center problems in cactus networks","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Cactus; Center (category theory); Algorithm; Computer science; Mathematics","score_opus":0.018651931694772642,"score_gpt":0.30651717067432355,"score_spread":0.2878652389795509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123868336","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12590963,0.0012429212,0.8361456,0.0028578425,0.00030729268,0.00088512496,0.0012532909,0.005900796,0.02549753],"genre_scores_gemma":[0.37807027,0.00058821304,0.60604465,0.00033013496,0.00023181645,0.00045894997,0.0023857972,0.0008198816,0.011070324],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977059,0.0005821889,0.00012117374,0.00056150154,0.00049231324,0.0005369732],"domain_scores_gemma":[0.9895068,0.0065044607,0.00069316465,0.0017105615,0.0009466666,0.0006384888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002244359,0.001859716,0.002190759,0.0027574257,0.003462456,0.004747545,0.005244085,0.0032685145,0.018944453],"category_scores_gemma":[0.01237406,0.0011548613,0.0016540304,0.003473809,0.0021185584,0.008956677,0.004726303,0.0034366748,0.0025198273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018381856,0.0012534673,0.0031559519,0.00093081855,0.00017843545,0.00016568483,0.00095540186,0.28307387,0.0069078263,0.2362482,0.061169893,0.40412217],"study_design_scores_gemma":[0.00036030766,0.00012018511,0.0003476378,0.000060063932,0.000072474286,0.00010884153,0.00044882344,0.74359167,0.005405502,0.24230643,0.0071432595,0.00003483668],"about_ca_topic_score_codex":0.007297577,"about_ca_topic_score_gemma":0.011850764,"teacher_disagreement_score":0.018944453,"about_ca_system_score_codex":0.004100718,"about_ca_system_score_gemma":0.0044914624,"threshold_uncertainty_score":0.06337547},"labels":[],"label_agreement":null},{"id":"W2123921374","doi":"10.1007/s10107-005-0647-7","title":"Recognizing Balanceable Matrices","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block matrix; Mathematics; Matrix (chemical analysis); Modulo; Combinatorics; Square matrix; Block (permutation group theory); Column (typography); Discrete mathematics; Symmetric matrix; Eigenvalues and eigenvectors; Geometry","score_opus":0.03153990687852182,"score_gpt":0.30946931220908636,"score_spread":0.27792940533056454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123921374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19637306,0.00053462724,0.7485513,0.0012253154,0.00033238146,0.00016280063,0.0020883558,0.0029855494,0.047746632],"genre_scores_gemma":[0.7491712,0.0004902697,0.20601173,0.00040154633,0.00028587648,0.0001545239,0.0065479637,0.0007416695,0.03619513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999418,0.00007401792,0.000044467055,0.00022882794,0.00014288732,0.000091905575],"domain_scores_gemma":[0.9988701,0.00038582375,0.00016803789,0.00021925494,0.00025680722,0.000100012905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029538234,0.00072368386,0.0005946426,0.0013239634,0.001009436,0.0027728057,0.0009424475,0.0010516108,0.014075169],"category_scores_gemma":[0.0027998032,0.0006075875,0.00058012956,0.0012887985,0.00064551696,0.0056155883,0.0014221139,0.0016397358,0.004182139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049183285,0.0002568344,0.004039592,0.0003279084,0.00005615493,0.00042429706,0.00077094976,0.024126742,0.04461311,0.612319,0.028503941,0.28406954],"study_design_scores_gemma":[0.00002896607,0.00008697196,0.0011140588,0.00004587622,0.000028135668,0.000329134,0.00040675563,0.10656305,0.016082207,0.8450315,0.030252917,0.000030466883],"about_ca_topic_score_codex":0.0013282432,"about_ca_topic_score_gemma":0.0021352903,"teacher_disagreement_score":0.014075169,"about_ca_system_score_codex":0.000555315,"about_ca_system_score_gemma":0.00045730174,"threshold_uncertainty_score":0.04708612},"labels":[],"label_agreement":null},{"id":"W2123984395","doi":"10.1016/j.tcs.2004.06.013","title":"Characterization of networks supporting multi-dimensional linear interval routing schemes","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Node (physics); Interval (graph theory); Routing (electronic design automation); Class (philosophy); Generalization; Integer (computer science); Discrete mathematics; Computer science; Mathematics; Combinatorics; Scheme (mathematics); Set (abstract data type); Topology (electrical circuits); Computer network; Artificial intelligence","score_opus":0.01905426557928505,"score_gpt":0.30749170544809024,"score_spread":0.2884374398688052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123984395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80021805,0.00069661083,0.18415736,0.0005894009,0.000042242016,0.00016899046,0.0010034473,0.00041541195,0.012708545],"genre_scores_gemma":[0.9750038,0.0002717751,0.022475805,0.0000727112,0.000044386292,0.00010418606,0.0006434269,0.000032238855,0.0013516847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988171,0.0002757096,0.00011593519,0.00023020456,0.0003093758,0.000251706],"domain_scores_gemma":[0.98490244,0.008290276,0.0036399707,0.0011951833,0.0010601064,0.00091206306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013687798,0.0006218905,0.00074819307,0.0021689888,0.00088981073,0.00337977,0.001903907,0.0010724993,0.0036995676],"category_scores_gemma":[0.010733684,0.00047499372,0.00038378523,0.0019093788,0.0009952765,0.0034411456,0.001397315,0.0009581543,0.00038873183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032791868,0.0006548617,0.014929251,0.00076274277,0.00014030792,0.000623185,0.0011153828,0.2519953,0.08459828,0.5418146,0.00590583,0.094181016],"study_design_scores_gemma":[0.00011384572,0.0007338754,0.0042427215,0.00011590408,0.00007944387,0.0009967473,0.0006614503,0.80081934,0.014723853,0.1723023,0.0051349686,0.00007563544],"about_ca_topic_score_codex":0.0003807204,"about_ca_topic_score_gemma":0.00044282211,"teacher_disagreement_score":0.0036995676,"about_ca_system_score_codex":0.0012559581,"about_ca_system_score_gemma":0.0006108886,"threshold_uncertainty_score":0.012376308},"labels":[],"label_agreement":null},{"id":"W2125078199","doi":"10.1002/rsa.20695","title":"Acyclic edge colourings of graphs with large girth","year":2016,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Girth (graph theory); Directed acyclic graph; Graph; Enhanced Data Rates for GSM Evolution; Triangle-free graph; Edge coloring; Random graph","score_opus":0.007833057280669756,"score_gpt":0.2503309449894059,"score_spread":0.24249788770873615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125078199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7786932,0.0008187328,0.20458654,0.0005678909,0.00007857073,0.00009535026,0.0004971523,0.0004917002,0.01417082],"genre_scores_gemma":[0.9503026,0.00055462244,0.044474415,0.00015118827,0.00005972109,0.00008335685,0.00056232937,0.00014571671,0.0036659844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993339,0.0002161154,0.0000488009,0.00016492954,0.000101359576,0.00013483642],"domain_scores_gemma":[0.99345464,0.0038205574,0.0009771644,0.0009634967,0.00028772888,0.00049634895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056728703,0.00043326974,0.00034768754,0.001108755,0.0008093447,0.0013672757,0.0006250476,0.00083073863,0.00294644],"category_scores_gemma":[0.0054358845,0.00051775144,0.0006345686,0.001049514,0.0016046138,0.002111337,0.0015573632,0.0009341492,0.00041003447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007044043,0.00010664987,0.0140943425,0.00047547175,0.000079504745,0.0013258503,0.0016272676,0.046864364,0.041546054,0.8240967,0.006118275,0.06296106],"study_design_scores_gemma":[0.000050874274,0.00009655917,0.0041898536,0.00006906454,0.0000691367,0.0011645705,0.00028177997,0.058027625,0.011670203,0.9124202,0.011918367,0.000041745196],"about_ca_topic_score_codex":0.00053662976,"about_ca_topic_score_gemma":0.0009789995,"teacher_disagreement_score":0.00294644,"about_ca_system_score_codex":0.000547141,"about_ca_system_score_gemma":0.00033837243,"threshold_uncertainty_score":0.00985682},"labels":[],"label_agreement":null},{"id":"W2125095198","doi":"10.1007/s10998-006-0035-y","title":"Problems on polytopes, their groups, and realizations","year":2006,"lang":"en","type":"article","venue":"Periodica Mathematica Hungarica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Polytope; Mathematics; Regular polygon; Combinatorics; Geometry","score_opus":0.01703905265785278,"score_gpt":0.2491012303506705,"score_spread":0.23206217769281773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125095198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43390682,0.0074526756,0.321871,0.018360306,0.0009804468,0.00021066259,0.002317765,0.00030455145,0.21459578],"genre_scores_gemma":[0.851957,0.0054455707,0.07027328,0.00079006713,0.0020879614,0.00046408633,0.0024116756,0.00022054226,0.066349715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999188,0.00025963987,0.000041575116,0.00021954907,0.00014029288,0.00015092782],"domain_scores_gemma":[0.9985662,0.0009295927,0.00014380255,0.00013363436,0.00008778411,0.00013903013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007930925,0.00081008347,0.0012719398,0.0016575286,0.0029261545,0.004089192,0.0012655575,0.0022989998,0.0123722125],"category_scores_gemma":[0.0032338966,0.0005819619,0.0013823879,0.0022918219,0.0039620916,0.006338276,0.0023456898,0.0043723946,0.0012194302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019322366,0.000016692205,0.00009736324,0.00004240852,0.00000596189,0.000024163,0.00009256285,0.0019134827,0.000081048114,0.99205315,0.0018545031,0.0037994948],"study_design_scores_gemma":[0.000010451928,0.000005948484,0.00007677137,0.000009113692,0.0000034166242,0.000024876521,0.00008761029,0.0025422992,0.000059415303,0.9945649,0.0026107144,0.0000044540534],"about_ca_topic_score_codex":0.0013609871,"about_ca_topic_score_gemma":0.0012488259,"teacher_disagreement_score":0.0123722125,"about_ca_system_score_codex":0.0017729029,"about_ca_system_score_gemma":0.0008353609,"threshold_uncertainty_score":0.041389227},"labels":[],"label_agreement":null},{"id":"W2125583143","doi":"10.1016/j.tcs.2013.06.009","title":"On minimum cost edge searching","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Ideal (ethics); Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Best-first search; Mathematical optimization; Beam search; Search algorithm; Computer science; Combinatorics; Artificial intelligence","score_opus":0.018929723704174912,"score_gpt":0.30389556963707576,"score_spread":0.28496584593290086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125583143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105243444,0.0049243183,0.7767037,0.0064560394,0.0008730077,0.00041518334,0.0012911081,0.0011257079,0.10296755],"genre_scores_gemma":[0.39495784,0.0030793522,0.5473253,0.0017815882,0.000638289,0.00053383736,0.0020372197,0.00097157795,0.048674952],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986418,0.00046550515,0.00006389185,0.00026699918,0.00034283043,0.00021897102],"domain_scores_gemma":[0.99306196,0.0053400965,0.00026138753,0.0007311364,0.00034994146,0.00025548253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013702896,0.0017136593,0.0023124074,0.0024202564,0.0013943792,0.0020253274,0.004407706,0.0030104194,0.024266746],"category_scores_gemma":[0.014583551,0.0009397428,0.0010957725,0.0048685377,0.0021632737,0.006355263,0.004150887,0.0033089896,0.0020537856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016823058,0.00053907273,0.0013749592,0.000834159,0.0001567339,0.00016342525,0.00040174572,0.2413691,0.003764747,0.33876124,0.054541256,0.35641125],"study_design_scores_gemma":[0.00021708217,0.00017323549,0.0005646455,0.00014920664,0.00008609991,0.00015449405,0.00015494777,0.44329235,0.0012361663,0.5437582,0.0101834405,0.000030081972],"about_ca_topic_score_codex":0.0032221198,"about_ca_topic_score_gemma":0.003946162,"teacher_disagreement_score":0.024266746,"about_ca_system_score_codex":0.0015207755,"about_ca_system_score_gemma":0.0014941151,"threshold_uncertainty_score":0.08118039},"labels":[],"label_agreement":null},{"id":"W2126829018","doi":"10.1016/j.disc.2005.03.020","title":"Rebuilding convex sets in graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Combinatorics; Mathematics; Convex hull; Neighbourhood (mathematics); Convex set; Vertex (graph theory); Wheel graph; Discrete mathematics; Independent set; Chordal graph; Distance; Graph; Graph power; Regular polygon; Line graph; Geometry; Convex optimization","score_opus":0.026380368166790867,"score_gpt":0.32054564366337096,"score_spread":0.2941652754965801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126829018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15787216,0.0010853718,0.78288066,0.0026502027,0.00065252173,0.00012416448,0.0003815002,0.0014950831,0.05285833],"genre_scores_gemma":[0.57762676,0.0015573589,0.3710082,0.0008674503,0.000291492,0.00013586238,0.0008255436,0.0020180263,0.04566935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989672,0.0003430563,0.00004605336,0.00020230615,0.0002995528,0.00014192241],"domain_scores_gemma":[0.99591583,0.0016987018,0.00017943089,0.0015591502,0.00032996287,0.00031700038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089408987,0.00092133484,0.0013522955,0.0018433584,0.0016372895,0.0027807043,0.0021535084,0.0012982498,0.010938132],"category_scores_gemma":[0.006008062,0.001222437,0.0014028416,0.0015101351,0.0029921148,0.0050818813,0.004671823,0.00487629,0.0022940396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010619637,0.00007050382,0.00033536932,0.00019563337,0.00004851334,0.00019019644,0.000577413,0.035184365,0.00816243,0.8833156,0.007152816,0.064660974],"study_design_scores_gemma":[0.000012686761,0.000021447318,0.00015724833,0.000032110962,0.000017321838,0.00009452268,0.0002399036,0.039188344,0.0032278434,0.9452567,0.011737404,0.000014410574],"about_ca_topic_score_codex":0.002199729,"about_ca_topic_score_gemma":0.0030422069,"teacher_disagreement_score":0.010938132,"about_ca_system_score_codex":0.0011575228,"about_ca_system_score_gemma":0.00056771276,"threshold_uncertainty_score":0.03659171},"labels":[],"label_agreement":null},{"id":"W2127188248","doi":"10.1016/j.dam.2007.09.023","title":"Minimum cost homomorphisms to semicomplete multipartite digraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Multipartite; Combinatorics; Mathematics; Bipartite graph; Discrete mathematics; Graph; Directed graph; Graph homomorphism; Line graph; Voltage graph","score_opus":0.0414669072239449,"score_gpt":0.28795422467880716,"score_spread":0.24648731745486224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127188248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50148,0.00053327804,0.4590633,0.0017174598,0.00024087475,0.00025373962,0.00082460785,0.0009090727,0.034977797],"genre_scores_gemma":[0.8556976,0.0004967493,0.11962135,0.00038449524,0.00014123075,0.00028999842,0.00062428013,0.0003994284,0.022344708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992173,0.00024204806,0.000044562294,0.00018064691,0.00016362072,0.00015176117],"domain_scores_gemma":[0.9936598,0.0033579427,0.00042033766,0.0010349343,0.00052914297,0.000997877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008908776,0.00057178986,0.0011585883,0.0014353525,0.0016201502,0.0025798168,0.0017671552,0.0014533057,0.009091496],"category_scores_gemma":[0.006699594,0.0008556728,0.0009046225,0.0016864184,0.0014279649,0.0043180343,0.0028203202,0.0032287808,0.0009008376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018737673,0.00014258378,0.0004962156,0.00018895678,0.000031422864,0.00012114611,0.00046258248,0.02144909,0.003468563,0.9370085,0.0037954643,0.03264809],"study_design_scores_gemma":[0.000037279944,0.000042361073,0.00022119941,0.00002202094,0.000017726026,0.000111890775,0.00014140867,0.0553377,0.001500622,0.94013983,0.0024142228,0.000013877114],"about_ca_topic_score_codex":0.0006303561,"about_ca_topic_score_gemma":0.0013132147,"teacher_disagreement_score":0.009091496,"about_ca_system_score_codex":0.0014117756,"about_ca_system_score_gemma":0.00083410926,"threshold_uncertainty_score":0.030414104},"labels":[],"label_agreement":null},{"id":"W2127629780","doi":"10.1002/jgt.21755","title":"On the Polarity and Monopolarity of Graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Pathwidth; Indifference graph; Cograph; Strong perfect graph theorem; Maximal independent set; 1-planar graph; Modular decomposition; Discrete mathematics; Split graph; Metric dimension; Bipartite graph; Time complexity; Line graph; Graph","score_opus":0.015333792843876674,"score_gpt":0.25951331588194154,"score_spread":0.24417952303806487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127629780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49051183,0.0010583136,0.45918313,0.0034819331,0.0001720865,0.00029117466,0.0015246288,0.0009897971,0.042787135],"genre_scores_gemma":[0.938817,0.00087371137,0.054141693,0.0004780832,0.00015332349,0.00008421537,0.0014641271,0.000101045334,0.0038868366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992761,0.00014355566,0.000039642524,0.00021231675,0.00021123825,0.00011721645],"domain_scores_gemma":[0.99439406,0.0037974115,0.00046017155,0.00049198774,0.00057976955,0.00027651625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040141676,0.00036117717,0.00033091972,0.001358938,0.0007892239,0.0023078409,0.00077362335,0.00069342036,0.0047309077],"category_scores_gemma":[0.0051620686,0.00039365422,0.0004644098,0.0011866563,0.0016012638,0.0038659924,0.001341979,0.0013146701,0.0006942165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006170607,0.00018337315,0.00852618,0.0008133965,0.000069295005,0.0011680053,0.0015823048,0.06423938,0.05073035,0.64732635,0.015088518,0.20965572],"study_design_scores_gemma":[0.00004098838,0.00006956962,0.0021126939,0.00007363885,0.000030497937,0.0008021918,0.00055204943,0.110400416,0.014717506,0.8598031,0.011356317,0.000040980794],"about_ca_topic_score_codex":0.0016388382,"about_ca_topic_score_gemma":0.001230032,"teacher_disagreement_score":0.0047309077,"about_ca_system_score_codex":0.00066081074,"about_ca_system_score_gemma":0.0004313212,"threshold_uncertainty_score":0.015826464},"labels":[],"label_agreement":null},{"id":"W2127787106","doi":"10.1016/j.dam.2011.03.023","title":"Vertex splitting and the recognition of trapezoid graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph; Discrete mathematics","score_opus":0.040049433078991906,"score_gpt":0.25853679108964805,"score_spread":0.21848735801065616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127787106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5795324,0.00087887095,0.38265243,0.0005325997,0.00021494835,0.000108486165,0.00063575123,0.0012049405,0.0342397],"genre_scores_gemma":[0.87091476,0.00038333857,0.11784975,0.00011650457,0.000039669772,0.00004593706,0.0013730533,0.00019229123,0.009084789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957997,0.000057920683,0.000031519834,0.00013882012,0.000109811364,0.000081847116],"domain_scores_gemma":[0.9987999,0.00035133684,0.0001414815,0.00035744725,0.00020549896,0.00014427004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022837469,0.00030183315,0.00062031293,0.0008318539,0.0007453315,0.002269678,0.0009412272,0.0008071712,0.0046406076],"category_scores_gemma":[0.0019412495,0.00036448528,0.00053652487,0.00116799,0.0010294375,0.0022097267,0.0011835361,0.0011217517,0.001162834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008433737,0.00015360762,0.0065635704,0.00028420435,0.00004968211,0.00082336407,0.002066176,0.051734574,0.065680146,0.5563067,0.008263565,0.30723104],"study_design_scores_gemma":[0.000026840042,0.000079849975,0.002233933,0.00006585454,0.000027086484,0.00061920064,0.0010339615,0.17764018,0.016390216,0.78715414,0.014685711,0.000042923653],"about_ca_topic_score_codex":0.0019677484,"about_ca_topic_score_gemma":0.0020780615,"teacher_disagreement_score":0.0046406076,"about_ca_system_score_codex":0.0005163183,"about_ca_system_score_gemma":0.00046020915,"threshold_uncertainty_score":0.015524387},"labels":[],"label_agreement":null},{"id":"W2128660769","doi":"10.1017/s0963548308009140","title":"Graph Colouring with No Large Monochromatic Components","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Bounded function; Degree (music); Discrete mathematics; Planar graph; Monochromatic color; Physics","score_opus":0.033064358270159085,"score_gpt":0.2590236197809189,"score_spread":0.22595926151075985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128660769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83259624,0.00080143515,0.13575238,0.0010880128,0.0001365884,0.00009541793,0.00068998086,0.001228152,0.027611755],"genre_scores_gemma":[0.95006204,0.00020316035,0.041851737,0.0002751188,0.00005212149,0.00005212646,0.00060116005,0.000114150585,0.006788498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938023,0.0000934026,0.000033478613,0.00022464017,0.00013260434,0.00013566857],"domain_scores_gemma":[0.99757224,0.00065533555,0.00045181403,0.0008369528,0.00022289951,0.00026088062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030154784,0.00036238704,0.0005106664,0.00041670576,0.0006747507,0.0011059791,0.00087236136,0.0007549846,0.002795473],"category_scores_gemma":[0.0028444433,0.00038115252,0.00052358053,0.00062132056,0.0010034502,0.0013599356,0.001074008,0.00074746256,0.00053447246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002441482,0.00024405193,0.015459645,0.0007624627,0.00020812669,0.0015769617,0.0013967815,0.08654274,0.2790339,0.46698982,0.020308511,0.12503555],"study_design_scores_gemma":[0.00022521942,0.0005438641,0.0118385,0.000060771825,0.00016274524,0.0029798923,0.00035379722,0.27009985,0.0592016,0.61289847,0.041531652,0.000103674516],"about_ca_topic_score_codex":0.0018364629,"about_ca_topic_score_gemma":0.0021512224,"teacher_disagreement_score":0.002795473,"about_ca_system_score_codex":0.001086894,"about_ca_system_score_gemma":0.0004994951,"threshold_uncertainty_score":0.00935185},"labels":[],"label_agreement":null},{"id":"W2128803128","doi":"10.1002/jgt.20602","title":"Automorphism group and diameter of a graph","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph automorphism; Automorphism; Automorphism group; Graph; Edge-transitive graph; Vertex-transitive graph; Symmetric graph; Upper and lower bounds; Discrete mathematics; Order (exchange); Voltage graph; Line graph","score_opus":0.028883853005037145,"score_gpt":0.2597567527243919,"score_spread":0.23087289971935476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128803128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9429086,0.0009293862,0.04030203,0.0008302423,0.00008129076,0.000040371575,0.00045513333,0.00036216385,0.0140908165],"genre_scores_gemma":[0.99123514,0.0004065067,0.0063242987,0.00007495746,0.00012820892,0.00003396515,0.00025517796,0.00006382705,0.0014778967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928004,0.00013186128,0.00004071171,0.00026326563,0.00013399697,0.00015010654],"domain_scores_gemma":[0.9891656,0.0065830755,0.001577958,0.0010287601,0.00047534623,0.0011692675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008593594,0.0005421315,0.0007830417,0.0023250775,0.00080519577,0.002273689,0.0007453142,0.0008436044,0.002845689],"category_scores_gemma":[0.0063324915,0.00047722954,0.00045826833,0.0008122184,0.0018983786,0.002289688,0.0013585052,0.0010749159,0.00046415618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017814231,0.00031844148,0.055836413,0.00056421227,0.00016690558,0.0012631731,0.0034425363,0.07830417,0.18865895,0.62225723,0.008611813,0.03879464],"study_design_scores_gemma":[0.00019884693,0.0006483147,0.030634267,0.0001797373,0.00016840149,0.0028548136,0.00089119264,0.17889626,0.07086232,0.6943397,0.020191025,0.00013521248],"about_ca_topic_score_codex":0.0006088365,"about_ca_topic_score_gemma":0.0005513871,"teacher_disagreement_score":0.002845689,"about_ca_system_score_codex":0.0011962525,"about_ca_system_score_gemma":0.00040505175,"threshold_uncertainty_score":0.009519756},"labels":[],"label_agreement":null},{"id":"W2128954556","doi":"10.1016/j.jctb.2005.09.007","title":"Augmenting chains in graphs without a skew star","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Skew; Star (game theory); Computer science; Mathematics; Combinatorics; Telecommunications","score_opus":0.012703002840513162,"score_gpt":0.2792198242773306,"score_spread":0.26651682143681743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128954556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68723583,0.00038293112,0.2168419,0.0004778826,0.0002669605,0.0002540507,0.00054436206,0.00069304695,0.09330298],"genre_scores_gemma":[0.7910152,0.00062002125,0.16384172,0.00026465117,0.000171004,0.0002742055,0.000771693,0.0004284343,0.042613078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931455,0.00018787083,0.00005428801,0.00016805177,0.00014237472,0.00013282229],"domain_scores_gemma":[0.99579936,0.0016140734,0.00046285806,0.00094033027,0.0005109455,0.0006724376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075441034,0.00071402465,0.00089526275,0.0014145607,0.0024610911,0.00216663,0.0010277168,0.0012209284,0.014623693],"category_scores_gemma":[0.0031878718,0.00091308594,0.0009655328,0.0017005728,0.0014972342,0.003919486,0.0024631266,0.0017632733,0.0022954163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038716255,0.0002310359,0.0020844436,0.00020140858,0.00003390705,0.00062853715,0.0008191629,0.010786852,0.012912745,0.9241371,0.0030129142,0.04476474],"study_design_scores_gemma":[0.00004158074,0.00012087935,0.00061638915,0.00006781435,0.000051446186,0.00033057155,0.00034364135,0.025230693,0.0058982843,0.954752,0.012526277,0.00002036927],"about_ca_topic_score_codex":0.0006405407,"about_ca_topic_score_gemma":0.0016322379,"teacher_disagreement_score":0.014623693,"about_ca_system_score_codex":0.00044350224,"about_ca_system_score_gemma":0.0005326107,"threshold_uncertainty_score":0.048921168},"labels":[],"label_agreement":null},{"id":"W2129430342","doi":"10.1016/j.dam.2013.04.026","title":"Finding a smallest odd hole in a claw-free graph using global structure","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Claw; Mathematics; Lemma (botany); Line graph; Graph; Discrete mathematics","score_opus":0.02756508440387017,"score_gpt":0.29294261870309146,"score_spread":0.2653775342992213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129430342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75142056,0.00024575985,0.23735972,0.0006109159,0.0001035944,0.00024013552,0.0006871667,0.00071801175,0.008614186],"genre_scores_gemma":[0.7831916,0.00014248383,0.20807579,0.00018035878,0.000022993265,0.00013593878,0.0013724369,0.00032602026,0.0065523284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999785,0.000026411491,0.000012155074,0.00008968245,0.000031165637,0.000055631866],"domain_scores_gemma":[0.99900573,0.00045445602,0.00011245176,0.00016719603,0.00009112181,0.00016911961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027496854,0.00097214733,0.0011204308,0.0009395409,0.0013251108,0.0009409215,0.0013273958,0.0012516481,0.0044034543],"category_scores_gemma":[0.0015317219,0.0005362255,0.00088909594,0.0007512953,0.0011905658,0.0030053372,0.0020682751,0.0011368986,0.0006486202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029740976,0.0010835857,0.023036826,0.0029600135,0.00036582164,0.0044953814,0.0042495467,0.09239277,0.21307859,0.28837925,0.028092653,0.3388915],"study_design_scores_gemma":[0.0004950866,0.0012920601,0.006219379,0.0003045478,0.0003987581,0.0017437548,0.0042344136,0.23537202,0.057384986,0.67496634,0.017436098,0.00015256753],"about_ca_topic_score_codex":0.0011395562,"about_ca_topic_score_gemma":0.0023565835,"teacher_disagreement_score":0.0044034543,"about_ca_system_score_codex":0.00039108357,"about_ca_system_score_gemma":0.00072119327,"threshold_uncertainty_score":0.01473099},"labels":[],"label_agreement":null},{"id":"W2129541994","doi":"10.4171/aihpd/31","title":"The phase transition in random regular exact cover","year":2016,"lang":"en","type":"preprint","venue":"Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Combinatorics; Satisfiability; Mathematics; Cover (algebra); Star (game theory); Discrete mathematics; Random variable; Statistics; Mathematical analysis","score_opus":0.021619521067009765,"score_gpt":0.301906142497162,"score_spread":0.28028662143015226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129541994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7355923,0.00088318385,0.2392846,0.0035873498,0.00011537985,0.00020273754,0.0013870408,0.0013733481,0.017573977],"genre_scores_gemma":[0.9751076,0.00020153908,0.019869577,0.00045490445,0.00007215923,0.00018019938,0.00066653185,0.0001932612,0.0032542432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969248,0.0011491567,0.00013558884,0.0006265641,0.00060720765,0.00055664475],"domain_scores_gemma":[0.9778221,0.017006427,0.0015407443,0.0019297859,0.0006915309,0.0010092659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041579967,0.0005478951,0.0013406925,0.0013130696,0.0010553538,0.0021911769,0.0017624291,0.001223006,0.004963818],"category_scores_gemma":[0.027383767,0.0007821751,0.0012415425,0.0009008049,0.0032253603,0.0036606847,0.001960844,0.0020256669,0.00037751155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016825793,0.00030139062,0.009484338,0.00043026992,0.0001886648,0.0005948733,0.00060671015,0.29378378,0.009273796,0.64597005,0.012238346,0.025445132],"study_design_scores_gemma":[0.00012314339,0.000102529484,0.0015351727,0.00005024192,0.000036855567,0.00019058291,0.000086559274,0.71505356,0.0033012885,0.27821898,0.0012654588,0.00003562176],"about_ca_topic_score_codex":0.0030367954,"about_ca_topic_score_gemma":0.0033090757,"teacher_disagreement_score":0.004963818,"about_ca_system_score_codex":0.0035266362,"about_ca_system_score_gemma":0.0014653731,"threshold_uncertainty_score":0.025587678},"labels":[],"label_agreement":null},{"id":"W2130144906","doi":"","title":"Layered Separators in Minor-Closed Families with Applications","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Planar graph; Bounded function; Mathematics; Upper and lower bounds; Discrete mathematics; Minor (academic); Treewidth; 1-planar graph; Book embedding; Graph; Pathwidth; Line graph","score_opus":0.054034818373566405,"score_gpt":0.21215919077157283,"score_spread":0.15812437239800642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130144906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45430326,0.0010679608,0.52348304,0.0011058353,0.00010654453,0.00010451029,0.00042056877,0.0009492381,0.018459097],"genre_scores_gemma":[0.8840483,0.0007212673,0.104946926,0.00022237009,0.00016978668,0.00014803748,0.00050249364,0.0003045686,0.008936232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990664,0.00019257615,0.000054813787,0.00027660155,0.00021355019,0.00019612825],"domain_scores_gemma":[0.9920364,0.004666728,0.0008044744,0.0009048141,0.00067114126,0.0009164101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000907187,0.00053531805,0.00067165605,0.0010337875,0.0018721884,0.0020722551,0.0014184322,0.0010264614,0.006608474],"category_scores_gemma":[0.011212511,0.00055642234,0.001066357,0.0012481997,0.0016347218,0.004653444,0.0036691327,0.0020418852,0.0007641791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047107728,0.00017893843,0.008310997,0.00042473507,0.00005999657,0.00068443856,0.0017337942,0.05478773,0.013252815,0.8403122,0.0061166803,0.07366662],"study_design_scores_gemma":[0.000054269225,0.00018674992,0.0020312003,0.00009043357,0.000043175274,0.001085695,0.0005515628,0.17628673,0.0064144125,0.7888254,0.024384584,0.00004580879],"about_ca_topic_score_codex":0.0012236487,"about_ca_topic_score_gemma":0.0011562317,"teacher_disagreement_score":0.006608474,"about_ca_system_score_codex":0.001322819,"about_ca_system_score_gemma":0.0005898409,"threshold_uncertainty_score":0.022107601},"labels":[],"label_agreement":null},{"id":"W213041943","doi":"10.1016/s0012-365x(00)00009-1","title":"The complexity of H-colouring of bounded degree graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Degree (music); Bounded function; Mathematics; Combinatorics; Discrete mathematics; Computer science; Physics","score_opus":0.0813376872937042,"score_gpt":0.3177632359906591,"score_spread":0.23642554869695487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W213041943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89668,0.00094302505,0.06865992,0.0068811043,0.00015856596,0.0001241206,0.0021731225,0.00040865946,0.023971673],"genre_scores_gemma":[0.9814051,0.00060183275,0.011030692,0.00040361466,0.0002539017,0.000090282185,0.0013462022,0.00017889771,0.0046895305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659735,0.0009970368,0.00016722202,0.00068981,0.0008214301,0.00072712795],"domain_scores_gemma":[0.94973814,0.040387824,0.0033289155,0.0030416537,0.0010840003,0.0024194438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002182085,0.0009901064,0.002226928,0.0016000903,0.0023366606,0.0089684175,0.004737194,0.0035319773,0.012335269],"category_scores_gemma":[0.022469554,0.0012236084,0.0019070501,0.0032433632,0.005503381,0.014859922,0.0042068856,0.00500051,0.00079857925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018448363,0.00040151904,0.0108657,0.00071595435,0.00021753939,0.0005722352,0.0020005265,0.16669427,0.009130656,0.76375467,0.012560173,0.031241918],"study_design_scores_gemma":[0.000113618284,0.000042140076,0.0016777152,0.000027428814,0.000051189258,0.0001576256,0.00024013157,0.10444813,0.0013431887,0.89080405,0.0010576822,0.00003710255],"about_ca_topic_score_codex":0.0055119083,"about_ca_topic_score_gemma":0.004359256,"teacher_disagreement_score":0.012335269,"about_ca_system_score_codex":0.0045714052,"about_ca_system_score_gemma":0.0022530851,"threshold_uncertainty_score":0.041265607},"labels":[],"label_agreement":null},{"id":"W2130764977","doi":"10.1016/j.jctb.2007.11.003","title":"A weaker version of Lovász' path removal conjecture","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Graph; Existential quantification; Path (computing); Discrete mathematics; Computer science","score_opus":0.011137663498495029,"score_gpt":0.24954757915373396,"score_spread":0.23840991565523895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130764977","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23524025,0.0025743078,0.2122273,0.092519745,0.004536206,0.0003107268,0.0044618,0.0019821108,0.44614753],"genre_scores_gemma":[0.8685065,0.0020127401,0.035117354,0.02054475,0.004024649,0.0003148757,0.005329082,0.00064051646,0.06350951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938227,0.001121058,0.00029728038,0.0022272482,0.0015277121,0.001003996],"domain_scores_gemma":[0.97747463,0.013397251,0.0010228665,0.005391719,0.0018380578,0.0008754766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041396,0.0012699631,0.002981006,0.0019469747,0.0049039256,0.005736583,0.0053751958,0.0072371583,0.04278935],"category_scores_gemma":[0.022958986,0.0013608335,0.0032745358,0.0030188176,0.007045771,0.025709199,0.007836486,0.012245207,0.0069433386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003184953,0.00016358156,0.0011579758,0.00038506687,0.000072645176,0.00029379324,0.0005836773,0.0016793329,0.0017678943,0.949298,0.031646002,0.012633518],"study_design_scores_gemma":[0.000078417674,0.000027348815,0.00038538137,0.000028175386,0.000031405307,0.00025848742,0.00015036241,0.0029949385,0.00045185105,0.98549646,0.010074255,0.00002291954],"about_ca_topic_score_codex":0.0019812672,"about_ca_topic_score_gemma":0.0015641289,"teacher_disagreement_score":0.04278935,"about_ca_system_score_codex":0.0020420845,"about_ca_system_score_gemma":0.0016115913,"threshold_uncertainty_score":0.14314461},"labels":[],"label_agreement":null},{"id":"W2130919080","doi":"10.5555/545381.545431","title":"Polynomial time recognition of P4-structure","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Hypergraph; Combinatorics; Graph; Time complexity; Mathematics; Path (computing); Discrete mathematics; Computer science","score_opus":0.024670916748689205,"score_gpt":0.2517029734564466,"score_spread":0.2270320567077574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130919080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5380609,0.0007916505,0.40407932,0.0033626638,0.00018549312,0.00043746975,0.006379374,0.0103815,0.03632167],"genre_scores_gemma":[0.71900916,0.00027761882,0.25139046,0.00043771457,0.00009131351,0.00017178559,0.015737664,0.00058529124,0.012298953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986726,0.00014915352,0.00009862029,0.00056483597,0.00022517258,0.00028978157],"domain_scores_gemma":[0.99657696,0.0015290888,0.00037364304,0.0009677645,0.00035383203,0.00019873217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044915787,0.0007518621,0.00091855455,0.00058943656,0.001185189,0.002760866,0.0022087619,0.0015678521,0.01046922],"category_scores_gemma":[0.003988393,0.0006225049,0.0014825417,0.0014319699,0.0010180833,0.006465753,0.0021432175,0.0017197152,0.0032255657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033205338,0.0006595601,0.0138562955,0.0020083897,0.00029936334,0.0016856405,0.0019003096,0.069434874,0.115152836,0.23555616,0.08435199,0.4717741],"study_design_scores_gemma":[0.00033169473,0.00034275002,0.0041668187,0.00007332443,0.0001476585,0.001276013,0.0011108851,0.28549114,0.06811957,0.6098634,0.028968534,0.00010826525],"about_ca_topic_score_codex":0.003696841,"about_ca_topic_score_gemma":0.0042344416,"teacher_disagreement_score":0.01046922,"about_ca_system_score_codex":0.0016462369,"about_ca_system_score_gemma":0.0013493996,"threshold_uncertainty_score":0.035023034},"labels":[],"label_agreement":null},{"id":"W2131358503","doi":"10.1016/j.ic.2006.09.005","title":"Towards a dichotomy theorem for the counting constraint satisfaction problem","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Discrete mathematics; Counting problem; Homomorphism; Complexity of constraint satisfaction; Combinatorics; Time complexity; Class (philosophy); Constraint (computer-aided design); Constraint graph; Set (abstract data type); Constraint satisfaction dual problem; Constraint satisfaction; Local consistency; Computer science","score_opus":0.013618246427346062,"score_gpt":0.27892914844829203,"score_spread":0.265310902020946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131358503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05266651,0.0016356864,0.8016187,0.03392016,0.0010289212,0.00018081092,0.00088466995,0.00081314065,0.10725129],"genre_scores_gemma":[0.650587,0.0023842154,0.29181367,0.015785892,0.0041702,0.0010091225,0.0025852956,0.0008948838,0.030769618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994609,0.0017652626,0.00022207003,0.001130785,0.0015434169,0.00072944065],"domain_scores_gemma":[0.977019,0.01903363,0.0005684256,0.001344159,0.0012973112,0.0007375108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060974983,0.0011300601,0.0027381384,0.003144052,0.0038674616,0.008166187,0.0050026644,0.0050992835,0.014618913],"category_scores_gemma":[0.027027113,0.0012083742,0.0025843976,0.0039508357,0.0072388714,0.01845817,0.009088867,0.01744456,0.0018212821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052960924,0.00005362959,0.00017076703,0.00007373542,0.00001614176,0.00003599775,0.00012065656,0.0017841113,0.00032902398,0.9842934,0.0057480233,0.007321541],"study_design_scores_gemma":[0.000019017649,0.000007373025,0.000046899084,0.000015027206,0.0000064195615,0.000016886232,0.00002202447,0.0117965145,0.0001209131,0.9866506,0.0012919507,0.000006293223],"about_ca_topic_score_codex":0.0019505213,"about_ca_topic_score_gemma":0.001709836,"teacher_disagreement_score":0.014618913,"about_ca_system_score_codex":0.0039725266,"about_ca_system_score_gemma":0.0026221853,"threshold_uncertainty_score":0.048905075},"labels":[],"label_agreement":null},{"id":"W2131488553","doi":"10.1016/j.tcs.2010.12.044","title":"Local 7-coloring for planar subgraphs of unit disk graphs","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Planar graph; Unit disk graph; Mathematics; Vertex (graph theory); Complete coloring; Graph factorization; Edge coloring; Graph coloring; Fractional coloring; Graph; Discrete mathematics; Graph power; Computer science; Line graph","score_opus":0.017918212958136517,"score_gpt":0.2962133064616216,"score_spread":0.2782950935034851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131488553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82054096,0.00059059163,0.13496576,0.0010317768,0.00006686376,0.000110446155,0.0007445212,0.000988,0.040960975],"genre_scores_gemma":[0.94494,0.00041890203,0.03397842,0.0002663489,0.000103400984,0.00021411618,0.0016839824,0.00042775337,0.017967256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936694,0.00014841977,0.000027536707,0.00015636416,0.000117368276,0.00018336887],"domain_scores_gemma":[0.9970253,0.0012973336,0.00041570023,0.00042673966,0.0002808691,0.00055396464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005783463,0.00060544815,0.0010593851,0.0012405396,0.001970152,0.002490817,0.002214996,0.00086589355,0.01369776],"category_scores_gemma":[0.0024116084,0.0007402174,0.0008701415,0.0015437132,0.001565142,0.0027022657,0.0021734186,0.0016929955,0.0017893423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016813669,0.00055967184,0.006647634,0.00087063905,0.00012597919,0.0008086498,0.0020821735,0.041528028,0.029505001,0.83990395,0.01764002,0.058646902],"study_design_scores_gemma":[0.00027099403,0.00014623466,0.0037266356,0.00005447407,0.00013821077,0.0004891486,0.0009894609,0.08562375,0.010738833,0.89022076,0.0075387154,0.00006281393],"about_ca_topic_score_codex":0.0023931172,"about_ca_topic_score_gemma":0.004123097,"teacher_disagreement_score":0.01369776,"about_ca_system_score_codex":0.001715627,"about_ca_system_score_gemma":0.0008175802,"threshold_uncertainty_score":0.045823634},"labels":[],"label_agreement":null},{"id":"W2131690757","doi":"10.1016/j.disc.2006.04.037","title":"Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Steiner tree problem; Connectivity; Discrete mathematics; Path graph; Graph; Graph power; Line graph","score_opus":0.012587430546820573,"score_gpt":0.2672030840537653,"score_spread":0.2546156535069447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131690757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8405136,0.0012289956,0.101052016,0.001275006,0.00018671896,0.000042936594,0.00057892257,0.0001434152,0.05497834],"genre_scores_gemma":[0.97071886,0.00093295827,0.019378936,0.00014194088,0.00019965092,0.00006095807,0.0003827442,0.00003746653,0.00814662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994863,0.000115878414,0.00003553054,0.0001091726,0.0001668167,0.00008629965],"domain_scores_gemma":[0.99713695,0.0016412819,0.0005860056,0.00015031167,0.00018420276,0.0003011474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005961109,0.00045805107,0.00070886366,0.0023111503,0.0014486905,0.0023811948,0.0012696595,0.0008695824,0.005217598],"category_scores_gemma":[0.0035961866,0.00048487866,0.00043541822,0.0037103398,0.0023183145,0.0032193277,0.0011420725,0.0018374247,0.00038112365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009816918,0.000026142607,0.0010524379,0.000056542234,0.000010943048,0.000102979655,0.00030294174,0.0066356272,0.000876805,0.9806309,0.0010926833,0.009113792],"study_design_scores_gemma":[0.00003566177,0.000029635044,0.0012012569,0.000017164588,0.0000191506,0.00020222331,0.000263918,0.011342283,0.0005788689,0.9839595,0.0023365289,0.000013811114],"about_ca_topic_score_codex":0.0010357437,"about_ca_topic_score_gemma":0.0016344844,"teacher_disagreement_score":0.005217598,"about_ca_system_score_codex":0.0013194688,"about_ca_system_score_gemma":0.0004355299,"threshold_uncertainty_score":0.017454624},"labels":[],"label_agreement":null},{"id":"W2131850161","doi":"10.1007/978-3-319-15579-1_53","title":"Bounding Clique-Width via Perfect Graphs","year":2015,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Combinatorics; Mathematics; Treewidth; Split graph; Block graph; Cograph; Discrete mathematics; Clique-sum; Chordal graph; Bounding overwatch; Induced subgraph; Graph isomorphism; Induced subgraph isomorphism problem; Perfect graph; Pathwidth; Graph; Line graph; 1-planar graph; Computer science; Vertex (graph theory); Voltage graph","score_opus":0.031815726654958944,"score_gpt":0.3255480907228837,"score_spread":0.29373236406792474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131850161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18242654,0.00292847,0.75733894,0.006385319,0.00046940357,0.00020199668,0.0022622978,0.00246943,0.045517683],"genre_scores_gemma":[0.83328134,0.0017210292,0.15026475,0.0010062319,0.00086908054,0.0002989344,0.0015814414,0.0009554523,0.010021771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99423295,0.0015754168,0.00017063494,0.0017377513,0.0014188767,0.00086436677],"domain_scores_gemma":[0.9594777,0.031465232,0.0017586531,0.004247675,0.0011663851,0.0018842977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047098696,0.0020647114,0.0023284268,0.0027374197,0.0018149293,0.004870363,0.0060278485,0.0031296483,0.008935919],"category_scores_gemma":[0.044051442,0.002372694,0.0018539893,0.0033919187,0.0041104113,0.015319569,0.007480418,0.005541846,0.0012016292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009952973,0.00028288737,0.005361577,0.0008018219,0.00024460867,0.00022192734,0.0006282466,0.20250984,0.0075222077,0.695751,0.021590605,0.064089954],"study_design_scores_gemma":[0.000059381928,0.00004617178,0.0005854605,0.000050540024,0.000058109836,0.00010934849,0.00007626812,0.33153418,0.0018019632,0.66260636,0.0030490325,0.000023080374],"about_ca_topic_score_codex":0.0024855505,"about_ca_topic_score_gemma":0.003607245,"teacher_disagreement_score":0.008935919,"about_ca_system_score_codex":0.0028209384,"about_ca_system_score_gemma":0.0016493386,"threshold_uncertainty_score":0.029893637},"labels":[],"label_agreement":null},{"id":"W2132277994","doi":"10.2178/jsl/1245158092","title":"A geometric zero-one law","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Zero (linguistics); Substructure; Combinatorics; Disjoint sets; Bounded function; Ball (mathematics); Graph; Order (exchange); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.03829468688421236,"score_gpt":0.30721491616127056,"score_spread":0.2689202292770582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132277994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5485846,0.0011313308,0.32368645,0.00802755,0.00027430494,0.00011222266,0.000698159,0.000816201,0.1166692],"genre_scores_gemma":[0.9820405,0.00016730721,0.011810193,0.00053782336,0.00017493143,0.000058646903,0.0002637517,0.00007602135,0.004870766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957699,0.0008719322,0.00025831946,0.0013991552,0.0011965099,0.0005040916],"domain_scores_gemma":[0.9903971,0.004687193,0.001013649,0.0019212111,0.0013632335,0.0006175252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024347028,0.00040052267,0.0008978097,0.001985803,0.0020043058,0.0023873285,0.0013430932,0.001023002,0.006407815],"category_scores_gemma":[0.0113113,0.00038929403,0.0008604541,0.0009779031,0.010874857,0.008859037,0.003218344,0.0025161696,0.0007015781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023367349,0.000014801098,0.00083590683,0.000030354766,0.0000060184484,0.00006880515,0.00023358047,0.00060602603,0.00051396526,0.99224865,0.0007577685,0.0046607894],"study_design_scores_gemma":[0.000012902127,0.000035821544,0.00047568773,0.000014781193,0.000010414915,0.00018777866,0.00014922598,0.005240466,0.0006762586,0.9885932,0.004591892,0.000011529392],"about_ca_topic_score_codex":0.0013889769,"about_ca_topic_score_gemma":0.0007962468,"teacher_disagreement_score":0.006407815,"about_ca_system_score_codex":0.0019822887,"about_ca_system_score_gemma":0.00072135235,"threshold_uncertainty_score":0.021436334},"labels":[],"label_agreement":null},{"id":"W2132290920","doi":"10.1016/s0012-365x(99)00291-5","title":"Exponents of vertex-transitive digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Vertex (graph theory); Transitive relation; Conjecture; Exponent; Discrete mathematics; Abelian group; Integer (computer science); Order (exchange); Graph","score_opus":0.016401083506896945,"score_gpt":0.2788626426154422,"score_spread":0.26246155910854524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132290920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.817212,0.0013881411,0.07157736,0.0018023304,0.00059871055,0.00017894304,0.0013694162,0.000394239,0.10547887],"genre_scores_gemma":[0.968796,0.0010046491,0.009374506,0.00022287053,0.00038831925,0.00008715857,0.00065413024,0.00015108951,0.019321226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929214,0.00014542094,0.00007114846,0.00012755871,0.00020532629,0.00015839536],"domain_scores_gemma":[0.9945766,0.003162619,0.0005865133,0.00030512037,0.00042601323,0.00094319414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009195712,0.0009215385,0.0012153467,0.003546003,0.0018607235,0.004667222,0.0010079229,0.00076574495,0.01008621],"category_scores_gemma":[0.0057206675,0.0007894784,0.00066680496,0.001902735,0.0020059338,0.0058867726,0.0020537777,0.0023753084,0.0013235386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014865088,0.000046189765,0.0008839857,0.00009856401,0.000015089298,0.0005213141,0.000619848,0.00087683665,0.0019786607,0.9867426,0.001889851,0.006178316],"study_design_scores_gemma":[0.00009593757,0.00004585014,0.00090028794,0.00004804453,0.000027413376,0.00041111856,0.00033713473,0.0051440354,0.0011906761,0.9866367,0.005140242,0.000022647864],"about_ca_topic_score_codex":0.0005687437,"about_ca_topic_score_gemma":0.00089725864,"teacher_disagreement_score":0.01008621,"about_ca_system_score_codex":0.0012911409,"about_ca_system_score_gemma":0.0003987084,"threshold_uncertainty_score":0.033741713},"labels":[],"label_agreement":null},{"id":"W2132677029","doi":"10.1016/j.jctb.2008.03.006","title":"On the odd-minor variant of Hadwiger's conjecture","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Conjecture; Graph; Discrete mathematics","score_opus":0.016178644568518676,"score_gpt":0.25031874771390306,"score_spread":0.2341401031453844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132677029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5869464,0.0013894357,0.08940339,0.027429067,0.0032811596,0.00011347399,0.00090490887,0.0006789293,0.28985322],"genre_scores_gemma":[0.9690634,0.0003834602,0.00851631,0.0018421595,0.0010167863,0.0000556895,0.00046823153,0.000110327266,0.018543562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986444,0.00037677263,0.00005288546,0.0003038224,0.0002483096,0.00037385587],"domain_scores_gemma":[0.9961061,0.0018975693,0.00029610092,0.0008776887,0.00040150151,0.00042094896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020765106,0.00080113637,0.0016477447,0.0011438413,0.0032843626,0.0035015813,0.0021854131,0.0024572485,0.010069675],"category_scores_gemma":[0.0077714305,0.0004897096,0.0011914695,0.0013912393,0.005944092,0.007000951,0.003550371,0.0049551534,0.0014057403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013442682,0.000030403198,0.0004986015,0.00003073941,0.000008438848,0.00015233165,0.00020098459,0.0008934843,0.00038585675,0.9894174,0.00501352,0.0032337336],"study_design_scores_gemma":[0.000024349703,0.000007695785,0.00012612509,0.0000057179036,0.0000039249217,0.000049620838,0.000046729074,0.0018686417,0.000108865956,0.9963444,0.0014063991,0.0000074411632],"about_ca_topic_score_codex":0.0028938488,"about_ca_topic_score_gemma":0.0023115065,"teacher_disagreement_score":0.010069675,"about_ca_system_score_codex":0.001684472,"about_ca_system_score_gemma":0.001116898,"threshold_uncertainty_score":0.0336864},"labels":[],"label_agreement":null},{"id":"W2134206798","doi":"10.1016/j.ejc.2011.01.016","title":"On the asymptotic proportion of connected matroids","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Marsden Fund; Foundation for Research, Science and Technology","keywords":"Matroid; Mathematics; Combinatorics; Conjecture; Asymptotically optimal algorithm; Automorphism group; Discrete mathematics; Automorphism","score_opus":0.038056690377805034,"score_gpt":0.23923317974985886,"score_spread":0.20117648937205382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134206798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71619827,0.004987273,0.16546704,0.009822017,0.00048933696,0.00011470819,0.0021367753,0.0013652192,0.09941942],"genre_scores_gemma":[0.96135503,0.00276248,0.018014044,0.00093779276,0.0011041551,0.00026097693,0.0013913161,0.00082845165,0.013345627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546367,0.0017645938,0.00017324986,0.00087357097,0.0011855512,0.0005394388],"domain_scores_gemma":[0.92322665,0.061695497,0.0037644817,0.0044666296,0.003446437,0.0034003176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005179642,0.0009922888,0.0025815782,0.0050180345,0.002580266,0.0072990456,0.0047806143,0.0030849737,0.01949605],"category_scores_gemma":[0.07564776,0.001554914,0.0011442963,0.003694048,0.0053679636,0.011503442,0.005170019,0.0044419225,0.002245454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094185275,0.00020944368,0.012776727,0.0005507838,0.00015309044,0.00033095834,0.00096032204,0.03687952,0.0068718395,0.89217037,0.013520192,0.034634896],"study_design_scores_gemma":[0.0001076981,0.00010201028,0.0048719877,0.00016207986,0.00012227605,0.0012378591,0.00041252252,0.17142183,0.0028774226,0.8128333,0.005784106,0.0000668964],"about_ca_topic_score_codex":0.0011276895,"about_ca_topic_score_gemma":0.0010570191,"teacher_disagreement_score":0.01949605,"about_ca_system_score_codex":0.0030406641,"about_ca_system_score_gemma":0.00095754885,"threshold_uncertainty_score":0.06522077},"labels":[],"label_agreement":null},{"id":"W2134453562","doi":"10.1016/j.jctb.2019.07.001","title":"On Frank's conjecture on k-connected orientations","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Conjecture; Combinatorics; Vertex (graph theory); Orientation (vector space); Graph; Mathematics; Strongly connected component; Discrete mathematics; Geometry","score_opus":0.013716950753505304,"score_gpt":0.2898674251964509,"score_spread":0.2761504744429456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134453562","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.525112,0.0022368254,0.06271986,0.03285051,0.0023246321,0.00014259925,0.002715819,0.0010244362,0.37087336],"genre_scores_gemma":[0.9473996,0.0013554075,0.01504486,0.0027684153,0.0010925147,0.00010976848,0.001616646,0.0001982938,0.03041441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870884,0.00020531568,0.000064256434,0.00041630128,0.00023882018,0.00036646568],"domain_scores_gemma":[0.9962997,0.0022086625,0.00026616754,0.00047321376,0.00039280704,0.0003595869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014022026,0.0010228242,0.0018702673,0.0025111244,0.0039855926,0.005006342,0.0021340826,0.003873243,0.019839413],"category_scores_gemma":[0.0071620224,0.0010493717,0.0013662298,0.0030266622,0.0058763647,0.013185865,0.0039270422,0.0053589405,0.0026228738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017171369,0.000054405642,0.0008017948,0.000098986675,0.000011633625,0.00015995145,0.0004478155,0.0012739114,0.00043958827,0.97913367,0.0099578025,0.0074487734],"study_design_scores_gemma":[0.00003487736,0.000014113086,0.00041358906,0.000033936183,0.000015105536,0.00015382012,0.00033409067,0.002267175,0.0003021453,0.98999804,0.0064134495,0.000019624018],"about_ca_topic_score_codex":0.0038093587,"about_ca_topic_score_gemma":0.0032240301,"teacher_disagreement_score":0.019839413,"about_ca_system_score_codex":0.0021595305,"about_ca_system_score_gemma":0.00087372016,"threshold_uncertainty_score":0.066369414},"labels":[],"label_agreement":null},{"id":"W2135081210","doi":"10.1016/s0095-8956(02)00023-0","title":"Bounds for mean colour numbers of graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Counterexample; Graph; Discrete mathematics; Split graph; Vertex (graph theory); Chordal graph; 1-planar graph","score_opus":0.014415090368387347,"score_gpt":0.2835429309123682,"score_spread":0.26912784054398087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135081210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2880812,0.0131384,0.55539787,0.015164257,0.0016007588,0.00021812762,0.0019794602,0.0027617526,0.121658124],"genre_scores_gemma":[0.8501913,0.006436295,0.11422934,0.0023408937,0.002895808,0.0007433338,0.001267195,0.0018168961,0.020078983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995613,0.001132348,0.00017266978,0.0011777397,0.0010701361,0.0008339734],"domain_scores_gemma":[0.91274595,0.06917462,0.0032118312,0.006553191,0.0036284956,0.0046859146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071479953,0.0026027088,0.0031699375,0.008015322,0.0036691574,0.009546645,0.0076243626,0.0038527711,0.013041636],"category_scores_gemma":[0.060056657,0.002395485,0.002519433,0.004893837,0.007900838,0.0155537855,0.0066145877,0.011213209,0.0020221956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007357644,0.00018352599,0.0032437248,0.0006214931,0.00013964636,0.000113436676,0.0009924415,0.028208463,0.007730606,0.91295624,0.014162402,0.03091232],"study_design_scores_gemma":[0.00003559291,0.000044653814,0.0015139955,0.00011686906,0.00008195223,0.00014144974,0.00010580798,0.046043478,0.0017214464,0.9465664,0.003561722,0.00006654618],"about_ca_topic_score_codex":0.001722331,"about_ca_topic_score_gemma":0.0034763059,"teacher_disagreement_score":0.013041636,"about_ca_system_score_codex":0.0077096643,"about_ca_system_score_gemma":0.0017225024,"threshold_uncertainty_score":0.055937827},"labels":[],"label_agreement":null},{"id":"W2135166946","doi":"10.1016/j.dam.2012.03.036","title":"Collective additive tree spanners for circle graphs and polygonal graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Tree (set theory); Spanning tree; Discrete mathematics","score_opus":0.021324002429040537,"score_gpt":0.28290842068083727,"score_spread":0.26158441825179674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135166946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7767086,0.00030422054,0.18915837,0.0004135766,0.0001661071,0.000055816097,0.00017123843,0.0002651017,0.032756995],"genre_scores_gemma":[0.96072084,0.00031499524,0.023623519,0.00009447929,0.00012174183,0.00009804019,0.00026012713,0.000077319484,0.014688824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996939,0.0000545153,0.000017637767,0.00007769704,0.00009006751,0.00006621298],"domain_scores_gemma":[0.9987685,0.00040339943,0.00024922256,0.00018600072,0.00012230467,0.0002705946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029540458,0.00038397658,0.00061999966,0.0012591725,0.0013201206,0.0016623385,0.00089174166,0.0009067528,0.0063306703],"category_scores_gemma":[0.0016489123,0.00030259407,0.0005398317,0.0010507721,0.0010057229,0.0020535209,0.0016031777,0.0009780485,0.00058122986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006777546,0.00005343282,0.0007695457,0.000074142474,0.000024327066,0.0002493323,0.00048582035,0.013592833,0.0052826963,0.9623103,0.0015165035,0.015573265],"study_design_scores_gemma":[0.000019184583,0.00005605244,0.0007641755,0.00001743268,0.000029498857,0.00023468853,0.0004064639,0.048803072,0.0024815085,0.9432202,0.0039505633,0.000017148408],"about_ca_topic_score_codex":0.00034892495,"about_ca_topic_score_gemma":0.00076142844,"teacher_disagreement_score":0.0063306703,"about_ca_system_score_codex":0.00035238807,"about_ca_system_score_gemma":0.00025183137,"threshold_uncertainty_score":0.021178186},"labels":[],"label_agreement":null},{"id":"W2136175864","doi":"10.1007/s00493-015-3070-6","title":"Nonrepetitive colouring via entropy compression","year":2015,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Mathematical proof; Discrete mathematics; Geometry","score_opus":0.031856152558521776,"score_gpt":0.29475177600056146,"score_spread":0.2628956234420397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136175864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09637106,0.00049728283,0.85454005,0.00111792,0.0002984968,0.00015927404,0.00044909952,0.0021865198,0.0443802],"genre_scores_gemma":[0.724861,0.00043343092,0.2455568,0.0006540627,0.00036012995,0.00021862701,0.0006753229,0.0009987518,0.026241735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847764,0.0004337244,0.000069410096,0.00031643698,0.00049204094,0.00021069721],"domain_scores_gemma":[0.9931666,0.0035257917,0.00024966485,0.0024641228,0.00038668167,0.00020712042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096517365,0.0006934918,0.0009933482,0.0014343618,0.0011639157,0.0016859326,0.0020559065,0.0014549702,0.010642354],"category_scores_gemma":[0.0069289193,0.0005980389,0.00079730636,0.0018418332,0.0022821417,0.003987113,0.003347465,0.0024004346,0.0018457349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031459265,0.000173073,0.0005078246,0.00018626532,0.000043451142,0.00027195687,0.0003555109,0.055794373,0.012241101,0.75232536,0.0084017515,0.16938485],"study_design_scores_gemma":[0.000029315002,0.000034252513,0.00016330303,0.00002811217,0.000021722137,0.00012934138,0.00003248296,0.16810407,0.0064864643,0.8213948,0.0035522373,0.000023909372],"about_ca_topic_score_codex":0.00068063673,"about_ca_topic_score_gemma":0.0013187672,"teacher_disagreement_score":0.010642354,"about_ca_system_score_codex":0.0010004129,"about_ca_system_score_gemma":0.00087745703,"threshold_uncertainty_score":0.035602212},"labels":[],"label_agreement":null},{"id":"W2136721967","doi":"10.1002/rsa.20648","title":"Justifying the small‐world phenomenon via random recursive trees","year":2016,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Monash University","keywords":"Logarithm; Random graph; Combinatorics; Upper and lower bounds; Mathematical proof; Mathematics; Simple (philosophy); Computer science; Graph; Discrete mathematics","score_opus":0.025615070192616458,"score_gpt":0.28638147534731206,"score_spread":0.2607664051546956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136721967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056974433,0.001232681,0.92162615,0.0016479323,0.00009729456,0.000055321794,0.00016874423,0.0004161209,0.01778132],"genre_scores_gemma":[0.89614683,0.0013515207,0.09522354,0.00074198254,0.00034533307,0.00023456808,0.0002079744,0.00039951084,0.0053487383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716264,0.0012388987,0.00009540505,0.00053153216,0.00067615934,0.00029525766],"domain_scores_gemma":[0.9378428,0.051666033,0.0030148672,0.004134782,0.0017201606,0.0016213193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00483688,0.0011124744,0.0012558803,0.0024429811,0.0013520619,0.003332335,0.002687781,0.0018644513,0.00557991],"category_scores_gemma":[0.04131841,0.0008595187,0.0014820887,0.001220376,0.0050821416,0.010499549,0.0050492794,0.005355876,0.0007637831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003199765,0.000024168487,0.0009004551,0.00007880792,0.000020712461,0.00016390994,0.00021064225,0.036194075,0.0015894524,0.95429206,0.001417227,0.005076519],"study_design_scores_gemma":[0.000011117841,0.000021786283,0.00030417775,0.000027139235,0.000014090812,0.00013408356,0.000046889258,0.26267338,0.0010506549,0.7330321,0.002664705,0.000020002879],"about_ca_topic_score_codex":0.0013353957,"about_ca_topic_score_gemma":0.0013703267,"teacher_disagreement_score":0.00557991,"about_ca_system_score_codex":0.0022055306,"about_ca_system_score_gemma":0.00074708584,"threshold_uncertainty_score":0.025580227},"labels":[],"label_agreement":null},{"id":"W2136941318","doi":"10.1016/j.disc.2015.09.021","title":"On Hilbert bases of cuts","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Subdivision; Semigroup; Discrete mathematics; Graph","score_opus":0.05055297230452935,"score_gpt":0.32561556219233206,"score_spread":0.27506258988780274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136941318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26381478,0.0028127255,0.39631838,0.005818989,0.0011576249,0.000112543676,0.0011810291,0.0005633359,0.32822058],"genre_scores_gemma":[0.8712982,0.0014737345,0.05412206,0.0012518961,0.00090111524,0.00014413169,0.0011595823,0.00047031452,0.069178954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989759,0.00027643988,0.000036710328,0.00020935904,0.000292906,0.0002086799],"domain_scores_gemma":[0.9984428,0.0006492664,0.00016865559,0.00016679008,0.0002726173,0.00029987676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011146878,0.0012299429,0.0011584361,0.0028194338,0.0019064967,0.0041934713,0.0017674733,0.0014467012,0.016023614],"category_scores_gemma":[0.003477819,0.00081661047,0.0010349414,0.0024486121,0.004041372,0.006822966,0.003597759,0.005729511,0.0019167417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001565372,0.000006830685,0.00003958143,0.000009733233,0.0000036512683,0.000010982051,0.000063966756,0.0003438137,0.00015204909,0.9969105,0.00059601536,0.0018473376],"study_design_scores_gemma":[0.000007334698,0.000004562612,0.00004538853,0.0000047209633,0.0000023651114,0.000011586139,0.000037800044,0.0011595597,0.00006035922,0.9975823,0.0010803824,0.0000036377146],"about_ca_topic_score_codex":0.0020682367,"about_ca_topic_score_gemma":0.0018833957,"teacher_disagreement_score":0.016023614,"about_ca_system_score_codex":0.0022276996,"about_ca_system_score_gemma":0.00070591667,"threshold_uncertainty_score":0.053604305},"labels":[],"label_agreement":null},{"id":"W2137217287","doi":"10.37236/1588","title":"Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Plane (geometry); Graph; Spectrum (functional analysis); Colored; Face (sociological concept); Complete coloring; Fractional coloring; Discrete mathematics; Graph power; Physics; Geometry; Line graph","score_opus":0.01033061752458155,"score_gpt":0.26003673892479384,"score_spread":0.24970612140021228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137217287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582565,0.0002519368,0.02409688,0.00030109668,0.000020141271,0.000029230267,0.0005178306,0.00022938145,0.0162971],"genre_scores_gemma":[0.9885212,0.00019065347,0.009003798,0.000072038616,0.000022394746,0.00006660393,0.0005156613,0.0000645356,0.0015430743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993007,0.00008143151,0.000029952665,0.0001429627,0.00017376164,0.000271206],"domain_scores_gemma":[0.99843675,0.0006535199,0.0002830859,0.00018191613,0.00015944004,0.00028530476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043223638,0.0005404323,0.0005675347,0.0018981689,0.0014913327,0.0025241252,0.0009022554,0.0007164348,0.0056317844],"category_scores_gemma":[0.0024290748,0.00048278345,0.0003978913,0.0015193904,0.0014831588,0.0020302131,0.0013710173,0.00090392336,0.0005257675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015609419,0.00036744602,0.013102267,0.00022028736,0.000080767764,0.0010329823,0.0021552588,0.06803866,0.04386243,0.8086613,0.011752432,0.049165245],"study_design_scores_gemma":[0.00019938704,0.00018306298,0.009417188,0.0000872654,0.000060795002,0.0012448068,0.0015769198,0.19601831,0.012413008,0.7677577,0.010955445,0.000086147775],"about_ca_topic_score_codex":0.004305328,"about_ca_topic_score_gemma":0.0030842682,"teacher_disagreement_score":0.0056317844,"about_ca_system_score_codex":0.0015852607,"about_ca_system_score_gemma":0.00069308176,"threshold_uncertainty_score":0.018840134},"labels":[],"label_agreement":null},{"id":"W2137430154","doi":"10.1016/j.disc.2008.03.021","title":"Edge-switching homomorphisms of edge-coloured graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Homomorphism; Vertex (graph theory); Isomorphism (crystallography); Discrete mathematics; Homomorphic encryption; Graph; Graph homomorphism; Corollary; Graph isomorphism; Line graph; Voltage graph; Computer science","score_opus":0.03286005786231506,"score_gpt":0.2848804775606165,"score_spread":0.25202041969830147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137430154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7903577,0.00034519588,0.16873115,0.0005236374,0.00031708705,0.00011059766,0.0003435872,0.0008547922,0.03841627],"genre_scores_gemma":[0.96304274,0.0003016463,0.024460968,0.00024365127,0.00015739532,0.00008999292,0.0003032084,0.00019323229,0.011207114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890053,0.0002493668,0.000062520194,0.00032175842,0.00020948685,0.00025634182],"domain_scores_gemma":[0.996403,0.0016923202,0.0003965997,0.0005061905,0.00030234738,0.0006996513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010481967,0.0005091383,0.0005336473,0.0018666099,0.0014417843,0.0024914665,0.001434818,0.0009977763,0.005154256],"category_scores_gemma":[0.0036188406,0.0006217293,0.00095717306,0.0013710232,0.0022279222,0.0036752843,0.0019401376,0.0024800133,0.0005409048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023107426,0.00014638876,0.0011763654,0.00006533351,0.000026815194,0.00036847274,0.0012455509,0.0024689646,0.009407474,0.9640008,0.0011228373,0.019739848],"study_design_scores_gemma":[0.000050458057,0.000065569344,0.0010945256,0.000016128532,0.00003384429,0.0003383398,0.0003018834,0.008778479,0.0045909737,0.9814471,0.0032516248,0.00003114548],"about_ca_topic_score_codex":0.0008197727,"about_ca_topic_score_gemma":0.00067013013,"teacher_disagreement_score":0.005154256,"about_ca_system_score_codex":0.00097194506,"about_ca_system_score_gemma":0.00055513374,"threshold_uncertainty_score":0.01724267},"labels":[],"label_agreement":null},{"id":"W2137804648","doi":"10.1287/ijoc.2013.0589","title":"Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem","year":2014,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro","keywords":"Dominating set; Connected dominating set; Cardinality (data modeling); Algorithm; Mathematics; Branch and cut; Set (abstract data type); Branch and bound; Benders' decomposition; Strongly connected component; Graph; Mathematical optimization; Combinatorics; Computer science; Integer programming; Minimum spanning tree; Vertex (graph theory)","score_opus":0.02272631946703941,"score_gpt":0.3144781079620658,"score_spread":0.2917517884950264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137804648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013411933,0.0011439219,0.97806907,0.00038195925,0.00008168019,0.00017734437,0.00024663168,0.00080629997,0.005681242],"genre_scores_gemma":[0.09495296,0.0007584892,0.89904755,0.00018832633,0.00009396362,0.00043905625,0.000817766,0.00024443676,0.0034575067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983985,0.00059207744,0.00008278608,0.00030511737,0.00047122783,0.00015029083],"domain_scores_gemma":[0.9976801,0.0013602378,0.0002094535,0.00038699343,0.00023068425,0.00013248369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020520643,0.002276688,0.0015505737,0.0018358339,0.00091633725,0.001776734,0.0025727858,0.0019290413,0.0039200895],"category_scores_gemma":[0.0058625364,0.0009903357,0.0012292273,0.003941756,0.000949015,0.0037687994,0.0019674534,0.0027401638,0.0010914161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027951616,0.0003818801,0.0007414028,0.00037567108,0.00012779744,0.00008445082,0.0001836074,0.633697,0.002492825,0.07360381,0.009426702,0.27860537],"study_design_scores_gemma":[0.00008964175,0.00011089607,0.00021781916,0.000033588705,0.000034918667,0.000096741045,0.00003779939,0.92334837,0.0014056048,0.06979767,0.004804391,0.000022579248],"about_ca_topic_score_codex":0.0023977675,"about_ca_topic_score_gemma":0.0032857256,"teacher_disagreement_score":0.0039200895,"about_ca_system_score_codex":0.0016698304,"about_ca_system_score_gemma":0.0017993598,"threshold_uncertainty_score":0.0131139755},"labels":[],"label_agreement":null},{"id":"W2137906639","doi":"10.1016/s0012-365x(99)00251-4","title":"Extremal graphs for inequalities involving domination parameters","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Domination analysis; Characterization (materials science); Upper and lower bounds; Discrete mathematics; Graph; Extremal combinatorics; Inequality; Chordal graph","score_opus":0.04637501544429559,"score_gpt":0.31262080457621927,"score_spread":0.26624578913192365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137906639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24254745,0.004229422,0.57524425,0.0082407,0.00063179684,0.0001772485,0.001204497,0.0004403145,0.1672843],"genre_scores_gemma":[0.9236846,0.0020822568,0.050769456,0.0013086252,0.0012064984,0.00034278087,0.00079379056,0.00037516974,0.01943684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971284,0.0011167771,0.000117644806,0.00061943545,0.00057308684,0.00044467332],"domain_scores_gemma":[0.977693,0.01747227,0.0017816499,0.0011349723,0.00082325866,0.00109469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039184513,0.0018142124,0.002121834,0.0045559322,0.0026594526,0.0057632844,0.004737457,0.0034918215,0.014388454],"category_scores_gemma":[0.023510657,0.0014313468,0.0014271424,0.0039396374,0.004576913,0.012949098,0.0041391836,0.0096057495,0.00088636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050081762,0.000021213053,0.00020537595,0.000068608875,0.000017176773,0.00004715891,0.000115621515,0.002771551,0.00047139058,0.9919757,0.0012754771,0.0029805747],"study_design_scores_gemma":[0.000008821061,0.0000056460062,0.00017691101,0.000020849773,0.000011809311,0.00004824436,0.000041991727,0.0114723975,0.00015677753,0.9872214,0.0008244822,0.000010628658],"about_ca_topic_score_codex":0.001003795,"about_ca_topic_score_gemma":0.0013837215,"teacher_disagreement_score":0.014388454,"about_ca_system_score_codex":0.0032237372,"about_ca_system_score_gemma":0.00073443115,"threshold_uncertainty_score":0.048134148},"labels":[],"label_agreement":null},{"id":"W2137962531","doi":"10.1016/j.disc.2013.05.012","title":"A lower bound for the chromatic capacity in terms of the chromatic number of a graph","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Combinatorics; Mathematics; Monochromatic color; Chromatic scale; Conjecture; Graph; Wheel graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Upper and lower bounds; Graph power; Physics; Line graph; Computer science; Optics; Mathematical analysis","score_opus":0.03284534236989184,"score_gpt":0.29258533012331056,"score_spread":0.2597399877534187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137962531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12676825,0.016687775,0.62518084,0.017195698,0.0017808052,0.0003026752,0.007594411,0.0027741129,0.20171548],"genre_scores_gemma":[0.8226574,0.009998327,0.119535126,0.0030425927,0.0038359924,0.0011368168,0.0040233415,0.0018547144,0.0339158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952756,0.0009811819,0.00017460033,0.0011522095,0.0012545175,0.0011617658],"domain_scores_gemma":[0.9557603,0.034683693,0.0011501192,0.004164185,0.0021286414,0.002113054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003566167,0.0037419489,0.0031056348,0.007880102,0.0031657172,0.0077731404,0.007972419,0.0040308293,0.029618565],"category_scores_gemma":[0.026944261,0.0015288811,0.0020974781,0.009225513,0.005899299,0.015141134,0.0062272297,0.008683437,0.0040740576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065162056,0.00028733045,0.0017993511,0.0011897335,0.00026168596,0.00029176482,0.00053745223,0.13073467,0.016900584,0.7635438,0.036791872,0.047010135],"study_design_scores_gemma":[0.00005719125,0.00010908362,0.0016120323,0.0003872593,0.00019399746,0.0004078142,0.00015422874,0.29148027,0.0055199233,0.6821926,0.017697955,0.00018764508],"about_ca_topic_score_codex":0.004752089,"about_ca_topic_score_gemma":0.006163101,"teacher_disagreement_score":0.029618565,"about_ca_system_score_codex":0.0065829204,"about_ca_system_score_gemma":0.0029991984,"threshold_uncertainty_score":0.09908396},"labels":[],"label_agreement":null},{"id":"W2138177131","doi":"10.1016/j.dam.2009.03.014","title":"On well-covered triangulations: Part II","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Saint Mary's University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02209633187996251,"score_gpt":0.2915288947650704,"score_spread":0.26943256288510786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138177131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27137607,0.021602662,0.4559497,0.007640447,0.0025507144,0.00037165338,0.0023170868,0.00036614662,0.23782551],"genre_scores_gemma":[0.77751154,0.023189718,0.09518559,0.0020536042,0.0039333953,0.0005038973,0.0034119259,0.0007663122,0.09344396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877053,0.0003059833,0.00007473086,0.00024327578,0.00040224925,0.00020327672],"domain_scores_gemma":[0.9972625,0.0013893106,0.00039270511,0.00033191327,0.0003363104,0.00028729494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011177799,0.0014237623,0.0012590812,0.0039035548,0.001495125,0.0027660734,0.0019653572,0.0019319472,0.014416178],"category_scores_gemma":[0.005971714,0.0010883885,0.0016737578,0.003835037,0.003482529,0.0063974406,0.0047890726,0.0045791753,0.0022896337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077390934,0.00004743481,0.0008080726,0.00039448735,0.000039183662,0.00023534652,0.0006180532,0.0072958837,0.0024092325,0.9513777,0.008742757,0.027954541],"study_design_scores_gemma":[0.000015487169,0.000044599114,0.00096341985,0.000111172616,0.000025989882,0.00031546454,0.0003057619,0.011211671,0.0005879018,0.9740229,0.012372066,0.000023583763],"about_ca_topic_score_codex":0.001687104,"about_ca_topic_score_gemma":0.0013763221,"teacher_disagreement_score":0.014416178,"about_ca_system_score_codex":0.0014207906,"about_ca_system_score_gemma":0.00051089743,"threshold_uncertainty_score":0.048226953},"labels":[],"label_agreement":null},{"id":"W2138481685","doi":"10.1016/s0095-8956(02)00010-2","title":"Disjoint cocircuits in matroids with large rank","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Disjoint sets; Rank (graph theory); Mathematics; Integer (computer science); Discrete mathematics; Graphic matroid; Class (philosophy); Minor (academic); Computer science; Artificial intelligence","score_opus":0.008969961233094159,"score_gpt":0.2537563941132656,"score_spread":0.24478643288017146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138481685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8566274,0.0011329863,0.09980573,0.0019682567,0.00018789637,0.000119117976,0.00067447935,0.00072479586,0.038759362],"genre_scores_gemma":[0.95350415,0.00051278836,0.029586246,0.00036239022,0.00023133727,0.00011971647,0.0005450913,0.0002154919,0.014922795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989121,0.0003165146,0.00006684265,0.00019701253,0.0002961827,0.00021140714],"domain_scores_gemma":[0.9901661,0.0057640644,0.0015708382,0.0005977279,0.0006288043,0.0012724991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086701394,0.00077736744,0.0013232442,0.0024477653,0.0021754547,0.004538093,0.0018226148,0.0021191007,0.009307696],"category_scores_gemma":[0.007363434,0.0012635605,0.0006958353,0.002297796,0.0023556554,0.00486298,0.002226499,0.0022574316,0.0010554342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037494386,0.0001291605,0.0015592148,0.00019031262,0.00003807774,0.00048344367,0.00050705136,0.00846838,0.0045029754,0.96247756,0.0060122325,0.015256566],"study_design_scores_gemma":[0.00012553547,0.00009058655,0.0007108851,0.000041763764,0.000048897804,0.0006647352,0.0003898577,0.045948066,0.00246522,0.9455884,0.0038931225,0.00003292883],"about_ca_topic_score_codex":0.0013808307,"about_ca_topic_score_gemma":0.0025700966,"teacher_disagreement_score":0.009307696,"about_ca_system_score_codex":0.0011972185,"about_ca_system_score_gemma":0.0005476627,"threshold_uncertainty_score":0.031137288},"labels":[],"label_agreement":null},{"id":"W2139210144","doi":"10.1090/tran/7408","title":"Yes, the “missing axiom” of matroid theory is lost forever","year":2018,"lang":"lv","type":"preprint","venue":"Transactions of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Axiom; Conjecture; Sentence; Mathematics; Combinatorics; Order (exchange); Field (mathematics); Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence; Geometry; Economics","score_opus":0.02685597101923055,"score_gpt":0.3135298488909901,"score_spread":0.2866738778717596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139210144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021258742,0.004156742,0.6078167,0.1379384,0.014186958,0.00011484664,0.0029751803,0.0054187356,0.20613374],"genre_scores_gemma":[0.5456511,0.0043761325,0.2373066,0.05527718,0.0066047143,0.00046673,0.0053439387,0.0058249193,0.1391488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459237,0.0012702328,0.00038746675,0.0019344925,0.0011824797,0.0006329303],"domain_scores_gemma":[0.9899525,0.0035590276,0.0005378857,0.0026803801,0.0027595127,0.00051069475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059636375,0.0015442792,0.0019323619,0.0010133291,0.004269493,0.0056856186,0.0029133388,0.003527206,0.029406657],"category_scores_gemma":[0.018893957,0.0011811925,0.0033820742,0.0009888475,0.009504733,0.03133718,0.0056410395,0.011528155,0.014046189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016575833,0.000047903122,0.000524217,0.00033032862,0.00007891664,0.00033306025,0.0008383385,0.00035873405,0.0014121447,0.92042065,0.057957616,0.017532362],"study_design_scores_gemma":[0.00003487826,0.000041982392,0.00033570174,0.000121420315,0.00008251634,0.00037149512,0.0005123373,0.0014637631,0.0026463778,0.9073692,0.08696597,0.00005450903],"about_ca_topic_score_codex":0.0038225255,"about_ca_topic_score_gemma":0.0036657508,"teacher_disagreement_score":0.029406657,"about_ca_system_score_codex":0.002682136,"about_ca_system_score_gemma":0.0019014213,"threshold_uncertainty_score":0.09837508},"labels":[],"label_agreement":null},{"id":"W2139277171","doi":"10.1016/j.disc.2008.02.023","title":"On the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si66.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-orientability of random graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Scroll; Combinatorics; Discrete mathematics; Algorithm; Theology; Philosophy","score_opus":0.022976516589453093,"score_gpt":0.2663674007408643,"score_spread":0.2433908841514112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139277171","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030830032,0.0008875053,0.15112396,0.008058176,0.003624041,0.00038557962,0.17536986,0.051936578,0.6055313],"genre_scores_gemma":[0.027866615,0.0032326626,0.0789208,0.0031972474,0.0017811798,0.0006623858,0.20273823,0.04230827,0.63929254],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999401,0.00009049065,0.000042433032,0.00008619178,0.00032535667,0.000054519394],"domain_scores_gemma":[0.99835867,0.0007433965,0.000092018796,0.0003208193,0.00035995702,0.0001251378],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00052973593,0.0011747719,0.0010802555,0.00271347,0.0008314058,0.0037673158,0.0018176585,0.0012169726,0.5677579],"category_scores_gemma":[0.003892034,0.00074067287,0.0010802622,0.004827158,0.0006667392,0.004039635,0.002274996,0.002025608,0.30171347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045860386,0.000028320885,0.000113250484,0.00017980358,0.000006731227,0.00006731988,0.00009591234,0.0006812333,0.0010394217,0.044667855,0.91524583,0.037828464],"study_design_scores_gemma":[0.000046969984,0.000012082912,0.000894996,0.00011018916,0.0000060766843,0.00013121363,0.00006278102,0.00278513,0.0021084691,0.061902523,0.93190145,0.00003822028],"about_ca_topic_score_codex":0.006989937,"about_ca_topic_score_gemma":0.010361264,"teacher_disagreement_score":0.5677579,"about_ca_system_score_codex":0.001569572,"about_ca_system_score_gemma":0.0008499074,"threshold_uncertainty_score":0.6165409},"labels":[],"label_agreement":null},{"id":"W2139924054","doi":"10.1016/j.dam.2004.12.001","title":"Balanced vertex-orderings of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Discrete mathematics; Degree (music); Graph","score_opus":0.013829799812163146,"score_gpt":0.27034252288300126,"score_spread":0.2565127230708381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139924054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7516237,0.0016059855,0.14891334,0.0019909632,0.0003275723,0.0001849252,0.003186132,0.00057311176,0.09159433],"genre_scores_gemma":[0.89781415,0.0017716627,0.06309373,0.0005238224,0.00030324695,0.00023218842,0.0040773274,0.00030641406,0.031877477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888986,0.000280622,0.00009579687,0.0001896847,0.00030264043,0.00024141556],"domain_scores_gemma":[0.99456525,0.0022006077,0.00086856075,0.0005554676,0.00084370864,0.0009663674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001068575,0.0008647969,0.00081319496,0.0036235165,0.0019968941,0.005013644,0.0012518729,0.0012163144,0.00837785],"category_scores_gemma":[0.005410199,0.00082812645,0.00051990687,0.0036021257,0.0014814888,0.0047296057,0.0010810096,0.0015507672,0.0012221333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027216872,0.00008494047,0.0015953738,0.000113891845,0.000021474181,0.00018745313,0.00047856607,0.003398996,0.005438886,0.96006685,0.0038844359,0.024456948],"study_design_scores_gemma":[0.00004707038,0.000030785577,0.00073284603,0.000030944702,0.000015577685,0.00012842269,0.00021124915,0.0062577124,0.0011231413,0.98589236,0.005517429,0.000012418324],"about_ca_topic_score_codex":0.0020378772,"about_ca_topic_score_gemma":0.003969505,"teacher_disagreement_score":0.00837785,"about_ca_system_score_codex":0.0018455785,"about_ca_system_score_gemma":0.0009922392,"threshold_uncertainty_score":0.0280267},"labels":[],"label_agreement":null},{"id":"W2139927980","doi":"10.1007/978-3-7643-7400-6_17","title":"A Characterization of the 1-well-covered Graphs with no 4-cycles","year":2006,"lang":"en","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Independent set; Vertex (graph theory); Graph; Maximal independent set; Discrete mathematics; Split graph; Chordal graph; 1-planar graph","score_opus":0.014069193197861127,"score_gpt":0.21920160478688713,"score_spread":0.205132411589026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139927980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.669386,0.004636577,0.25101328,0.0015936728,0.00015194633,0.00021265697,0.0027511695,0.00039767023,0.06985693],"genre_scores_gemma":[0.89291704,0.0033107474,0.08237403,0.0005961593,0.0002900886,0.00024659917,0.0033696226,0.00019835596,0.016697418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994692,0.0000858197,0.000026257107,0.00017617592,0.00014745916,0.000095026095],"domain_scores_gemma":[0.998367,0.000756784,0.00031999574,0.00017686884,0.0002172965,0.0001619366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003157143,0.00066269713,0.00058872916,0.0024957187,0.0008709274,0.0016013538,0.0008312034,0.0007935098,0.003473002],"category_scores_gemma":[0.0016874743,0.00059176225,0.00067243935,0.0016040518,0.0012609113,0.0035098987,0.0010099895,0.0011464729,0.000619216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002453389,0.00009851932,0.004908613,0.0004595159,0.000093691495,0.001006659,0.0010975495,0.03723427,0.023512907,0.83679926,0.009233796,0.08530993],"study_design_scores_gemma":[0.000024343304,0.00011979246,0.005195572,0.00013705462,0.00008054176,0.0020060039,0.00043798587,0.06699594,0.008755358,0.88269657,0.03348178,0.0000690361],"about_ca_topic_score_codex":0.0008461242,"about_ca_topic_score_gemma":0.00087807927,"teacher_disagreement_score":0.003473002,"about_ca_system_score_codex":0.0007894024,"about_ca_system_score_gemma":0.00043280039,"threshold_uncertainty_score":0.011618376},"labels":[],"label_agreement":null},{"id":"W2140541505","doi":"10.1287/opre.2013.1247","title":"Integral Simplex Using Decomposition for the Set Partitioning Problem","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Simplex; Sequence (biology); Simplex algorithm; Mathematics; Polytope; Constructive; Mathematical optimization; Degeneracy (biology); Integer (computer science); Set (abstract data type); Revised simplex method; Decomposition; Combinatorics; Variable (mathematics); Integer programming; Algorithm; Linear programming; Computer science","score_opus":0.1774074885190413,"score_gpt":0.48514672057562436,"score_spread":0.30773923205658305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140541505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010301496,0.00035539022,0.978434,0.0001375762,0.000041877018,0.00009055413,0.00009379635,0.0001618708,0.010383405],"genre_scores_gemma":[0.13560082,0.0009026351,0.8575357,0.00009635354,0.00006640527,0.00037466077,0.00041936178,0.00021474637,0.0047893645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990113,0.0003203586,0.000036723046,0.00010977432,0.00040679864,0.000115048104],"domain_scores_gemma":[0.9992749,0.00041727122,0.000054272397,0.00009424175,0.000106615575,0.00005264462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009977729,0.0009865481,0.0010818787,0.0011252922,0.0006112948,0.0014079979,0.0011582705,0.00083436124,0.005306846],"category_scores_gemma":[0.003106903,0.0004838442,0.0011082613,0.0019342271,0.0009668345,0.001634651,0.0017024485,0.0026393523,0.0012862441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015519797,0.00016466157,0.00046956865,0.0003230713,0.000059629652,0.00013287934,0.00019755441,0.51834625,0.006098879,0.2997125,0.005973475,0.16836628],"study_design_scores_gemma":[0.000026539394,0.00005271087,0.00011313655,0.000033303317,0.000016926931,0.00010398017,0.000035611374,0.8835615,0.0020342045,0.10654139,0.0074661914,0.00001451152],"about_ca_topic_score_codex":0.0018573154,"about_ca_topic_score_gemma":0.001974197,"teacher_disagreement_score":0.005306846,"about_ca_system_score_codex":0.0009621786,"about_ca_system_score_gemma":0.0011894725,"threshold_uncertainty_score":0.017753124},"labels":[],"label_agreement":null},{"id":"W2141942969","doi":"10.1016/s0166-218x(03)00371-8","title":"Partitioning chordal graphs into independent sets and cliques","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Split graph; Discrete mathematics; Indifference graph; Maximal independent set; Interval graph; Cograph; Pathwidth; Disjoint sets; Clique-sum; 1-planar graph; Graph; Line graph","score_opus":0.017726078083042853,"score_gpt":0.2947188118428381,"score_spread":0.2769927337597953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141942969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35741466,0.0015314819,0.6051566,0.00092442875,0.00018455763,0.00068875257,0.0017589792,0.0005845278,0.031755976],"genre_scores_gemma":[0.66384673,0.0008662466,0.3212363,0.00020521448,0.00018548423,0.00021597919,0.0025052282,0.00028216292,0.010656723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896264,0.00018413005,0.000059072318,0.00035327493,0.00023063258,0.00021018187],"domain_scores_gemma":[0.99618053,0.0017412915,0.00033104702,0.00087435805,0.00048094967,0.00039177955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056781934,0.00062736444,0.0010972797,0.0017904778,0.0015734822,0.002582116,0.0025231685,0.0009910658,0.00559503],"category_scores_gemma":[0.0046941037,0.0007833943,0.0010214609,0.0026665118,0.0014913732,0.0037407365,0.0021469267,0.0015189723,0.0009552553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002229963,0.00062695105,0.011140823,0.0014591166,0.00031518226,0.00051655754,0.0021232977,0.13090618,0.050061435,0.51981556,0.0152459005,0.2655591],"study_design_scores_gemma":[0.00031924815,0.0002750947,0.0064128237,0.000116437666,0.00024937137,0.00059606787,0.0017290897,0.225414,0.014468397,0.725387,0.024956163,0.000076309705],"about_ca_topic_score_codex":0.0026367402,"about_ca_topic_score_gemma":0.004678031,"teacher_disagreement_score":0.00559503,"about_ca_system_score_codex":0.0011553653,"about_ca_system_score_gemma":0.0010103914,"threshold_uncertainty_score":0.01871723},"labels":[],"label_agreement":null},{"id":"W2142143427","doi":"10.1016/j.disc.2015.09.027","title":"Uniqueness and minimal obstructions for tree-depth","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Discrete mathematics; Graph; Uniqueness","score_opus":0.06581150215029835,"score_gpt":0.3367363074743629,"score_spread":0.27092480532406454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142143427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47077537,0.0023440365,0.365635,0.0075447634,0.00065197225,0.00017408573,0.00094143033,0.0010448177,0.15088856],"genre_scores_gemma":[0.9343551,0.0008368713,0.036484994,0.0008880812,0.0004997165,0.00018711288,0.0005555952,0.00055624626,0.02563647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980672,0.00035748119,0.00012469402,0.00048230102,0.0004982032,0.0004701588],"domain_scores_gemma":[0.9936272,0.003644618,0.0005056756,0.00065898936,0.0005243247,0.0010391382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018872415,0.0008559639,0.0019966622,0.0032193947,0.0047055488,0.0050274264,0.0026011658,0.0031330602,0.011601489],"category_scores_gemma":[0.010207277,0.0015201321,0.0024696365,0.0023474356,0.0061369403,0.014913268,0.009477325,0.008316793,0.0011223316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031300977,0.000019412213,0.00022185147,0.00003900142,0.000008039592,0.000045069883,0.00027643956,0.0004444413,0.00034775716,0.9959013,0.0007497477,0.0019155697],"study_design_scores_gemma":[0.000012850344,0.000007385211,0.00013974903,0.000011096701,0.000012818802,0.00006782368,0.000096178985,0.001598011,0.00022809302,0.9964629,0.0013507145,0.000012455504],"about_ca_topic_score_codex":0.0010626869,"about_ca_topic_score_gemma":0.0013563276,"teacher_disagreement_score":0.011601489,"about_ca_system_score_codex":0.0017902572,"about_ca_system_score_gemma":0.0010891006,"threshold_uncertainty_score":0.03881079},"labels":[],"label_agreement":null},{"id":"W2143613789","doi":"10.7155/jgaa.00123","title":"A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Upper and lower bounds; Computer science; Combinatorics; Mathematics","score_opus":0.030894195947069204,"score_gpt":0.2672424313698322,"score_spread":0.236348235422763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143613789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026614415,0.1459105,0.683308,0.0044290028,0.0010373775,0.00024873827,0.0015093402,0.0012786525,0.13566402],"genre_scores_gemma":[0.19519995,0.20543693,0.5636091,0.0020322267,0.0019911758,0.00041097798,0.0045426,0.000825737,0.025951259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987375,0.00016901166,0.00011941266,0.00038912072,0.00047559655,0.00010934767],"domain_scores_gemma":[0.997841,0.0012225031,0.000179816,0.00031778464,0.00034261416,0.00009628446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012739822,0.0009883073,0.0009850623,0.0043119355,0.001725607,0.0041733724,0.0016003684,0.0011185069,0.0066794963],"category_scores_gemma":[0.004332006,0.00086217024,0.0012394714,0.008866309,0.0018847235,0.010661983,0.0015743559,0.0026966443,0.0023523567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006343827,0.00010663283,0.0015800615,0.0018968062,0.00004982238,0.0001300805,0.00037104383,0.009327987,0.002387581,0.60536575,0.01998582,0.35873497],"study_design_scores_gemma":[0.0000086379805,0.00005139514,0.0012200469,0.0004567664,0.000044450633,0.001170485,0.0002446128,0.014443496,0.0021581429,0.7932501,0.18688463,0.00006708684],"about_ca_topic_score_codex":0.0020362448,"about_ca_topic_score_gemma":0.0026259106,"teacher_disagreement_score":0.0066794963,"about_ca_system_score_codex":0.0022157098,"about_ca_system_score_gemma":0.0016422239,"threshold_uncertainty_score":0.022345185},"labels":[],"label_agreement":null},{"id":"W2143618826","doi":"10.5555/2634074.2634097","title":"Arboricity and spanning-tree packing in random graphs with an application to load balancing","year":2014,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Arboricity; Combinatorics; Mathematics; Random graph; Graph; Disjoint sets; Spanning tree; Degree (music); Minimum spanning tree; Discrete mathematics; Planar graph; Physics","score_opus":0.007603731631552604,"score_gpt":0.2650003601434302,"score_spread":0.2573966285118776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143618826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40755782,0.002628694,0.5737762,0.0030596459,0.000119334,0.0001461956,0.00020238776,0.00044720023,0.0120625235],"genre_scores_gemma":[0.9600911,0.0012448161,0.03484376,0.00028890197,0.00028718455,0.00016655399,0.00013601598,0.000112369176,0.0028292462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983991,0.0007778598,0.00006349963,0.00026972045,0.0002747919,0.00021500155],"domain_scores_gemma":[0.97543347,0.018183522,0.0032151043,0.0011673534,0.0007624942,0.0012380694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029903399,0.0010735573,0.0011213324,0.002939524,0.0013001543,0.0020196221,0.0017912528,0.0018033526,0.0023264738],"category_scores_gemma":[0.021251924,0.0007412791,0.0009710857,0.0023322061,0.0037826588,0.0039395383,0.0025234672,0.0019543457,0.00029443874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003331056,0.00016689027,0.0046875803,0.00025620914,0.00009372773,0.0006993275,0.000571352,0.29236978,0.009658431,0.669312,0.003083783,0.01876777],"study_design_scores_gemma":[0.000035352627,0.00009760446,0.0008399888,0.000034322893,0.000028426035,0.00032641948,0.00009255204,0.7465931,0.0018835684,0.2488431,0.0011964813,0.000029123436],"about_ca_topic_score_codex":0.00087461143,"about_ca_topic_score_gemma":0.00079669204,"teacher_disagreement_score":0.0029903399,"about_ca_system_score_codex":0.0017198544,"about_ca_system_score_gemma":0.0005115911,"threshold_uncertainty_score":0.015814602},"labels":[],"label_agreement":null},{"id":"W2143633463","doi":"10.1007/s10878-014-9712-6","title":"Zero-visibility cops and robber and the pathwidth of a graph","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Memorial University of Newfoundland","funders":"Narodowe Centrum Nauki","keywords":"Bounded function; Monotonic function; Visibility; Theory of computation; Pathwidth; Mathematics; Zero (linguistics); Discrete mathematics; Visibility graph; Graph; Combinatorics; Line graph; Algorithm; Mathematical analysis; Physics","score_opus":0.006789592392098764,"score_gpt":0.24293138834825068,"score_spread":0.23614179595615192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143633463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7234905,0.004219768,0.21925296,0.005356306,0.00026437614,0.00011098846,0.0010830493,0.0003821228,0.045839936],"genre_scores_gemma":[0.9523639,0.0023462265,0.034672577,0.0004638952,0.00037860652,0.0001404247,0.000549625,0.00022356198,0.008861207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985454,0.00051214965,0.000061386956,0.00030455226,0.00027924243,0.00029718742],"domain_scores_gemma":[0.978228,0.016426224,0.0023324997,0.0009097608,0.00073405687,0.0013694129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020023372,0.0011891592,0.0019795143,0.0031309293,0.0018430752,0.003816914,0.003818613,0.002372701,0.010280439],"category_scores_gemma":[0.02088752,0.0016267512,0.0010832141,0.0026815326,0.0044498155,0.010975141,0.0027923803,0.0029561426,0.00067971105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004811454,0.00020719378,0.0042644707,0.0003903177,0.00015046596,0.0003668887,0.00087651884,0.07313732,0.0027890147,0.88340414,0.008680193,0.025252365],"study_design_scores_gemma":[0.0000627383,0.00006122333,0.0013990412,0.00009172305,0.000053706935,0.00031618105,0.0003418173,0.10763963,0.00072523556,0.8864123,0.0028603259,0.000036078873],"about_ca_topic_score_codex":0.0026995903,"about_ca_topic_score_gemma":0.0022739072,"teacher_disagreement_score":0.010280439,"about_ca_system_score_codex":0.0014059787,"about_ca_system_score_gemma":0.0010538012,"threshold_uncertainty_score":0.034391463},"labels":[],"label_agreement":null},{"id":"W2143684958","doi":"10.1142/s0218196706003116","title":"TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Hungarian Scientific Research Fund","keywords":"Mathematics; Constraint satisfaction problem; Polynomial; Algebra over a field; Complexity of constraint satisfaction; Pure mathematics; Discrete mathematics; Local consistency; Mathematical analysis","score_opus":0.025828535238264255,"score_gpt":0.3013269032063554,"score_spread":0.27549836796809113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143684958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6381417,0.00083931064,0.33488673,0.007994781,0.000078804704,0.00023493833,0.00094613765,0.00040563673,0.016471954],"genre_scores_gemma":[0.9367484,0.0005902495,0.056847207,0.00032297152,0.0002145631,0.00015167444,0.0011110998,0.00008179491,0.0039321324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695396,0.0008351006,0.00018132458,0.00052697374,0.0008581278,0.0006444996],"domain_scores_gemma":[0.943981,0.049224447,0.00278896,0.001978515,0.0011095426,0.0009175367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033198032,0.0006035279,0.0014647843,0.001373658,0.0020028967,0.0046106684,0.0025308246,0.0017865628,0.0076192664],"category_scores_gemma":[0.028102446,0.00054892537,0.0018880113,0.0024928795,0.0043154685,0.015090746,0.0030125855,0.0055086524,0.0004862028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003615867,0.00034744316,0.0062974608,0.0004073625,0.0001175954,0.000308159,0.0010548239,0.09504974,0.003435334,0.8648851,0.0032945962,0.024440793],"study_design_scores_gemma":[0.000044828223,0.00002979643,0.0005788991,0.000014137878,0.000027851625,0.000065098466,0.00018140493,0.13505849,0.0013526214,0.861886,0.00073967915,0.000021171536],"about_ca_topic_score_codex":0.0033101612,"about_ca_topic_score_gemma":0.0033893066,"teacher_disagreement_score":0.0076192664,"about_ca_system_score_codex":0.0029429263,"about_ca_system_score_gemma":0.0023204265,"threshold_uncertainty_score":0.025488973},"labels":[],"label_agreement":null},{"id":"W2143708942","doi":"10.1007/978-3-642-32512-0_2","title":"Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Pathwidth; Combinatorics; Partial k-tree; Computer science; Chordal graph; Conjecture; Graph; Discrete mathematics; Mathematics; Line graph","score_opus":0.048832930724603034,"score_gpt":0.2910973016065226,"score_spread":0.24226437088191954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143708942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32138214,0.01583114,0.50657517,0.020621797,0.0010613227,0.00037869954,0.0028155355,0.0029925907,0.12834167],"genre_scores_gemma":[0.6997689,0.009446172,0.21742633,0.0024188033,0.0027698136,0.0006312236,0.0033049393,0.0013577959,0.06287605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996506,0.00093931286,0.00014059016,0.00087662745,0.0008734584,0.0006640468],"domain_scores_gemma":[0.9774869,0.01853336,0.0010984851,0.0015200248,0.00066136057,0.0006997922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029378906,0.0029253769,0.0036967797,0.0016364355,0.002925804,0.007771673,0.007729034,0.0053497856,0.016489033],"category_scores_gemma":[0.018106567,0.0023983254,0.0032817023,0.004694623,0.0041710366,0.01634166,0.0035304152,0.009899961,0.0023772449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012478562,0.0013062079,0.0017102383,0.002107213,0.00029774904,0.0006003226,0.0010138337,0.2053403,0.0077768355,0.557093,0.053175382,0.16833095],"study_design_scores_gemma":[0.00018876634,0.00013064728,0.00031115275,0.00008836422,0.00010862125,0.00035655263,0.00021494603,0.12968272,0.0017986968,0.86321074,0.0038661351,0.00004255682],"about_ca_topic_score_codex":0.0033526325,"about_ca_topic_score_gemma":0.0039410694,"teacher_disagreement_score":0.016489033,"about_ca_system_score_codex":0.00390008,"about_ca_system_score_gemma":0.0026931162,"threshold_uncertainty_score":0.055161297},"labels":[],"label_agreement":null},{"id":"W2143815444","doi":"10.1016/j.jctb.2006.10.001","title":"Paths with two blocks in n-chromatic digraphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Computer science; Mathematics; Combinatorics","score_opus":0.006015535670932735,"score_gpt":0.24470165430450055,"score_spread":0.2386861186335678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143815444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75321996,0.0004426522,0.09335651,0.0012584932,0.00023105106,0.00045064892,0.0026476334,0.0006517241,0.14774123],"genre_scores_gemma":[0.8309686,0.000586813,0.07835879,0.00043057505,0.00005170388,0.00043783514,0.0024523954,0.00025096905,0.08646235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994235,0.00011806863,0.000033273293,0.0001354402,0.00011323568,0.00017657978],"domain_scores_gemma":[0.997692,0.00097341504,0.00025089696,0.0002281101,0.0002207386,0.0006348228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039051674,0.00065436383,0.00067779724,0.0014847661,0.0031487648,0.003075203,0.0014630021,0.0015915092,0.020587739],"category_scores_gemma":[0.0019204088,0.0011261775,0.00058234384,0.0020120705,0.001315473,0.0030704674,0.0018710884,0.0018379163,0.0028679466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007800443,0.00037540577,0.0030952909,0.00037225385,0.000089009074,0.0011550917,0.0013780252,0.012849276,0.014125262,0.9286232,0.011971743,0.025185416],"study_design_scores_gemma":[0.0004121808,0.00020022521,0.0041543655,0.00018054235,0.0001782852,0.00081058353,0.0015054174,0.05222367,0.007160849,0.8872546,0.045827445,0.00009176276],"about_ca_topic_score_codex":0.0072202533,"about_ca_topic_score_gemma":0.016873613,"teacher_disagreement_score":0.020587739,"about_ca_system_score_codex":0.0019266694,"about_ca_system_score_gemma":0.0013494766,"threshold_uncertainty_score":0.06887287},"labels":[],"label_agreement":null},{"id":"W2144127039","doi":"10.1109/sfcs.1991.185452","title":"Computing planar intertwines","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Simon Fraser University","funders":"","keywords":"Intersection (aeronautics); Minor (academic); Conjecture; Combinatorics; Planar graph; Mathematics; Discrete mathematics; Planar; Graph; Intersection graph; Computer science; Engineering; Philosophy; Humanities; Line graph; Computer graphics (images)","score_opus":0.04210041474169429,"score_gpt":0.2934132126686162,"score_spread":0.2513127979269219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144127039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6154405,0.000533234,0.33644724,0.0009753188,0.00011879577,0.00014551733,0.0019116479,0.0032631785,0.041164618],"genre_scores_gemma":[0.9128728,0.00034059142,0.072739825,0.0001899823,0.000093290364,0.000118139775,0.003911534,0.00071890285,0.0090150405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805033,0.00025659232,0.0001027496,0.0005987967,0.00063252257,0.00035899132],"domain_scores_gemma":[0.99455726,0.002443666,0.0006230998,0.0013536512,0.0006432888,0.00037892666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073420757,0.00073766505,0.0011322594,0.002997756,0.0017656208,0.002313019,0.0014742258,0.0012574508,0.010450036],"category_scores_gemma":[0.009812448,0.00082406343,0.0012039188,0.0023747017,0.0025055837,0.0057919235,0.005840725,0.0022141647,0.0018497504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006134335,0.0002529266,0.012039292,0.00055874453,0.00013726551,0.0012621306,0.0030615611,0.060651433,0.011370166,0.7525607,0.014565429,0.14292692],"study_design_scores_gemma":[0.000029094599,0.00006063876,0.0015443012,0.000040205574,0.000044046228,0.00027529342,0.00047958526,0.0700961,0.005086975,0.90576506,0.016542144,0.000036481775],"about_ca_topic_score_codex":0.0018392052,"about_ca_topic_score_gemma":0.0026258382,"teacher_disagreement_score":0.010450036,"about_ca_system_score_codex":0.0015161537,"about_ca_system_score_gemma":0.00064008054,"threshold_uncertainty_score":0.03495884},"labels":[],"label_agreement":null},{"id":"W2144502170","doi":"10.1109/ismvl.2012.44","title":"Greedy Algorithms, Ordering of Variables, and d-degenerate Instances","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Degenerate energy levels; Greedy algorithm; Generalization; Class (philosophy); Mathematics; Bounded function; Heuristic; Discrete mathematics; Combinatorics; Algorithm; Computer science; Mathematical optimization; Mathematical analysis; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.03010241248630393,"score_gpt":0.28491601536143774,"score_spread":0.2548136028751338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144502170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7221205,0.0015036861,0.26387203,0.0014840926,0.00011588781,0.0002313546,0.00064153346,0.0009493039,0.009081585],"genre_scores_gemma":[0.87127346,0.00035278226,0.12599675,0.00039811793,0.00004325073,0.0001449349,0.00060273975,0.00009934722,0.0010885781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960289,0.0015244863,0.00024103448,0.0005652442,0.0009585043,0.0006817769],"domain_scores_gemma":[0.98284507,0.012722033,0.0013724893,0.0018700872,0.00061643653,0.0005739355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005336608,0.00082564255,0.0014036032,0.0015971322,0.001066764,0.0014657316,0.0025277548,0.001718793,0.0016942887],"category_scores_gemma":[0.022495696,0.00070673955,0.00093073276,0.0031503832,0.002057207,0.003457635,0.0018412742,0.0018925366,0.00014669528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011094821,0.00071119255,0.012976499,0.00030513466,0.00015293005,0.00028673033,0.00023183697,0.74167717,0.0036074133,0.16000749,0.004239061,0.074695125],"study_design_scores_gemma":[0.00016901983,0.00011638362,0.0006331118,0.000019276556,0.000028370367,0.00012921289,0.00008176313,0.8921538,0.0017568327,0.104305625,0.00058883824,0.000017867063],"about_ca_topic_score_codex":0.0033971209,"about_ca_topic_score_gemma":0.0043754266,"teacher_disagreement_score":0.005336608,"about_ca_system_score_codex":0.0026764597,"about_ca_system_score_gemma":0.0023013481,"threshold_uncertainty_score":0.028223038},"labels":[],"label_agreement":null},{"id":"W2144674749","doi":"10.1142/s0218195906002038","title":"BOUNDARY-OPTIMAL TRIANGULATION FLOODING","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Triangulation; Mathematics; Boundary (topology); Combinatorics; Point set triangulation; Flooding (psychology); Pitteway triangulation; Geometry; Discrete mathematics; Delaunay triangulation; Mathematical analysis","score_opus":0.013541345117598781,"score_gpt":0.3188351588273645,"score_spread":0.3052938137097657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144674749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1618617,0.0009129228,0.8068577,0.0012422168,0.00016922131,0.00024424173,0.00076335046,0.0026468395,0.02530188],"genre_scores_gemma":[0.572863,0.00043521696,0.41675305,0.0002607329,0.0000841098,0.00024318638,0.0012794811,0.00052996265,0.0075512584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991665,0.00018239857,0.000048625032,0.00019332122,0.00022724866,0.00018194773],"domain_scores_gemma":[0.9968918,0.0015627624,0.00033182788,0.0006828408,0.00030988426,0.0002209093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008329334,0.000683674,0.0011633665,0.0006976414,0.0010138815,0.0009540238,0.0016888406,0.0017080625,0.0057292846],"category_scores_gemma":[0.0104470095,0.00067408325,0.0006942178,0.00086662447,0.0012459364,0.0030384937,0.0035042511,0.0010031144,0.0009097054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007454085,0.000095064606,0.0017494246,0.00061746256,0.0000839291,0.00043343788,0.00063103734,0.69475317,0.023363734,0.1144062,0.018147537,0.14497364],"study_design_scores_gemma":[0.00017689132,0.0001284348,0.00043406434,0.00004737707,0.000032966702,0.00022467975,0.00019929284,0.84585655,0.0052601574,0.14200255,0.005606149,0.000030914758],"about_ca_topic_score_codex":0.0035406323,"about_ca_topic_score_gemma":0.00341725,"teacher_disagreement_score":0.0057292846,"about_ca_system_score_codex":0.0011532601,"about_ca_system_score_gemma":0.0010249497,"threshold_uncertainty_score":0.01916635},"labels":[],"label_agreement":null},{"id":"W2144688537","doi":"10.1016/s0012-365x(03)00236-x","title":"Channel assignment on graphs of bounded treewidth","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Treewidth; Mathematics; Partial k-tree; Bipartite graph; Discrete mathematics; Vertex (graph theory); Bounded function; Chordal graph; Clique-sum; 1-planar graph; Pathwidth; Graph; Line graph","score_opus":0.032515523825681424,"score_gpt":0.29640658569259887,"score_spread":0.26389106186691746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144688537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3563684,0.0006706502,0.6089427,0.0024630106,0.00022811405,0.000137396,0.0006824983,0.0015350649,0.028972179],"genre_scores_gemma":[0.8994015,0.0007487142,0.08361334,0.0004989988,0.00023063172,0.00023089825,0.00055791787,0.0005702222,0.01414785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998489,0.0004246889,0.000052970707,0.0002735425,0.00025429868,0.00050551584],"domain_scores_gemma":[0.9854702,0.00970597,0.00092020084,0.0015056662,0.0010157424,0.0013822936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001346338,0.00069749216,0.0013192055,0.0014186497,0.0025722452,0.0035849682,0.0021778843,0.0013745675,0.008293873],"category_scores_gemma":[0.009387059,0.00079635874,0.00058819435,0.002336088,0.0021413716,0.008046966,0.0030440572,0.0022193538,0.00092533947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005137933,0.00014631824,0.0006059236,0.00018574328,0.000021822725,0.00015208422,0.00045552466,0.037792675,0.0046121255,0.923559,0.007103702,0.024851346],"study_design_scores_gemma":[0.00006706019,0.00003533557,0.00019482036,0.000029343764,0.000028914383,0.00008021447,0.0001620091,0.098480284,0.0020066618,0.8961161,0.0027740197,0.00002517171],"about_ca_topic_score_codex":0.0020603803,"about_ca_topic_score_gemma":0.0025387928,"teacher_disagreement_score":0.008293873,"about_ca_system_score_codex":0.0018989996,"about_ca_system_score_gemma":0.0017599586,"threshold_uncertainty_score":0.027745724},"labels":[],"label_agreement":null},{"id":"W2145071923","doi":"10.1016/j.dam.2004.06.015","title":"2-Tree probe interval graphs have a large obstruction set","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Interval graph; Partition (number theory); Interval (graph theory); Chordal graph; Discrete mathematics; Generalization; Indifference graph; Tree (set theory); Graph; 1-planar graph","score_opus":0.02324670617443626,"score_gpt":0.29506065678066845,"score_spread":0.2718139506062322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145071923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71377605,0.0006035701,0.20631997,0.0025412848,0.00017026781,0.00016992813,0.0015858215,0.0017729779,0.07306006],"genre_scores_gemma":[0.95208776,0.00032174628,0.03558125,0.00037407782,0.0000987299,0.00021948935,0.0012454703,0.0003772835,0.009694175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991007,0.00015856905,0.000034052384,0.0001812937,0.0002974057,0.00022797169],"domain_scores_gemma":[0.99320555,0.003549051,0.0006900757,0.00097281835,0.00043887852,0.0011436135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007250002,0.0006476939,0.0017968392,0.0020931521,0.0023792305,0.0036684792,0.001649359,0.0022870088,0.011273857],"category_scores_gemma":[0.006177964,0.0009798169,0.001127949,0.0022565115,0.0022553317,0.005256442,0.0032253023,0.003668205,0.0014547256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037186145,0.00016201405,0.0017703326,0.00014544897,0.00003375238,0.00034825804,0.00049290183,0.008574443,0.0096108,0.958471,0.005572955,0.014446333],"study_design_scores_gemma":[0.00009008035,0.00010645485,0.0022883588,0.00003222072,0.000053394717,0.0005889649,0.00047315593,0.055073094,0.004465189,0.92996305,0.0068233907,0.00004268385],"about_ca_topic_score_codex":0.000471015,"about_ca_topic_score_gemma":0.0006664822,"teacher_disagreement_score":0.011273857,"about_ca_system_score_codex":0.0009269132,"about_ca_system_score_gemma":0.0005755899,"threshold_uncertainty_score":0.03771484},"labels":[],"label_agreement":null},{"id":"W2145113707","doi":"","title":"Embeddings of Small Graphs on the Torus","year":2003,"lang":"en","type":"article","venue":"CUBO, A Mathematical Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Automorphism; Graph; Discrete mathematics","score_opus":0.047169008951088054,"score_gpt":0.30526053907590583,"score_spread":0.2580915301248178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145113707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7558595,0.0016321619,0.12630337,0.0006334342,0.00056946534,0.0001219177,0.00044696318,0.0009541567,0.113478966],"genre_scores_gemma":[0.94965976,0.0007433068,0.027845327,0.00009088735,0.00013590408,0.00007495437,0.00040342577,0.00014328427,0.020903269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985194,0.000035460384,0.000009869632,0.000034404144,0.00003679217,0.0000314656],"domain_scores_gemma":[0.99979764,0.000046756893,0.00005015426,0.00003323585,0.000029451176,0.000042766656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008610824,0.0005108677,0.00025699835,0.00076222053,0.00065633777,0.0011810799,0.0003025064,0.00035026224,0.00540966],"category_scores_gemma":[0.0005161461,0.00020271752,0.00032215228,0.0004930555,0.0008870837,0.0016924484,0.0008957206,0.00055634545,0.00079202914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021250022,0.00005621006,0.0008937759,0.00020604696,0.000020156729,0.0008248338,0.00089647947,0.01838026,0.017807493,0.900163,0.0059097437,0.054629486],"study_design_scores_gemma":[0.00003004374,0.00017149151,0.001132129,0.000050960654,0.000026772192,0.0009377895,0.0009943112,0.05033185,0.0051087104,0.9045575,0.036630783,0.000027658249],"about_ca_topic_score_codex":0.00052260055,"about_ca_topic_score_gemma":0.00067854696,"teacher_disagreement_score":0.00540966,"about_ca_system_score_codex":0.00050635665,"about_ca_system_score_gemma":0.00018296925,"threshold_uncertainty_score":0.018097103},"labels":[],"label_agreement":null},{"id":"W2145668739","doi":"10.1016/s1571-0653(05)80175-1","title":"Simpler Projective Plane Embedding","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Projective plane; Antipodal point; Real projective plane; Mathematics; Line at infinity; Blocking set; Embedding; Pencil (optics); Projective space; Fano plane; Projective test; Combinatorics; Planar; Planar graph; Discrete mathematics; Homography; Graph; Collineation; Pure mathematics; Geometry; Computer science; Artificial intelligence; Physics; Optics; Computer graphics (images)","score_opus":0.016085028562191128,"score_gpt":0.3185427643036872,"score_spread":0.3024577357414961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145668739","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33254296,0.0011269404,0.11315624,0.004263888,0.001256457,0.00011765789,0.0010533723,0.0008991232,0.54558337],"genre_scores_gemma":[0.85185,0.00077119004,0.022263467,0.0008867832,0.00055402674,0.00007456955,0.00100666,0.0004221867,0.12217105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946517,0.00008746601,0.00002218936,0.0001686931,0.00014283956,0.00011369303],"domain_scores_gemma":[0.9996699,0.0000627381,0.000043818643,0.00008643536,0.000054679047,0.00008232718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024999314,0.00092244596,0.0007324315,0.0012515748,0.0014622117,0.0025140988,0.0009639201,0.001072483,0.027599417],"category_scores_gemma":[0.00079246133,0.0005002064,0.0006329474,0.0009896561,0.0013824597,0.004962796,0.0028109069,0.003703,0.0038934592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005958329,0.00003901141,0.00011399559,0.00004505989,0.000010503723,0.00010682589,0.00017537623,0.00053076766,0.0018230819,0.9841987,0.0044306233,0.00846635],"study_design_scores_gemma":[0.000033417826,0.00004733523,0.00066254404,0.000013295367,0.00003121932,0.00037920932,0.00020235898,0.003995099,0.0016323143,0.9675637,0.025415573,0.00002394908],"about_ca_topic_score_codex":0.00077415654,"about_ca_topic_score_gemma":0.0008490009,"teacher_disagreement_score":0.027599417,"about_ca_system_score_codex":0.000718105,"about_ca_system_score_gemma":0.00025508497,"threshold_uncertainty_score":0.09232926},"labels":[],"label_agreement":null},{"id":"W2146690815","doi":"10.1016/s0166-218x(99)00185-7","title":"The complexity of irredundant sets parameterized by size","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Combinatorics; Mathematics; Vertex (graph theory); Computational complexity theory; Graph; Discrete mathematics; Feedback vertex set; Clique; Parametric statistics; Algorithm","score_opus":0.03386305702276592,"score_gpt":0.2975807947117375,"score_spread":0.26371773768897155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146690815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8108715,0.0019500456,0.12745371,0.010050906,0.00021444875,0.00012923908,0.0026772104,0.0011914024,0.045461573],"genre_scores_gemma":[0.97493297,0.0008535083,0.01636239,0.00037688712,0.00039657464,0.00015520758,0.0009775192,0.0005058157,0.005439108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945733,0.0012614023,0.00026472847,0.0011683316,0.001742062,0.0009902375],"domain_scores_gemma":[0.91232395,0.06990938,0.0051919227,0.007396013,0.00189783,0.003280872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035483676,0.0011419246,0.002515026,0.0023138511,0.0022020661,0.011330318,0.005557836,0.0033151568,0.012545032],"category_scores_gemma":[0.042429116,0.0018048107,0.002071563,0.0035585219,0.0050996756,0.025244243,0.0039511523,0.0053453953,0.0010422519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011222244,0.00025952936,0.0076168273,0.00040572433,0.00015423074,0.00032174966,0.0010768268,0.101888455,0.009175621,0.8436405,0.009525207,0.024813091],"study_design_scores_gemma":[0.000074849864,0.000053666263,0.0016460071,0.00003115779,0.00005537351,0.00029722252,0.00019278156,0.12809733,0.0023557297,0.8654803,0.0016650674,0.00005050829],"about_ca_topic_score_codex":0.0015868222,"about_ca_topic_score_gemma":0.0017157666,"teacher_disagreement_score":0.012545032,"about_ca_system_score_codex":0.0045176195,"about_ca_system_score_gemma":0.0022876184,"threshold_uncertainty_score":0.041967273},"labels":[],"label_agreement":null},{"id":"W2146959334","doi":"10.1016/j.ejc.2007.11.012","title":"A dichotomy for minimum cost graph homomorphisms","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Mathematics; Combinatorics; Graph; Graph homomorphism; Discrete mathematics; Vertex (graph theory); Algebra homomorphism; Line graph; Graph power","score_opus":0.0400559946199954,"score_gpt":0.2741690628301987,"score_spread":0.2341130682102033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146959334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45289946,0.003617724,0.3350046,0.049449455,0.0010517465,0.00026210918,0.002003561,0.0015860669,0.15412538],"genre_scores_gemma":[0.9201861,0.0017433582,0.047861382,0.0036050072,0.0013526495,0.00051819556,0.0011605287,0.00045803093,0.023114793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646145,0.001050532,0.0001443536,0.0008498632,0.000841087,0.0006526884],"domain_scores_gemma":[0.97642446,0.018799204,0.00080319354,0.0016134826,0.00067891134,0.0016807031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032573396,0.0012817584,0.0031798466,0.002548046,0.003426527,0.008133502,0.0046406346,0.0058812606,0.022123067],"category_scores_gemma":[0.021694317,0.0014264134,0.0019439593,0.0030765075,0.005419374,0.018986477,0.0072645075,0.011036713,0.0021956833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028803528,0.00014076475,0.00033448098,0.00021401067,0.000028734099,0.0000699871,0.0002538305,0.004174164,0.0011441142,0.96973825,0.008871938,0.014741775],"study_design_scores_gemma":[0.00005237043,0.000027808315,0.00012056744,0.000020604008,0.000015008802,0.000070597576,0.00005241655,0.01108717,0.00022230587,0.9871221,0.0011986454,0.000010481891],"about_ca_topic_score_codex":0.00066974515,"about_ca_topic_score_gemma":0.0005568537,"teacher_disagreement_score":0.022123067,"about_ca_system_score_codex":0.003952605,"about_ca_system_score_gemma":0.0014967197,"threshold_uncertainty_score":0.07400906},"labels":[],"label_agreement":null},{"id":"W2147365795","doi":"10.1007/s00373-011-1047-9","title":"Finding a Sun in Building-Free Graphs","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Experimental Program to Stimulate Competitive Research; National Security Agency; National Science Foundation","keywords":"Combinatorics; Indifference graph; Mathematics; Chordal graph; Pathwidth; Cograph; Discrete mathematics; Clique-sum; Split graph; Vertex (graph theory); Graph product; Maximal independent set; 1-planar graph; Graph; Line graph","score_opus":0.03634612366228012,"score_gpt":0.26875202869400155,"score_spread":0.23240590503172143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147365795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5774451,0.0012018821,0.33714265,0.0038318941,0.00032261212,0.00017930061,0.00057950744,0.0023005235,0.07699648],"genre_scores_gemma":[0.8236811,0.0004454128,0.15353411,0.0004442381,0.00007600315,0.00007958669,0.0006340803,0.00051787676,0.020587612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993278,0.00014203985,0.00003403265,0.0002490907,0.00010033029,0.00014668795],"domain_scores_gemma":[0.9971836,0.0014334846,0.00020361968,0.0006268353,0.00017705892,0.00037542617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007158936,0.00068225473,0.0011439524,0.0011382999,0.003474737,0.0022577,0.0016278024,0.0019602505,0.009668837],"category_scores_gemma":[0.0038682004,0.001196905,0.001258532,0.0015292234,0.0030073468,0.007860313,0.0037673942,0.0028794608,0.0016773504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055173493,0.00030782388,0.0069903214,0.00072193885,0.000106962456,0.0008508811,0.002791651,0.025248636,0.010502321,0.79001385,0.017567823,0.14434598],"study_design_scores_gemma":[0.000027282542,0.000059353923,0.0005674834,0.00005172752,0.000046262372,0.00026700366,0.00071040436,0.016352832,0.0045038876,0.96926516,0.008129333,0.000019145607],"about_ca_topic_score_codex":0.0016736885,"about_ca_topic_score_gemma":0.004238213,"teacher_disagreement_score":0.009668837,"about_ca_system_score_codex":0.00091184664,"about_ca_system_score_gemma":0.0007746794,"threshold_uncertainty_score":0.032345474},"labels":[],"label_agreement":null},{"id":"W2147388035","doi":"10.1007/s10479-005-2452-3","title":"Packing r-Cliques in Weighted Chordal Graphs","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Theory of computation; Discrete mathematics; Disjoint sets; Interval graph; Clique; Vertex (graph theory); Treewidth; Exponential time hypothesis; Graph; Pathwidth; Algorithm; Line graph","score_opus":0.19093514737532585,"score_gpt":0.48248149731860274,"score_spread":0.2915463499432769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147388035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7448629,0.0008294522,0.22079079,0.0009633244,0.0001990795,0.00035016533,0.0011222338,0.0007091213,0.03017295],"genre_scores_gemma":[0.80945796,0.00078587024,0.17009296,0.00030409792,0.00017677502,0.0002618487,0.0017610055,0.00038306724,0.016776435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983621,0.00039000245,0.00012043106,0.00041017673,0.00034238095,0.000374865],"domain_scores_gemma":[0.99347925,0.0032726536,0.0009295543,0.0010441735,0.00036642578,0.0009078878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082157337,0.00094272965,0.0018554537,0.0016726116,0.0022284088,0.0033810425,0.003356714,0.0019219576,0.009304512],"category_scores_gemma":[0.008268243,0.0014237745,0.001042613,0.004040928,0.0015766397,0.0050672125,0.0031869386,0.0017561577,0.001496097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00235575,0.0010318899,0.008665622,0.0014064317,0.00047208596,0.0023236198,0.0023738698,0.14508153,0.038259465,0.59653056,0.022299705,0.17919941],"study_design_scores_gemma":[0.00025141062,0.0003445397,0.0025668426,0.00010672243,0.0001455045,0.0010965259,0.0012182877,0.29176283,0.008404642,0.6840888,0.009955441,0.000058344034],"about_ca_topic_score_codex":0.0022173421,"about_ca_topic_score_gemma":0.0032839896,"teacher_disagreement_score":0.009304512,"about_ca_system_score_codex":0.0010497872,"about_ca_system_score_gemma":0.0007111076,"threshold_uncertainty_score":0.031126738},"labels":[],"label_agreement":null},{"id":"W2148094079","doi":"","title":"Those Ubiquitous Cut Polyhedra","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Polyhedron; Conjecture; Mathematics","score_opus":0.02053844516593476,"score_gpt":0.31984719245158366,"score_spread":0.2993087472856489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148094079","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0680697,0.019580485,0.35164127,0.0052992734,0.0021307766,0.00015158621,0.0022428096,0.000645822,0.55023813],"genre_scores_gemma":[0.66667485,0.017457956,0.17026931,0.0032478014,0.0022373225,0.00051005796,0.0035015892,0.0006110868,0.13548994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987496,0.0002324639,0.00006450785,0.0003295639,0.0004081988,0.00021556803],"domain_scores_gemma":[0.99920374,0.00029900004,0.00006810961,0.000120436634,0.00020299442,0.000105761406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005264615,0.0007195059,0.0005958334,0.0012916691,0.0023346716,0.004251055,0.00084736786,0.0011677631,0.013893858],"category_scores_gemma":[0.002827626,0.00046898858,0.0007786772,0.002121188,0.003794899,0.004647884,0.0026939667,0.0028257258,0.0024991005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009661917,0.000003985328,0.00011659594,0.00003759761,0.0000031570798,0.00004099649,0.00014550799,0.00039780585,0.00013567948,0.98402435,0.0045025945,0.010582158],"study_design_scores_gemma":[0.0000057077514,0.000011065007,0.00019434042,0.00006345637,0.0000039021234,0.00022031467,0.00019574515,0.0013975195,0.00017855906,0.90028316,0.097437106,0.000009156764],"about_ca_topic_score_codex":0.0018130705,"about_ca_topic_score_gemma":0.0016623123,"teacher_disagreement_score":0.013893858,"about_ca_system_score_codex":0.0016431849,"about_ca_system_score_gemma":0.000852734,"threshold_uncertainty_score":0.046479642},"labels":[],"label_agreement":null},{"id":"W2148324291","doi":"10.1016/j.dam.2013.01.016","title":"The parametric complexity of graph diameter augmentation","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Parameterized complexity; Graph; Discrete mathematics; Dominating set; Vertex (graph theory)","score_opus":0.042842473168147995,"score_gpt":0.2981992174033175,"score_spread":0.2553567442351695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148324291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6420146,0.0017866982,0.26461512,0.0091454005,0.00031071043,0.00015583413,0.0021693867,0.0007121507,0.07909003],"genre_scores_gemma":[0.9680448,0.0010420819,0.02119866,0.00032711664,0.0004791499,0.00019288898,0.0007682137,0.0002584428,0.007688609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974245,0.00068258046,0.00013283317,0.0004987678,0.0008290787,0.00043224898],"domain_scores_gemma":[0.9799605,0.014084029,0.0016665251,0.0024794838,0.0007412873,0.0010680418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017448132,0.00082086667,0.0018456595,0.0015891425,0.0019210322,0.006938362,0.004300237,0.0023306145,0.012388457],"category_scores_gemma":[0.021176893,0.0010553529,0.0014904566,0.0030835734,0.0042573796,0.017582713,0.004815517,0.0044399705,0.0009451323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026572717,0.00008147742,0.0024619144,0.00016746453,0.00002857896,0.0001716148,0.00054317294,0.04170179,0.001775131,0.9291342,0.0048803817,0.018788557],"study_design_scores_gemma":[0.000028283555,0.000028107163,0.0008236603,0.000019898904,0.0000264257,0.00019911215,0.00013772196,0.073195316,0.0006209143,0.9229144,0.0019810894,0.000025061952],"about_ca_topic_score_codex":0.0018646314,"about_ca_topic_score_gemma":0.0014016185,"teacher_disagreement_score":0.012388457,"about_ca_system_score_codex":0.0027772249,"about_ca_system_score_gemma":0.0016376807,"threshold_uncertainty_score":0.041443527},"labels":[],"label_agreement":null},{"id":"W2149458512","doi":"10.1007/978-3-642-21458-5_35","title":"Approximation Algorithms for Orienting Mixed Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Computer science; Undirected graph; Approximation algorithm; Graph; Vertex (graph theory); Directed graph; Block graph; Combinatorics; Algorithm; Discrete mathematics; Line graph; Mathematics; Theoretical computer science; Pathwidth","score_opus":0.04011783219635234,"score_gpt":0.28845202270077064,"score_spread":0.2483341905044183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149458512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05969884,0.0025544786,0.90313804,0.0009615694,0.00028515537,0.00023906556,0.00086454564,0.0031046965,0.02915365],"genre_scores_gemma":[0.18706836,0.0018019238,0.7901967,0.00040037747,0.00023942313,0.00045202806,0.0032387339,0.0011536678,0.015448759],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987607,0.00030292728,0.00007557396,0.00028433808,0.0003923914,0.00018398612],"domain_scores_gemma":[0.9970299,0.0016274643,0.00016906223,0.00073842396,0.00027195102,0.00016318531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011607009,0.0023672285,0.0019062953,0.0021378023,0.0010373006,0.0037384627,0.004546116,0.0018881236,0.013896949],"category_scores_gemma":[0.0065146587,0.0013286006,0.001954118,0.0047897906,0.0011280328,0.007730599,0.0033476145,0.0041615544,0.003144665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065631256,0.0005878698,0.0014912859,0.0009809198,0.00017646136,0.00015359693,0.000519233,0.11515097,0.005413482,0.27077907,0.040369652,0.5637211],"study_design_scores_gemma":[0.00019978952,0.00010963453,0.00044255567,0.00013828395,0.00013316456,0.00026295544,0.00024153378,0.46723726,0.0032138312,0.5137214,0.014266306,0.0000333073],"about_ca_topic_score_codex":0.0027200137,"about_ca_topic_score_gemma":0.004070646,"teacher_disagreement_score":0.013896949,"about_ca_system_score_codex":0.0022553029,"about_ca_system_score_gemma":0.0011199265,"threshold_uncertainty_score":0.046489894},"labels":[],"label_agreement":null},{"id":"W2150314982","doi":"10.1109/foci.2007.372179","title":"Search Difficulty of Two-Connected Ring-based Topological Network Designs","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Brock University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Euclidean geometry; Euclidean distance; Ring (chemistry); Unit (ring theory); Bounded function; Computer science; Mathematics; Topology (electrical circuits); Mathematical optimization; Combinatorics; Theoretical computer science; Artificial intelligence; Geometry","score_opus":0.06464240155718863,"score_gpt":0.35013342839844325,"score_spread":0.2854910268412546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150314982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86636806,0.0005762189,0.121932544,0.0016135871,0.000026320216,0.00008647665,0.0004687989,0.00009979387,0.008828167],"genre_scores_gemma":[0.9706167,0.00025364672,0.026595686,0.00009410014,0.000024345938,0.00008070857,0.00024838114,0.000032341683,0.0020542396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990791,0.00049955514,0.000043364973,0.00015909426,0.000118199605,0.000100736615],"domain_scores_gemma":[0.9866176,0.011063309,0.0011675186,0.00044933238,0.0003066031,0.00039548264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020848094,0.00057640596,0.00119397,0.00094000204,0.0005121629,0.0013956074,0.0015760101,0.0020746675,0.0041652354],"category_scores_gemma":[0.01491191,0.00040487823,0.0007541364,0.0007852801,0.0010250708,0.0031181849,0.001199241,0.0010589048,0.00018746663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036903776,0.00016373655,0.0027955258,0.00022694057,0.00010708979,0.00019070313,0.00017425294,0.88649607,0.002448199,0.0837676,0.0021186317,0.021142166],"study_design_scores_gemma":[0.00012117999,0.0001194864,0.00088689436,0.000023071958,0.000035773726,0.00013469456,0.000080871214,0.9184472,0.0009978861,0.07847906,0.0006530917,0.000020756792],"about_ca_topic_score_codex":0.0009589786,"about_ca_topic_score_gemma":0.0007444676,"teacher_disagreement_score":0.0041652354,"about_ca_system_score_codex":0.0010842977,"about_ca_system_score_gemma":0.0004394672,"threshold_uncertainty_score":0.013934076},"labels":[],"label_agreement":null},{"id":"W2150704108","doi":"10.1016/s0166-218x(03)00394-9","title":"P5-free augmenting graphs and the maximum stable set problem","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Characterization (materials science); Combinatorics; Maximal independent set; Class (philosophy); Independent set; Set (abstract data type); Chordal graph; Discrete mathematics; Time complexity; Split graph; Indifference graph; Graph; 1-planar graph; Computer science; Artificial intelligence","score_opus":0.018016945328339123,"score_gpt":0.2586677644041901,"score_spread":0.24065081907585098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150704108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55494106,0.0009009398,0.31198868,0.0048140823,0.00017326357,0.00021044441,0.0017808097,0.0004584983,0.124732204],"genre_scores_gemma":[0.89944565,0.0007540293,0.07265756,0.00039655317,0.00017491917,0.00028509233,0.0016985013,0.00017179034,0.024415899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993274,0.00021944947,0.000029892313,0.00016564126,0.00013101603,0.00012661784],"domain_scores_gemma":[0.9950759,0.003392229,0.00042508479,0.00045120507,0.00023356655,0.00042200045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091211306,0.00078940357,0.0009907845,0.0010940686,0.002303789,0.002501693,0.00193195,0.001963762,0.014381423],"category_scores_gemma":[0.0051175486,0.0006847421,0.0010127318,0.0018512283,0.0017315381,0.004648685,0.0026118648,0.0027528035,0.0010205883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024313846,0.00010124235,0.0006769942,0.00014863098,0.000032307507,0.00022143965,0.0003388516,0.024414726,0.0018639709,0.9427958,0.006949489,0.022213409],"study_design_scores_gemma":[0.000036276124,0.000020242836,0.00022476623,0.000017810215,0.000013084498,0.00009269495,0.00009823984,0.03182398,0.0006878283,0.96362334,0.0033546444,0.000007188432],"about_ca_topic_score_codex":0.001110789,"about_ca_topic_score_gemma":0.0016057693,"teacher_disagreement_score":0.014381423,"about_ca_system_score_codex":0.0009486909,"about_ca_system_score_gemma":0.00079194113,"threshold_uncertainty_score":0.048110604},"labels":[],"label_agreement":null},{"id":"W2152026596","doi":"10.1109/sfcs.1997.646109","title":"The analysis of a list-coloring algorithm on a random graph","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Markov chain; Discrete mathematics; Random graph; Upper and lower bounds; Algorithm; Degree (music); Graph; Path (computing); Computer science; Physics; Statistics","score_opus":0.027579936358947225,"score_gpt":0.2840963481317202,"score_spread":0.25651641177277296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152026596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2658274,0.0009912228,0.72312343,0.0013598634,0.00008682322,0.00020438795,0.00029443376,0.0015971177,0.006515335],"genre_scores_gemma":[0.8869878,0.0005935367,0.10723078,0.0003355255,0.00010743959,0.00026300582,0.00041801287,0.00026456075,0.0037993144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976421,0.0009839013,0.0000756968,0.00043457554,0.00047278928,0.00039098016],"domain_scores_gemma":[0.9793291,0.014755167,0.0016674817,0.0015992726,0.0018971738,0.000751714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003556953,0.0007975655,0.0008378054,0.0013442629,0.0008997546,0.0014308951,0.0022304347,0.0013392128,0.0031910765],"category_scores_gemma":[0.02185281,0.0005130189,0.00067801244,0.0013472558,0.0022728995,0.003269063,0.0011421248,0.0011792582,0.0007616114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006840885,0.00016122957,0.0071612354,0.0002813087,0.00015432051,0.00016601964,0.00018268135,0.7473978,0.010338105,0.18862882,0.0045329323,0.040311567],"study_design_scores_gemma":[0.000013665917,0.000036668946,0.0002568377,0.000006132854,0.000008054646,0.000034900437,0.0000071193867,0.9829915,0.0009896052,0.015391044,0.0002570129,0.0000074804107],"about_ca_topic_score_codex":0.0027620422,"about_ca_topic_score_gemma":0.0019332231,"teacher_disagreement_score":0.003556953,"about_ca_system_score_codex":0.0034560927,"about_ca_system_score_gemma":0.0021182166,"threshold_uncertainty_score":0.025075793},"labels":[],"label_agreement":null},{"id":"W2152052626","doi":"10.1016/j.dam.2015.01.039","title":"Edge intersection graphs of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si61.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>L</mml:mi></mml:math>-shaped paths in grids","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"European Social Fund; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Intersection (aeronautics); Enhanced Data Rates for GSM Evolution; Degenerate energy levels; Computer science; Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Physics","score_opus":0.024358024773587825,"score_gpt":0.26992813274272287,"score_spread":0.24557010796913503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152052626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24693725,0.0005662224,0.46976766,0.0012673248,0.0003378371,0.00041274016,0.02102823,0.003769492,0.2559132],"genre_scores_gemma":[0.67205244,0.0007336295,0.21648607,0.00043643016,0.000057101755,0.0004218303,0.025703074,0.0014838051,0.08262555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996561,0.000056507335,0.000018659715,0.00009976863,0.000079757534,0.000089179324],"domain_scores_gemma":[0.99874264,0.00045988927,0.0001424476,0.00021104618,0.0003102737,0.00013373728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019577082,0.0003907221,0.00033718336,0.0010193479,0.00088019733,0.0017087294,0.00090983586,0.0006438911,0.04685326],"category_scores_gemma":[0.0020375883,0.0003589354,0.0004391929,0.0017553419,0.00060366647,0.0021481449,0.0011280349,0.00096810237,0.00529671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053145096,0.00014138149,0.0034357158,0.0003926915,0.00004354007,0.00075624004,0.0006857272,0.021806888,0.0070747826,0.82428813,0.05610154,0.08474189],"study_design_scores_gemma":[0.00010539096,0.000102905215,0.0051881587,0.0002024799,0.000051394913,0.00076054945,0.0010629806,0.06309215,0.014589776,0.74401516,0.1707703,0.000058796228],"about_ca_topic_score_codex":0.002934984,"about_ca_topic_score_gemma":0.0038998225,"teacher_disagreement_score":0.04685326,"about_ca_system_score_codex":0.00068302115,"about_ca_system_score_gemma":0.00063478184,"threshold_uncertainty_score":0.15673983},"labels":[],"label_agreement":null},{"id":"W2152329689","doi":"10.1016/j.disc.2005.06.043","title":"On a new reformulation of Hadwiger's conjecture","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Conjecture; Discrete mathematics; Graph; Class (philosophy); Minor (academic); Computer science","score_opus":0.016026557696064973,"score_gpt":0.2854202328056561,"score_spread":0.2693936751095911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152329689","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10897468,0.0026032329,0.32295325,0.08706399,0.011427803,0.00019457116,0.0012359625,0.0010278737,0.4645186],"genre_scores_gemma":[0.8274395,0.0018225223,0.06485456,0.018847695,0.008348888,0.00032217876,0.0010797716,0.00045893615,0.07682606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978765,0.00071533106,0.000095961164,0.00044861695,0.0005040748,0.0003594812],"domain_scores_gemma":[0.99647886,0.0015333603,0.00024820562,0.0009386117,0.0005254282,0.000275634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003764017,0.0009912867,0.0019078928,0.0021478974,0.003633899,0.0043613217,0.0029112909,0.0034500512,0.017224526],"category_scores_gemma":[0.010187769,0.00049996615,0.0015683672,0.0021500946,0.008327875,0.014122899,0.004972276,0.0063206144,0.0028629084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016879174,0.000010072482,0.000049991984,0.00001676778,0.0000035177995,0.00002162803,0.000057596422,0.0002299651,0.00006444246,0.9941062,0.0038895202,0.0015334062],"study_design_scores_gemma":[0.000011584519,0.000005236202,0.000035755114,0.000007652557,0.0000022605168,0.000018977793,0.000021321297,0.0010060059,0.00005127602,0.99614894,0.002685867,0.000005151799],"about_ca_topic_score_codex":0.0017304841,"about_ca_topic_score_gemma":0.0013875338,"teacher_disagreement_score":0.017224526,"about_ca_system_score_codex":0.0024051869,"about_ca_system_score_gemma":0.0013476349,"threshold_uncertainty_score":0.057621777},"labels":[],"label_agreement":null},{"id":"W2152727633","doi":"10.1145/944618.944629","title":"Solving a \"Hard\" problem to approximate an \"Easy\" one","year":2002,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Heuristic; Matching (statistics); Mathematical optimization; Travelling salesman problem; Duality (order theory); Combinatorics; Algorithm","score_opus":0.05586580032839563,"score_gpt":0.3173452730164984,"score_spread":0.2614794726881028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152727633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27101567,0.0008070616,0.6842739,0.0030048825,0.00034380433,0.00023740888,0.00046410825,0.0010450425,0.038808078],"genre_scores_gemma":[0.5409044,0.0004029364,0.44992697,0.00039838828,0.00016082871,0.0002714998,0.0005735511,0.0002160382,0.007145404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989002,0.00036316187,0.00004004322,0.00029437523,0.00019249691,0.00020976266],"domain_scores_gemma":[0.99732345,0.0017969145,0.00024367924,0.0003485794,0.00016334331,0.00012396746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014524666,0.0012767141,0.0009799822,0.000857676,0.00085453485,0.0011390542,0.0017096936,0.0019052521,0.010738247],"category_scores_gemma":[0.009800095,0.0004474419,0.0008915922,0.0010177973,0.0013099207,0.0038294026,0.0020242909,0.0016167993,0.0009603899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035732347,0.00034977318,0.0013062985,0.00035009507,0.000081943355,0.00018340941,0.00009390651,0.7989491,0.0021455458,0.10294539,0.006521345,0.08671581],"study_design_scores_gemma":[0.00007796821,0.00013404085,0.00027957646,0.000025983243,0.000020138374,0.00007214602,0.00009815685,0.91648585,0.0013206188,0.078073375,0.0033983008,0.000013794346],"about_ca_topic_score_codex":0.0020768158,"about_ca_topic_score_gemma":0.002161204,"teacher_disagreement_score":0.010738247,"about_ca_system_score_codex":0.00095179304,"about_ca_system_score_gemma":0.001027986,"threshold_uncertainty_score":0.035923064},"labels":[],"label_agreement":null},{"id":"W2152845747","doi":"10.7155/jgaa.00435","title":"Egalitarian Graph Orientations","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Lexicographical order; Orientation (vector space); Graph; Directed graph; Vertex (graph theory); Computer science; Undirected graph; Combinatorics; Mathematics; Geometry","score_opus":0.02522473167498975,"score_gpt":0.33448234752013234,"score_spread":0.3092576158451426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152845747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15838341,0.00053900754,0.78770214,0.0013864784,0.00015118837,0.00026440973,0.0012852004,0.0009747292,0.049313355],"genre_scores_gemma":[0.5037015,0.0009799635,0.4780256,0.00047807954,0.00008220641,0.00023852159,0.001759185,0.0003871481,0.014347756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931383,0.00015609807,0.00004479499,0.00022040332,0.0001293911,0.0001355194],"domain_scores_gemma":[0.9981694,0.0006523752,0.00024352687,0.00051178905,0.00023199013,0.00019073053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061232754,0.00072033436,0.00059680897,0.0007836639,0.00097074837,0.0018425506,0.0012223696,0.0009707984,0.0070781414],"category_scores_gemma":[0.003702854,0.0004398226,0.0004890129,0.00106852,0.0010193012,0.0029603576,0.0016822834,0.0014743396,0.001673883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008331294,0.0002998166,0.005134913,0.00049513305,0.0000805558,0.00043123655,0.0008372125,0.11737069,0.02649875,0.55945647,0.024495143,0.264067],"study_design_scores_gemma":[0.00013059819,0.00022830554,0.0015915224,0.00011264915,0.000104762,0.00061942975,0.00073571847,0.18339513,0.020542782,0.7497408,0.04273163,0.00006669692],"about_ca_topic_score_codex":0.0013700965,"about_ca_topic_score_gemma":0.0031073003,"teacher_disagreement_score":0.0070781414,"about_ca_system_score_codex":0.0009264982,"about_ca_system_score_gemma":0.00094787456,"threshold_uncertainty_score":0.02367872},"labels":[],"label_agreement":null},{"id":"W2153068117","doi":"10.5555/982792.982848","title":"The list partition problem for graphs","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Partition (number theory); Mathematics; Clique problem; Time complexity; Skew; Discrete mathematics; Clique; Chordal graph; Graph; Computer science; 1-planar graph","score_opus":0.015776286400295332,"score_gpt":0.2901337696210354,"score_spread":0.27435748322074005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153068117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14840315,0.002947337,0.8052334,0.004281789,0.0003398799,0.00077191263,0.003576027,0.0021580553,0.03228825],"genre_scores_gemma":[0.5231116,0.0037880088,0.42779562,0.0010904383,0.00059155247,0.0007882745,0.0121124415,0.0008061172,0.029916033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984456,0.00043826565,0.00009645669,0.00038553108,0.0003030568,0.00033115264],"domain_scores_gemma":[0.99783844,0.0013465538,0.00023589126,0.00026559783,0.00016008367,0.00015348801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011172668,0.0013657802,0.0011508442,0.0012885843,0.0022131053,0.0040038135,0.0021201114,0.002593096,0.01140723],"category_scores_gemma":[0.005069124,0.00082069816,0.0013828218,0.00337659,0.0015390018,0.009277414,0.002346797,0.0019167875,0.0022130483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010171771,0.0004226065,0.00202781,0.001804055,0.00018434838,0.0007324087,0.0014517336,0.23143362,0.00815865,0.47543675,0.07488298,0.20244782],"study_design_scores_gemma":[0.00023023842,0.00021079222,0.0009055639,0.00013294295,0.00010310342,0.0008900459,0.00079168053,0.26061696,0.0058251433,0.67645395,0.05376376,0.00007589663],"about_ca_topic_score_codex":0.0034938215,"about_ca_topic_score_gemma":0.0036195763,"teacher_disagreement_score":0.01140723,"about_ca_system_score_codex":0.0022364736,"about_ca_system_score_gemma":0.0015317912,"threshold_uncertainty_score":0.03816098},"labels":[],"label_agreement":null},{"id":"W2153548489","doi":"10.1016/j.disc.2005.12.032","title":"How to build a brick","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Graph factorization; Factor-critical graph; Conjecture; Matching (statistics); Graph; Connected component; Discrete mathematics; Graph power; Line graph","score_opus":0.01802467165638636,"score_gpt":0.283069835033532,"score_spread":0.2650451633771456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153548489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020359194,0.0016743223,0.7294626,0.023148956,0.005258944,0.00044917504,0.0004580963,0.004565058,0.2146236],"genre_scores_gemma":[0.1619925,0.0014591924,0.682299,0.0046654623,0.00037699155,0.00049733423,0.0006762011,0.0035627428,0.1444706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899,0.0002410489,0.000055818393,0.00019837257,0.00033636947,0.00017823838],"domain_scores_gemma":[0.9972856,0.00055186905,0.00008766684,0.0010373535,0.00064594613,0.00039166713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013809307,0.00093525706,0.00084417855,0.0014054759,0.003306331,0.004068862,0.0017788741,0.0024876099,0.06268023],"category_scores_gemma":[0.0076032886,0.0012440284,0.0012175982,0.00062622014,0.002813976,0.01399428,0.006595484,0.0051509123,0.029827634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016326101,0.000152963,0.00070380897,0.0003412924,0.000055817258,0.0003323851,0.0013518629,0.0060444297,0.0072273524,0.73508394,0.09337738,0.15516545],"study_design_scores_gemma":[0.000046705143,0.000087855224,0.00028048272,0.00027616983,0.00003871494,0.00029524893,0.001408509,0.009336577,0.004222206,0.62194216,0.3620032,0.000062163606],"about_ca_topic_score_codex":0.0016498647,"about_ca_topic_score_gemma":0.0021795668,"teacher_disagreement_score":0.06268023,"about_ca_system_score_codex":0.0007287623,"about_ca_system_score_gemma":0.0014359027,"threshold_uncertainty_score":0.20968628},"labels":[],"label_agreement":null},{"id":"W2154102540","doi":"10.1002/jgt.21644","title":"Star Chromatic Index","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Mathematics; Combinatorics; Mathematical proof; Chromatic scale; Upper and lower bounds; Star (game theory); Edge coloring; Graph; Discrete mathematics; Graph power; Line graph; Geometry","score_opus":0.018121822264892704,"score_gpt":0.28821578885559107,"score_spread":0.27009396659069834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154102540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49011183,0.0021752142,0.26276255,0.0015289249,0.00050888397,0.00020768486,0.005790653,0.0016049125,0.23530932],"genre_scores_gemma":[0.93134224,0.00093997567,0.05019743,0.00024376751,0.00019635075,0.00007873487,0.0022253946,0.00025479222,0.014521244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898654,0.00009885915,0.000059416067,0.00029527853,0.00031439133,0.0002455057],"domain_scores_gemma":[0.9970085,0.0010653057,0.00032013253,0.0004672144,0.00063992967,0.0004988949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006961242,0.0004987978,0.0005895262,0.0025228206,0.0010160321,0.0022183224,0.00095274614,0.00052520947,0.013277811],"category_scores_gemma":[0.0022535631,0.00027647032,0.00038168376,0.0025058042,0.0015712498,0.002589037,0.000980763,0.0012545323,0.0018781403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006346046,0.00019295224,0.009340783,0.00043832444,0.00007031789,0.000116547846,0.00046939272,0.050899576,0.058241278,0.7858546,0.024018524,0.06972306],"study_design_scores_gemma":[0.000056234643,0.0002713013,0.009240938,0.00008507835,0.00006402012,0.00050775596,0.0003431559,0.11853128,0.048190977,0.7574326,0.06516843,0.00010830511],"about_ca_topic_score_codex":0.0017743803,"about_ca_topic_score_gemma":0.00232503,"teacher_disagreement_score":0.013277811,"about_ca_system_score_codex":0.0017773551,"about_ca_system_score_gemma":0.0012245814,"threshold_uncertainty_score":0.044418633},"labels":[],"label_agreement":null},{"id":"W2154125058","doi":"10.37236/4283","title":"Partial List Colouring of Certain Graphs","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Chromatic scale; Chordal graph; Graph; Discrete mathematics","score_opus":0.023696122225726795,"score_gpt":0.28696886160853197,"score_spread":0.26327273938280515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154125058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8346219,0.000508404,0.13090082,0.0014508781,0.00008937496,0.00009281197,0.0008117848,0.0011495202,0.03037453],"genre_scores_gemma":[0.9725357,0.00026130036,0.021631164,0.00025274823,0.000040928153,0.00004866266,0.0008148227,0.00008908059,0.0043255743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992149,0.00014669208,0.00003225466,0.00025250242,0.00016796307,0.00018568251],"domain_scores_gemma":[0.99317706,0.0033378995,0.00067395566,0.0016413556,0.0006158721,0.00055385707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005902923,0.0003205839,0.0004330996,0.00069216755,0.0012649435,0.0016634332,0.0010629587,0.00094236946,0.004884627],"category_scores_gemma":[0.006397471,0.00041889152,0.0006798769,0.0011488638,0.0018562141,0.0030953516,0.0012957866,0.0011725633,0.00036335795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068675354,0.00013381195,0.011518625,0.0005720344,0.00009613677,0.0009868053,0.0015243589,0.07148521,0.03473884,0.8184866,0.010914704,0.048856188],"study_design_scores_gemma":[0.0001077615,0.00015084096,0.00455335,0.000047452402,0.00008338312,0.0011900619,0.00043966735,0.16842325,0.021626266,0.78719354,0.016128445,0.000055997705],"about_ca_topic_score_codex":0.0026970266,"about_ca_topic_score_gemma":0.0035523202,"teacher_disagreement_score":0.004884627,"about_ca_system_score_codex":0.0014585332,"about_ca_system_score_gemma":0.0008553817,"threshold_uncertainty_score":0.016340733},"labels":[],"label_agreement":null},{"id":"W2154562890","doi":"10.1007/s00373-009-0853-9","title":"Minimum Cost Homomorphism Dichotomy for Oriented Cycles","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Combinatorics; Digraph; Mathematics; Conjecture; Vertex (graph theory); Graph; Algebra homomorphism; Discrete mathematics; Graph homomorphism; Line graph; Graph power","score_opus":0.017969535926905988,"score_gpt":0.2812984227620912,"score_spread":0.26332888683518524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154562890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7303087,0.0019015289,0.13433062,0.009328006,0.000342253,0.00015432689,0.0010887976,0.0006989272,0.12184674],"genre_scores_gemma":[0.95779413,0.0010093972,0.022311617,0.0009009564,0.00038954697,0.00023286349,0.0008518662,0.00022878523,0.016280796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991328,0.00021373207,0.000032073556,0.0001704583,0.00026079855,0.00019017285],"domain_scores_gemma":[0.9947476,0.0036729006,0.00028627133,0.00044455053,0.00024745558,0.00060119695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010873631,0.0007161822,0.0016685154,0.0015923853,0.0018882009,0.0046832315,0.0023301868,0.0025565908,0.014837662],"category_scores_gemma":[0.00721341,0.00072916725,0.0009046554,0.0018989353,0.0022509068,0.008675563,0.0029476294,0.004063768,0.00095420383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024798219,0.00012525056,0.0005597651,0.00018958953,0.000025530737,0.00010243039,0.00027847852,0.0048968997,0.001657789,0.97085124,0.006031866,0.01503323],"study_design_scores_gemma":[0.000046016587,0.000016996124,0.00020106236,0.00001500674,0.000014313524,0.000058031397,0.00007586512,0.011204635,0.00035484185,0.98694605,0.001059652,0.0000076355245],"about_ca_topic_score_codex":0.0008159151,"about_ca_topic_score_gemma":0.0009438773,"teacher_disagreement_score":0.014837662,"about_ca_system_score_codex":0.002168186,"about_ca_system_score_gemma":0.0010057315,"threshold_uncertainty_score":0.0496369},"labels":[],"label_agreement":null},{"id":"W2154587131","doi":"","title":"Parallel morphing of trees and cycles.","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple (philosophy); Morphing; Computer science; Knot (papermaking); Combinatorics; Parallel algorithm; Mathematics; Parallel computing; Artificial intelligence","score_opus":0.026972647115311197,"score_gpt":0.2922693954198176,"score_spread":0.2652967483045064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154587131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23925987,0.0008833669,0.70139176,0.0006036271,0.00029806598,0.00018049071,0.00019274213,0.0007984739,0.056391664],"genre_scores_gemma":[0.8227878,0.0007478918,0.15319842,0.00029303215,0.00014326698,0.00013136539,0.00030424036,0.00023462184,0.0221593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958724,0.00005337174,0.000022087705,0.00013472945,0.00013690778,0.00006572278],"domain_scores_gemma":[0.99897707,0.00022187336,0.00023090329,0.0003390099,0.00012459647,0.000106595995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029177897,0.0004964652,0.0002986299,0.000782256,0.0008567672,0.00081535196,0.0006947311,0.00078327156,0.0047098543],"category_scores_gemma":[0.0024298376,0.00044626134,0.00080169615,0.00046224985,0.0019204115,0.002672899,0.0030256351,0.001299555,0.00066410867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015838874,0.000052256175,0.0020422637,0.00018152606,0.000040631614,0.00072881614,0.00079172134,0.012221087,0.027686192,0.86792374,0.0026355814,0.08553775],"study_design_scores_gemma":[0.000035444453,0.00016955625,0.0014919826,0.000058856822,0.00006899097,0.0024009715,0.00026729438,0.06806341,0.023338446,0.86426294,0.03979611,0.00004587098],"about_ca_topic_score_codex":0.0008914558,"about_ca_topic_score_gemma":0.00088276406,"teacher_disagreement_score":0.0047098543,"about_ca_system_score_codex":0.00042743052,"about_ca_system_score_gemma":0.00026039613,"threshold_uncertainty_score":0.015756011},"labels":[],"label_agreement":null},{"id":"W2155131920","doi":"10.1007/s10114-010-9006-6","title":"The existence of even regular factors of regular graphs on the number of cut edges","year":2010,"lang":"en","type":"article","venue":"Acta Mathematica Sinica English Series","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Wilfrid Laurier University","funders":"","keywords":"Multigraph; Combinatorics; Integer (computer science); Mathematics; Factor (programming language); Characterization (materials science); Discrete mathematics; Two-graph; Graph; Computer science; Physics; Line graph","score_opus":0.02358314849516185,"score_gpt":0.2832969816802185,"score_spread":0.25971383318505664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155131920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8243789,0.0018165206,0.09875649,0.0015331878,0.00030683004,0.000059381964,0.0005721597,0.00044893997,0.07212749],"genre_scores_gemma":[0.9695067,0.0009635699,0.018445196,0.00028031322,0.0003103542,0.00006935612,0.0003307021,0.00023985837,0.009853918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902415,0.00021439759,0.00004464274,0.00031898843,0.00016738003,0.00023051308],"domain_scores_gemma":[0.9910731,0.005219142,0.0010904896,0.0006510958,0.0006598302,0.0013064077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012561489,0.0009765094,0.0013250267,0.002402308,0.0014010372,0.0036492725,0.0013883408,0.0012040525,0.0075899027],"category_scores_gemma":[0.010801464,0.0011800184,0.0011730258,0.0013459579,0.0037678583,0.0049864673,0.0016132449,0.0020403701,0.0007508951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047096182,0.000065192056,0.0025656326,0.00018541758,0.000041367755,0.00027946665,0.000583835,0.0028952926,0.0045068124,0.9742443,0.002647115,0.011514729],"study_design_scores_gemma":[0.000057112284,0.00003492936,0.0012114135,0.00003618053,0.000047340116,0.00028546018,0.0001959,0.009675642,0.0010256191,0.98529804,0.0020994353,0.000032977798],"about_ca_topic_score_codex":0.0013914886,"about_ca_topic_score_gemma":0.0014180918,"teacher_disagreement_score":0.0075899027,"about_ca_system_score_codex":0.0010496136,"about_ca_system_score_gemma":0.00070914545,"threshold_uncertainty_score":0.025390744},"labels":[],"label_agreement":null},{"id":"W2155466993","doi":"10.1007/s101070100256","title":"Matching, matroids, and extensions","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Intersection (aeronautics); Matching (statistics); Jump; Path (computing); Mathematical optimization; Matroid partitioning; Combinatorial optimization; Combinatorics; Computer science; Graphic matroid","score_opus":0.036746783843772134,"score_gpt":0.2923804867600973,"score_spread":0.2556337029163252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155466993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32144484,0.039176222,0.3944667,0.024319299,0.0010704144,0.0001431942,0.0012171854,0.0003922554,0.21776997],"genre_scores_gemma":[0.86513084,0.01854768,0.06231584,0.0017936612,0.0032240257,0.00027213496,0.0007391578,0.00011073729,0.047865957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884087,0.00041189117,0.000066047294,0.0002992226,0.00025183422,0.00013013804],"domain_scores_gemma":[0.9965204,0.0018673132,0.0006048886,0.000390968,0.00028656967,0.00032985787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020513907,0.0007065301,0.0011479662,0.0019682795,0.0016845913,0.004414753,0.0012207719,0.0017390944,0.0067762085],"category_scores_gemma":[0.0065497034,0.0006244557,0.0007473799,0.0041449345,0.0044976454,0.011351848,0.002439415,0.0036209074,0.00078956835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018323944,0.000026906599,0.00020950435,0.000041656032,0.0000055134856,0.000018267432,0.00008046336,0.001051402,0.00011011429,0.9880661,0.0016742456,0.008697555],"study_design_scores_gemma":[0.0000033418594,0.000004194798,0.000057028497,0.0000074654945,0.0000035387804,0.00003137463,0.00003289919,0.0012941902,0.000025999696,0.9965469,0.0019906657,0.0000024056328],"about_ca_topic_score_codex":0.0010661605,"about_ca_topic_score_gemma":0.001348305,"teacher_disagreement_score":0.0067762085,"about_ca_system_score_codex":0.0015635391,"about_ca_system_score_gemma":0.0009044813,"threshold_uncertainty_score":0.02266872},"labels":[],"label_agreement":null},{"id":"W2155865206","doi":"10.1017/s0963548307008905","title":"Induced Forests in Regular Graphs with Large Girth","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Upper and lower bounds; Random regular graph; Random graph; Graph; Discrete mathematics; Line graph; Pathwidth","score_opus":0.033503244209739276,"score_gpt":0.271821734146239,"score_spread":0.23831848993649973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155865206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56410044,0.0008813976,0.42325148,0.00048799522,0.00003571068,0.00010123272,0.0004200816,0.00072293245,0.009998647],"genre_scores_gemma":[0.93921584,0.0005008742,0.056782007,0.00011323033,0.00007082516,0.0001359801,0.00046456495,0.00014859394,0.002568023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897075,0.0003379783,0.000043957407,0.00022369681,0.00022074976,0.00020283138],"domain_scores_gemma":[0.98429626,0.012295198,0.0012165364,0.0011140051,0.0005555185,0.00052253413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009511354,0.00033191248,0.00045827683,0.0011074118,0.0005665373,0.0012639457,0.0007355108,0.0006621264,0.0018912554],"category_scores_gemma":[0.009852075,0.00046982686,0.00055666716,0.0009865895,0.0013997303,0.0025056025,0.0008478198,0.000896173,0.0003082405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065661443,0.00022866059,0.014482694,0.0005078159,0.00012908732,0.0010566753,0.0007275153,0.31932342,0.045835093,0.53584343,0.0040688803,0.07714012],"study_design_scores_gemma":[0.000045766705,0.00009995424,0.0043367697,0.000036584355,0.000050396884,0.0008470249,0.0001425284,0.4413971,0.010055093,0.53929454,0.0036644964,0.000029773038],"about_ca_topic_score_codex":0.00058203697,"about_ca_topic_score_gemma":0.0012920599,"teacher_disagreement_score":0.0018912554,"about_ca_system_score_codex":0.00075895566,"about_ca_system_score_gemma":0.00042934497,"threshold_uncertainty_score":0.006326854},"labels":[],"label_agreement":null},{"id":"W2156623776","doi":"10.1006/jagm.2001.1195","title":"On Graph Powers for Leaf-Labeled Trees","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Gomory–Hu tree; Mathematics; Tree (set theory); Graph; K-ary tree; Spanning tree; Path (computing); Basis (linear algebra); Trémaux tree; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Tree structure; Computer science; Binary tree; Line graph; Artificial intelligence; Pathwidth","score_opus":0.03359346603976615,"score_gpt":0.3027998815668668,"score_spread":0.2692064155271007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156623776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112451695,0.0019143713,0.74886405,0.0063899057,0.000836478,0.00035493707,0.0008050301,0.0013803716,0.1270032],"genre_scores_gemma":[0.6431389,0.003183889,0.26589063,0.0021491416,0.0017085752,0.0005637613,0.0021221617,0.0024260175,0.07881697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612707,0.0014924592,0.00022725653,0.00067523465,0.0009965573,0.0004814684],"domain_scores_gemma":[0.97820354,0.0147588,0.00093820377,0.0033370461,0.0014078346,0.0013545193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00378113,0.0013628354,0.0018261645,0.0029851298,0.0024167222,0.004615928,0.002895744,0.0019400019,0.019025052],"category_scores_gemma":[0.02577149,0.0014429059,0.0022263846,0.0036233258,0.005760364,0.019809786,0.007851724,0.0061037783,0.0041923765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024506272,0.00011640661,0.0010595871,0.00018234593,0.00002985859,0.00019901998,0.0010559339,0.005331087,0.0013117131,0.94346493,0.009740135,0.037263937],"study_design_scores_gemma":[0.000022579905,0.000016217571,0.00012440262,0.000030789284,0.000018643663,0.00010423463,0.0001123089,0.010790871,0.0005482291,0.9826973,0.005524204,0.000010218107],"about_ca_topic_score_codex":0.0015977641,"about_ca_topic_score_gemma":0.002786919,"teacher_disagreement_score":0.019025052,"about_ca_system_score_codex":0.0016500972,"about_ca_system_score_gemma":0.0007938486,"threshold_uncertainty_score":0.063645184},"labels":[],"label_agreement":null},{"id":"W2157516444","doi":"10.1016/j.disc.2008.09.016","title":"Regular graphs are not universal fixers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Discrete mathematics; Domination analysis","score_opus":0.03252796891485716,"score_gpt":0.2708205054394022,"score_spread":0.23829253652454507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157516444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5500957,0.00417702,0.24009182,0.006465535,0.0010899905,0.00029179003,0.0012866433,0.0034406576,0.19306079],"genre_scores_gemma":[0.9221915,0.001561267,0.030111391,0.0012760251,0.0003758597,0.00028212782,0.00097453035,0.00089747127,0.042329896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712425,0.0003075218,0.00013951954,0.0011398,0.0004622666,0.0008266058],"domain_scores_gemma":[0.9877643,0.0057081603,0.0011320678,0.0031203802,0.0011348086,0.0011403572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026356783,0.0012903805,0.0029988065,0.0039508413,0.0053596417,0.007329027,0.0024621917,0.0037964804,0.01611282],"category_scores_gemma":[0.011972656,0.0027879144,0.0027464791,0.0024792454,0.009921391,0.020347327,0.008348559,0.0063238377,0.0019969114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007686426,0.000019540874,0.00039060623,0.00007810172,0.00004459572,0.00006893268,0.00036263067,0.00040831548,0.0005938511,0.99258065,0.0013746665,0.0040011676],"study_design_scores_gemma":[0.000039891765,0.000018020162,0.00026947967,0.00003776545,0.00006774548,0.00016897464,0.0003065583,0.00088591326,0.00091782486,0.99200094,0.005259982,0.000027029728],"about_ca_topic_score_codex":0.0016312025,"about_ca_topic_score_gemma":0.001696328,"teacher_disagreement_score":0.01611282,"about_ca_system_score_codex":0.002810836,"about_ca_system_score_gemma":0.0009837478,"threshold_uncertainty_score":0.053902805},"labels":[],"label_agreement":null},{"id":"W2158650522","doi":"10.2478/s12175-012-0033-x","title":"Foolproof eternal domination in the all-guards move model","year":2012,"lang":"en","type":"article","venue":"Mathematica Slovaca","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Guard (computer science); Vertex (graph theory); Combinatorics; Mathematics; Graph; Computer science","score_opus":0.0501408267125466,"score_gpt":0.3358446225101964,"score_spread":0.2857037957976498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158650522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.628717,0.00062851515,0.32565695,0.0034467538,0.00011535279,0.000101402955,0.000588901,0.00036263684,0.040382493],"genre_scores_gemma":[0.9810931,0.00020105662,0.009521515,0.00029114794,0.0000765026,0.000056320732,0.00018978848,0.0000567288,0.008513874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874276,0.00037000608,0.000045631325,0.00028373708,0.00023499175,0.00032287958],"domain_scores_gemma":[0.9948078,0.002966181,0.0005577229,0.00081250723,0.0003307911,0.0005250689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014839727,0.00055093155,0.0008047152,0.00058266975,0.0013093599,0.0016339328,0.0018402928,0.0013324172,0.0070529305],"category_scores_gemma":[0.005333326,0.00031262686,0.00090454967,0.0006321661,0.0029555063,0.0039396808,0.0021088568,0.0020006143,0.000409978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025566024,0.0000886117,0.0012261211,0.000118100994,0.000074542644,0.00044000405,0.0005213286,0.08373611,0.0047226413,0.8957539,0.0041983672,0.008864516],"study_design_scores_gemma":[0.00008543584,0.00004405643,0.00040692685,0.000015873055,0.000029165878,0.00021431873,0.00019154459,0.19790383,0.001701625,0.7957773,0.0036047439,0.000025265144],"about_ca_topic_score_codex":0.003259565,"about_ca_topic_score_gemma":0.0028202343,"teacher_disagreement_score":0.0070529305,"about_ca_system_score_codex":0.0015091527,"about_ca_system_score_gemma":0.0007235494,"threshold_uncertainty_score":0.02359438},"labels":[],"label_agreement":null},{"id":"W2160146903","doi":"10.1287/moor.1070.0254","title":"The Demand-Matching Problem","year":2007,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bipartite graph; Mathematics; Knapsack problem; Cardinality (data modeling); Matching (statistics); Combinatorics; Tree (set theory); Clos network; Discrete mathematics; Approximation algorithm; Time complexity; Node (physics); 3-dimensional matching; Mathematical optimization; Graph; Computer science","score_opus":0.07242089226921299,"score_gpt":0.4165825610196921,"score_spread":0.3441616687504791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160146903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058965065,0.0017419488,0.8370247,0.009193605,0.0005197439,0.00073344936,0.004402379,0.00060555607,0.08681356],"genre_scores_gemma":[0.59270465,0.0038195509,0.34202078,0.001994025,0.00091313315,0.00093795086,0.0075409613,0.0005393058,0.049529642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976948,0.0008504767,0.00014082502,0.0005583831,0.00040848364,0.0003469473],"domain_scores_gemma":[0.99760723,0.0014621667,0.00022974247,0.0002613891,0.00020341753,0.00023607875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020470258,0.0012246292,0.0014520087,0.0008021856,0.0011363281,0.0033742145,0.00272876,0.0039795116,0.026455512],"category_scores_gemma":[0.006537085,0.0007078254,0.0011489239,0.0022949993,0.0008971564,0.007811904,0.0025719444,0.0024690302,0.0030313823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042785553,0.00053986546,0.0012488309,0.0007792002,0.00012541401,0.00035274847,0.000223814,0.12050216,0.002240437,0.7328247,0.0492887,0.09144631],"study_design_scores_gemma":[0.00013763898,0.00016185665,0.0004886585,0.0000879049,0.00004835321,0.00060951215,0.0003534044,0.3174341,0.0017063278,0.611775,0.06716072,0.000036519596],"about_ca_topic_score_codex":0.0012554444,"about_ca_topic_score_gemma":0.0011399954,"teacher_disagreement_score":0.026455512,"about_ca_system_score_codex":0.0017368103,"about_ca_system_score_gemma":0.0012545778,"threshold_uncertainty_score":0.08850253},"labels":[],"label_agreement":null},{"id":"W2161005000","doi":"10.1016/j.jctb.2007.02.005","title":"Excluding a planar graph from<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">GF</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-representable matroids","year":2007,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Scroll; Graphic matroid; Combinatorics; Antichain; Matroid partitioning; Mathematics; Oriented matroid; Binary number; Graph; Planar graph; Discrete mathematics; Partially ordered set; Arithmetic","score_opus":0.01835145302768177,"score_gpt":0.259835901032013,"score_spread":0.24148444800433122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161005000","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085531995,0.00046494533,0.289151,0.0058822962,0.0014294554,0.00038470366,0.012065197,0.007599636,0.5974907],"genre_scores_gemma":[0.42819288,0.001225529,0.18661264,0.0017383088,0.00048996217,0.0002992949,0.032240957,0.0045753634,0.34462506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971455,0.000040026287,0.000017947803,0.00007251703,0.000087900815,0.000066945875],"domain_scores_gemma":[0.9990785,0.00028554918,0.00010018146,0.0002402431,0.00021671229,0.00007871534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018167325,0.00079403317,0.00047491357,0.0007505986,0.0012518776,0.0021979786,0.00096135575,0.00090239244,0.073117636],"category_scores_gemma":[0.001825931,0.00037337912,0.0006888634,0.0012598293,0.00076162367,0.002702668,0.0014690744,0.001772303,0.0266673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005558661,0.0001676357,0.001058341,0.00063250214,0.00005093396,0.0013748133,0.0005913443,0.0045380695,0.02469347,0.5099541,0.25605395,0.200329],"study_design_scores_gemma":[0.00009368846,0.00010347142,0.0017187477,0.00014201563,0.00006018691,0.0014952339,0.0003232238,0.012314855,0.035423473,0.37351444,0.57475144,0.000059123184],"about_ca_topic_score_codex":0.0029301278,"about_ca_topic_score_gemma":0.0040316638,"teacher_disagreement_score":0.073117636,"about_ca_system_score_codex":0.0007771494,"about_ca_system_score_gemma":0.0008752158,"threshold_uncertainty_score":0.24460286},"labels":[],"label_agreement":null},{"id":"W2161217328","doi":"10.1016/j.comgeo.2012.10.012","title":"Making triangulations 4-connected using flips","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Triangulation; Upper and lower bounds; Mathematics; Matching (statistics); Enhanced Data Rates for GSM Evolution; Graph; Connectivity; Discrete mathematics; Computer science; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.12301935982546466,"score_gpt":0.3872212644220547,"score_spread":0.26420190459659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161217328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13470285,0.00029963616,0.8211379,0.0006151184,0.0005835316,0.0002304693,0.00037033486,0.001597507,0.04046271],"genre_scores_gemma":[0.516205,0.0006108627,0.45313272,0.00040484424,0.00019517409,0.00031102356,0.0007062377,0.0014317894,0.027002398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992186,0.00014299172,0.000048675032,0.00021656168,0.0002354616,0.00013758331],"domain_scores_gemma":[0.99819607,0.0006129655,0.00015641288,0.0006026342,0.00024569937,0.00018628506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005577288,0.0012210923,0.00096486736,0.0018600523,0.0013588443,0.0016174559,0.0015458569,0.0013666385,0.02076982],"category_scores_gemma":[0.0038687163,0.0010815808,0.0012951449,0.0013111333,0.0024704237,0.0036231931,0.005196805,0.0025599648,0.0032620819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044325538,0.00015932652,0.0011136682,0.0005186729,0.00010296668,0.00048754,0.0013350962,0.053523347,0.0344138,0.63046277,0.011167957,0.2662715],"study_design_scores_gemma":[0.00011296829,0.0001863012,0.00052164996,0.00013288773,0.000086113876,0.00031388883,0.0009603981,0.09286757,0.019855581,0.84216833,0.042729683,0.00006450763],"about_ca_topic_score_codex":0.0010409128,"about_ca_topic_score_gemma":0.0019948331,"teacher_disagreement_score":0.02076982,"about_ca_system_score_codex":0.00062038715,"about_ca_system_score_gemma":0.00039052436,"threshold_uncertainty_score":0.06948191},"labels":[],"label_agreement":null},{"id":"W2162051090","doi":"10.1016/j.jctb.2005.09.005","title":"On Rota's conjecture and excluded minors containing large projective geometries","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Minor (academic); Matroid; Conjecture; Projective test; Projective plane; Combinatorics; Projective geometry; Mathematics; Class (philosophy); Finite geometry; Projective space; Pure mathematics; Algebraic geometry; Geometry; Computer science; Art; Artificial intelligence; Humanities","score_opus":0.010669057554638726,"score_gpt":0.2770127638668002,"score_spread":0.2663437063121615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162051090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65853137,0.00266041,0.073801905,0.021596419,0.0013416259,0.00018566358,0.0016904587,0.0010698327,0.23912232],"genre_scores_gemma":[0.96241206,0.0010991796,0.014039884,0.001787706,0.0013734611,0.00016106594,0.0019244567,0.00023988869,0.016962292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730116,0.0008404995,0.00015752055,0.0007019355,0.00049902825,0.00049996714],"domain_scores_gemma":[0.98724943,0.008468056,0.0012211119,0.001552725,0.00057866256,0.00093003217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002458481,0.0014172494,0.0033320845,0.0024709112,0.00662519,0.0072999476,0.0033056727,0.0048663616,0.015085368],"category_scores_gemma":[0.012997586,0.0016772544,0.0022685132,0.0031622115,0.009108083,0.016986879,0.006592726,0.00641046,0.002187174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017613322,0.000058473564,0.0010268089,0.00010771275,0.00001721955,0.00023139847,0.00060544215,0.0011916759,0.0004969324,0.9869915,0.005742514,0.0033540986],"study_design_scores_gemma":[0.0000465355,0.000017381552,0.000331196,0.000017675487,0.000010603255,0.00017283755,0.00018576001,0.002078033,0.00015898005,0.9942754,0.002690505,0.000015182436],"about_ca_topic_score_codex":0.0019370873,"about_ca_topic_score_gemma":0.0020896213,"teacher_disagreement_score":0.015085368,"about_ca_system_score_codex":0.0016862346,"about_ca_system_score_gemma":0.0009188639,"threshold_uncertainty_score":0.050465584},"labels":[],"label_agreement":null},{"id":"W2162059435","doi":"10.1186/s13173-015-0036-x","title":"Complexity of greedy edge-colouring","year":2015,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Combinatorics; Graph; Time complexity; Enhanced Data Rates for GSM Evolution; Mathematics; Greedy algorithm; Computer science; Index (typography); Discrete mathematics; Algorithm; Artificial intelligence","score_opus":0.06586970787758335,"score_gpt":0.3041930945483636,"score_spread":0.23832338667078024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162059435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69304645,0.0011755374,0.24434693,0.007785218,0.0001907704,0.0009892919,0.007495362,0.0053104474,0.039659955],"genre_scores_gemma":[0.82284486,0.00071473455,0.15970708,0.00077952305,0.00010135999,0.00041565084,0.0064145764,0.0007891618,0.0082330275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708456,0.0005865966,0.00017877805,0.00082937925,0.0005866374,0.0007341708],"domain_scores_gemma":[0.98960555,0.007674724,0.00064320525,0.001234779,0.00036407853,0.0004777774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013069821,0.0012257152,0.0023199618,0.000972523,0.0019460752,0.0053698397,0.0036816332,0.0025554078,0.0143012395],"category_scores_gemma":[0.009666537,0.000884863,0.002505294,0.0025708864,0.0017327615,0.0059211818,0.0035144764,0.0019002307,0.002033311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026862144,0.00095061515,0.012645413,0.0023193555,0.00046777356,0.0012503207,0.0017509161,0.53290147,0.038337033,0.12405846,0.04850827,0.23412415],"study_design_scores_gemma":[0.00049919717,0.000155365,0.0030271604,0.000071945804,0.00019708951,0.0006526997,0.0007188217,0.72752047,0.008336406,0.25381315,0.0049391286,0.00006852597],"about_ca_topic_score_codex":0.009402671,"about_ca_topic_score_gemma":0.0074523464,"teacher_disagreement_score":0.0143012395,"about_ca_system_score_codex":0.003407645,"about_ca_system_score_gemma":0.003611875,"threshold_uncertainty_score":0.047842443},"labels":[],"label_agreement":null},{"id":"W2162312358","doi":"10.1016/j.tcs.2008.11.008","title":"Local edge colouring of Yao-like subgraphs of Unit Disk Graphs","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; University of Ottawa; Université du Québec en Outaouais","funders":"","keywords":"Combinatorics; Mathematics; Unit disk graph; Unit disk; Graph; Discrete mathematics; Partition (number theory); Constant (computer programming); Locality; Computer science","score_opus":0.021918745402650586,"score_gpt":0.27866484541387604,"score_spread":0.25674610001122544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162312358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9614497,0.0001433523,0.028645916,0.00026661504,0.00001401905,0.000026147607,0.000152436,0.00013961073,0.0091623245],"genre_scores_gemma":[0.9844141,0.00010263949,0.010709263,0.00006651496,0.0000145912045,0.000042872194,0.00027144482,0.00007225131,0.004306463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997019,0.00009794209,0.000014215938,0.00007560321,0.000050955085,0.00005935754],"domain_scores_gemma":[0.9974171,0.0011988692,0.00046165238,0.00032362784,0.00024365309,0.00035511173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033777664,0.00022777363,0.00060685835,0.00087800436,0.0012321145,0.0014221579,0.0009869528,0.00082480744,0.004572729],"category_scores_gemma":[0.0028637198,0.0003869003,0.00029779345,0.001058514,0.0010804007,0.001982817,0.0011017638,0.00082578225,0.00032905606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010889601,0.00019127388,0.010022007,0.000307162,0.000048862526,0.0006479947,0.0017889771,0.030357797,0.050612826,0.87463415,0.003721303,0.026578667],"study_design_scores_gemma":[0.00015033338,0.00013252712,0.00686529,0.00005544535,0.000078610894,0.0005575573,0.0009059145,0.10575804,0.013766137,0.86708844,0.0045949924,0.00004673265],"about_ca_topic_score_codex":0.0010254268,"about_ca_topic_score_gemma":0.0019022912,"teacher_disagreement_score":0.004572729,"about_ca_system_score_codex":0.00060004694,"about_ca_system_score_gemma":0.0002980951,"threshold_uncertainty_score":0.015297294},"labels":[],"label_agreement":null},{"id":"W2162598482","doi":"10.1006/jctb.2000.1963","title":"The Excluded Minors for GF(4)-Representable Matroids","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; GF(2); Mathematics; Computer science; Finite field","score_opus":0.012505341486421347,"score_gpt":0.28252195724150875,"score_spread":0.2700166157550874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162598482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8585911,0.00038796783,0.07593228,0.0016875729,0.00023652258,0.00016623613,0.00082313846,0.0004146151,0.06176061],"genre_scores_gemma":[0.9546766,0.0002922558,0.023076186,0.00029554407,0.00028561807,0.0001524661,0.0009476266,0.00015874102,0.0201149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991648,0.00022759182,0.00005973344,0.00013087995,0.00023373097,0.00018340297],"domain_scores_gemma":[0.9971468,0.0013066757,0.00052500877,0.0003558925,0.0003055957,0.0003599702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006375524,0.0007116375,0.0006453807,0.0010286572,0.0020028166,0.0034938282,0.0009849342,0.00096729695,0.008137376],"category_scores_gemma":[0.0034577518,0.00057679723,0.0008254475,0.00098887,0.0014626154,0.0025348486,0.0012065191,0.0019085204,0.0014842588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010287847,0.0003665131,0.0017617241,0.00022362891,0.00005446188,0.0010104523,0.0014164547,0.0063179573,0.01975863,0.9165276,0.011514209,0.040019576],"study_design_scores_gemma":[0.00012118682,0.00014224972,0.00088365504,0.000033118944,0.000030422416,0.00074614416,0.00028028412,0.018965367,0.0050340747,0.9630213,0.010708192,0.00003405103],"about_ca_topic_score_codex":0.00073306303,"about_ca_topic_score_gemma":0.0012877482,"teacher_disagreement_score":0.008137376,"about_ca_system_score_codex":0.0008212896,"about_ca_system_score_gemma":0.0007318946,"threshold_uncertainty_score":0.027222216},"labels":[],"label_agreement":null},{"id":"W2162824303","doi":"10.1007/978-3-540-77294-1_4","title":"Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Combinatorics; Greedy algorithm; Degree (music); Graph; Random graph; Mathematics; Discrete mathematics; Algorithm; Physics","score_opus":0.042706764647804936,"score_gpt":0.29052877326854437,"score_spread":0.24782200862073944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162824303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025520222,0.00025717862,0.9689042,0.00020618054,0.00015325675,0.00015682605,0.00012836969,0.0017980592,0.002875652],"genre_scores_gemma":[0.11371489,0.00019384924,0.8785407,0.0001681638,0.00007345481,0.00019503545,0.0003938472,0.0006040047,0.0061159795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886,0.00018398264,0.00006614425,0.0003409487,0.00041104635,0.00013798456],"domain_scores_gemma":[0.99621814,0.0016083856,0.00016128599,0.0014360206,0.0003239437,0.0002521791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012644081,0.0011899875,0.002769743,0.0019182384,0.0014597081,0.0013815331,0.0031531712,0.00258793,0.007741935],"category_scores_gemma":[0.0075247693,0.0013531445,0.002365935,0.002032213,0.0013454574,0.0024890369,0.0050328863,0.0021246,0.0022424872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087334693,0.000432017,0.0021116943,0.0006997118,0.00023535645,0.00027804886,0.00040251037,0.2920723,0.042521924,0.0728759,0.016814487,0.5706828],"study_design_scores_gemma":[0.00012964431,0.000120205696,0.0003297972,0.000034266857,0.00005364393,0.00019755356,0.00010906156,0.9257614,0.0077714846,0.06030539,0.005152097,0.000035478086],"about_ca_topic_score_codex":0.0017446023,"about_ca_topic_score_gemma":0.003008003,"teacher_disagreement_score":0.007741935,"about_ca_system_score_codex":0.00073131104,"about_ca_system_score_gemma":0.00094209705,"threshold_uncertainty_score":0.02589935},"labels":[],"label_agreement":null},{"id":"W2163677687","doi":"10.1109/ncm.2009.386","title":"Kernel-Perfection through the Push Operation","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Digraph; Combinatorics; Kernel (algebra); Vertex (graph theory); Mathematics; Directed graph; Graph; Discrete mathematics; Polynomial kernel; Computer science; Kernel method; Artificial intelligence","score_opus":0.024226503447801997,"score_gpt":0.3154273556168349,"score_spread":0.2912008521690329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163677687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48066628,0.00053160347,0.4801451,0.001227228,0.00012809662,0.00029764106,0.0009590705,0.002221926,0.03382305],"genre_scores_gemma":[0.9334322,0.00028171216,0.0602811,0.0001913854,0.00005298321,0.000074870164,0.00041331045,0.00011711232,0.0051553636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809617,0.00028928468,0.0001839079,0.00066568766,0.00035767435,0.00040731538],"domain_scores_gemma":[0.9955788,0.0022513266,0.00040681168,0.0010829793,0.00032564538,0.00035429606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015171777,0.00045425294,0.00073078397,0.0005337071,0.0012103618,0.0028555768,0.00082660414,0.0006830749,0.0043224897],"category_scores_gemma":[0.005044794,0.0006228627,0.0012006407,0.0006012193,0.0033697148,0.007400001,0.003470199,0.0015527037,0.00050024455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006208123,0.00013921007,0.0035875246,0.00036107138,0.00008046801,0.0006195271,0.0012021597,0.029451752,0.013861861,0.8744557,0.0033757922,0.072244175],"study_design_scores_gemma":[0.000111920664,0.00029155778,0.0013531368,0.00005718299,0.0001391611,0.00059436844,0.00048134982,0.07489277,0.023746673,0.8852523,0.013002329,0.00007724444],"about_ca_topic_score_codex":0.002141818,"about_ca_topic_score_gemma":0.001885777,"teacher_disagreement_score":0.0043224897,"about_ca_system_score_codex":0.001317796,"about_ca_system_score_gemma":0.0014238477,"threshold_uncertainty_score":0.014460206},"labels":[],"label_agreement":null},{"id":"W2164463888","doi":"10.1016/j.ejc.2011.09.011","title":"Cyclic colorings of plane graphs with independent faces","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Fractional coloring; Complete coloring; Disjoint sets; Greedy coloring; List coloring; Vertex (graph theory); Plane (geometry); Graph; Discrete mathematics; Graph power; Geometry; Line graph","score_opus":0.030710658112959862,"score_gpt":0.23383085010427274,"score_spread":0.20312019199131287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164463888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84417236,0.0006274872,0.09125254,0.0011463859,0.00028542322,0.00015007691,0.0008869772,0.00049310783,0.060985755],"genre_scores_gemma":[0.9239477,0.0007372009,0.051088337,0.0005371146,0.00022762436,0.00023111173,0.0017676774,0.00037280956,0.02109035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992205,0.00019651651,0.000037268263,0.00014501651,0.00015608114,0.00024467116],"domain_scores_gemma":[0.9961041,0.0018300794,0.00063857104,0.00046500826,0.00038006582,0.00058209297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051408337,0.0006658923,0.0006176473,0.0015492995,0.0017966965,0.0025705146,0.0015615566,0.0011392073,0.009705337],"category_scores_gemma":[0.003025038,0.0011235554,0.0009419691,0.001960689,0.001515191,0.0016954674,0.0014940341,0.0019203548,0.0009528756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006604533,0.00021242065,0.0037876398,0.00023244297,0.000075523305,0.0008599878,0.0013074221,0.018652244,0.014606136,0.9097792,0.0133011,0.0365254],"study_design_scores_gemma":[0.00017311705,0.00011646929,0.0030720192,0.00007038812,0.00009041152,0.0005905459,0.00071229215,0.043272126,0.0056425487,0.93096125,0.015239444,0.000059516533],"about_ca_topic_score_codex":0.0046301554,"about_ca_topic_score_gemma":0.006275898,"teacher_disagreement_score":0.009705337,"about_ca_system_score_codex":0.0014577648,"about_ca_system_score_gemma":0.0010669769,"threshold_uncertainty_score":0.032467604},"labels":[],"label_agreement":null},{"id":"W2165037031","doi":"10.1016/j.tcs.2015.01.011","title":"On graphs that are not PCGs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Wheel graph; Vertex (graph theory); Graph; Path graph; Graph power; Pairwise comparison; Planar graph; Discrete mathematics; Line graph","score_opus":0.049060207401457154,"score_gpt":0.31182620543233247,"score_spread":0.2627659980308753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165037031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5945488,0.0016138469,0.19931953,0.0058804583,0.00060782116,0.00037273724,0.0020755855,0.00091066555,0.19467062],"genre_scores_gemma":[0.8616298,0.0013108453,0.065701865,0.0015527566,0.00047180618,0.0002822697,0.0037016515,0.0005935302,0.06475545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984755,0.00034386854,0.00006458308,0.00044478558,0.0002985568,0.0003726675],"domain_scores_gemma":[0.9887134,0.0059160786,0.0010487899,0.0020334464,0.0011893872,0.0010990396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010694325,0.0011123217,0.0015518501,0.0024987974,0.0039610695,0.003932087,0.0016262191,0.0024289237,0.01188311],"category_scores_gemma":[0.009135107,0.001183437,0.0013550023,0.0032309853,0.0032742382,0.008393005,0.003079387,0.003885551,0.0013159693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023041652,0.00007701818,0.001239723,0.00023364565,0.00003558034,0.00026938244,0.00047721606,0.0090162875,0.0018624631,0.96730053,0.006763011,0.012494778],"study_design_scores_gemma":[0.000022017452,0.000021591575,0.0004079307,0.0000465885,0.000020367746,0.00015198751,0.00020807936,0.010884035,0.0006779043,0.9829847,0.004563763,0.000011022892],"about_ca_topic_score_codex":0.004395576,"about_ca_topic_score_gemma":0.0066568977,"teacher_disagreement_score":0.01188311,"about_ca_system_score_codex":0.0019345484,"about_ca_system_score_gemma":0.0012208364,"threshold_uncertainty_score":0.03975296},"labels":[],"label_agreement":null},{"id":"W2165079333","doi":"10.7151/dmgt.1409","title":"A note on domination parameters in random graphs","year":2008,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Rogers Communications (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Random graph; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.0239342018942265,"score_gpt":0.2893510288309336,"score_spread":0.2654168269367071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165079333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35492375,0.03180016,0.4474709,0.014939441,0.0016393478,0.00016972597,0.0008732409,0.0014850255,0.1466985],"genre_scores_gemma":[0.9826744,0.0033304829,0.007791187,0.00080486765,0.0009928265,0.000095678115,0.00012804307,0.00021440256,0.0039680805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977842,0.0011212963,0.00007102078,0.00036858013,0.00050655805,0.00014829825],"domain_scores_gemma":[0.94338155,0.047628704,0.0026100548,0.0030984322,0.0019404605,0.0013407449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004386864,0.00080812635,0.0012756676,0.0023913602,0.0011662436,0.002614052,0.0016416305,0.0017059677,0.004863389],"category_scores_gemma":[0.05009565,0.0005277897,0.00066523236,0.002098844,0.0036004507,0.005387191,0.0024630292,0.0035095382,0.00046750205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015609311,0.00003890615,0.0047803544,0.0002623768,0.00010857698,0.0005879835,0.00044840085,0.043637887,0.0035582865,0.91877836,0.0097850915,0.0178578],"study_design_scores_gemma":[0.000041322022,0.00006141435,0.0034866924,0.00012522565,0.000060951174,0.000688376,0.00011466886,0.12518539,0.0011835143,0.8591988,0.009767012,0.00008652192],"about_ca_topic_score_codex":0.0012880592,"about_ca_topic_score_gemma":0.0007999627,"teacher_disagreement_score":0.004863389,"about_ca_system_score_codex":0.0017810244,"about_ca_system_score_gemma":0.000431997,"threshold_uncertainty_score":0.023200214},"labels":[],"label_agreement":null},{"id":"W2165352378","doi":"10.5555/1070432.1070490","title":"An O(VE) algorithm for ear decompositions of matching-covered graphs","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partition (number theory); Matching (statistics); Algorithm; Running time; Computer science; Mathematics; Blossom algorithm; Combinatorics; Discrete mathematics","score_opus":0.013238446397571412,"score_gpt":0.30807813828255165,"score_spread":0.2948396918849802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165352378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025238717,0.00014420041,0.9656743,0.00019854258,0.000038323386,0.00019681628,0.00024835768,0.003833368,0.0044273576],"genre_scores_gemma":[0.14876772,0.00016591075,0.8439843,0.00019878971,0.00004819988,0.00038898134,0.0016018884,0.0005318879,0.004312278],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987036,0.00020997894,0.000092937706,0.0003334629,0.00032564104,0.00033429332],"domain_scores_gemma":[0.9982009,0.00071322377,0.00015234292,0.0006248937,0.00017678982,0.00013177881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007518604,0.0010830212,0.00092281256,0.0012505953,0.0008764563,0.001446863,0.0018568187,0.0011746007,0.011392022],"category_scores_gemma":[0.0034320527,0.0006018738,0.001464559,0.001465334,0.00080878544,0.003666106,0.003554527,0.001770427,0.0035469483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010387562,0.00056545396,0.001972594,0.00063875585,0.0001226076,0.00021975073,0.0005937877,0.067145176,0.043595254,0.10045222,0.021997182,0.7616585],"study_design_scores_gemma":[0.00038416687,0.00047463682,0.0016922553,0.00007264752,0.00012947117,0.00067419774,0.0003941091,0.6802628,0.030635344,0.25551677,0.02967066,0.00009284584],"about_ca_topic_score_codex":0.0015347959,"about_ca_topic_score_gemma":0.0026100047,"teacher_disagreement_score":0.011392022,"about_ca_system_score_codex":0.0010014242,"about_ca_system_score_gemma":0.0013922361,"threshold_uncertainty_score":0.038110137},"labels":[],"label_agreement":null},{"id":"W2165426231","doi":"10.1016/s0012-365x(03)00086-4","title":"Homomorphisms and oriented colorings of equivalence classes of oriented graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Chromatic scale; Friendship graph; Windmill graph; Discrete mathematics; Digraph; Vertex (graph theory); Integer (computer science); Critical graph; Graph; Equivalence (formal languages); Graph homomorphism; Line graph; Graph power; Computer science","score_opus":0.023863299157697044,"score_gpt":0.289789815704448,"score_spread":0.265926516546751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165426231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82761204,0.000491999,0.13771632,0.00078147877,0.00028256667,0.000097136515,0.00029504372,0.0003520436,0.032371353],"genre_scores_gemma":[0.96324956,0.000444364,0.02700508,0.0002897888,0.00027852508,0.00011784129,0.00045953202,0.00016513195,0.007990151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888986,0.00029962193,0.00006774042,0.0002968695,0.00018106212,0.00026483255],"domain_scores_gemma":[0.9955402,0.0022914852,0.00067042984,0.0004465649,0.0003069115,0.00074442814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012460349,0.0005887844,0.0006214251,0.0024693322,0.001999393,0.0033986468,0.001442129,0.00097266346,0.004384232],"category_scores_gemma":[0.0048454213,0.0009489815,0.0011441762,0.0014882697,0.0033615734,0.0054310937,0.0021165493,0.0026218875,0.00042595688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115184026,0.000115897055,0.0015911579,0.000044839853,0.000017152544,0.00014246421,0.001264364,0.0013883681,0.0018836175,0.98089385,0.0008218371,0.011721386],"study_design_scores_gemma":[0.000031056952,0.000024446512,0.0008888543,0.000013038438,0.00001861441,0.000121204794,0.0003538767,0.0033287436,0.0007936163,0.9926206,0.0017920188,0.000013952283],"about_ca_topic_score_codex":0.0016780588,"about_ca_topic_score_gemma":0.0016584835,"teacher_disagreement_score":0.004384232,"about_ca_system_score_codex":0.0013221117,"about_ca_system_score_gemma":0.00065621175,"threshold_uncertainty_score":0.0146666765},"labels":[],"label_agreement":null},{"id":"W2165528704","doi":"10.2168/lmcs-3(4:6)2007","title":"A Characterisation of First-Order Constraint Satisfaction Problems","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of the Fraser Valley; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Constraint satisfaction problem; Decidability; Simple (philosophy); Algebraic number; Constraint satisfaction; Mathematics; Time complexity; Order (exchange); Constraint (computer-aided design); Backtracking; Discrete mathematics; Computer science; Combinatorics; Algorithm","score_opus":0.08219768287444364,"score_gpt":0.41224126299265734,"score_spread":0.3300435801182137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165528704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05468134,0.0009651224,0.9107187,0.002630507,0.00008809124,0.00024787572,0.0006400687,0.0007160405,0.029312277],"genre_scores_gemma":[0.6091107,0.0012557111,0.37585253,0.0009806174,0.00030115256,0.00051889796,0.0013315819,0.00018780904,0.010461071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974383,0.0006552838,0.00017520296,0.00069139595,0.0007110271,0.00032882625],"domain_scores_gemma":[0.9914698,0.006150888,0.0007442897,0.00071507297,0.00054984994,0.00037010162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016850855,0.00079343305,0.00081871223,0.0015847152,0.0012653087,0.0036779197,0.0018103799,0.0012354767,0.005053286],"category_scores_gemma":[0.006709483,0.0005039164,0.0014591202,0.0024356851,0.0046867956,0.007907329,0.002329062,0.005050889,0.00055195496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028246759,0.000065145134,0.00048685272,0.00019424946,0.000017591343,0.00014073765,0.0004253374,0.009674511,0.002078787,0.96595865,0.0013723475,0.019557523],"study_design_scores_gemma":[0.00002477807,0.00003864093,0.0003988173,0.000046467303,0.000014274965,0.0003257379,0.00019349581,0.049849115,0.0029741626,0.9315295,0.014574885,0.000030100877],"about_ca_topic_score_codex":0.0017245864,"about_ca_topic_score_gemma":0.0017444786,"teacher_disagreement_score":0.005053286,"about_ca_system_score_codex":0.0020780812,"about_ca_system_score_gemma":0.0018249541,"threshold_uncertainty_score":0.01690489},"labels":[],"label_agreement":null},{"id":"W2166530698","doi":"10.1016/s0012-365x(02)00802-6","title":"An improved upper bound for queens domination numbers","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Domination analysis; Discrete mathematics; Graph; Vertex (graph theory); Mathematical analysis","score_opus":0.01858940680374713,"score_gpt":0.32251044383524996,"score_spread":0.3039210370315028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166530698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048818763,0.01448402,0.7050486,0.010666484,0.0040972363,0.0005555778,0.0039665597,0.005665775,0.2066969],"genre_scores_gemma":[0.43450198,0.0092774695,0.44461396,0.0050017633,0.0068016355,0.0016824524,0.005309723,0.0038494677,0.08896167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9868947,0.0020086302,0.00047989198,0.0025855184,0.0053810673,0.0026502116],"domain_scores_gemma":[0.9652654,0.02396479,0.0007504471,0.005615108,0.0027048243,0.0016994097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069348644,0.0046640863,0.00471037,0.0074802553,0.0042104907,0.01126754,0.012543419,0.004832562,0.040946957],"category_scores_gemma":[0.03319966,0.0023274014,0.0039504976,0.0071357246,0.0049054543,0.018211087,0.011626526,0.014926283,0.012623701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026902228,0.0010601422,0.0034495,0.0018094594,0.00032053312,0.00067502836,0.0010153875,0.103151575,0.027596954,0.520142,0.09005983,0.24802937],"study_design_scores_gemma":[0.00023384053,0.00029626844,0.002303752,0.00043573612,0.00036180989,0.0005527172,0.00019897279,0.32982424,0.015251873,0.59818584,0.052115012,0.00023984155],"about_ca_topic_score_codex":0.0038848585,"about_ca_topic_score_gemma":0.0069565056,"teacher_disagreement_score":0.040946957,"about_ca_system_score_codex":0.0080866935,"about_ca_system_score_gemma":0.0041051153,"threshold_uncertainty_score":0.13698125},"labels":[],"label_agreement":null},{"id":"W2167228424","doi":"10.1016/j.disc.2007.10.022","title":"On <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si20.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-transversals of chordal graphs","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Transversal (combinatorics); Chordal graph; Mathematics; Combinatorics; Graph; Algorithm; Discrete mathematics; Mathematical analysis","score_opus":0.02070235063290941,"score_gpt":0.2688354726682089,"score_spread":0.2481331220352995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167228424","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017399959,0.0007120963,0.055926807,0.0040651797,0.0021360433,0.0003608432,0.091996685,0.05754527,0.785517],"genre_scores_gemma":[0.017804073,0.002415188,0.035750683,0.0019096911,0.0010175442,0.00044049788,0.10891631,0.05953922,0.7722068],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994646,0.00007777047,0.000038395152,0.00008704573,0.00027045258,0.000061824816],"domain_scores_gemma":[0.99852693,0.00050997495,0.000082040744,0.0002725636,0.0004292401,0.00017929194],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062727265,0.0014877163,0.0013345166,0.0027870622,0.0010736847,0.0052912557,0.0024391226,0.0012282412,0.7800867],"category_scores_gemma":[0.003369031,0.000818759,0.0011820591,0.005034654,0.00070405327,0.0046291337,0.0025207635,0.0024304641,0.6259487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008403862,0.000039207098,0.00012663256,0.00021452138,0.000009297807,0.000049120987,0.00009792034,0.0002654572,0.001127232,0.018545188,0.93241143,0.047029994],"study_design_scores_gemma":[0.000047618898,0.000016377755,0.0009074339,0.00011707742,0.000008900069,0.00009401444,0.00008695586,0.0012663954,0.0018284384,0.01725831,0.97833997,0.000028458659],"about_ca_topic_score_codex":0.010095899,"about_ca_topic_score_gemma":0.012963856,"teacher_disagreement_score":0.7800867,"about_ca_system_score_codex":0.0026028955,"about_ca_system_score_gemma":0.001097341,"threshold_uncertainty_score":0.31367964},"labels":[],"label_agreement":null},{"id":"W2168711306","doi":"10.1109/csie.2009.965","title":"Parameterized VERTEX COVER in Graphs of Small Degree","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Vertex cover; Kernelization; Parameterized complexity; Bounded function; Degree (music); Edge cover; Vertex (graph theory); Feedback vertex set; Computer science; Maximal independent set; Cover (algebra); Independent set; Combinatorics; Mathematics; Approximation algorithm; Theoretical computer science; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.05307331259919727,"score_gpt":0.2975733573013952,"score_spread":0.24450004470219794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168711306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107278,0.00041105074,0.88678026,0.00040090334,0.000026648144,0.000113224196,0.00026454552,0.0011042394,0.0036209882],"genre_scores_gemma":[0.67090994,0.0005298468,0.32303932,0.00012724687,0.00006407736,0.00022521247,0.0010653549,0.00036480054,0.003674111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989661,0.00027089423,0.000040901017,0.00024314178,0.00027170067,0.00020721728],"domain_scores_gemma":[0.9964669,0.0020263745,0.00035862383,0.0008030373,0.00020401875,0.00014097708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075191056,0.00080970116,0.0010828689,0.00107813,0.00092526537,0.001528791,0.002275168,0.0010044469,0.0034053205],"category_scores_gemma":[0.006253696,0.0005391506,0.0010058767,0.0022786388,0.0009600501,0.005318006,0.0020421552,0.0013478692,0.0006563994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041845834,0.00026139882,0.0025240865,0.00036292305,0.00008861547,0.00029631556,0.0003372102,0.67747414,0.014060637,0.11346962,0.0059244884,0.18478218],"study_design_scores_gemma":[0.00003394892,0.000043623877,0.00043785074,0.000018288918,0.000020206991,0.00015231821,0.000058306436,0.8873264,0.005206191,0.10399127,0.0026973842,0.000014334424],"about_ca_topic_score_codex":0.0023395815,"about_ca_topic_score_gemma":0.0033180648,"teacher_disagreement_score":0.0034053205,"about_ca_system_score_codex":0.001320867,"about_ca_system_score_gemma":0.000973177,"threshold_uncertainty_score":0.011391997},"labels":[],"label_agreement":null},{"id":"W2168774808","doi":"10.1007/978-3-319-21840-3_42","title":"Reconfiguration on Sparse Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Control reconfiguration; Theoretical computer science; Embedded system","score_opus":0.05107203587201308,"score_gpt":0.3020614445279913,"score_spread":0.2509894086559782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168774808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19659054,0.004885757,0.40396476,0.0017636872,0.0011043417,0.00018137923,0.00075803325,0.0040386124,0.3867129],"genre_scores_gemma":[0.8287835,0.0038694907,0.084749535,0.0004647845,0.00057932636,0.0002015918,0.0018730031,0.0010124446,0.078466184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982446,0.000036239908,0.000007960016,0.00004127254,0.000052634456,0.00003743867],"domain_scores_gemma":[0.99967146,0.00010934789,0.000036065987,0.00010473048,0.00003649606,0.000041936262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012212171,0.0005256342,0.00046557796,0.0007202166,0.0004257212,0.00077035447,0.0005023774,0.00036460135,0.012351534],"category_scores_gemma":[0.000796804,0.0003185117,0.00034211483,0.0010987441,0.0005597875,0.0014797358,0.001105783,0.00092137663,0.001779871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024272266,0.00007615503,0.00037820742,0.00052513706,0.00003773901,0.00040170667,0.00030010627,0.06239188,0.030024538,0.49547806,0.040983874,0.3691599],"study_design_scores_gemma":[0.000037396287,0.00009483361,0.00060705317,0.00006562852,0.000023485794,0.00051186397,0.0001503949,0.096314974,0.009005572,0.83348924,0.05967336,0.00002616973],"about_ca_topic_score_codex":0.000383161,"about_ca_topic_score_gemma":0.00054776535,"teacher_disagreement_score":0.012351534,"about_ca_system_score_codex":0.00044963058,"about_ca_system_score_gemma":0.00016596312,"threshold_uncertainty_score":0.041320026},"labels":[],"label_agreement":null},{"id":"W2169434358","doi":"10.1016/j.dam.2003.08.012","title":"A note on tolerance graph recognition","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.026813482032105828,"score_gpt":0.2904599598666646,"score_spread":0.2636464778345588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169434358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007217564,0.00832014,0.9331797,0.008570056,0.0067844493,0.00010347566,0.0003421704,0.0026338336,0.032848623],"genre_scores_gemma":[0.15008935,0.01671851,0.7438818,0.005922902,0.009909455,0.000233377,0.0015970559,0.002231562,0.06941596],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806243,0.00024773594,0.00018560796,0.00059032236,0.0007459143,0.00016803996],"domain_scores_gemma":[0.9928294,0.0033876076,0.0001729335,0.002492559,0.0007880016,0.00032956482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012183737,0.0010063761,0.002017551,0.0021467071,0.002019009,0.0042033414,0.0036099385,0.0028776845,0.016330535],"category_scores_gemma":[0.0072263638,0.0007775938,0.0017814958,0.003272463,0.0029911618,0.011605268,0.004158366,0.0056703114,0.0062777093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030171798,0.000117961936,0.00081505853,0.000654519,0.000071326795,0.00048361666,0.00023594445,0.016856184,0.0111496495,0.32673416,0.08409388,0.5584859],"study_design_scores_gemma":[0.00003164821,0.00013126078,0.000870455,0.00019015622,0.00008093825,0.0013896272,0.00024949538,0.070106804,0.015546183,0.7076979,0.2035903,0.00011520475],"about_ca_topic_score_codex":0.003256516,"about_ca_topic_score_gemma":0.003567674,"teacher_disagreement_score":0.016330535,"about_ca_system_score_codex":0.0010969667,"about_ca_system_score_gemma":0.0007394461,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2169487918","doi":"10.1016/j.disc.2011.10.018","title":"Upper bounds for the bondage number of graphs on topological surfaces","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Upper and lower bounds; Genus; Mathematical proof; Domination analysis; Planar graph; Discrete mathematics; Surface (topology); Geometry; Botany; Biology","score_opus":0.06550048523045542,"score_gpt":0.3397857713035316,"score_spread":0.2742852860730762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169487918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34107724,0.013248845,0.3726067,0.011359476,0.0016859327,0.00024643407,0.0022333064,0.002378965,0.25516313],"genre_scores_gemma":[0.8835106,0.00717058,0.075600915,0.00094811013,0.001887172,0.00051599054,0.0014540504,0.0010820522,0.027830468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972977,0.0005790531,0.00010069193,0.00053290545,0.0009907542,0.0004988357],"domain_scores_gemma":[0.9725011,0.019523542,0.0014278807,0.0024800736,0.0013332865,0.0027339556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033398438,0.0027895826,0.0027142123,0.0074076513,0.0033962945,0.0058687897,0.005428367,0.0036934584,0.018961752],"category_scores_gemma":[0.022963801,0.0014659096,0.0018476353,0.004006332,0.0050627165,0.012688821,0.0061605196,0.0074586454,0.0028392542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003409679,0.0001413272,0.0013527669,0.00039063432,0.000069035064,0.00014450616,0.00047281515,0.025947839,0.0061172857,0.9361564,0.008643543,0.020222912],"study_design_scores_gemma":[0.000029245519,0.000057010504,0.0010193258,0.0001152392,0.000058000813,0.00016830872,0.00010471945,0.07674018,0.0026470611,0.91247576,0.0065277675,0.000057410925],"about_ca_topic_score_codex":0.001047004,"about_ca_topic_score_gemma":0.0018810923,"teacher_disagreement_score":0.018961752,"about_ca_system_score_codex":0.003953163,"about_ca_system_score_gemma":0.00095391745,"threshold_uncertainty_score":0.06343341},"labels":[],"label_agreement":null},{"id":"W2169829403","doi":"10.1007/978-3-642-03367-4_34","title":"The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Cograph; Interval graph; Indifference graph; Bipartite graph; Pathwidth; Discrete mathematics; Vertex (graph theory); Comparability graph; Comparability; Graph; Line graph; 1-planar graph","score_opus":0.024769139751420123,"score_gpt":0.3134125907609353,"score_spread":0.28864345100951516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169829403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21771424,0.0015264829,0.6736903,0.005441872,0.00062381575,0.00044530435,0.002053736,0.0012522226,0.09725193],"genre_scores_gemma":[0.7786995,0.00175281,0.18319482,0.00049316895,0.00069480744,0.00044641248,0.003935166,0.00056837284,0.030214978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975725,0.0006685231,0.00016915602,0.0007177867,0.0005133723,0.0003587144],"domain_scores_gemma":[0.9901626,0.0067976005,0.00058123196,0.0016101063,0.00046976723,0.00037873784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018232882,0.0013024253,0.0015636313,0.0010829804,0.0021166056,0.0067079384,0.003856129,0.003998394,0.021543093],"category_scores_gemma":[0.015040397,0.0011309395,0.002075095,0.0045187087,0.0024512853,0.01773535,0.0038281241,0.004799941,0.0019181424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040549744,0.0002616002,0.00056846207,0.0006753623,0.000080264195,0.00027646738,0.00073513406,0.028483333,0.0027069864,0.81396115,0.016192708,0.13565315],"study_design_scores_gemma":[0.00006554411,0.00004874812,0.00014867897,0.00003855875,0.00003357427,0.00017338229,0.0003150711,0.029101571,0.0010982469,0.96377444,0.0051838956,0.0000183385],"about_ca_topic_score_codex":0.0014403653,"about_ca_topic_score_gemma":0.0012500029,"teacher_disagreement_score":0.021543093,"about_ca_system_score_codex":0.0015339741,"about_ca_system_score_gemma":0.0017985769,"threshold_uncertainty_score":0.07206881},"labels":[],"label_agreement":null},{"id":"W2169976284","doi":"10.1016/j.dam.2009.06.024","title":"On a disparity between relative cliquewidth and relative NLC-width","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Bounded function; Time complexity; Clique; Treewidth; Graph; Upper and lower bounds; Measure (data warehouse); Chordal graph; Discrete mathematics; Pathwidth; Computer science; Line graph","score_opus":0.02478072388979999,"score_gpt":0.3071723440611731,"score_spread":0.2823916201713731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169976284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29237252,0.011495012,0.53973395,0.040122736,0.0009203076,0.00011701681,0.0019050485,0.0011929388,0.11214049],"genre_scores_gemma":[0.8923995,0.0032467088,0.09179549,0.003348148,0.0017210809,0.00016532502,0.0006384357,0.0007528227,0.005932485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577516,0.001542093,0.00023583269,0.0010906805,0.00094444875,0.00041184117],"domain_scores_gemma":[0.93591774,0.053062685,0.0017609311,0.0050772163,0.0022378035,0.0019436701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076487763,0.00073405186,0.001873291,0.0023302962,0.002946363,0.0055584135,0.004910233,0.0034308021,0.013942974],"category_scores_gemma":[0.04720848,0.0012576616,0.0011360532,0.004560296,0.006828138,0.036438107,0.0060382024,0.0069547766,0.001121537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023375713,0.00006986926,0.0009844847,0.00019667474,0.00002362086,0.000035486544,0.00059181376,0.0044766995,0.0009201583,0.96312624,0.004004798,0.025336362],"study_design_scores_gemma":[0.000037721547,0.000039287548,0.00072508684,0.00007149681,0.000033222168,0.00018079339,0.00030965032,0.01655357,0.0006398884,0.9768787,0.00450862,0.000021836637],"about_ca_topic_score_codex":0.0015451801,"about_ca_topic_score_gemma":0.0018401037,"teacher_disagreement_score":0.013942974,"about_ca_system_score_codex":0.0021365138,"about_ca_system_score_gemma":0.0011240521,"threshold_uncertainty_score":0.046643913},"labels":[],"label_agreement":null},{"id":"W2170069407","doi":"10.1145/1187436.1210588","title":"Partitioning planar graphs with costs and weights","year":2007,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Graph partition; Book embedding; Planar graph; Combinatorics; Planar straight-line graph; Bounded function; Partition (number theory); Computer science; Graph; Outerplanar graph; Mathematics; Discrete mathematics; Pathwidth; Line graph","score_opus":0.016496438464639857,"score_gpt":0.29938283526948845,"score_spread":0.2828863968048486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170069407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21007627,0.00019995931,0.78251904,0.0002939074,0.00003945243,0.00020779751,0.0004512926,0.0015418603,0.004670375],"genre_scores_gemma":[0.40109605,0.0003472111,0.59370416,0.000090728885,0.0000265938,0.00023214857,0.0013371044,0.00044944498,0.0027166281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985837,0.00022365534,0.00009501744,0.00028013551,0.00065706373,0.0001604647],"domain_scores_gemma":[0.9946055,0.0025295594,0.0007757264,0.0010829115,0.00087817694,0.0001280904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074995327,0.0011411178,0.00080741785,0.0018065098,0.0008009521,0.0015940806,0.0013583959,0.00091153523,0.0026269897],"category_scores_gemma":[0.010013731,0.00075086544,0.000719329,0.002689016,0.0009460033,0.0033724047,0.0021871398,0.0010845073,0.0005552152],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006162442,0.00015909024,0.0044759777,0.00043614281,0.00011339497,0.00023878424,0.00029958796,0.6185828,0.057115495,0.076267436,0.0037492076,0.23794584],"study_design_scores_gemma":[0.00010365303,0.00017104823,0.0024953547,0.000036033445,0.0000920356,0.0003296357,0.00033112903,0.81374353,0.05024408,0.12457004,0.007801059,0.00008243176],"about_ca_topic_score_codex":0.003392149,"about_ca_topic_score_gemma":0.0045753405,"teacher_disagreement_score":0.003392149,"about_ca_system_score_codex":0.0011953755,"about_ca_system_score_gemma":0.0011005915,"threshold_uncertainty_score":0.008788168},"labels":[],"label_agreement":null},{"id":"W2170132163","doi":"10.1145/1103963.1103969","title":"An <i>O</i> ( <i>VE</i> ) algorithm for ear decompositions of matching-covered graphs","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matching (statistics); Algorithm; Partition (number theory); Combinatorics; Blossom algorithm; Factor-critical graph; Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.01833050890336663,"score_gpt":0.3081120926644815,"score_spread":0.28978158376111485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170132163","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015998906,0.00016405327,0.9735126,0.00030785435,0.000058973128,0.00022683159,0.0002564834,0.004227048,0.0052472297],"genre_scores_gemma":[0.09662952,0.0001760137,0.89608335,0.0002785596,0.00006467541,0.000421315,0.0014327887,0.0006338188,0.004279969],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983542,0.00024577888,0.00012677991,0.00048330845,0.00040617882,0.00038385158],"domain_scores_gemma":[0.99778193,0.0007355817,0.00022906288,0.00085072365,0.00023081143,0.00017198837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009756339,0.0012340217,0.0010752523,0.0014687729,0.0011454795,0.0020431858,0.0028282122,0.0016726681,0.012294687],"category_scores_gemma":[0.00376859,0.00079459144,0.002136219,0.0018792874,0.0011603561,0.004981476,0.0044713505,0.0022759151,0.004445422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010601406,0.0007443678,0.002251294,0.0007030301,0.00017387189,0.00021853515,0.0005411991,0.050183512,0.044390433,0.09553753,0.032370288,0.7718258],"study_design_scores_gemma":[0.000649434,0.00069435494,0.0022960978,0.000115891,0.00021785939,0.001032549,0.00040062724,0.6351231,0.05167815,0.26291,0.044709172,0.00017278003],"about_ca_topic_score_codex":0.0016816917,"about_ca_topic_score_gemma":0.0028474499,"teacher_disagreement_score":0.012294687,"about_ca_system_score_codex":0.001404762,"about_ca_system_score_gemma":0.0017984563,"threshold_uncertainty_score":0.041129827},"labels":[],"label_agreement":null},{"id":"W2170344325","doi":"10.1145/1273340.1273343","title":"Multicommodity demand flow in a tree and packing integer programs","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Linear programming relaxation; Mathematics; Cardinality (data modeling); Multi-commodity flow problem; Integer programming; Knapsack problem; Mathematical optimization; Steiner tree problem; Tree (set theory); Combinatorics; Approximation algorithm; Integer (computer science); Flow network; Discrete mathematics; Computer science","score_opus":0.034100251992916296,"score_gpt":0.3108631411316437,"score_spread":0.27676288913872743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170344325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09932126,0.0024071953,0.8663508,0.0018589632,0.00015269053,0.00015176664,0.0004780824,0.0003299698,0.02894929],"genre_scores_gemma":[0.5960359,0.002377514,0.38813496,0.0006890778,0.0003373245,0.00044621163,0.00066154177,0.0002517398,0.0110656265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891484,0.00039045623,0.000045914567,0.00019334331,0.00022705863,0.00022836836],"domain_scores_gemma":[0.9974611,0.0019257023,0.00026321382,0.00009679993,0.00014263245,0.000110398956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020671603,0.001470247,0.0013325283,0.0012772098,0.0009091361,0.0023625933,0.0010953044,0.0019088346,0.0046318937],"category_scores_gemma":[0.0057079038,0.0010917843,0.0015445461,0.0030820859,0.0014089241,0.004302402,0.00151289,0.0029477277,0.00040193254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015655078,0.00020627804,0.00068369054,0.00027113652,0.000056847883,0.00021751369,0.0003133622,0.7075287,0.0014154627,0.2662064,0.0034200018,0.019524084],"study_design_scores_gemma":[0.00002206458,0.000036679536,0.00016561904,0.000021343832,0.000013762241,0.000062027575,0.000052007992,0.9121754,0.00049088994,0.08458865,0.00236119,0.000010395986],"about_ca_topic_score_codex":0.0029318084,"about_ca_topic_score_gemma":0.0022533038,"teacher_disagreement_score":0.0046318937,"about_ca_system_score_codex":0.0023447524,"about_ca_system_score_gemma":0.0010426487,"threshold_uncertainty_score":0.017012477},"labels":[],"label_agreement":null},{"id":"W2170800107","doi":"10.1016/s0012-365x(01)00046-2","title":"Star forests, dominating sets and Ramsey-type problems","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Star (game theory); Graph; Upper and lower bounds; Complete bipartite graph; Discrete mathematics; Minimum degree spanning tree; Edge-transitive graph; Graph power; Line graph","score_opus":0.038758774683058876,"score_gpt":0.29286162080845174,"score_spread":0.25410284612539286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170800107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4899637,0.026929632,0.34883213,0.018955272,0.0010683674,0.00016617634,0.001351263,0.00041419885,0.11231929],"genre_scores_gemma":[0.8987491,0.01076971,0.057764973,0.0015115677,0.0014917521,0.00018959098,0.0010137516,0.00008357806,0.02842598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990552,0.0003769492,0.00004158581,0.0002277047,0.00018095845,0.000117705094],"domain_scores_gemma":[0.99585813,0.0029995388,0.0003751954,0.00024727156,0.00018276533,0.0003371353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018417229,0.0007196845,0.0013573729,0.0012411459,0.0023005733,0.0037942845,0.0015493812,0.0021487193,0.0045059025],"category_scores_gemma":[0.005206747,0.00084713014,0.0007951167,0.0031167294,0.0027920604,0.008778959,0.0016725113,0.003235634,0.0004569146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001835728,0.00012724086,0.0008947524,0.00030546734,0.000048235575,0.00010825333,0.00039122626,0.011353007,0.0011367016,0.95596224,0.008784812,0.020704413],"study_design_scores_gemma":[0.000024091052,0.000014317458,0.00025051078,0.00001530354,0.000018601217,0.00012038189,0.00012358656,0.009473087,0.0001860481,0.987045,0.002720955,0.000008147407],"about_ca_topic_score_codex":0.00096116523,"about_ca_topic_score_gemma":0.0016986723,"teacher_disagreement_score":0.0045059025,"about_ca_system_score_codex":0.0014704585,"about_ca_system_score_gemma":0.00085443316,"threshold_uncertainty_score":0.015073717},"labels":[],"label_agreement":null},{"id":"W2171410117","doi":"10.5614/ejgta.2015.3.1.2","title":"On scores, losing scores and total scores in hypertournaments","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Killam Trusts; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Combinatorics; Mathematics; Hypergraph; Element (criminal law); Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Graph; Computer science; Artificial intelligence; Law","score_opus":0.014868215739346788,"score_gpt":0.28698020828732473,"score_spread":0.27211199254797797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171410117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61182463,0.00135561,0.32049674,0.0018294079,0.00024662525,0.00016752156,0.0012311805,0.00041227066,0.06243606],"genre_scores_gemma":[0.94279647,0.00075455866,0.041672196,0.00031638728,0.00036046107,0.00030159496,0.001180666,0.0002471287,0.012370554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951622,0.0013140036,0.0003412074,0.0010184314,0.0010949137,0.0010694],"domain_scores_gemma":[0.9765817,0.014283175,0.0029403265,0.0015219244,0.0017724711,0.0029003602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035617864,0.0016622087,0.0013692459,0.0033224989,0.0022699675,0.0047600134,0.0024404572,0.0016408743,0.0099659115],"category_scores_gemma":[0.024031404,0.00059249165,0.0010226303,0.0037651528,0.006180052,0.009685421,0.0034746428,0.0031113029,0.0011231322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025767295,0.0000898774,0.004515249,0.00014240532,0.000050316026,0.00017682955,0.0005840528,0.01757191,0.0017641191,0.94259924,0.002369879,0.029878482],"study_design_scores_gemma":[0.000032602908,0.00014976485,0.0023311295,0.000059908307,0.00003787616,0.00019514808,0.0002711149,0.04678629,0.00092030043,0.946114,0.0030590848,0.000042849053],"about_ca_topic_score_codex":0.001861023,"about_ca_topic_score_gemma":0.0022473212,"teacher_disagreement_score":0.0099659115,"about_ca_system_score_codex":0.0025226623,"about_ca_system_score_gemma":0.0010114546,"threshold_uncertainty_score":0.03333932},"labels":[],"label_agreement":null},{"id":"W2172233838","doi":"10.1017/s096354830621808x","title":"<i>Graphs on Surfaces and Their Applications</i>, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences <b>141</b>, Springer-Verlag, 2004, 455pp., £73.00/$109.00/94.95 Euros","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Euros; Encyclopedia; Philosophy; Humanities; Computer science; Library science","score_opus":0.01573402401454194,"score_gpt":0.2527290843312331,"score_spread":0.23699506031669115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172233838","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002531012,0.8496402,0.019035773,0.018037273,0.021978011,0.000050317332,0.00056821504,0.00052327104,0.08763585],"genre_scores_gemma":[0.03405739,0.71202034,0.0257777,0.005389971,0.03275601,0.00012871876,0.0015113809,0.00093880197,0.1874197],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968266,0.00006478721,0.000015146299,0.00010581221,0.000102936305,0.000028604558],"domain_scores_gemma":[0.99947923,0.0002524445,0.00004842309,0.00004658295,0.00009668104,0.00007679791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048494246,0.0018842734,0.001118964,0.0032893303,0.00069335295,0.00205946,0.0010191149,0.0009468934,0.021900779],"category_scores_gemma":[0.0010208144,0.00073870126,0.0007631086,0.0048581,0.0017565524,0.0041580815,0.0018496299,0.0030313218,0.015415148],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004408528,0.000028307506,0.0002758931,0.0009616629,0.0000422146,0.00006866039,0.00016284098,0.0014648157,0.00096930383,0.065911904,0.7360259,0.1940444],"study_design_scores_gemma":[0.000008810444,0.000031922056,0.0011026277,0.00029288506,0.000020595495,0.0004189753,0.00012450393,0.0013664175,0.00044546917,0.07156238,0.92459446,0.000030952902],"about_ca_topic_score_codex":0.0023498398,"about_ca_topic_score_gemma":0.0028161472,"teacher_disagreement_score":0.021900779,"about_ca_system_score_codex":0.0018948194,"about_ca_system_score_gemma":0.0006052087,"threshold_uncertainty_score":0.07326537},"labels":[],"label_agreement":null},{"id":"W2172276559","doi":"10.1109/lics.2011.25","title":"The Dichotomy for Conservative Constraint Satisfaction Problems Revisited","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Constraint satisfaction problem; Unary operation; Constraint satisfaction; Conjecture; Constraint (computer-aided design); Complexity of constraint satisfaction; Local consistency; Constraint satisfaction dual problem; Constraint logic programming; Mathematics; Computer science; Constraint graph; Discrete mathematics; Artificial intelligence","score_opus":0.06677475835128978,"score_gpt":0.3043379363671991,"score_spread":0.23756317801590932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172276559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14839417,0.01410815,0.5800984,0.06822503,0.0009973136,0.00017381411,0.0010452654,0.00078875566,0.18616909],"genre_scores_gemma":[0.92758334,0.0043748263,0.045080394,0.005427561,0.0012491463,0.00024172093,0.000699368,0.00019940542,0.01514425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956185,0.001449316,0.000174324,0.0007674325,0.001370869,0.000619537],"domain_scores_gemma":[0.9879822,0.0100312475,0.00042010745,0.0004884314,0.00066917535,0.0004087625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033012596,0.00050885644,0.001148635,0.0017541335,0.0026148367,0.0039493497,0.0016714798,0.0023716944,0.009733411],"category_scores_gemma":[0.013021226,0.0005669689,0.0013028106,0.0024465292,0.0060825585,0.011078198,0.0044561974,0.010233599,0.0008423654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028064182,0.00002854691,0.00019619864,0.000087271605,0.00000842474,0.00009575582,0.00030030546,0.0015084827,0.00037437867,0.9863608,0.0031056593,0.007906117],"study_design_scores_gemma":[0.00001252756,0.000008130961,0.00015113494,0.000026229896,0.0000037907798,0.000057871574,0.000114437535,0.0039950265,0.00014031921,0.9917355,0.0037484907,0.000006385936],"about_ca_topic_score_codex":0.001670255,"about_ca_topic_score_gemma":0.0009783058,"teacher_disagreement_score":0.009733411,"about_ca_system_score_codex":0.0025766287,"about_ca_system_score_gemma":0.0013561718,"threshold_uncertainty_score":0.03256148},"labels":[],"label_agreement":null},{"id":"W2172657760","doi":"10.1016/j.endm.2008.01.004","title":"Limited Packings in Graphs","year":2008,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023074299769967836,"score_gpt":0.2875907517908187,"score_spread":0.2645164520208509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172657760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69496244,0.0025110708,0.1251253,0.0031627647,0.0004557085,0.00010429575,0.00080998003,0.0005975441,0.17227091],"genre_scores_gemma":[0.94316417,0.0012122482,0.02390837,0.00053142454,0.00046741168,0.00015828983,0.0009468856,0.00020601597,0.029405149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991953,0.00025683793,0.000050203602,0.00014365744,0.00025346107,0.000100597215],"domain_scores_gemma":[0.9963685,0.0019693938,0.00049074786,0.00044611393,0.00019843328,0.0005266457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067792163,0.0006273877,0.0012765026,0.002716238,0.0019479962,0.0032882253,0.0012449406,0.0016540666,0.012201056],"category_scores_gemma":[0.005212851,0.0010932924,0.0008713698,0.0027480181,0.0026190795,0.005365105,0.0028399036,0.0028892348,0.0013235209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011487855,0.000052130476,0.00047901866,0.00011386689,0.000018193752,0.00017429936,0.00037051155,0.004824567,0.001124872,0.97699463,0.004128694,0.01160416],"study_design_scores_gemma":[0.000013971843,0.000016456122,0.00034851796,0.000020687028,0.0000075936427,0.0001663638,0.0001024964,0.0098934285,0.00031695314,0.9873223,0.0017844478,0.0000069030807],"about_ca_topic_score_codex":0.00055042165,"about_ca_topic_score_gemma":0.0006751061,"teacher_disagreement_score":0.012201056,"about_ca_system_score_codex":0.00083829847,"about_ca_system_score_gemma":0.00027084537,"threshold_uncertainty_score":0.040816545},"labels":[],"label_agreement":null},{"id":"W2173146142","doi":"10.1016/j.endm.2005.05.036","title":"Planar graph bipartization in linear time","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Graph; Vertex (graph theory); Planar straight-line graph; Transversal (combinatorics); Butterfly graph; Planar; Discrete mathematics; Line graph; Voltage graph; 1-planar graph; Mathematical analysis; Computer science","score_opus":0.012619503247578661,"score_gpt":0.2892128175860272,"score_spread":0.2765933143384485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173146142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19726975,0.0015713469,0.6286947,0.005542689,0.0005670676,0.0007967384,0.004559218,0.009035262,0.15196328],"genre_scores_gemma":[0.5678869,0.001281397,0.3386627,0.0015028198,0.00037412657,0.0007233023,0.006251824,0.002585423,0.08073143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799263,0.0003606891,0.00009110018,0.00050629093,0.0005039012,0.00054529525],"domain_scores_gemma":[0.9956654,0.0022791382,0.000388903,0.00087582826,0.00036250852,0.00042826642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095771486,0.0013594733,0.0024125378,0.0015947114,0.0024764368,0.005006304,0.0028584755,0.0017911674,0.037907742],"category_scores_gemma":[0.00643373,0.0010568101,0.0017805692,0.004324111,0.0018296995,0.008724864,0.004132447,0.0038659335,0.004817327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021251526,0.0007050853,0.0010237986,0.0013523727,0.00023219558,0.00026054916,0.00089569844,0.09176078,0.015165768,0.5950844,0.06933036,0.22206378],"study_design_scores_gemma":[0.00041435083,0.000158474,0.00055675174,0.000059817412,0.00014559738,0.00021293205,0.00036990645,0.1773436,0.0052661146,0.7992458,0.016179115,0.000047533405],"about_ca_topic_score_codex":0.0050324923,"about_ca_topic_score_gemma":0.0073516914,"teacher_disagreement_score":0.037907742,"about_ca_system_score_codex":0.0036506495,"about_ca_system_score_gemma":0.0021993022,"threshold_uncertainty_score":0.12681407},"labels":[],"label_agreement":null},{"id":"W2173731825","doi":"10.1007/978-3-642-35926-2_11","title":"Acyclic Coloring with Few Division Vertices","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba","funders":"","keywords":"Combinatorics; Planar graph; Wheel graph; Subdivision; Mathematics; Graph; Directed acyclic graph; Path graph; Discrete mathematics; Graph power; Line graph","score_opus":0.025242310899883862,"score_gpt":0.2823510836079752,"score_spread":0.2571087727080913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173731825","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09723517,0.0013703281,0.37691087,0.0015894623,0.0012939346,0.00036758982,0.002323957,0.0020948844,0.5168139],"genre_scores_gemma":[0.4145331,0.002409249,0.32577,0.001137678,0.00045217123,0.0004666095,0.0031600003,0.0012843006,0.2507869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996878,0.00006988155,0.000011296415,0.00009488032,0.00006163832,0.0000745919],"domain_scores_gemma":[0.99896955,0.0003494087,0.000061025716,0.0002833839,0.00016585756,0.00017077537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026553342,0.0007000343,0.00043315822,0.00064594776,0.0015036695,0.0012429571,0.0011205289,0.00049364055,0.022353446],"category_scores_gemma":[0.0010138081,0.0005606616,0.00042131275,0.0012733708,0.00071655156,0.0017245584,0.00094279787,0.0016646556,0.005437498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024124136,0.00014162481,0.00044469486,0.0005192766,0.000027004213,0.00024353655,0.00029939314,0.00817783,0.01246321,0.7957521,0.04762736,0.13406272],"study_design_scores_gemma":[0.00006475198,0.000070724935,0.00063027075,0.000100557794,0.000047966554,0.00049262185,0.00017299896,0.013836235,0.008234792,0.8261207,0.15020023,0.000028135333],"about_ca_topic_score_codex":0.001768878,"about_ca_topic_score_gemma":0.0040268954,"teacher_disagreement_score":0.022353446,"about_ca_system_score_codex":0.0009337523,"about_ca_system_score_gemma":0.0008933086,"threshold_uncertainty_score":0.07477969},"labels":[],"label_agreement":null},{"id":"W2175518075","doi":"10.1016/j.disc.2003.05.001","title":"Induced matchings in intersection graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Indifference graph; Split graph; Block graph; Discrete mathematics; Pathwidth; Induced subgraph; Intersection graph; Matching (statistics); Interval graph; 1-planar graph; Cograph; Line graph; Graph; Vertex (graph theory)","score_opus":0.026987633859876316,"score_gpt":0.3014352730218232,"score_spread":0.2744476391619469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175518075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6140175,0.0011591908,0.26190743,0.0023469473,0.00027016146,0.00023078293,0.0015374654,0.0011824359,0.117348164],"genre_scores_gemma":[0.91224855,0.00092003343,0.05430849,0.00043475055,0.00023342579,0.00020245292,0.0020729396,0.00035568344,0.029223815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804294,0.0004316753,0.00014667817,0.00049503456,0.00053607736,0.0003474709],"domain_scores_gemma":[0.9935569,0.0031366264,0.001064716,0.0007279522,0.00071088795,0.0008029538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445428,0.0006089981,0.0013807939,0.0038794023,0.0034656231,0.0057225693,0.0027556536,0.0021701357,0.014062199],"category_scores_gemma":[0.008498328,0.0013834962,0.001358011,0.006120078,0.002309907,0.012758322,0.0035275996,0.0040507084,0.0017752276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013233234,0.000097960554,0.0009921155,0.00007927007,0.000022865948,0.00011229294,0.0005099595,0.001496011,0.0008399452,0.9811952,0.0019814486,0.012540505],"study_design_scores_gemma":[0.000029080315,0.00001979317,0.00036511445,0.00002480842,0.00004091501,0.0001422984,0.0002486936,0.007916015,0.00093480176,0.98646057,0.0038058122,0.000012106662],"about_ca_topic_score_codex":0.001349552,"about_ca_topic_score_gemma":0.0014642753,"teacher_disagreement_score":0.014062199,"about_ca_system_score_codex":0.00203093,"about_ca_system_score_gemma":0.0009476664,"threshold_uncertainty_score":0.047042727},"labels":[],"label_agreement":null},{"id":"W2176631256","doi":"","title":"Gamma-Set Domination Graphs. I: Complete Biorientations of q- Extended Stars and Wounded Spider Graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Digraph","score_opus":0.025642448316697965,"score_gpt":0.2990597536592489,"score_spread":0.27341730534255093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176631256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8759078,0.00089131016,0.073929556,0.00046670987,0.000073394294,0.000085402586,0.00077969907,0.0001755343,0.047690585],"genre_scores_gemma":[0.9765044,0.00037819077,0.01379434,0.00013087023,0.000030894964,0.00007382747,0.000644704,0.00003812775,0.008404717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970895,0.000051879393,0.000017220003,0.0000773261,0.00007583185,0.000068902424],"domain_scores_gemma":[0.9991571,0.0002844325,0.00020928342,0.00008375557,0.00010561546,0.00015984458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027323878,0.0003501609,0.00032747188,0.0012414828,0.0011708735,0.0016178039,0.00066002837,0.00050978124,0.0035041845],"category_scores_gemma":[0.0008296877,0.0002793318,0.00051423116,0.0009795593,0.0012603921,0.0017710895,0.0014173675,0.0006492185,0.00034103435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021991564,0.000055134224,0.007135348,0.00018377759,0.0000581246,0.00094838353,0.0015146766,0.008485306,0.013666175,0.9283584,0.004638019,0.034736697],"study_design_scores_gemma":[0.00005742875,0.00007902759,0.0076330006,0.000101859034,0.00005598388,0.0019116382,0.0010870416,0.036372315,0.0075052693,0.9193883,0.025764078,0.000044054537],"about_ca_topic_score_codex":0.0010453246,"about_ca_topic_score_gemma":0.0013656,"teacher_disagreement_score":0.0035041845,"about_ca_system_score_codex":0.0010744674,"about_ca_system_score_gemma":0.00029100914,"threshold_uncertainty_score":0.011722684},"labels":[],"label_agreement":null},{"id":"W2176863076","doi":"10.1016/j.endm.2005.05.016","title":"On bags and bugs","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Discrete mathematics; Indifference graph; Graph","score_opus":0.01168407347966107,"score_gpt":0.2914724522231081,"score_spread":0.27978837874344703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176863076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0851855,0.0206937,0.46095428,0.094055,0.0063997274,0.000098561846,0.0013705266,0.0028687115,0.32837403],"genre_scores_gemma":[0.81915253,0.0054033417,0.055652328,0.007748393,0.0032449325,0.00019313219,0.0013360633,0.0023575078,0.10491167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968093,0.001243601,0.00018135982,0.00066109415,0.0007224147,0.00038224936],"domain_scores_gemma":[0.98949534,0.0066202017,0.0004885907,0.0019149595,0.00096150086,0.00051951554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002352642,0.0009542752,0.0014630683,0.0029958468,0.003769799,0.0059177135,0.0017890614,0.0031590536,0.027524816],"category_scores_gemma":[0.021536354,0.00107425,0.0014060744,0.0032842983,0.008707613,0.022622442,0.006848787,0.0052304566,0.0031815881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022518145,0.000007646916,0.00028172217,0.000037727634,0.00000899557,0.00004107707,0.0005268737,0.0004330937,0.000070161586,0.9766376,0.010101804,0.011830676],"study_design_scores_gemma":[0.000004922672,0.0000027887384,0.000049549566,0.000018176519,0.0000055387113,0.00003737812,0.00013667146,0.0007839742,0.000036396174,0.9877274,0.011191713,0.000005504452],"about_ca_topic_score_codex":0.0030841774,"about_ca_topic_score_gemma":0.0021551822,"teacher_disagreement_score":0.027524816,"about_ca_system_score_codex":0.0019130381,"about_ca_system_score_gemma":0.0008346559,"threshold_uncertainty_score":0.0920797},"labels":[],"label_agreement":null},{"id":"W2178834151","doi":"10.55016/ojs/cdm.v6i2.62073","title":"Signed star k-domatic number of a graph","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Mathematics; Graph; Combinatorics","score_opus":0.027351266769131025,"score_gpt":0.3223965417862386,"score_spread":0.2950452750171076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178834151","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.739925,0.0007776493,0.22572005,0.00081812136,0.00023193691,0.00013183746,0.002219275,0.00031694066,0.029859204],"genre_scores_gemma":[0.9275781,0.0004647726,0.06286463,0.00014236628,0.000107167936,0.0001244338,0.0011547252,0.000040048253,0.007523857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994598,0.00013200732,0.00005203993,0.0001389217,0.00014832403,0.00006885615],"domain_scores_gemma":[0.99797684,0.000638203,0.00035305505,0.000177358,0.00041426608,0.00044024098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053431024,0.00041108695,0.00046192456,0.0015337194,0.00072618097,0.001302537,0.0004526454,0.0005104576,0.0027683566],"category_scores_gemma":[0.0028895726,0.00019614151,0.00027842462,0.0010508368,0.0010468503,0.0021087965,0.0006997652,0.00046236397,0.000515601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001042292,0.00014354216,0.012300853,0.0006088637,0.00009961249,0.00061025337,0.00073502725,0.038204722,0.051028118,0.77497476,0.008331361,0.11192053],"study_design_scores_gemma":[0.000084789026,0.00052031246,0.008204261,0.00008430236,0.000063913736,0.0024754354,0.00042805535,0.14151849,0.01616926,0.7917663,0.0385837,0.000101102065],"about_ca_topic_score_codex":0.0001934185,"about_ca_topic_score_gemma":0.00032739044,"teacher_disagreement_score":0.0027683566,"about_ca_system_score_codex":0.0006696296,"about_ca_system_score_gemma":0.0005571967,"threshold_uncertainty_score":0.009261131},"labels":[],"label_agreement":null},{"id":"W2179188366","doi":"10.1016/s1571-0653(05)80141-6","title":"Well-located graphs: A collection of well-covered ones","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Vertex (graph theory); Graph; Maximal independent set; Independent set; Discrete mathematics; Chordal graph; 1-planar graph","score_opus":0.01186500088918949,"score_gpt":0.2746254796604122,"score_spread":0.26276047877122266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179188366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46644196,0.0066831415,0.44700396,0.0014645765,0.00038369835,0.00023596558,0.003130817,0.001405134,0.07325075],"genre_scores_gemma":[0.8518812,0.0048544602,0.095932946,0.0005916825,0.00086417096,0.00037098862,0.0047346344,0.001148608,0.03962127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978137,0.00032755852,0.00013801813,0.0006601302,0.00072850223,0.0003320217],"domain_scores_gemma":[0.99237025,0.002938448,0.0008693992,0.0015498288,0.0013586929,0.00091342244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010710557,0.0012682744,0.0020687063,0.0060866945,0.0027848473,0.004047799,0.0025436154,0.0021852322,0.0078015835],"category_scores_gemma":[0.008046494,0.0014152552,0.0012105503,0.006491021,0.002548663,0.007961713,0.0035540203,0.0028828967,0.0018534588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020299938,0.00008535967,0.002476579,0.0004711865,0.00009844196,0.0011302842,0.0016269909,0.0047946023,0.00539979,0.93470925,0.009260387,0.039744083],"study_design_scores_gemma":[0.00003079644,0.0000563219,0.002224073,0.00009634416,0.000098602,0.0016560805,0.0006048578,0.015062407,0.0022758886,0.9564969,0.021350395,0.000047273315],"about_ca_topic_score_codex":0.00085826614,"about_ca_topic_score_gemma":0.0011985815,"teacher_disagreement_score":0.0078015835,"about_ca_system_score_codex":0.0010142119,"about_ca_system_score_gemma":0.0006318035,"threshold_uncertainty_score":0.026098907},"labels":[],"label_agreement":null},{"id":"W2179550966","doi":"10.1016/j.disc.2011.03.028","title":"The crossing number of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si8.gif\" display=\"inline\" overflow=\"scroll\"><mml:msubsup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mspace width=\"0.16667em\"/><mml:mi>□</mml:mi><mml:mspace width=\"0.16667em\"/><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Research Nova Scotia; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Cartesian product; Combinatorics; Mathematics; Graph; Crossing number (knot theory); Vertex (graph theory); Discrete mathematics","score_opus":0.024330179051812898,"score_gpt":0.2668875939251289,"score_spread":0.242557414873316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179550966","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09550601,0.0011308737,0.20002851,0.0020198936,0.0029398517,0.00016511253,0.021638889,0.009728647,0.6668422],"genre_scores_gemma":[0.5170203,0.0016927165,0.108794615,0.0008684173,0.0007464763,0.0002805199,0.030768836,0.012259337,0.32756877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936765,0.00006354608,0.000031744068,0.00021244114,0.00021568312,0.0001090064],"domain_scores_gemma":[0.99865216,0.0004301968,0.000116162046,0.00020138359,0.00041711738,0.00018292326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045727927,0.00079509587,0.0006016332,0.002632892,0.0010967703,0.003156907,0.0008547344,0.00091499067,0.15976076],"category_scores_gemma":[0.0037018782,0.00035616977,0.00061164424,0.001991901,0.000834149,0.0032770343,0.00080832624,0.0016169917,0.046125703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038526673,0.00012417794,0.0029147246,0.0005303152,0.000049897957,0.0006623016,0.0006120827,0.0051616766,0.022408742,0.52777094,0.27992335,0.1594565],"study_design_scores_gemma":[0.000053607513,0.00011070867,0.007442113,0.0001897355,0.000063852145,0.0015560719,0.00048764856,0.020054953,0.031951487,0.33881187,0.59915346,0.00012453106],"about_ca_topic_score_codex":0.0017960396,"about_ca_topic_score_gemma":0.0016011586,"teacher_disagreement_score":0.15976076,"about_ca_system_score_codex":0.0011458903,"about_ca_system_score_gemma":0.00061862497,"threshold_uncertainty_score":0.534453},"labels":[],"label_agreement":null},{"id":"W2179924680","doi":"10.1016/j.ejc.2011.12.010","title":"Computability of width of submodular partition functions","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Grantová Agentura České Republiky","keywords":"Submodular set function; Mathematics; Partition (number theory); Combinatorics; Discrete mathematics; Graph; Exponential function","score_opus":0.026041076771552606,"score_gpt":0.2625905182321438,"score_spread":0.2365494414605912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179924680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7227351,0.0007962552,0.24692722,0.004244338,0.00012182243,0.00014837453,0.0015525039,0.0015929024,0.021881457],"genre_scores_gemma":[0.9459418,0.00037019874,0.04562789,0.00037129677,0.0002220305,0.00019499668,0.0011502967,0.0004983348,0.005623096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663913,0.00097575795,0.00017584988,0.0009460853,0.000666925,0.0005962601],"domain_scores_gemma":[0.96656245,0.026431255,0.0014355408,0.0033635704,0.0007919225,0.001415285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003645637,0.0015256143,0.0019691994,0.001851841,0.0017166351,0.009336208,0.0056874733,0.0024182033,0.013888397],"category_scores_gemma":[0.031200845,0.0012651363,0.0022935965,0.0030892764,0.0037424183,0.019227603,0.004855042,0.0053274883,0.0012047901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019052372,0.00050415535,0.0097098,0.0006985247,0.00022697334,0.00024882806,0.0020224187,0.054682896,0.009072023,0.8337575,0.0074908854,0.07968073],"study_design_scores_gemma":[0.00013678672,0.000056024568,0.0007693655,0.000045106266,0.00009070283,0.00011791156,0.00021532504,0.08914429,0.00295996,0.90534157,0.001096327,0.000026554186],"about_ca_topic_score_codex":0.0017558694,"about_ca_topic_score_gemma":0.0026975807,"teacher_disagreement_score":0.013888397,"about_ca_system_score_codex":0.003176775,"about_ca_system_score_gemma":0.001973343,"threshold_uncertainty_score":0.046461284},"labels":[],"label_agreement":null},{"id":"W2184256762","doi":"10.82308/54428","title":"Fractional edge and total colouring","year":2012,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Mathematics; Degree (music); Combinatorics; Graph; Discrete mathematics; Edge coloring; Integer (computer science); Graph power; Computer science; Line graph","score_opus":0.020394808829064786,"score_gpt":0.27734806691137387,"score_spread":0.25695325808230907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184256762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07356982,0.00057449786,0.9032732,0.00074978755,0.00011007125,0.00009573622,0.0002589349,0.00040704853,0.020960815],"genre_scores_gemma":[0.5749926,0.0008412771,0.4067873,0.00049917947,0.00013085615,0.00016534321,0.00048058896,0.0002873529,0.015815519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984133,0.00042676218,0.000050062703,0.00044660017,0.000355846,0.0003072582],"domain_scores_gemma":[0.9964379,0.0022651777,0.00028942668,0.0006115096,0.00024840236,0.0001475565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012506506,0.00077975576,0.0006849934,0.00069611217,0.00078727875,0.0018035931,0.0011192412,0.00088262785,0.005719298],"category_scores_gemma":[0.0056685563,0.0003868839,0.0012337879,0.0011712656,0.002257322,0.003419199,0.001628255,0.0018543475,0.00042842503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002706967,0.00008238189,0.0010022492,0.0002448577,0.000056368266,0.00012268008,0.00035875032,0.28352082,0.008259462,0.63687134,0.004545957,0.06466442],"study_design_scores_gemma":[0.000036745543,0.00007730746,0.0005111868,0.00002668359,0.000031921183,0.00013161782,0.00009579136,0.3637702,0.004063391,0.62141645,0.009813055,0.000025646726],"about_ca_topic_score_codex":0.004502409,"about_ca_topic_score_gemma":0.0036517316,"teacher_disagreement_score":0.005719298,"about_ca_system_score_codex":0.0017096049,"about_ca_system_score_gemma":0.0012115199,"threshold_uncertainty_score":0.019132972},"labels":[],"label_agreement":null},{"id":"W2184414793","doi":"","title":"Diameter of paired domination edge-critical graphs","year":2008,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Domination analysis; Graph; Induced subgraph; Discrete mathematics; Vertex (graph theory)","score_opus":0.04648292806852639,"score_gpt":0.31125548283966037,"score_spread":0.264772554771134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184414793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9351053,0.0013261271,0.048010048,0.00059112353,0.000040348954,0.00005914531,0.0010487809,0.00016384348,0.013655253],"genre_scores_gemma":[0.9869552,0.00057027716,0.010436866,0.00007828751,0.00006341839,0.00006180839,0.0006035495,0.000036657395,0.0011939919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994436,0.00009694367,0.0000352795,0.00019202246,0.00011072783,0.00012150744],"domain_scores_gemma":[0.9960765,0.0021016658,0.00071933056,0.0001825406,0.00031181506,0.0006081453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005098104,0.0003932943,0.00055746414,0.0014052016,0.0007503518,0.0014582451,0.0008562065,0.000621169,0.0014488036],"category_scores_gemma":[0.003188461,0.00049358216,0.00028915177,0.00070176437,0.0009649581,0.0016404111,0.0012086027,0.0004754268,0.0002383755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034408907,0.00029841907,0.071029834,0.001538598,0.0003840579,0.003694726,0.0036596193,0.19497068,0.18744466,0.43274894,0.01934148,0.08144806],"study_design_scores_gemma":[0.0002387242,0.00068181404,0.042603966,0.00022408212,0.00028874198,0.011621963,0.0022054568,0.3497661,0.058594853,0.4985322,0.035116542,0.0001255731],"about_ca_topic_score_codex":0.00038518792,"about_ca_topic_score_gemma":0.00030146906,"teacher_disagreement_score":0.0014582451,"about_ca_system_score_codex":0.0008746443,"about_ca_system_score_gemma":0.00026981466,"threshold_uncertainty_score":0.0063459873},"labels":[],"label_agreement":null},{"id":"W2184743223","doi":"","title":"Eternal domination on 3 × n grid graphs","year":2015,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; St. Francis Xavier University","funders":"","keywords":"Dominating set; Vertex (graph theory); Domination analysis; Combinatorics; Mathematics; Grid; Graph; Computer science; Discrete mathematics","score_opus":0.06277409480743021,"score_gpt":0.32890396252145476,"score_spread":0.2661298677140246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184743223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7587713,0.0008430365,0.22414674,0.0007987309,0.00004569567,0.0000947026,0.0007821673,0.0003399798,0.014177741],"genre_scores_gemma":[0.9666918,0.00032394027,0.028870996,0.00010619015,0.0000212817,0.00004951911,0.00033249392,0.000034991153,0.003568747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941003,0.0002088401,0.000037136953,0.000121752746,0.00007568839,0.00014661695],"domain_scores_gemma":[0.9969541,0.0018002447,0.0004952555,0.00032282982,0.00016125804,0.00026630072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005877595,0.00032858585,0.00042548793,0.00052022067,0.0006133836,0.00078414986,0.0008003124,0.00036859105,0.0021982715],"category_scores_gemma":[0.0035115168,0.0002104177,0.0003049588,0.0005494381,0.00087514083,0.0013828739,0.00092254183,0.0004612349,0.00020681944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011676422,0.00013756934,0.012208072,0.00032601674,0.00013893288,0.00077157817,0.00052295567,0.7576421,0.017824966,0.13414879,0.006411042,0.0687004],"study_design_scores_gemma":[0.00008341055,0.00014268605,0.0033692159,0.000025703765,0.000029866094,0.00046581234,0.00022626338,0.8427219,0.0039169746,0.14350224,0.005490728,0.000025089956],"about_ca_topic_score_codex":0.003257047,"about_ca_topic_score_gemma":0.0040424485,"teacher_disagreement_score":0.003257047,"about_ca_system_score_codex":0.000788524,"about_ca_system_score_gemma":0.0003409495,"threshold_uncertainty_score":0.0073539615},"labels":[],"label_agreement":null},{"id":"W2185242172","doi":"10.1016/j.dam.2015.10.035","title":"A survey on flows in graphs and matroids","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Mathematics; Combinatorics; Bottleneck; Minimax; Flow (mathematics); Graph; Discrete mathematics; Mathematical economics; Computer science","score_opus":0.04795131266788904,"score_gpt":0.30756618463993707,"score_spread":0.259614871972048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185242172","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015307755,0.75535524,0.16593553,0.009431123,0.002445153,0.00008091297,0.0011631446,0.00042424328,0.049856912],"genre_scores_gemma":[0.07231773,0.838323,0.063714646,0.0028311913,0.0088938875,0.00012023236,0.002098131,0.00022862879,0.011472582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990902,0.00019738187,0.00008208874,0.00026945554,0.0002675221,0.000093460134],"domain_scores_gemma":[0.9971976,0.0019345885,0.00014105772,0.00024760087,0.0003157629,0.00016336008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014859317,0.0010954322,0.0019012005,0.005130101,0.0011886673,0.0042699454,0.0015278006,0.0016590932,0.0081889015],"category_scores_gemma":[0.003996277,0.0010047776,0.0009747402,0.012648575,0.0017314176,0.010368431,0.0018601968,0.0026789936,0.0021909415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009067697,0.0002066719,0.0023387594,0.003928133,0.000092995215,0.0001485375,0.0003148309,0.00821147,0.0010940488,0.4785775,0.045676902,0.45931935],"study_design_scores_gemma":[0.000023348974,0.000090072805,0.0014202213,0.0011926894,0.0000743688,0.0007027217,0.00028152406,0.011837733,0.0006645357,0.57024574,0.41341624,0.00005085237],"about_ca_topic_score_codex":0.0015157112,"about_ca_topic_score_gemma":0.0014367116,"teacher_disagreement_score":0.0081889015,"about_ca_system_score_codex":0.0017274291,"about_ca_system_score_gemma":0.0015938893,"threshold_uncertainty_score":0.027394593},"labels":[],"label_agreement":null},{"id":"W2185442857","doi":"","title":"Improved upper bounds for the k-tuple domination number","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Tuple; Upper and lower bounds; Domination analysis; Mathematics; Combinatorics; Graph; Discrete mathematics; Mathematical analysis; Vertex (graph theory)","score_opus":0.026022842544114376,"score_gpt":0.3115432153313554,"score_spread":0.2855203727872411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185442857","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08327959,0.0178458,0.8211878,0.0031187946,0.0011698179,0.0003777762,0.0026793315,0.0024635396,0.06787759],"genre_scores_gemma":[0.7018018,0.008911081,0.26406667,0.0018460761,0.0020934031,0.00091950793,0.002884196,0.0011454597,0.01633184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99434584,0.0011146247,0.00026599463,0.001252207,0.0018220355,0.00119928],"domain_scores_gemma":[0.98565626,0.0068660886,0.00089601125,0.0038343493,0.0019030162,0.0008442675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003450912,0.0038131948,0.0029887042,0.0038069312,0.0017217237,0.003755956,0.0052522523,0.0017433597,0.010579739],"category_scores_gemma":[0.016444305,0.0009737539,0.003317975,0.0049395883,0.0028750286,0.010340867,0.0060121636,0.006723483,0.0038207578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011837583,0.00042476653,0.0072466456,0.002150963,0.0004075542,0.0010387475,0.0011571274,0.33990702,0.037091095,0.35742182,0.038925618,0.21304488],"study_design_scores_gemma":[0.000076714176,0.00026446534,0.0043331007,0.00035303616,0.00029503112,0.00079426967,0.00020800183,0.5808052,0.013412399,0.3615118,0.03767711,0.00026883188],"about_ca_topic_score_codex":0.0030267267,"about_ca_topic_score_gemma":0.004380408,"teacher_disagreement_score":0.010579739,"about_ca_system_score_codex":0.0047806003,"about_ca_system_score_gemma":0.0016062135,"threshold_uncertainty_score":0.03539276},"labels":[],"label_agreement":null},{"id":"W2186560431","doi":"","title":"Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Interval (graph theory); Maximal independent set; Set (abstract data type); Interval graph; Combinatorics; Space (punctuation); Independent set; Mathematics; Upper and lower bounds; Discrete mathematics; Product (mathematics); Algorithm; Computer science; Pathwidth; Graph; Line graph","score_opus":0.04062558458719696,"score_gpt":0.28570176632086003,"score_spread":0.24507618173366308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186560431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045863867,0.0019300524,0.9353945,0.0016343326,0.0001335339,0.00017838606,0.00091985054,0.0010156588,0.012929726],"genre_scores_gemma":[0.61277455,0.0021195102,0.3732214,0.00033695073,0.00051777577,0.0004834059,0.0020614434,0.0004250748,0.008059882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996849,0.0012942863,0.00011714336,0.0005665116,0.000778267,0.00039473595],"domain_scores_gemma":[0.9917823,0.0058832276,0.0005528178,0.0012504398,0.00023974785,0.00029142536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027553733,0.001371221,0.0019162793,0.0020298285,0.0012294012,0.0050318404,0.0043014297,0.002229429,0.009010656],"category_scores_gemma":[0.014114682,0.001287947,0.002948141,0.00386958,0.0019531955,0.013883795,0.003838443,0.0038228198,0.0014274463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006081686,0.00028431756,0.0010724646,0.00051787193,0.00023681307,0.00020991442,0.0004254975,0.35937735,0.0038426293,0.5483079,0.0136054875,0.07151159],"study_design_scores_gemma":[0.000050160947,0.00005816469,0.0001956235,0.000039867955,0.000043637687,0.00011633587,0.00009342467,0.527191,0.0010674221,0.46736497,0.003760111,0.000019322268],"about_ca_topic_score_codex":0.0029873631,"about_ca_topic_score_gemma":0.0040919813,"teacher_disagreement_score":0.009010656,"about_ca_system_score_codex":0.0032812953,"about_ca_system_score_gemma":0.0019755512,"threshold_uncertainty_score":0.030143619},"labels":[],"label_agreement":null},{"id":"W2187659169","doi":"","title":"Nearly-acyclically pushable tournaments","year":2001,"lang":"es","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Digraph; Combinatorics; Directed acyclic graph; Tournament; Mathematics; Vertex (graph theory); Feedback arc set; Multipartite; Directed graph; Discrete mathematics; Graph; Physics","score_opus":0.028606739771165016,"score_gpt":0.32417497653963234,"score_spread":0.29556823676846733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187659169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77603257,0.00047611134,0.19286717,0.00039681696,0.000072099734,0.00022969738,0.001470587,0.00075746415,0.027697472],"genre_scores_gemma":[0.95637083,0.0002960892,0.036091857,0.000096071,0.000029571936,0.00013842602,0.0012783882,0.000030506577,0.0056682383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932456,0.00012268955,0.000057866084,0.00015413776,0.00015015333,0.00019064848],"domain_scores_gemma":[0.9984901,0.0006684434,0.00025199895,0.00018795748,0.00012218035,0.00027933271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033517464,0.00036423866,0.00049144984,0.00042728873,0.0009258086,0.0016354892,0.0005611053,0.00036991958,0.002959619],"category_scores_gemma":[0.0017821074,0.00028052213,0.0005151807,0.0007260197,0.0008480953,0.0011436364,0.00078716694,0.0005587406,0.00027283892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015001443,0.00041879652,0.013480082,0.00062168954,0.00022546497,0.0018318256,0.0013656513,0.13765119,0.06343115,0.5731987,0.008697993,0.1975774],"study_design_scores_gemma":[0.00030770875,0.00070706464,0.0076587102,0.000085391184,0.00021214921,0.0016543183,0.0006481611,0.28633907,0.021931604,0.6311141,0.0492273,0.00011434997],"about_ca_topic_score_codex":0.002278433,"about_ca_topic_score_gemma":0.003649652,"teacher_disagreement_score":0.002959619,"about_ca_system_score_codex":0.00067001965,"about_ca_system_score_gemma":0.00060423004,"threshold_uncertainty_score":0.009900868},"labels":[],"label_agreement":null},{"id":"W2188243551","doi":"","title":"A class of trees with equal broadcast and domination numbers","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Graph; Class (philosophy); Domination analysis; Dominating set; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.01560847507420745,"score_gpt":0.2673208201156543,"score_spread":0.25171234504144685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188243551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79983073,0.0013925999,0.13638468,0.0008558284,0.00011394857,0.000113917595,0.0012146577,0.00048283476,0.05961085],"genre_scores_gemma":[0.9734202,0.00059250003,0.0139301075,0.00024274921,0.0001860504,0.000100906625,0.00074870704,0.00007936924,0.01069952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884427,0.00013716919,0.000046719968,0.00027963283,0.00031336182,0.00037887646],"domain_scores_gemma":[0.99567765,0.0022464595,0.00066483946,0.00036213634,0.00038597255,0.00066292455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062812667,0.00031614534,0.00068752706,0.0015653775,0.0017954175,0.0028583969,0.0007811122,0.0009552498,0.0037772811],"category_scores_gemma":[0.0047635296,0.00030660388,0.0005658937,0.0012504006,0.0012783435,0.0022803326,0.0012208248,0.0009904475,0.0005001492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060641847,0.0001293389,0.008335337,0.00022572171,0.00007666103,0.00073653884,0.0014478607,0.038761325,0.015479576,0.87009794,0.011483244,0.05261998],"study_design_scores_gemma":[0.00024477774,0.00030920608,0.00940411,0.00008195728,0.000102543076,0.002951453,0.0009947398,0.20989245,0.0049614175,0.7317642,0.0392005,0.00009261637],"about_ca_topic_score_codex":0.0031828028,"about_ca_topic_score_gemma":0.0025365744,"teacher_disagreement_score":0.0037772811,"about_ca_system_score_codex":0.0017846104,"about_ca_system_score_gemma":0.0007855023,"threshold_uncertainty_score":0.012948275},"labels":[],"label_agreement":null},{"id":"W2188244362","doi":"10.82308/16876","title":"Claw-free graphs and two conjectures on omega, Delta, and chi","year":2009,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Neighbourhood (mathematics); Claw; Vertex (graph theory); Discrete mathematics; Upper and lower bounds; Chromatic scale; Graph","score_opus":0.016147168152786755,"score_gpt":0.2641341385737215,"score_spread":0.24798697042093473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188244362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8619449,0.0015047378,0.082471944,0.0045538926,0.000116132775,0.00006391401,0.00033376776,0.0006769338,0.04833371],"genre_scores_gemma":[0.9891102,0.00027792892,0.006669668,0.0003962886,0.00009691115,0.00004042945,0.00025916574,0.000049758724,0.0030996504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992933,0.000103089114,0.000029952587,0.00025535174,0.0001536435,0.00016462663],"domain_scores_gemma":[0.9894037,0.005895875,0.0011726448,0.0016791708,0.0009585427,0.00089009467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015622184,0.00034774689,0.0004786781,0.0017672115,0.0014553955,0.0015398081,0.0013602076,0.0011038671,0.004278402],"category_scores_gemma":[0.010497251,0.00042970196,0.00049851544,0.0012729815,0.003523303,0.0058376305,0.0019679824,0.0025889445,0.00041362352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021981758,0.00008775535,0.0076636523,0.0001424986,0.000028134851,0.00015380258,0.001600059,0.011155675,0.0055825817,0.92925066,0.0047682715,0.039347075],"study_design_scores_gemma":[0.000050789567,0.00011623009,0.006420192,0.00006748131,0.00003417458,0.00028340495,0.00082101335,0.03344473,0.0056398935,0.94436944,0.008682883,0.00006988183],"about_ca_topic_score_codex":0.0031416395,"about_ca_topic_score_gemma":0.0030345053,"teacher_disagreement_score":0.004278402,"about_ca_system_score_codex":0.0018141269,"about_ca_system_score_gemma":0.0007046618,"threshold_uncertainty_score":0.014312625},"labels":[],"label_agreement":null},{"id":"W2188424643","doi":"10.1093/comjnl/bxv084","title":"Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two","year":2015,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Lexicographical order; Cartesian product; Product (mathematics); Library science; Mathematics; Cartesian coordinate system; Computer science; Combinatorics; Physics; Geometry","score_opus":0.027513199516112835,"score_gpt":0.2883925827735022,"score_spread":0.26087938325738935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188424643","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4792184,0.00041402053,0.46259496,0.0013740419,0.0003010622,0.00021188289,0.0012720408,0.003477941,0.05113561],"genre_scores_gemma":[0.68915206,0.00027618968,0.29245043,0.0005818817,0.00008786104,0.00030830863,0.0022368229,0.00073061744,0.014175771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984779,0.00035833736,0.0001141185,0.00048928725,0.0002788537,0.0002814726],"domain_scores_gemma":[0.99408406,0.0025899466,0.0004842863,0.001589541,0.00084787555,0.00040430695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011573634,0.0007956852,0.0006952182,0.00066245813,0.001168979,0.0015424268,0.0009049053,0.0009219899,0.0135802915],"category_scores_gemma":[0.006341541,0.0005312311,0.0006653532,0.0012737735,0.0019690092,0.0045939507,0.0022694245,0.001452024,0.0028831435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032828485,0.00058763893,0.007574763,0.0008645166,0.000084828505,0.0009518847,0.001840512,0.045552876,0.08434529,0.62534076,0.02256498,0.20700906],"study_design_scores_gemma":[0.00026203942,0.0011011753,0.003173374,0.00015409027,0.00013877975,0.0011693808,0.0010792569,0.19245708,0.10559462,0.63235945,0.062344197,0.00016642027],"about_ca_topic_score_codex":0.0015605103,"about_ca_topic_score_gemma":0.0025057946,"teacher_disagreement_score":0.0135802915,"about_ca_system_score_codex":0.0010614278,"about_ca_system_score_gemma":0.0010182797,"threshold_uncertainty_score":0.0454306},"labels":[],"label_agreement":null},{"id":"W2188440933","doi":"","title":"Optimal Bounds on Theta-Graphs: More is not Always Better.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics","score_opus":0.05157835567815482,"score_gpt":0.30788677617249155,"score_spread":0.2563084204943367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188440933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35721105,0.034912672,0.46379736,0.018273208,0.00131118,0.0001111809,0.0019400929,0.0018389473,0.120604366],"genre_scores_gemma":[0.9020146,0.00646697,0.08231663,0.0025277846,0.00067150133,0.000103504964,0.0008767075,0.00063351414,0.004388781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974324,0.0007565444,0.000096932934,0.0004797556,0.00057038985,0.0006640381],"domain_scores_gemma":[0.9885324,0.0069779716,0.0010804206,0.0018950735,0.00075154204,0.0007625469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031101021,0.0017281948,0.0014149386,0.0016555547,0.0013015021,0.0031686919,0.0019432931,0.0015567627,0.013273388],"category_scores_gemma":[0.019773506,0.00080933044,0.0010661667,0.002234929,0.0018629486,0.011212025,0.0024424829,0.0031090924,0.0019506373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008455239,0.00032397377,0.0048688897,0.0010403509,0.0002531179,0.00029907122,0.00039027745,0.13132286,0.014393512,0.6846283,0.034322336,0.12731184],"study_design_scores_gemma":[0.000067847,0.00020696521,0.0021864062,0.00023338309,0.00010795481,0.0007405174,0.0003691048,0.1370068,0.0050723944,0.8366683,0.017280715,0.0000594722],"about_ca_topic_score_codex":0.0009538734,"about_ca_topic_score_gemma":0.0014107912,"teacher_disagreement_score":0.013273388,"about_ca_system_score_codex":0.0016339149,"about_ca_system_score_gemma":0.00077443256,"threshold_uncertainty_score":0.04440391},"labels":[],"label_agreement":null},{"id":"W2188854178","doi":"","title":"The modular product and existential closure II","year":2012,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Graph; Adjacency list; Adjacency matrix; Modular design; Closure (psychology); Discrete mathematics; Computer science","score_opus":0.025296255952936945,"score_gpt":0.28952756527783374,"score_spread":0.2642313093248968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188854178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66434723,0.000765729,0.27241185,0.00068089436,0.00019436918,0.000061458646,0.00020147997,0.00031049963,0.061026484],"genre_scores_gemma":[0.96765745,0.00019364046,0.025428848,0.00017223034,0.00008333378,0.0000404773,0.00014692721,0.00010778486,0.006169374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911493,0.00017305632,0.00004620633,0.00029274652,0.00018204734,0.00019101646],"domain_scores_gemma":[0.9984428,0.00052841246,0.00021010637,0.00037239102,0.00018913657,0.00025722967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012181035,0.00044876753,0.00040478332,0.0005315905,0.0010170552,0.0010953711,0.0006424993,0.00044847585,0.0032932754],"category_scores_gemma":[0.0025385658,0.00026593474,0.0009856104,0.00035940998,0.0039474685,0.0031322367,0.0025847135,0.0015185016,0.00029903644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008351634,0.000032594835,0.0010293922,0.00006616662,0.000015190075,0.00027054572,0.00054483133,0.0028815805,0.010490067,0.9708202,0.000735964,0.013029757],"study_design_scores_gemma":[0.000023871351,0.00023033115,0.0014233534,0.000034810837,0.00003437802,0.00078932557,0.0003172014,0.0134569295,0.016399978,0.9524987,0.014755442,0.000035654168],"about_ca_topic_score_codex":0.0004605925,"about_ca_topic_score_gemma":0.0002829584,"teacher_disagreement_score":0.0032932754,"about_ca_system_score_codex":0.0006800016,"about_ca_system_score_gemma":0.00037794458,"threshold_uncertainty_score":0.011017084},"labels":[],"label_agreement":null},{"id":"W2200162493","doi":"10.1016/j.disc.2016.08.005","title":"The complexity of signed graph and edge-coloured graph homomorphisms","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Signed graph; Homomorphism; Mathematics; Combinatorics; Discrete mathematics; Graph homomorphism; Vertex (graph theory); Conjecture; Graph; Line graph; Voltage graph","score_opus":0.0429401250024845,"score_gpt":0.28911771706390726,"score_spread":0.24617759206142276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200162493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73218864,0.0015803218,0.2103491,0.0076555447,0.00031134306,0.00013532808,0.0023208898,0.00055622763,0.04490254],"genre_scores_gemma":[0.9644627,0.0008586218,0.022128161,0.0003631439,0.00036295276,0.0001342257,0.0013878217,0.00020602276,0.010096402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966606,0.0009182853,0.0001778258,0.00064940855,0.0010517234,0.00054220494],"domain_scores_gemma":[0.97558933,0.018222027,0.0018060885,0.0019332673,0.0010034676,0.0014457948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019342969,0.0009067873,0.0017401113,0.0019050281,0.0016165714,0.0075133215,0.00375614,0.002769286,0.013677404],"category_scores_gemma":[0.019946637,0.0008022992,0.0017363516,0.0028332882,0.004184862,0.019716032,0.004234721,0.0046058106,0.0009951773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046108832,0.000170624,0.0023959358,0.00025394597,0.000062762534,0.00017185975,0.0006677722,0.04073751,0.0018338098,0.92774373,0.005619662,0.019881325],"study_design_scores_gemma":[0.000035978355,0.000022151462,0.00043012656,0.0000133912035,0.000018779863,0.00007504893,0.0000935584,0.0595971,0.0005209756,0.9383006,0.0008722278,0.000020069056],"about_ca_topic_score_codex":0.0026062971,"about_ca_topic_score_gemma":0.0022638321,"teacher_disagreement_score":0.013677404,"about_ca_system_score_codex":0.003953636,"about_ca_system_score_gemma":0.002013789,"threshold_uncertainty_score":0.045755506},"labels":[],"label_agreement":null},{"id":"W2204215863","doi":"10.1016/j.dam.2015.10.024","title":"Complexity of coloring graphs without paths and cycles","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Complement (music); Characterization (materials science); Induced subgraph; Discrete mathematics; Time complexity; Graph; Vertex (graph theory); Physics","score_opus":0.08204450352929933,"score_gpt":0.32120248056189943,"score_spread":0.2391579770326001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204215863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77967525,0.0010254369,0.16201223,0.00833548,0.00027972198,0.0002879349,0.005000081,0.0011724369,0.04221139],"genre_scores_gemma":[0.94024926,0.0008481009,0.03920521,0.00076746783,0.0004033323,0.00022758923,0.004399693,0.0005873655,0.013312036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760073,0.00064115,0.00010526638,0.0005709751,0.0005490347,0.0005327799],"domain_scores_gemma":[0.9673457,0.026076084,0.0016841894,0.002255464,0.00092206086,0.0017164901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001402234,0.0015340961,0.0019065402,0.0013992931,0.0018999631,0.0066181007,0.0041984883,0.0028803195,0.018311895],"category_scores_gemma":[0.016339224,0.0013135731,0.002040609,0.0028117155,0.002651638,0.011682016,0.0026873131,0.0037268694,0.0010319331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021057962,0.00078046724,0.01210626,0.0011097749,0.0003475911,0.0006446191,0.0015289495,0.3191553,0.009848688,0.55804944,0.034830097,0.059492998],"study_design_scores_gemma":[0.00024557646,0.00006591635,0.001541654,0.000035113033,0.00009825394,0.00023621836,0.00030722126,0.22426869,0.0017375633,0.76929516,0.002130978,0.000037580507],"about_ca_topic_score_codex":0.006842099,"about_ca_topic_score_gemma":0.0077170474,"teacher_disagreement_score":0.018311895,"about_ca_system_score_codex":0.004170286,"about_ca_system_score_gemma":0.003338387,"threshold_uncertainty_score":0.06125939},"labels":[],"label_agreement":null},{"id":"W2205459017","doi":"10.22108/toc.2016.11972","title":"Total $k$-distance domination critical graphs","year":2016,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"La Cité Collégiale","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Domination analysis; Dominating set; Graph; Discrete mathematics","score_opus":0.19250794685020417,"score_gpt":0.5660743648825846,"score_spread":0.3735664180323804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205459017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7958913,0.0021092317,0.16546589,0.0010726844,0.000087922286,0.00014922091,0.0010684457,0.00021779015,0.03393753],"genre_scores_gemma":[0.9754929,0.0009684762,0.01697948,0.0002134652,0.000065621774,0.00007212876,0.0006087182,0.000059922888,0.0055393726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941707,0.000083447005,0.000028832272,0.00017297713,0.00015232632,0.00014527235],"domain_scores_gemma":[0.99578625,0.0021230828,0.0005803327,0.00022612978,0.00062795024,0.0006562506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005715709,0.0006493633,0.0005005818,0.0020574823,0.0012592977,0.0013295866,0.0011192476,0.00044695698,0.0029737486],"category_scores_gemma":[0.003552381,0.0003694517,0.00043346765,0.0015306802,0.0012018152,0.001927507,0.0011522614,0.00074115023,0.00023942489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064234756,0.00020951741,0.022595087,0.0014046635,0.00026063054,0.0016706964,0.0030038746,0.11339851,0.048159666,0.7074894,0.015104285,0.086061396],"study_design_scores_gemma":[0.00011631115,0.0003172835,0.009306694,0.00017339984,0.00023862587,0.004151005,0.0021825437,0.18872817,0.02304324,0.73298085,0.0386536,0.00010831605],"about_ca_topic_score_codex":0.0017519239,"about_ca_topic_score_gemma":0.0019821734,"teacher_disagreement_score":0.0029737486,"about_ca_system_score_codex":0.0015472973,"about_ca_system_score_gemma":0.0006069578,"threshold_uncertainty_score":0.011226416},"labels":[],"label_agreement":null},{"id":"W2207885168","doi":"10.23638/dmtcs-19-1-20","title":"Equivalence of the filament and overlap graphs of subtrees of limited trees","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equivalence (formal languages); Combinatorics; Mathematics; Discrete mathematics","score_opus":0.024863027125050858,"score_gpt":0.3021602226932132,"score_spread":0.27729719556816235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207885168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78699565,0.0002575544,0.14696898,0.0002601268,0.00005892885,0.000097427815,0.0004297862,0.00025636857,0.06467521],"genre_scores_gemma":[0.9802013,0.00018260788,0.015274947,0.00009078459,0.000043507112,0.00007180221,0.000555361,0.000100006684,0.0034797594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928576,0.00012780984,0.000033366665,0.00019237518,0.0002323588,0.00012831227],"domain_scores_gemma":[0.99722505,0.0011730184,0.0004110429,0.00035502747,0.00048810092,0.00034770736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004356723,0.0002567079,0.00039605645,0.0012843875,0.0013822195,0.0017581115,0.0008679503,0.0006198788,0.0071774395],"category_scores_gemma":[0.0032170608,0.00033079417,0.0005969745,0.0008791416,0.0017388427,0.0036194113,0.0016564013,0.0010349359,0.00041361785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001697838,0.00006476748,0.0040488597,0.00010555264,0.000028272645,0.0005252632,0.0010182571,0.002684128,0.011100357,0.9515086,0.0013345644,0.027411638],"study_design_scores_gemma":[0.000034681718,0.00012078795,0.012159206,0.00008573451,0.000097005686,0.0015921072,0.0015958803,0.03425489,0.0110809645,0.9237794,0.015151805,0.000047560836],"about_ca_topic_score_codex":0.0016994292,"about_ca_topic_score_gemma":0.001323381,"teacher_disagreement_score":0.0071774395,"about_ca_system_score_codex":0.00061040523,"about_ca_system_score_gemma":0.00033148934,"threshold_uncertainty_score":0.024010956},"labels":[],"label_agreement":null},{"id":"W2213333469","doi":"","title":"Some new results on domination polynomials of graphs","year":2015,"lang":"en","type":"article","venue":"Filomat","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.054988141678179676,"score_gpt":0.3215748375180887,"score_spread":0.266586695839909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213333469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39676932,0.007965627,0.3067353,0.0041781324,0.00046781413,0.0001014489,0.0013549858,0.0006066987,0.28182065],"genre_scores_gemma":[0.9392617,0.004147618,0.021347327,0.00050801906,0.0008828221,0.00004471764,0.00057566183,0.00017941368,0.033052634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994584,0.000075443495,0.000015754731,0.00011466026,0.00018991523,0.00014593573],"domain_scores_gemma":[0.99848276,0.0008018535,0.00017824236,0.00012878832,0.00021302767,0.00019536758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004701212,0.0005841311,0.00038192488,0.0022566048,0.0012009849,0.0014627394,0.0007345267,0.000498248,0.007682026],"category_scores_gemma":[0.003582736,0.000304622,0.00060551567,0.0028263396,0.0014087154,0.0030456027,0.0011303105,0.0021634991,0.0009035906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079581914,0.00005151324,0.0012237043,0.0001778062,0.00001459866,0.00024141344,0.0007695423,0.009312475,0.0046056765,0.9380692,0.005512623,0.039941784],"study_design_scores_gemma":[0.000025110803,0.000051508596,0.0018479383,0.00005270505,0.000021341444,0.0006213008,0.00026053263,0.033613466,0.0022729011,0.92269784,0.03850482,0.000030670955],"about_ca_topic_score_codex":0.003322338,"about_ca_topic_score_gemma":0.003190658,"teacher_disagreement_score":0.007682026,"about_ca_system_score_codex":0.0017179529,"about_ca_system_score_gemma":0.0004580262,"threshold_uncertainty_score":0.02569896},"labels":[],"label_agreement":null},{"id":"W2214784206","doi":"10.1016/j.disc.2015.10.007","title":"Mapping planar graphs into the Coxeter graph","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre National de la Recherche Scientifique; China Scholarship Council; Université Paris-Sud; Javna Agencija za Raziskovalno Dejavnost RS; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Coxeter group; Combinatorics; Coxeter graph; Planar graph; Discrete mathematics; Artin group; Coxeter element; Outerplanar graph; Graph minor; Coxeter complex; Graph homomorphism; Line graph; Graph; Voltage graph","score_opus":0.04711086523227034,"score_gpt":0.30476144166333313,"score_spread":0.2576505764310628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214784206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2639601,0.0004439645,0.61667573,0.0019324062,0.0004917244,0.00015824231,0.00042685657,0.0010160569,0.114894815],"genre_scores_gemma":[0.79276323,0.0011900517,0.13716166,0.00064914045,0.00034387913,0.00015283705,0.0006367482,0.00071628956,0.06638614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997913,0.00005089893,0.0000070663027,0.00006186107,0.000056941994,0.00003194848],"domain_scores_gemma":[0.99940705,0.00023360444,0.00008373611,0.00013475076,0.00007867517,0.00006225909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002232241,0.00043959855,0.00029159235,0.0010297872,0.00066690246,0.0013695309,0.0008541889,0.0006301062,0.011292151],"category_scores_gemma":[0.002181093,0.0002975789,0.00049187255,0.0008735991,0.001130507,0.0029305094,0.002006687,0.0019583157,0.0012511326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000621789,0.00004695166,0.0002965818,0.000064336906,0.000008022927,0.00010506493,0.00033493695,0.005849401,0.00397581,0.9340091,0.003756153,0.051491484],"study_design_scores_gemma":[0.000015292504,0.0000325884,0.00022484601,0.000010423678,0.000007519889,0.00012376306,0.0002188421,0.01497811,0.0017127321,0.9710043,0.011660832,0.000010735901],"about_ca_topic_score_codex":0.0013401507,"about_ca_topic_score_gemma":0.0011744989,"teacher_disagreement_score":0.011292151,"about_ca_system_score_codex":0.0005522128,"about_ca_system_score_gemma":0.00042973497,"threshold_uncertainty_score":0.037776053},"labels":[],"label_agreement":null},{"id":"W2216988477","doi":"10.37236/4141","title":"Thin Edges in Braces","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Graph; Isomorphism (crystallography); Matching (statistics); Brace; Discrete mathematics; Physics; Crystallography","score_opus":0.025499532920950443,"score_gpt":0.2907831718446497,"score_spread":0.26528363892369927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216988477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21958457,0.0035651617,0.48689505,0.002854645,0.0026610452,0.00040602876,0.002406958,0.0019801382,0.2796464],"genre_scores_gemma":[0.74243563,0.0022965039,0.12648095,0.002453086,0.0006328785,0.00071523665,0.0019165494,0.0015652686,0.12150391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984263,0.00026006246,0.00011201994,0.00045778704,0.0002919542,0.0004518655],"domain_scores_gemma":[0.99657506,0.0013961529,0.00040642146,0.000695032,0.00056440267,0.00036292447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006331589,0.0007876239,0.0007604416,0.0014944979,0.0024389927,0.0027459096,0.0011526122,0.0013402732,0.031018348],"category_scores_gemma":[0.0054614474,0.0010841535,0.0010893139,0.0014580305,0.0037479606,0.0076504014,0.0037374184,0.0028354374,0.0070811408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012417442,0.000025586503,0.0005435393,0.00018806584,0.000013372192,0.0003619359,0.00076745055,0.0008715342,0.0061061694,0.96343553,0.0062570777,0.021305533],"study_design_scores_gemma":[0.000034478322,0.00007842318,0.0006265624,0.00012259539,0.00002376332,0.0007294541,0.0006758535,0.0033186048,0.0068719857,0.87728024,0.11019302,0.000045073877],"about_ca_topic_score_codex":0.0010294125,"about_ca_topic_score_gemma":0.0018012244,"teacher_disagreement_score":0.031018348,"about_ca_system_score_codex":0.00078868703,"about_ca_system_score_gemma":0.00062492845,"threshold_uncertainty_score":0.10376668},"labels":[],"label_agreement":null},{"id":"W2218492333","doi":"10.1007/978-3-319-07956-1_18","title":"Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Digraph; Combinatorics; Shortest path problem; Undirected graph; Floyd–Warshall algorithm; Mathematics; Arc (geometry); Algorithm; Discrete mathematics; Computer science; K shortest path routing; Graph","score_opus":0.011084221733546137,"score_gpt":0.24170862491285053,"score_spread":0.23062440317930438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218492333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2150312,0.001333795,0.7189349,0.0015972336,0.00029031513,0.00029859497,0.0033152122,0.0010028885,0.058195855],"genre_scores_gemma":[0.7233083,0.0022512511,0.23199116,0.00031317587,0.0002310903,0.00040487156,0.0031170526,0.00046443127,0.037918713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934286,0.0001130856,0.00003903433,0.00022024373,0.00018291247,0.00010182563],"domain_scores_gemma":[0.9972146,0.0015989719,0.00027802878,0.00030050924,0.0003697674,0.00023812312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004227244,0.0011225776,0.0010363656,0.0016825228,0.0012444876,0.0022122704,0.0017185909,0.0011487079,0.00672794],"category_scores_gemma":[0.0039517214,0.0008846885,0.0008242944,0.0034087026,0.00089107704,0.0044357227,0.0017374692,0.002009291,0.0011436086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030920134,0.00015069853,0.000887304,0.0012382116,0.00013201343,0.0006772919,0.0005993953,0.14959347,0.011429044,0.67879444,0.017001491,0.1391875],"study_design_scores_gemma":[0.00005478868,0.00005809792,0.00034252892,0.00010398354,0.000056902692,0.00043451317,0.00020564745,0.15834525,0.0030952215,0.82620525,0.011062633,0.00003511944],"about_ca_topic_score_codex":0.0015823308,"about_ca_topic_score_gemma":0.0030898107,"teacher_disagreement_score":0.00672794,"about_ca_system_score_codex":0.001551853,"about_ca_system_score_gemma":0.0010777017,"threshold_uncertainty_score":0.02250719},"labels":[],"label_agreement":null},{"id":"W2219611942","doi":"10.1016/j.tcs.2015.12.012","title":"A probabilistic version of the game of Zombies and Survivors on graphs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Zombie; Vertex (graph theory); Mathematics; Discrete mathematics; Probabilistic logic; Graph; Computer science; Statistics; Computer security","score_opus":0.019414974779184177,"score_gpt":0.27299347884894193,"score_spread":0.25357850406975774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219611942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19615531,0.00070130895,0.7079479,0.0065013347,0.00027698645,0.00032474168,0.0013706066,0.0005117979,0.08620991],"genre_scores_gemma":[0.8964629,0.00072107074,0.059955396,0.00082686695,0.00035345895,0.00030126225,0.00060927146,0.00026893304,0.04050091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971745,0.0011222952,0.00013165739,0.00054238364,0.0005390598,0.0004899957],"domain_scores_gemma":[0.9904383,0.0056588193,0.0007862949,0.0014130841,0.00064953935,0.0010539705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025511226,0.0009098974,0.0017948322,0.0015238516,0.0021949157,0.0048848377,0.0046640355,0.0037150525,0.01991909],"category_scores_gemma":[0.016115291,0.0011885047,0.0014939834,0.0021028346,0.004730892,0.010462207,0.0038705268,0.0044629276,0.0010459422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000456856,0.000018838266,0.00022200639,0.00004672709,0.000017920996,0.00004397087,0.0001906879,0.015355967,0.00033824585,0.9790597,0.0019511958,0.0027090781],"study_design_scores_gemma":[0.000033188615,0.000016378057,0.00015429658,0.000013964515,0.000013348844,0.000060911087,0.00007669585,0.062011465,0.00010465669,0.93538964,0.0021044067,0.000021024747],"about_ca_topic_score_codex":0.0073476625,"about_ca_topic_score_gemma":0.0059604193,"teacher_disagreement_score":0.01991909,"about_ca_system_score_codex":0.0021038475,"about_ca_system_score_gemma":0.002015675,"threshold_uncertainty_score":0.066636026},"labels":[],"label_agreement":null},{"id":"W2221458177","doi":"10.48550/arxiv.1508.07357","title":"Compressed Cliques Graphs, Clique Coverings and Positive Zero Forcing","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Clique problem; Mathematics; Combinatorics; Clique graph; Uniqueness; Clique; Vertex (graph theory); Discrete mathematics; Forcing (mathematics); Split graph; Clique-sum; Block graph; Popularity; Graph; Context (archaeology); Zero (linguistics); Chordal graph; Line graph; 1-planar graph; Graph power; Geography; Mathematical analysis","score_opus":0.07409651300647802,"score_gpt":0.2296481115847455,"score_spread":0.15555159857826747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221458177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6506673,0.0012138414,0.29656872,0.0029031963,0.00015719057,0.00013542794,0.0011028094,0.00042561776,0.04682592],"genre_scores_gemma":[0.96702886,0.0004929373,0.025540212,0.00032259015,0.00021487701,0.00010138115,0.00061444956,0.00016343303,0.0055211755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990514,0.00025670105,0.00003481962,0.00025605384,0.00026208002,0.00013897344],"domain_scores_gemma":[0.9926379,0.0044723344,0.0011349438,0.00081541145,0.0004316024,0.0005079039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008829256,0.0005317362,0.000715721,0.0018522147,0.0019442036,0.0022989803,0.0010489892,0.001465849,0.006896428],"category_scores_gemma":[0.0085917665,0.00045792706,0.0006246146,0.0017438484,0.004278623,0.0052532046,0.0021233147,0.0020429066,0.0005161748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054202177,0.000023445977,0.0013682074,0.00007560915,0.000017104288,0.00013081843,0.00034148278,0.0078709535,0.002594372,0.9769159,0.0015177301,0.009090269],"study_design_scores_gemma":[0.000015358095,0.000027940765,0.0008260393,0.000027671926,0.000012423744,0.00034830213,0.00026715032,0.027360791,0.0015725167,0.96558374,0.0039309547,0.000027062064],"about_ca_topic_score_codex":0.0010716614,"about_ca_topic_score_gemma":0.0012064099,"teacher_disagreement_score":0.006896428,"about_ca_system_score_codex":0.0013196372,"about_ca_system_score_gemma":0.0006463416,"threshold_uncertainty_score":0.023070872},"labels":[],"label_agreement":null},{"id":"W2227332211","doi":"10.3138/infor.52.4.185","title":"Valid Inequalities and Separation Algorithms for the Set Partitioning Problem","year":2014,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Set (abstract data type); Clique; Rank (graph theory); Mathematical optimization; Computer science; Inequality; Algorithm; Mathematics; Combinatorics; Programming language","score_opus":0.13056474742184537,"score_gpt":0.4183798404732468,"score_spread":0.2878150930514014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227332211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037839636,0.0004495439,0.98861957,0.00053861213,0.00008177922,0.000115223076,0.00015712058,0.0001840682,0.0060702204],"genre_scores_gemma":[0.0902151,0.0014409114,0.899231,0.0004222405,0.00020650527,0.00044276597,0.001181016,0.00031016613,0.006550222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566406,0.0017851773,0.0002347659,0.0005863973,0.0012927699,0.00043678095],"domain_scores_gemma":[0.9915513,0.0065329415,0.00058693334,0.0005698945,0.00056756125,0.00019128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041283886,0.0023209972,0.0011842236,0.0015345673,0.0013200935,0.0034097896,0.0033072506,0.0016549077,0.008860486],"category_scores_gemma":[0.0143808685,0.0011720095,0.0022091707,0.0032775842,0.0017568434,0.006012175,0.002965068,0.007255211,0.001508045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021176263,0.00029413414,0.000443494,0.00054367614,0.00011392268,0.00014409459,0.00028779026,0.22015302,0.0028601005,0.5788389,0.010448079,0.18566105],"study_design_scores_gemma":[0.00011007706,0.00007909763,0.0001768825,0.00010058374,0.000054637847,0.00010917471,0.00009149725,0.5753532,0.002496402,0.41138408,0.010013458,0.00003089692],"about_ca_topic_score_codex":0.0030996674,"about_ca_topic_score_gemma":0.00457881,"teacher_disagreement_score":0.008860486,"about_ca_system_score_codex":0.0026355768,"about_ca_system_score_gemma":0.0026776793,"threshold_uncertainty_score":0.02964133},"labels":[],"label_agreement":null},{"id":"W2234017799","doi":"10.1142/s0129054118500053","title":"Arbitrary Overlap Constraints in Graph Packing Problems","year":2018,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Induced subgraph; Graph; Function (biology); Discrete mathematics; Vertex (graph theory)","score_opus":0.03772099834689924,"score_gpt":0.352113442025102,"score_spread":0.31439244367820274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234017799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067161284,0.0017212983,0.9061982,0.0029001322,0.00023495799,0.0007129591,0.00075152965,0.0009790789,0.019340554],"genre_scores_gemma":[0.34741548,0.0015370399,0.6308978,0.0013878664,0.0006770271,0.0013634014,0.0023713533,0.0010453138,0.013304786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934383,0.0025898803,0.00048152983,0.0014075042,0.001241957,0.0008408704],"domain_scores_gemma":[0.9771433,0.017939355,0.0012197614,0.0019891516,0.00085995527,0.0008485119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005718438,0.0033101737,0.0039163395,0.0019499887,0.0032188685,0.0041886456,0.004394998,0.004992386,0.0120998835],"category_scores_gemma":[0.0325278,0.0022775321,0.0027946357,0.005696166,0.003444097,0.014637772,0.006393544,0.005599778,0.0017366622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009890143,0.000888307,0.001980779,0.001337573,0.00023977258,0.0007193901,0.0010990227,0.40476993,0.003115381,0.38903916,0.022801716,0.17301999],"study_design_scores_gemma":[0.00016895703,0.00020146822,0.00037270822,0.00013142395,0.00007313639,0.00037997228,0.00034995173,0.50477135,0.002546978,0.48051375,0.01043066,0.00005969104],"about_ca_topic_score_codex":0.0020300122,"about_ca_topic_score_gemma":0.0020377752,"teacher_disagreement_score":0.0120998835,"about_ca_system_score_codex":0.002244971,"about_ca_system_score_gemma":0.0017025669,"threshold_uncertainty_score":0.04047817},"labels":[],"label_agreement":null},{"id":"W2234839101","doi":"10.1016/j.disc.2015.12.015","title":"Bicircular matroids are 3-colorable","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Graphic matroid; Matroid partitioning; Conjecture; Minor (academic); Discrete mathematics; Oriented matroid; Graph; Weighted matroid","score_opus":0.022580380518233262,"score_gpt":0.2829587157284189,"score_spread":0.26037833521018566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234839101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70923424,0.0010082518,0.11135637,0.002710939,0.00042965356,0.00026876398,0.0033587806,0.0014055759,0.17022741],"genre_scores_gemma":[0.8992007,0.0008991204,0.04270063,0.000982301,0.00018855036,0.00034048202,0.0023476493,0.00046223024,0.052878316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994784,0.000074325646,0.00002838268,0.00010897971,0.00017494978,0.0001350787],"domain_scores_gemma":[0.9981522,0.0005918603,0.0004372523,0.00015997038,0.00031075755,0.0003478425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029676492,0.0012469419,0.001144276,0.0014574039,0.0017914507,0.0042732446,0.0017934341,0.0014559424,0.015457942],"category_scores_gemma":[0.0014775799,0.0012333744,0.00076835806,0.0020535882,0.0014957037,0.002790762,0.0017076544,0.0034347728,0.0028680353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060781074,0.00020098654,0.0015134447,0.0004506372,0.000074492506,0.00058491837,0.00077535963,0.007922294,0.014644971,0.90794575,0.01716677,0.048112568],"study_design_scores_gemma":[0.00013338172,0.00008195668,0.0020059159,0.00007503231,0.00006846902,0.00073096046,0.00046751832,0.02075949,0.0048173787,0.9523623,0.018440416,0.000057262365],"about_ca_topic_score_codex":0.0026997162,"about_ca_topic_score_gemma":0.004263133,"teacher_disagreement_score":0.015457942,"about_ca_system_score_codex":0.001532218,"about_ca_system_score_gemma":0.0006885621,"threshold_uncertainty_score":0.051711917},"labels":[],"label_agreement":null},{"id":"W223802390","doi":"10.1016/j.jctb.2015.12.006","title":"Three-edge-colouring doublecross cubic graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Cubic graph; Planar graph; Mathematics; Graph minor; Petersen graph; Vertex (graph theory); Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.016231280750028027,"score_gpt":0.27468993591215546,"score_spread":0.2584586551621274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W223802390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79767317,0.00036207552,0.07738523,0.0010103433,0.0003407414,0.00012734736,0.0009794891,0.00067248906,0.12144908],"genre_scores_gemma":[0.9324551,0.00031282083,0.033400096,0.00043722044,0.0000643155,0.000077490266,0.0008954957,0.00020602951,0.032151356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995832,0.00006868605,0.00002097887,0.000082730396,0.00011751846,0.00012689615],"domain_scores_gemma":[0.9986457,0.0003466511,0.0001639381,0.00025180276,0.00027606482,0.0003157887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043944,0.00056998554,0.00064478896,0.0011035096,0.0022390042,0.0021675404,0.0013767069,0.0012193943,0.0107192835],"category_scores_gemma":[0.0014835981,0.00047016022,0.0005339139,0.0012024518,0.0012779782,0.001422573,0.0019111753,0.0019601972,0.0014298537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007739888,0.0003232104,0.003737037,0.0004399528,0.00007006159,0.0019062479,0.0011977796,0.02153139,0.04455556,0.8319927,0.014439268,0.079032786],"study_design_scores_gemma":[0.0002507983,0.00016800508,0.0050118035,0.00013894188,0.00012293577,0.0014365318,0.0011726671,0.0636764,0.02135325,0.8647692,0.041762207,0.00013726606],"about_ca_topic_score_codex":0.0057583298,"about_ca_topic_score_gemma":0.009827151,"teacher_disagreement_score":0.0107192835,"about_ca_system_score_codex":0.0010794685,"about_ca_system_score_gemma":0.001119004,"threshold_uncertainty_score":0.035859525},"labels":[],"label_agreement":null},{"id":"W2238259313","doi":"10.1137/15m1007185","title":"Lehman's Theorem and the Directed Steiner Tree Problem","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Combinatorics; Discrete mathematics; Tree (set theory); Mathematical economics","score_opus":0.015248312301763711,"score_gpt":0.2699891274693736,"score_spread":0.2547408151676099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2238259313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05384207,0.005759436,0.8437911,0.005152305,0.00021402267,0.000059512433,0.0004321839,0.00032324073,0.090426035],"genre_scores_gemma":[0.71084905,0.007939742,0.25203094,0.0013432474,0.0006385078,0.00016997645,0.0009078012,0.00018268745,0.02593803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993338,0.00014165329,0.000033468885,0.00013275201,0.00024865833,0.00010970812],"domain_scores_gemma":[0.9987796,0.0008561793,0.00010019104,0.0000631232,0.00011666918,0.00008433279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012931807,0.0005088872,0.0005374198,0.0009832071,0.0008286965,0.0014796512,0.0011935516,0.00091526186,0.0037758278],"category_scores_gemma":[0.0032355755,0.00035420954,0.0008349817,0.0014440563,0.002343042,0.0038998316,0.0014511248,0.0019775538,0.00050902186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015192532,0.000011416833,0.0001594395,0.000045600056,0.000007109455,0.000051204534,0.00007512272,0.010637181,0.00024450038,0.97403413,0.002288636,0.012430497],"study_design_scores_gemma":[0.000010874912,0.000015496556,0.00012743297,0.000024857978,0.00000919811,0.00008160727,0.00003611637,0.028007464,0.00032141092,0.9614589,0.009898704,0.000007970213],"about_ca_topic_score_codex":0.002128428,"about_ca_topic_score_gemma":0.0020720442,"teacher_disagreement_score":0.0037758278,"about_ca_system_score_codex":0.0019330776,"about_ca_system_score_gemma":0.0010335536,"threshold_uncertainty_score":0.014025569},"labels":[],"label_agreement":null},{"id":"W22396107","doi":"10.1002/pca.2358","title":"Stability Number and f-factor in K 1, n -free Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Factor (programming language); Stability (learning theory); Computer science","score_opus":0.027836573303789525,"score_gpt":0.2782295072133435,"score_spread":0.25039293390955397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22396107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85572946,0.011906792,0.10488068,0.0009358802,0.00016123676,0.00009342477,0.0025812353,0.00041056756,0.023300633],"genre_scores_gemma":[0.978933,0.0019168392,0.01092973,0.00009545702,0.000045804623,0.000059623013,0.0012455578,0.00008273779,0.0066910805],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940145,0.00012266473,0.000019841444,0.00023866033,0.00013487421,0.0000824725],"domain_scores_gemma":[0.9989184,0.00049885665,0.00021906134,0.00010504865,0.00018266868,0.00007586791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006714576,0.0003392539,0.00022903759,0.0015557567,0.0005506824,0.0006069917,0.00037642234,0.00039298754,0.0028457944],"category_scores_gemma":[0.00216363,0.00020876541,0.00028391232,0.0006102936,0.00076201424,0.0010835454,0.0002892651,0.0006580013,0.0008360349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011353963,0.000102252976,0.007675003,0.000616925,0.00012708864,0.00019695761,0.0005802796,0.007306468,0.8814827,0.037693813,0.003586983,0.059496205],"study_design_scores_gemma":[0.000039510553,0.00064954394,0.03337373,0.000076011216,0.000116454146,0.0009809938,0.000248613,0.022896174,0.8672745,0.046303865,0.027907385,0.00013324998],"about_ca_topic_score_codex":0.0033323714,"about_ca_topic_score_gemma":0.0035386228,"teacher_disagreement_score":0.0033323714,"about_ca_system_score_codex":0.0010449084,"about_ca_system_score_gemma":0.00029709612,"threshold_uncertainty_score":0.0095201135},"labels":[],"label_agreement":null},{"id":"W2243190840","doi":"10.5555/2722129.2722244","title":"Four terminal planar Delta-Wye reducibility via rooted K2,4 minors","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Graph; Discrete mathematics; Terminal (telecommunication); Mathematical proof; Computer science; Geometry; Telecommunications","score_opus":0.03958629530490731,"score_gpt":0.30459664743458625,"score_spread":0.26501035212967894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243190840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6363701,0.00016613714,0.3206537,0.00050449366,0.000054264714,0.00017233058,0.000666376,0.001358665,0.040054005],"genre_scores_gemma":[0.8544525,0.00025852225,0.1266196,0.000116913376,0.000030146659,0.000092878974,0.0018716239,0.0003252162,0.016232496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999634,0.000041557516,0.000021052128,0.00010953656,0.000112029724,0.00008170071],"domain_scores_gemma":[0.9993325,0.00023674675,0.0000962472,0.00019485422,0.00007621597,0.0000634357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019739948,0.0005326066,0.00039686603,0.00057867524,0.00068167376,0.0011457289,0.0006582327,0.00040160658,0.0055847005],"category_scores_gemma":[0.0014270209,0.00042899247,0.0009811621,0.00049761933,0.0010819301,0.0014562343,0.0016269378,0.0014959003,0.0009110702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056741154,0.0002607978,0.0034848133,0.00056231313,0.00007965923,0.0015825769,0.0015608969,0.057431474,0.079972945,0.6836815,0.008257411,0.1625582],"study_design_scores_gemma":[0.0000844015,0.00021745676,0.0022800916,0.000052977426,0.00006373135,0.0012743741,0.00060311786,0.08283524,0.06793615,0.81974065,0.024853013,0.00005880565],"about_ca_topic_score_codex":0.0013761997,"about_ca_topic_score_gemma":0.0018953274,"teacher_disagreement_score":0.0055847005,"about_ca_system_score_codex":0.0006751058,"about_ca_system_score_gemma":0.00045354763,"threshold_uncertainty_score":0.018682659},"labels":[],"label_agreement":null},{"id":"W2245804724","doi":"10.4171/022-3/41","title":"Towards a structure theory for matrices and matroids","year":2007,"lang":"en","type":"article","venue":"Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Mathematics; Combinatorics; Computer science","score_opus":0.013644972787517364,"score_gpt":0.2877710016790721,"score_spread":0.27412602889155474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245804724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0154636195,0.01573849,0.8790838,0.009106389,0.0013962124,0.00008159774,0.00034738702,0.0004055804,0.078376874],"genre_scores_gemma":[0.29865867,0.05240359,0.57529837,0.0067678406,0.011303535,0.00039458892,0.0016755295,0.00080423773,0.052693628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986174,0.00044295605,0.000059718594,0.00021514928,0.00053580565,0.00012888556],"domain_scores_gemma":[0.99729806,0.0011971735,0.00023319997,0.00046963073,0.0005476853,0.0002541536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016228828,0.0014195397,0.0012507603,0.004428876,0.0021813232,0.0051738434,0.002672279,0.0024573165,0.0072916173],"category_scores_gemma":[0.00466211,0.0010350262,0.0018535464,0.004669994,0.0050893654,0.013977473,0.0036944132,0.006348762,0.0033852132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040965037,0.00001900115,0.00010523111,0.000073235395,0.000005823072,0.000046361536,0.000131454,0.0010629161,0.00031103365,0.98797256,0.0029250483,0.0073431605],"study_design_scores_gemma":[0.000003590413,0.00001464984,0.00006691293,0.000042595977,0.000004172597,0.00010963714,0.00007620432,0.0039808745,0.00012883668,0.9764248,0.019141115,0.000006552001],"about_ca_topic_score_codex":0.0015447255,"about_ca_topic_score_gemma":0.002027205,"teacher_disagreement_score":0.0072916173,"about_ca_system_score_codex":0.0023568708,"about_ca_system_score_gemma":0.0010911603,"threshold_uncertainty_score":0.024392903},"labels":[],"label_agreement":null},{"id":"W2248358623","doi":"10.4230/lipics.csl.2011.381","title":"A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem","year":2011,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Complexity class; Bipartite graph; Mathematical proof; Lexicographical order; Mathematics; Class (philosophy); Discrete mathematics; Completeness (order theory); Matching (statistics); Computational complexity theory; Computer science; Combinatorics; Time complexity; Theoretical computer science; Graph; Algorithm; Artificial intelligence","score_opus":0.055634707499851235,"score_gpt":0.2694607798329779,"score_spread":0.21382607233312667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248358623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043672934,0.0036915413,0.85404944,0.0095065925,0.00069284916,0.0004901421,0.001856489,0.00051291607,0.08552703],"genre_scores_gemma":[0.6398875,0.003976322,0.32056522,0.0039636367,0.002777504,0.0027216307,0.0033194262,0.00037574893,0.022412984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961493,0.00082416745,0.00037025692,0.0007926878,0.0013623959,0.00050115754],"domain_scores_gemma":[0.99019146,0.0068005705,0.00065080647,0.00088967936,0.0010063174,0.00046127263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003365856,0.0012568927,0.0012046747,0.0058100964,0.0034453557,0.00782432,0.002391624,0.0028930851,0.009780791],"category_scores_gemma":[0.010373257,0.0006998409,0.0029509135,0.0062420843,0.009108367,0.017029777,0.0051809046,0.009651416,0.001165556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060561897,0.000015559763,0.00008311192,0.0000423478,0.000004171494,0.000020882688,0.00010603709,0.0007336224,0.00013093758,0.9941743,0.001074132,0.0036089332],"study_design_scores_gemma":[0.000014667138,0.000018258528,0.00018024183,0.000023061051,0.000007734945,0.000095166724,0.00008008417,0.0056878594,0.0002897334,0.98433775,0.009247535,0.000017796814],"about_ca_topic_score_codex":0.0024868974,"about_ca_topic_score_gemma":0.0012281558,"teacher_disagreement_score":0.009780791,"about_ca_system_score_codex":0.005382829,"about_ca_system_score_gemma":0.0022054352,"threshold_uncertainty_score":0.039055407},"labels":[],"label_agreement":null},{"id":"W2248416884","doi":"10.1002/jgt.22133","title":"On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Corollary; Combinatorics; Klein bottle; Graph; Odd graph; Girth (graph theory); Torus; Discrete mathematics; Chordal graph; 1-planar graph","score_opus":0.025654141477502362,"score_gpt":0.31703868666031704,"score_spread":0.29138454518281465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248416884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.943856,0.0008531187,0.041902967,0.000733336,0.000047338905,0.000043639597,0.00021759144,0.00014072345,0.012205332],"genre_scores_gemma":[0.99077356,0.00036521326,0.0074369824,0.00010366721,0.00005181752,0.00005094785,0.00017018463,0.00004875462,0.000998815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950206,0.00016404879,0.000016589556,0.00009866136,0.000096483,0.0001221331],"domain_scores_gemma":[0.99377877,0.0040233145,0.0006146728,0.00025833576,0.00049249287,0.0008323226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084383355,0.00059358514,0.0009943604,0.0028407478,0.0014912268,0.0016580746,0.0015772998,0.0009961729,0.0038259407],"category_scores_gemma":[0.0081662,0.0007431435,0.0004351004,0.00094799517,0.0027241055,0.002240319,0.0018988241,0.00097538106,0.00029226454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006479614,0.00010342955,0.010688622,0.00043394585,0.00010977516,0.000585961,0.0009425557,0.041427284,0.01786845,0.90658075,0.00543821,0.015173068],"study_design_scores_gemma":[0.000091503556,0.0001034916,0.005946947,0.00013330611,0.00008026659,0.00072965556,0.0005842597,0.15412302,0.007433471,0.8270042,0.003705036,0.000064831125],"about_ca_topic_score_codex":0.001338836,"about_ca_topic_score_gemma":0.0010330097,"teacher_disagreement_score":0.0038259407,"about_ca_system_score_codex":0.0013358078,"about_ca_system_score_gemma":0.00046077697,"threshold_uncertainty_score":0.012799025},"labels":[],"label_agreement":null},{"id":"W2249548238","doi":"10.1002/jgt.22258","title":"On the structure of (banner, odd hole)‐free graphs","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Perfect graph; Chordal graph; Induced subgraph; Split graph; Perfect graph theorem; Vertex (graph theory); Discrete mathematics; Wheel graph; Graph; Graph power; 1-planar graph; Line graph; Pathwidth","score_opus":0.02039802155274871,"score_gpt":0.286452243771761,"score_spread":0.26605422221901226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2249548238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89852494,0.00020352687,0.090403005,0.0003135062,0.000020187204,0.00007211633,0.0006239928,0.00025157057,0.009587175],"genre_scores_gemma":[0.96752083,0.000110355526,0.027678723,0.00009338727,0.000020162544,0.000033120774,0.00084070873,0.000047515765,0.003655118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997098,0.000044877233,0.000016017686,0.000104958075,0.000057796045,0.00006652887],"domain_scores_gemma":[0.998302,0.0006325816,0.00040042546,0.00030015918,0.00016184145,0.00020290216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002638743,0.00027486763,0.00031917013,0.0009559349,0.0008364023,0.00091794075,0.0005824269,0.0003702911,0.0037839243],"category_scores_gemma":[0.0014179001,0.00037709431,0.00025890238,0.0008596641,0.0011258706,0.0022389926,0.0011288836,0.0005553452,0.00028600154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010633024,0.00020154018,0.014039135,0.0003907426,0.000070883,0.0008896561,0.0021211128,0.052712318,0.068517126,0.78080857,0.0046598045,0.07452587],"study_design_scores_gemma":[0.00011025029,0.00026630174,0.0065171607,0.00005692272,0.000052795946,0.00071226765,0.00072968757,0.067423284,0.02028343,0.8864912,0.017303769,0.000052998745],"about_ca_topic_score_codex":0.0013521932,"about_ca_topic_score_gemma":0.002053808,"teacher_disagreement_score":0.0037839243,"about_ca_system_score_codex":0.00056551764,"about_ca_system_score_gemma":0.0003183317,"threshold_uncertainty_score":0.012658417},"labels":[],"label_agreement":null},{"id":"W2253259020","doi":"10.46298/dmtcs.3465","title":"Cycles intersecting edge-cuts of prescribed sizes","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Cubic graph; Planar graph; Graph; Disjoint sets; Disjoint union (topology); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Line graph; Voltage graph","score_opus":0.01957421339543206,"score_gpt":0.3028969954445915,"score_spread":0.2833227820491594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253259020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8221906,0.0005790451,0.1433348,0.00050605857,0.00007483074,0.00007981896,0.0006718133,0.00028780996,0.032275297],"genre_scores_gemma":[0.9444625,0.0003942769,0.047582828,0.00015887244,0.00003148179,0.000061451115,0.00084884226,0.00007559424,0.006384144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952555,0.000043286982,0.00001868452,0.00015397804,0.00012679145,0.00013173731],"domain_scores_gemma":[0.99847144,0.00059750024,0.00033372195,0.00023152515,0.0001744127,0.00019134948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023706524,0.0004932316,0.00044119655,0.0006693929,0.0009681751,0.0012381568,0.000878627,0.00072876364,0.0050387974],"category_scores_gemma":[0.0023898953,0.00044931224,0.0005942191,0.0008564921,0.0010015301,0.0021076188,0.0012574921,0.00088890875,0.00040214925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009168399,0.00016291077,0.0146057485,0.0006448099,0.00014549487,0.0016386125,0.0013334875,0.07156582,0.056320485,0.75744814,0.008520603,0.08669714],"study_design_scores_gemma":[0.00014586355,0.00038932316,0.00945159,0.00022224912,0.00021752123,0.002866565,0.0014842752,0.1982823,0.058354635,0.65476125,0.07372448,0.00009998055],"about_ca_topic_score_codex":0.0038438821,"about_ca_topic_score_gemma":0.0056782695,"teacher_disagreement_score":0.0050387974,"about_ca_system_score_codex":0.0008956895,"about_ca_system_score_gemma":0.00056691514,"threshold_uncertainty_score":0.016856432},"labels":[],"label_agreement":null},{"id":"W2253740506","doi":"","title":"A Simple Algorithm for the Graph Minor Decomposition -- Logic meets Structural Graph Theory","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Graph minor; Tree decomposition; Discrete mathematics; Mathematical proof; Graph property; Clique-width; Minor (academic); Mathematics; Robertson–Seymour theorem; Graph theory; Treewidth; Tree-depth; Algorithm; Computer science; Line graph; Voltage graph; Combinatorics; Graph; Pathwidth","score_opus":0.020353797656034338,"score_gpt":0.3154488165771951,"score_spread":0.29509501892116075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253740506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063927537,0.00013983085,0.9790709,0.00086357584,0.00012034785,0.0003279834,0.00038356887,0.0062255664,0.0064755436],"genre_scores_gemma":[0.07089548,0.00015284444,0.92102283,0.00037816414,0.000073746975,0.00031533733,0.0012568115,0.0011566936,0.004748041],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981705,0.00025634657,0.00014214094,0.00056190125,0.00060328754,0.00026581192],"domain_scores_gemma":[0.9981633,0.00067948725,0.00008095104,0.0005972181,0.00036702215,0.00011215224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010258373,0.0013490289,0.0010876185,0.0017282334,0.001286616,0.0025631532,0.0029500185,0.0015810061,0.02238039],"category_scores_gemma":[0.0049794903,0.0008293249,0.0023164472,0.0017923325,0.0015341545,0.005646983,0.004643417,0.0027166102,0.007113244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006333056,0.0004838335,0.0013903747,0.0007507322,0.0001325939,0.0003705891,0.0007465626,0.010836642,0.034276836,0.2637752,0.03578163,0.65082186],"study_design_scores_gemma":[0.00047117917,0.0003151488,0.0009508283,0.00012920077,0.00017728921,0.0009909767,0.00052136875,0.14778674,0.0342782,0.7341021,0.08012522,0.00015173522],"about_ca_topic_score_codex":0.0019275389,"about_ca_topic_score_gemma":0.0030882985,"teacher_disagreement_score":0.02238039,"about_ca_system_score_codex":0.001731453,"about_ca_system_score_gemma":0.002625647,"threshold_uncertainty_score":0.07486981},"labels":[],"label_agreement":null},{"id":"W2253883587","doi":"10.1016/j.ejc.2017.06.026","title":"On the minimum number of edges in triangle-free 5-critical graphs","year":2017,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Corollary; Disjoint sets; Graph; Vertex (graph theory); Discrete mathematics; Clique number; Cograph; Chordal graph; 1-planar graph","score_opus":0.05218795407067771,"score_gpt":0.32938781679283025,"score_spread":0.2771998627221525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253883587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88372004,0.0016306513,0.0645752,0.0028145988,0.0003173396,0.00014474653,0.0009778087,0.00030418893,0.045515597],"genre_scores_gemma":[0.94977903,0.00090066023,0.03877913,0.0004196892,0.00024278491,0.00015528189,0.0012399548,0.0003040884,0.008179365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991178,0.00024422037,0.00004539813,0.0002188889,0.0001651723,0.0002085122],"domain_scores_gemma":[0.989778,0.0067699184,0.0009901535,0.0004727456,0.00061105605,0.0013780912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011703824,0.0013518397,0.0016327819,0.0026687079,0.002240708,0.0030974727,0.0030820845,0.0027051072,0.014180203],"category_scores_gemma":[0.010520952,0.0010915472,0.00082185713,0.0015169322,0.002407592,0.004667849,0.0018284232,0.00223358,0.0010201848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030591039,0.00044638797,0.009388336,0.0020558606,0.00022518223,0.0012411355,0.0018254197,0.061922166,0.035395555,0.7982724,0.022911487,0.06325699],"study_design_scores_gemma":[0.00031477603,0.00017325078,0.0029983523,0.00021133224,0.00010981635,0.0006513466,0.00083055155,0.06477255,0.0054561575,0.91953075,0.0049005956,0.000050470324],"about_ca_topic_score_codex":0.0010313679,"about_ca_topic_score_gemma":0.0018099551,"teacher_disagreement_score":0.014180203,"about_ca_system_score_codex":0.0015338236,"about_ca_system_score_gemma":0.0007699978,"threshold_uncertainty_score":0.04743755},"labels":[],"label_agreement":null},{"id":"W2254274951","doi":"10.1016/j.jctb.2016.05.010","title":"A new proof of Seymour's 6-flow theorem","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Conjecture; Mathematics; Flow (mathematics); Graph; Robertson–Seymour theorem; Combinatorics; Discrete mathematics; Perspective (graphical); Line graph; Pathwidth; Geometry","score_opus":0.015234688365248295,"score_gpt":0.28032227102838037,"score_spread":0.2650875826631321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254274951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055261023,0.003393806,0.6080897,0.018356355,0.0062575364,0.00024502294,0.0013290602,0.0014549083,0.30561268],"genre_scores_gemma":[0.588173,0.005713435,0.27131343,0.008934065,0.005307596,0.00068291574,0.0014953284,0.0015843477,0.11679584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989446,0.00021927003,0.000054077125,0.0002914874,0.00032338616,0.00016720893],"domain_scores_gemma":[0.9977331,0.0011116676,0.00012289225,0.00034036612,0.00043524668,0.00025671144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018042936,0.0018346257,0.0014247525,0.0034484693,0.0025811277,0.0025727113,0.0026836286,0.002352831,0.026060456],"category_scores_gemma":[0.0056922296,0.00088606915,0.0026751894,0.0022790756,0.0040746885,0.010200737,0.0063218935,0.008069137,0.004234582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004809753,0.00005499866,0.00017250048,0.00013866238,0.000022890084,0.00015119449,0.00023140687,0.00058941654,0.0013097721,0.97469306,0.009677689,0.012910373],"study_design_scores_gemma":[0.000025102976,0.000021695952,0.00023512101,0.00003399203,0.00002121832,0.000116956144,0.000047431993,0.002916934,0.0007245774,0.97319883,0.022638578,0.000019601708],"about_ca_topic_score_codex":0.0013618785,"about_ca_topic_score_gemma":0.0010307948,"teacher_disagreement_score":0.026060456,"about_ca_system_score_codex":0.001524049,"about_ca_system_score_gemma":0.0009938745,"threshold_uncertainty_score":0.08718091},"labels":[],"label_agreement":null},{"id":"W2256982406","doi":"10.1016/j.ejc.2016.09.001","title":"Colourings, homomorphisms, and partitions of transitive digraphs","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transitive relation; Combinatorics; Mathematics; Homomorphism; Class (philosophy); Transitive reduction; Discrete mathematics; Graph; Computer science; Line graph; Voltage graph; Artificial intelligence","score_opus":0.013774946470163807,"score_gpt":0.2306429583358,"score_spread":0.2168680118656362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256982406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8314861,0.0007522348,0.13981998,0.0005939668,0.00012691687,0.00009722872,0.00066346454,0.0003216184,0.026138598],"genre_scores_gemma":[0.9686013,0.00043602166,0.020245032,0.00013889238,0.00009580472,0.00008886892,0.0007398067,0.00010481338,0.0095494855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874485,0.00034300218,0.000086885055,0.00034565103,0.0001909896,0.0002885312],"domain_scores_gemma":[0.9933785,0.0035796391,0.00082634384,0.000818913,0.00036694898,0.0010296099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010146995,0.000605166,0.0007585157,0.0024568862,0.002378203,0.0050695376,0.0012804295,0.0012251618,0.005105585],"category_scores_gemma":[0.005150345,0.00096578297,0.0010152193,0.0019906093,0.0031182026,0.0055318456,0.0022314142,0.001871784,0.0005445962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024890376,0.000100116835,0.0022493957,0.00010146143,0.00003912683,0.00020822189,0.0019592096,0.0049599535,0.0036768315,0.9682332,0.0013399918,0.016883587],"study_design_scores_gemma":[0.000031107524,0.00003444849,0.0010417928,0.000027005248,0.000036297173,0.0001783433,0.0004172796,0.008122924,0.0010528432,0.9866173,0.0024190133,0.000021705908],"about_ca_topic_score_codex":0.0019854372,"about_ca_topic_score_gemma":0.0030190903,"teacher_disagreement_score":0.005105585,"about_ca_system_score_codex":0.0017566176,"about_ca_system_score_gemma":0.0007897313,"threshold_uncertainty_score":0.01707989},"labels":[],"label_agreement":null},{"id":"W2257188417","doi":"10.1145/2786015","title":"Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Packing problems; Mathematics; Set packing; Vertex (graph theory); Graph; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.1535964510606377,"score_gpt":0.36552434887023943,"score_spread":0.21192789780960172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257188417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12998112,0.00029305485,0.86030924,0.0010220502,0.000047096066,0.00017525918,0.000162032,0.0011538252,0.0068562324],"genre_scores_gemma":[0.7240105,0.00037477186,0.268647,0.00029085367,0.00015851589,0.0004864952,0.00046094102,0.00066048536,0.004910462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99570036,0.0011801525,0.00025110226,0.0009840281,0.0011163566,0.00076808647],"domain_scores_gemma":[0.9880884,0.007244685,0.0009828858,0.002665721,0.0005423781,0.0004759441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002660829,0.0015414526,0.0021621236,0.0011129152,0.0011879575,0.0031629151,0.0028590453,0.0018490015,0.0045385784],"category_scores_gemma":[0.020644216,0.00084673066,0.0026425086,0.0020101469,0.0032184005,0.0126414,0.0056957416,0.006940334,0.0013689115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080317596,0.00092148926,0.0021828413,0.0003692862,0.00008241563,0.0003623415,0.0011455232,0.4867961,0.01449345,0.3801876,0.0043133865,0.10834244],"study_design_scores_gemma":[0.000056331573,0.00010753032,0.00022019751,0.000016177204,0.000018466228,0.000087146094,0.00013150852,0.7462808,0.002724125,0.24871886,0.0016131758,0.000025734604],"about_ca_topic_score_codex":0.0019138248,"about_ca_topic_score_gemma":0.001249068,"teacher_disagreement_score":0.0045385784,"about_ca_system_score_codex":0.0028314067,"about_ca_system_score_gemma":0.0014659215,"threshold_uncertainty_score":0.020543337},"labels":[],"label_agreement":null},{"id":"W2262149688","doi":"","title":"Crossing numbers of nearly complete graphs and nearly complete bipartite graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Robertson–Seymour theorem; Cograph; Indifference graph; Complete bipartite graph; 1-planar graph; Chordal graph; Discrete mathematics; Graph","score_opus":0.023439922217151583,"score_gpt":0.2743095829051087,"score_spread":0.25086966068795713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262149688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7075691,0.0023459885,0.14490186,0.0015055548,0.0003590913,0.00006775581,0.00220372,0.00053598825,0.14051084],"genre_scores_gemma":[0.9738444,0.00082005165,0.015922623,0.0002033564,0.00013318719,0.00006745982,0.00078439276,0.00011600231,0.008108479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992236,0.0001991678,0.00003385696,0.00018511532,0.00022883927,0.00012949336],"domain_scores_gemma":[0.99488187,0.0026445542,0.0009856869,0.00050167093,0.00035514336,0.000631214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019816,0.00046711403,0.00047024895,0.0034846645,0.00087097846,0.0023258685,0.0009184578,0.0009281368,0.009597542],"category_scores_gemma":[0.007917166,0.00044327526,0.00032640964,0.0024274462,0.0012894038,0.003550332,0.0012006595,0.0013829811,0.00088264165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012021618,0.00003067675,0.0016272549,0.00008912195,0.000019985324,0.000101075595,0.00018589567,0.0093898615,0.002825137,0.9603777,0.004679011,0.020554163],"study_design_scores_gemma":[0.000015011435,0.000021921223,0.0021639208,0.000038499886,0.000015513493,0.00035054114,0.00016188512,0.026899891,0.0014378902,0.9632187,0.0056571956,0.000019006804],"about_ca_topic_score_codex":0.0005794479,"about_ca_topic_score_gemma":0.0006751473,"teacher_disagreement_score":0.009597542,"about_ca_system_score_codex":0.0008604791,"about_ca_system_score_gemma":0.0003064373,"threshold_uncertainty_score":0.032106996},"labels":[],"label_agreement":null},{"id":"W2263532892","doi":"10.1287/moor.2017.0852","title":"When Is the Matching Polytope Box-Totally Dual Integral?","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Matching (statistics); Polyhedron; Linear programming; Convex hull; Polyhedral combinatorics; Regular polygon; Discrete mathematics; Convex optimization; Convex set; Mathematical optimization; Geometry","score_opus":0.11460997054815757,"score_gpt":0.4207609136705217,"score_spread":0.3061509431223641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263532892","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5430048,0.0062208087,0.278283,0.012765402,0.00072556565,0.00015040816,0.0011795544,0.0003218134,0.15734848],"genre_scores_gemma":[0.96147126,0.0016027453,0.028004192,0.00075896096,0.00042331082,0.00005059122,0.0004855688,0.00011572233,0.0070877397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985563,0.00019310792,0.00004974347,0.00048790374,0.00030402688,0.00040894363],"domain_scores_gemma":[0.9976859,0.0010945721,0.0003574421,0.00026760736,0.00025259325,0.00034191844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014229545,0.00030250123,0.00089782936,0.00087292097,0.0012944815,0.004273401,0.0012982881,0.0022121693,0.0074174292],"category_scores_gemma":[0.008181345,0.0006248956,0.0008869658,0.0012697527,0.003984323,0.0076751765,0.0019247304,0.0027020203,0.00077315944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002152748,0.000048544694,0.0022521934,0.000094171526,0.000030386318,0.0002706057,0.0003204482,0.0052507157,0.00064459926,0.9556199,0.004515705,0.03073749],"study_design_scores_gemma":[0.000039037557,0.000052501928,0.0012932667,0.000093691786,0.00003002336,0.00078647555,0.000608304,0.019948678,0.0007784639,0.9574677,0.018870108,0.00003175681],"about_ca_topic_score_codex":0.0019323849,"about_ca_topic_score_gemma":0.001001386,"teacher_disagreement_score":0.0074174292,"about_ca_system_score_codex":0.0015894362,"about_ca_system_score_gemma":0.00066444004,"threshold_uncertainty_score":0.02481383},"labels":[],"label_agreement":null},{"id":"W2266186","doi":"10.1136/jcp.43.12.992","title":"The Domination Graphs of Complete Paired Comparison Digraphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02565909821618035,"score_gpt":0.29988415800787005,"score_spread":0.2742250597916897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13084117,0.0018034087,0.80541444,0.0014411296,0.00027062854,0.00047898976,0.01142095,0.0021252255,0.046204124],"genre_scores_gemma":[0.768969,0.0013096535,0.18145819,0.0009121178,0.00042323105,0.0011740128,0.013221753,0.00062428165,0.03190769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572635,0.0012797728,0.0002214705,0.00158253,0.0008420507,0.00034775923],"domain_scores_gemma":[0.9819009,0.01192303,0.0017853404,0.0021815908,0.0015032697,0.0007058593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032060987,0.0007870729,0.0008751458,0.0037745398,0.0011153393,0.0022895518,0.0016652311,0.00090136216,0.019985273],"category_scores_gemma":[0.01744751,0.0006423349,0.0011482523,0.0023464418,0.0023684122,0.0041305185,0.0015126509,0.0014032525,0.002167494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045177084,0.00017190375,0.0041266186,0.00076637993,0.0002441817,0.00066304294,0.0006419051,0.015481847,0.004248696,0.8081956,0.01407454,0.1509335],"study_design_scores_gemma":[0.00005281253,0.00012047476,0.0035454223,0.00008619843,0.000070258364,0.00064377685,0.00011329435,0.06682806,0.0022392205,0.90774333,0.018514892,0.000042374188],"about_ca_topic_score_codex":0.0012483163,"about_ca_topic_score_gemma":0.0014122328,"teacher_disagreement_score":0.019985273,"about_ca_system_score_codex":0.0018107109,"about_ca_system_score_gemma":0.0008701095,"threshold_uncertainty_score":0.06685746},"labels":[],"label_agreement":null},{"id":"W2269982198","doi":"10.55016/ojs/cdm.v12i2.62777","title":"Shellability, vertex decomposability, and lexicographical products of graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University; Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Vertex (graph theory); Combinatorics; Mathematics; Graph; Computer science","score_opus":0.024110148435130374,"score_gpt":0.34976466714273247,"score_spread":0.3256545187076021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269982198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79045445,0.00048672452,0.14822276,0.0003957714,0.000057516478,0.000039900387,0.00021262183,0.00019754774,0.059932698],"genre_scores_gemma":[0.9819842,0.0002464546,0.011830849,0.00006765181,0.00004558817,0.000028145905,0.00029987702,0.0000718687,0.0054253377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993856,0.00009591337,0.00004634066,0.00016470872,0.0001905616,0.00011680222],"domain_scores_gemma":[0.9973158,0.0013005389,0.00039026103,0.00036684275,0.00020136879,0.00042506563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046418674,0.00044758222,0.00040462764,0.00096353627,0.0012618654,0.0017800234,0.0006803258,0.00043423605,0.0057829493],"category_scores_gemma":[0.002486791,0.00041727637,0.0004987666,0.00079835247,0.0029790679,0.004223831,0.0019110705,0.0015530436,0.00046710114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010813326,0.00004562923,0.0020772885,0.00004939402,0.000014650331,0.0007225895,0.00073112705,0.003047925,0.0069705644,0.9745393,0.0007996762,0.0108937],"study_design_scores_gemma":[0.000013450111,0.000038718234,0.0013458182,0.00001749145,0.00001948714,0.0008571527,0.0003211072,0.012289937,0.008694651,0.9706642,0.0057102353,0.000027673052],"about_ca_topic_score_codex":0.00072023104,"about_ca_topic_score_gemma":0.000843758,"teacher_disagreement_score":0.0057829493,"about_ca_system_score_codex":0.0004871494,"about_ca_system_score_gemma":0.00028532583,"threshold_uncertainty_score":0.01934594},"labels":[],"label_agreement":null},{"id":"W2274606173","doi":"","title":"Semitotal domination in graphs","year":2014,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Domination analysis; Mathematics; Combinatorics; Vertex (graph theory); Graph; Connectivity; Discrete mathematics","score_opus":0.014436776905547077,"score_gpt":0.28307398270227024,"score_spread":0.2686372057967232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274606173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5451786,0.0029334233,0.39560267,0.0010009638,0.00010872746,0.0001007004,0.00063456857,0.00054174254,0.053898644],"genre_scores_gemma":[0.9663783,0.0007942158,0.028120633,0.00019461854,0.00010918245,0.00010918817,0.00027381087,0.00009045166,0.0039295508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982723,0.00045029263,0.00010503189,0.00041923302,0.0005274653,0.00022567707],"domain_scores_gemma":[0.9945346,0.0028861372,0.0006831969,0.00088050764,0.00047619702,0.00053923106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012925054,0.00057077577,0.0007159011,0.0019397581,0.0013609469,0.0022964135,0.0008882229,0.00059405825,0.0025337576],"category_scores_gemma":[0.005004706,0.0003565382,0.00053974916,0.0016708792,0.0027123864,0.00427512,0.0024463676,0.0009900833,0.0002860705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020693809,0.00003998386,0.0033555704,0.0002601518,0.000057186582,0.00027217017,0.00094230263,0.041974083,0.013474661,0.9048203,0.0019704034,0.032626197],"study_design_scores_gemma":[0.000023350718,0.00006219089,0.0018041421,0.000045769048,0.000034134166,0.0006318888,0.00025647032,0.07411361,0.0037390166,0.90535575,0.013896961,0.000036770252],"about_ca_topic_score_codex":0.0006028966,"about_ca_topic_score_gemma":0.0008588961,"teacher_disagreement_score":0.0025337576,"about_ca_system_score_codex":0.0013434285,"about_ca_system_score_gemma":0.00045996223,"threshold_uncertainty_score":0.009747326},"labels":[],"label_agreement":null},{"id":"W2274875244","doi":"10.46298/dmtcs.2097","title":"Bounding the monomial index and (1,l)-weight choosability of a graph","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Monomial; Upper and lower bounds; Bound graph; Discrete mathematics; Graph power; Line graph","score_opus":0.013370642156780903,"score_gpt":0.27961273395916114,"score_spread":0.26624209180238023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274875244","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6733948,0.000530766,0.295638,0.0007679009,0.00006136347,0.00007042788,0.00057191565,0.00029535533,0.028669497],"genre_scores_gemma":[0.96906203,0.00046289898,0.026124777,0.00007399407,0.00009053986,0.000051646242,0.00032571077,0.000094801566,0.0037135894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923027,0.00012596951,0.00003902033,0.0001974331,0.00020103624,0.00020620879],"domain_scores_gemma":[0.9964187,0.002226352,0.00038536664,0.00040050186,0.00018707897,0.00038196333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011380316,0.0006860544,0.000852656,0.001660774,0.000785831,0.0017174926,0.0013952418,0.0007068477,0.003863059],"category_scores_gemma":[0.006453322,0.0005736065,0.00084418734,0.0013008608,0.0024301463,0.0027655622,0.0014451197,0.0018490436,0.00043955309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026947763,0.00011040823,0.005600997,0.00019011559,0.000042886477,0.0002800262,0.0004666449,0.09593665,0.02059061,0.8547293,0.00147963,0.020303247],"study_design_scores_gemma":[0.00003739447,0.00013331065,0.0027114197,0.000043262586,0.000045841756,0.0002714294,0.0001170118,0.25409833,0.009491962,0.7303018,0.0026970035,0.00005123165],"about_ca_topic_score_codex":0.0011283599,"about_ca_topic_score_gemma":0.0014328975,"teacher_disagreement_score":0.003863059,"about_ca_system_score_codex":0.0019335856,"about_ca_system_score_gemma":0.00056624203,"threshold_uncertainty_score":0.014029264},"labels":[],"label_agreement":null},{"id":"W2275118037","doi":"10.1016/j.dam.2015.09.022","title":"Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Mathematics; Combinatorics; Pancyclic graph; Neighbourhood (mathematics); Hamiltonian path; Conjecture; Connectivity; Discrete mathematics; Graph; Induced subgraph; Vertex connectivity; Vertex (graph theory); Chordal graph; 1-planar graph; Mathematical analysis","score_opus":0.01562679022518824,"score_gpt":0.24948473352771053,"score_spread":0.2338579433025223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275118037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94197756,0.00021388628,0.04310745,0.00023830972,0.000013944822,0.00003239561,0.0002055926,0.0001511706,0.014059684],"genre_scores_gemma":[0.99181026,0.00014658757,0.0032770073,0.000044534598,0.00002701026,0.00004515135,0.00024155415,0.00009013738,0.004317732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997732,0.000040327734,0.000011112244,0.00007092989,0.000057636564,0.00004681357],"domain_scores_gemma":[0.99714404,0.0013813606,0.0005159774,0.00022319237,0.00028120144,0.00045410602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031742163,0.0005096678,0.0006302482,0.0017304296,0.0010991425,0.002026094,0.0011317785,0.00082392886,0.0078161545],"category_scores_gemma":[0.0030676255,0.00042618086,0.00046931618,0.0011343532,0.0022292582,0.0027700502,0.0011187174,0.0011581205,0.00037942833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033911847,0.00014033052,0.0062387628,0.00022134095,0.00006265653,0.000906032,0.002562171,0.031922497,0.015519077,0.9215064,0.0017098399,0.018871803],"study_design_scores_gemma":[0.00004463011,0.00006798948,0.0022698317,0.000024918838,0.00003545618,0.00022901982,0.00071802404,0.05594176,0.0022074848,0.9374527,0.0009865762,0.000021687596],"about_ca_topic_score_codex":0.0020610471,"about_ca_topic_score_gemma":0.0023737215,"teacher_disagreement_score":0.0078161545,"about_ca_system_score_codex":0.00074440165,"about_ca_system_score_gemma":0.00042165047,"threshold_uncertainty_score":0.026147664},"labels":[],"label_agreement":null},{"id":"W2275781839","doi":"10.1016/j.jctb.2017.05.008","title":"The structure of matroids with a spanning clique or projective geometry","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Combinatorics; Oriented matroid; Mathematics; Graphic matroid; Weighted matroid; Matroid partitioning; Projective geometry; Projective plane; Minor (academic); Discrete mathematics; Geometry; Algebraic geometry","score_opus":0.016436985967622077,"score_gpt":0.3087211658203098,"score_spread":0.29228417985268773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275781839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82434773,0.0012500578,0.098405614,0.0051581557,0.00017649592,0.00008954756,0.0014225537,0.0003111352,0.068838656],"genre_scores_gemma":[0.97233105,0.00047688448,0.01722226,0.00035467496,0.0004476409,0.000054450826,0.0006676355,0.000075089054,0.008370266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926907,0.00023009973,0.000027004497,0.00021809641,0.0001433075,0.000112415124],"domain_scores_gemma":[0.9975242,0.0008757311,0.0006389017,0.00029903252,0.00018358037,0.00047846048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006187983,0.0005544458,0.0007100946,0.0013364543,0.0017133134,0.0039555086,0.0016187832,0.0016981709,0.009805233],"category_scores_gemma":[0.00339694,0.000686437,0.0006656747,0.001658306,0.0028233605,0.0051873056,0.0017770013,0.0016880705,0.0008114796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061638195,0.000034860437,0.00074587035,0.000057104175,0.00001435787,0.000119725,0.00023352145,0.002453927,0.0009807025,0.98897994,0.0024090665,0.003909169],"study_design_scores_gemma":[0.000020647492,0.000022025217,0.0007318119,0.00001415914,0.000012503909,0.00020041372,0.0001268095,0.011402233,0.0002685374,0.98472136,0.0024671322,0.000012427551],"about_ca_topic_score_codex":0.0007714538,"about_ca_topic_score_gemma":0.0008649143,"teacher_disagreement_score":0.009805233,"about_ca_system_score_codex":0.0007514016,"about_ca_system_score_gemma":0.00047659423,"threshold_uncertainty_score":0.032801747},"labels":[],"label_agreement":null},{"id":"W2276038413","doi":"10.1002/jgt.22153","title":"Exponentially many 4‐list‐colorings of triangle‐free graphs on surfaces","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Planar graph; List coloring; Discrete mathematics; Graph power; Line graph","score_opus":0.040183817741576616,"score_gpt":0.31325601871403363,"score_spread":0.273072200972457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276038413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88870525,0.0009551364,0.07596768,0.002661988,0.00016471601,0.000092130795,0.0006336449,0.00081210403,0.03000734],"genre_scores_gemma":[0.9680187,0.00034662537,0.020693094,0.0005489072,0.00013439271,0.0001269158,0.00065738335,0.0002925352,0.0091814445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846905,0.00030499115,0.00006709607,0.00035294634,0.0003706459,0.00043521624],"domain_scores_gemma":[0.9813137,0.01277118,0.0014007255,0.0016808978,0.0013840145,0.0014494542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014387901,0.00088749285,0.0010003018,0.001827014,0.002484845,0.0028718754,0.0021214918,0.001511296,0.00980602],"category_scores_gemma":[0.017222734,0.0011125342,0.0014636186,0.001455137,0.0028188278,0.0058595636,0.0023977924,0.0030212554,0.0009208425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020653065,0.00035414312,0.018843027,0.00089537515,0.0002170243,0.0011456507,0.0038119315,0.083236106,0.025771465,0.7991391,0.018511215,0.04600972],"study_design_scores_gemma":[0.00022807553,0.00012175493,0.0047452203,0.00009757976,0.000144907,0.0006511046,0.0007519056,0.14714089,0.0073550413,0.82812834,0.010541711,0.00009346419],"about_ca_topic_score_codex":0.0032133074,"about_ca_topic_score_gemma":0.004322379,"teacher_disagreement_score":0.00980602,"about_ca_system_score_codex":0.0036324991,"about_ca_system_score_gemma":0.00091763603,"threshold_uncertainty_score":0.03280437},"labels":[],"label_agreement":null},{"id":"W2277107861","doi":"10.1007/978-3-642-40104-6_31","title":"Planar Packing of Binary Trees","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Planar graph; Binary tree; Embedding; Trémaux tree; Colored; Mathematics; Time complexity; Book embedding; Tree (set theory); Spanning tree; Computer science; Graph; Discrete mathematics; 1-planar graph; Line graph; Pathwidth; Artificial intelligence","score_opus":0.024790430396237764,"score_gpt":0.27572010548139037,"score_spread":0.2509296750851526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277107861","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15542452,0.009748857,0.21755478,0.0011339206,0.0008829732,0.000112445174,0.00087383226,0.0007795266,0.6134892],"genre_scores_gemma":[0.6265426,0.015848491,0.1421844,0.0004294326,0.00089704985,0.00018513648,0.003513094,0.0008290297,0.20957077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978036,0.00002613884,0.000009895114,0.000041585958,0.00010596432,0.000036040754],"domain_scores_gemma":[0.9998511,0.000054869506,0.000018455949,0.000031592706,0.000020836842,0.000023088667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008035759,0.0005620219,0.0006947453,0.0009485025,0.0006427584,0.0015667605,0.0006475729,0.00060900976,0.012726553],"category_scores_gemma":[0.0008638173,0.0006204312,0.00039625002,0.0025251254,0.0006065334,0.0016698923,0.001615635,0.0016608159,0.0030528582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013115493,0.00008665314,0.00027611156,0.00048791576,0.000027222814,0.0002574443,0.0003389846,0.013371998,0.008095241,0.69128233,0.030923104,0.25472185],"study_design_scores_gemma":[0.000036315818,0.00008874339,0.0011023212,0.00015923177,0.000029632787,0.0007883278,0.00022875951,0.03265502,0.004109447,0.8421439,0.11863368,0.000024551477],"about_ca_topic_score_codex":0.0006834835,"about_ca_topic_score_gemma":0.0007820104,"teacher_disagreement_score":0.012726553,"about_ca_system_score_codex":0.0005035395,"about_ca_system_score_gemma":0.00021378235,"threshold_uncertainty_score":0.042574525},"labels":[],"label_agreement":null},{"id":"W2280880808","doi":"10.1007/978-3-319-42634-1_16","title":"Minimum Cost Homomorphisms with Constrained Costs","year":2016,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Graph homomorphism; Combinatorics; Bipartite graph; Interval graph; Discrete mathematics; Chordal graph; Graph; Line graph; Voltage graph","score_opus":0.0196663850493519,"score_gpt":0.2894151307590696,"score_spread":0.2697487457097177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280880808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1677585,0.00092868047,0.7806635,0.0033040363,0.00038602337,0.00021396122,0.0008743728,0.0011656146,0.044705234],"genre_scores_gemma":[0.7249463,0.00086063676,0.24227373,0.00068449345,0.0004524614,0.00041007754,0.00089140364,0.0010252637,0.028455615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975853,0.00067267066,0.00013890813,0.0006029304,0.0006602208,0.00033999098],"domain_scores_gemma":[0.9879265,0.0076421704,0.0006260931,0.001985401,0.0007482096,0.0010717147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021010083,0.0009778873,0.0014506647,0.0017953524,0.0014400965,0.0039442866,0.0031808713,0.0024791982,0.012671074],"category_scores_gemma":[0.018353265,0.0011592302,0.0012483353,0.002546644,0.0021158052,0.011472999,0.004585402,0.006128689,0.0013816468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021056262,0.00012218514,0.0003183275,0.00023814701,0.00003913235,0.00011207976,0.00024383355,0.018254058,0.0022744713,0.9327111,0.005468167,0.0400079],"study_design_scores_gemma":[0.000024798672,0.00002321489,0.00008886981,0.00001949013,0.00001940576,0.00010948148,0.00004871299,0.03137636,0.0009419425,0.9649508,0.0023843069,0.0000125933175],"about_ca_topic_score_codex":0.0006479121,"about_ca_topic_score_gemma":0.0007302037,"teacher_disagreement_score":0.012671074,"about_ca_system_score_codex":0.0017841911,"about_ca_system_score_gemma":0.0011846845,"threshold_uncertainty_score":0.042388976},"labels":[],"label_agreement":null},{"id":"W2281619726","doi":"","title":"The Connected Domination and Tree Domination of P(n,k) for k = 1, 2, [n/2]","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory); Domination analysis; Graph","score_opus":0.024368073227741285,"score_gpt":0.27167585384316717,"score_spread":0.24730778061542588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281619726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80275625,0.0007322797,0.051608346,0.0017277856,0.00008547585,0.00015504105,0.0014172068,0.00021802828,0.14129959],"genre_scores_gemma":[0.95860153,0.00042466747,0.012263493,0.0002065329,0.000068627036,0.00016654252,0.0011111305,0.000119766555,0.027037602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992505,0.0001564972,0.000034215867,0.00017208274,0.00019973848,0.00018701186],"domain_scores_gemma":[0.9965663,0.0017155922,0.0005343727,0.0002738142,0.00039793723,0.000511929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053669745,0.0003877466,0.00031310142,0.0020318155,0.0021778387,0.0030651984,0.0013213111,0.0011353786,0.011423809],"category_scores_gemma":[0.005675618,0.00039881276,0.0005401308,0.00201444,0.0020221765,0.0026173699,0.0017051713,0.0012403487,0.00077667664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059314165,0.000066522756,0.0029378072,0.0001731849,0.00004082565,0.0006481354,0.001821026,0.00714367,0.008352844,0.95058745,0.005974537,0.021660846],"study_design_scores_gemma":[0.000083526895,0.000032337743,0.004884521,0.000050284674,0.000040323495,0.00092520367,0.00047236076,0.033290062,0.0036395683,0.9462158,0.010317461,0.00004855183],"about_ca_topic_score_codex":0.0032315522,"about_ca_topic_score_gemma":0.0042326706,"teacher_disagreement_score":0.011423809,"about_ca_system_score_codex":0.0011354646,"about_ca_system_score_gemma":0.00090652343,"threshold_uncertainty_score":0.038216412},"labels":[],"label_agreement":null},{"id":"W2283442510","doi":"10.14288/1.0052053","title":"D-width, metric embedding, and their connections","year":2011,"lang":"en","type":"article","venue":"Open Collections","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Book embedding; Metric dimension; Embedding; Discrete mathematics; Pathwidth; Steiner tree problem; Chordal graph; Planar graph; Bounded function; Metric space; Graph; 1-planar graph; Line graph; Computer science","score_opus":0.05550652881869031,"score_gpt":0.3175484049950506,"score_spread":0.2620418761763603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283442510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3098456,0.027802775,0.56258684,0.008645404,0.00055664947,0.00014846194,0.0018785872,0.00061756757,0.087918125],"genre_scores_gemma":[0.8223162,0.013307534,0.13432914,0.0014520839,0.0010261101,0.00031836345,0.0017220827,0.0005713609,0.024957066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885964,0.00025424198,0.000067237124,0.00041000283,0.00030593853,0.00010293566],"domain_scores_gemma":[0.99386495,0.0032739586,0.0009494197,0.00081850565,0.0004274563,0.0006657495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093223085,0.001278414,0.0009183327,0.0027359414,0.0011914854,0.0029541997,0.0017350494,0.0019729207,0.00658375],"category_scores_gemma":[0.009951093,0.0006662136,0.00065007724,0.0041512633,0.003034485,0.010408584,0.0044976943,0.0037258198,0.00095774187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007577829,0.00007043323,0.0018205073,0.00025791355,0.000027624641,0.00011232122,0.0003471616,0.013907962,0.0012243277,0.92094016,0.0047086584,0.05650715],"study_design_scores_gemma":[0.000011201003,0.000044546297,0.0009469645,0.000054766966,0.000013222801,0.0003008253,0.00012583692,0.027448172,0.0005601445,0.957591,0.012879848,0.000023556011],"about_ca_topic_score_codex":0.0013710427,"about_ca_topic_score_gemma":0.0009864109,"teacher_disagreement_score":0.00658375,"about_ca_system_score_codex":0.0015861237,"about_ca_system_score_gemma":0.000331302,"threshold_uncertainty_score":0.02202481},"labels":[],"label_agreement":null},{"id":"W2283908050","doi":"10.1007/978-3-319-24704-5","title":"Relational and Algebraic Methods in Computer Science","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; McMaster University","funders":"","keywords":"Computer science; Algebraic number; Relational database; Algebra over a field; Information retrieval; Mathematics; Pure mathematics","score_opus":0.04685480116868425,"score_gpt":0.35898781661255985,"score_spread":0.3121330154438756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283908050","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00267103,0.16047533,0.19091372,0.0080397315,0.009015698,0.00011477471,0.00054483546,0.0009793538,0.6272455],"genre_scores_gemma":[0.05925945,0.14823437,0.124644995,0.0026931898,0.016079895,0.00035801242,0.0012227239,0.0012604423,0.64624697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989813,0.00017222187,0.00005480097,0.00013327492,0.00061111496,0.000047251928],"domain_scores_gemma":[0.99898165,0.0005917742,0.000040418006,0.00015372541,0.0001735952,0.0000588023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007154653,0.0011732454,0.0012180019,0.0029654077,0.0012189867,0.0044044266,0.0012458984,0.00075751956,0.03583944],"category_scores_gemma":[0.0022676836,0.00065782043,0.0008172491,0.0062171454,0.0026501832,0.007878808,0.0016996136,0.003337738,0.0136777265],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009272921,0.000023703726,0.000061412466,0.0005005253,0.000015411266,0.000024388059,0.00022923914,0.00057398534,0.00046918992,0.76456034,0.11180152,0.12173101],"study_design_scores_gemma":[0.000008404045,0.000010551976,0.00016879715,0.00019816462,0.000012309691,0.00013536007,0.00007104447,0.0012415074,0.00019776402,0.52109826,0.47684595,0.000011946833],"about_ca_topic_score_codex":0.0010436325,"about_ca_topic_score_gemma":0.0017429654,"teacher_disagreement_score":0.03583944,"about_ca_system_score_codex":0.0019777045,"about_ca_system_score_gemma":0.0013007146,"threshold_uncertainty_score":0.11989486},"labels":[],"label_agreement":null},{"id":"W2285106886","doi":"10.48550/arxiv.1509.01307","title":"End-vertices of LBFS of (AT-free) bigraphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Interval graph; Chordal graph; Bipartite graph; Mathematics; Vertex (graph theory); Discrete mathematics; Pathwidth; Indifference graph; Computer science; Graph; 1-planar graph; Line graph","score_opus":0.10587492174830801,"score_gpt":0.22535515251138757,"score_spread":0.11948023076307956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285106886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51432407,0.0004641866,0.45287362,0.00094532827,0.00007867314,0.0004054753,0.0028046719,0.0014447274,0.026659237],"genre_scores_gemma":[0.8230493,0.00026666894,0.16371322,0.00022290887,0.000051560095,0.00020105838,0.0035569698,0.00020909858,0.008729187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992349,0.00013434791,0.00005713593,0.00023428949,0.00018327823,0.00015593474],"domain_scores_gemma":[0.9964462,0.0020916944,0.0003923094,0.00040434036,0.00034774307,0.0003177944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005303983,0.00045923714,0.0005905418,0.001237546,0.001285726,0.0022189515,0.0009705348,0.0010467457,0.0061093345],"category_scores_gemma":[0.0048764334,0.00041077944,0.0008511377,0.0010404463,0.0014697354,0.003678918,0.0012943058,0.0012237396,0.00080393377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014563107,0.0004685687,0.018438837,0.001239151,0.00012657806,0.0011676714,0.0020050309,0.10117321,0.03279473,0.6681115,0.011430704,0.16158774],"study_design_scores_gemma":[0.00008286825,0.00018135652,0.0034669845,0.00011311872,0.000059000424,0.00074208813,0.00075450755,0.13419983,0.015992241,0.83238006,0.011979243,0.000048605845],"about_ca_topic_score_codex":0.002078707,"about_ca_topic_score_gemma":0.0024656362,"teacher_disagreement_score":0.0061093345,"about_ca_system_score_codex":0.0009705607,"about_ca_system_score_gemma":0.00086224824,"threshold_uncertainty_score":0.020437717},"labels":[],"label_agreement":null},{"id":"W2285618017","doi":"10.1007/s00493-016-3594-4","title":"On the Number of Bases of Almost All Matroids","year":2018,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Combinatorics; Mathematics; Graphic matroid; Cardinality (data modeling); Omega; Discrete mathematics; Embedding; Physics","score_opus":0.03759325496127142,"score_gpt":0.33073093295384776,"score_spread":0.29313767799257634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285618017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7654239,0.0023866699,0.12309206,0.011196368,0.00062072184,0.00009387707,0.0029506395,0.00054669305,0.09368901],"genre_scores_gemma":[0.94938016,0.0009605989,0.029248541,0.0007715457,0.000961681,0.00018522484,0.0020858452,0.00033472653,0.0160718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663454,0.0010869901,0.00015667062,0.0007746167,0.00076907256,0.0005781617],"domain_scores_gemma":[0.9768747,0.014986245,0.0016760173,0.002119428,0.0014128173,0.0029307927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002714131,0.0013806104,0.0020191784,0.002823852,0.0031229714,0.008295571,0.004050156,0.0026448069,0.018083965],"category_scores_gemma":[0.01686594,0.0012910652,0.0012414703,0.0028733995,0.0050593717,0.011652148,0.0038924983,0.0055389823,0.0016615409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006113117,0.00013631703,0.0035743106,0.00022221492,0.00009265019,0.000106642765,0.0003840125,0.008997941,0.0025871797,0.9545551,0.008494543,0.02023786],"study_design_scores_gemma":[0.000055119875,0.000034685087,0.00076004013,0.0000344325,0.000040506526,0.00016185438,0.00013780345,0.017181013,0.00070064235,0.97837585,0.002499318,0.000018748391],"about_ca_topic_score_codex":0.00094801997,"about_ca_topic_score_gemma":0.0012654623,"teacher_disagreement_score":0.018083965,"about_ca_system_score_codex":0.002290685,"about_ca_system_score_gemma":0.001187268,"threshold_uncertainty_score":0.060496867},"labels":[],"label_agreement":null},{"id":"W2285763632","doi":"10.1002/jgt.22177","title":"Quasi‐graphic matroids*","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Marsden Fund; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Graphic matroid; Combinatorics; Generalization; Mathematics; Frame (networking); Discrete mathematics; Computer science","score_opus":0.0230699067112449,"score_gpt":0.31376997600799306,"score_spread":0.29070006929674813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285763632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47528848,0.0010961207,0.4215625,0.0018816415,0.00050230866,0.00012438366,0.0019294099,0.0011006952,0.09651442],"genre_scores_gemma":[0.9286381,0.0005551418,0.051222034,0.00042348183,0.0002893417,0.00008811431,0.001409501,0.000091561065,0.017282777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961144,0.00006486085,0.000022658003,0.00012224389,0.00010906441,0.00006982312],"domain_scores_gemma":[0.9993407,0.00012935979,0.00014388513,0.00011723611,0.00015954436,0.00010928148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028193727,0.00040394568,0.00030164586,0.00090398063,0.0005246556,0.0019009137,0.00054580776,0.00060933514,0.007919154],"category_scores_gemma":[0.0007382304,0.0002879468,0.0006555092,0.0008169701,0.0008974864,0.0016449468,0.0008251935,0.0011734674,0.0009290613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006736249,0.000025487263,0.00096288114,0.00007642749,0.000018516772,0.0002668327,0.0001850199,0.0053123594,0.006293044,0.96167034,0.0046275714,0.020494154],"study_design_scores_gemma":[0.000034072465,0.00010117776,0.0025957625,0.000048711507,0.000030846528,0.0010805693,0.00024067225,0.045829777,0.0048277588,0.90039253,0.044777397,0.000040671195],"about_ca_topic_score_codex":0.0014284627,"about_ca_topic_score_gemma":0.0012129673,"teacher_disagreement_score":0.007919154,"about_ca_system_score_codex":0.000774538,"about_ca_system_score_gemma":0.0003353268,"threshold_uncertainty_score":0.026492238},"labels":[],"label_agreement":null},{"id":"W2290377455","doi":"10.3102/1076998615606114","title":"Graphs ′ <i>R</i> Us UnwinAntony. Graphical Data Analysis With R. Boca Raton, FL: Taylor &amp; Francis, 2015; 310 pages, $69.95, ISBN 9781498715232.","year":2015,"lang":"en","type":"article","venue":"Journal of Educational and Behavioral Statistics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Mathematics education; Mathematics","score_opus":0.08435273792904979,"score_gpt":0.3799160870258571,"score_spread":0.2955633490968073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290377455","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018380639,0.021312786,0.8132481,0.011794422,0.006452147,0.00021570834,0.05632377,0.02984296,0.058972143],"genre_scores_gemma":[0.066427335,0.029389605,0.7104236,0.0090976,0.004897903,0.0022100983,0.060709544,0.041162364,0.075682014],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951266,0.001903741,0.0004260753,0.001370261,0.0009852861,0.0001879865],"domain_scores_gemma":[0.972514,0.018349815,0.0019339925,0.004783027,0.002052185,0.0003669098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004546951,0.0020765944,0.001617466,0.0041247597,0.0009857847,0.0032204906,0.0026172616,0.0013742684,0.19391346],"category_scores_gemma":[0.049013715,0.0018819924,0.0018653583,0.007719184,0.0025222928,0.0048684427,0.0023895258,0.0033545818,0.10320996],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006236671,0.00002554584,0.0005030205,0.0016987526,0.0001285346,0.0001605347,0.00029441877,0.0012670542,0.0011255312,0.056798648,0.776827,0.16110855],"study_design_scores_gemma":[0.000026476766,0.000028978155,0.0008741133,0.0005413236,0.000097448705,0.00064590626,0.00011730301,0.0037952755,0.0017116192,0.15641756,0.8356753,0.00006873801],"about_ca_topic_score_codex":0.0035121895,"about_ca_topic_score_gemma":0.006092787,"teacher_disagreement_score":0.19391346,"about_ca_system_score_codex":0.0009720983,"about_ca_system_score_gemma":0.0021002835,"threshold_uncertainty_score":0.6487051},"labels":[],"label_agreement":null},{"id":"W2290756947","doi":"10.1017/cbo9781316414958","title":"Erdős–Ko–Rado Theorems: Algebraic Approaches","year":2015,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Waterloo","funders":"","keywords":"Mathematical proof; Association scheme; Algebraic number; Intersection (aeronautics); Mathematics; Scheme (mathematics); Generalization; Discrete mathematics; Algebraic properties; Focus (optics); Combinatorics; Computer science; Algebra over a field; Pure mathematics; Geography; Geometry","score_opus":0.059320916382777505,"score_gpt":0.23048053783863778,"score_spread":0.17115962145586028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290756947","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073373667,0.07953859,0.14373507,0.013612788,0.0030075673,0.0000739697,0.00041166667,0.00032720543,0.7519557],"genre_scores_gemma":[0.30583787,0.20980074,0.13267341,0.006575878,0.009052022,0.00040622277,0.00073084334,0.00055075425,0.33437228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992212,0.00016033823,0.000036796675,0.00011741766,0.00040267952,0.00006145675],"domain_scores_gemma":[0.99908984,0.0004991296,0.00008243948,0.000113790025,0.00016329276,0.00005152352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012942182,0.00080729666,0.0007564307,0.0024254438,0.0019389155,0.004520578,0.001111531,0.0011573739,0.009712214],"category_scores_gemma":[0.0025011934,0.0005435764,0.00065829296,0.0031803122,0.0041106124,0.00947034,0.0021427965,0.004438301,0.0034778342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002990798,0.0000043263194,0.000024226612,0.00006064187,0.000002587175,0.00001469735,0.00008646436,0.00029012482,0.00008017355,0.9832622,0.006761032,0.009410633],"study_design_scores_gemma":[0.0000037179557,0.000007743625,0.000105257626,0.00007356552,0.0000052689775,0.0001090083,0.00011579476,0.0008707928,0.00017177027,0.8217135,0.17681457,0.000008899327],"about_ca_topic_score_codex":0.0007373003,"about_ca_topic_score_gemma":0.00076694036,"teacher_disagreement_score":0.009712214,"about_ca_system_score_codex":0.0031596872,"about_ca_system_score_gemma":0.00090505235,"threshold_uncertainty_score":0.03249061},"labels":[],"label_agreement":null},{"id":"W2293521544","doi":"","title":"A Linear Time Algorithm for Computing Longest Paths in 2-Trees","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Time complexity; Algorithm; Running time; Computer science; Combinatorics","score_opus":0.013515686416620123,"score_gpt":0.2757339437695265,"score_spread":0.2622182573529064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293521544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06516807,0.0014052135,0.8975995,0.0014115222,0.000321064,0.00067385024,0.0030426981,0.014848604,0.0155294165],"genre_scores_gemma":[0.10421678,0.00031194423,0.88252354,0.00029729144,0.00010542878,0.00042902786,0.004316353,0.0008243799,0.006975202],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843854,0.0002036313,0.00013177904,0.0005234102,0.00043831227,0.00026431584],"domain_scores_gemma":[0.99701846,0.0017271898,0.00019631059,0.0005548861,0.0003012656,0.00020180237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009558043,0.0020349147,0.0017412547,0.0024934025,0.0017380111,0.0035888879,0.0038313752,0.0024273319,0.01890895],"category_scores_gemma":[0.0045955605,0.0011467737,0.002033366,0.005336051,0.0011346331,0.0075386097,0.0032639042,0.0025067257,0.005029812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013715924,0.00088941806,0.0022742746,0.0015447442,0.00022565047,0.0002471177,0.0005889575,0.044976216,0.027409688,0.04089949,0.03899662,0.84057623],"study_design_scores_gemma":[0.0016531132,0.00089539675,0.0032250702,0.0002468939,0.00050863775,0.0009940289,0.0010545403,0.5658602,0.029369656,0.35077822,0.045174837,0.00023933429],"about_ca_topic_score_codex":0.0056248032,"about_ca_topic_score_gemma":0.012676211,"teacher_disagreement_score":0.01890895,"about_ca_system_score_codex":0.0025295455,"about_ca_system_score_gemma":0.0033624235,"threshold_uncertainty_score":0.06325674},"labels":[],"label_agreement":null},{"id":"W2294341534","doi":"10.1145/2151171.2151177","title":"Elimination graphs","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Discrete mathematics; Block graph; Indifference graph; Intersection graph; Pathwidth; Independent set; Line graph; Graph; 1-planar graph","score_opus":0.033869786607482716,"score_gpt":0.31175226098866454,"score_spread":0.27788247438118185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294341534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046204068,0.0026645567,0.6198014,0.004001425,0.0010925129,0.0005881172,0.004383977,0.001546589,0.31971732],"genre_scores_gemma":[0.4064302,0.0048976885,0.3376331,0.004891208,0.0011259239,0.0011476742,0.017835034,0.0015134938,0.22452565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861467,0.00026657543,0.00008166715,0.00041596283,0.0003756965,0.00024543094],"domain_scores_gemma":[0.99736243,0.00095247553,0.0002803485,0.0006333843,0.0005734313,0.00019792476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007460489,0.0008351257,0.00080490886,0.0015006178,0.003141765,0.0024160706,0.0026345002,0.0010260674,0.036719967],"category_scores_gemma":[0.0039877226,0.00051992276,0.001340962,0.0024719846,0.0014827542,0.0057578385,0.003096965,0.0024034462,0.007834388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005388999,0.00006836016,0.000891935,0.00019780065,0.000032061464,0.00025340912,0.00026369686,0.003267336,0.0009616358,0.9155798,0.024955075,0.053475037],"study_design_scores_gemma":[0.00003274769,0.000035763544,0.0004995024,0.000073275165,0.000044044016,0.0008667544,0.0002802743,0.0070152124,0.0015929979,0.70913,0.28040534,0.000024118874],"about_ca_topic_score_codex":0.0025819184,"about_ca_topic_score_gemma":0.0036091853,"teacher_disagreement_score":0.036719967,"about_ca_system_score_codex":0.0014381778,"about_ca_system_score_gemma":0.0012517353,"threshold_uncertainty_score":0.12284058},"labels":[],"label_agreement":null},{"id":"W2294850962","doi":"10.1007/s13160-016-0209-9","title":"A fast algorithm to construct a representation for transversal matroids","year":2016,"lang":"en","type":"article","venue":"Japan Journal of Industrial and Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Transversal (combinatorics); Matroid; Bipartite graph; Mathematics; Oriented matroid; Combinatorics; Weighted matroid; Algorithm; Discrete mathematics; Matrix (chemical analysis); Matroid partitioning; Graphic matroid; Graph","score_opus":0.05063648421488117,"score_gpt":0.301734935331679,"score_spread":0.25109845111679785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294850962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027360171,0.000146942,0.96265715,0.00027077802,0.000093296796,0.0002243324,0.0005621909,0.0038653596,0.0048197275],"genre_scores_gemma":[0.13141584,0.00018125966,0.85910076,0.000117197014,0.00005312275,0.0003560786,0.0026236856,0.000618535,0.0055334037],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993149,0.00012174418,0.000055703473,0.00018865749,0.00019441922,0.00012458835],"domain_scores_gemma":[0.9987425,0.00037706865,0.00009447339,0.0003990522,0.00028528192,0.00010169994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054898264,0.001400659,0.0012700767,0.001515613,0.0009911705,0.002298396,0.0018956594,0.0013870291,0.012699274],"category_scores_gemma":[0.0027277053,0.00078170164,0.0016601407,0.002373315,0.0005966435,0.003524942,0.0033894726,0.0028088025,0.00393457],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046154013,0.0004313978,0.001201162,0.00064383086,0.00010433668,0.00035307615,0.0005761298,0.037572026,0.028945107,0.110556446,0.028296486,0.7908585],"study_design_scores_gemma":[0.00041085645,0.00044208043,0.0007621409,0.00011297206,0.000185337,0.0007498171,0.00076619064,0.62573415,0.019445568,0.31488937,0.03639271,0.00010873632],"about_ca_topic_score_codex":0.0012416412,"about_ca_topic_score_gemma":0.002128732,"teacher_disagreement_score":0.012699274,"about_ca_system_score_codex":0.0008082141,"about_ca_system_score_gemma":0.0012338221,"threshold_uncertainty_score":0.04248333},"labels":[],"label_agreement":null},{"id":"W2295288220","doi":"10.5555/2884435.2884580","title":"Weak duality for packing edge-disjoint odd (u, v)-trails","year":2016,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Graph; Duality (order theory); Time complexity; Discrete mathematics","score_opus":0.029410264380123948,"score_gpt":0.3144581138483648,"score_spread":0.28504784946824085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295288220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23849219,0.00040970944,0.749439,0.0005580104,0.00008792984,0.00010204058,0.0003233335,0.0004695393,0.010118222],"genre_scores_gemma":[0.6718094,0.00059079845,0.31720507,0.00030227596,0.00012205682,0.000196069,0.00096842385,0.0003046325,0.008501289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778205,0.0007272772,0.00016366312,0.00043545134,0.00053555303,0.0003559274],"domain_scores_gemma":[0.9932761,0.0032041834,0.0007021072,0.0016085571,0.0005294055,0.0006796385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019333821,0.00088066625,0.0014241678,0.0009791986,0.0012230449,0.0024919098,0.0017483426,0.0009171404,0.004273754],"category_scores_gemma":[0.009708078,0.0009046385,0.0013228467,0.0014785519,0.0021107933,0.009475105,0.0046356353,0.0024092842,0.0009449467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00105459,0.0003389402,0.0035568117,0.0006412976,0.000112183836,0.0003800777,0.0011605984,0.14410514,0.022223137,0.68063,0.0060528917,0.13974436],"study_design_scores_gemma":[0.00006069045,0.00047846945,0.000761787,0.00006156083,0.000043898468,0.00042981244,0.0003571127,0.35392088,0.012937184,0.62094337,0.009959425,0.000045853736],"about_ca_topic_score_codex":0.0006048261,"about_ca_topic_score_gemma":0.00042835093,"teacher_disagreement_score":0.004273754,"about_ca_system_score_codex":0.0010385994,"about_ca_system_score_gemma":0.00080892065,"threshold_uncertainty_score":0.014297068},"labels":[],"label_agreement":null},{"id":"W2295501631","doi":"","title":"Inapproximability of Treewidth and Related Problems (Extended Abstract)","year":2015,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Partial k-tree; Pathwidth; Tree-depth; Tree decomposition; Graphical model; Combinatorics; Mathematics; 1-planar graph; Discrete mathematics; Computer science; Chordal graph; Graph; Artificial intelligence; Line graph","score_opus":0.16535067389067262,"score_gpt":0.35472622906176576,"score_spread":0.18937555517109314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295501631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26406837,0.0074863406,0.6588402,0.018902233,0.0006045329,0.0004591101,0.0046167597,0.0020659994,0.04295653],"genre_scores_gemma":[0.75072277,0.005518791,0.21729258,0.0029172138,0.001365607,0.00075030426,0.00459942,0.0009666825,0.015866674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964954,0.0011396096,0.00013915672,0.0009264599,0.00068357313,0.0006159388],"domain_scores_gemma":[0.9526215,0.04138625,0.0020745494,0.0020745355,0.0010445396,0.0007985989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033145424,0.0017616164,0.002029904,0.0014872596,0.001631541,0.005221198,0.0034599216,0.0025874784,0.012234288],"category_scores_gemma":[0.027209744,0.0012991466,0.0029904153,0.0034103503,0.003199416,0.009260004,0.0028553784,0.006915293,0.0013740669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001098714,0.00093079556,0.0051650493,0.0019220386,0.00039440359,0.0005367409,0.0011369915,0.5312829,0.005691001,0.31210718,0.054335482,0.085398704],"study_design_scores_gemma":[0.00012013408,0.00010554382,0.0006746975,0.00010316961,0.000087511835,0.00030077074,0.00020176565,0.35600188,0.0016594715,0.6367345,0.0039803586,0.000030294894],"about_ca_topic_score_codex":0.005043775,"about_ca_topic_score_gemma":0.00473605,"teacher_disagreement_score":0.012234288,"about_ca_system_score_codex":0.0037219066,"about_ca_system_score_gemma":0.00208773,"threshold_uncertainty_score":0.040927827},"labels":[],"label_agreement":null},{"id":"W2298045254","doi":"10.1016/j.dam.2016.02.009","title":"Strict chordal and strict split digraphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Mathematics; Undirected graph; Combinatorics; Interval graph; Similarity (geometry); Discrete mathematics; Graph; Computer science; Artificial intelligence","score_opus":0.015583501838773802,"score_gpt":0.2628296687805626,"score_spread":0.24724616694178878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298045254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70581186,0.0008210927,0.14932309,0.0011302668,0.0002839953,0.00014729175,0.0015064419,0.00029515478,0.1406808],"genre_scores_gemma":[0.95372343,0.00051711476,0.01754384,0.00031335774,0.00008769192,0.00006275282,0.0009465969,0.00007064694,0.026734646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996791,0.000041673768,0.000025254782,0.00008801613,0.00008500386,0.00008098133],"domain_scores_gemma":[0.9975999,0.00077243993,0.00023450001,0.00032888015,0.00036468275,0.0006995538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033469123,0.0003644217,0.0005888683,0.001208216,0.001885821,0.0024031526,0.001028987,0.0007294807,0.009735525],"category_scores_gemma":[0.0031960253,0.00044192816,0.0004718794,0.001274489,0.0015333476,0.0033174704,0.0020906865,0.0017178074,0.0009292552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105756495,0.000025346459,0.0009667328,0.00007770453,0.000012288289,0.00020916754,0.00048918446,0.001352031,0.0013821664,0.98372126,0.0014774974,0.010180974],"study_design_scores_gemma":[0.000022863418,0.00002538947,0.00072451273,0.000017339942,0.00001642054,0.00024534494,0.00037782986,0.005626061,0.00054931705,0.9869047,0.0054800557,0.000010224391],"about_ca_topic_score_codex":0.0016951695,"about_ca_topic_score_gemma":0.0035541353,"teacher_disagreement_score":0.009735525,"about_ca_system_score_codex":0.00084071915,"about_ca_system_score_gemma":0.0006505672,"threshold_uncertainty_score":0.032568574},"labels":[],"label_agreement":null},{"id":"W2299102011","doi":"","title":"The Metric Cutpoint Partition Problem","year":2006,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Vertex (graph theory); Linear subspace; Realization (probability); Discrete mathematics; Graph; Metric space; Metric (unit); Statistics","score_opus":0.015691306358643273,"score_gpt":0.2570308227436838,"score_spread":0.2413395163850405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299102011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26117182,0.001577809,0.69289273,0.0031554645,0.00018845587,0.0007488355,0.006947036,0.0012091587,0.032108694],"genre_scores_gemma":[0.63146347,0.001207653,0.33649588,0.00045330194,0.00020362668,0.00085349154,0.014457891,0.00045934637,0.0144054005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823135,0.000435327,0.00011514975,0.00057860446,0.00035475826,0.00028479486],"domain_scores_gemma":[0.9980767,0.0010306298,0.00019127746,0.00034513348,0.00016791532,0.00018835149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094872573,0.0011261366,0.001474522,0.0010094873,0.001221318,0.0028919121,0.0019183954,0.002130329,0.008907144],"category_scores_gemma":[0.0054807686,0.00069765106,0.0011148141,0.0020198394,0.0015454383,0.005855393,0.002674739,0.0018656381,0.0011530168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008826174,0.00037606014,0.0026238875,0.0008527924,0.00024115108,0.00057552237,0.0010004198,0.17643248,0.004920394,0.60238415,0.034143697,0.17556676],"study_design_scores_gemma":[0.00017721692,0.00016691309,0.00068102515,0.00006432226,0.00006354851,0.0004156977,0.00046986525,0.17486967,0.0025238509,0.8014585,0.019064965,0.000044465076],"about_ca_topic_score_codex":0.0021721616,"about_ca_topic_score_gemma":0.0021365972,"teacher_disagreement_score":0.008907144,"about_ca_system_score_codex":0.0015231567,"about_ca_system_score_gemma":0.0015683426,"threshold_uncertainty_score":0.029797375},"labels":[],"label_agreement":null},{"id":"W2301667118","doi":"10.1016/j.ejc.2016.10.009","title":"Minimum size of feedback vertex sets of planar graphs of girth at least five","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Conjecture; Feedback vertex set; Girth (graph theory); Planar graph; Upper and lower bounds; Discrete mathematics; Graph","score_opus":0.015419745436154084,"score_gpt":0.24508041134648448,"score_spread":0.2296606659103304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301667118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95377904,0.00048637923,0.033268716,0.001101347,0.00005205385,0.00012470313,0.0033307588,0.0005108797,0.0073460885],"genre_scores_gemma":[0.9797798,0.000226267,0.016260622,0.000112524955,0.00004969156,0.00015477126,0.0017348386,0.00011430634,0.0015673065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988612,0.00027256724,0.00007345974,0.00025340845,0.0002978899,0.00024146275],"domain_scores_gemma":[0.98210585,0.0128112165,0.0016862397,0.0012055287,0.0010411636,0.0011500131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081491395,0.0008060126,0.0018043675,0.0010424654,0.0012158632,0.0025479307,0.002771481,0.0022288796,0.004923907],"category_scores_gemma":[0.014589254,0.0009810013,0.0008958986,0.0011610255,0.001098492,0.0030018704,0.0016233681,0.0010981649,0.00045516077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010488026,0.0010154452,0.03078809,0.0037238086,0.00067252823,0.0015217442,0.0031317165,0.2907438,0.16599526,0.33671936,0.027658435,0.1275418],"study_design_scores_gemma":[0.0009851032,0.00088707457,0.011741383,0.00030506004,0.00037419444,0.0016288575,0.0013845684,0.3790289,0.049009275,0.5485711,0.0059470884,0.0001375145],"about_ca_topic_score_codex":0.0008474571,"about_ca_topic_score_gemma":0.0012179468,"teacher_disagreement_score":0.004923907,"about_ca_system_score_codex":0.0012531077,"about_ca_system_score_gemma":0.001218184,"threshold_uncertainty_score":0.016472101},"labels":[],"label_agreement":null},{"id":"W2305610210","doi":"10.1016/j.jctb.2016.01.006","title":"Stabilizer theorems for even cycle matroids","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Seventh Framework Programme; European Research Council","keywords":"Matroid; Combinatorics; Mathematics; Matroid partitioning; Graphic matroid; Minor (academic); Discrete mathematics; Graph","score_opus":0.011781528074291387,"score_gpt":0.27753434757196466,"score_spread":0.26575281949767326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2305610210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6162546,0.0019341516,0.120422214,0.0042310166,0.00052309,0.00011106585,0.00070976233,0.0008692807,0.2549448],"genre_scores_gemma":[0.95623153,0.0013400955,0.010201688,0.0007857441,0.0008006794,0.00013375361,0.00059339113,0.00025569415,0.029657364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993975,0.00010754165,0.00003161185,0.0001485169,0.00018646714,0.00012835025],"domain_scores_gemma":[0.99762696,0.0013250464,0.00024241648,0.0002535928,0.00024132959,0.00031070694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007825989,0.001027043,0.000950662,0.00280496,0.0020914227,0.0034230312,0.00119869,0.0011212474,0.013507092],"category_scores_gemma":[0.0028633634,0.0006241588,0.00109015,0.0014984609,0.0022345781,0.005395219,0.0030444884,0.0030418164,0.0015699345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056009285,0.000027468262,0.00034411316,0.000049661623,0.000013142216,0.00010672585,0.0003606731,0.000723098,0.0014385575,0.9895572,0.0022965637,0.005026739],"study_design_scores_gemma":[0.000024177905,0.000016069931,0.00020659594,0.000009620168,0.000014748554,0.00006965053,0.00007891566,0.0026027297,0.00053179497,0.99440753,0.0020287998,0.000009211761],"about_ca_topic_score_codex":0.0010281511,"about_ca_topic_score_gemma":0.0011435301,"teacher_disagreement_score":0.013507092,"about_ca_system_score_codex":0.0013372902,"about_ca_system_score_gemma":0.00043795,"threshold_uncertainty_score":0.045185745},"labels":[],"label_agreement":null},{"id":"W2308641315","doi":"10.1051/ro/2015024","title":"Linear time algorithms to solve the linear ordering problem for oriented tree based graphs","year":2015,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Time complexity; Computer science; Tree (set theory); Mathematics; Combinatorics","score_opus":0.10945740197492171,"score_gpt":0.4049995213879207,"score_spread":0.295542119412999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308641315","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015589015,0.00058176223,0.97294307,0.00048201246,0.00012323982,0.000218129,0.0003146475,0.0025058475,0.0072422535],"genre_scores_gemma":[0.09696099,0.000621002,0.8948133,0.0001929667,0.00011043567,0.00030159665,0.00127704,0.0003787649,0.005343938],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989838,0.00023945865,0.000055465913,0.00019825863,0.00027953106,0.00024345933],"domain_scores_gemma":[0.9973124,0.001795067,0.00023304638,0.00029373725,0.0002604935,0.00010529558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067944324,0.0015968425,0.0008672746,0.0009773392,0.0008476094,0.0016002518,0.0018605518,0.0010911641,0.013496041],"category_scores_gemma":[0.00437622,0.00050533394,0.0007167079,0.0023863714,0.0007007605,0.0029613108,0.0011536733,0.0021944728,0.0025888865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006140052,0.0007813131,0.0009572333,0.0010297976,0.00012766074,0.00012590192,0.00030206735,0.17974454,0.014203946,0.089614384,0.034542635,0.6779566],"study_design_scores_gemma":[0.00045514092,0.00031265584,0.0006172258,0.000054623208,0.00010370144,0.00022217205,0.0003110107,0.7825714,0.011122177,0.18694527,0.01723836,0.000046345605],"about_ca_topic_score_codex":0.0035101287,"about_ca_topic_score_gemma":0.007282532,"teacher_disagreement_score":0.013496041,"about_ca_system_score_codex":0.0012577052,"about_ca_system_score_gemma":0.0021318975,"threshold_uncertainty_score":0.04514873},"labels":[],"label_agreement":null},{"id":"W2309458578","doi":"10.1007/978-3-540-93952-8_7","title":"Extremal k-Extendable Graphs and Generalizations","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Pathwidth; Indifference graph; Chordal graph; Discrete mathematics; Cograph; Graph; 1-planar graph; Line graph","score_opus":0.02987968178141627,"score_gpt":0.2733024246861215,"score_spread":0.24342274290470522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2309458578","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0371987,0.0117262,0.058230985,0.0030691046,0.0012046751,0.00004167864,0.00036058284,0.00039800978,0.8877701],"genre_scores_gemma":[0.56857574,0.024458233,0.052103512,0.0020580823,0.0027060646,0.00014409616,0.0007995043,0.0005181252,0.3486367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980503,0.000037498332,0.0000076165047,0.000059391805,0.00006229903,0.00002816534],"domain_scores_gemma":[0.9996884,0.00013215152,0.000027597998,0.000076886834,0.00004453609,0.000030356177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002876812,0.0005770609,0.00050624827,0.0010912721,0.0012721253,0.0018274201,0.00082850293,0.00073311577,0.009805001],"category_scores_gemma":[0.00083794584,0.00038913207,0.0005087946,0.0016423411,0.0018613054,0.0040687113,0.001053204,0.0030462532,0.0019517888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006714222,0.0000067967044,0.000035051744,0.000051789488,0.0000035087846,0.000037894515,0.00015244512,0.0004644937,0.000275641,0.97738296,0.007159314,0.014423542],"study_design_scores_gemma":[0.000002138643,0.0000028646793,0.00008623521,0.000025614681,0.000004617262,0.000123194,0.000056870613,0.0004118201,0.00012229466,0.95798236,0.041177485,0.000004569497],"about_ca_topic_score_codex":0.00059992884,"about_ca_topic_score_gemma":0.00085585134,"teacher_disagreement_score":0.009805001,"about_ca_system_score_codex":0.00084748823,"about_ca_system_score_gemma":0.00029976576,"threshold_uncertainty_score":0.032800972},"labels":[],"label_agreement":null},{"id":"W2315491415","doi":"10.1142/s1793830916500385","title":"Linear layouts of weakly triangulated graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Combinatorics; Quadrilateral; Mathematics; Graph; Discrete mathematics","score_opus":0.01998284194362755,"score_gpt":0.29938829212707935,"score_spread":0.2794054501834518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315491415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3530261,0.00034499532,0.62805593,0.00020661498,0.00007950947,0.00018049311,0.00093313574,0.0014560926,0.015717192],"genre_scores_gemma":[0.71552086,0.0003503181,0.26906464,0.00012189074,0.00004633833,0.0002387725,0.0021559554,0.0005153764,0.011985776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993231,0.00011105192,0.000047896985,0.00019157991,0.00019639973,0.00012986491],"domain_scores_gemma":[0.9984187,0.00035977032,0.00040655272,0.00032122558,0.0002826823,0.00021107432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026654394,0.00057964376,0.00047952755,0.0016495836,0.0008584432,0.0013064805,0.0013249435,0.00059467286,0.0070734504],"category_scores_gemma":[0.002948911,0.0008053458,0.0007433553,0.0014473522,0.0014157324,0.001894504,0.0016190213,0.0009946717,0.0016210743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004683418,0.0001375467,0.00525745,0.00049577124,0.000059694223,0.00085919315,0.0014326519,0.17120838,0.042443477,0.5992364,0.0056734206,0.17272758],"study_design_scores_gemma":[0.00007398393,0.00020905944,0.0020382833,0.00007408475,0.000044700024,0.00046071725,0.00061619305,0.24055846,0.023392584,0.7169006,0.015540651,0.000090755915],"about_ca_topic_score_codex":0.0023419522,"about_ca_topic_score_gemma":0.0029068664,"teacher_disagreement_score":0.0070734504,"about_ca_system_score_codex":0.0010474025,"about_ca_system_score_gemma":0.00048811646,"threshold_uncertainty_score":0.023663104},"labels":[],"label_agreement":null},{"id":"W2319252906","doi":"10.4153/cmb-2015-040-0","title":"A Note on 3-choosability of Planar Graphs Related to Montanssier’s Conjecture","year":2015,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; List coloring; Graph; Conjecture; Discrete mathematics; Graph power; Line graph","score_opus":0.022389549202905725,"score_gpt":0.2805767668338209,"score_spread":0.2581872176309152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319252906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75614774,0.0018457134,0.11706356,0.015519237,0.00063335046,0.000118544325,0.0006607658,0.00053710677,0.10747396],"genre_scores_gemma":[0.9746753,0.0009474163,0.015867714,0.00092347735,0.00038432635,0.00004101534,0.00045618415,0.00005601729,0.0066484823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989625,0.00020583096,0.000048700207,0.0002986395,0.00026694333,0.00021725097],"domain_scores_gemma":[0.99440646,0.003973493,0.00052316993,0.00056244124,0.00022704451,0.00030746934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011655327,0.00041080255,0.0005479502,0.00087485934,0.001590457,0.0017713761,0.0012713694,0.0016857986,0.008551637],"category_scores_gemma":[0.0058385246,0.0004538668,0.0012438324,0.0014687853,0.0034810598,0.003203575,0.0019205359,0.0027793094,0.00057140854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005755447,0.00017202503,0.011740406,0.0003311644,0.00007360588,0.003029723,0.0017611699,0.028593259,0.008599271,0.8986308,0.014365714,0.03212732],"study_design_scores_gemma":[0.00012140383,0.00017906955,0.004957433,0.00005117538,0.00006858042,0.0015193126,0.0006758901,0.046773113,0.005964442,0.9210288,0.018596455,0.000064245934],"about_ca_topic_score_codex":0.004128369,"about_ca_topic_score_gemma":0.0026846996,"teacher_disagreement_score":0.008551637,"about_ca_system_score_codex":0.0013516357,"about_ca_system_score_gemma":0.00053527235,"threshold_uncertainty_score":0.028608024},"labels":[],"label_agreement":null},{"id":"W2321691063","doi":"10.5840/envirophil2008523","title":"Staying True to Trees","year":2008,"lang":"en","type":"article","venue":"Environmental Philosophy","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Applied philosophy; General interest; Contemporary philosophy; Philosophy; Epistemology","score_opus":0.028657597945621335,"score_gpt":0.24803445999084306,"score_spread":0.21937686204522172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321691063","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044312526,0.004946864,0.3203757,0.09061203,0.0028062095,0.0000762302,0.00044383746,0.00047727692,0.5359493],"genre_scores_gemma":[0.80804527,0.0033127097,0.051787168,0.014275601,0.002022208,0.00012907402,0.00037107276,0.0006309879,0.119426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981489,0.00077221374,0.000049886617,0.0004998062,0.00031527027,0.00021386561],"domain_scores_gemma":[0.9943638,0.003093758,0.00019780977,0.0011607978,0.00079383154,0.00038995006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018334892,0.00035167675,0.0006608246,0.00081293966,0.00547916,0.0040585394,0.0013168757,0.0028022432,0.018367885],"category_scores_gemma":[0.009194176,0.00047122219,0.0008235886,0.0011536309,0.013618631,0.01483358,0.0030673526,0.0075011607,0.0025018428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004540508,0.0000050648873,0.00006208831,0.000014614872,0.0000044151634,0.00001749555,0.00051418185,0.00014367429,0.00005525614,0.99173707,0.004012947,0.003428662],"study_design_scores_gemma":[0.0000029101643,0.0000024953088,0.000034199704,0.0000071468235,0.0000031671132,0.000020996431,0.00018320112,0.0002262905,0.000048361133,0.98070335,0.018765438,0.0000024795763],"about_ca_topic_score_codex":0.0039431043,"about_ca_topic_score_gemma":0.004011842,"teacher_disagreement_score":0.018367885,"about_ca_system_score_codex":0.0019705682,"about_ca_system_score_gemma":0.0012084524,"threshold_uncertainty_score":0.061446726},"labels":[],"label_agreement":null},{"id":"W2330005770","doi":"10.4153/cmb-2016-020-1","title":"The Thickness of the Cartesian Product of Two Graphs","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Bipartite graph; Planar graph; Graph; Planar; Discrete mathematics; Outerplanar graph; Cartesian coordinate system; Pathwidth; Line graph; Geometry; Computer science","score_opus":0.013334887478022408,"score_gpt":0.2523061781698554,"score_spread":0.23897129069183298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330005770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78962344,0.00072468823,0.19125633,0.00022678958,0.000068996145,0.000055812685,0.00039423018,0.00040577637,0.01724392],"genre_scores_gemma":[0.9270936,0.00047067547,0.06862355,0.000040471983,0.00004469027,0.000049911447,0.00036120476,0.0000861071,0.003229768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986621,0.00025830793,0.00012826765,0.0003116959,0.00046459745,0.00017502758],"domain_scores_gemma":[0.9936707,0.0023090723,0.0013672317,0.0007552504,0.0014192731,0.00047844514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012915548,0.00048768436,0.00047557816,0.0017674329,0.0006323493,0.0017554372,0.00073444966,0.0003560813,0.0036370906],"category_scores_gemma":[0.0052893413,0.000820188,0.0005073311,0.0009200936,0.001822509,0.0028900371,0.001942206,0.0008368986,0.00055735314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023221725,0.0001140224,0.038145155,0.000906209,0.000311167,0.0027819125,0.0029478841,0.10794525,0.20486772,0.5184684,0.0059717977,0.11521829],"study_design_scores_gemma":[0.00011436743,0.0011316364,0.045292262,0.0002807294,0.00038424827,0.0078120898,0.0030287078,0.34149033,0.1378404,0.41808608,0.044276856,0.0002622583],"about_ca_topic_score_codex":0.0010319696,"about_ca_topic_score_gemma":0.00092536595,"teacher_disagreement_score":0.0036370906,"about_ca_system_score_codex":0.0006788164,"about_ca_system_score_gemma":0.00046735408,"threshold_uncertainty_score":0.012167335},"labels":[],"label_agreement":null},{"id":"W2337761774","doi":"10.1007/978-3-319-29516-9_11","title":"List Colouring and Partial List Colouring of Graphs On-line","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Chordal graph; Combinatorics; Pathwidth; Computer science; Planar graph; Outerplanar graph; Clique-sum; Conjecture; Cograph; Indifference graph; Split graph; Discrete mathematics; Mathematics; Line graph; 1-planar graph; Graph","score_opus":0.028487873025494964,"score_gpt":0.2919273367348818,"score_spread":0.26343946370938687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337761774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076282725,0.0016957546,0.7552391,0.0012948506,0.0007989685,0.00027715915,0.000993339,0.003498558,0.15991955],"genre_scores_gemma":[0.42867905,0.0027090653,0.46250284,0.000787894,0.0004174499,0.0003625963,0.0018986904,0.0021618304,0.100480646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994211,0.00013185112,0.000030896255,0.0001397604,0.00015782785,0.00011851824],"domain_scores_gemma":[0.9980342,0.0007186824,0.00012235178,0.0006496899,0.00034242845,0.00013274525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042939917,0.000726963,0.00064044696,0.0008697754,0.0012924981,0.0023803432,0.0015270043,0.0008407428,0.017352168],"category_scores_gemma":[0.0028307443,0.00060712104,0.0009169727,0.0020436854,0.0015702336,0.003782594,0.0015896866,0.0020128721,0.0028427097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025594907,0.000081795195,0.00042439136,0.0005951389,0.000027738424,0.00018139306,0.0006108238,0.018745154,0.011010784,0.6766126,0.025165288,0.26628888],"study_design_scores_gemma":[0.000028786548,0.00006974777,0.00041951722,0.0000998925,0.000038485847,0.00024743495,0.00014672763,0.031803828,0.008446213,0.9037594,0.05490321,0.00003683102],"about_ca_topic_score_codex":0.0021678074,"about_ca_topic_score_gemma":0.0025392675,"teacher_disagreement_score":0.017352168,"about_ca_system_score_codex":0.0013472494,"about_ca_system_score_gemma":0.00084006804,"threshold_uncertainty_score":0.058048785},"labels":[],"label_agreement":null},{"id":"W2345365639","doi":"","title":"Algorithmic complexity and extremality characterizations for edge searching and its variations","year":2008,"lang":"en","type":"dissertation","venue":"Memorial University Research Repository (Memorial University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Bipartite graph; Combinatorics; Pathwidth; Search problem; Monotone polygon; Mathematics; Graph; Combinatorial search; Theoretical computer science; Time complexity; Computer science; Search algorithm; Beam search; Algorithm; Line graph","score_opus":0.061273920154882845,"score_gpt":0.30463673292767923,"score_spread":0.2433628127727964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345365639","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45767653,0.002079537,0.48778868,0.005063601,0.00013587571,0.00032359466,0.001352885,0.0005607405,0.045018606],"genre_scores_gemma":[0.8660067,0.0015497484,0.119711205,0.000672801,0.0004894258,0.00062795373,0.0016828537,0.00039012852,0.008869226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951297,0.0014157253,0.00031102973,0.0012942478,0.001007869,0.00084141287],"domain_scores_gemma":[0.9590338,0.031667873,0.0032205535,0.0030860459,0.0014537999,0.0015380167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003210187,0.0012998391,0.0019105077,0.0031360474,0.0017117334,0.0061442708,0.0038845558,0.003069433,0.0065080514],"category_scores_gemma":[0.027371235,0.0010721122,0.0032807635,0.004035543,0.004516215,0.012060374,0.004268984,0.0067734392,0.0005205907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004005561,0.00028987022,0.00602273,0.00040040677,0.00015875991,0.00020896837,0.0005231181,0.10657514,0.0033201429,0.85158503,0.004785869,0.025729517],"study_design_scores_gemma":[0.00006309345,0.00008613011,0.001675657,0.000052500465,0.000106164145,0.00024768064,0.00016201368,0.28576112,0.001228391,0.7082041,0.0023586263,0.000054531436],"about_ca_topic_score_codex":0.0013934525,"about_ca_topic_score_gemma":0.0015923604,"teacher_disagreement_score":0.0065080514,"about_ca_system_score_codex":0.0038049025,"about_ca_system_score_gemma":0.0013318184,"threshold_uncertainty_score":0.027606666},"labels":[],"label_agreement":null},{"id":"W2346145792","doi":"10.55016/ojs/cdm.v14i1.62582","title":"Hamiltonian-connectedness of triangulations with few separating triangles","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universiteit Gent; Vlaamse regering; Vlaams Supercomputer Centrum","keywords":"Social connectedness; Combinatorics; Mathematics; Corollary; Hamiltonian (control theory)","score_opus":0.014064088123411764,"score_gpt":0.3166775454202772,"score_spread":0.30261345729686545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346145792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8692406,0.00035229983,0.110950924,0.00039405748,0.00003430862,0.00005120777,0.00041798092,0.00012236973,0.018436236],"genre_scores_gemma":[0.95823294,0.0003526636,0.037745588,0.00008346416,0.000025867928,0.000051543426,0.00059111987,0.0000622061,0.0028546036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995821,0.00007864409,0.00002647689,0.000101289355,0.00011774326,0.00009378059],"domain_scores_gemma":[0.9967637,0.0016391098,0.0006623322,0.00041097912,0.0002632697,0.00026051438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003040423,0.00036057716,0.00046003988,0.00088891253,0.0010289322,0.0011639578,0.00090912794,0.00062704465,0.009598785],"category_scores_gemma":[0.0039007955,0.00052608276,0.0005318768,0.0011944501,0.001679143,0.0018140718,0.0019667859,0.0010027016,0.0004822118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010096122,0.00017351394,0.019759614,0.00088132446,0.00020997012,0.0019323127,0.0022750488,0.12849489,0.060778994,0.69545496,0.004979576,0.084050275],"study_design_scores_gemma":[0.00022845174,0.00018723075,0.010334112,0.00018142734,0.00019088078,0.0015258385,0.0017316006,0.20796825,0.02425684,0.7400402,0.013277238,0.00007797886],"about_ca_topic_score_codex":0.0016600294,"about_ca_topic_score_gemma":0.0026126949,"teacher_disagreement_score":0.009598785,"about_ca_system_score_codex":0.0004550564,"about_ca_system_score_gemma":0.00030013183,"threshold_uncertainty_score":0.032111168},"labels":[],"label_agreement":null},{"id":"W2346193990","doi":"10.23638/dmtcs-21-4-9","title":"$(2/2/3)$-SAT problem and its applications in dominating set problems","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Set (abstract data type); Computer science; Dominating set; Mathematics; Programming language; Theoretical computer science; Graph","score_opus":0.01667766956551976,"score_gpt":0.29466171826498233,"score_spread":0.2779840486994626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346193990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03622705,0.020511199,0.860605,0.01625616,0.0016890127,0.00045348462,0.0014353616,0.0011112466,0.061711445],"genre_scores_gemma":[0.36033386,0.017466413,0.58864564,0.0056219166,0.0030084148,0.00070514256,0.0023464225,0.0006689663,0.021203255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635834,0.0012928537,0.00019933445,0.0009146175,0.00090691453,0.00032796123],"domain_scores_gemma":[0.9931116,0.0054097255,0.00030573184,0.0005256902,0.00038792586,0.0002594057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031271533,0.0016946202,0.002176728,0.0022153175,0.0019916156,0.0032028363,0.003189445,0.0031789623,0.0073892493],"category_scores_gemma":[0.008514535,0.0011334362,0.004027016,0.0052013975,0.0033948114,0.005507981,0.004315776,0.007644351,0.0015608231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037945868,0.00036201678,0.0017786925,0.0017399722,0.0001945147,0.0005534606,0.0007945524,0.15969707,0.004109261,0.6203821,0.039924324,0.17008458],"study_design_scores_gemma":[0.000078542245,0.00009978268,0.0006870522,0.00017978705,0.00007381831,0.00070906506,0.0001808667,0.25271088,0.0021719337,0.7047832,0.03826358,0.000061393876],"about_ca_topic_score_codex":0.0054810573,"about_ca_topic_score_gemma":0.0047097043,"teacher_disagreement_score":0.0073892493,"about_ca_system_score_codex":0.0039054689,"about_ca_system_score_gemma":0.0018550722,"threshold_uncertainty_score":0.028336346},"labels":[],"label_agreement":null},{"id":"W2361202607","doi":"","title":"The Hats of Wheel Are Sequential Graph","year":2000,"lang":"en","type":"article","venue":"Journal of Huaibei Industry Teachers College","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Graph; Computer science; Combinatorics; Mathematics","score_opus":0.02726486279052103,"score_gpt":0.29510333924874066,"score_spread":0.2678384764582196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2361202607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23236904,0.00048954505,0.52027464,0.0017670105,0.0012695884,0.00042868243,0.0029247727,0.0024644893,0.23801225],"genre_scores_gemma":[0.75857085,0.0007301928,0.09982081,0.00050260953,0.00021482291,0.0002614149,0.0026757119,0.0005241255,0.13669942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996524,0.000040696752,0.000017263934,0.000121140205,0.000082889725,0.00008553585],"domain_scores_gemma":[0.9991036,0.00017015885,0.00009130054,0.00019389544,0.000304168,0.00013672296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021010796,0.00037264693,0.00032943054,0.0012550475,0.0018324109,0.0012724027,0.0005859536,0.0006284503,0.027662922],"category_scores_gemma":[0.0015066786,0.00040647658,0.00050332263,0.0013317601,0.0011399921,0.0028842608,0.0007461893,0.0007804515,0.0029944528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028873168,0.00010339637,0.0036040025,0.00022345225,0.00004238671,0.00070782495,0.0007331513,0.005091268,0.01507737,0.8429147,0.03727104,0.09394267],"study_design_scores_gemma":[0.000056489553,0.00010212414,0.0053845784,0.00004250523,0.00006899135,0.0005015689,0.0010874337,0.04097766,0.010639654,0.8165735,0.12450292,0.000062499676],"about_ca_topic_score_codex":0.008840892,"about_ca_topic_score_gemma":0.009154835,"teacher_disagreement_score":0.027662922,"about_ca_system_score_codex":0.0006905546,"about_ca_system_score_gemma":0.0009220439,"threshold_uncertainty_score":0.092541754},"labels":[],"label_agreement":null},{"id":"W2364884632","doi":"10.1112/blms.12141","title":"Almost all matroids are nonrepresentable","year":2018,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Graphic matroid; Existential quantification; Omega","score_opus":0.02368925168919626,"score_gpt":0.28878454218712835,"score_spread":0.26509529049793207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2364884632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86586076,0.00066816795,0.110737495,0.0010040639,0.000073665455,0.000023949473,0.0005170369,0.0002877764,0.02082704],"genre_scores_gemma":[0.97571087,0.00057233206,0.01577362,0.0002352121,0.00012996646,0.00006020485,0.00087528356,0.00009778765,0.0065447735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973773,0.0006473018,0.0001292621,0.0007594109,0.00074481533,0.00034196881],"domain_scores_gemma":[0.9769882,0.011954707,0.004411949,0.0035127103,0.0018352476,0.0012971266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015256978,0.00059160654,0.0010038419,0.0013629781,0.001536212,0.0038886357,0.0015648252,0.0012620096,0.0049236086],"category_scores_gemma":[0.017584898,0.0009826636,0.00071300264,0.0018913156,0.0026047966,0.0057672746,0.0024498748,0.0017289016,0.0007022738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008596304,0.00023586018,0.021630893,0.00049370545,0.00022024584,0.0007913934,0.0013287578,0.03113314,0.022225583,0.8523835,0.0061277356,0.06256954],"study_design_scores_gemma":[0.00006844936,0.00025612672,0.009272647,0.00009230213,0.00010225727,0.004334665,0.000853919,0.10766479,0.012502672,0.8425778,0.022223122,0.000051245668],"about_ca_topic_score_codex":0.00037822465,"about_ca_topic_score_gemma":0.00037705895,"teacher_disagreement_score":0.0049236086,"about_ca_system_score_codex":0.001084685,"about_ca_system_score_gemma":0.00041025225,"threshold_uncertainty_score":0.016471148},"labels":[],"label_agreement":null},{"id":"W2383797602","doi":"10.1016/j.dam.2016.04.021","title":"Trees with large <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>m</mml:mi></mml:math>-eternal domination number","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation; Pacific Institute for the Mathematical Sciences","keywords":"Guard (computer science); Vertex (graph theory); Combinatorics; Mathematics; Graph; Discrete mathematics; Computer science","score_opus":0.014173069210246202,"score_gpt":0.2604181717843639,"score_spread":0.2462451025741177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2383797602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058182552,0.001592035,0.7504842,0.0039174347,0.00061450695,0.00045004443,0.02181925,0.006407958,0.15653196],"genre_scores_gemma":[0.46569285,0.0019976613,0.3751878,0.001367565,0.00043918611,0.0008757379,0.022992432,0.0036330917,0.12781379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936897,0.000097323165,0.00005954326,0.00012607063,0.00023941236,0.000108586646],"domain_scores_gemma":[0.99597675,0.0021917808,0.00027385348,0.0006282417,0.0007090271,0.00022023809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006203023,0.00037585184,0.0006180774,0.0011986191,0.0013081596,0.0022520795,0.0009545034,0.00085325097,0.031474136],"category_scores_gemma":[0.0061220787,0.00046069044,0.0005665756,0.002167299,0.0007872585,0.003713359,0.0014741276,0.0014680234,0.0077477507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021255674,0.000086756474,0.001896381,0.00049495255,0.00003587056,0.0006137853,0.00066454615,0.005316291,0.010262892,0.81064075,0.08873099,0.08104414],"study_design_scores_gemma":[0.00006035006,0.000031692223,0.0015276815,0.00014768114,0.000037749105,0.00095114304,0.00024362998,0.019624012,0.0072617517,0.6845606,0.28550258,0.000051245443],"about_ca_topic_score_codex":0.0017264081,"about_ca_topic_score_gemma":0.0041810647,"teacher_disagreement_score":0.031474136,"about_ca_system_score_codex":0.0009111506,"about_ca_system_score_gemma":0.0009076258,"threshold_uncertainty_score":0.105291486},"labels":[],"label_agreement":null},{"id":"W2394487339","doi":"","title":"Special minimum cuts in directed graphs NOTE.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.024485116995650837,"score_gpt":0.2921298065002501,"score_spread":0.2676446895045993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394487339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16153918,0.0052940752,0.42972204,0.008713077,0.0046655047,0.0003147375,0.004043306,0.0012815042,0.38442665],"genre_scores_gemma":[0.777665,0.0046420265,0.14486986,0.0023264703,0.0031359133,0.00040935157,0.0052963146,0.0007505277,0.060904566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913126,0.0001790468,0.000058490714,0.00028305323,0.00024299814,0.00010523822],"domain_scores_gemma":[0.99604756,0.0024230676,0.0003227624,0.00044669662,0.00036484835,0.0003950723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007555298,0.0007762482,0.00092890643,0.0020536685,0.0012198037,0.002525827,0.0014109779,0.0014630641,0.026170045],"category_scores_gemma":[0.005816672,0.00070873165,0.0010687888,0.0023249614,0.0014988882,0.00376465,0.0017064583,0.0045540403,0.0028166294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019141218,0.00007524629,0.0009806843,0.00055245514,0.000064521235,0.0006518449,0.0003759467,0.0026655004,0.0037782346,0.9091182,0.039534487,0.042011462],"study_design_scores_gemma":[0.000025080897,0.000029638832,0.0007371429,0.000047361274,0.000033650856,0.0008553899,0.00013519327,0.0038538957,0.0011454638,0.9737646,0.019356968,0.000015680727],"about_ca_topic_score_codex":0.00080371863,"about_ca_topic_score_gemma":0.0013820805,"teacher_disagreement_score":0.026170045,"about_ca_system_score_codex":0.0008212184,"about_ca_system_score_gemma":0.00045366416,"threshold_uncertainty_score":0.08754754},"labels":[],"label_agreement":null},{"id":"W2394517787","doi":"","title":"Pseudo-outerplanar graphs and chromatic conjectures.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Outerplanar graph; Discrete mathematics; Pathwidth; Graph; Line graph","score_opus":0.008828477229429532,"score_gpt":0.2513453727960519,"score_spread":0.24251689556662237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394517787","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3188011,0.008928505,0.12783024,0.04153802,0.0025401225,0.00016105032,0.001992483,0.001012893,0.49719557],"genre_scores_gemma":[0.93409383,0.004188815,0.017074792,0.0030142951,0.0014300018,0.00010530449,0.0020696644,0.00022321829,0.037800115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860436,0.0004624347,0.000045250777,0.0003234083,0.00034047168,0.00022415537],"domain_scores_gemma":[0.9868707,0.00918539,0.0008584028,0.001574117,0.00082434533,0.00068707863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016636654,0.0006988778,0.0006649433,0.0015334812,0.00282823,0.0031803844,0.0019245828,0.0025161947,0.022324208],"category_scores_gemma":[0.0135669345,0.0006866437,0.00075356255,0.0021156631,0.0051214322,0.0097120255,0.0035102575,0.0045907903,0.0022572866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104441104,0.000055287946,0.0009921871,0.00015976951,0.000016581213,0.00018533216,0.0004508705,0.0024002413,0.00041641953,0.9678164,0.01683605,0.010566406],"study_design_scores_gemma":[0.000019458985,0.000010616436,0.00037407063,0.000030638894,0.000009686548,0.00011285268,0.00021384205,0.002761779,0.00019068307,0.98885196,0.007415812,0.000008657977],"about_ca_topic_score_codex":0.0027814726,"about_ca_topic_score_gemma":0.0040397868,"teacher_disagreement_score":0.022324208,"about_ca_system_score_codex":0.0016071162,"about_ca_system_score_gemma":0.0008496488,"threshold_uncertainty_score":0.07468188},"labels":[],"label_agreement":null},{"id":"W2394528912","doi":"","title":"End-completely-regular and End-inverse joins of graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Joins; Mathematics; Inverse; Combinatorics; Computer science; Geometry; Programming language","score_opus":0.015978604320760783,"score_gpt":0.2543213914225688,"score_spread":0.23834278710180803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394528912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26269117,0.0014393908,0.46058166,0.0015746985,0.0005588746,0.0001448301,0.0014354999,0.0014564615,0.2701174],"genre_scores_gemma":[0.86440545,0.00069004326,0.07576838,0.0006124985,0.00043428005,0.00012323097,0.0017602827,0.00062630506,0.055579524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980622,0.000399863,0.00012328957,0.0005949944,0.0005330279,0.00028662488],"domain_scores_gemma":[0.99521315,0.0020464982,0.0005621136,0.0009011108,0.00069032866,0.00058673316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013569891,0.00057321216,0.0007204957,0.001611896,0.0024631196,0.0040213894,0.0011838187,0.0011822523,0.007510923],"category_scores_gemma":[0.0051473947,0.00067562645,0.0011631137,0.0013564639,0.003658619,0.0077781077,0.003168088,0.0029873461,0.0021689795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067730296,0.00003668002,0.00035905227,0.0000342924,0.00001009535,0.00014720333,0.0003602096,0.00043677675,0.0009187119,0.9886641,0.0014106287,0.007554621],"study_design_scores_gemma":[0.00001160113,0.000019208816,0.0003113413,0.000015892638,0.00001410749,0.00030479807,0.00022468939,0.0016224651,0.001780151,0.9863267,0.009354954,0.000014241451],"about_ca_topic_score_codex":0.0007516787,"about_ca_topic_score_gemma":0.0011419023,"teacher_disagreement_score":0.007510923,"about_ca_system_score_codex":0.0009278954,"about_ca_system_score_gemma":0.0006373537,"threshold_uncertainty_score":0.025126576},"labels":[],"label_agreement":null},{"id":"W2394631425","doi":"","title":"Spanning trees whose stems have at most k leaves.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Horticulture; Combinatorics; Biology","score_opus":0.018599383170885917,"score_gpt":0.27352755899945186,"score_spread":0.2549281758285659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394631425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5166692,0.0055957553,0.27008754,0.0035165292,0.0006268793,0.00038848314,0.014899762,0.003407588,0.18480818],"genre_scores_gemma":[0.80056995,0.0027767862,0.12695171,0.0010872199,0.0003537859,0.0002153598,0.013866062,0.00042046304,0.053758662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944526,0.00008682029,0.00007816998,0.00016206682,0.00008980361,0.00013782704],"domain_scores_gemma":[0.9974433,0.0010388319,0.00035140276,0.00050204864,0.00039221373,0.00027216188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033806404,0.0004884916,0.0007287116,0.00075810996,0.0014607065,0.0015177304,0.00096251006,0.0012092493,0.013100072],"category_scores_gemma":[0.003530707,0.0004795125,0.00060083694,0.0012339008,0.00053980417,0.0033846935,0.0016894893,0.0009273315,0.008987573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011117677,0.00059040525,0.01398908,0.0020550655,0.0003113569,0.0061937314,0.002318698,0.008024496,0.118561946,0.4767668,0.06385119,0.3062255],"study_design_scores_gemma":[0.000110666006,0.00022794433,0.009566158,0.0003909086,0.00023827972,0.01330893,0.0015196846,0.018736912,0.024129272,0.79123616,0.14043629,0.00009869514],"about_ca_topic_score_codex":0.00039947047,"about_ca_topic_score_gemma":0.0008580543,"teacher_disagreement_score":0.013100072,"about_ca_system_score_codex":0.00033134213,"about_ca_system_score_gemma":0.00038950544,"threshold_uncertainty_score":0.043824077},"labels":[],"label_agreement":null},{"id":"W2394646298","doi":"","title":"Trees with the fourth largest number of maximal independent sets.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory)","score_opus":0.01201799064296281,"score_gpt":0.26269455306046785,"score_spread":0.250676562417505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394646298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51544785,0.0031009724,0.2586301,0.0071223364,0.0008870558,0.00028860898,0.015101025,0.0025476308,0.19687438],"genre_scores_gemma":[0.84046245,0.0010285433,0.109976,0.0008838898,0.00046779646,0.00028384977,0.00661939,0.0004899781,0.039788138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991248,0.00019121538,0.000054715565,0.00017757625,0.00021291476,0.00023881554],"domain_scores_gemma":[0.99170285,0.0044842362,0.0009373644,0.0013724348,0.00077081675,0.00073230726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006946033,0.000557512,0.0010794953,0.0017969273,0.0020607274,0.0034875963,0.0015602398,0.0017868214,0.012801114],"category_scores_gemma":[0.008689505,0.0008533498,0.0010276464,0.0018263847,0.0014138152,0.0034918196,0.0017934607,0.0021001177,0.003331347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067522994,0.00017097604,0.0050956276,0.0004819486,0.00015568585,0.0012165254,0.0005102754,0.008471434,0.017753556,0.8601826,0.048061572,0.057224587],"study_design_scores_gemma":[0.000096794596,0.000051451705,0.002457267,0.00009542643,0.000142951,0.0017036158,0.00021142185,0.014926473,0.008730086,0.93665385,0.03489126,0.00003936611],"about_ca_topic_score_codex":0.0008555525,"about_ca_topic_score_gemma":0.0018677536,"teacher_disagreement_score":0.012801114,"about_ca_system_score_codex":0.0013027311,"about_ca_system_score_gemma":0.0013176923,"threshold_uncertainty_score":0.04282397},"labels":[],"label_agreement":null},{"id":"W2394711279","doi":"","title":"The t-Pebbling Conjecture on Products of Complete r-Partite Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics","score_opus":0.0442046350333334,"score_gpt":0.2703736874322913,"score_spread":0.2261690523989579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394711279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46005055,0.0025835773,0.2104766,0.011544928,0.0011389665,0.00015610368,0.002325145,0.0013185721,0.3104055],"genre_scores_gemma":[0.9248663,0.001608601,0.02809827,0.0017636572,0.00060397945,0.00012900049,0.0022302247,0.000370584,0.040329322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998754,0.00029573307,0.000065013955,0.000320638,0.0002686783,0.00029583773],"domain_scores_gemma":[0.9917143,0.0043072123,0.00063507876,0.0017893338,0.000829309,0.00072475895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001368377,0.000626739,0.0010737558,0.0008559553,0.0029296416,0.004569674,0.001373747,0.0022832225,0.021032888],"category_scores_gemma":[0.010265094,0.001032931,0.0014693331,0.001629848,0.003096738,0.010283485,0.0026788688,0.0034582908,0.0045903674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020699766,0.00006915433,0.0009865065,0.00018452131,0.000030840783,0.00029713378,0.00039942065,0.004372427,0.0012092222,0.9624672,0.017918248,0.011858264],"study_design_scores_gemma":[0.0000252371,0.000024616937,0.0002277182,0.00002737761,0.000015801184,0.00020153062,0.00013117325,0.004910619,0.0005922049,0.988378,0.005453741,0.0000120361865],"about_ca_topic_score_codex":0.0019493187,"about_ca_topic_score_gemma":0.002113519,"teacher_disagreement_score":0.021032888,"about_ca_system_score_codex":0.0009615024,"about_ca_system_score_gemma":0.00090949435,"threshold_uncertainty_score":0.07036203},"labels":[],"label_agreement":null},{"id":"W2394748621","doi":"","title":"Domination by Union of Complete Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; Vertex (graph theory); Graph; Induced subgraph; Discrete mathematics; Property (philosophy); Domination analysis; Set (abstract data type); Computer science","score_opus":0.011810092131149724,"score_gpt":0.2674976246667467,"score_spread":0.25568753253559695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394748621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4115205,0.0024274953,0.49844566,0.00058029976,0.00013161078,0.00022882862,0.00197398,0.00089662854,0.08379496],"genre_scores_gemma":[0.88946176,0.00093485543,0.08775449,0.00024143256,0.0001570079,0.0002743659,0.0029935509,0.0003265511,0.017855994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807453,0.0004975554,0.00010222342,0.00061598833,0.00047009366,0.00023955987],"domain_scores_gemma":[0.9917008,0.005226822,0.00091883086,0.00075665524,0.0006087662,0.00078813935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015175563,0.00047633468,0.0007007572,0.0014812232,0.0014426261,0.0018665201,0.00095853885,0.00051729294,0.0058239424],"category_scores_gemma":[0.007535581,0.00060245255,0.00094674545,0.0011954681,0.0017392815,0.0035697508,0.0019580603,0.00094153255,0.0005533646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000990062,0.0001275803,0.0059767775,0.00063953426,0.00020457756,0.0012347152,0.0016055082,0.03366084,0.02200653,0.83353114,0.00854377,0.09147897],"study_design_scores_gemma":[0.000111379064,0.0001701963,0.0036819472,0.00010311948,0.00013089526,0.0030389598,0.00045083577,0.09822663,0.01648674,0.8324171,0.045120683,0.000061568164],"about_ca_topic_score_codex":0.0010239737,"about_ca_topic_score_gemma":0.0011795082,"teacher_disagreement_score":0.0058239424,"about_ca_system_score_codex":0.000829896,"about_ca_system_score_gemma":0.00045884596,"threshold_uncertainty_score":0.01948303},"labels":[],"label_agreement":null},{"id":"W2394825792","doi":"","title":"4-regular bipartite matching extendable graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Matching (statistics); Combinatorics; Graph; Statistics","score_opus":0.012611972059304899,"score_gpt":0.25981203563062877,"score_spread":0.24720006357132387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394825792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3649756,0.00092786853,0.28889245,0.0021229766,0.00042559157,0.0003438548,0.005302741,0.0027763837,0.33423254],"genre_scores_gemma":[0.827397,0.0007360392,0.07822893,0.000731089,0.00019090303,0.00020095306,0.005001884,0.0003727807,0.08714052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932826,0.00012655782,0.000043264736,0.00020089994,0.00014217789,0.00015890917],"domain_scores_gemma":[0.9984724,0.00045679722,0.0002618207,0.000377033,0.00017296828,0.00025895235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005188316,0.00054473145,0.00061173143,0.0010038405,0.0010160839,0.0014062311,0.0014119617,0.00091457664,0.025824687],"category_scores_gemma":[0.0025209542,0.000346163,0.0007495718,0.001329534,0.0008153232,0.003057539,0.0020222417,0.0015231124,0.004305089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053964736,0.00025265256,0.002192041,0.00039997464,0.00008680751,0.0011133838,0.0005245178,0.005180311,0.014182956,0.8698255,0.018106515,0.08759572],"study_design_scores_gemma":[0.00006184621,0.000064966254,0.0019061404,0.00007358103,0.00010084044,0.00087641657,0.00027199177,0.011112662,0.006005249,0.92076105,0.05873436,0.000030934152],"about_ca_topic_score_codex":0.0009054211,"about_ca_topic_score_gemma":0.0015423637,"teacher_disagreement_score":0.025824687,"about_ca_system_score_codex":0.00061438465,"about_ca_system_score_gemma":0.00046387973,"threshold_uncertainty_score":0.086392224},"labels":[],"label_agreement":null},{"id":"W2394920966","doi":"","title":"Enumeration of Labelled Essential Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics","score_opus":0.009554101312663859,"score_gpt":0.2594430963491188,"score_spread":0.24988899503645493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394920966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0913106,0.0012205715,0.6295584,0.002126871,0.00045969442,0.00022814391,0.004266716,0.0015606054,0.26926842],"genre_scores_gemma":[0.5867601,0.0013076002,0.29283497,0.0009532647,0.00020716092,0.00031933896,0.009678221,0.0009063029,0.10703299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900013,0.00033257058,0.00007285485,0.00016368316,0.00027348503,0.00015735012],"domain_scores_gemma":[0.9965933,0.0017681519,0.00020741073,0.000597141,0.00058170606,0.00025231807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000672192,0.0005248251,0.00054872397,0.0015479752,0.0015758092,0.0021723362,0.0013203884,0.0011128283,0.018311122],"category_scores_gemma":[0.0042573027,0.00049329246,0.0008659525,0.0019246286,0.0011195862,0.0040537296,0.0023701717,0.0020066001,0.0038779539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009261565,0.00005610287,0.0005551769,0.0002195161,0.000016729433,0.00016625362,0.0003174303,0.0013705189,0.0031420132,0.9449244,0.010923573,0.038215674],"study_design_scores_gemma":[0.000011925844,0.000012135803,0.00030313685,0.00007610753,0.000017468092,0.00023246209,0.00013118348,0.0047462373,0.0021274374,0.9656929,0.02663817,0.000011001113],"about_ca_topic_score_codex":0.00088098686,"about_ca_topic_score_gemma":0.0024964083,"teacher_disagreement_score":0.018311122,"about_ca_system_score_codex":0.0010302818,"about_ca_system_score_gemma":0.0008330076,"threshold_uncertainty_score":0.061256766},"labels":[],"label_agreement":null},{"id":"W2394985079","doi":"","title":"On the total restrained domination edge critical graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Domination analysis; Dominating set; Mathematics; Combinatorics; Vertex (graph theory); Cardinality (data modeling); Graph; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.016586343730049507,"score_gpt":0.2840400107065568,"score_spread":0.2674536669765073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394985079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28275007,0.004775266,0.64486426,0.0017225824,0.00020588946,0.00036436596,0.001192869,0.00031310134,0.06381167],"genre_scores_gemma":[0.8405012,0.0033529522,0.14606492,0.0006467226,0.00040312242,0.0003391224,0.0010293748,0.000116934985,0.007545719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895966,0.00026683285,0.00004437805,0.00023392492,0.00033574636,0.00015940476],"domain_scores_gemma":[0.9955649,0.0028227672,0.0004941333,0.00030657157,0.00046497595,0.00034654138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010820698,0.00093026244,0.00064209773,0.0028191844,0.0013096088,0.0013137877,0.0011806992,0.0006405947,0.002698643],"category_scores_gemma":[0.0047823456,0.00038331043,0.0005673481,0.002053852,0.002318833,0.0037452746,0.0014769842,0.0016121508,0.00031750606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025284907,0.000108882894,0.0032353108,0.0005885879,0.00009336156,0.00050494564,0.0009061789,0.06370916,0.014565968,0.84216875,0.009141567,0.06472429],"study_design_scores_gemma":[0.00004655891,0.00020268737,0.002598888,0.00019814078,0.00008928878,0.002053356,0.0005439436,0.12902324,0.0067382935,0.8256305,0.032812927,0.00006220345],"about_ca_topic_score_codex":0.001066582,"about_ca_topic_score_gemma":0.001360899,"teacher_disagreement_score":0.0028191844,"about_ca_system_score_codex":0.0016523894,"about_ca_system_score_gemma":0.000595215,"threshold_uncertainty_score":0.011988997},"labels":[],"label_agreement":null},{"id":"W2395152572","doi":"","title":"Total chromatic number of folded hypercubes.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Chromatic scale; Mathematics; Combinatorics","score_opus":0.01213662577506603,"score_gpt":0.269610672308851,"score_spread":0.257474046533785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395152572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8461739,0.0006838634,0.032875422,0.00074359856,0.00014077021,0.00004801237,0.002608027,0.00034543267,0.116380915],"genre_scores_gemma":[0.9680576,0.0005338334,0.010113117,0.0001059452,0.000051987143,0.00006157139,0.0014482255,0.00012719464,0.019500498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997589,0.000047285735,0.00000979184,0.000053570107,0.000061850755,0.00006865333],"domain_scores_gemma":[0.9990453,0.00038822615,0.00014444828,0.00012841089,0.00013823302,0.00015528979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029204504,0.00037546956,0.00027586895,0.001472493,0.0010846588,0.0019765962,0.00066551456,0.00050630356,0.015315787],"category_scores_gemma":[0.0013491195,0.00025440732,0.00029710008,0.0014301696,0.0009831506,0.0016133117,0.0007552994,0.00049496896,0.001093581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073766755,0.00008504695,0.007567036,0.0005012576,0.0000985991,0.00030928993,0.0007004848,0.043548834,0.03532007,0.8387749,0.0240649,0.04829187],"study_design_scores_gemma":[0.0001055019,0.00015364557,0.011579016,0.0001501482,0.00011246643,0.0008280786,0.0010312437,0.0961251,0.022155399,0.8361297,0.031578448,0.000051169805],"about_ca_topic_score_codex":0.0017675313,"about_ca_topic_score_gemma":0.0036530455,"teacher_disagreement_score":0.015315787,"about_ca_system_score_codex":0.0012834424,"about_ca_system_score_gemma":0.0005272882,"threshold_uncertainty_score":0.05123645},"labels":[],"label_agreement":null},{"id":"W2395208292","doi":"","title":"Broadcast domination of products of graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Domination analysis; Combinatorics; Vertex (graph theory); Hamming graph; Upper and lower bounds; Graph; Discrete mathematics; Hamming code; Algorithm","score_opus":0.014051285189737034,"score_gpt":0.27427578333410246,"score_spread":0.26022449814436543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395208292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62409556,0.0016169482,0.33285958,0.00025669287,0.00006503611,0.00019268498,0.00065391324,0.00038970864,0.039869934],"genre_scores_gemma":[0.94275814,0.00063414796,0.049500722,0.000060377315,0.000050034363,0.00010982945,0.00039913345,0.00008696382,0.006400659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987791,0.00023032755,0.00007059516,0.00030452514,0.0004211831,0.0001943463],"domain_scores_gemma":[0.99397355,0.0033890367,0.0008120121,0.0007633479,0.000692874,0.0003692612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011076634,0.00046445822,0.00045771847,0.0011997112,0.0010106623,0.0014986863,0.0007019981,0.0003153052,0.0035165395],"category_scores_gemma":[0.0071063805,0.0003749216,0.00041601335,0.0010844413,0.001817521,0.002388436,0.0012098483,0.00070015236,0.0004095938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007395042,0.000087423046,0.0133967595,0.00060277793,0.00010718735,0.0004862103,0.0023355728,0.04694713,0.052177865,0.7655735,0.0045548216,0.11299121],"study_design_scores_gemma":[0.000100208075,0.0006922755,0.01080849,0.00015528007,0.0002187022,0.0030348767,0.0011471674,0.19008535,0.07550368,0.65504575,0.06309803,0.000110200075],"about_ca_topic_score_codex":0.00148441,"about_ca_topic_score_gemma":0.002301981,"teacher_disagreement_score":0.0035165395,"about_ca_system_score_codex":0.0013099051,"about_ca_system_score_gemma":0.0005606688,"threshold_uncertainty_score":0.01176393},"labels":[],"label_agreement":null},{"id":"W2395366427","doi":"","title":"On fractional (g, f, n)-critical graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.013403809083092168,"score_gpt":0.3065653111481694,"score_spread":0.2931615020650772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395366427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6404915,0.0023561001,0.09021508,0.002975788,0.00060160476,0.00013944942,0.0006257126,0.00034160496,0.2622532],"genre_scores_gemma":[0.9540821,0.0008777013,0.018090889,0.00048130014,0.00020477652,0.00006678572,0.00051933044,0.000095277974,0.025581975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997389,0.000074268624,0.000008881913,0.000050412124,0.00004563612,0.00008190409],"domain_scores_gemma":[0.9988965,0.0004911566,0.00017436485,0.00008469959,0.0001249553,0.00022839378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003479382,0.0005268428,0.00044793182,0.002520719,0.0028580884,0.0015761033,0.000654955,0.0012158308,0.010210875],"category_scores_gemma":[0.0026772106,0.00035413253,0.00039712922,0.00091609673,0.0018615643,0.0024716354,0.0014924941,0.0011183599,0.0008130446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001226397,0.000024557596,0.00064899854,0.00009597565,0.000011066906,0.0003476795,0.0002976752,0.0030029486,0.0022417137,0.9794201,0.0052682157,0.008518393],"study_design_scores_gemma":[0.000023732011,0.000016019978,0.00046275376,0.000059346297,0.000011358978,0.00032496225,0.00030085698,0.0074040815,0.0010926625,0.9824928,0.007801304,0.000010013447],"about_ca_topic_score_codex":0.0023363605,"about_ca_topic_score_gemma":0.0038936203,"teacher_disagreement_score":0.010210875,"about_ca_system_score_codex":0.0015463135,"about_ca_system_score_gemma":0.00047487195,"threshold_uncertainty_score":0.034158766},"labels":[],"label_agreement":null},{"id":"W2395431039","doi":"","title":"Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian path problem; Hamiltonian (control theory); Hamiltonian path; Indifference graph; Chordal graph; Combinatorics; Pancyclic graph; 1-planar graph; Graph; Mathematical optimization","score_opus":0.014352649610265684,"score_gpt":0.2559067875107385,"score_spread":0.24155413790047278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395431039","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015102259,0.08370073,0.051691465,0.032820415,0.021177763,0.00005718912,0.002107095,0.0004923952,0.7928507],"genre_scores_gemma":[0.3916003,0.12599279,0.047106553,0.020212905,0.033567127,0.0002808543,0.0036567918,0.0006079214,0.3769747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996151,0.00008649898,0.00002045801,0.00007083607,0.00015878206,0.00004838466],"domain_scores_gemma":[0.99870646,0.00085228984,0.00006735284,0.000111379944,0.000128117,0.00013440113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065371214,0.0010460404,0.00072425476,0.0027950453,0.0009611937,0.0015391653,0.001033305,0.0011367914,0.025154637],"category_scores_gemma":[0.002548344,0.00038553693,0.0005914763,0.0043348535,0.0025373418,0.0031678334,0.0012269906,0.003564822,0.00437643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025654112,0.000035244313,0.00017134567,0.00027556633,0.000027452197,0.00016029723,0.00020878427,0.00085306534,0.00051408634,0.86886966,0.10172522,0.027133588],"study_design_scores_gemma":[0.0000112903435,0.000012811974,0.00047848787,0.00006467094,0.000013653501,0.0001635026,0.00008545997,0.0005350257,0.0001937402,0.9120632,0.08636747,0.000010688676],"about_ca_topic_score_codex":0.0027007677,"about_ca_topic_score_gemma":0.004261161,"teacher_disagreement_score":0.025154637,"about_ca_system_score_codex":0.0015029766,"about_ca_system_score_gemma":0.000720405,"threshold_uncertainty_score":0.08415067},"labels":[],"label_agreement":null},{"id":"W2395515199","doi":"","title":"Equality of Domination and Inverse Domination Numbers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Domination analysis; Vertex (graph theory); Inverse; Combinatorics; Tamil; Graph; Cardinality (data modeling); Computer science; Database","score_opus":0.014905004661871913,"score_gpt":0.29407056282698424,"score_spread":0.27916555816511235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395515199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53773123,0.0056713433,0.20793588,0.0019374297,0.00060951954,0.00016015364,0.001449408,0.00031169623,0.24419332],"genre_scores_gemma":[0.97823095,0.00053073175,0.01423853,0.00010018749,0.00016716933,0.0000529024,0.00024023255,0.000024849302,0.0064143087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971916,0.000646895,0.00021580908,0.00077039783,0.0007192608,0.0004560712],"domain_scores_gemma":[0.9916181,0.005534481,0.0007681656,0.00060229073,0.0009427024,0.0005342612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014625932,0.00045590088,0.0005233792,0.002272563,0.0011085295,0.0025311655,0.00069213985,0.0005432105,0.0047975387],"category_scores_gemma":[0.010786963,0.00030056707,0.00052029407,0.0018993979,0.0028509465,0.0035172328,0.0013472423,0.0010410026,0.00043660818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035345033,0.000054573808,0.0067772786,0.00026775367,0.000057466998,0.00050554227,0.00077171385,0.006508344,0.007012771,0.895449,0.0042315153,0.07801065],"study_design_scores_gemma":[0.000053389645,0.00011530141,0.007332901,0.000080721045,0.00008543593,0.003038529,0.00048744012,0.02232431,0.0072841286,0.9321201,0.027017778,0.000059965103],"about_ca_topic_score_codex":0.0007552444,"about_ca_topic_score_gemma":0.00073649734,"teacher_disagreement_score":0.0047975387,"about_ca_system_score_codex":0.0012882333,"about_ca_system_score_gemma":0.00045773725,"threshold_uncertainty_score":0.016049385},"labels":[],"label_agreement":null},{"id":"W2395608997","doi":"","title":"Signed total k-domination in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010246913771740866,"score_gpt":0.25610357869985884,"score_spread":0.24585666492811797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395608997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6073851,0.0016206767,0.19645895,0.002304457,0.00042297298,0.00011942858,0.001414023,0.0008109688,0.1894633],"genre_scores_gemma":[0.9509081,0.00059585716,0.01409698,0.00037630415,0.00013167784,0.00007042268,0.0006379386,0.00014834406,0.03303427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992187,0.00018495189,0.000056658162,0.00015046926,0.00022709867,0.00016197555],"domain_scores_gemma":[0.99671715,0.0014247762,0.00044858872,0.0004406794,0.0005562433,0.0004126363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006402242,0.00041688397,0.0004334137,0.0013197906,0.0013649208,0.002481107,0.0008218705,0.0006846893,0.009506713],"category_scores_gemma":[0.00421504,0.00030827164,0.00049623055,0.0015296725,0.001601912,0.003835585,0.0017712936,0.0010465916,0.0012335518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015658773,0.000056834622,0.0022028447,0.00027425028,0.00005203202,0.00039331513,0.00072705623,0.0034657973,0.0060343095,0.9305075,0.008348766,0.047780674],"study_design_scores_gemma":[0.000032049134,0.000032492982,0.0011430971,0.000054253625,0.00003521403,0.0006409152,0.0003298917,0.009580099,0.0031518145,0.97165304,0.013320889,0.00002627653],"about_ca_topic_score_codex":0.00085958175,"about_ca_topic_score_gemma":0.0017060123,"teacher_disagreement_score":0.009506713,"about_ca_system_score_codex":0.0010190596,"about_ca_system_score_gemma":0.0006822564,"threshold_uncertainty_score":0.03180307},"labels":[],"label_agreement":null},{"id":"W2395706617","doi":"","title":"Trees with the second and third largest number of maximal independent sets.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.010027530289241016,"score_gpt":0.26499360853963644,"score_spread":0.2549660782503954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395706617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49305558,0.003288648,0.27544805,0.005751435,0.0007909393,0.00028744675,0.014723969,0.0025837698,0.20407006],"genre_scores_gemma":[0.86316144,0.00082128786,0.09795861,0.00081436825,0.00034252193,0.00020775333,0.0057266606,0.0003970017,0.03057037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999231,0.00013001566,0.000044546756,0.00016967622,0.00019509844,0.00022969894],"domain_scores_gemma":[0.99432206,0.0028133306,0.0006536715,0.0008803707,0.0005267412,0.00080376636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635937,0.00045934442,0.00087686605,0.0012573184,0.0022125388,0.0030004636,0.0011123562,0.0017471695,0.010750588],"category_scores_gemma":[0.006319824,0.0006484542,0.0009933558,0.0015763547,0.0011985376,0.002942884,0.0014769969,0.0018169095,0.002813933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062229275,0.00020147447,0.005294916,0.0003971121,0.0001211451,0.0013852725,0.0005867638,0.0056081843,0.023684166,0.85467327,0.048692074,0.058733445],"study_design_scores_gemma":[0.00010208305,0.00006871681,0.005385533,0.000121127814,0.00015530204,0.0035566136,0.00033484498,0.014743532,0.014285535,0.91635835,0.044837918,0.00005054615],"about_ca_topic_score_codex":0.0009148006,"about_ca_topic_score_gemma":0.0021268548,"teacher_disagreement_score":0.010750588,"about_ca_system_score_codex":0.0010590749,"about_ca_system_score_gemma":0.0012372679,"threshold_uncertainty_score":0.03596431},"labels":[],"label_agreement":null},{"id":"W2395847372","doi":"","title":"On questions on (total) domination vertex critical graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.010794027808564482,"score_gpt":0.3019416141110427,"score_spread":0.2911475863024782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395847372","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2602114,0.021147905,0.17893325,0.07755912,0.002372679,0.0001716897,0.0012189406,0.00042030594,0.4579648],"genre_scores_gemma":[0.9163329,0.011376908,0.019684883,0.0061488934,0.004234557,0.00016877518,0.0011155758,0.00023481683,0.04070276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905115,0.0003540658,0.000037950664,0.00018353293,0.00020614822,0.0001670903],"domain_scores_gemma":[0.988381,0.009469608,0.0005300443,0.0004373264,0.0006469969,0.00053505274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017938977,0.0006451095,0.000817849,0.002430174,0.0027149236,0.0034814104,0.0015621352,0.0033832737,0.011537831],"category_scores_gemma":[0.013012821,0.00048746457,0.0006554817,0.0027195986,0.0054211635,0.013291524,0.002386418,0.003535542,0.0010978203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032140044,0.000022479499,0.0004006884,0.00011865056,0.000009972724,0.00009670327,0.00027229846,0.0015771891,0.00024494584,0.9816134,0.008560873,0.0070507815],"study_design_scores_gemma":[0.0000061563865,0.000004715028,0.00017718984,0.00002608254,0.0000040977147,0.00007158803,0.00017843809,0.0011081661,0.000089668705,0.9936324,0.004696779,0.0000047172502],"about_ca_topic_score_codex":0.001965984,"about_ca_topic_score_gemma":0.0017349701,"teacher_disagreement_score":0.011537831,"about_ca_system_score_codex":0.0024691208,"about_ca_system_score_gemma":0.0006156006,"threshold_uncertainty_score":0.03859788},"labels":[],"label_agreement":null},{"id":"W2395855926","doi":"","title":"Connected even factors in {K 1, l , K 1, l +e}-free graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.015237217422907135,"score_gpt":0.26248963372693973,"score_spread":0.2472524163040326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395855926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7783322,0.0018022505,0.05290725,0.0018018938,0.00034911907,0.000099588346,0.001395515,0.0007869197,0.16252525],"genre_scores_gemma":[0.9511217,0.0006215185,0.008184692,0.0003111926,0.00008161281,0.000050168786,0.000721553,0.00021800537,0.038689595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996761,0.000055587992,0.000017409975,0.00008188614,0.000048891412,0.00012020893],"domain_scores_gemma":[0.999141,0.0003680581,0.00018001934,0.000087603905,0.00007180423,0.00015153727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023210517,0.0004388932,0.00034063502,0.0010043704,0.0014974417,0.0021082126,0.0005262247,0.00070083066,0.016116517],"category_scores_gemma":[0.0014372345,0.00042655575,0.0004121191,0.00087563373,0.0013325708,0.0023859218,0.001294635,0.0007861021,0.0029158234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006078755,0.00014663766,0.0048086867,0.00034593188,0.00006141597,0.0017189403,0.0015613576,0.002708308,0.0147161735,0.9156036,0.015304078,0.04241696],"study_design_scores_gemma":[0.00006178445,0.00003872686,0.0020696037,0.00010535177,0.00006148959,0.00064046506,0.0006770936,0.0032137504,0.0067159794,0.95654404,0.029834397,0.00003726816],"about_ca_topic_score_codex":0.0015809204,"about_ca_topic_score_gemma":0.003818339,"teacher_disagreement_score":0.016116517,"about_ca_system_score_codex":0.000538781,"about_ca_system_score_gemma":0.0005105338,"threshold_uncertainty_score":0.053915143},"labels":[],"label_agreement":null},{"id":"W2395940650","doi":"","title":"Hamilton Cycles in Cubic Polyhex Graphs on the Klein Bottle.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Klein bottle; Mathematics; Bottle; Combinatorics; Cubic graph; Geometry; Graph; Composite material; Materials science; Line graph","score_opus":0.017187316849342375,"score_gpt":0.2631006797914168,"score_spread":0.24591336294207444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395940650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79764616,0.0011770381,0.039902914,0.0022208677,0.00047663788,0.0001401272,0.0007732839,0.00052272656,0.15714008],"genre_scores_gemma":[0.9532898,0.0005589343,0.008693102,0.00033649287,0.00010582247,0.00008766685,0.00035672705,0.00012594709,0.036445618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997563,0.000049559952,0.000010782033,0.000036722544,0.00006202621,0.000084796106],"domain_scores_gemma":[0.9994205,0.00018729232,0.00011502006,0.00006556809,0.00007043807,0.00014122609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011967582,0.0003151084,0.00037428056,0.0009668874,0.001807622,0.0020305803,0.0007233042,0.0010554468,0.012472262],"category_scores_gemma":[0.0012353607,0.00043235507,0.0003853532,0.00093309325,0.0011748138,0.0018677348,0.0014012428,0.0010196664,0.0013732055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001245128,0.000041478088,0.00069618813,0.00009193807,0.000014861135,0.00044116873,0.00035234794,0.004378693,0.0027349028,0.96742713,0.008284506,0.015412355],"study_design_scores_gemma":[0.000038664544,0.000023271306,0.0008120157,0.000035027715,0.000017500826,0.00019277906,0.00050894014,0.018025592,0.0016077744,0.9708576,0.007856603,0.000024189241],"about_ca_topic_score_codex":0.0061720596,"about_ca_topic_score_gemma":0.00992773,"teacher_disagreement_score":0.012472262,"about_ca_system_score_codex":0.0010342269,"about_ca_system_score_gemma":0.0007338176,"threshold_uncertainty_score":0.041723907},"labels":[],"label_agreement":null},{"id":"W2395992115","doi":"","title":"Hamiltonicity of transformation graph G","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Graph; Combinatorics; Chemistry; Gene; Biochemistry","score_opus":0.013523889369996234,"score_gpt":0.25909371013837557,"score_spread":0.24556982076837933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395992115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73521495,0.00017546258,0.12869224,0.0012523677,0.00011405423,0.00026266405,0.0015285353,0.0006741086,0.13208573],"genre_scores_gemma":[0.9622458,0.00013636636,0.009344575,0.00022176682,0.000032845273,0.00010955016,0.0011407858,0.00008537928,0.02668298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974436,0.00004998571,0.000007713331,0.000073602,0.000047193236,0.00007706975],"domain_scores_gemma":[0.99952793,0.00018853114,0.00007629866,0.00006916307,0.000068495116,0.00006960667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014150092,0.00026242566,0.00033523474,0.0006781565,0.0010520312,0.0011650559,0.0004805223,0.0005275948,0.012013421],"category_scores_gemma":[0.0006328531,0.00024488475,0.00042437538,0.00063640496,0.00074329047,0.00074027525,0.0006681045,0.00074809213,0.0011216978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001970978,0.00007541108,0.0027585388,0.00009727726,0.000038685368,0.00088465976,0.0012645443,0.0043315208,0.017877866,0.94526833,0.0061809993,0.02102509],"study_design_scores_gemma":[0.00009811897,0.00008422098,0.003701372,0.00002217953,0.000043851647,0.0005233172,0.0006562384,0.01862717,0.006898537,0.9581061,0.01121268,0.000026222226],"about_ca_topic_score_codex":0.0034596534,"about_ca_topic_score_gemma":0.0026755102,"teacher_disagreement_score":0.012013421,"about_ca_system_score_codex":0.00057349144,"about_ca_system_score_gemma":0.000694196,"threshold_uncertainty_score":0.04018897},"labels":[],"label_agreement":null},{"id":"W2396084200","doi":"","title":"Extremal polyphenyl chains concerning k-matchings and k-independent sets","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01543485829817315,"score_gpt":0.27582726063342067,"score_spread":0.2603924023352475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396084200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7733595,0.00091168506,0.07374121,0.0036751158,0.00036123753,0.000108886336,0.0008862073,0.0002840008,0.14667217],"genre_scores_gemma":[0.948989,0.00056558056,0.015017854,0.0005772892,0.0003898044,0.00014054227,0.00071129785,0.00016847035,0.033440154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992034,0.00017939422,0.0000358156,0.00016874318,0.00020211928,0.00021054111],"domain_scores_gemma":[0.99826306,0.0007935283,0.00031482676,0.00018002659,0.00015444656,0.0002940657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007730607,0.00070570444,0.0010921323,0.0027857781,0.0036812534,0.0027904385,0.0013021315,0.0019364798,0.012042444],"category_scores_gemma":[0.002576695,0.00072269246,0.0010897041,0.0030705244,0.002152908,0.004780083,0.0025748536,0.0033892584,0.0007559115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087205,0.000035335128,0.00042422416,0.0000612796,0.000015148194,0.00014105327,0.00021045639,0.0014073926,0.0012355356,0.98849887,0.0020102374,0.005873189],"study_design_scores_gemma":[0.000025508945,0.000014547026,0.00038341116,0.000011954605,0.000017170967,0.000098950244,0.000069512585,0.005406521,0.00055400416,0.99185705,0.0015501748,0.000011149252],"about_ca_topic_score_codex":0.0009543461,"about_ca_topic_score_gemma":0.0015652566,"teacher_disagreement_score":0.012042444,"about_ca_system_score_codex":0.0017038853,"about_ca_system_score_gemma":0.0007327617,"threshold_uncertainty_score":0.040285945},"labels":[],"label_agreement":null},{"id":"W2396161277","doi":"","title":"Up-embeddable graphs via the degree-sum of nonadjacent vertices: non-simple graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Simple (philosophy); Discrete mathematics; Physics","score_opus":0.023782001337334224,"score_gpt":0.2798523484529674,"score_spread":0.2560703471156332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396161277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.665614,0.0009253211,0.25820842,0.0008281021,0.000286961,0.00010557763,0.00043374882,0.00057901465,0.07301875],"genre_scores_gemma":[0.9416428,0.0006554898,0.035147622,0.00015350366,0.00012197411,0.00004796889,0.0003622714,0.00016114455,0.021707233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996315,0.0000769934,0.000020172847,0.00008467514,0.00012806957,0.000058532725],"domain_scores_gemma":[0.9984237,0.00067627366,0.00027171636,0.00026648326,0.00012510024,0.0002367551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002544146,0.00055275596,0.00042432704,0.0009903022,0.0010689517,0.0018230904,0.00094512006,0.00080623146,0.0064093424],"category_scores_gemma":[0.0022776946,0.0005048749,0.0003921412,0.0008853513,0.0013801274,0.003702937,0.0018466928,0.0015805756,0.00097218127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017671417,0.000114352966,0.0016044521,0.00022173463,0.000039596856,0.0018051817,0.000985763,0.0061384924,0.019000601,0.92030615,0.0033289278,0.046278074],"study_design_scores_gemma":[0.000024814353,0.00003923137,0.0013023514,0.000033959663,0.00005478426,0.0010464652,0.0003696413,0.016774641,0.007741193,0.96601224,0.0065787304,0.000021896876],"about_ca_topic_score_codex":0.00027595102,"about_ca_topic_score_gemma":0.00081239105,"teacher_disagreement_score":0.0064093424,"about_ca_system_score_codex":0.00031515464,"about_ca_system_score_gemma":0.00021648502,"threshold_uncertainty_score":0.0214414},"labels":[],"label_agreement":null},{"id":"W2396209512","doi":"","title":"Edge-choosability of planar graphs without chordal 7-Cycles.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Planar graph; Outerplanar graph; Enhanced Data Rates for GSM Evolution; Combinatorics; Planar; Pathwidth; Computer science; Graph; Telecommunications; Line graph","score_opus":0.02951463565057108,"score_gpt":0.27835382407437037,"score_spread":0.2488391884237993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396209512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79457337,0.00095299655,0.07414938,0.0015229705,0.00012913294,0.00017248055,0.0020649729,0.0005393388,0.12589541],"genre_scores_gemma":[0.9766609,0.0005079886,0.010055359,0.000201812,0.00006539417,0.000060536844,0.001666718,0.0001415609,0.010639717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994504,0.00009694184,0.000041493648,0.00014039049,0.00014370384,0.00012714165],"domain_scores_gemma":[0.9970095,0.0018650725,0.000381115,0.00034100743,0.00014000956,0.0002632633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038295944,0.00037767645,0.00053632754,0.0005478011,0.00082617934,0.0019432895,0.0012854548,0.0010713434,0.018835494],"category_scores_gemma":[0.0035903924,0.00049554586,0.0006193842,0.0009943538,0.0009880055,0.0029271257,0.0014336393,0.0014648869,0.0014833509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013993115,0.00037127474,0.009164175,0.00095441955,0.00015038486,0.0014250032,0.0009638092,0.022918327,0.032129075,0.80888,0.015525349,0.106119],"study_design_scores_gemma":[0.00033532042,0.00018055984,0.0058675134,0.000095169315,0.000136568,0.0014605061,0.0006358553,0.0364715,0.016757678,0.9265858,0.011416028,0.000057540143],"about_ca_topic_score_codex":0.0013825044,"about_ca_topic_score_gemma":0.0018186286,"teacher_disagreement_score":0.018835494,"about_ca_system_score_codex":0.00065681903,"about_ca_system_score_gemma":0.0005195651,"threshold_uncertainty_score":0.06301099},"labels":[],"label_agreement":null},{"id":"W2396221740","doi":"","title":"Hamilton-Connectivity of Claw-Free Graphs with Bounded Dilworth Numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Bounded function; Combinatorics; Mathematical analysis; Biology; Ecology","score_opus":0.021254876623232465,"score_gpt":0.24769977161974074,"score_spread":0.22644489499650827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396221740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83044624,0.0008127328,0.05471681,0.0012975386,0.00009428395,0.00009698478,0.0012029707,0.00042508982,0.11090745],"genre_scores_gemma":[0.9806311,0.0002835023,0.007146649,0.00017891558,0.000038078255,0.000063785075,0.00073168456,0.00005607265,0.010870083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997693,0.00004846593,0.0000108921895,0.00004893632,0.000058380836,0.00006407707],"domain_scores_gemma":[0.9978289,0.0011215921,0.0003854995,0.00014614005,0.00021215652,0.00030568228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019483487,0.0003369597,0.00027684701,0.0014321622,0.0009497535,0.0013272775,0.0009278184,0.00088809896,0.012877524],"category_scores_gemma":[0.002863615,0.00037990464,0.00021710493,0.00097358646,0.0010908357,0.0019749394,0.0011133909,0.00080719736,0.0009407614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002181639,0.00008181006,0.0029040582,0.00018184677,0.00003131523,0.00064726186,0.00070474326,0.005998961,0.00810982,0.94746983,0.009903167,0.023749018],"study_design_scores_gemma":[0.000069494425,0.000041369978,0.0031188605,0.00004736022,0.000028469934,0.00040316276,0.0005192745,0.021564294,0.0028648127,0.9645799,0.00673652,0.000026514484],"about_ca_topic_score_codex":0.0030699188,"about_ca_topic_score_gemma":0.0062192557,"teacher_disagreement_score":0.012877524,"about_ca_system_score_codex":0.0007483877,"about_ca_system_score_gemma":0.00038038444,"threshold_uncertainty_score":0.043079615},"labels":[],"label_agreement":null},{"id":"W2396222681","doi":"","title":"Molds of regular tournaments.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.012643959749659733,"score_gpt":0.262233958986099,"score_spread":0.2495899992364393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396222681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6160288,0.0011161622,0.1452728,0.001009191,0.0006912488,0.00015847858,0.0012824951,0.001064926,0.23337586],"genre_scores_gemma":[0.9456073,0.00031955965,0.01577351,0.00020888694,0.00015184752,0.00007591119,0.0006855477,0.00020431173,0.036973167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996203,0.000071306014,0.000021444994,0.00009788835,0.00008531632,0.00010369424],"domain_scores_gemma":[0.9992574,0.00019382693,0.00014203988,0.00017015047,0.0000604781,0.0001761737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021344241,0.000332879,0.00049222854,0.0008379694,0.0010797395,0.0024836527,0.00067074865,0.00057543244,0.015423523],"category_scores_gemma":[0.0015182709,0.000413949,0.00066940626,0.0005085531,0.0012271194,0.0011328436,0.0014871852,0.000859188,0.0018620852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013541312,0.00006429936,0.0015300531,0.000072779614,0.00003595729,0.0002834484,0.00026476648,0.006630234,0.0039743916,0.95896286,0.007594279,0.020451687],"study_design_scores_gemma":[0.0000918269,0.000090093934,0.001941604,0.00005202514,0.00003567049,0.000443651,0.0003180127,0.028987363,0.0024702211,0.9412277,0.024316503,0.00002535133],"about_ca_topic_score_codex":0.0012521234,"about_ca_topic_score_gemma":0.0022138488,"teacher_disagreement_score":0.015423523,"about_ca_system_score_codex":0.00053354126,"about_ca_system_score_gemma":0.0002906933,"threshold_uncertainty_score":0.05159688},"labels":[],"label_agreement":null},{"id":"W2396482382","doi":"","title":"An operation based on complete graphs with an application to the line graphs of trees.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Line (geometry); Pathwidth; Combinatorics; 1-planar graph; Indifference graph; Chordal graph; Line graph; Graph; Geometry","score_opus":0.020715606604939138,"score_gpt":0.2927934108021639,"score_spread":0.27207780419722477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396482382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059388574,0.0011496947,0.84311247,0.001482722,0.0015430917,0.00018699646,0.00068331906,0.0019579546,0.09049516],"genre_scores_gemma":[0.49921423,0.0018802998,0.43739435,0.0012239937,0.0017020368,0.00035749224,0.0010021534,0.0014729339,0.05575249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991425,0.00023826491,0.00005553496,0.0002511144,0.00021214307,0.00010040004],"domain_scores_gemma":[0.99814975,0.00074331544,0.0001571676,0.0003512133,0.00034736248,0.00025118067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008148875,0.00043103448,0.0005013234,0.0018716466,0.0015192595,0.002058155,0.000925325,0.0007591889,0.007780378],"category_scores_gemma":[0.00350981,0.0002868259,0.0011536606,0.001926853,0.002689658,0.005646929,0.0028032984,0.0018655956,0.0016191184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078254634,0.000050364502,0.0002505995,0.00008693778,0.000016251342,0.00019381364,0.0003672336,0.0010890717,0.0031521663,0.9288256,0.008803156,0.05708653],"study_design_scores_gemma":[0.000027656753,0.00014394522,0.0007620259,0.000054091903,0.00005182655,0.0009786385,0.00041270367,0.012429811,0.006172251,0.8854384,0.09346076,0.00006776264],"about_ca_topic_score_codex":0.000827121,"about_ca_topic_score_gemma":0.0010324636,"teacher_disagreement_score":0.007780378,"about_ca_system_score_codex":0.0005450989,"about_ca_system_score_gemma":0.00052209245,"threshold_uncertainty_score":0.026027918},"labels":[],"label_agreement":null},{"id":"W2396520109","doi":"","title":"On The Tree Domination Number Of A Random Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory); Graph; Random graph; Discrete mathematics","score_opus":0.024008109633209703,"score_gpt":0.2956903190151385,"score_spread":0.2716822093819288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396520109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6658047,0.005930978,0.20439534,0.01299149,0.00079924817,0.00021535541,0.0027338967,0.0008359527,0.106293045],"genre_scores_gemma":[0.9747004,0.0018958746,0.013922572,0.00065012986,0.0008544488,0.00027255912,0.000647002,0.00022197713,0.0068349126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975775,0.0011471236,0.000087596876,0.00040717146,0.00043082784,0.00034976288],"domain_scores_gemma":[0.9422609,0.04829723,0.003120842,0.0023445445,0.001388502,0.0025880116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041220672,0.0007939129,0.0014711784,0.0046354434,0.0016456869,0.0032825198,0.0023822088,0.002072397,0.008861633],"category_scores_gemma":[0.040619083,0.0006665775,0.0006040544,0.0026405014,0.0040917094,0.0079974085,0.002299433,0.0028625545,0.0010791672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042685762,0.00008076833,0.0038809564,0.0002545186,0.000070380505,0.00014975539,0.00037636887,0.03867874,0.0027371866,0.9189371,0.015364478,0.019042963],"study_design_scores_gemma":[0.000092264934,0.00006587881,0.002311206,0.00011230178,0.000049972627,0.00034377392,0.00012295136,0.16491139,0.0013463766,0.8265925,0.003989392,0.00006195952],"about_ca_topic_score_codex":0.0010788753,"about_ca_topic_score_gemma":0.0013055477,"teacher_disagreement_score":0.008861633,"about_ca_system_score_codex":0.002541672,"about_ca_system_score_gemma":0.00093402725,"threshold_uncertainty_score":0.029645085},"labels":[],"label_agreement":null},{"id":"W2396687675","doi":"","title":"Properties of total restrained domination vertex critical graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.038530119723588774,"score_gpt":0.2966074414444802,"score_spread":0.25807732172089143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396687675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82069504,0.00053409516,0.07400882,0.0004970634,0.000062203384,0.00015632458,0.001239509,0.0004651278,0.10234184],"genre_scores_gemma":[0.9853677,0.00020288194,0.0061152,0.000089571855,0.000030084186,0.000050887204,0.00065865746,0.000067180976,0.007417777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996526,0.000057608344,0.000017536275,0.00007641668,0.00011570851,0.000080132355],"domain_scores_gemma":[0.9960943,0.001866326,0.00053032255,0.00045603293,0.0005737064,0.00047941113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038091082,0.00033591632,0.00032924218,0.0019874072,0.0011907802,0.0017600122,0.00087530504,0.00046142505,0.008202017],"category_scores_gemma":[0.0042120824,0.00035667844,0.00033556393,0.0013620205,0.0012456255,0.0016955853,0.00086190534,0.0007417497,0.0005786011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028441436,0.000078151985,0.007099555,0.0002959823,0.000064284235,0.001048025,0.0012499114,0.010916424,0.01692094,0.92354774,0.00804414,0.030450452],"study_design_scores_gemma":[0.00007756192,0.00007512649,0.00481373,0.00008515618,0.00008227065,0.0022111174,0.0008206066,0.032541443,0.010808089,0.93134516,0.017104395,0.000035366935],"about_ca_topic_score_codex":0.0016053619,"about_ca_topic_score_gemma":0.0018021772,"teacher_disagreement_score":0.008202017,"about_ca_system_score_codex":0.0007836209,"about_ca_system_score_gemma":0.00048651962,"threshold_uncertainty_score":0.027438462},"labels":[],"label_agreement":null},{"id":"W2396751065","doi":"","title":"Maximum Packings of Complete Graphs with Octagons.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014019520243766188,"score_gpt":0.25703634742635195,"score_spread":0.24301682718258577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396751065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6267141,0.002723507,0.23630741,0.0012553146,0.00032170393,0.00015390155,0.0026857255,0.0010596764,0.12877856],"genre_scores_gemma":[0.87872994,0.0010985677,0.091879606,0.00032377028,0.00018037998,0.00015327963,0.003288881,0.0003991871,0.023946406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923694,0.00021846495,0.000053615313,0.00013694337,0.00021008565,0.00014394251],"domain_scores_gemma":[0.9976139,0.0011100167,0.0004204651,0.00040116662,0.00017510702,0.00027935978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038081442,0.00063838536,0.00090961956,0.0014324725,0.0014113131,0.0029082322,0.0010958663,0.0012805418,0.012689168],"category_scores_gemma":[0.0051254285,0.001248069,0.0007065756,0.002147183,0.001230895,0.0036852714,0.0022228835,0.0015220207,0.0018852672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077530195,0.00033897077,0.0031329677,0.00066837214,0.00011496706,0.000700033,0.0008226813,0.034129634,0.009383607,0.8188752,0.02961959,0.10143878],"study_design_scores_gemma":[0.00010758669,0.00012557542,0.0023638168,0.00017931723,0.000057169163,0.0009026715,0.00064592285,0.081076875,0.0048991777,0.8860448,0.02356163,0.000035365763],"about_ca_topic_score_codex":0.0009805374,"about_ca_topic_score_gemma":0.002043666,"teacher_disagreement_score":0.012689168,"about_ca_system_score_codex":0.0006034551,"about_ca_system_score_gemma":0.00039695724,"threshold_uncertainty_score":0.042449534},"labels":[],"label_agreement":null},{"id":"W2396789099","doi":"","title":"Uniquely colorable graphs on surfaces","year":2014,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.026336558821799402,"score_gpt":0.28627553334482503,"score_spread":0.2599389745230256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396789099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5948261,0.0010745402,0.16573507,0.0024174422,0.0011295093,0.00013459641,0.0008631933,0.0015676966,0.23225184],"genre_scores_gemma":[0.8731979,0.0009930781,0.045694645,0.00084926275,0.00042534978,0.000115816554,0.00074497913,0.0009673468,0.07701161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904937,0.00017532521,0.00004292589,0.0002690927,0.00024579055,0.00021747715],"domain_scores_gemma":[0.9984642,0.0005803237,0.00018383155,0.000301102,0.00018780265,0.00028279817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047219725,0.001269789,0.0011798026,0.0024420924,0.002239065,0.0034708655,0.0014637114,0.0017450484,0.014247136],"category_scores_gemma":[0.0021695956,0.0011556129,0.0011208326,0.0017692584,0.002581858,0.0053450763,0.0031359056,0.0043196566,0.0021126312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002504982,0.000023530423,0.00024187658,0.000041519113,0.0000065785307,0.00012971538,0.00030059856,0.0009392004,0.0020355296,0.9848221,0.0022680657,0.0091662705],"study_design_scores_gemma":[0.00001131415,0.000009661175,0.00035317225,0.00001584628,0.000011070814,0.00018017454,0.00018016784,0.0018000426,0.0010704832,0.9900614,0.0062912498,0.00001536025],"about_ca_topic_score_codex":0.0011171396,"about_ca_topic_score_gemma":0.0019107088,"teacher_disagreement_score":0.014247136,"about_ca_system_score_codex":0.0011772744,"about_ca_system_score_gemma":0.0004745848,"threshold_uncertainty_score":0.047661483},"labels":[],"label_agreement":null},{"id":"W2396910810","doi":"","title":"Signed cycle domination numbers of digraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.007712485541944295,"score_gpt":0.25763933095743385,"score_spread":0.24992684541548957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396910810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5853643,0.0015310004,0.15256165,0.0017717978,0.00050989876,0.0001397769,0.0022528146,0.00067485834,0.25519392],"genre_scores_gemma":[0.96312654,0.0005054701,0.016429018,0.00019382499,0.00014404042,0.00009407474,0.00062192,0.000083777515,0.018801177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994306,0.00013890082,0.000045577646,0.00010147916,0.00018455375,0.000098820594],"domain_scores_gemma":[0.9968742,0.0016563332,0.00041876186,0.00021157105,0.00042889596,0.00041022486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000523599,0.0003466683,0.0003230639,0.0027074327,0.0009240796,0.0029649846,0.00062211754,0.00068153214,0.011185734],"category_scores_gemma":[0.00505876,0.00025889993,0.0002785664,0.001614654,0.0011343823,0.0035685264,0.00090881134,0.001016291,0.0010629816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009519009,0.000030843632,0.0010672457,0.00008752887,0.000012919378,0.00008817247,0.00021623376,0.0025819223,0.002386876,0.96040046,0.0041917865,0.028840965],"study_design_scores_gemma":[0.000029581635,0.00003523112,0.0011017583,0.00004930877,0.000017532591,0.00024394123,0.00015003237,0.011932673,0.0024036332,0.970922,0.013089563,0.000024754834],"about_ca_topic_score_codex":0.0006373084,"about_ca_topic_score_gemma":0.0012268177,"teacher_disagreement_score":0.011185734,"about_ca_system_score_codex":0.0012638897,"about_ca_system_score_gemma":0.0005432967,"threshold_uncertainty_score":0.037420034},"labels":[],"label_agreement":null},{"id":"W2396958062","doi":"","title":"Unicyclic graphs with equal total and total outer-connected domination numbers.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Domination analysis; Vertex (graph theory); Induced subgraph; Graph; Cardinality (data modeling); Connectivity; Discrete mathematics; Computer science","score_opus":0.017967320349802873,"score_gpt":0.26817489131317584,"score_spread":0.250207570963373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396958062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8380293,0.0017262517,0.095325544,0.00042569326,0.00007218698,0.00017946403,0.0030800262,0.00028916044,0.06087228],"genre_scores_gemma":[0.98048043,0.000603714,0.013622497,0.00008296299,0.000035144556,0.00009225528,0.0010132613,0.000032893124,0.0040367646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991209,0.00018136585,0.00006820302,0.00022597125,0.00015741761,0.00024611168],"domain_scores_gemma":[0.9954939,0.0019850957,0.001095825,0.0004133702,0.0005252113,0.0004866192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039110388,0.0006494475,0.0005817176,0.0018532905,0.0009691415,0.001555467,0.0008575219,0.0005561999,0.002296878],"category_scores_gemma":[0.0039576394,0.00027566968,0.00043360793,0.0025453605,0.0010382596,0.0015539497,0.0011283272,0.00041945733,0.0002501939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012931764,0.00022156369,0.015370045,0.0012318484,0.00026714342,0.002709211,0.0017104975,0.0851754,0.031813674,0.71683383,0.013711893,0.12966177],"study_design_scores_gemma":[0.00015150824,0.00045274425,0.016080623,0.00030461917,0.00039394456,0.012699906,0.0015345879,0.16641982,0.019361246,0.7299123,0.052552834,0.0001359123],"about_ca_topic_score_codex":0.0012134237,"about_ca_topic_score_gemma":0.0017362392,"teacher_disagreement_score":0.002296878,"about_ca_system_score_codex":0.0008572711,"about_ca_system_score_gemma":0.0004012991,"threshold_uncertainty_score":0.007683754},"labels":[],"label_agreement":null},{"id":"W2397010370","doi":"","title":"Cographic and global cographic domination number of a graph.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Domination analysis; Combinatorics","score_opus":0.00815285498671749,"score_gpt":0.2841116367541711,"score_spread":0.27595878176745364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397010370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7339883,0.001308335,0.06802814,0.0018606383,0.0002491176,0.00008222112,0.0032537247,0.0003972298,0.19083238],"genre_scores_gemma":[0.9758504,0.00038339998,0.010471202,0.00013201137,0.00012834577,0.00006929931,0.0007296224,0.000049735143,0.012185972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994123,0.00013161502,0.000029378652,0.00016456617,0.0001356873,0.00012639175],"domain_scores_gemma":[0.99644536,0.0017769155,0.0004733083,0.00033594764,0.00039315684,0.0005752944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000596832,0.0003521516,0.00040877506,0.0024801488,0.0010820333,0.002462946,0.00085547747,0.00059259584,0.009703719],"category_scores_gemma":[0.0033176234,0.00017124842,0.0003393212,0.0016165706,0.0019794577,0.0027585917,0.0010564479,0.0008641087,0.0007863962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020969115,0.000054171476,0.004652029,0.00016452947,0.00004198293,0.00016422753,0.00045855978,0.0046883025,0.0044574053,0.9524262,0.007188151,0.025494918],"study_design_scores_gemma":[0.000055063567,0.0000731367,0.008080968,0.00006894312,0.000075949174,0.00083612447,0.00048065328,0.017991971,0.0041799946,0.9481344,0.019986095,0.000036695426],"about_ca_topic_score_codex":0.0008791396,"about_ca_topic_score_gemma":0.0014103565,"teacher_disagreement_score":0.009703719,"about_ca_system_score_codex":0.0011270194,"about_ca_system_score_gemma":0.000663586,"threshold_uncertainty_score":0.03246218},"labels":[],"label_agreement":null},{"id":"W2397312785","doi":"","title":"Walk Regular Digraphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.00967793685079788,"score_gpt":0.2614910553113739,"score_spread":0.251813118460576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397312785","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17541601,0.0023808337,0.28548574,0.0027407198,0.00087212276,0.00029369554,0.006890314,0.0021239566,0.52379674],"genre_scores_gemma":[0.74554497,0.0018288712,0.05179825,0.0010967974,0.00023431335,0.0001708344,0.0052640303,0.0003504392,0.19371147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966633,0.000058369038,0.000023807048,0.00010632768,0.00007753887,0.00006756002],"domain_scores_gemma":[0.99920326,0.00024970944,0.00008896814,0.00014064398,0.00015048946,0.0001669652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018526903,0.00039368946,0.0004293169,0.001235489,0.0010750275,0.0019073935,0.00060800265,0.00068529113,0.022658069],"category_scores_gemma":[0.0015675782,0.0003244204,0.00039216457,0.0012023167,0.0006059873,0.0023254934,0.001131469,0.0010369612,0.005279323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077828976,0.00006767608,0.00052493275,0.00014823361,0.00002477433,0.00037780975,0.00025385828,0.0008706774,0.002279683,0.9413744,0.01768517,0.036315005],"study_design_scores_gemma":[0.000034443685,0.000035382534,0.0006528709,0.000057882626,0.000034555418,0.0007304852,0.00023167826,0.0050907508,0.0018863697,0.90193135,0.089294836,0.000019424877],"about_ca_topic_score_codex":0.0010064585,"about_ca_topic_score_gemma":0.002387959,"teacher_disagreement_score":0.022658069,"about_ca_system_score_codex":0.0005990558,"about_ca_system_score_gemma":0.00037807482,"threshold_uncertainty_score":0.07579881},"labels":[],"label_agreement":null},{"id":"W2397391144","doi":"","title":"Extremal Multi-bridge Graphs With Respect To Merrifield-Simmons Index.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Bridge (graph theory); Combinatorics; Discrete mathematics; Computer science; Medicine; Surgery","score_opus":0.05144812537959317,"score_gpt":0.29315717067934705,"score_spread":0.24170904529975387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397391144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48678997,0.0011140708,0.08055707,0.0035206238,0.0005687775,0.00011775615,0.0010878886,0.00063588563,0.42560804],"genre_scores_gemma":[0.95924354,0.00044744214,0.0126387775,0.0004533308,0.00030252273,0.00008896154,0.00052318675,0.00013182832,0.026170265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994136,0.00012453283,0.000025694368,0.00011503211,0.00019553312,0.00012556126],"domain_scores_gemma":[0.9979473,0.0007051676,0.00034618407,0.0002654875,0.00027992038,0.00045601156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008770788,0.00045877468,0.0007299007,0.0035902334,0.002409102,0.0029904195,0.0012074853,0.0015142981,0.019833233],"category_scores_gemma":[0.0040191896,0.00031739863,0.00040973834,0.0016151875,0.0016845947,0.003774063,0.0022687658,0.0020036623,0.0019308187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007274323,0.000021482727,0.00035481085,0.000029669665,0.000007782206,0.00009655605,0.00011366108,0.00057947607,0.0009061743,0.9865672,0.0036595995,0.007590851],"study_design_scores_gemma":[0.000025678657,0.000023805473,0.0005898456,0.000023075565,0.000011070974,0.00027366832,0.00014198456,0.0046979096,0.0007555537,0.98696566,0.0064783315,0.000013459781],"about_ca_topic_score_codex":0.0004909318,"about_ca_topic_score_gemma":0.0008221031,"teacher_disagreement_score":0.019833233,"about_ca_system_score_codex":0.0010391476,"about_ca_system_score_gemma":0.00041924426,"threshold_uncertainty_score":0.06634879},"labels":[],"label_agreement":null},{"id":"W2397482252","doi":"","title":"Finding Hamiltonian Cycles in Four Subfamilies of Quasi-Claw-Free Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Hamiltonian (control theory); Biology; Mathematical optimization; Ecology","score_opus":0.022172388187462966,"score_gpt":0.284372922292056,"score_spread":0.26220053410459304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397482252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94796383,0.0005434441,0.032156345,0.00066568033,0.000032100328,0.00018754865,0.0009513045,0.0003814094,0.017118389],"genre_scores_gemma":[0.9471002,0.00025908937,0.04061402,0.00024206367,0.000018362927,0.000091600195,0.0028085422,0.00011247799,0.008753648],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977285,0.000034085562,0.000012338476,0.00006584302,0.00003847632,0.000076342105],"domain_scores_gemma":[0.9988273,0.0006038572,0.00011710728,0.00018074593,0.00011989732,0.00015106454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023358152,0.00031175627,0.00043959563,0.0010666252,0.0014880147,0.00086111407,0.0010467127,0.0009870764,0.010325877],"category_scores_gemma":[0.0019347003,0.00034479355,0.00047306382,0.000988521,0.0005754623,0.0014777544,0.0009048907,0.00069837377,0.0007954945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016272448,0.0012947973,0.05159495,0.0021382682,0.00029845754,0.002858979,0.004595685,0.04399642,0.113287844,0.24415347,0.035648838,0.498505],"study_design_scores_gemma":[0.0003189708,0.0006720111,0.033099867,0.0004192896,0.0004319825,0.0033625963,0.0069119446,0.251192,0.03994977,0.6262045,0.037299424,0.0001376853],"about_ca_topic_score_codex":0.0024698772,"about_ca_topic_score_gemma":0.007012523,"teacher_disagreement_score":0.010325877,"about_ca_system_score_codex":0.00055148086,"about_ca_system_score_gemma":0.00056574435,"threshold_uncertainty_score":0.034543514},"labels":[],"label_agreement":null},{"id":"W2397663275","doi":"","title":"Signed edge majority total domination numbers in graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Domination analysis; Graph; Artificial intelligence; Computer science; Vertex (graph theory)","score_opus":0.01369794393443952,"score_gpt":0.27787346148019226,"score_spread":0.26417551754575275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397663275","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5040797,0.002000907,0.2915207,0.0033289474,0.00087135733,0.00013252882,0.001419918,0.0009163069,0.1957295],"genre_scores_gemma":[0.95240974,0.000595739,0.023946868,0.00033820476,0.00028694829,0.00010995735,0.00034146657,0.00009669107,0.021874404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910456,0.00025579,0.0000682006,0.00014744487,0.00028612197,0.00013781224],"domain_scores_gemma":[0.9957568,0.002249806,0.0004913953,0.00044458456,0.0006598874,0.0003974686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011389648,0.00037999553,0.0004098801,0.0016313826,0.0010497055,0.0027626085,0.00071895483,0.00064316066,0.007225659],"category_scores_gemma":[0.006909696,0.00021825248,0.0002939807,0.0013681308,0.0015923104,0.0042909007,0.0013391766,0.0010781618,0.000980643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014016732,0.000028156232,0.0009999454,0.00010914462,0.000018468354,0.000094183255,0.00020456969,0.0029813892,0.0031512743,0.9450448,0.0054647354,0.04176312],"study_design_scores_gemma":[0.000027745546,0.000038268336,0.0007451123,0.00003610755,0.000020836376,0.0002360347,0.0001340442,0.010532744,0.0025484662,0.9758874,0.009770676,0.000022478287],"about_ca_topic_score_codex":0.00030569787,"about_ca_topic_score_gemma":0.0006785389,"teacher_disagreement_score":0.007225659,"about_ca_system_score_codex":0.0007763995,"about_ca_system_score_gemma":0.00054123235,"threshold_uncertainty_score":0.024172246},"labels":[],"label_agreement":null},{"id":"W2397686790","doi":"","title":"A Note On Global Domination In Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011847620038992803,"score_gpt":0.30042552309750364,"score_spread":0.28857790305851083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397686790","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033053722,0.05555487,0.24964759,0.054337196,0.015757695,0.00008326628,0.0007994219,0.0006765729,0.5900896],"genre_scores_gemma":[0.6497006,0.06047486,0.10058049,0.024586087,0.02470061,0.00024247683,0.000877245,0.0010597784,0.1377779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914813,0.00023104549,0.000035915957,0.00019772002,0.00025192538,0.00013525743],"domain_scores_gemma":[0.994689,0.0039837235,0.00013776461,0.0005681585,0.0003512949,0.0002700582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013783606,0.00068696967,0.0009784983,0.0015807503,0.0020305212,0.0022773934,0.0015560455,0.0011614182,0.010245861],"category_scores_gemma":[0.005008036,0.00033374617,0.0010945658,0.0021177349,0.0044707693,0.0074508507,0.0034748325,0.005342004,0.001727731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003971122,0.000016374333,0.00055191934,0.0002396042,0.000036770823,0.0003503141,0.0003945733,0.0014095341,0.0009633872,0.9200439,0.04866846,0.027285492],"study_design_scores_gemma":[0.0000066206494,0.000013323475,0.0005012363,0.00005655766,0.000026352194,0.00026470944,0.00010705678,0.0011824497,0.00032188173,0.9300405,0.06746589,0.000013325191],"about_ca_topic_score_codex":0.0020018332,"about_ca_topic_score_gemma":0.0037251208,"teacher_disagreement_score":0.010245861,"about_ca_system_score_codex":0.0013378061,"about_ca_system_score_gemma":0.0006491981,"threshold_uncertainty_score":0.03427583},"labels":[],"label_agreement":null},{"id":"W2397759350","doi":"","title":"Max-min total restrained domination number.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011447784852974364,"score_gpt":0.2720094634121934,"score_spread":0.260561678559219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397759350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28329754,0.0036134387,0.34258175,0.005732064,0.0009186223,0.00038022693,0.017997833,0.005158021,0.3403205],"genre_scores_gemma":[0.8414642,0.0013483058,0.093160436,0.0010734382,0.00030737146,0.00029488222,0.0050561544,0.000736256,0.056559008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989016,0.00020545677,0.000054910586,0.0003169568,0.00030748706,0.00021358073],"domain_scores_gemma":[0.9954893,0.0022071742,0.00029627164,0.0010662733,0.00051860086,0.00042237312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012384127,0.00075116387,0.0008318433,0.0011787962,0.0012192345,0.0022455265,0.0024250294,0.0007322912,0.019420711],"category_scores_gemma":[0.006108721,0.00034556983,0.00059373165,0.0018541047,0.0012347742,0.0040561617,0.0015959031,0.0020119243,0.003130754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012676608,0.0002980741,0.0040590414,0.0012764243,0.00018521956,0.00027674215,0.0005254761,0.04272599,0.016047152,0.5607582,0.0993691,0.27321094],"study_design_scores_gemma":[0.00009263996,0.0001485737,0.0026847809,0.000121415535,0.00013092128,0.00085748127,0.00019688411,0.063072816,0.012646173,0.85933936,0.060649265,0.0000597445],"about_ca_topic_score_codex":0.00096806587,"about_ca_topic_score_gemma":0.002222508,"teacher_disagreement_score":0.019420711,"about_ca_system_score_codex":0.0017221385,"about_ca_system_score_gemma":0.0014663788,"threshold_uncertainty_score":0.064968765},"labels":[],"label_agreement":null},{"id":"W2397767158","doi":"","title":"The Properties of Transformation Digraphs D xyz .","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Pure mathematics; Biology; Genetics","score_opus":0.022753583724552415,"score_gpt":0.25966922473554327,"score_spread":0.23691564101099086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397767158","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3490574,0.00083909376,0.19964607,0.0023720772,0.00033578108,0.00022614033,0.0035914215,0.0010539821,0.4428781],"genre_scores_gemma":[0.927296,0.0006719798,0.02000778,0.00042555772,0.0000942231,0.00011928774,0.0025406864,0.00019726263,0.04864731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995875,0.00008378014,0.000031637886,0.00012366808,0.00008369533,0.000089696725],"domain_scores_gemma":[0.99847645,0.0007142351,0.00018855168,0.0002298635,0.00020963568,0.00018128913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034883048,0.00029741979,0.0002711647,0.0012500725,0.0014837902,0.0026690925,0.00044126995,0.0006847868,0.017323546],"category_scores_gemma":[0.0022217974,0.00040688828,0.0005235204,0.0010621131,0.001197603,0.0032012505,0.0010988886,0.0012460592,0.0026670317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007171974,0.00004672415,0.0009364551,0.00007358962,0.000014410833,0.00027215944,0.00040847514,0.0007728474,0.0026805976,0.9686282,0.0042529255,0.021841865],"study_design_scores_gemma":[0.00004299777,0.00003709041,0.002148694,0.000045134995,0.000034923185,0.0007620229,0.00048614506,0.004815167,0.0047448454,0.9446535,0.042203005,0.000026523552],"about_ca_topic_score_codex":0.0020863276,"about_ca_topic_score_gemma":0.0024122223,"teacher_disagreement_score":0.017323546,"about_ca_system_score_codex":0.00080926064,"about_ca_system_score_gemma":0.00052062765,"threshold_uncertainty_score":0.05795306},"labels":[],"label_agreement":null},{"id":"W2397779203","doi":"","title":"Minus Edge Domination in Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.013547289838376175,"score_gpt":0.279399525172693,"score_spread":0.26585223533431684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397779203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4239516,0.004154785,0.1500415,0.0041100103,0.0012080924,0.00008020434,0.0011981657,0.0008076008,0.41444802],"genre_scores_gemma":[0.9288236,0.0013732541,0.0150545845,0.0008115756,0.0004533271,0.00006995371,0.0006123036,0.00019856496,0.052602943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991258,0.00022009847,0.000048029447,0.00020110476,0.00022310232,0.00018195662],"domain_scores_gemma":[0.99740773,0.0012037745,0.00027382458,0.00036477248,0.00039287395,0.00035710057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008191457,0.00038678214,0.00054741406,0.001530117,0.0015513853,0.0025990622,0.0009633556,0.00073440385,0.010753449],"category_scores_gemma":[0.0042270934,0.0002798959,0.00041158652,0.001187553,0.0019608804,0.0044125486,0.0016934098,0.0013816686,0.0014571651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007962955,0.000024738052,0.0010208385,0.00011704216,0.000018639295,0.00017568818,0.00026101855,0.00083860557,0.0023167145,0.96414465,0.0055920715,0.025410336],"study_design_scores_gemma":[0.00001829248,0.00002219393,0.00093286217,0.000043123964,0.000026689722,0.00075396284,0.00016032936,0.0038853008,0.0019914017,0.9688867,0.023264088,0.000015065592],"about_ca_topic_score_codex":0.00091198744,"about_ca_topic_score_gemma":0.0013316307,"teacher_disagreement_score":0.010753449,"about_ca_system_score_codex":0.0008193846,"about_ca_system_score_gemma":0.0005083387,"threshold_uncertainty_score":0.035973907},"labels":[],"label_agreement":null},{"id":"W2397975603","doi":"","title":"Signed edge k-subdomination numbers in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.011479427207071836,"score_gpt":0.2620392272579767,"score_spread":0.25055980005090484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397975603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40189776,0.0026399142,0.32821092,0.0037600826,0.0028118375,0.00017124532,0.0013861114,0.0012202441,0.25790182],"genre_scores_gemma":[0.86062384,0.0013151703,0.092858896,0.0006747229,0.0005676786,0.00020152966,0.0006604228,0.00022807402,0.0428697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933857,0.00018797247,0.00007335719,0.00012876441,0.00017919806,0.00009213618],"domain_scores_gemma":[0.9977786,0.0008699114,0.00038238068,0.00027523492,0.00041267253,0.00028118212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007053236,0.0004545743,0.00039762305,0.0022050648,0.0011276202,0.0028242962,0.0007355322,0.0010146516,0.011238106],"category_scores_gemma":[0.004932658,0.00026439838,0.00034688352,0.0017654729,0.0019179874,0.004446583,0.0012077643,0.001541013,0.0026268624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009709257,0.000030338706,0.0005832405,0.000088675,0.000008182296,0.00011352917,0.000197711,0.001119927,0.0025777218,0.94872385,0.005411651,0.041048095],"study_design_scores_gemma":[0.000018234876,0.000039599458,0.000528734,0.000045529778,0.0000110202445,0.00029664097,0.00016219479,0.004503038,0.0017483159,0.9754934,0.017128278,0.000024971587],"about_ca_topic_score_codex":0.00026887606,"about_ca_topic_score_gemma":0.00061488175,"teacher_disagreement_score":0.011238106,"about_ca_system_score_codex":0.00064631726,"about_ca_system_score_gemma":0.0005149527,"threshold_uncertainty_score":0.037595212},"labels":[],"label_agreement":null},{"id":"W2397983808","doi":"10.1007/s11083-016-9394-z","title":"Rigid Binary Relations on a 4-Element Domain","year":2016,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Binary relation; Conjecture; Combinatorics; Element (criminal law); Pairwise comparison; Domain (mathematical analysis); Maximal element; Binary number; Projective test; Unary operation; Binary operation; Discrete mathematics; Set (abstract data type); Pure mathematics; Mathematical analysis","score_opus":0.017578876914792006,"score_gpt":0.2982002506832728,"score_spread":0.28062137376848084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397983808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3738153,0.0006077277,0.470925,0.0019364393,0.0003340734,0.00017645425,0.0015819807,0.0009925184,0.14963047],"genre_scores_gemma":[0.7377655,0.0005632358,0.16847806,0.0006151725,0.00027300796,0.00025095875,0.002415874,0.00065876194,0.088979445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988335,0.00021050773,0.00010189989,0.0003111275,0.0003152068,0.00022781205],"domain_scores_gemma":[0.99793774,0.00086481415,0.00022414571,0.00043578143,0.0002972596,0.00024022545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007523205,0.0007707073,0.001016598,0.00247741,0.0021848942,0.0029644435,0.001670721,0.0012242502,0.01657722],"category_scores_gemma":[0.0018800909,0.00078322005,0.00091125304,0.002728999,0.0028028414,0.0069292015,0.0030339977,0.0028266325,0.0033445167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087344466,0.000069808906,0.00019283369,0.000052710708,0.000009919078,0.000116967574,0.0004262377,0.0014501059,0.0028593368,0.98165846,0.0015132795,0.011562841],"study_design_scores_gemma":[0.00002192539,0.000021409403,0.00022515732,0.000015476511,0.000012483564,0.00010990551,0.00018828842,0.0034892827,0.002805025,0.9806789,0.012415577,0.000016514237],"about_ca_topic_score_codex":0.0013376577,"about_ca_topic_score_gemma":0.0014774413,"teacher_disagreement_score":0.01657722,"about_ca_system_score_codex":0.0010664851,"about_ca_system_score_gemma":0.00061642606,"threshold_uncertainty_score":0.05545628},"labels":[],"label_agreement":null},{"id":"W2398039696","doi":"","title":"Nim On The Complete Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.0595456025904787,"score_gpt":0.29611495193245335,"score_spread":0.23656934934197466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398039696","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14489487,0.0024788305,0.13706574,0.006297942,0.0011123881,0.00015286924,0.0025802122,0.0006546896,0.7047625],"genre_scores_gemma":[0.6522031,0.00318978,0.057705205,0.002330679,0.0012904208,0.00031926116,0.0035370395,0.0007530088,0.27867162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994436,0.00014481503,0.000015572514,0.00013891031,0.00014729712,0.000109769055],"domain_scores_gemma":[0.9989323,0.0003740794,0.000120767094,0.00019635138,0.00017049137,0.00020595903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039770643,0.0006128019,0.0007637252,0.0016296229,0.002105003,0.001883687,0.0011320582,0.0010698604,0.029573714],"category_scores_gemma":[0.002089002,0.00032004493,0.0007618379,0.0011889039,0.0013866216,0.004525232,0.0023963535,0.0018733026,0.0047289664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038797974,0.000025548377,0.00016617552,0.00009727363,0.000012807863,0.00009391757,0.00013083246,0.00093386206,0.00062610186,0.9675231,0.016534742,0.013816824],"study_design_scores_gemma":[0.000012316808,0.000009089305,0.00030702763,0.0000304558,0.000010554573,0.00011976443,0.000086517655,0.0031450186,0.00038820592,0.97430235,0.021581959,0.000006797882],"about_ca_topic_score_codex":0.0016250839,"about_ca_topic_score_gemma":0.0035771145,"teacher_disagreement_score":0.029573714,"about_ca_system_score_codex":0.0011510059,"about_ca_system_score_gemma":0.00062673335,"threshold_uncertainty_score":0.098933935},"labels":[],"label_agreement":null},{"id":"W2398165600","doi":"","title":"The Properties of Middle Digraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.054802689121501914,"score_gpt":0.24679471781752144,"score_spread":0.19199202869601953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398165600","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20581134,0.00302742,0.3448037,0.00449942,0.00073703245,0.00019084952,0.0030656138,0.0011008501,0.43676376],"genre_scores_gemma":[0.89621246,0.0018305489,0.048934635,0.0012059849,0.0005033481,0.00017915948,0.002098983,0.000376956,0.048657984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915135,0.0001873721,0.000073368974,0.00026885854,0.0001555102,0.0001634365],"domain_scores_gemma":[0.99495935,0.0024402868,0.00047937824,0.0008287761,0.0005817013,0.0007104508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010718722,0.0004819163,0.0005384355,0.0027049903,0.0032991185,0.005062157,0.001006496,0.001118427,0.018122645],"category_scores_gemma":[0.0060598045,0.00064146164,0.00090041023,0.0020165683,0.002277764,0.01052,0.0024927515,0.0020891489,0.0033846581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003873616,0.000024219653,0.00048986694,0.0000526737,0.0000117663685,0.00013339332,0.00031891183,0.0002509109,0.00077354576,0.9842002,0.0030768353,0.010628924],"study_design_scores_gemma":[0.000015655602,0.000015200147,0.000445092,0.000044095133,0.000024743505,0.00029538717,0.00023739101,0.0015025767,0.0010183274,0.9743197,0.022067904,0.000013883462],"about_ca_topic_score_codex":0.0019660064,"about_ca_topic_score_gemma":0.0024593007,"teacher_disagreement_score":0.018122645,"about_ca_system_score_codex":0.0014475646,"about_ca_system_score_gemma":0.0008393907,"threshold_uncertainty_score":0.06062627},"labels":[],"label_agreement":null},{"id":"W2398212301","doi":"","title":"Upper minus total domination of a 5-regular graph.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Domination analysis; Vertex (graph theory)","score_opus":0.00903967679747183,"score_gpt":0.2609612980069916,"score_spread":0.2519216212095198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398212301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70564663,0.00053660234,0.03982624,0.0012979723,0.00012934774,0.000050283707,0.0013475426,0.00046284022,0.2507025],"genre_scores_gemma":[0.94099855,0.00029828958,0.0129432455,0.00026719054,0.000054987282,0.000050758503,0.00094551104,0.00015401532,0.04428756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945515,0.000090268695,0.000023076267,0.00011154023,0.00014073674,0.00017920634],"domain_scores_gemma":[0.9984666,0.00071612897,0.00016788131,0.00018249692,0.00019802545,0.000268846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040011777,0.00037170955,0.00045089607,0.0010618409,0.0014949598,0.0018883881,0.0008276398,0.0004943777,0.0145727005],"category_scores_gemma":[0.0015670947,0.00028159664,0.00045637507,0.00076003803,0.0010264516,0.0015932968,0.0011291471,0.00082991534,0.0015940139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005030356,0.000112798036,0.0033347812,0.00026669918,0.00007418855,0.0012409982,0.00086756056,0.0070972145,0.030856287,0.89957744,0.013112229,0.0429568],"study_design_scores_gemma":[0.00007749155,0.00010013072,0.006319555,0.0001291455,0.00014139438,0.002357014,0.00068907335,0.032896228,0.021482859,0.8946196,0.041137673,0.00004989627],"about_ca_topic_score_codex":0.002355177,"about_ca_topic_score_gemma":0.0044793836,"teacher_disagreement_score":0.0145727005,"about_ca_system_score_codex":0.00093410065,"about_ca_system_score_gemma":0.00043863914,"threshold_uncertainty_score":0.04875058},"labels":[],"label_agreement":null},{"id":"W2398218064","doi":"","title":"Degree Conditions for Graphs to Be Fractional k-Covered Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Discrete mathematics; Physics","score_opus":0.07189282429858324,"score_gpt":0.3360628955225094,"score_spread":0.26417007122392616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398218064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7513747,0.0009433426,0.06627739,0.0044850027,0.0006778765,0.00016607612,0.00352047,0.0007496264,0.17180559],"genre_scores_gemma":[0.9810901,0.00044159216,0.0084901005,0.0005663689,0.0003131659,0.000094311814,0.0019879618,0.00011236372,0.0069041434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922836,0.0001422479,0.000055806584,0.00016461169,0.00015024444,0.00025868666],"domain_scores_gemma":[0.9949982,0.0028242914,0.00040885044,0.0003503729,0.00057109987,0.0008471282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007494232,0.0004243422,0.0005685981,0.0018534985,0.0017320093,0.0024376567,0.0007445006,0.0017320573,0.012773491],"category_scores_gemma":[0.008464808,0.0004720337,0.00075504935,0.0009240874,0.0016986867,0.0039783246,0.0020388328,0.0017780766,0.0018057035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047813714,0.00009469143,0.0034438877,0.00020050477,0.00003030702,0.0005822492,0.000732113,0.004659295,0.008606887,0.9587555,0.011577354,0.010839123],"study_design_scores_gemma":[0.00014843504,0.0000924702,0.0044568283,0.00011039532,0.000047294874,0.0010589267,0.0011615641,0.020829732,0.0064390968,0.95089257,0.014694768,0.000067838715],"about_ca_topic_score_codex":0.0014775954,"about_ca_topic_score_gemma":0.0017616416,"teacher_disagreement_score":0.012773491,"about_ca_system_score_codex":0.0010153136,"about_ca_system_score_gemma":0.000683476,"threshold_uncertainty_score":0.042731583},"labels":[],"label_agreement":null},{"id":"W2398413913","doi":"","title":"Graphs with unique minimum paired-dominating set.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; Graph; Vertex (graph theory)","score_opus":0.03007709096057041,"score_gpt":0.28281345778187844,"score_spread":0.252736366821308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398413913","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3805305,0.0032734382,0.3773108,0.005011198,0.0012620752,0.00046521475,0.012403574,0.0018334922,0.21790965],"genre_scores_gemma":[0.803466,0.0013588389,0.16172528,0.00093805365,0.00030222192,0.00027086915,0.005387485,0.0003409442,0.02621038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989569,0.00026156436,0.00005730347,0.0003535882,0.00019977943,0.00017081751],"domain_scores_gemma":[0.99724376,0.0010944558,0.00038018834,0.00044423665,0.00038678694,0.00045055704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006552075,0.0009819822,0.0014636152,0.0014164074,0.0020855663,0.0029609038,0.0017805396,0.0015596627,0.012127137],"category_scores_gemma":[0.004519848,0.0007618803,0.0009218064,0.0014865014,0.0010533093,0.004005896,0.0026422648,0.0018144015,0.002521387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000910844,0.00033466608,0.00308538,0.002051913,0.00035687044,0.0015413046,0.00068094424,0.017507473,0.019738372,0.79139775,0.054867204,0.10752732],"study_design_scores_gemma":[0.00013895564,0.00018804391,0.0020470242,0.00023096973,0.00024549934,0.0035246552,0.0005699523,0.029810525,0.013024255,0.91319096,0.03696502,0.00006405704],"about_ca_topic_score_codex":0.0003781242,"about_ca_topic_score_gemma":0.0007980258,"teacher_disagreement_score":0.012127137,"about_ca_system_score_codex":0.0008982136,"about_ca_system_score_gemma":0.00089697645,"threshold_uncertainty_score":0.040569305},"labels":[],"label_agreement":null},{"id":"W2398470855","doi":"","title":"An algorithm for hamiltonian cycles under implicit degree conditions.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Algorithm; Hamiltonian (control theory); Applied mathematics; Mathematical optimization; Physics; Acoustics","score_opus":0.052558205751225356,"score_gpt":0.3425944378369629,"score_spread":0.2900362320857376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398470855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044074662,0.00066176493,0.8968294,0.0011673813,0.00037250752,0.0009739367,0.0018016768,0.008382883,0.045735806],"genre_scores_gemma":[0.24484877,0.00043185582,0.72610986,0.00040201974,0.0001475835,0.000705499,0.0043842145,0.0014468682,0.021523342],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991159,0.00015417217,0.00008299232,0.00019660297,0.00027787322,0.00017248953],"domain_scores_gemma":[0.9975931,0.0010087598,0.000107361295,0.00073041196,0.0004226639,0.00013763277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007615453,0.0010436693,0.0010023157,0.0013523,0.001286298,0.0020051454,0.0024714025,0.0016203884,0.024209091],"category_scores_gemma":[0.005591844,0.0007363489,0.0010273008,0.001786546,0.0008587644,0.004210139,0.004704526,0.002063365,0.0062408717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000790848,0.00061523705,0.0012229995,0.00088907505,0.00013291236,0.0003866921,0.0006544809,0.02024395,0.014946284,0.22234464,0.06140619,0.6763666],"study_design_scores_gemma":[0.00063414924,0.00026213497,0.0008478655,0.00020267758,0.00017609,0.00072831876,0.0005046331,0.18740247,0.016779395,0.7344586,0.05790668,0.000097108416],"about_ca_topic_score_codex":0.0024902106,"about_ca_topic_score_gemma":0.0047378778,"teacher_disagreement_score":0.024209091,"about_ca_system_score_codex":0.0011806733,"about_ca_system_score_gemma":0.002163706,"threshold_uncertainty_score":0.08098745},"labels":[],"label_agreement":null},{"id":"W2398472485","doi":"","title":"An improved Fan-Type degree condition for k-linked graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Type (biology); Combinatorics; Discrete mathematics; Physics; Geology; Acoustics","score_opus":0.05574007086007631,"score_gpt":0.3344517595222207,"score_spread":0.2787116886621444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398472485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22268175,0.0012296371,0.5056545,0.0069027157,0.0030174763,0.0006008166,0.00561243,0.0036199288,0.25068069],"genre_scores_gemma":[0.84647167,0.00091717567,0.11733108,0.0022492087,0.0013480049,0.0003417252,0.0034686057,0.0009539885,0.026918527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759763,0.0005215236,0.00015178605,0.00061074767,0.0006546358,0.00046364922],"domain_scores_gemma":[0.985546,0.0082761515,0.00065929646,0.0019851686,0.002214078,0.0013192745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027545425,0.0008250968,0.0012713034,0.002248304,0.002238048,0.0028545044,0.002893301,0.0024767052,0.023219945],"category_scores_gemma":[0.022850914,0.00073485886,0.0012331923,0.0022670482,0.0021191724,0.009059903,0.0031622958,0.004425333,0.004310894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093317515,0.0003695377,0.0032731579,0.00060961454,0.000051057785,0.0008606862,0.0005270645,0.012869622,0.016167924,0.8642968,0.041660413,0.05838091],"study_design_scores_gemma":[0.00018732857,0.00020445567,0.0016894288,0.00020147584,0.00009007231,0.0012319536,0.000415494,0.07722593,0.011728346,0.87417656,0.032704372,0.00014451268],"about_ca_topic_score_codex":0.0015272204,"about_ca_topic_score_gemma":0.0028477693,"teacher_disagreement_score":0.023219945,"about_ca_system_score_codex":0.0015949833,"about_ca_system_score_gemma":0.0017153487,"threshold_uncertainty_score":0.07767844},"labels":[],"label_agreement":null},{"id":"W2398555939","doi":"","title":"Extreme Cliques in Interval Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Interval (graph theory); Combinatorics","score_opus":0.024925440149273496,"score_gpt":0.2970897280047989,"score_spread":0.2721642878555254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398555939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39073545,0.002101656,0.44889286,0.0026138986,0.00033543093,0.00014796837,0.0014111722,0.00058830617,0.15317327],"genre_scores_gemma":[0.9295297,0.0008096795,0.05420329,0.0003113779,0.0003125182,0.00011529062,0.00096452783,0.00010820289,0.013645367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989858,0.0003617305,0.00003977254,0.00022360186,0.00023676688,0.00015232217],"domain_scores_gemma":[0.9944839,0.0035750885,0.0006182798,0.000443929,0.00035164694,0.0005271846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085403793,0.0003061768,0.0005538941,0.001573596,0.001462108,0.0022373537,0.0010096538,0.0010085121,0.010005968],"category_scores_gemma":[0.006928542,0.0004881793,0.00063300837,0.00164681,0.0015103143,0.00323238,0.0017114646,0.0021510813,0.0010878387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011911463,0.00005404971,0.0012465186,0.000111475616,0.000036653288,0.00030363194,0.00038381648,0.0049070613,0.0021429595,0.96482044,0.0056319567,0.020242296],"study_design_scores_gemma":[0.000024857283,0.000019516458,0.0008468024,0.000031170883,0.00002075991,0.000415696,0.00017939384,0.01775747,0.00067092496,0.974128,0.0058930973,0.000012331363],"about_ca_topic_score_codex":0.0006033286,"about_ca_topic_score_gemma":0.00086604827,"teacher_disagreement_score":0.010005968,"about_ca_system_score_codex":0.00058255007,"about_ca_system_score_gemma":0.0002532597,"threshold_uncertainty_score":0.033473313},"labels":[],"label_agreement":null},{"id":"W2398634893","doi":"","title":"On the construction of radially Moore digraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011137843190235235,"score_gpt":0.24002664486784128,"score_spread":0.22888880167760606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398634893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064065926,0.0016263356,0.6359558,0.002036757,0.00046104955,0.00017181254,0.0008923771,0.0013776178,0.29341236],"genre_scores_gemma":[0.5664299,0.0021360952,0.34031022,0.0013144597,0.00027200003,0.0002629456,0.0013974123,0.00068390643,0.087193176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994531,0.00019138551,0.000031778043,0.000107594,0.0001318116,0.00008424958],"domain_scores_gemma":[0.99895763,0.00046431497,0.00006995989,0.00020663397,0.00015323066,0.00014826718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005348695,0.0005284711,0.00047406805,0.0013397391,0.0017248647,0.0019941004,0.0012058446,0.0008635079,0.014783338],"category_scores_gemma":[0.0024648893,0.0006058545,0.0006325922,0.0012008768,0.0019457029,0.0040254635,0.003406719,0.0022598065,0.003915701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015700121,0.000019036068,0.00010225832,0.000046130397,0.000004846488,0.00006145346,0.00013391611,0.0007363217,0.00067822944,0.9803048,0.0034768044,0.014420529],"study_design_scores_gemma":[0.000010514563,0.000014750592,0.00013328636,0.000030271067,0.000007301195,0.00013885016,0.00008020374,0.0035920609,0.000803014,0.97713155,0.018045226,0.00001283097],"about_ca_topic_score_codex":0.0011954381,"about_ca_topic_score_gemma":0.0030721873,"teacher_disagreement_score":0.014783338,"about_ca_system_score_codex":0.0009841449,"about_ca_system_score_gemma":0.0005814792,"threshold_uncertainty_score":0.049455225},"labels":[],"label_agreement":null},{"id":"W2398635090","doi":"","title":"Orientable Embedding Distributions by Genus of Crossing-Digraph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Genus; Embedding; Combinatorics; Zoology; Biology; Computer science; Artificial intelligence","score_opus":0.015236024370001728,"score_gpt":0.3022408367006681,"score_spread":0.2870048123306664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398635090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7618691,0.0012594075,0.114815794,0.0011423855,0.00027815925,0.000057357596,0.00046344756,0.00069800636,0.11941642],"genre_scores_gemma":[0.9795288,0.0008551047,0.0069972486,0.00019629106,0.0001467968,0.000038228736,0.00022686798,0.00021093267,0.011799713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963117,0.00006452743,0.000014310375,0.000097162556,0.00010292325,0.00008981313],"domain_scores_gemma":[0.9983546,0.00057704415,0.00031084783,0.00017861287,0.00017276655,0.0004060179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035537902,0.00054621947,0.00044258664,0.0023293279,0.0009793638,0.0023203958,0.0009624326,0.0007990367,0.00886062],"category_scores_gemma":[0.002734426,0.000445173,0.00041034518,0.001073311,0.0017622933,0.0037069006,0.0019871688,0.001578132,0.0010294876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050995317,0.00004530728,0.0013388804,0.000041362575,0.000009118453,0.00021056112,0.00029967242,0.0019466655,0.0034980348,0.9774025,0.0025076969,0.012649214],"study_design_scores_gemma":[0.000030396926,0.000045503173,0.0025862758,0.000051225237,0.00003218373,0.00080146943,0.00041550392,0.018504763,0.0022753922,0.9655042,0.009723503,0.00002963143],"about_ca_topic_score_codex":0.0007936312,"about_ca_topic_score_gemma":0.0009748747,"teacher_disagreement_score":0.00886062,"about_ca_system_score_codex":0.001060061,"about_ca_system_score_gemma":0.00026409226,"threshold_uncertainty_score":0.029641747},"labels":[],"label_agreement":null},{"id":"W2398885845","doi":"","title":"A note on weakly connected domination number in graphs","year":2010,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph","score_opus":0.00833730587728895,"score_gpt":0.2361856281062793,"score_spread":0.22784832222899035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398885845","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19849321,0.025025025,0.35502514,0.03623576,0.009034899,0.00040367182,0.004984163,0.001412645,0.36938542],"genre_scores_gemma":[0.8222167,0.014549474,0.08975007,0.0045271753,0.011344153,0.0007605409,0.002564582,0.00064991496,0.053637378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797803,0.00061842555,0.00015576133,0.0004884075,0.0005960514,0.00016343975],"domain_scores_gemma":[0.977979,0.01805071,0.0004466314,0.0011846987,0.0014826469,0.0008563081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026998215,0.0010605075,0.0024572369,0.0059453007,0.0031433932,0.003925099,0.0025036905,0.0017894522,0.0114554465],"category_scores_gemma":[0.019315112,0.0008194373,0.0014731368,0.008522848,0.004461667,0.010732914,0.004111151,0.007025906,0.0014453736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000341414,0.000071184586,0.0026395265,0.0006402221,0.00005382552,0.00025632745,0.00069315155,0.004600019,0.0020801302,0.9126556,0.030188734,0.045779888],"study_design_scores_gemma":[0.000019829977,0.000037615475,0.0011133507,0.00006304701,0.000043842563,0.00014262887,0.000097909186,0.007140968,0.0005912657,0.97801334,0.012710288,0.00002602498],"about_ca_topic_score_codex":0.001918337,"about_ca_topic_score_gemma":0.0017777443,"teacher_disagreement_score":0.0114554465,"about_ca_system_score_codex":0.0025653983,"about_ca_system_score_gemma":0.001217473,"threshold_uncertainty_score":0.03832227},"labels":[],"label_agreement":null},{"id":"W2398932532","doi":"","title":"On kernels by monochromatic paths in D-join.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Monochromatic color; Mathematics; Combinatorics; Arithmetic; Optics; Physics","score_opus":0.023140048582915178,"score_gpt":0.2664887954333755,"score_spread":0.24334874685046032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398932532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22716844,0.0016350419,0.65527606,0.001519116,0.00044850845,0.00017479042,0.0011178359,0.002105844,0.11055439],"genre_scores_gemma":[0.7843744,0.0010233526,0.16144814,0.0007837663,0.00031599554,0.00018180671,0.0014338086,0.0011434754,0.049295355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988959,0.00020714344,0.00006872214,0.00030809673,0.00027295048,0.00024720948],"domain_scores_gemma":[0.99756,0.00095336133,0.00026602254,0.00060337444,0.00027524182,0.00034186913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008974971,0.00049049885,0.00081796903,0.0015654743,0.0018205106,0.0027547076,0.0013866845,0.0010949981,0.013809852],"category_scores_gemma":[0.003584219,0.00048291,0.00087338686,0.001977056,0.0018932483,0.007642694,0.0046422407,0.0024571351,0.003266207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015018102,0.00007735775,0.00045876703,0.00011355984,0.000018034058,0.00018902263,0.0005095326,0.0019015556,0.0025272141,0.96132374,0.0056028794,0.02712822],"study_design_scores_gemma":[0.000023104527,0.00003302017,0.0003135455,0.000028844683,0.000022249558,0.0002320333,0.00019674652,0.008512015,0.0017728418,0.9757381,0.013109169,0.000018198847],"about_ca_topic_score_codex":0.0018368862,"about_ca_topic_score_gemma":0.0025607003,"teacher_disagreement_score":0.013809852,"about_ca_system_score_codex":0.0012531602,"about_ca_system_score_gemma":0.0005408688,"threshold_uncertainty_score":0.046198606},"labels":[],"label_agreement":null},{"id":"W2399012647","doi":"","title":"Hyperbolicity and parameters of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.032532937333796266,"score_gpt":0.2614451418722669,"score_spread":0.22891220453847066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399012647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46242073,0.01326336,0.14781128,0.008230912,0.0010245371,0.00009408341,0.0014554515,0.0004812054,0.36521843],"genre_scores_gemma":[0.9624325,0.0024179367,0.006856107,0.00038433168,0.000403372,0.000053091186,0.00036887574,0.00016029092,0.026923396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992162,0.00024260776,0.00004746052,0.00021502817,0.00016485775,0.00011391463],"domain_scores_gemma":[0.99640095,0.0015736615,0.00066046603,0.0006696326,0.00030856827,0.00038674223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070121477,0.00059160485,0.00053267385,0.0020785627,0.0011136874,0.0037512095,0.0011294247,0.0012647014,0.012831623],"category_scores_gemma":[0.008060741,0.00058647856,0.00039516413,0.0016755004,0.004295244,0.009216356,0.0027007035,0.0029012135,0.0022224954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027377082,0.000008679216,0.0007085959,0.000037018162,0.000008354507,0.00003659806,0.0002826287,0.0009894603,0.0004576985,0.9895265,0.0017787021,0.00613829],"study_design_scores_gemma":[0.000008243617,0.0000057786706,0.0003565725,0.000017406875,0.000005400983,0.00008104114,0.00015913973,0.0012355372,0.00027386908,0.99225545,0.005592556,0.000009056528],"about_ca_topic_score_codex":0.0010751667,"about_ca_topic_score_gemma":0.0010539406,"teacher_disagreement_score":0.012831623,"about_ca_system_score_codex":0.0014741633,"about_ca_system_score_gemma":0.00038479103,"threshold_uncertainty_score":0.042926073},"labels":[],"label_agreement":null},{"id":"W2399041719","doi":"","title":"Dominating cycles in graphs with high connectivity.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010654861714400502,"score_gpt":0.2649386056327673,"score_spread":0.2542837439183668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399041719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7024543,0.0070991754,0.20228769,0.004608477,0.0004143379,0.00017313864,0.0013114457,0.0005965618,0.08105481],"genre_scores_gemma":[0.9624734,0.0018290268,0.024139863,0.00038431468,0.0002389115,0.00009515912,0.00063522445,0.00008081605,0.010123215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993888,0.00020683359,0.000027006983,0.00014074834,0.0001298212,0.0001066911],"domain_scores_gemma":[0.9942151,0.0038494735,0.00052629533,0.000358287,0.00050203485,0.0005487448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005279485,0.0004105052,0.000498462,0.0020649384,0.0013258455,0.0023306566,0.00080855074,0.0011162806,0.005704079],"category_scores_gemma":[0.0064862776,0.00050228066,0.00037152867,0.0017997426,0.0014781731,0.003021491,0.0015367959,0.0009999012,0.0007621907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025711863,0.0000748031,0.0053701885,0.00060218124,0.00007687716,0.0010234796,0.00095320534,0.018468153,0.007692814,0.8930828,0.016234003,0.056164414],"study_design_scores_gemma":[0.000055133096,0.000066520144,0.0021772045,0.00009766057,0.000064729145,0.0012959059,0.00056074606,0.031349413,0.0033013565,0.94406354,0.01693985,0.000027856522],"about_ca_topic_score_codex":0.0009897796,"about_ca_topic_score_gemma":0.0017111811,"teacher_disagreement_score":0.005704079,"about_ca_system_score_codex":0.00083249545,"about_ca_system_score_gemma":0.0004182302,"threshold_uncertainty_score":0.01908201},"labels":[],"label_agreement":null},{"id":"W2399055054","doi":"","title":"An upper bound on the restrained domination number of graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Upper and lower bounds; Graph; Mathematical analysis","score_opus":0.015612913422797987,"score_gpt":0.30682830933692234,"score_spread":0.2912153959141244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399055054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3402816,0.008746412,0.34117147,0.006060714,0.0011540694,0.00030321893,0.004978662,0.003266642,0.29403725],"genre_scores_gemma":[0.9027503,0.0027905342,0.06620387,0.0010987914,0.00061258115,0.00032599314,0.002034046,0.0005331674,0.023650663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975963,0.00040775485,0.000106361804,0.000579637,0.0007746828,0.0005352925],"domain_scores_gemma":[0.9805766,0.01267611,0.00083600753,0.0038072146,0.0009883157,0.0011157999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016933221,0.0010896896,0.0013606742,0.002417067,0.001981884,0.0027736789,0.0040869033,0.0016166723,0.014550709],"category_scores_gemma":[0.01704531,0.0007110701,0.0010472334,0.0025502392,0.002426113,0.0062225955,0.0028267791,0.0038664402,0.0026900365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011704386,0.00044324077,0.005537438,0.0012479577,0.00023744989,0.0007552229,0.00093663885,0.07472691,0.031723034,0.6882745,0.04575727,0.14918981],"study_design_scores_gemma":[0.00007338489,0.00014402276,0.0039497335,0.00018715269,0.000170953,0.0012220286,0.00016086925,0.11786568,0.012610696,0.8306389,0.032884818,0.00009182021],"about_ca_topic_score_codex":0.0010632869,"about_ca_topic_score_gemma":0.0021927592,"teacher_disagreement_score":0.014550709,"about_ca_system_score_codex":0.0018844545,"about_ca_system_score_gemma":0.0009042378,"threshold_uncertainty_score":0.048676968},"labels":[],"label_agreement":null},{"id":"W2399115616","doi":"","title":"On perfect matchings of complements of line graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Strong perfect graph theorem; Combinatorics; Line (geometry); Line graph; Graph; Pathwidth; Geometry","score_opus":0.01831039347412789,"score_gpt":0.30327599173074093,"score_spread":0.28496559825661305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399115616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50682503,0.0026643104,0.22480623,0.0025474955,0.0007151901,0.00024215726,0.0018262166,0.0008243415,0.25954908],"genre_scores_gemma":[0.9215063,0.0015511921,0.03995878,0.0006416884,0.00041761,0.00014567772,0.001714831,0.0002848999,0.033778958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985598,0.00046264607,0.00007681762,0.0002923228,0.000296954,0.00031146582],"domain_scores_gemma":[0.99547136,0.002553649,0.00075387623,0.00035993027,0.00040513536,0.00045608645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092399766,0.00066634436,0.0010391823,0.0029172238,0.0029139817,0.0038336925,0.0012758906,0.0018484761,0.016483406],"category_scores_gemma":[0.007819328,0.00084836653,0.00106984,0.0027222938,0.0028093301,0.008460551,0.0030039903,0.0018867782,0.0020540133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009424171,0.00004108447,0.0006709693,0.00009586173,0.000022211103,0.00022056221,0.00031101084,0.001778341,0.00075015036,0.9803945,0.004557744,0.01106328],"study_design_scores_gemma":[0.000023135688,0.00002549838,0.0005017631,0.00006969662,0.000029865743,0.0003545808,0.0003200317,0.008158407,0.0008191452,0.98021704,0.009462267,0.00001867048],"about_ca_topic_score_codex":0.0024097646,"about_ca_topic_score_gemma":0.0030096422,"teacher_disagreement_score":0.016483406,"about_ca_system_score_codex":0.0016265189,"about_ca_system_score_gemma":0.0007817474,"threshold_uncertainty_score":0.055142462},"labels":[],"label_agreement":null},{"id":"W2399124203","doi":"","title":"Chromatic Equivalence Classes of Certain Generalized Polygon Trees, II.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Polygon (computer graphics); Equivalence (formal languages); Combinatorics; Discrete mathematics; Computer science","score_opus":0.024112489386356562,"score_gpt":0.2922007125848054,"score_spread":0.2680882231984488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399124203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77330226,0.0003604876,0.030188262,0.0009805581,0.00010290032,0.000073783725,0.00065939594,0.00022848402,0.194104],"genre_scores_gemma":[0.9796814,0.00030529802,0.0053524137,0.00010538819,0.000068606256,0.000036608013,0.0006930331,0.000073010226,0.013684341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996687,0.000041587107,0.000010801383,0.00008016063,0.00009387551,0.000104753766],"domain_scores_gemma":[0.9994324,0.00021869488,0.00009232805,0.00007675082,0.00007612959,0.0001036272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021414242,0.0002540566,0.00033480037,0.0013234736,0.0014791271,0.002594743,0.000788332,0.000645921,0.0142282555],"category_scores_gemma":[0.0012005423,0.00027576115,0.000436874,0.0011259549,0.0014734062,0.0021032149,0.0009275087,0.0016803417,0.00068021525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010031353,0.000048010075,0.001499832,0.00005288194,0.000010663407,0.00019570791,0.00052773545,0.0018244714,0.003408662,0.97324365,0.0035129192,0.0155750895],"study_design_scores_gemma":[0.00005866423,0.000051717656,0.008725977,0.00005534722,0.000050315746,0.00059069245,0.00091054244,0.018468866,0.0045231734,0.9411883,0.025350936,0.000025415264],"about_ca_topic_score_codex":0.0031931703,"about_ca_topic_score_gemma":0.003453993,"teacher_disagreement_score":0.0142282555,"about_ca_system_score_codex":0.0017711534,"about_ca_system_score_gemma":0.00036141358,"threshold_uncertainty_score":0.047598243},"labels":[],"label_agreement":null},{"id":"W2399164534","doi":"","title":"A note on the minus edge domination number in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.014579100765571505,"score_gpt":0.2773220108462605,"score_spread":0.262742910080689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399164534","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056383595,0.043651134,0.24953917,0.04365995,0.048819434,0.00009675724,0.001497541,0.0016059583,0.5547465],"genre_scores_gemma":[0.7139313,0.023859775,0.1376362,0.014092056,0.026866904,0.00024093661,0.0009216669,0.0013943112,0.081056915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842644,0.00045513254,0.000116597905,0.00037018268,0.000496691,0.00013495314],"domain_scores_gemma":[0.9902682,0.0068444153,0.00038080252,0.0011371505,0.00092020154,0.00044932237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021769984,0.0010038773,0.0012193426,0.0028186268,0.0018144983,0.0031246378,0.0026251539,0.001715324,0.011005104],"category_scores_gemma":[0.013788205,0.00042430783,0.0008427724,0.0028166226,0.0046479283,0.00864211,0.0024795,0.005600192,0.0023359947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012251627,0.000030236935,0.0005223573,0.00029143336,0.00002753509,0.00019158672,0.0001178542,0.0013683281,0.0017678604,0.91953534,0.037425,0.038599994],"study_design_scores_gemma":[0.000011223836,0.00003167781,0.0004288659,0.0000692237,0.000025550338,0.00036072222,0.00004237686,0.002509998,0.00079929497,0.951591,0.04409922,0.00003085747],"about_ca_topic_score_codex":0.0008550146,"about_ca_topic_score_gemma":0.0011045771,"teacher_disagreement_score":0.011005104,"about_ca_system_score_codex":0.0013308725,"about_ca_system_score_gemma":0.0006844603,"threshold_uncertainty_score":0.036815763},"labels":[],"label_agreement":null},{"id":"W2399194235","doi":"","title":"On the Graceful Conjecture of Permutation Graphs of Paths.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Permutation (music); Combinatorics; Permutation graph; Discrete mathematics; Graph","score_opus":0.012217092392140286,"score_gpt":0.2677866521883211,"score_spread":0.2555695597961808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399194235","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33369097,0.0053787325,0.15145493,0.035679787,0.0026339544,0.00014351249,0.0017863545,0.0018247663,0.46740693],"genre_scores_gemma":[0.9390926,0.0027339444,0.013419966,0.0036861205,0.002113102,0.000105491396,0.0012626967,0.0004925177,0.037093576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825424,0.00043308866,0.000076109776,0.00042199882,0.00042200406,0.0003925094],"domain_scores_gemma":[0.98844916,0.0067412667,0.00095383625,0.002421063,0.00057937397,0.0008552702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022592377,0.0010837303,0.0013740406,0.001657351,0.004454637,0.005128887,0.0020591961,0.003310048,0.019990107],"category_scores_gemma":[0.0152269695,0.000902986,0.0017230641,0.002266341,0.008640954,0.015280805,0.004707427,0.005189176,0.0031727236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010106613,0.00003245884,0.00052500743,0.000070317335,0.000013147416,0.000118016724,0.00033372187,0.0020392775,0.00026852146,0.9809887,0.008765221,0.0067444737],"study_design_scores_gemma":[0.00001072128,0.0000067065184,0.00012409293,0.000012720317,0.0000067522506,0.000043882144,0.000051442563,0.0012281598,0.00010652044,0.99582905,0.0025736976,0.000006250567],"about_ca_topic_score_codex":0.0038798999,"about_ca_topic_score_gemma":0.0034498856,"teacher_disagreement_score":0.019990107,"about_ca_system_score_codex":0.0020640376,"about_ca_system_score_gemma":0.0012543573,"threshold_uncertainty_score":0.06687361},"labels":[],"label_agreement":null},{"id":"W2399259489","doi":"","title":"Stratified Graphs and Distance Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Pathwidth; Combinatorics; Graph; Line graph","score_opus":0.012345431544107287,"score_gpt":0.2620143591608478,"score_spread":0.24966892761674053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399259489","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13458931,0.043379664,0.2967989,0.014510364,0.0028825281,0.000089264024,0.0017647212,0.0009252133,0.50506],"genre_scores_gemma":[0.8166348,0.016809793,0.056576096,0.0028576958,0.0021656554,0.00012304666,0.0018668314,0.00026997007,0.10269616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940765,0.00018554891,0.00003069121,0.0001288389,0.00015625768,0.00009096889],"domain_scores_gemma":[0.998425,0.0008347798,0.00017721679,0.00020068121,0.00017963421,0.00018267076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056479714,0.00051767816,0.00066865614,0.0021110666,0.001420077,0.0025455204,0.00071753113,0.0009369208,0.011198357],"category_scores_gemma":[0.002954774,0.0003694491,0.0005384853,0.0025558928,0.0021982316,0.0052245446,0.0017230758,0.0022659427,0.0027858154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000106518855,0.000010080136,0.00021247467,0.000040276544,0.00000730139,0.00004684966,0.00013596147,0.00034520487,0.00027378177,0.9817364,0.006400101,0.010780886],"study_design_scores_gemma":[0.0000036166537,0.000005823075,0.0002541401,0.00001942788,0.0000069113144,0.00012269212,0.00011140508,0.0008206857,0.00015389478,0.9785864,0.019909821,0.000005228898],"about_ca_topic_score_codex":0.0015270655,"about_ca_topic_score_gemma":0.002390283,"teacher_disagreement_score":0.011198357,"about_ca_system_score_codex":0.0013737613,"about_ca_system_score_gemma":0.00046484955,"threshold_uncertainty_score":0.037462294},"labels":[],"label_agreement":null},{"id":"W2399307741","doi":"","title":"On super connectedness and super restricted edge-connectedness of total graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Social connectedness; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Computer science; Telecommunications; Social psychology; Psychology","score_opus":0.01126689764005305,"score_gpt":0.24872080505315078,"score_spread":0.23745390741309774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399307741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52087235,0.0045831036,0.22852115,0.0046872916,0.00033683018,0.0001038745,0.0011622398,0.000491245,0.23924188],"genre_scores_gemma":[0.9543399,0.0025938095,0.026137123,0.0010285336,0.00048135055,0.00012280369,0.0009331972,0.00022683051,0.014136337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910283,0.00028179868,0.000050961182,0.00023380922,0.00021495538,0.000115587434],"domain_scores_gemma":[0.99089944,0.006179366,0.00065674295,0.0009248541,0.0006171871,0.000722389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013489781,0.00061342487,0.00069742,0.002992836,0.0015671797,0.0020884622,0.0014748478,0.0010912337,0.011641051],"category_scores_gemma":[0.0078489715,0.00067566545,0.0008277593,0.002972424,0.0038363447,0.008565216,0.0023106576,0.002557757,0.00074951927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043645032,0.000022641208,0.0008645694,0.00012111139,0.000020542266,0.00012624268,0.00035885078,0.0015267216,0.0010202868,0.9856031,0.0022828714,0.008009335],"study_design_scores_gemma":[0.000008521379,0.000012307682,0.0008394219,0.000032971006,0.000023768016,0.00021117355,0.000176809,0.0042973314,0.00031167522,0.99118656,0.0028907587,0.000008670891],"about_ca_topic_score_codex":0.0012732715,"about_ca_topic_score_gemma":0.0017781394,"teacher_disagreement_score":0.011641051,"about_ca_system_score_codex":0.00087619666,"about_ca_system_score_gemma":0.00040696704,"threshold_uncertainty_score":0.03894323},"labels":[],"label_agreement":null},{"id":"W2399320116","doi":"","title":"Equality in Vizing’s conjecture fixing one factor of the Cartesian product.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Bipartite graph; Conjecture; Combinatorics; Vertex (graph theory); Product (mathematics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Geometry","score_opus":0.0228087891237739,"score_gpt":0.2871580980097687,"score_spread":0.26434930888599484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399320116","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54209805,0.0011179236,0.13783114,0.01325579,0.0016780676,0.00013885916,0.00074369484,0.00045416993,0.30268243],"genre_scores_gemma":[0.9637294,0.00023528976,0.015726253,0.0008693711,0.00029636297,0.00004900215,0.0003968281,0.000089086694,0.018608443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901044,0.0002598714,0.00005457746,0.00027591764,0.00016807146,0.00023117432],"domain_scores_gemma":[0.9980685,0.0009005654,0.0001579058,0.00039423653,0.0003062375,0.00017253037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011671826,0.00041145744,0.000639051,0.0006454721,0.0020618516,0.0015512066,0.0009731353,0.0025067194,0.015586961],"category_scores_gemma":[0.007685102,0.00028581236,0.0008973928,0.0006657966,0.0041202004,0.004503884,0.0018537139,0.0021857105,0.001437982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006582517,0.000019707551,0.0007274629,0.00003839413,0.000009781827,0.00014437184,0.00027753235,0.0015293525,0.00040388692,0.98881954,0.0037800435,0.004184102],"study_design_scores_gemma":[0.000027262691,0.000020013375,0.00024004476,0.00001653039,0.000007154817,0.000106293024,0.00014943744,0.004238954,0.00031891177,0.9906855,0.004179404,0.000010440053],"about_ca_topic_score_codex":0.0018381265,"about_ca_topic_score_gemma":0.0019008993,"teacher_disagreement_score":0.015586961,"about_ca_system_score_codex":0.0009300032,"about_ca_system_score_gemma":0.0008100592,"threshold_uncertainty_score":0.052143633},"labels":[],"label_agreement":null},{"id":"W2399337215","doi":"","title":"Upper signed k-domination number in graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Discrete mathematics; Graph","score_opus":0.021875333837572754,"score_gpt":0.29686836802903455,"score_spread":0.2749930341914618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399337215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44268897,0.003133175,0.17488308,0.0047907485,0.0014159905,0.000113358175,0.0028197514,0.0013248757,0.3688301],"genre_scores_gemma":[0.93520206,0.0011102594,0.0247006,0.00063726195,0.00034889745,0.00011579368,0.0009369025,0.00021239664,0.036735818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999038,0.00016445573,0.00006741634,0.000187221,0.0003090906,0.00023392786],"domain_scores_gemma":[0.9960238,0.0020265903,0.00041978573,0.00050102436,0.0005488277,0.00048001696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007779963,0.0005244271,0.00057555665,0.0021664225,0.0014507641,0.0037682247,0.0010203477,0.0009461034,0.015685573],"category_scores_gemma":[0.006249617,0.00027893955,0.00042630537,0.0018256988,0.0017800252,0.0049806293,0.0018633495,0.0019125773,0.0031599952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000279907,0.00007660438,0.0016627389,0.00025811803,0.000025894336,0.00023612267,0.00038901748,0.0043679224,0.006893895,0.9119095,0.0125148315,0.06138538],"study_design_scores_gemma":[0.000021249738,0.000033640332,0.0011357095,0.000058775455,0.000019545098,0.00031832006,0.00012636493,0.0074819243,0.003701231,0.97095484,0.016119512,0.000028954679],"about_ca_topic_score_codex":0.0005449909,"about_ca_topic_score_gemma":0.0010738161,"teacher_disagreement_score":0.015685573,"about_ca_system_score_codex":0.0014246866,"about_ca_system_score_gemma":0.00082628283,"threshold_uncertainty_score":0.052473545},"labels":[],"label_agreement":null},{"id":"W2399364444","doi":"","title":"Universal Graphs for Two Graph Properties.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.019782428225242375,"score_gpt":0.26455577135395875,"score_spread":0.24477334312871638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399364444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14998552,0.003543934,0.428456,0.009390467,0.001314077,0.00017394302,0.0018528954,0.0012592882,0.40402398],"genre_scores_gemma":[0.9186611,0.0011576776,0.049943056,0.0015822189,0.0006069092,0.00019503289,0.0010643064,0.00028849157,0.026501102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985025,0.0004522679,0.000091141075,0.00042116805,0.00025343706,0.00027948304],"domain_scores_gemma":[0.99535733,0.0024724307,0.00040490818,0.00087318494,0.00045635548,0.0004358027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012019463,0.00061551324,0.0006482815,0.0029639446,0.0024610525,0.0033469144,0.0009594794,0.0018620277,0.015997251],"category_scores_gemma":[0.0058566644,0.00046192898,0.001362871,0.0018342267,0.0049499325,0.009601328,0.0032735378,0.003053771,0.0015874244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010654412,0.00000785688,0.00010446171,0.00001900717,0.0000027769531,0.000043746077,0.0001140923,0.00008373602,0.00013435399,0.9955989,0.0012303386,0.002649986],"study_design_scores_gemma":[0.000004660579,0.000005086062,0.0001665695,0.000021990143,0.000007773475,0.00013197106,0.00013009539,0.0006197556,0.00021781123,0.9926744,0.006013896,0.000005984873],"about_ca_topic_score_codex":0.0009743761,"about_ca_topic_score_gemma":0.0011092536,"teacher_disagreement_score":0.015997251,"about_ca_system_score_codex":0.0016537838,"about_ca_system_score_gemma":0.00061661063,"threshold_uncertainty_score":0.05351615},"labels":[],"label_agreement":null},{"id":"W2399497525","doi":"","title":"On Strong Biclique Covering.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Complete bipartite graph; Combinatorics; Bipartite graph; Graph","score_opus":0.019870713523877256,"score_gpt":0.2927214093300953,"score_spread":0.272850695806218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399497525","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.317861,0.0025813826,0.2067604,0.0040793847,0.00084499095,0.00012354682,0.0012181906,0.000875216,0.46565592],"genre_scores_gemma":[0.886827,0.0017043143,0.03779474,0.0012829186,0.00044736874,0.0001346989,0.0014789175,0.00035026713,0.06997978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990902,0.00020790719,0.000035475292,0.0001604284,0.0002588345,0.0002471218],"domain_scores_gemma":[0.99799395,0.0009075764,0.00017299509,0.00032147404,0.00030628644,0.00029775302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005955674,0.0006800007,0.0006805401,0.0017563368,0.002604545,0.0020273284,0.0010226318,0.0010728973,0.013316375],"category_scores_gemma":[0.0032344793,0.0004928349,0.00060125656,0.0019928347,0.0017021813,0.0047206897,0.0040405155,0.002205856,0.0025789961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006855205,0.000026416194,0.0005336012,0.000094598036,0.00001202764,0.00014788799,0.00026645235,0.0013964216,0.0009715426,0.9739822,0.008195938,0.014304278],"study_design_scores_gemma":[0.000014848196,0.000020914007,0.0006232457,0.00004193188,0.000015708567,0.00041115884,0.00021727713,0.0062653534,0.0007457724,0.9728224,0.018807577,0.000013846061],"about_ca_topic_score_codex":0.0018516178,"about_ca_topic_score_gemma":0.0026936375,"teacher_disagreement_score":0.013316375,"about_ca_system_score_codex":0.0012980315,"about_ca_system_score_gemma":0.00049886364,"threshold_uncertainty_score":0.044547677},"labels":[],"label_agreement":null},{"id":"W2399511925","doi":"","title":"A Note on Spanning Eulerian Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eulerian path; Combinatorics; Pure mathematics","score_opus":0.033092864583891206,"score_gpt":0.28432877365137516,"score_spread":0.25123590906748394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399511925","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03129908,0.05693895,0.18863319,0.056878876,0.036426026,0.00009573048,0.0012796455,0.000906744,0.6275418],"genre_scores_gemma":[0.47218928,0.11096892,0.16529767,0.027329309,0.030290648,0.00018990827,0.0015164658,0.0011543647,0.19106337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996841,0.00008261062,0.000017291506,0.000075298,0.00009707637,0.000043567125],"domain_scores_gemma":[0.997982,0.0013784494,0.000078039906,0.00022796434,0.00019394745,0.00013952164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000704163,0.00061386294,0.0005258732,0.0012523237,0.0015960399,0.0011237598,0.0011755275,0.0010607752,0.013368985],"category_scores_gemma":[0.003539253,0.0003178077,0.00060111616,0.0019111462,0.0017679174,0.005272378,0.0019040365,0.003496977,0.002899971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000447665,0.000027844573,0.00039500592,0.00031500953,0.00002379502,0.00066881074,0.00024970746,0.0018951489,0.0015316553,0.8112099,0.1258597,0.057778645],"study_design_scores_gemma":[0.000004918972,0.00001766255,0.00048658857,0.00010222929,0.00001793204,0.00060296274,0.00011102178,0.0011661804,0.00052087836,0.7972933,0.19966377,0.0000126221685],"about_ca_topic_score_codex":0.0017360515,"about_ca_topic_score_gemma":0.0037401684,"teacher_disagreement_score":0.013368985,"about_ca_system_score_codex":0.0007632283,"about_ca_system_score_gemma":0.00046779422,"threshold_uncertainty_score":0.04472375},"labels":[],"label_agreement":null},{"id":"W2399604044","doi":"","title":"The Upper and Lower Geodetic Numbers of Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Geodetic datum; Vertex (graph theory); Digraph; Graph; Connectivity; Conjecture; Upper and lower bounds; Discrete mathematics; Geodesy","score_opus":0.00831600444327827,"score_gpt":0.2604379802694791,"score_spread":0.25212197582620083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399604044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26008853,0.03438172,0.40725353,0.0050675897,0.0018477046,0.0002121149,0.0061790165,0.0010015616,0.28396833],"genre_scores_gemma":[0.8539632,0.0122543955,0.10940577,0.0012155211,0.001403367,0.00036032376,0.0022567855,0.00025743368,0.018883262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761415,0.0004896693,0.0001620925,0.00068561966,0.0005974819,0.00045100448],"domain_scores_gemma":[0.9935569,0.0038116828,0.000941443,0.00062301266,0.0005208467,0.0005460182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014707429,0.0012617361,0.00072389835,0.0046843826,0.0010580653,0.0036564192,0.0011073253,0.0012540503,0.0050739287],"category_scores_gemma":[0.009863095,0.0005475096,0.00072623626,0.0043467386,0.004304868,0.0063100937,0.0018369673,0.0024583978,0.0014239384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013931519,0.00004291179,0.0022240297,0.00032566697,0.000029389936,0.00015734773,0.00039709048,0.009884543,0.0026681942,0.9255584,0.007907159,0.050665904],"study_design_scores_gemma":[0.000024441875,0.00011635883,0.0040540453,0.00024723634,0.000045384364,0.0010569822,0.000320057,0.02236184,0.0032320668,0.89243853,0.07602336,0.00007961756],"about_ca_topic_score_codex":0.0014227397,"about_ca_topic_score_gemma":0.0012846268,"teacher_disagreement_score":0.0050739287,"about_ca_system_score_codex":0.0021121004,"about_ca_system_score_gemma":0.00085012696,"threshold_uncertainty_score":0.016974032},"labels":[],"label_agreement":null},{"id":"W2399633863","doi":"","title":"On (l, m)-Walk-regular Digraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02446002684681085,"score_gpt":0.2597508041205264,"score_spread":0.23529077727371558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399633863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46649313,0.002074679,0.3155622,0.002857104,0.00041990742,0.00026635558,0.003041135,0.0014857778,0.20779976],"genre_scores_gemma":[0.8997791,0.0011124257,0.04329654,0.0008158434,0.00018668245,0.0001480158,0.0019410485,0.0002601045,0.052460384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922884,0.00022039696,0.000052277028,0.00019583285,0.00011737478,0.00018533516],"domain_scores_gemma":[0.9976496,0.0010944899,0.0003651861,0.0002798356,0.00019865241,0.00041225457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044025504,0.00065834227,0.00075777265,0.001740219,0.0019557897,0.0026950226,0.001069971,0.0013387327,0.011373885],"category_scores_gemma":[0.003178068,0.0006726444,0.0007807457,0.0017020677,0.001418345,0.003638653,0.0024327673,0.0014801895,0.0025447856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014254048,0.00009261655,0.0010675631,0.00023132941,0.000045333993,0.00072021584,0.00057560514,0.005336194,0.0031546769,0.954103,0.010076076,0.024455005],"study_design_scores_gemma":[0.000050910152,0.000038541275,0.0005553456,0.00006661349,0.000027698092,0.00055242924,0.00025316016,0.014464526,0.001085683,0.97255206,0.010329363,0.000023677361],"about_ca_topic_score_codex":0.002093409,"about_ca_topic_score_gemma":0.004660763,"teacher_disagreement_score":0.011373885,"about_ca_system_score_codex":0.0015160925,"about_ca_system_score_gemma":0.000501277,"threshold_uncertainty_score":0.0380494},"labels":[],"label_agreement":null},{"id":"W2399636163","doi":"","title":"k-Domination stable graphs upon edge removal.","year":2015,"lang":"ceb","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.034739600357956174,"score_gpt":0.2989108015642031,"score_spread":0.26417120120624693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399636163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4561375,0.00083340256,0.25113976,0.0022556388,0.00086605625,0.00029775116,0.0023900769,0.0023896415,0.28369015],"genre_scores_gemma":[0.89618367,0.00048167165,0.032948118,0.00061657175,0.00015342035,0.00015023716,0.0017754447,0.00042538845,0.06726547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948347,0.00008667528,0.000024573312,0.00009841444,0.00014268412,0.00016418096],"domain_scores_gemma":[0.99758565,0.0008633222,0.00027567399,0.0005942015,0.00041267497,0.00026846357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004021431,0.00038172418,0.000327873,0.0009517391,0.001340032,0.0014021244,0.0011268948,0.000804358,0.010781902],"category_scores_gemma":[0.0032471719,0.00030072583,0.0005603034,0.00088838756,0.0010168367,0.0020327459,0.0016026237,0.0012887267,0.0025138047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063122826,0.00019652634,0.002478326,0.00046076905,0.00010211476,0.0020074584,0.0014157145,0.0107348105,0.055771913,0.8066796,0.034856897,0.08466463],"study_design_scores_gemma":[0.0001078003,0.00009564924,0.003307798,0.000098897646,0.00010056117,0.0018677077,0.00081275805,0.029904906,0.025773175,0.89072734,0.04714338,0.00005999183],"about_ca_topic_score_codex":0.0010877501,"about_ca_topic_score_gemma":0.0021681087,"teacher_disagreement_score":0.010781902,"about_ca_system_score_codex":0.0005699035,"about_ca_system_score_gemma":0.00065392494,"threshold_uncertainty_score":0.036069095},"labels":[],"label_agreement":null},{"id":"W2399752582","doi":"","title":"A surprising regularity in the number of Hamilton paths in polygonal bigraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.013920836536014064,"score_gpt":0.2833612627848556,"score_spread":0.26944042624884157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399752582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8295483,0.0021599028,0.10254121,0.005953817,0.00057106296,0.000078183126,0.0025478955,0.0010285056,0.05557114],"genre_scores_gemma":[0.97644764,0.00050050183,0.016045228,0.0004144078,0.0002634885,0.00006808094,0.00087538833,0.00017375844,0.0052114683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911517,0.00017944083,0.00004598101,0.0002746821,0.00022883582,0.00015596916],"domain_scores_gemma":[0.9877292,0.007917975,0.0016083887,0.0013017592,0.00058857753,0.000854074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006683812,0.00036438002,0.0008056985,0.0015411561,0.001367299,0.0024743772,0.0019054979,0.0016611804,0.0056808325],"category_scores_gemma":[0.015277087,0.0008671548,0.00064590684,0.0014298919,0.0029274975,0.0035241467,0.0013818659,0.00211118,0.00055241387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079462136,0.00018058078,0.018526819,0.000681059,0.0001717534,0.0016078796,0.00091063784,0.026471596,0.013314982,0.86877865,0.027934091,0.04062728],"study_design_scores_gemma":[0.00010068942,0.00007303505,0.007975565,0.000067966204,0.00007441598,0.0012623739,0.0002714586,0.040881738,0.0023796847,0.9398831,0.006986902,0.000043058193],"about_ca_topic_score_codex":0.0012273946,"about_ca_topic_score_gemma":0.0020164032,"teacher_disagreement_score":0.0056808325,"about_ca_system_score_codex":0.00086964166,"about_ca_system_score_gemma":0.00036635197,"threshold_uncertainty_score":0.019004285},"labels":[],"label_agreement":null},{"id":"W2399769410","doi":"","title":"On Some Rational Difference Equations.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Applied mathematics","score_opus":0.022771295870573267,"score_gpt":0.292089862847564,"score_spread":0.26931856697699075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399769410","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15614122,0.0051107975,0.1827191,0.0116569735,0.0020981114,0.00008610701,0.0009833125,0.0003348086,0.6408696],"genre_scores_gemma":[0.83049524,0.0027992227,0.046792936,0.002204071,0.0012890634,0.00012011261,0.00079454767,0.00028365018,0.115221255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994137,0.00015674504,0.000027716264,0.00009553147,0.00019567883,0.00011056878],"domain_scores_gemma":[0.9989637,0.00059873227,0.00006963661,0.00009051845,0.00018708769,0.0000902533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087653485,0.00063117483,0.0007083741,0.0013746251,0.001251582,0.0018690146,0.0008573205,0.0009509909,0.018234774],"category_scores_gemma":[0.0034445913,0.00035723008,0.00073090167,0.0013113586,0.0024835463,0.00478472,0.002146037,0.0039697257,0.0024322555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013012887,0.000009640522,0.00009563871,0.00001812255,0.0000030827628,0.000033698343,0.00009913888,0.00021344329,0.00016005567,0.9932514,0.0019555795,0.0041471184],"study_design_scores_gemma":[0.000015083514,0.0000059385834,0.000111321315,0.000011970029,0.0000035832193,0.00006134031,0.000040828814,0.0014608629,0.00015832577,0.9927088,0.0054170084,0.0000050042713],"about_ca_topic_score_codex":0.0013772348,"about_ca_topic_score_gemma":0.0018081029,"teacher_disagreement_score":0.018234774,"about_ca_system_score_codex":0.0018634533,"about_ca_system_score_gemma":0.000573521,"threshold_uncertainty_score":0.06100136},"labels":[],"label_agreement":null},{"id":"W2399777153","doi":"","title":"Edge choosability and total choosability of toroidal graphs without intersecting triangles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toroid; Combinatorics; Physics; Plasma","score_opus":0.019398212443042493,"score_gpt":0.28856796817331604,"score_spread":0.2691697557302735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399777153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7580584,0.0005259491,0.11744468,0.0005396107,0.00010259726,0.00009302763,0.0013743428,0.0003013634,0.12156],"genre_scores_gemma":[0.9828393,0.00031079724,0.0076176054,0.00008078617,0.000043747274,0.000046739846,0.0008044264,0.00009412077,0.008162531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951255,0.000090707355,0.000031593365,0.00012713003,0.00011419013,0.00012388556],"domain_scores_gemma":[0.9974137,0.001362684,0.00033708595,0.0004011611,0.0001745559,0.00031090784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037765285,0.00036320707,0.00043662312,0.00058397214,0.00086796534,0.0018472009,0.00083807565,0.00047040582,0.016098998],"category_scores_gemma":[0.0031644625,0.00037069127,0.0005919295,0.000929768,0.0014476177,0.0023816682,0.0011984167,0.0010706389,0.0008625679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006448459,0.00006841047,0.0029725535,0.00028238533,0.000053557247,0.00038772105,0.00059833954,0.019418426,0.010792393,0.9170377,0.005452185,0.042291347],"study_design_scores_gemma":[0.0000917851,0.00010790316,0.003146366,0.0000534746,0.00007938734,0.000688253,0.00055697403,0.04105762,0.0072254054,0.93883455,0.0081183165,0.000039904684],"about_ca_topic_score_codex":0.0020823465,"about_ca_topic_score_gemma":0.0022663795,"teacher_disagreement_score":0.016098998,"about_ca_system_score_codex":0.0006166982,"about_ca_system_score_gemma":0.00044899623,"threshold_uncertainty_score":0.05385655},"labels":[],"label_agreement":null},{"id":"W2399807751","doi":"","title":"A Unified A pproach to External Graphs for Different Indices.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.046065597460661016,"score_gpt":0.30777249807071533,"score_spread":0.2617069006100543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399807751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004640141,0.0007836364,0.9064355,0.0015443066,0.0011078992,0.00016562927,0.000361117,0.0012880181,0.08367374],"genre_scores_gemma":[0.112070024,0.0023439012,0.8056068,0.0028736764,0.0013683053,0.00071293337,0.0012336524,0.003166001,0.070624694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976306,0.0007800948,0.00019436734,0.0005549137,0.0006031234,0.00023697008],"domain_scores_gemma":[0.995583,0.00076760346,0.00015404867,0.0024986214,0.0007011193,0.00029556826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026365006,0.0015072598,0.0018965409,0.004330782,0.004908495,0.0063341926,0.0055295895,0.0032115774,0.018301165],"category_scores_gemma":[0.007778174,0.0013242144,0.0033561941,0.0040415693,0.0064966446,0.018545214,0.008701861,0.008792442,0.010659625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009277178,0.000019609746,0.00005401536,0.00003184588,0.000005611625,0.00004295561,0.00011430876,0.0004480365,0.0003335156,0.98696923,0.004511096,0.007460421],"study_design_scores_gemma":[0.000006365523,0.000008495272,0.000035014553,0.00003443815,0.00001025885,0.00010715903,0.00006303322,0.0048792507,0.0003202432,0.96976197,0.024759533,0.000014280679],"about_ca_topic_score_codex":0.0017875369,"about_ca_topic_score_gemma":0.0038067105,"teacher_disagreement_score":0.018301165,"about_ca_system_score_codex":0.0017514402,"about_ca_system_score_gemma":0.0015210927,"threshold_uncertainty_score":0.061223447},"labels":[],"label_agreement":null},{"id":"W2399867629","doi":"","title":"Number of Embeddings of Wheel Graphs on Surfaces of Small Genus.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Genus; Mathematics; Combinatorics; Zoology; Biology","score_opus":0.031631023267120896,"score_gpt":0.28210353163178187,"score_spread":0.25047250836466095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399867629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95004493,0.0007197614,0.015153654,0.0015800305,0.00021304715,0.00004164422,0.0012407728,0.0005094993,0.030496616],"genre_scores_gemma":[0.98621666,0.00034563817,0.0045328396,0.000104183695,0.00010063758,0.000060588914,0.0013982856,0.00013445532,0.0071068117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988875,0.0002455912,0.00006614291,0.00028437987,0.00027136155,0.00024511572],"domain_scores_gemma":[0.99226576,0.004400281,0.00094075507,0.00071179116,0.00041814047,0.0012632596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090221537,0.0007448508,0.0009942813,0.002026848,0.0019888121,0.0041983626,0.0018472124,0.0019758889,0.01795193],"category_scores_gemma":[0.009607269,0.00069233385,0.0008311242,0.001250419,0.0025264674,0.0045858943,0.002340246,0.0014892848,0.0012349401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018830749,0.0003375071,0.027448032,0.00093024614,0.00029028358,0.0008932317,0.0017821031,0.025258044,0.018708082,0.839612,0.026780928,0.05607647],"study_design_scores_gemma":[0.00025283083,0.00024350171,0.017288063,0.00021494113,0.00031054887,0.0017817275,0.0016533057,0.07785345,0.011002604,0.87367517,0.01561941,0.00010442798],"about_ca_topic_score_codex":0.0007867047,"about_ca_topic_score_gemma":0.0012947946,"teacher_disagreement_score":0.01795193,"about_ca_system_score_codex":0.0010714644,"about_ca_system_score_gemma":0.0006554855,"threshold_uncertainty_score":0.060055196},"labels":[],"label_agreement":null},{"id":"W2399957385","doi":"","title":"Equitable Coloring and Equitable Choosability of Planar Graphs without 6- and 7-Cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar graph; List coloring; Combinatorics; Graph","score_opus":0.026221059166199247,"score_gpt":0.2945141008722831,"score_spread":0.2682930417060838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399957385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6446328,0.00063503,0.21271007,0.0013521034,0.0001279638,0.00014954036,0.0009471223,0.0005836968,0.1388617],"genre_scores_gemma":[0.95830697,0.00036626754,0.022479594,0.00028808857,0.000072365496,0.00010456828,0.0008960651,0.00024056106,0.017245501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991068,0.00019965589,0.00005991436,0.00020440052,0.00020267995,0.0002264796],"domain_scores_gemma":[0.9963797,0.0017409603,0.00052012637,0.00074013893,0.00029298128,0.00032610507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000565609,0.0004223112,0.00048244715,0.00072749594,0.0013435277,0.0016283558,0.0012831514,0.0008778693,0.014832534],"category_scores_gemma":[0.0046770717,0.00055018853,0.0005291079,0.0010915591,0.0012946707,0.0037413675,0.0018676736,0.0016180066,0.0010436086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057273987,0.00024547218,0.0027342467,0.00029692904,0.00005152187,0.0007119789,0.0007275355,0.021446917,0.015037489,0.8824814,0.0059323288,0.06976136],"study_design_scores_gemma":[0.00009549512,0.000071061026,0.0016205173,0.000041891755,0.000055289525,0.0006538899,0.00035768893,0.028566675,0.009942909,0.94930893,0.009254733,0.000030960713],"about_ca_topic_score_codex":0.001289244,"about_ca_topic_score_gemma":0.0023395403,"teacher_disagreement_score":0.014832534,"about_ca_system_score_codex":0.00074856996,"about_ca_system_score_gemma":0.0005049163,"threshold_uncertainty_score":0.049619734},"labels":[],"label_agreement":null},{"id":"W2400036930","doi":"","title":"Extremal Values for Identification, Domination and Maximum Cliques in Twin-Free Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Identification (biology); Combinatorics; Discrete mathematics; Biology; Botany","score_opus":0.031186157292333417,"score_gpt":0.29171948966739675,"score_spread":0.2605333323750633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400036930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.688704,0.0021843726,0.2400064,0.0026384937,0.00021710715,0.00009889624,0.001186153,0.0005170084,0.06444756],"genre_scores_gemma":[0.97709477,0.0002959512,0.018688783,0.000085884916,0.00009590424,0.0000690002,0.00030587762,0.00006831121,0.0032954952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989656,0.00031357477,0.000054152373,0.00020301786,0.00026210147,0.00020150251],"domain_scores_gemma":[0.99216664,0.0052354774,0.0007832095,0.0005471846,0.0004913494,0.0007761805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020414598,0.0005909022,0.00076824974,0.003675218,0.0016326366,0.003313306,0.0018599923,0.0015403361,0.006385095],"category_scores_gemma":[0.017137084,0.00058590336,0.0005412971,0.0019164445,0.0029363167,0.0054857223,0.0020401506,0.002060194,0.0004919509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002615113,0.00006877206,0.0024230874,0.00013672965,0.00003778146,0.00013021713,0.00040272175,0.009590088,0.0016883932,0.963206,0.004190852,0.017863864],"study_design_scores_gemma":[0.00002644999,0.000021914682,0.0013664962,0.00004326055,0.00002146517,0.00023626837,0.00023087271,0.039024506,0.0012896162,0.9561013,0.001610453,0.000027388838],"about_ca_topic_score_codex":0.0004779315,"about_ca_topic_score_gemma":0.00084216596,"teacher_disagreement_score":0.006385095,"about_ca_system_score_codex":0.0015355751,"about_ca_system_score_gemma":0.00046351636,"threshold_uncertainty_score":0.021360219},"labels":[],"label_agreement":null},{"id":"W2400067391","doi":"","title":"The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Strong perfect graph theorem; Graph; 1-planar graph; Line graph","score_opus":0.009662535985603777,"score_gpt":0.25304128848461727,"score_spread":0.2433787524990135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400067391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6016976,0.0033409363,0.17477031,0.014728665,0.00085182255,0.0002062252,0.0017722769,0.00046582462,0.20216638],"genre_scores_gemma":[0.97981447,0.0007130357,0.0074224714,0.00049973384,0.00055541575,0.000106739084,0.0005925695,0.00005989062,0.010235642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744177,0.0010518474,0.00012534749,0.0003778505,0.0005820298,0.00042116625],"domain_scores_gemma":[0.9842329,0.011207633,0.0012484638,0.0016871397,0.0007416697,0.00088215916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023044301,0.00071136624,0.0011376684,0.0024365738,0.0018204465,0.0034944373,0.002441716,0.0021001317,0.014268017],"category_scores_gemma":[0.017716845,0.00069686456,0.0012549883,0.0015972332,0.007438942,0.0086253155,0.003993069,0.0038360443,0.0014737227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072157854,0.000043146305,0.0006228306,0.000060832983,0.000013231312,0.00010226809,0.00014008042,0.0024350767,0.00037376123,0.98725605,0.002573675,0.00630681],"study_design_scores_gemma":[0.00002520584,0.0000107910855,0.00021291751,0.000016774464,0.0000059882937,0.00011717753,0.000058699417,0.00758165,0.0002789557,0.99066204,0.0010192471,0.000010588122],"about_ca_topic_score_codex":0.001831871,"about_ca_topic_score_gemma":0.0014846341,"teacher_disagreement_score":0.014268017,"about_ca_system_score_codex":0.0018785275,"about_ca_system_score_gemma":0.0014223448,"threshold_uncertainty_score":0.04773128},"labels":[],"label_agreement":null},{"id":"W2400282143","doi":"","title":"Alternating Domination In Arc-Colored Digraphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Colored; Combinatorics; Geometry; Political science; Law","score_opus":0.013368183136049077,"score_gpt":0.28732149776533844,"score_spread":0.27395331462928935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400282143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5085906,0.0012029809,0.3173414,0.0021333057,0.0002774479,0.0001856359,0.0013592667,0.0009018572,0.16800755],"genre_scores_gemma":[0.92626315,0.0005443695,0.040406685,0.00046019309,0.00010212435,0.000112266425,0.00065447,0.00014422472,0.031312425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892455,0.00037116522,0.000067839486,0.00022569964,0.00020275393,0.00020793814],"domain_scores_gemma":[0.9949764,0.003244273,0.00038892307,0.00046453672,0.00045311928,0.00047284877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075427664,0.0004086944,0.00046766474,0.0010772845,0.0013047875,0.0022478162,0.001064122,0.00088089245,0.0076711723],"category_scores_gemma":[0.0052512838,0.0004830396,0.0005098262,0.0013004025,0.0012854408,0.0033620957,0.0015487588,0.0013540585,0.00093834085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014616003,0.0000743171,0.0019236812,0.00017989826,0.000054205924,0.00058150286,0.00074461784,0.007842712,0.004847537,0.94561356,0.006395199,0.031596575],"study_design_scores_gemma":[0.000047527363,0.00002615136,0.000665955,0.000039431867,0.00004614935,0.0005770923,0.0002386113,0.032157417,0.0021893352,0.9524608,0.011528474,0.00002296665],"about_ca_topic_score_codex":0.0021477665,"about_ca_topic_score_gemma":0.0039069904,"teacher_disagreement_score":0.0076711723,"about_ca_system_score_codex":0.0013171473,"about_ca_system_score_gemma":0.00065834756,"threshold_uncertainty_score":0.02566266},"labels":[],"label_agreement":null},{"id":"W2400294061","doi":"","title":"The E 2 -Hamiltonian Property of Circuit Graphs of Matroids.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Property (philosophy); Hamiltonian (control theory); Combinatorics; Graphic matroid; Discrete mathematics; Mathematical optimization","score_opus":0.014765639995292693,"score_gpt":0.24988504009855467,"score_spread":0.235119400103262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400294061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6030801,0.0018933802,0.10763546,0.0035236352,0.00047574248,0.0000930269,0.0018925733,0.00033162188,0.28107458],"genre_scores_gemma":[0.9736126,0.0005482993,0.007700241,0.00058342196,0.00018958052,0.000041648487,0.0005367761,0.00005551445,0.016731987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997141,0.000067196386,0.000013089003,0.00007186406,0.000065439905,0.000068344205],"domain_scores_gemma":[0.9987846,0.0005223331,0.00020872094,0.0001761587,0.00011889034,0.00018926323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002152702,0.000272034,0.00026950022,0.0007490034,0.0009362935,0.0018116393,0.00058364024,0.0010070144,0.012417755],"category_scores_gemma":[0.0019456743,0.0002965695,0.00033370638,0.0008671292,0.0012850154,0.0021552693,0.0008570927,0.0009823462,0.00090301555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012170047,0.0000674817,0.0019612692,0.00015008237,0.000028258168,0.00035141644,0.0002442929,0.002084934,0.0077263336,0.9510749,0.008128998,0.028060313],"study_design_scores_gemma":[0.000043980206,0.00005886521,0.003063874,0.00004449528,0.000024859768,0.0008235063,0.00032598784,0.0065061236,0.004114813,0.9707771,0.0141980145,0.000018298655],"about_ca_topic_score_codex":0.0008162269,"about_ca_topic_score_gemma":0.0013310353,"teacher_disagreement_score":0.012417755,"about_ca_system_score_codex":0.0004624422,"about_ca_system_score_gemma":0.0002860239,"threshold_uncertainty_score":0.041541576},"labels":[],"label_agreement":null},{"id":"W2400363530","doi":"","title":"Cubic, edge critical, Hamilton laceable bigraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.038777966897189264,"score_gpt":0.31665537306395475,"score_spread":0.2778774061667655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400363530","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36936626,0.0018110168,0.08343109,0.0027260394,0.0005107988,0.00022281507,0.0027761946,0.0013062292,0.53784955],"genre_scores_gemma":[0.86900204,0.0007127075,0.020427518,0.00060238194,0.0001407667,0.0000673136,0.0014933557,0.0001778377,0.107376106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998437,0.000023999768,0.0000050096646,0.000034984456,0.000042787393,0.000049521903],"domain_scores_gemma":[0.999373,0.00022083065,0.000068922825,0.0000707017,0.0001043366,0.00016217322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012399352,0.00033152287,0.00032808376,0.0007695309,0.0016227206,0.0012459412,0.00056988373,0.00060812576,0.017268961],"category_scores_gemma":[0.0014426187,0.00028075918,0.00027531272,0.0007050551,0.00096680125,0.0013469169,0.00092923216,0.0011270043,0.001528232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001451069,0.000052998414,0.0006407291,0.00023720005,0.000016359063,0.00047050425,0.00034868592,0.0026581886,0.0038798025,0.9464439,0.022449052,0.022657413],"study_design_scores_gemma":[0.0000573583,0.00003012613,0.0010036274,0.00003878622,0.00001997938,0.00039901637,0.00029624422,0.006885987,0.0016840748,0.9528958,0.036668994,0.000019955689],"about_ca_topic_score_codex":0.008525265,"about_ca_topic_score_gemma":0.02285699,"teacher_disagreement_score":0.017268961,"about_ca_system_score_codex":0.0011607015,"about_ca_system_score_gemma":0.0010494291,"threshold_uncertainty_score":0.05777043},"labels":[],"label_agreement":null},{"id":"W2400495332","doi":"","title":"On the Packing Number of Generalized Petersen Graphs P(n, 2).","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02485309128922991,"score_gpt":0.29933999395994476,"score_spread":0.27448690267071485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400495332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8110368,0.0031632034,0.034541413,0.0038376339,0.0006886439,0.000051406572,0.0010846161,0.00033065263,0.14526562],"genre_scores_gemma":[0.9821792,0.0012227515,0.0073933653,0.0002433584,0.0003624415,0.00007274682,0.0005880745,0.00009427506,0.007843709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992962,0.0002011124,0.000028186867,0.0001451681,0.00017171536,0.00015762387],"domain_scores_gemma":[0.9960849,0.002552041,0.00058363425,0.00022296445,0.000159098,0.00039729956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083123543,0.0006633296,0.0007568629,0.003056702,0.0015375745,0.0023865814,0.0011966947,0.001427952,0.010928072],"category_scores_gemma":[0.006930229,0.0004592311,0.00033637782,0.0023581558,0.0021955892,0.0041120085,0.0015042165,0.0016084043,0.0011212992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068602804,0.00014896467,0.0052844784,0.00049890444,0.00008699861,0.00044777838,0.000585365,0.046250127,0.0051211496,0.84850174,0.029843405,0.06254502],"study_design_scores_gemma":[0.000057923975,0.00010022388,0.0050851936,0.00011819803,0.00004595704,0.00058503204,0.0004013111,0.080195874,0.0031800487,0.9000271,0.01015139,0.000051779414],"about_ca_topic_score_codex":0.0009771037,"about_ca_topic_score_gemma":0.0014546218,"teacher_disagreement_score":0.010928072,"about_ca_system_score_codex":0.0010003877,"about_ca_system_score_gemma":0.00043403372,"threshold_uncertainty_score":0.036558032},"labels":[],"label_agreement":null},{"id":"W2400589288","doi":"","title":"On 2-domination and independence domination numbers of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Independence number; Domination analysis; Combinatorics; Statistics; Graph; Vertex (graph theory)","score_opus":0.018587035095333476,"score_gpt":0.2655439694014125,"score_spread":0.24695693430607904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400589288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.486238,0.00669062,0.11905335,0.004877366,0.00064199045,0.00012342296,0.0017710801,0.0003654036,0.38023883],"genre_scores_gemma":[0.9639315,0.002067508,0.015577128,0.00048532788,0.00071498496,0.00015003723,0.0006361565,0.000099220975,0.016338184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846905,0.0004446561,0.00008501578,0.00025880433,0.00044240814,0.00030005857],"domain_scores_gemma":[0.987735,0.009269782,0.0009585911,0.00054769457,0.0006664194,0.0008224928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017199044,0.0007188654,0.0008509058,0.0047768313,0.0018427828,0.003253207,0.0013112437,0.001056701,0.012039523],"category_scores_gemma":[0.009667814,0.0005209998,0.00067118794,0.003534052,0.004097119,0.008677281,0.0021184655,0.0032625038,0.0011837651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012876092,0.000047088208,0.001532096,0.00011333479,0.00002275615,0.00008552406,0.00043082333,0.0028045294,0.0008939245,0.9718997,0.004715108,0.017326454],"study_design_scores_gemma":[0.00001811329,0.000016497168,0.0013962024,0.000031946245,0.000013551099,0.0001739633,0.00010799948,0.0056364383,0.00045223394,0.9879885,0.00414813,0.000016454118],"about_ca_topic_score_codex":0.0012346068,"about_ca_topic_score_gemma":0.0015688752,"teacher_disagreement_score":0.012039523,"about_ca_system_score_codex":0.0017959448,"about_ca_system_score_gemma":0.0006069885,"threshold_uncertainty_score":0.04027617},"labels":[],"label_agreement":null},{"id":"W2400632756","doi":"","title":"Acyclic edge coloring of triangle-free toroidal graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toroid; Combinatorics; Enhanced Data Rates for GSM Evolution; Edge coloring; Graph; Computer science; Physics; Line graph; Artificial intelligence; Plasma","score_opus":0.03914921778049262,"score_gpt":0.27086943091467974,"score_spread":0.23172021313418711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400632756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54251546,0.0012208495,0.21123189,0.0010816068,0.00068091624,0.00016253877,0.00227757,0.001219399,0.23960978],"genre_scores_gemma":[0.9301279,0.0006574025,0.03640647,0.00024257967,0.00007941704,0.00006443046,0.0015708117,0.00017024823,0.030680783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975437,0.000058934496,0.000010051743,0.00004403197,0.000041804928,0.000090862646],"domain_scores_gemma":[0.9990356,0.0003524498,0.00011958028,0.00015691064,0.00015856023,0.00017695942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018463064,0.0002802254,0.0002566443,0.00061016646,0.0011612611,0.0010431813,0.0005781372,0.0003908102,0.011177925],"category_scores_gemma":[0.0013772465,0.00021598567,0.00022786355,0.0009538701,0.00062740926,0.0011142073,0.000643674,0.00074412784,0.0013858698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037486412,0.00007787098,0.0016394088,0.0002363154,0.000021758284,0.00041524594,0.00064178254,0.013054536,0.013643147,0.8956915,0.020980204,0.053223457],"study_design_scores_gemma":[0.000051159317,0.00006494053,0.0021015925,0.00006743429,0.000042224496,0.0005280728,0.0007445771,0.045125097,0.0081149,0.88919264,0.05392811,0.00003911266],"about_ca_topic_score_codex":0.004570843,"about_ca_topic_score_gemma":0.008404644,"teacher_disagreement_score":0.011177925,"about_ca_system_score_codex":0.00068615476,"about_ca_system_score_gemma":0.00047547117,"threshold_uncertainty_score":0.037393868},"labels":[],"label_agreement":null},{"id":"W2400845803","doi":"","title":"Counting Spanning Trees in Cographs: An Algorithmic Approach.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Discrete mathematics","score_opus":0.019523300530695085,"score_gpt":0.2850213839657436,"score_spread":0.26549808343504855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400845803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05347765,0.0014418782,0.9179995,0.0024034043,0.00032018658,0.00042059406,0.0015210051,0.0010467637,0.021369029],"genre_scores_gemma":[0.21792468,0.001131937,0.76467395,0.0005436376,0.00047853886,0.0003989481,0.0025992463,0.00036227456,0.011886827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977857,0.00065185264,0.00020732268,0.00055650785,0.0005856626,0.00021287936],"domain_scores_gemma":[0.98878676,0.0076472205,0.00073628954,0.0013787646,0.0010115637,0.0004394016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023894645,0.00085917354,0.0012957366,0.0043283976,0.002506759,0.0055069835,0.00395308,0.0027765275,0.009350328],"category_scores_gemma":[0.024042258,0.0010092349,0.001539336,0.0068752416,0.0021620782,0.011240172,0.0029341565,0.0028614549,0.001703903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085656786,0.00018693841,0.0030865893,0.00061939604,0.0001151435,0.0002264519,0.0005140417,0.018757109,0.0021560728,0.8367855,0.015711294,0.12175591],"study_design_scores_gemma":[0.000021070944,0.000023297798,0.00049248093,0.00007448402,0.0000669365,0.00031755748,0.0002076847,0.059418973,0.000917321,0.9298801,0.008561012,0.000019051195],"about_ca_topic_score_codex":0.0022926661,"about_ca_topic_score_gemma":0.004973892,"teacher_disagreement_score":0.009350328,"about_ca_system_score_codex":0.001731191,"about_ca_system_score_gemma":0.0019138296,"threshold_uncertainty_score":0.03127998},"labels":[],"label_agreement":null},{"id":"W2400986846","doi":"","title":"Multicolored Spanning Subgraphs in G-Colorings of Complete Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.023360363500033152,"score_gpt":0.2688719543067487,"score_spread":0.24551159080671556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400986846","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7107189,0.0019568417,0.22247626,0.0020667687,0.00031265157,0.00014256223,0.0018858514,0.0008310999,0.059609003],"genre_scores_gemma":[0.92095286,0.0007174398,0.062572956,0.00042187798,0.00012826086,0.00009470648,0.0012740255,0.0001630891,0.013674746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994617,0.00017169239,0.00003045756,0.0001465211,0.00008944679,0.00010013582],"domain_scores_gemma":[0.9976084,0.0011697124,0.00041029684,0.0003333823,0.00021674408,0.00026138072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000446944,0.00038077956,0.00045448245,0.0010404156,0.000980743,0.001400183,0.0009039953,0.0010024551,0.0063440655],"category_scores_gemma":[0.00337085,0.00057446986,0.0005016003,0.0013893599,0.0009387388,0.002185256,0.0011915949,0.0010737164,0.000717621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032176895,0.00012595109,0.00482479,0.0005160725,0.000095205156,0.0010978463,0.0009925374,0.022660568,0.013435371,0.8666116,0.016664403,0.07265384],"study_design_scores_gemma":[0.000050998013,0.0000446528,0.0024305084,0.000079064135,0.000050626437,0.0009989875,0.0004384051,0.044436615,0.0036701607,0.9362402,0.011538441,0.000021427342],"about_ca_topic_score_codex":0.0012571411,"about_ca_topic_score_gemma":0.0025604921,"teacher_disagreement_score":0.0063440655,"about_ca_system_score_codex":0.0007386735,"about_ca_system_score_gemma":0.00036913046,"threshold_uncertainty_score":0.021223068},"labels":[],"label_agreement":null},{"id":"W2401108363","doi":"","title":"Block Diagonalization Method for the Covering Graph.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Graph; Combinatorics","score_opus":0.020171086465542665,"score_gpt":0.3196195414713774,"score_spread":0.2994484550058347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401108363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020188572,0.0003957896,0.9436066,0.00034443743,0.00030298645,0.00008415804,0.00053039205,0.0010157271,0.033531465],"genre_scores_gemma":[0.2691083,0.0008160479,0.6716749,0.00038011002,0.00019988543,0.00038827612,0.0013772405,0.0010525977,0.0550027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998074,0.00004944022,0.000006265551,0.000034991925,0.00007349589,0.000028352193],"domain_scores_gemma":[0.9996362,0.00010638695,0.000024388692,0.000116832394,0.000089295674,0.000026889651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002255019,0.0003548996,0.0003169925,0.0008515583,0.00045666835,0.00048259387,0.0005226765,0.00042058967,0.015846752],"category_scores_gemma":[0.0011696272,0.00016995065,0.00034311428,0.0007455645,0.00046759917,0.00082260853,0.00069530006,0.00095383974,0.004430224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013234525,0.00012383977,0.0004965557,0.00025085628,0.000045331184,0.00012263792,0.00028122772,0.018872434,0.02341659,0.6320487,0.042441953,0.28176755],"study_design_scores_gemma":[0.00008334007,0.00009727037,0.000867209,0.00006792489,0.000039604904,0.00026427314,0.0001404089,0.3137677,0.014887456,0.5989335,0.07080779,0.000043642824],"about_ca_topic_score_codex":0.002525219,"about_ca_topic_score_gemma":0.0067491285,"teacher_disagreement_score":0.015846752,"about_ca_system_score_codex":0.00038905366,"about_ca_system_score_gemma":0.0006053125,"threshold_uncertainty_score":0.05301267},"labels":[],"label_agreement":null},{"id":"W2401130130","doi":"","title":"Sharp lower bounds on signed domination numbers of digraphs","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.022703947547692106,"score_gpt":0.28914195132592274,"score_spread":0.2664380037782306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401130130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43700054,0.0055074655,0.36351183,0.0065392256,0.00077531795,0.00023102976,0.0018991842,0.001389956,0.18314551],"genre_scores_gemma":[0.9145001,0.0029445193,0.05352588,0.0009863746,0.00079906173,0.0003897342,0.0012895366,0.00048148472,0.025083246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689496,0.0007129757,0.00017192039,0.00055805943,0.0010962534,0.0005657529],"domain_scores_gemma":[0.9579922,0.032973766,0.001959702,0.0023918075,0.0016180754,0.0030644475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031909447,0.0021900765,0.0018678175,0.00549496,0.0022637416,0.008267101,0.0045737647,0.0025615958,0.013381809],"category_scores_gemma":[0.03156014,0.0015206678,0.00138102,0.00444531,0.004419975,0.012271166,0.004729734,0.0076093934,0.0018843254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042964725,0.00019227184,0.00257446,0.00044130278,0.00007774295,0.00020862972,0.0006230074,0.03008523,0.005952576,0.91452074,0.007991986,0.036902223],"study_design_scores_gemma":[0.000047460686,0.00006556386,0.00088132604,0.00011546313,0.000058328722,0.0002084456,0.00012699334,0.06605842,0.0023884962,0.9257397,0.004259673,0.000050117098],"about_ca_topic_score_codex":0.0007275489,"about_ca_topic_score_gemma":0.0018988864,"teacher_disagreement_score":0.013381809,"about_ca_system_score_codex":0.004052434,"about_ca_system_score_gemma":0.0013468317,"threshold_uncertainty_score":0.044766605},"labels":[],"label_agreement":null},{"id":"W2401195966","doi":"","title":"On Equitable Coloring of Sun let Graph Families.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph coloring; Combinatorics; Graph","score_opus":0.024938220869828817,"score_gpt":0.287927573149643,"score_spread":0.2629893522798142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401195966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.400743,0.0012567844,0.34072402,0.0027031994,0.00042467573,0.0001440683,0.0009771349,0.00080449274,0.25222272],"genre_scores_gemma":[0.8774758,0.0011791626,0.06444605,0.00083660823,0.00030583335,0.00014886771,0.0012458854,0.0005403927,0.053821456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907494,0.0002908914,0.00003993321,0.00020064358,0.00018354376,0.00021012372],"domain_scores_gemma":[0.9964245,0.0017314185,0.00030247157,0.00065800676,0.00043612643,0.00044743263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010022608,0.00045780183,0.0006055918,0.0016205814,0.0033391612,0.0021190403,0.0010334728,0.000862563,0.016419958],"category_scores_gemma":[0.0052060923,0.00052735803,0.0006325976,0.0017863791,0.001870725,0.005868979,0.0021976775,0.0018022242,0.0013470075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067508896,0.000051281026,0.0008703324,0.000066453395,0.000011267051,0.00013100563,0.0004893225,0.0030400073,0.0010026592,0.9690718,0.006576415,0.018621868],"study_design_scores_gemma":[0.000010020128,0.000013110966,0.00041194865,0.00002619605,0.000010131369,0.00016552277,0.000312932,0.006848912,0.000578529,0.9829655,0.008647704,0.000009392817],"about_ca_topic_score_codex":0.0023918366,"about_ca_topic_score_gemma":0.004947629,"teacher_disagreement_score":0.016419958,"about_ca_system_score_codex":0.0017736533,"about_ca_system_score_gemma":0.0006298729,"threshold_uncertainty_score":0.05493021},"labels":[],"label_agreement":null},{"id":"W2401251957","doi":"","title":"Enumeration for no-trivial spanning forests of complete bipartite graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Enumeration; Combinatorics; Spanning tree; Discrete mathematics; Graph","score_opus":0.02250903153387597,"score_gpt":0.2956067320429401,"score_spread":0.2730977005090641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401251957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22390302,0.002184919,0.6550946,0.0035191064,0.00040136557,0.0002479488,0.002964093,0.0014872547,0.11019766],"genre_scores_gemma":[0.74655294,0.0014130058,0.20845948,0.00093381107,0.0003444836,0.0003068398,0.005737521,0.00044698478,0.0358049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990453,0.00031617758,0.000065703185,0.00018115558,0.00021683802,0.00017473525],"domain_scores_gemma":[0.99586356,0.00267993,0.0002742983,0.0005665042,0.00032927474,0.0002862901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007649004,0.0004679122,0.0005941939,0.0012088756,0.0013944854,0.0020985233,0.0013965134,0.0011954068,0.011343973],"category_scores_gemma":[0.0072664986,0.0005566879,0.00084686506,0.0015409008,0.0009599087,0.004618731,0.0018768231,0.0019751687,0.001985425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022854017,0.00025354067,0.0024932048,0.00062560826,0.0000642329,0.00035904118,0.0005288135,0.011370503,0.004683867,0.82117546,0.029023727,0.12919348],"study_design_scores_gemma":[0.000021850587,0.000018083118,0.00049436965,0.000058671943,0.000024309602,0.00036384963,0.00014405417,0.029667346,0.0010635207,0.96159756,0.0065347473,0.000011598508],"about_ca_topic_score_codex":0.0008405029,"about_ca_topic_score_gemma":0.0024903433,"teacher_disagreement_score":0.011343973,"about_ca_system_score_codex":0.00065226085,"about_ca_system_score_gemma":0.0007271646,"threshold_uncertainty_score":0.037949443},"labels":[],"label_agreement":null},{"id":"W2401403958","doi":"","title":"Upper embeddable graphs via the degree-sum of adjacent vertices.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Physics","score_opus":0.021763697373662544,"score_gpt":0.27377275107005056,"score_spread":0.25200905369638804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401403958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3661561,0.0011927331,0.42800558,0.0013322913,0.00037616686,0.000092845636,0.00094356097,0.000929418,0.20097132],"genre_scores_gemma":[0.857923,0.00086645805,0.08774688,0.0003911253,0.00024208876,0.0000915317,0.0009190783,0.00040299442,0.05141679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992525,0.00014461209,0.000038209208,0.00018172077,0.00024431455,0.00013856425],"domain_scores_gemma":[0.99770963,0.0012042888,0.00024216066,0.00047666146,0.00014378117,0.00022350434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041759314,0.0007554902,0.00061141106,0.0014784856,0.0012107793,0.0027632115,0.0014429773,0.00089566177,0.014354461],"category_scores_gemma":[0.0035936402,0.000624085,0.00058932055,0.0012790863,0.0015018437,0.004972913,0.0029482057,0.0024153292,0.0023697002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012559538,0.000094304625,0.00078175357,0.0001012996,0.000025930161,0.0003366599,0.00046149222,0.010283333,0.0072256476,0.9303758,0.0045580086,0.045630146],"study_design_scores_gemma":[0.000014526859,0.000025094823,0.00061281567,0.000037133505,0.000030382496,0.00028802254,0.00013400374,0.020127533,0.0035169101,0.9664991,0.008699063,0.000015321619],"about_ca_topic_score_codex":0.0006728496,"about_ca_topic_score_gemma":0.0017939943,"teacher_disagreement_score":0.014354461,"about_ca_system_score_codex":0.0007216608,"about_ca_system_score_gemma":0.00026627877,"threshold_uncertainty_score":0.048020482},"labels":[],"label_agreement":null},{"id":"W2401454933","doi":"","title":"Up-embeddability and independent number of simple graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Combinatorics; Discrete mathematics","score_opus":0.02679606737701527,"score_gpt":0.2976182622539376,"score_spread":0.27082219487692233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401454933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7488613,0.0014256954,0.097615786,0.0016065319,0.00029230487,0.000084762614,0.0008217908,0.00041281903,0.14887908],"genre_scores_gemma":[0.9789601,0.0004683764,0.0080875335,0.00012210595,0.0001861643,0.000042249507,0.00048053425,0.00006396817,0.011589058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993474,0.0001389832,0.000035078676,0.00017421214,0.00018297942,0.000121382946],"domain_scores_gemma":[0.9938114,0.003563956,0.0008923666,0.0007559172,0.00032882477,0.0006475645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048621112,0.0004363552,0.00053681544,0.0018578714,0.0014067468,0.0026684033,0.0010098352,0.0007265893,0.010189972],"category_scores_gemma":[0.0057279514,0.00048082884,0.00060599775,0.0013229764,0.0027139927,0.0049322904,0.0019007716,0.0020175944,0.00097264955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016289069,0.00010413894,0.0032644786,0.0001457199,0.00003896397,0.0003587334,0.00046471346,0.002907942,0.004272841,0.95682746,0.0037878025,0.027664395],"study_design_scores_gemma":[0.00002444748,0.000028776354,0.0025153852,0.000023606464,0.00003260922,0.0004631,0.00015554317,0.0054033888,0.003086812,0.9844861,0.003765014,0.000015225877],"about_ca_topic_score_codex":0.00043986726,"about_ca_topic_score_gemma":0.0007273919,"teacher_disagreement_score":0.010189972,"about_ca_system_score_codex":0.000639108,"about_ca_system_score_gemma":0.00030832278,"threshold_uncertainty_score":0.03408891},"labels":[],"label_agreement":null},{"id":"W2401456693","doi":"","title":"On the Crossing Numbers of the k-th Power of P n .","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Path (computing); Graph; Crossing number (knot theory); Join (topology); Discrete mathematics","score_opus":0.013496781498378328,"score_gpt":0.27951284807187704,"score_spread":0.2660160665734987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401456693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65262216,0.003733759,0.16916654,0.0012845708,0.0005651607,0.00011453567,0.0007103443,0.00032430675,0.17147867],"genre_scores_gemma":[0.93405086,0.0019865287,0.053492792,0.00017214096,0.00019426599,0.00009680243,0.00038213516,0.0001486696,0.00947578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905187,0.00024208718,0.00004532168,0.00023870019,0.00023914725,0.00018277585],"domain_scores_gemma":[0.9960807,0.0024600748,0.0005650253,0.00029995007,0.00025887662,0.0003354948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010444352,0.00066187343,0.00036286513,0.0018594594,0.00093494926,0.002244338,0.0007580175,0.0007149881,0.010346954],"category_scores_gemma":[0.008621736,0.00040641363,0.0003115352,0.0017266169,0.0016090478,0.0036471288,0.0009265159,0.0014573421,0.0012421368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006298013,0.000115246134,0.0054009114,0.00025891338,0.000055643042,0.0004741925,0.0005312388,0.040848516,0.013537943,0.81326807,0.009667721,0.11521172],"study_design_scores_gemma":[0.00007722987,0.00022744888,0.0059210956,0.000168618,0.000074295975,0.0014086997,0.00047335593,0.076825246,0.01175106,0.8740334,0.028957814,0.0000817789],"about_ca_topic_score_codex":0.00046460395,"about_ca_topic_score_gemma":0.0007260754,"teacher_disagreement_score":0.010346954,"about_ca_system_score_codex":0.0011694863,"about_ca_system_score_gemma":0.0003890351,"threshold_uncertainty_score":0.034613967},"labels":[],"label_agreement":null},{"id":"W2401458535","doi":"","title":"Quasi-tree graphs with the second largest number of maximal independent sets.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics; Discrete mathematics","score_opus":0.009570758433077683,"score_gpt":0.2655886262805301,"score_spread":0.2560178678474524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401458535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5754211,0.002695558,0.29184133,0.0045462325,0.0006672152,0.00019067495,0.00714433,0.0012192784,0.11627423],"genre_scores_gemma":[0.9007427,0.00074352376,0.07418035,0.0007525362,0.00029695648,0.00015065305,0.0027360853,0.0002468125,0.020150349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994791,0.00014422175,0.000028262557,0.00011878233,0.000119084936,0.000110689216],"domain_scores_gemma":[0.99450547,0.0030911418,0.0006522856,0.0006498442,0.0005053931,0.0005958547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007173322,0.00033615934,0.0005948693,0.0010812588,0.0013318355,0.0024632062,0.0008896005,0.0011244869,0.009705295],"category_scores_gemma":[0.004773498,0.00057605334,0.0005542345,0.0010896081,0.0010528894,0.0036366517,0.0009040414,0.0012781493,0.0011562929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003010881,0.00007601462,0.0021802774,0.00021741127,0.00004962108,0.00037739292,0.00019204362,0.0029719844,0.01293885,0.9492455,0.0135974735,0.01785224],"study_design_scores_gemma":[0.000081148,0.00006510639,0.0041026683,0.00006298291,0.000071178125,0.0014661083,0.00021229686,0.019939909,0.0056756428,0.9524505,0.015841302,0.000031141357],"about_ca_topic_score_codex":0.0006872824,"about_ca_topic_score_gemma":0.001631441,"teacher_disagreement_score":0.009705295,"about_ca_system_score_codex":0.0008646618,"about_ca_system_score_gemma":0.00080149755,"threshold_uncertainty_score":0.032467484},"labels":[],"label_agreement":null},{"id":"W2401704331","doi":"","title":"[a, b]-factors With Given Edges In Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.019172001908479938,"score_gpt":0.26158656298563204,"score_spread":0.2424145610771521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401704331","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25509316,0.004557028,0.35845393,0.0035421057,0.0022261874,0.00029391295,0.0027820792,0.0035769138,0.36947468],"genre_scores_gemma":[0.74036527,0.002429143,0.14888367,0.0015568414,0.0005596529,0.00026201253,0.0027061307,0.0013255129,0.101911716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998814,0.00033258408,0.00007647895,0.00036111943,0.00017629514,0.00023958035],"domain_scores_gemma":[0.9978054,0.00079876767,0.0002644323,0.00035805537,0.00038178317,0.00039151247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007806092,0.00087669975,0.0006629574,0.0018355977,0.0031270327,0.003325739,0.0010603237,0.0017887172,0.020183707],"category_scores_gemma":[0.0040408475,0.00079958624,0.0010203826,0.0023612878,0.0021068538,0.0053407424,0.0019087173,0.0017456473,0.006091167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024781984,0.00009550736,0.0011265125,0.00018518575,0.000055198194,0.00041698877,0.0007262654,0.0007158122,0.0038913337,0.94759977,0.016225325,0.028714467],"study_design_scores_gemma":[0.00003311889,0.000030414854,0.00061020633,0.00009357781,0.000045685938,0.00047005422,0.00043898207,0.0018505178,0.0020929505,0.942128,0.052176084,0.00003039734],"about_ca_topic_score_codex":0.0030629393,"about_ca_topic_score_gemma":0.0041234535,"teacher_disagreement_score":0.020183707,"about_ca_system_score_codex":0.0008788837,"about_ca_system_score_gemma":0.00070136855,"threshold_uncertainty_score":0.067521214},"labels":[],"label_agreement":null},{"id":"W2401767591","doi":"","title":"A sufficient condition for a toroidal graph to be 3-choosable.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toroid; Graph; Combinatorics; Physics; Plasma; Quantum mechanics","score_opus":0.026195673508615798,"score_gpt":0.309235088491795,"score_spread":0.2830394149831792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401767591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60669655,0.0010837308,0.13772118,0.007564416,0.0023076383,0.00075327023,0.017512051,0.0041694753,0.22219162],"genre_scores_gemma":[0.9411531,0.0005236319,0.033987656,0.00120245,0.00037611235,0.00038677934,0.009790569,0.0003870609,0.01219272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988833,0.00011305042,0.00012866758,0.00032301986,0.00018063682,0.00037124727],"domain_scores_gemma":[0.99077356,0.0047842776,0.00086597673,0.0008078121,0.0011790274,0.0015892624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007512132,0.0006562862,0.0013267309,0.0009750048,0.0022639828,0.002221421,0.001231864,0.00279663,0.033600017],"category_scores_gemma":[0.008233099,0.0009252002,0.0014757034,0.00090599887,0.0020001621,0.0037229748,0.0019353651,0.0029914563,0.0068772873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032034384,0.0007606269,0.010844279,0.0020487562,0.000231951,0.007761698,0.001677228,0.015396402,0.12461269,0.7434459,0.0582565,0.031760655],"study_design_scores_gemma":[0.0010009967,0.000859626,0.012097781,0.00048988976,0.00029017785,0.006539449,0.0031441082,0.031645156,0.066327535,0.79893047,0.07826834,0.0004064351],"about_ca_topic_score_codex":0.0021912686,"about_ca_topic_score_gemma":0.004248537,"teacher_disagreement_score":0.033600017,"about_ca_system_score_codex":0.0007973843,"about_ca_system_score_gemma":0.0019220611,"threshold_uncertainty_score":0.112403214},"labels":[],"label_agreement":null},{"id":"W2401787488","doi":"","title":"On The Average Crosscap Number Of A Graph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.013550550745601516,"score_gpt":0.2768355687554542,"score_spread":0.26328501800985266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401787488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69922394,0.0067126127,0.17307498,0.0044908742,0.0010852686,0.00008637918,0.0045727063,0.0014993198,0.109253936],"genre_scores_gemma":[0.95547783,0.0026178441,0.026007684,0.0005110645,0.00092980854,0.00013921794,0.001867502,0.00063432415,0.011814676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986205,0.0003660337,0.000052730244,0.0004404664,0.00027011932,0.00025013922],"domain_scores_gemma":[0.9778031,0.015060626,0.001871668,0.0021346705,0.0011896389,0.0019402503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018242082,0.0011731442,0.0013118258,0.0047039343,0.0017455826,0.0030562792,0.0028070856,0.002064026,0.016461357],"category_scores_gemma":[0.018877368,0.0007389903,0.00070204696,0.0033588635,0.0024220713,0.00961931,0.002059064,0.0025134317,0.0020158102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009021499,0.00025625897,0.012712669,0.000748631,0.00026241317,0.0004032154,0.00044245878,0.121167175,0.010095176,0.72958666,0.04242284,0.081000336],"study_design_scores_gemma":[0.00005981961,0.00017941458,0.007333171,0.0001635668,0.00014694818,0.0010921048,0.00031550133,0.26267332,0.0054077776,0.7100843,0.012451152,0.00009283066],"about_ca_topic_score_codex":0.0014643527,"about_ca_topic_score_gemma":0.002241319,"teacher_disagreement_score":0.016461357,"about_ca_system_score_codex":0.0018965707,"about_ca_system_score_gemma":0.00066606567,"threshold_uncertainty_score":0.05506867},"labels":[],"label_agreement":null},{"id":"W2401867789","doi":"","title":"On k-connected restrained domination in graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.025865712801062674,"score_gpt":0.2704484851857391,"score_spread":0.24458277238467643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401867789","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51894593,0.0034985712,0.25280842,0.0044483608,0.00036126203,0.00019236619,0.0011889657,0.0008633744,0.21769267],"genre_scores_gemma":[0.9430001,0.001658626,0.024327334,0.0007740973,0.0003101419,0.00014294493,0.0007431557,0.00018952647,0.028854096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988489,0.0003309138,0.000063872445,0.00023694111,0.00026756592,0.00025178675],"domain_scores_gemma":[0.9944641,0.0035057415,0.0005524971,0.0005918944,0.00039127877,0.0004945104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087930745,0.0005844017,0.0008414905,0.002254952,0.002474235,0.0021464508,0.0016411594,0.00134637,0.010169269],"category_scores_gemma":[0.0056962064,0.0005337084,0.00081188796,0.0028684444,0.0033881583,0.005627529,0.0032306814,0.0024441413,0.0013653252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014275804,0.00006445645,0.0015486776,0.0002496092,0.000053996708,0.000605509,0.0013291402,0.009495594,0.0021357303,0.95052946,0.0067968657,0.027048057],"study_design_scores_gemma":[0.000020199128,0.000013923375,0.00058985595,0.000037842787,0.00001933993,0.00036133968,0.00021562407,0.012023672,0.00054774864,0.9818792,0.0042765597,0.000014818219],"about_ca_topic_score_codex":0.0025733367,"about_ca_topic_score_gemma":0.0034558927,"teacher_disagreement_score":0.010169269,"about_ca_system_score_codex":0.0015514909,"about_ca_system_score_gemma":0.00058680924,"threshold_uncertainty_score":0.03401959},"labels":[],"label_agreement":null},{"id":"W2402028350","doi":"","title":"A Neighborhood Condition for Graphs to Have (g, f)-Factors.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01911855302737888,"score_gpt":0.304653859299141,"score_spread":0.28553530627176216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402028350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56853557,0.0019259471,0.1624044,0.0059789824,0.0012783975,0.00030282198,0.0033902181,0.001524173,0.25465962],"genre_scores_gemma":[0.9410423,0.00049180567,0.037155025,0.00076433184,0.00041764844,0.00030426207,0.0017532669,0.00026895505,0.017802482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917763,0.0001695284,0.00006576128,0.00029157207,0.00014245149,0.00015307598],"domain_scores_gemma":[0.9948384,0.0025227803,0.00039545505,0.0006343234,0.00069798465,0.0009109911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069725723,0.00031048083,0.00083658163,0.0008159979,0.0031272306,0.0017210796,0.0010265069,0.0023600098,0.0149427615],"category_scores_gemma":[0.0095231505,0.00048709507,0.00075435464,0.00058315316,0.0017394364,0.0046423837,0.0019763787,0.001764431,0.002387526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006178321,0.00015121831,0.0040207417,0.00021376328,0.000031619034,0.0009438283,0.001008335,0.001903506,0.011096104,0.93391985,0.02312465,0.022968562],"study_design_scores_gemma":[0.00023091343,0.00021324903,0.0036472364,0.00013494905,0.00006911848,0.0021409765,0.0016902875,0.011296139,0.0076250103,0.9377632,0.03510623,0.000082593295],"about_ca_topic_score_codex":0.0021270127,"about_ca_topic_score_gemma":0.00282219,"teacher_disagreement_score":0.0149427615,"about_ca_system_score_codex":0.0006524825,"about_ca_system_score_gemma":0.00081059587,"threshold_uncertainty_score":0.04998851},"labels":[],"label_agreement":null},{"id":"W2402036020","doi":"","title":"On competition polysemy and m-competition polysemy.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polysemy; Competition (biology); Mathematics; Characterization (materials science); Combinatorics; Graph; Competition model; Linguistics; Philosophy; Biology; Political science; Physics","score_opus":0.009342753128615452,"score_gpt":0.2652600831487611,"score_spread":0.25591733002014566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402036020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23614813,0.010868469,0.5362393,0.006690192,0.0011876454,0.00032879473,0.0019332506,0.0005550595,0.20604917],"genre_scores_gemma":[0.9000184,0.0037078941,0.06780438,0.0022677297,0.001106053,0.0003341125,0.0014277588,0.00027620597,0.023057528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775034,0.000617061,0.00017994392,0.0007023655,0.00044359994,0.00030666875],"domain_scores_gemma":[0.9928964,0.003865776,0.0007968488,0.0010372178,0.0008598694,0.00054397195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017910294,0.0011245827,0.0009570308,0.0030875162,0.0036324556,0.0023229038,0.0011574279,0.0018647629,0.010070716],"category_scores_gemma":[0.008378623,0.0008173278,0.0013946613,0.003368821,0.006285507,0.013720319,0.004608935,0.003281529,0.0012726311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006189117,0.000027267757,0.0006381423,0.00013411169,0.000022864753,0.00026055143,0.0007571218,0.0011491914,0.0013113988,0.9845924,0.0020244487,0.009020645],"study_design_scores_gemma":[0.0000142773115,0.000048073427,0.00093678996,0.00006134435,0.00002743052,0.0005813276,0.00032872142,0.0046913503,0.0007995096,0.9778618,0.014614287,0.00003502196],"about_ca_topic_score_codex":0.0014655363,"about_ca_topic_score_gemma":0.0016679849,"teacher_disagreement_score":0.010070716,"about_ca_system_score_codex":0.0019292415,"about_ca_system_score_gemma":0.000661427,"threshold_uncertainty_score":0.033689857},"labels":[],"label_agreement":null},{"id":"W2402115169","doi":"","title":"Path Extendability and Degree Sum in Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Path (computing); Discrete mathematics; Computer science; Computer network; Physics","score_opus":0.04391162493109703,"score_gpt":0.2983913215405891,"score_spread":0.2544796966094921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402115169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53059036,0.0036443172,0.28914234,0.0040625883,0.00055228325,0.00007935638,0.0010223485,0.0004953547,0.17041108],"genre_scores_gemma":[0.94649744,0.0020859651,0.027759427,0.0003997116,0.0006363269,0.00007115623,0.00061310304,0.00014649979,0.021790348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990557,0.00022415555,0.000059260306,0.00029111753,0.0002258968,0.00014385411],"domain_scores_gemma":[0.9958118,0.0024105504,0.0004718519,0.000556332,0.0002902664,0.00045916764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086654554,0.0005482012,0.0006940329,0.001956773,0.0014925423,0.0023560813,0.0011321306,0.0007216336,0.0072685145],"category_scores_gemma":[0.0053585083,0.00043148588,0.00077713863,0.0022503424,0.002759198,0.00830101,0.0028766105,0.0027573158,0.0007981992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000460477,0.00003057555,0.0010490507,0.00008500127,0.000019438741,0.00013162052,0.0003520189,0.0022001874,0.0011622298,0.97417384,0.0016449053,0.01910519],"study_design_scores_gemma":[0.000005020752,0.0000094154,0.00048323208,0.000015027698,0.000014969596,0.00021183773,0.00008219675,0.002544523,0.00048428282,0.9930682,0.0030743608,0.000006869881],"about_ca_topic_score_codex":0.0007186658,"about_ca_topic_score_gemma":0.0010322788,"teacher_disagreement_score":0.0072685145,"about_ca_system_score_codex":0.00077912246,"about_ca_system_score_gemma":0.00035568402,"threshold_uncertainty_score":0.024315596},"labels":[],"label_agreement":null},{"id":"W2402131518","doi":"","title":"On the index of quasi-tree graphs with perfect matchings.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Tree (set theory); Computer science","score_opus":0.020114682710685113,"score_gpt":0.2650000639831325,"score_spread":0.24488538127244736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402131518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62095535,0.0050091944,0.1653399,0.004068648,0.0011386634,0.00014512047,0.0024264671,0.00097643817,0.19994023],"genre_scores_gemma":[0.93799275,0.0022574072,0.030528607,0.00070729194,0.00082016084,0.00012043224,0.0012615692,0.00043213135,0.025879709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923456,0.00017830683,0.000052407864,0.00013201649,0.00021375403,0.00018896641],"domain_scores_gemma":[0.9943562,0.0028447714,0.0009642929,0.0005419613,0.0005279487,0.00076478336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010498116,0.00044908893,0.0010429373,0.0031837258,0.0018922674,0.0041621905,0.0016355912,0.0013968346,0.009959731],"category_scores_gemma":[0.007873376,0.0005026363,0.0005114002,0.002621885,0.0017930288,0.008560948,0.002141174,0.0016534807,0.0018930978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017613474,0.00004970454,0.0008229114,0.00009711744,0.000013893445,0.00011546683,0.00028122694,0.0021027944,0.0017947077,0.9751951,0.0063045486,0.013046371],"study_design_scores_gemma":[0.000028325117,0.000033099124,0.0006290027,0.000052585852,0.000021231695,0.00024813152,0.00016259491,0.01308382,0.0009266486,0.97781014,0.006987103,0.000017292617],"about_ca_topic_score_codex":0.0012260006,"about_ca_topic_score_gemma":0.0015842913,"teacher_disagreement_score":0.009959731,"about_ca_system_score_codex":0.0019666606,"about_ca_system_score_gemma":0.00083185436,"threshold_uncertainty_score":0.03331858},"labels":[],"label_agreement":null},{"id":"W2402247018","doi":"","title":"On the sum of out-domination number and in-domination number of digraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Graph","score_opus":0.024210418008993297,"score_gpt":0.30581729691435144,"score_spread":0.2816068789053581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402247018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53103954,0.008533563,0.26426598,0.0055029583,0.0010279801,0.00017737394,0.004130753,0.00073005806,0.18459176],"genre_scores_gemma":[0.9457732,0.0025566001,0.034201372,0.0005054126,0.0009264856,0.00017702559,0.0011407323,0.0002397446,0.014479369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769753,0.00078336196,0.00015426238,0.000468151,0.0005554452,0.0003412305],"domain_scores_gemma":[0.9724439,0.021530293,0.0015776592,0.0014466097,0.001271803,0.001729799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00277518,0.0010770382,0.0015493917,0.0047847265,0.0018318658,0.0040839114,0.0026440197,0.0013879581,0.010092597],"category_scores_gemma":[0.02048631,0.00071931706,0.0007383656,0.0037532272,0.0027574808,0.010937797,0.0024013768,0.0025857834,0.0010458141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041055452,0.00016840338,0.008074687,0.00056583656,0.00020976915,0.00025938058,0.0005141254,0.030479332,0.0033842179,0.87378204,0.01917097,0.062980756],"study_design_scores_gemma":[0.00003823166,0.000078509154,0.00368555,0.00013679826,0.00015687902,0.00076982606,0.00021334793,0.07187816,0.001972648,0.91182595,0.009189747,0.000054371896],"about_ca_topic_score_codex":0.00091574644,"about_ca_topic_score_gemma":0.0015092044,"teacher_disagreement_score":0.010092597,"about_ca_system_score_codex":0.0023222808,"about_ca_system_score_gemma":0.00083013915,"threshold_uncertainty_score":0.03376305},"labels":[],"label_agreement":null},{"id":"W2402311781","doi":"","title":"Edge-colorings of complete bipartite graphs without large rainbow trees.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Bipartite graph; Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Edge coloring; Discrete mathematics; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.021036747929879997,"score_gpt":0.2709517347338764,"score_spread":0.2499149868039964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402311781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65757215,0.0010747008,0.22295366,0.001781672,0.00040044234,0.0002001241,0.0030227867,0.0015304231,0.11146402],"genre_scores_gemma":[0.9145354,0.0003914277,0.059229795,0.0004388057,0.00012810984,0.00011298098,0.0018388983,0.000412357,0.022912255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935013,0.00021882249,0.00003682368,0.00013870088,0.00011245856,0.00014305992],"domain_scores_gemma":[0.9953884,0.0023073552,0.00057799806,0.00073920656,0.00040569252,0.0005813506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007343234,0.0004831911,0.000526449,0.0009994835,0.0015653499,0.001937057,0.0013203324,0.0011011217,0.010147554],"category_scores_gemma":[0.0055016037,0.00078035414,0.00062875525,0.0010976414,0.001255726,0.0025873184,0.0013057092,0.0014486298,0.0012971282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040984983,0.00017956553,0.0028323282,0.0002703486,0.000062129315,0.0005651746,0.0003630412,0.016344523,0.008524467,0.92372245,0.021168273,0.025557805],"study_design_scores_gemma":[0.0000861678,0.0000459265,0.0016056232,0.000056716795,0.000033198354,0.00041972514,0.00022237714,0.0404453,0.0022099798,0.9483072,0.0065440675,0.000023721652],"about_ca_topic_score_codex":0.0015824655,"about_ca_topic_score_gemma":0.0036102626,"teacher_disagreement_score":0.010147554,"about_ca_system_score_codex":0.0009805298,"about_ca_system_score_gemma":0.0007264502,"threshold_uncertainty_score":0.03394693},"labels":[],"label_agreement":null},{"id":"W2402386276","doi":"","title":"Resolvably Decomposing Complete Equipartite Graphs Minus a One-Factor into Cycles of Uniform Even Length.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factor (programming language); Combinatorics; Discrete mathematics; Computer science","score_opus":0.03150782474623839,"score_gpt":0.28791442364979214,"score_spread":0.2564065989035538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402386276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3871463,0.0010976054,0.45344338,0.0011070631,0.0004334561,0.00032238182,0.0014990595,0.0015123695,0.15343846],"genre_scores_gemma":[0.828134,0.0009057307,0.12098657,0.0007615878,0.00026294054,0.00018138735,0.00287011,0.00092123053,0.044976525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994486,0.000109249406,0.000028130795,0.00013222774,0.00012735963,0.00015442086],"domain_scores_gemma":[0.9981244,0.0006731594,0.00016686146,0.00056636473,0.00021067169,0.0002585394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044560118,0.0006978183,0.0004401151,0.0008340529,0.0011260804,0.0019527319,0.0010905868,0.00082580897,0.01443664],"category_scores_gemma":[0.0027179047,0.00048632536,0.0008788142,0.0008110594,0.001413406,0.0038706667,0.0022205135,0.0026003516,0.002546368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004959712,0.0002166305,0.00062338996,0.0002924672,0.00004946618,0.0005167283,0.0008954691,0.007933088,0.019791769,0.87387025,0.011120591,0.08419421],"study_design_scores_gemma":[0.00004718926,0.00007248522,0.00039704444,0.000056391822,0.0000376882,0.00033216807,0.00029465652,0.010676146,0.007389901,0.9640649,0.016602077,0.00002944575],"about_ca_topic_score_codex":0.0010889714,"about_ca_topic_score_gemma":0.0022446935,"teacher_disagreement_score":0.01443664,"about_ca_system_score_codex":0.0005598862,"about_ca_system_score_gemma":0.0006901957,"threshold_uncertainty_score":0.04829532},"labels":[],"label_agreement":null},{"id":"W2402410623","doi":"","title":"Domination number in iterated line digraph of a complete bipartite digraph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Iterated function; Bipartite graph; Combinatorics; Line (geometry); Discrete mathematics; Graph","score_opus":0.024745808959017738,"score_gpt":0.300256535776357,"score_spread":0.2755107268173393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402410623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8621856,0.0005018184,0.06736625,0.00058990583,0.000058630416,0.00004813098,0.000935466,0.00019567195,0.06811865],"genre_scores_gemma":[0.98571324,0.00019404668,0.006797497,0.000048386315,0.000030863255,0.0000409791,0.0002742009,0.000021176795,0.0068794903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996885,0.00008619463,0.000015216257,0.00007440483,0.0000606669,0.00007504461],"domain_scores_gemma":[0.9977192,0.0013169961,0.0002584791,0.000117261174,0.00021159656,0.00037642644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031016042,0.00019850608,0.00030688258,0.0013369642,0.00091388804,0.0015298256,0.00058835105,0.00050279684,0.006555319],"category_scores_gemma":[0.0022390245,0.0001750435,0.00020914078,0.00069079787,0.0006830778,0.0016031287,0.00050803105,0.0005273623,0.0003793294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002805382,0.00009960356,0.00817723,0.00022535773,0.000055576158,0.00052972534,0.0008047471,0.01898949,0.011605695,0.9176638,0.0071005174,0.034467682],"study_design_scores_gemma":[0.000076475386,0.000105303385,0.0076623224,0.000086511645,0.00007200509,0.0010630713,0.00050921075,0.1599506,0.0057613547,0.8120046,0.012655559,0.00005301712],"about_ca_topic_score_codex":0.0012320611,"about_ca_topic_score_gemma":0.0020229656,"teacher_disagreement_score":0.006555319,"about_ca_system_score_codex":0.0010442596,"about_ca_system_score_gemma":0.00039737238,"threshold_uncertainty_score":0.02192974},"labels":[],"label_agreement":null},{"id":"W2402469379","doi":"","title":"On the Surface Areas of the Alternating Group Graph and the Split-Star Graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Graph; Combinatorics; Voltage graph; Coxeter graph; Line graph; Mathematical analysis","score_opus":0.011484713832612558,"score_gpt":0.244929003647124,"score_spread":0.23344428981451143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402469379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57347363,0.0037250607,0.10680467,0.004086371,0.00060686545,0.000073818555,0.00064803095,0.00038479606,0.31019673],"genre_scores_gemma":[0.9519435,0.0016917272,0.0148498155,0.00040082782,0.0007574633,0.00006795548,0.00046285894,0.00022416767,0.029601594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997212,0.00009802481,0.000008905158,0.000051211446,0.00006906958,0.000051399966],"domain_scores_gemma":[0.9986615,0.00065951573,0.00019377565,0.000113379196,0.0001501154,0.00022163412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003769698,0.0005378571,0.0005091162,0.0018931465,0.00089706626,0.0015977055,0.0008769283,0.00087063946,0.013505816],"category_scores_gemma":[0.0029463698,0.00030420642,0.00042114974,0.00093605,0.0022053104,0.00418998,0.0016057955,0.001444643,0.0019720662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000401815,0.000016725719,0.00041564638,0.000034699522,0.000006612775,0.00006264914,0.00015297536,0.0019459026,0.00082514493,0.9825632,0.0030953817,0.010840882],"study_design_scores_gemma":[0.0000094311945,0.000009883769,0.000472602,0.000011237888,0.0000045669476,0.000095615105,0.00010115421,0.00664372,0.00023399212,0.98897356,0.0034389729,0.0000052463874],"about_ca_topic_score_codex":0.0011558271,"about_ca_topic_score_gemma":0.0014603017,"teacher_disagreement_score":0.013505816,"about_ca_system_score_codex":0.00057447836,"about_ca_system_score_gemma":0.00026756572,"threshold_uncertainty_score":0.045181453},"labels":[],"label_agreement":null},{"id":"W2402601247","doi":"","title":"A lower bound for 2-rainbow domination number of generalized Petersen graphs P(n, 3).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rainbow; Combinatorics; Domination analysis; Graph; Physics","score_opus":0.028371979712307385,"score_gpt":0.29753301196464027,"score_spread":0.2691610322523329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402601247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44344378,0.010947468,0.20168,0.009194937,0.0014241416,0.00040704035,0.006794929,0.0021991627,0.32390863],"genre_scores_gemma":[0.9103446,0.003848354,0.056071877,0.0010470414,0.0007338492,0.0004953596,0.003223417,0.00044074244,0.023794744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854374,0.00018650765,0.000056720306,0.000345172,0.00043598496,0.00043190285],"domain_scores_gemma":[0.9942934,0.003898684,0.00033687998,0.00057788385,0.00028799928,0.0006051465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014026178,0.0013412131,0.0011871753,0.0027524554,0.0025568292,0.0035745474,0.0032109926,0.0018298484,0.018847546],"category_scores_gemma":[0.0073933075,0.0006369787,0.001114846,0.0027259365,0.0019050166,0.0063674217,0.0030977598,0.0036039453,0.0031138107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016580382,0.0006004015,0.008014486,0.0022399928,0.0003549355,0.0008862179,0.0011178328,0.059648685,0.039567664,0.69834197,0.080206804,0.107363045],"study_design_scores_gemma":[0.00014068968,0.00022327963,0.006773044,0.00028935162,0.00028895523,0.0012833632,0.0003749296,0.10998997,0.015930962,0.8203463,0.04421249,0.0001466088],"about_ca_topic_score_codex":0.0011790735,"about_ca_topic_score_gemma":0.0027672576,"teacher_disagreement_score":0.018847546,"about_ca_system_score_codex":0.0025342216,"about_ca_system_score_gemma":0.0012395032,"threshold_uncertainty_score":0.06305134},"labels":[],"label_agreement":null},{"id":"W2402605984","doi":"","title":"Fractional incidence coloring and star arboricity of graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Edge coloring; Star (game theory); Combinatorics; Graph; Planar graph; Mathematical analysis; Line graph","score_opus":0.020157839940887285,"score_gpt":0.28700055136077607,"score_spread":0.2668427114198888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402605984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63247967,0.0020158084,0.1798823,0.002670133,0.00052682863,0.000050766906,0.0005527475,0.00043810348,0.18138368],"genre_scores_gemma":[0.966743,0.0008158029,0.015743228,0.00023076826,0.00023109466,0.000026479027,0.0003394834,0.00005973882,0.01581038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973434,0.000066639084,0.00001247375,0.00005686554,0.0000563243,0.00007328699],"domain_scores_gemma":[0.9985594,0.0007595012,0.00019971574,0.00018565521,0.00014217259,0.00015360609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028914487,0.00026207886,0.00030691066,0.0008926186,0.0011261018,0.0014223596,0.00047359872,0.0005318573,0.005688107],"category_scores_gemma":[0.0026083407,0.00024023757,0.00035463882,0.0010822807,0.0013125282,0.0018854799,0.000683648,0.0010653625,0.00052962534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008547348,0.000050083698,0.0013658917,0.000052385098,0.00001028819,0.0001885264,0.0002442707,0.0048556747,0.0032617417,0.96495616,0.0045516724,0.020377899],"study_design_scores_gemma":[0.000013419989,0.000016303764,0.00076758076,0.000015834341,0.0000118856315,0.00023121209,0.00013725724,0.017390002,0.0014595074,0.9727912,0.007158482,0.000007216766],"about_ca_topic_score_codex":0.0022790062,"about_ca_topic_score_gemma":0.0032875328,"teacher_disagreement_score":0.005688107,"about_ca_system_score_codex":0.0009072078,"about_ca_system_score_gemma":0.00045545,"threshold_uncertainty_score":0.019028604},"labels":[],"label_agreement":null},{"id":"W2402639370","doi":"","title":"The Hamiltonian number of graphs with prescribed connectivity.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Mathematical optimization","score_opus":0.01062008269438518,"score_gpt":0.27046130490837533,"score_spread":0.25984122221399014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402639370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72091174,0.002175407,0.081079535,0.00410331,0.0007116184,0.0000914246,0.0020581672,0.0005171543,0.18835177],"genre_scores_gemma":[0.9835015,0.0006567041,0.0063875522,0.00018377324,0.00019310565,0.000075758406,0.00043945378,0.00008428216,0.00847779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963284,0.00012839651,0.000014385041,0.00006382852,0.00008772572,0.000072757975],"domain_scores_gemma":[0.9968696,0.0017714915,0.00046391305,0.00024315131,0.00019760014,0.00045418588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042893566,0.00032823894,0.00031574018,0.0018594958,0.0008065078,0.0012866424,0.00087208784,0.0007604698,0.0119249625],"category_scores_gemma":[0.0048973635,0.0002610927,0.00022490731,0.0009196063,0.0020049107,0.0027030406,0.0010245998,0.0006952772,0.00082326453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011011675,0.00002611345,0.0011248433,0.00015380884,0.000020489704,0.00010653977,0.0002402223,0.0050643994,0.0033329292,0.96703815,0.008314058,0.014468426],"study_design_scores_gemma":[0.00004551922,0.00003210824,0.0018939809,0.00005047493,0.000021481263,0.0002987036,0.00021597599,0.023592176,0.0019748001,0.9647069,0.0071473047,0.000020608582],"about_ca_topic_score_codex":0.00056892337,"about_ca_topic_score_gemma":0.0009841805,"teacher_disagreement_score":0.0119249625,"about_ca_system_score_codex":0.0007972665,"about_ca_system_score_gemma":0.00037919852,"threshold_uncertainty_score":0.039892912},"labels":[],"label_agreement":null},{"id":"W2402648100","doi":"","title":"Minimal weak separators of chordal graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Graph","score_opus":0.025998766570302315,"score_gpt":0.2776326157876752,"score_spread":0.25163384921737286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402648100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5215764,0.0017039785,0.21567796,0.0025460725,0.0004368717,0.00020075955,0.0027704674,0.0010873844,0.25400007],"genre_scores_gemma":[0.9038209,0.00067938934,0.039620314,0.00038585658,0.00018828816,0.00014051254,0.0022672524,0.00029816938,0.052599385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913424,0.00017473231,0.00007481927,0.00020057456,0.0002534405,0.00016216896],"domain_scores_gemma":[0.9962381,0.0017999841,0.0004700169,0.0005583879,0.0003809863,0.000552408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005661894,0.00059123454,0.0006449168,0.0012880597,0.00211281,0.0030139205,0.0014850921,0.0011072699,0.015780568],"category_scores_gemma":[0.005139689,0.0006063559,0.0005966594,0.0014258336,0.001723293,0.005462986,0.004193752,0.0023464274,0.0030323046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002491536,0.00006146492,0.00092270266,0.00025379236,0.000043214808,0.00020221881,0.0007932264,0.0010709844,0.0067552677,0.96088076,0.00607564,0.022691641],"study_design_scores_gemma":[0.000065250446,0.000038477436,0.00057984696,0.000067126384,0.00004914838,0.00027984483,0.0004899299,0.003684656,0.0049710893,0.96860594,0.021149082,0.000019632176],"about_ca_topic_score_codex":0.0005413633,"about_ca_topic_score_gemma":0.0010639471,"teacher_disagreement_score":0.015780568,"about_ca_system_score_codex":0.0010520668,"about_ca_system_score_gemma":0.00065126235,"threshold_uncertainty_score":0.052791238},"labels":[],"label_agreement":null},{"id":"W2402766034","doi":"","title":"On D -equivalence class of complete bipartite graphs","year":2014,"lang":"ca","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Vertex (graph theory); Conjecture; Graph; Discrete mathematics; Complete bipartite graph; Dominating set","score_opus":0.02770719562700326,"score_gpt":0.29023539180456365,"score_spread":0.2625281961775604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402766034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8837032,0.0007078789,0.061211854,0.0014983695,0.00007914545,0.00010341757,0.0015798281,0.0002692736,0.050847113],"genre_scores_gemma":[0.98557407,0.00045531205,0.00687131,0.00023944798,0.00021937827,0.00011640663,0.0017149572,0.00006581504,0.0047434107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834895,0.000264752,0.00006121926,0.00050130254,0.00037287283,0.00045102282],"domain_scores_gemma":[0.9952958,0.0026907027,0.0006502304,0.00030647736,0.00024363161,0.00081316644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010332464,0.0006486093,0.0011272604,0.0029698492,0.0022847166,0.0030294433,0.0011123694,0.0010026987,0.0066466075],"category_scores_gemma":[0.005744157,0.0004533188,0.0009495228,0.0020163802,0.0024133115,0.0037646445,0.002124382,0.00211114,0.0005767934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048379827,0.0002101569,0.004362229,0.00012398713,0.00003135047,0.0003401746,0.0008811651,0.0090171,0.003590853,0.9561707,0.003918854,0.020869672],"study_design_scores_gemma":[0.000099801204,0.000055629214,0.0031861274,0.000028495331,0.000012926553,0.00034481543,0.00015258483,0.042445365,0.0011615551,0.9473794,0.005106231,0.000027099959],"about_ca_topic_score_codex":0.002607201,"about_ca_topic_score_gemma":0.0011968651,"teacher_disagreement_score":0.0066466075,"about_ca_system_score_codex":0.0030745133,"about_ca_system_score_gemma":0.0007387717,"threshold_uncertainty_score":0.022307277},"labels":[],"label_agreement":null},{"id":"W2402876546","doi":"","title":"Paths in the Square Unit Lattice.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Square lattice; Unit (ring theory); Lattice (music); Unit square; Combinatorics; Statistical physics; Geometry; Physics; Mathematics education","score_opus":0.02329165036726255,"score_gpt":0.28435407931640216,"score_spread":0.2610624289491396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402876546","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33733436,0.0026685086,0.18797721,0.0034918177,0.0014844429,0.00017790234,0.0023014778,0.001142513,0.4634218],"genre_scores_gemma":[0.8040948,0.0015460761,0.09509103,0.0008988474,0.00032246864,0.0001838868,0.0015838786,0.00036516797,0.09591382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994407,0.00017106216,0.000026698997,0.000107234955,0.0001438832,0.00011036907],"domain_scores_gemma":[0.9991177,0.00034365946,0.00011958931,0.00009181052,0.00014336697,0.00018385278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027510413,0.00035474738,0.00038983513,0.0009904323,0.001577546,0.0022667442,0.0006865803,0.0006633204,0.020625617],"category_scores_gemma":[0.0021093464,0.00031602872,0.00039118427,0.0012739482,0.0014152365,0.0025913317,0.0014650634,0.0014779979,0.004659524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012719876,0.000031375905,0.00028722914,0.000093550545,0.000011523721,0.00019614937,0.00020945707,0.0014089943,0.0011906942,0.9682968,0.00736308,0.020784015],"study_design_scores_gemma":[0.000038450322,0.000023248063,0.00019504223,0.000024772608,0.0000072100033,0.00018240543,0.00021130544,0.004385708,0.00081366394,0.975662,0.018444495,0.000011791742],"about_ca_topic_score_codex":0.0022123284,"about_ca_topic_score_gemma":0.0031278357,"teacher_disagreement_score":0.020625617,"about_ca_system_score_codex":0.0006715373,"about_ca_system_score_gemma":0.0007694102,"threshold_uncertainty_score":0.06899959},"labels":[],"label_agreement":null},{"id":"W2402909918","doi":"","title":"The diameter and the chromatic number of almost self-complementary graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.009039655011315144,"score_gpt":0.26160114102053666,"score_spread":0.2525614860092215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402909918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8447629,0.004004272,0.047385745,0.0035608823,0.0004131367,0.000039246283,0.001141696,0.00022784722,0.09846423],"genre_scores_gemma":[0.98806494,0.0010573703,0.005069705,0.00013250498,0.00032788696,0.000043097974,0.00026003158,0.000060899492,0.0049835183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947566,0.00015272714,0.000018992096,0.0001406924,0.0001092285,0.00010271467],"domain_scores_gemma":[0.991338,0.0058072554,0.0010929632,0.00045608412,0.00037456217,0.00093100534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008034112,0.00043590824,0.0005085929,0.0022959274,0.0011630306,0.0022420113,0.0012903915,0.0009138989,0.0052980892],"category_scores_gemma":[0.008067698,0.00049648486,0.00034799962,0.0012716146,0.0029557422,0.003908358,0.001608167,0.0011715501,0.0005528885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040281852,0.00006200896,0.0047344747,0.00015047837,0.00004991444,0.00017283243,0.0004921225,0.012765515,0.0067186607,0.9498042,0.009535669,0.01511128],"study_design_scores_gemma":[0.000052900374,0.000047862293,0.004974922,0.00006565275,0.00004920156,0.00060572,0.0003359658,0.043937817,0.0028856609,0.9395055,0.0075013633,0.00003750207],"about_ca_topic_score_codex":0.0011396436,"about_ca_topic_score_gemma":0.0013294176,"teacher_disagreement_score":0.0052980892,"about_ca_system_score_codex":0.0014498967,"about_ca_system_score_gemma":0.00048999046,"threshold_uncertainty_score":0.017723858},"labels":[],"label_agreement":null},{"id":"W2402911904","doi":"","title":"Some basic properties of a class of total transformation digraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Class (philosophy); Pure mathematics; Algebra over a field; Computer science; Chemistry; Artificial intelligence","score_opus":0.0150144772365516,"score_gpt":0.23880884342100983,"score_spread":0.22379436618445822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402911904","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25923708,0.0010116507,0.23745207,0.0019701035,0.0003214459,0.00028809748,0.0049319738,0.0012155991,0.49357197],"genre_scores_gemma":[0.9150485,0.0010345293,0.03367512,0.00065991073,0.00024512867,0.00019484294,0.0037629155,0.00023159082,0.045147542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996593,0.00004905461,0.000027666394,0.00011369842,0.000083117804,0.000067289024],"domain_scores_gemma":[0.9986142,0.0006215772,0.0001390152,0.00022612195,0.00021247925,0.00018651744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035836166,0.0003279665,0.00036975878,0.0016798897,0.0017142401,0.0031383724,0.0007058655,0.0008511879,0.018029576],"category_scores_gemma":[0.0018844411,0.00034102364,0.0006804684,0.0019593085,0.0012805478,0.0030615022,0.0010295847,0.0012355231,0.0016736367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019041872,0.000029983363,0.0005118769,0.00006452684,0.000012555387,0.0001764997,0.00022254298,0.0006379193,0.0009740758,0.9791291,0.003761415,0.014460448],"study_design_scores_gemma":[0.000019214698,0.000022755281,0.00072643947,0.00002465558,0.000019809613,0.00059561786,0.00017246323,0.0042297943,0.0007225289,0.97125477,0.022199737,0.000012182464],"about_ca_topic_score_codex":0.0013172715,"about_ca_topic_score_gemma":0.0019102097,"teacher_disagreement_score":0.018029576,"about_ca_system_score_codex":0.0008339893,"about_ca_system_score_gemma":0.000536419,"threshold_uncertainty_score":0.060314894},"labels":[],"label_agreement":null},{"id":"W2402934917","doi":"","title":"On the Independence Number of Edge Chromatic Critical Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic scale; Mathematics; Independence (probability theory); Enhanced Data Rates for GSM Evolution; Independence number; Critical graph; Combinatorics; Graph; Computer science; Statistics; Artificial intelligence; Line graph","score_opus":0.032152945611647936,"score_gpt":0.30465624579117373,"score_spread":0.2725033001795258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402934917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61537814,0.0024046828,0.09928331,0.0046260874,0.0005337874,0.00011372135,0.0018462238,0.0004067757,0.27540737],"genre_scores_gemma":[0.9780312,0.00082983164,0.0088929515,0.00027072764,0.00046105625,0.00008447114,0.0007540435,0.00013781652,0.010537949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929535,0.00020352306,0.000022762948,0.00014509365,0.00018318115,0.00015004975],"domain_scores_gemma":[0.9874537,0.009012397,0.0010299992,0.0005893729,0.0006479647,0.0012665068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011140986,0.0006106476,0.00064760004,0.0038562992,0.0017391541,0.0020245383,0.001340549,0.0010140308,0.013504254],"category_scores_gemma":[0.011750729,0.0006081785,0.00038677477,0.0020413082,0.0028806413,0.00443168,0.0014421449,0.0025686633,0.0010034154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033849463,0.000094448005,0.004409715,0.00018719568,0.00004471149,0.00012758831,0.00031282505,0.01000066,0.0038340152,0.94523627,0.015717724,0.019696318],"study_design_scores_gemma":[0.000059041806,0.000041170057,0.0048959334,0.000058630187,0.00004472459,0.00029217376,0.00016046548,0.037567765,0.0024013284,0.9475027,0.006944645,0.000031516454],"about_ca_topic_score_codex":0.0015706276,"about_ca_topic_score_gemma":0.0021995858,"teacher_disagreement_score":0.013504254,"about_ca_system_score_codex":0.0017457089,"about_ca_system_score_gemma":0.0006590437,"threshold_uncertainty_score":0.045176268},"labels":[],"label_agreement":null},{"id":"W2402942974","doi":"","title":"Spanning trees whose stems have a few leaves.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Horticulture; Biology","score_opus":0.02038433947615764,"score_gpt":0.28091679411747006,"score_spread":0.2605324546413124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402942974","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4308014,0.003857896,0.37972155,0.003509336,0.0007244411,0.00020742526,0.00660454,0.0026915069,0.17188181],"genre_scores_gemma":[0.7861746,0.0019166962,0.15443173,0.0012510093,0.00039290282,0.00013988875,0.0069428827,0.00037715703,0.04837309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997255,0.000051654784,0.000030201774,0.00008434652,0.000051197014,0.000057073667],"domain_scores_gemma":[0.9981889,0.0007042582,0.00022650146,0.00038116032,0.00027531714,0.00022390427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027643054,0.00035797714,0.0005017768,0.0007254221,0.0014196944,0.0011385368,0.00067781087,0.0010382966,0.011039368],"category_scores_gemma":[0.0028265521,0.00035635827,0.00045831923,0.0011628894,0.00052364665,0.0028760429,0.0011793037,0.0008525991,0.005628381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030834833,0.0002457861,0.0065094708,0.0007110538,0.00012404741,0.0032196813,0.0013747286,0.0032431965,0.06495025,0.7005813,0.03176199,0.18697014],"study_design_scores_gemma":[0.000031070118,0.00009679204,0.0033350054,0.00016759866,0.00009713021,0.0050306055,0.00067376054,0.0094005065,0.011104558,0.8852035,0.08482468,0.000034809367],"about_ca_topic_score_codex":0.00030898667,"about_ca_topic_score_gemma":0.0009459664,"teacher_disagreement_score":0.011039368,"about_ca_system_score_codex":0.0002860506,"about_ca_system_score_gemma":0.000328335,"threshold_uncertainty_score":0.036930382},"labels":[],"label_agreement":null},{"id":"W2402960228","doi":"","title":"On the Maximum Number of Disjoint Chorded Cycles in Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics","score_opus":0.028278054149201388,"score_gpt":0.2801251987870706,"score_spread":0.2518471446378692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402960228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54860455,0.02301891,0.23666944,0.01430756,0.0021358605,0.0003102296,0.0046019857,0.00085112907,0.1695003],"genre_scores_gemma":[0.92635936,0.007311271,0.05056806,0.0007871868,0.0018879658,0.0003261901,0.0014630499,0.00036760923,0.010929476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786794,0.0006827498,0.0001603428,0.00050173263,0.0004332308,0.0003539326],"domain_scores_gemma":[0.96719813,0.026306026,0.001881754,0.0015754749,0.0012250794,0.0018134712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025657194,0.0011621515,0.0016205913,0.003935811,0.002079851,0.0041513084,0.0035431753,0.002532536,0.011632434],"category_scores_gemma":[0.032676447,0.0011644651,0.0008191711,0.003211445,0.0041583935,0.01165919,0.003250609,0.00279261,0.0013297024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010993523,0.00015706258,0.005869347,0.0014222716,0.00023694377,0.00037992815,0.00077808835,0.041839182,0.006381767,0.8345916,0.022822376,0.08442203],"study_design_scores_gemma":[0.00009814878,0.00009537297,0.0014772972,0.00019138743,0.0000903421,0.00050928054,0.00035162797,0.0344214,0.0019271005,0.9519116,0.008883917,0.00004256099],"about_ca_topic_score_codex":0.0010375669,"about_ca_topic_score_gemma":0.0017719327,"teacher_disagreement_score":0.011632434,"about_ca_system_score_codex":0.0022316745,"about_ca_system_score_gemma":0.0008524379,"threshold_uncertainty_score":0.038914382},"labels":[],"label_agreement":null},{"id":"W2403021968","doi":"","title":"On the structure of graphs with exactly two near-perfect matchings.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015499850818069281,"score_gpt":0.24958455808302155,"score_spread":0.23408470726495226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403021968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7221413,0.004089069,0.12804711,0.006224017,0.0004707897,0.0001529715,0.0020792352,0.0006645948,0.13613093],"genre_scores_gemma":[0.9522037,0.0011584912,0.029604316,0.0006808691,0.00027273348,0.00008644302,0.0013479049,0.00012901447,0.014516559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993973,0.00019428399,0.000033475353,0.00013236374,0.000107343454,0.00013521737],"domain_scores_gemma":[0.9959572,0.0018172422,0.0009030074,0.00049988274,0.00031295526,0.00050971186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059354154,0.00043386407,0.0007758544,0.001975086,0.002660443,0.0021695986,0.0015426889,0.0018144075,0.0075429743],"category_scores_gemma":[0.0056185285,0.00061218493,0.0005117379,0.0016604468,0.00230692,0.006100898,0.0020871905,0.0018140621,0.0014411645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019167543,0.000066367975,0.0012839924,0.00013389578,0.000030455156,0.00035904715,0.00057210756,0.004474999,0.0021603748,0.970464,0.0064873984,0.013775648],"study_design_scores_gemma":[0.000023860843,0.00002548189,0.00056156766,0.000038595615,0.000017732245,0.00024029774,0.00023569401,0.007550723,0.00044960645,0.98637486,0.004467157,0.0000143074785],"about_ca_topic_score_codex":0.0009917817,"about_ca_topic_score_gemma":0.0014747258,"teacher_disagreement_score":0.0075429743,"about_ca_system_score_codex":0.0009409725,"about_ca_system_score_gemma":0.00059797,"threshold_uncertainty_score":0.025233746},"labels":[],"label_agreement":null},{"id":"W2403055888","doi":"","title":"Kernels by Monochromatic Directed Paths In m-Colored Digraphs With Quasi-Transitive Chromatic Classes.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Colored; Chromatic scale; Mathematics; Transitive relation; Fibonacci number; Combinatorics; Optics; Physics; Materials science; Composite material","score_opus":0.010168500101461857,"score_gpt":0.2549953809335078,"score_spread":0.24482688083204596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403055888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76529616,0.0004584436,0.15765949,0.0005515257,0.00014827984,0.000108972956,0.0011884213,0.0008127696,0.073775895],"genre_scores_gemma":[0.9545002,0.00023821242,0.026349576,0.0001416786,0.0000425777,0.00007250838,0.00052474224,0.00015749867,0.017973023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959594,0.00008399749,0.00002427304,0.000114395436,0.00006524374,0.00011612002],"domain_scores_gemma":[0.9987344,0.00042966823,0.00026611076,0.00020805484,0.000117835305,0.00024390327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000271508,0.00036358298,0.0003522129,0.0010737993,0.00094734237,0.0021259168,0.00071566,0.00070228556,0.008893629],"category_scores_gemma":[0.0014793708,0.00053609005,0.0005645313,0.0008422924,0.0009937297,0.0024075864,0.0013244087,0.00080156745,0.0013252647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001741557,0.00007875066,0.0014913924,0.00013702149,0.000027077875,0.0005416893,0.00056337967,0.0042490256,0.009663255,0.9627374,0.004735583,0.015601372],"study_design_scores_gemma":[0.00008941644,0.000057910256,0.00221553,0.00006733428,0.00005247836,0.00094438036,0.00044969947,0.036920644,0.006921036,0.9397237,0.0125154415,0.000042439224],"about_ca_topic_score_codex":0.0020556531,"about_ca_topic_score_gemma":0.003385501,"teacher_disagreement_score":0.008893629,"about_ca_system_score_codex":0.0011439077,"about_ca_system_score_gemma":0.0004128144,"threshold_uncertainty_score":0.029752195},"labels":[],"label_agreement":null},{"id":"W2403124968","doi":"","title":"Large sets of P 3 -decompostitions of complete multipartite graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.02941349928033445,"score_gpt":0.3080258019436919,"score_spread":0.27861230266335746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403124968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76050687,0.00083289674,0.143427,0.0022940985,0.00025972593,0.00019068914,0.0038447068,0.00095366215,0.0876904],"genre_scores_gemma":[0.9462651,0.00030672553,0.032097142,0.0005064704,0.00015085908,0.00024767153,0.00460919,0.0003214123,0.0154954735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985784,0.00036836046,0.00007922913,0.00031687267,0.00040693663,0.00025021436],"domain_scores_gemma":[0.9907409,0.0052512847,0.00096768,0.0014207028,0.00074345036,0.00087601575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000922642,0.0006952384,0.0010535537,0.0020866662,0.0026588659,0.0039989254,0.0018030326,0.0020223872,0.01398026],"category_scores_gemma":[0.009523709,0.0011383037,0.0014056113,0.0016999446,0.0025092259,0.0041776113,0.003437738,0.0032162748,0.0013275981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004401241,0.00017072879,0.0036911601,0.00026102937,0.000111780384,0.0010656444,0.0007519041,0.023181528,0.0058895587,0.9308161,0.014305461,0.01931487],"study_design_scores_gemma":[0.000042728887,0.00004010663,0.0013764474,0.0000483752,0.000026463802,0.0004535089,0.0003344048,0.036536917,0.0020192987,0.95430976,0.0047925236,0.000019408102],"about_ca_topic_score_codex":0.0007990364,"about_ca_topic_score_gemma":0.001304183,"teacher_disagreement_score":0.01398026,"about_ca_system_score_codex":0.0012053777,"about_ca_system_score_gemma":0.00069140445,"threshold_uncertainty_score":0.046768665},"labels":[],"label_agreement":null},{"id":"W2403137284","doi":"","title":"On a Family of 4-Critical Graphs with Diameter Three.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.021440355788581122,"score_gpt":0.28756598327571176,"score_spread":0.26612562748713064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403137284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84505844,0.0023547395,0.04124388,0.0028466142,0.0002140224,0.00011961159,0.0010009747,0.00045056664,0.10671109],"genre_scores_gemma":[0.9709489,0.0011085288,0.0136408545,0.0003891347,0.0001438485,0.00009562283,0.0010514746,0.00012372684,0.012497972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995876,0.00009452475,0.000014308893,0.000102721264,0.00008686272,0.000113997194],"domain_scores_gemma":[0.9967116,0.0017303969,0.00047531354,0.00015663373,0.00028381022,0.0006422313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048515951,0.0007962832,0.00061738037,0.0028769688,0.003150741,0.0015578284,0.0011445432,0.0015445263,0.006972133],"category_scores_gemma":[0.0033785338,0.00054177427,0.0007220381,0.0011663118,0.0019116137,0.0018143946,0.0013723491,0.0015007678,0.0008686185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050721347,0.000091583366,0.0046793255,0.00023991971,0.0000741186,0.0036136082,0.0014947382,0.009816078,0.0080720745,0.936546,0.019015796,0.015849516],"study_design_scores_gemma":[0.00021397341,0.00011768633,0.0066756657,0.0002312638,0.000085977015,0.0052529387,0.0014405253,0.039346073,0.0041226503,0.90772784,0.034703538,0.00008182074],"about_ca_topic_score_codex":0.0021474448,"about_ca_topic_score_gemma":0.0020680744,"teacher_disagreement_score":0.006972133,"about_ca_system_score_codex":0.0015632481,"about_ca_system_score_gemma":0.00054049795,"threshold_uncertainty_score":0.023324132},"labels":[],"label_agreement":null},{"id":"W2403154468","doi":"","title":"Competition Graphs of Acyclic Digraphs Satisfying Condition C*(p).","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Competition (biology); Discrete mathematics; Biology","score_opus":0.013415520567717342,"score_gpt":0.2833103321507263,"score_spread":0.269894811583009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403154468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49648115,0.00080704846,0.23721464,0.0030287665,0.00034453644,0.000720662,0.009968734,0.0012266474,0.2502079],"genre_scores_gemma":[0.93974894,0.00033849073,0.034079604,0.0006390834,0.00010898261,0.0003073927,0.0048654033,0.00017353895,0.019738613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853957,0.00032937396,0.00010477205,0.0003782714,0.0002630111,0.00038492202],"domain_scores_gemma":[0.9890906,0.0061862976,0.0009659041,0.00079869496,0.0012487688,0.0017097148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012954022,0.00053334935,0.0007565741,0.0013851982,0.0021048086,0.0028132338,0.0012376716,0.0014404249,0.022429414],"category_scores_gemma":[0.0101411,0.00056625926,0.00067985716,0.0018114875,0.0014250448,0.0036941604,0.0015400193,0.0016266844,0.0016191601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044584443,0.00016771116,0.002862849,0.0003858558,0.000056401983,0.00070510723,0.0002660076,0.008725673,0.006042276,0.94305974,0.018225495,0.01905705],"study_design_scores_gemma":[0.00018048815,0.00012937243,0.0025502027,0.00008654368,0.00006991311,0.0012929222,0.0004864708,0.04455375,0.0043654256,0.9212107,0.025016716,0.00005763244],"about_ca_topic_score_codex":0.004011844,"about_ca_topic_score_gemma":0.0057832613,"teacher_disagreement_score":0.022429414,"about_ca_system_score_codex":0.0014593356,"about_ca_system_score_gemma":0.002201024,"threshold_uncertainty_score":0.07503384},"labels":[],"label_agreement":null},{"id":"W2403213260","doi":"","title":"A Study on Radial Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.019578667271630268,"score_gpt":0.3005948862521077,"score_spread":0.2810162189804774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403213260","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19798084,0.012636815,0.11413606,0.0026984324,0.00059446896,0.00020826152,0.00065278687,0.00035813526,0.67073417],"genre_scores_gemma":[0.7900591,0.015285233,0.052839305,0.0017162473,0.000829849,0.00016841333,0.0013500714,0.00069147913,0.1370603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991942,0.00042612784,0.000021980548,0.00012620435,0.00012912453,0.00010227643],"domain_scores_gemma":[0.9971727,0.0016973722,0.000221221,0.00035251398,0.00034924404,0.00020695676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065861834,0.0006639672,0.00052568957,0.0016169123,0.001619497,0.001715182,0.0012886052,0.00091594615,0.019204624],"category_scores_gemma":[0.005499736,0.0003193232,0.0007747857,0.0028647508,0.0012949322,0.0037933257,0.001082754,0.0013188513,0.0037674732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056657995,0.00010248055,0.0011286346,0.00032526907,0.000016214251,0.00030015298,0.00048560833,0.0036935508,0.0013868428,0.94855535,0.013666041,0.030283267],"study_design_scores_gemma":[0.000035159206,0.00015855335,0.002849265,0.00036519297,0.000088137036,0.0024341717,0.0016954594,0.028749876,0.0029368047,0.8151936,0.14546122,0.000032614655],"about_ca_topic_score_codex":0.0026898982,"about_ca_topic_score_gemma":0.0030344245,"teacher_disagreement_score":0.019204624,"about_ca_system_score_codex":0.0010426114,"about_ca_system_score_gemma":0.00046596976,"threshold_uncertainty_score":0.06424582},"labels":[],"label_agreement":null},{"id":"W2403260949","doi":"","title":"Distance-Dominating Cycles in P3-Dominated Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016016955823797568,"score_gpt":0.2865911891191448,"score_spread":0.2705742332953472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403260949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6677802,0.0026084988,0.17432836,0.0029147235,0.00022136066,0.0002781413,0.0025403367,0.0005243611,0.148804],"genre_scores_gemma":[0.9159837,0.0012130165,0.047654368,0.0007849091,0.00011726808,0.00021072131,0.0016126737,0.00016662433,0.0322567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992711,0.00018619408,0.000042393705,0.0001658336,0.00017401186,0.00016049141],"domain_scores_gemma":[0.99626863,0.0022206733,0.00036138686,0.00025146466,0.00042530624,0.00047250726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014279,0.00049813284,0.00062932866,0.0014374317,0.0019041117,0.0025521636,0.0011336434,0.0012477041,0.009033972],"category_scores_gemma":[0.0052423542,0.0005243626,0.0006018603,0.0020034895,0.0011355246,0.0028115648,0.0018514222,0.001308946,0.0014526988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007261631,0.00016109787,0.005215384,0.00067438715,0.00009661508,0.0012829365,0.0013169219,0.014182151,0.009922809,0.8725093,0.019394679,0.07451747],"study_design_scores_gemma":[0.000088161985,0.000071254806,0.0015417386,0.000084121144,0.000053132007,0.0013310126,0.00046347754,0.02777185,0.0050635133,0.9445485,0.018959887,0.00002334628],"about_ca_topic_score_codex":0.0020028567,"about_ca_topic_score_gemma":0.0025848954,"teacher_disagreement_score":0.009033972,"about_ca_system_score_codex":0.0015030382,"about_ca_system_score_gemma":0.00073863904,"threshold_uncertainty_score":0.030221641},"labels":[],"label_agreement":null},{"id":"W2403346694","doi":"","title":"Skewness, splitting number and vertex deletion of some toroidal meshes.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Skewness; Vertex (graph theory); Toroid; Polygon mesh; Combinatorics; Geometry; Statistics; Physics; Plasma; Quantum mechanics","score_opus":0.01008359434466397,"score_gpt":0.26936116564442564,"score_spread":0.25927757129976164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403346694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93756366,0.00025804536,0.036132053,0.00041857536,0.00009973898,0.000028774508,0.0005510642,0.00018051061,0.024767645],"genre_scores_gemma":[0.9877872,0.00016026456,0.0074098445,0.00004172474,0.000039406357,0.000025453577,0.0004063157,0.000043370852,0.0040863524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974114,0.00005020282,0.000014205382,0.000042501066,0.000074702395,0.000077188524],"domain_scores_gemma":[0.99829954,0.00064733956,0.0003463185,0.0001791793,0.0001955623,0.00033212127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003427459,0.00029709245,0.0003799633,0.0013342281,0.0011314313,0.0012949253,0.0006707697,0.00050529133,0.005236211],"category_scores_gemma":[0.0030646415,0.00021779761,0.0003222389,0.0010121476,0.0012698005,0.0015002205,0.0009739292,0.0007744705,0.00053731503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008880509,0.000088487264,0.008250906,0.00013028772,0.00004350707,0.0011063995,0.0009234189,0.026960153,0.02227477,0.89152044,0.006397303,0.04141635],"study_design_scores_gemma":[0.00007230121,0.00010734627,0.00636975,0.00004620936,0.000047079615,0.0012989128,0.0013365907,0.09270131,0.010306323,0.8797544,0.007913981,0.000045810073],"about_ca_topic_score_codex":0.00077998196,"about_ca_topic_score_gemma":0.000934593,"teacher_disagreement_score":0.005236211,"about_ca_system_score_codex":0.00069414737,"about_ca_system_score_gemma":0.0003488684,"threshold_uncertainty_score":0.017516851},"labels":[],"label_agreement":null},{"id":"W2403458251","doi":"","title":"Supergraphs And Graphical Complexity Of Permutation Groups.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Permutation group; Combinatorics","score_opus":0.043855397309992855,"score_gpt":0.27886234143306055,"score_spread":0.2350069441230677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403458251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6294367,0.0059779054,0.18169269,0.01246606,0.00035780258,0.000096564094,0.0017515166,0.0004963371,0.16772446],"genre_scores_gemma":[0.97153354,0.0018219881,0.014489907,0.00053197396,0.00040653217,0.000086886845,0.00082955585,0.00007260007,0.010227097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897003,0.00036059384,0.00003994593,0.00019414224,0.00027393436,0.00016143071],"domain_scores_gemma":[0.99211097,0.0057016104,0.00075323257,0.00057691935,0.00032798768,0.00052922085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007654965,0.0004373065,0.0006790775,0.0017995026,0.0011020278,0.0026952585,0.0011634213,0.0011606623,0.013326541],"category_scores_gemma":[0.0057285675,0.00038275064,0.00069365505,0.0017909067,0.0022891946,0.0067175436,0.0016042565,0.0024270285,0.0009610101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051649076,0.00004730509,0.0012710429,0.00008913137,0.000021275175,0.00008536487,0.00036933957,0.004555862,0.0007707864,0.97388667,0.005167978,0.013683759],"study_design_scores_gemma":[0.0000072485664,0.0000061976334,0.00047590514,0.000009228256,0.0000061812766,0.00006266071,0.00007813444,0.006204192,0.00011708181,0.9911573,0.0018710111,0.000005010397],"about_ca_topic_score_codex":0.0011387304,"about_ca_topic_score_gemma":0.0017898721,"teacher_disagreement_score":0.013326541,"about_ca_system_score_codex":0.0013515597,"about_ca_system_score_gemma":0.00058845896,"threshold_uncertainty_score":0.04458177},"labels":[],"label_agreement":null},{"id":"W2403530833","doi":"10.1007/978-3-319-29221-2_23","title":"Medians of Permutations: Building Constraints","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.022009729105714134,"score_gpt":0.29823651536144885,"score_spread":0.2762267862557347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403530833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011311559,0.0008214287,0.9229705,0.0009090401,0.00020451738,0.000103867395,0.0009932892,0.00045397552,0.06223177],"genre_scores_gemma":[0.21028908,0.0029518534,0.7350531,0.0005011369,0.00052636274,0.0007185705,0.0036022926,0.0013585915,0.044999007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974607,0.00081300223,0.000195521,0.00054845656,0.00078040623,0.00020196005],"domain_scores_gemma":[0.99404824,0.0038824969,0.00035327836,0.00093299075,0.0005295068,0.00025356468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021279429,0.0011457589,0.0017631021,0.0015882682,0.0014257751,0.0042794435,0.0032252653,0.0017393187,0.023091635],"category_scores_gemma":[0.012147982,0.0017216114,0.0017586773,0.003706332,0.0020436603,0.00919544,0.0043425984,0.0047350903,0.0039951443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006295891,0.000031722222,0.00020904826,0.00024138899,0.000020433765,0.000060074675,0.00015940421,0.026276752,0.00063066935,0.87440664,0.010132436,0.08776853],"study_design_scores_gemma":[0.000012163893,0.000015317588,0.00005940135,0.000057031713,0.000009614304,0.000049836395,0.00005321104,0.033039425,0.0006020703,0.9482331,0.017857626,0.000011056387],"about_ca_topic_score_codex":0.0015021411,"about_ca_topic_score_gemma":0.0022566067,"teacher_disagreement_score":0.023091635,"about_ca_system_score_codex":0.0013386765,"about_ca_system_score_gemma":0.0015312626,"threshold_uncertainty_score":0.07724923},"labels":[],"label_agreement":null},{"id":"W2403544395","doi":"","title":"A note on graphs containing all trees of a given size.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01628100681929117,"score_gpt":0.29396104742290224,"score_spread":0.27768004060361107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403544395","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025743755,0.07027813,0.30675998,0.07524858,0.076189004,0.00024712257,0.0063380534,0.0042305603,0.43496487],"genre_scores_gemma":[0.25470388,0.07853149,0.32700494,0.028878069,0.06783481,0.0004677468,0.0058881207,0.0049038716,0.23178709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921036,0.00017964457,0.000069072485,0.00025096553,0.0001994887,0.000090415866],"domain_scores_gemma":[0.9948171,0.003091183,0.00017014677,0.0011189012,0.0005428396,0.00025987794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012566844,0.0011049022,0.00116456,0.0013876891,0.003044746,0.0020711767,0.0020351356,0.0012643683,0.010224205],"category_scores_gemma":[0.005764568,0.0006840951,0.0014947476,0.0024951927,0.0028864406,0.009005041,0.002190237,0.0058163134,0.0052624694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034240625,0.00008661812,0.0008286887,0.0008567911,0.0000761107,0.00071471126,0.00038197995,0.002204655,0.006051327,0.44717076,0.40368,0.13760588],"study_design_scores_gemma":[0.00001900652,0.00007484769,0.0013840904,0.00020273631,0.00007266459,0.0010491894,0.00017275894,0.0014024919,0.0026142867,0.51677114,0.476194,0.00004285686],"about_ca_topic_score_codex":0.0030045458,"about_ca_topic_score_gemma":0.006681015,"teacher_disagreement_score":0.010224205,"about_ca_system_score_codex":0.001343014,"about_ca_system_score_gemma":0.00088787806,"threshold_uncertainty_score":0.03420335},"labels":[],"label_agreement":null},{"id":"W2403587392","doi":"","title":"On (k, t)-choosability of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; List coloring; Mathematics; Vertex (graph theory); Graph; Fractional coloring; Graph coloring; Complete coloring; Planar graph; Brooks' theorem; Edge coloring; Discrete mathematics; Chordal graph; 1-planar graph; Graph power; Line graph","score_opus":0.030211719015776954,"score_gpt":0.2773091559090248,"score_spread":0.2470974368932478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403587392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23897019,0.0053815846,0.652842,0.0036439432,0.0008453889,0.0006556108,0.0030947353,0.0011156608,0.09345093],"genre_scores_gemma":[0.76079655,0.010312258,0.18189639,0.0027236608,0.0032795675,0.0016802597,0.0044910284,0.0008936362,0.033926647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734783,0.0005614293,0.00020990857,0.0009954316,0.00042075486,0.00046451134],"domain_scores_gemma":[0.9919436,0.0053032404,0.0009843917,0.0009308925,0.00034608805,0.0004917733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00159291,0.0022373644,0.0013538362,0.0022668778,0.0024927077,0.0026731675,0.001907692,0.002847752,0.012898931],"category_scores_gemma":[0.008154301,0.0012209783,0.002468664,0.0051303036,0.005949921,0.010874719,0.0037586063,0.0047545116,0.0019838344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068852666,0.00019624263,0.0026776914,0.0006154639,0.00011383449,0.0008460382,0.0010752666,0.04626296,0.0070732594,0.8646993,0.008806046,0.06694528],"study_design_scores_gemma":[0.00009058122,0.0002472361,0.0010896302,0.00006947514,0.00004305126,0.00068939285,0.00013225258,0.03504775,0.0016789201,0.95231634,0.008531487,0.00006385882],"about_ca_topic_score_codex":0.002301312,"about_ca_topic_score_gemma":0.001506186,"teacher_disagreement_score":0.012898931,"about_ca_system_score_codex":0.0028796897,"about_ca_system_score_gemma":0.0010671497,"threshold_uncertainty_score":0.0431512},"labels":[],"label_agreement":null},{"id":"W2403590840","doi":"","title":"Quasi-tree graphs with the largest and the second largest numbers of maximum independent sets.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics; Discrete mathematics","score_opus":0.007807377460355607,"score_gpt":0.23400131493171958,"score_spread":0.22619393747136396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403590840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4761719,0.0040939213,0.386387,0.0057768375,0.000950107,0.00018048416,0.0072113783,0.001196714,0.11803169],"genre_scores_gemma":[0.87531173,0.0010385826,0.10254256,0.0008510646,0.0004584667,0.00017884935,0.002268708,0.00025747356,0.017092451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993037,0.0002114886,0.000036296762,0.0001586772,0.00016070832,0.00012907319],"domain_scores_gemma":[0.9915583,0.0053014616,0.00091606454,0.0008020396,0.0006949877,0.0007271375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009552935,0.000388377,0.0005954618,0.001341655,0.0013138421,0.0025505,0.0009776698,0.0011319973,0.009103213],"category_scores_gemma":[0.007978339,0.00064284785,0.00069113827,0.0012600104,0.001321376,0.004538272,0.0009487735,0.0015446005,0.000937057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029794054,0.000057600653,0.0017645662,0.00019801821,0.00003792914,0.00021107252,0.00017252736,0.0038489434,0.007191878,0.95647675,0.012161644,0.017581161],"study_design_scores_gemma":[0.00006330519,0.000047769958,0.0031618583,0.000059133963,0.00005114344,0.0009575701,0.00015402958,0.020877343,0.0035564462,0.959582,0.011460019,0.000029370385],"about_ca_topic_score_codex":0.0007917873,"about_ca_topic_score_gemma":0.0017638954,"teacher_disagreement_score":0.009103213,"about_ca_system_score_codex":0.0010067961,"about_ca_system_score_gemma":0.0009043282,"threshold_uncertainty_score":0.030453265},"labels":[],"label_agreement":null},{"id":"W2403593319","doi":"","title":"Extending matchings in planar odd graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Planar; Planar graph; Graph; Computer science","score_opus":0.029042415767146314,"score_gpt":0.2952516997471866,"score_spread":0.2662092839800403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403593319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30874887,0.004175524,0.38548726,0.003104595,0.0011122766,0.0001969106,0.0009851377,0.0017867152,0.29440284],"genre_scores_gemma":[0.831605,0.0030572414,0.11901944,0.0009631199,0.0004901705,0.00010892361,0.0010591673,0.0004952382,0.043201704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993649,0.0001716155,0.000043440967,0.00016601058,0.00012315947,0.00013079336],"domain_scores_gemma":[0.9982514,0.0007286856,0.00021221314,0.00043448547,0.00017678629,0.00019646171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062245975,0.00050207844,0.0005120575,0.0014775672,0.001258215,0.0016672537,0.001018942,0.0009267026,0.009209313],"category_scores_gemma":[0.003981816,0.0004275858,0.0008957347,0.0017428801,0.0015573462,0.0058277203,0.0036832918,0.001851594,0.0019146258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071728035,0.000045140045,0.000553351,0.0001346062,0.000012659157,0.00018752794,0.000316456,0.0019207422,0.002287524,0.9440045,0.0037295525,0.046736296],"study_design_scores_gemma":[0.000011559846,0.000019198116,0.00021744972,0.000028763112,0.000015900216,0.00020564276,0.0001229096,0.0034908163,0.00078860665,0.9762449,0.018845577,0.000008683567],"about_ca_topic_score_codex":0.0012722525,"about_ca_topic_score_gemma":0.0015515272,"teacher_disagreement_score":0.009209313,"about_ca_system_score_codex":0.00083030737,"about_ca_system_score_gemma":0.0004341485,"threshold_uncertainty_score":0.03080821},"labels":[],"label_agreement":null},{"id":"W2403622411","doi":"","title":"A Result on Linear Arboricity of Planar Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Planar; Planar graph; Combinatorics; Graph; Computer science; Computer graphics (images)","score_opus":0.037354521562636245,"score_gpt":0.3021261858310823,"score_spread":0.26477166426844606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403622411","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22985226,0.0044415602,0.21004136,0.007022849,0.000772021,0.00010656923,0.0028702698,0.001194535,0.5436986],"genre_scores_gemma":[0.8918969,0.004725201,0.035105933,0.0023576475,0.001215788,0.00015077631,0.0037891457,0.00054961396,0.060208965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943405,0.00011327986,0.000025376725,0.00014967166,0.00015780686,0.00011967362],"domain_scores_gemma":[0.99470407,0.0037056818,0.00038013584,0.00042169195,0.0003800597,0.00040831344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000478844,0.0006899057,0.00056117243,0.0016460159,0.0011179359,0.0020577984,0.0011480522,0.0007295937,0.018519051],"category_scores_gemma":[0.0037848533,0.0004738981,0.00075395935,0.002342828,0.0016792343,0.0044184895,0.002157616,0.0028758761,0.0035138787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018958829,0.00012590052,0.0025158408,0.0005763242,0.00006357951,0.0005161886,0.00072673714,0.004773562,0.0059479307,0.91662145,0.026941016,0.04100188],"study_design_scores_gemma":[0.00004031071,0.000068440495,0.0015142295,0.000069650465,0.00007823137,0.0006739347,0.0003383544,0.0076284073,0.002653988,0.95943654,0.027477847,0.00002010873],"about_ca_topic_score_codex":0.0009582608,"about_ca_topic_score_gemma":0.0012857585,"teacher_disagreement_score":0.018519051,"about_ca_system_score_codex":0.0007757391,"about_ca_system_score_gemma":0.00034540892,"threshold_uncertainty_score":0.061952353},"labels":[],"label_agreement":null},{"id":"W2403658863","doi":"","title":"Circumferences of 2-connected quasi-claw-free graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Structural engineering; Engineering","score_opus":0.017842507082741984,"score_gpt":0.2738109842358083,"score_spread":0.2559684771530663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403658863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78983754,0.0011412126,0.06829326,0.0007890616,0.00028998125,0.000103198276,0.0019265496,0.00094227877,0.13667694],"genre_scores_gemma":[0.95391876,0.000511636,0.020338792,0.00016095726,0.000092253234,0.000123716,0.0014053053,0.000181561,0.023267126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996333,0.00006944466,0.000022740543,0.00009563769,0.000101343925,0.00007758247],"domain_scores_gemma":[0.99842155,0.0005978446,0.00041269278,0.00013918933,0.00014175294,0.00028702873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020620805,0.00052968715,0.00034743853,0.0019970853,0.0011558171,0.0017784949,0.0009548036,0.00084091176,0.013887321],"category_scores_gemma":[0.0019138121,0.00049731205,0.00034194347,0.0011125358,0.001253744,0.0017264425,0.0013972883,0.00072543806,0.0017553103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005127347,0.00008225663,0.003923647,0.00044510918,0.00007032898,0.00151675,0.0011069045,0.010028911,0.02190312,0.90455824,0.013994393,0.041857626],"study_design_scores_gemma":[0.00016539497,0.00018930988,0.018923262,0.00019259463,0.00012835355,0.0028399138,0.001646392,0.036169633,0.016083585,0.8589144,0.064624876,0.00012231906],"about_ca_topic_score_codex":0.0015227282,"about_ca_topic_score_gemma":0.0018595257,"teacher_disagreement_score":0.013887321,"about_ca_system_score_codex":0.0005737055,"about_ca_system_score_gemma":0.00024619952,"threshold_uncertainty_score":0.046457708},"labels":[],"label_agreement":null},{"id":"W2403749856","doi":"","title":"The total number of matchings in triangle graph of a connected graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.01968312109272709,"score_gpt":0.29154948413963094,"score_spread":0.27186636304690387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403749856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7295558,0.0020180007,0.15644553,0.0023501816,0.0006824306,0.0001800555,0.0067547522,0.0010153326,0.100997955],"genre_scores_gemma":[0.9175187,0.0013433396,0.049313437,0.00031143517,0.00030163073,0.00021685385,0.003066045,0.00037687414,0.027551819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899346,0.00019463843,0.00007487853,0.00026529052,0.0002644161,0.00020733563],"domain_scores_gemma":[0.99441695,0.0028686505,0.00078408764,0.00065411214,0.0006301649,0.000646122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064518885,0.00051254703,0.00076079316,0.002360525,0.0013442066,0.0024733383,0.001888131,0.0013179327,0.019800914],"category_scores_gemma":[0.007236202,0.00041318376,0.000613229,0.0021294188,0.0010917182,0.0044504707,0.0011649122,0.0008374833,0.0018233835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011201034,0.00022492201,0.013730647,0.0013861551,0.0002821071,0.0006718704,0.0007879698,0.021714399,0.03043057,0.774566,0.031043133,0.12404209],"study_design_scores_gemma":[0.00009414598,0.000181303,0.006776201,0.00014147187,0.00023330394,0.0023675694,0.0007029579,0.082118966,0.011941421,0.8672293,0.028163925,0.00004943302],"about_ca_topic_score_codex":0.000959981,"about_ca_topic_score_gemma":0.0017299586,"teacher_disagreement_score":0.019800914,"about_ca_system_score_codex":0.0008988048,"about_ca_system_score_gemma":0.0005570817,"threshold_uncertainty_score":0.06624061},"labels":[],"label_agreement":null},{"id":"W2403788893","doi":"","title":"Signed Edge Domination Numbers In Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.012313408805457445,"score_gpt":0.28020714517940465,"score_spread":0.2678937363739472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403788893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41506454,0.0036220078,0.29562533,0.0032283033,0.0014085978,0.000111194764,0.0012063282,0.0009153216,0.27881837],"genre_scores_gemma":[0.9312707,0.0011557481,0.037499983,0.00040108085,0.0004166433,0.00010876945,0.00041287026,0.00012537568,0.028608754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939907,0.00016249283,0.00004945053,0.00009328214,0.0002025562,0.000093152536],"domain_scores_gemma":[0.99743265,0.0013677687,0.0003388157,0.000198351,0.00038228527,0.00028008653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063011074,0.0002950719,0.00033803307,0.0019363464,0.0009021479,0.0024998137,0.0005507759,0.00073930447,0.00829523],"category_scores_gemma":[0.005766788,0.00022459554,0.00024975158,0.0016136148,0.0014441485,0.004333263,0.0010170019,0.0013055123,0.0013164663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006203386,0.000019541892,0.0005557533,0.000066148976,0.000007478642,0.0000942755,0.0001981488,0.0014534025,0.0020956947,0.9588653,0.004138104,0.032444105],"study_design_scores_gemma":[0.000015664447,0.000021837339,0.00051217445,0.000032943943,0.000010549418,0.00026062882,0.00012496489,0.0057061557,0.0014045873,0.9792644,0.012629428,0.000016606127],"about_ca_topic_score_codex":0.00033339093,"about_ca_topic_score_gemma":0.00066874316,"teacher_disagreement_score":0.00829523,"about_ca_system_score_codex":0.00072410435,"about_ca_system_score_gemma":0.0004067169,"threshold_uncertainty_score":0.027750313},"labels":[],"label_agreement":null},{"id":"W2403814521","doi":"","title":"Forbidden subgraphs and the hamiltonian index of a 2-connected graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Hamiltonian (control theory); Index (typography); Hamiltonian path; Discrete mathematics; Computer science; Mathematical optimization; World Wide Web","score_opus":0.00857023606629457,"score_gpt":0.24250863033377912,"score_spread":0.23393839426748456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403814521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8585576,0.0009092599,0.055570655,0.0009943368,0.0001588251,0.00005091958,0.0008979513,0.0001852241,0.0826752],"genre_scores_gemma":[0.9790381,0.00031986574,0.01160685,0.00014101346,0.000079319994,0.000049565853,0.00039310235,0.00005128087,0.008320814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999778,0.00006782088,0.000011924802,0.00003883399,0.000057230747,0.000046311663],"domain_scores_gemma":[0.99870455,0.0006767965,0.00028151687,0.0000998411,0.00008109635,0.00015616174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022784206,0.00022340275,0.00023956806,0.0013658648,0.00076970324,0.0011571937,0.0006021369,0.0005481542,0.0052440874],"category_scores_gemma":[0.0017421907,0.00020486151,0.00022840517,0.0009347011,0.00086284213,0.0016096184,0.0007392344,0.0006138833,0.00046449216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016632945,0.0000672739,0.0022990159,0.000095633,0.000025562238,0.0003925815,0.0004662027,0.0055797454,0.009305716,0.95608765,0.00483244,0.020681886],"study_design_scores_gemma":[0.000029242932,0.000024105191,0.002078604,0.000024372737,0.000019750201,0.00043471708,0.00019894297,0.02058133,0.002184158,0.9686161,0.005792459,0.000016097969],"about_ca_topic_score_codex":0.0008709092,"about_ca_topic_score_gemma":0.0014904852,"teacher_disagreement_score":0.0052440874,"about_ca_system_score_codex":0.0006147018,"about_ca_system_score_gemma":0.00027031184,"threshold_uncertainty_score":0.017543197},"labels":[],"label_agreement":null},{"id":"W2403821435","doi":"","title":"A Genus Inequality Of The Union Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Inequality; Combinatorics; Mathematical economics; Zoology; Mathematical analysis; Biology","score_opus":0.020134050661004356,"score_gpt":0.28847178304732296,"score_spread":0.2683377323863186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403821435","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32120314,0.005099901,0.12418759,0.010390644,0.0012217389,0.0000681527,0.0010628807,0.0005215479,0.5362444],"genre_scores_gemma":[0.94239265,0.0026697924,0.019796487,0.0016838082,0.0011403081,0.00012732451,0.0007784951,0.0005220036,0.030889222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846494,0.00038170555,0.00005068338,0.0003045786,0.00046893934,0.00032907963],"domain_scores_gemma":[0.9923822,0.0045455107,0.0007032993,0.00079184136,0.0007315747,0.0008455842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012573466,0.0006921059,0.00093939377,0.0029430212,0.0032701478,0.0038246617,0.0017911333,0.0020903135,0.018658428],"category_scores_gemma":[0.014536453,0.0007469484,0.0008280591,0.0020511213,0.0045414446,0.01099087,0.004282879,0.0054188548,0.0026141242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009439878,0.000019953628,0.0009944887,0.00006851708,0.000009677928,0.00013911762,0.00029219224,0.00075160747,0.0012783933,0.97855926,0.006238058,0.01155429],"study_design_scores_gemma":[0.000014624739,0.00001879778,0.0014624676,0.000070284215,0.000024256613,0.00034240747,0.00023825328,0.0067209643,0.00100821,0.9841926,0.0058929548,0.000014255267],"about_ca_topic_score_codex":0.0016686544,"about_ca_topic_score_gemma":0.0016009954,"teacher_disagreement_score":0.018658428,"about_ca_system_score_codex":0.0015640976,"about_ca_system_score_gemma":0.0005693731,"threshold_uncertainty_score":0.06241864},"labels":[],"label_agreement":null},{"id":"W2403916259","doi":"","title":"Noncrossing matchings with fixed points.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Fixed point; Mathematical analysis","score_opus":0.010903709763263011,"score_gpt":0.2549594325959743,"score_spread":0.2440557228327113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403916259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.349951,0.002804035,0.31744912,0.0028182105,0.0009996303,0.00025316575,0.0016654897,0.001375311,0.322684],"genre_scores_gemma":[0.87613785,0.0013603036,0.059928842,0.0006570246,0.00037962204,0.00017534095,0.0014599608,0.00037180405,0.059529196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891424,0.00023044462,0.00006721753,0.00029844028,0.00029034357,0.00019946154],"domain_scores_gemma":[0.99694496,0.0015019043,0.00041798718,0.0005119579,0.00030496359,0.00031828627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008411378,0.00068600214,0.00095807126,0.0025285846,0.0023918129,0.002999251,0.0018001496,0.0025146992,0.020465953],"category_scores_gemma":[0.007586606,0.0007325934,0.00087466056,0.002357826,0.0017106143,0.0049252533,0.0029589408,0.0025997136,0.0039922306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006465825,0.000054606775,0.00047340753,0.00008283058,0.000021534392,0.00034005922,0.00017025613,0.0010940683,0.0015265853,0.97435915,0.004239094,0.01757369],"study_design_scores_gemma":[0.000028144583,0.000016257687,0.00033146408,0.000044424625,0.000019269011,0.0004304912,0.00012839657,0.005132634,0.0010505426,0.9824008,0.010405601,0.00001206307],"about_ca_topic_score_codex":0.0008728877,"about_ca_topic_score_gemma":0.0013481869,"teacher_disagreement_score":0.020465953,"about_ca_system_score_codex":0.001300309,"about_ca_system_score_gemma":0.00057829014,"threshold_uncertainty_score":0.06846541},"labels":[],"label_agreement":null},{"id":"W2403955642","doi":"","title":"Hamiltonian Properties of the 3-(γ, 2)-Critical Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Pure mathematics; Mathematical optimization","score_opus":0.026700328697763495,"score_gpt":0.27766484826031174,"score_spread":0.2509645195625482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403955642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80556405,0.0011198678,0.030975575,0.0012554394,0.0001611903,0.00010364183,0.0008783194,0.00017280287,0.15976912],"genre_scores_gemma":[0.98720306,0.00023693693,0.0040724725,0.00018406371,0.00004752379,0.000043962213,0.00030538824,0.000046921232,0.007859622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999907,0.000024395486,0.0000038119165,0.000016667307,0.00002148505,0.000026670323],"domain_scores_gemma":[0.9994899,0.00017410592,0.00013747992,0.000041783744,0.000067141096,0.00008948659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014549529,0.00028266723,0.0001624829,0.001313099,0.00083592307,0.0008942543,0.00036050173,0.00051989895,0.011030874],"category_scores_gemma":[0.0010973607,0.00021181545,0.00021287477,0.00046819643,0.00088383415,0.0009326573,0.00043581353,0.0005073117,0.00058026146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085391024,0.000031608575,0.0014144005,0.000116237265,0.00001606376,0.0005080242,0.000483412,0.0033375411,0.011927314,0.96663886,0.005239185,0.01020189],"study_design_scores_gemma":[0.000048515616,0.000028416413,0.0027360031,0.00005251089,0.000018106342,0.0005753117,0.0005234118,0.009300015,0.0032882155,0.9751926,0.008213491,0.000023436556],"about_ca_topic_score_codex":0.0014897408,"about_ca_topic_score_gemma":0.0023988707,"teacher_disagreement_score":0.011030874,"about_ca_system_score_codex":0.00039956073,"about_ca_system_score_gemma":0.000304803,"threshold_uncertainty_score":0.03690195},"labels":[],"label_agreement":null},{"id":"W2404002013","doi":"10.9734/bjmcs/2015/19380","title":"On the DAG Decomposition","year":2015,"lang":"en","type":"article","venue":"British Journal of Mathematics & Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Decomposition; Mathematics; Computer science; Chemistry","score_opus":0.039834141254032354,"score_gpt":0.318650714686656,"score_spread":0.27881657343262367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404002013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058876615,0.008445877,0.63131744,0.028473578,0.005541726,0.00018119268,0.002523044,0.0015948552,0.26304576],"genre_scores_gemma":[0.44223216,0.011026788,0.25347593,0.008262172,0.006303499,0.00042403617,0.006215492,0.0023185683,0.26974142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924845,0.0002395004,0.000031144275,0.00023997664,0.00012388923,0.000117051786],"domain_scores_gemma":[0.99840087,0.00061660714,0.00009368378,0.0003392418,0.0002929111,0.0002567045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010787603,0.0013218883,0.0012134764,0.0018859663,0.0019075939,0.003235614,0.0011633348,0.0012792356,0.03198196],"category_scores_gemma":[0.0061918898,0.0006646509,0.0015145001,0.0034214193,0.0020151762,0.005623672,0.0031526077,0.0042170812,0.0068616527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076828095,0.000061337465,0.0003296597,0.0001801727,0.00002456768,0.00009744267,0.0001993982,0.005420642,0.0008167689,0.87602335,0.059641596,0.057128243],"study_design_scores_gemma":[0.00000832781,0.000005651453,0.00009730446,0.00003414789,0.000007798879,0.0000356823,0.000035524616,0.0054167286,0.00010461149,0.97842133,0.015827727,0.0000051943907],"about_ca_topic_score_codex":0.0041273814,"about_ca_topic_score_gemma":0.0047116694,"teacher_disagreement_score":0.03198196,"about_ca_system_score_codex":0.0019851434,"about_ca_system_score_gemma":0.0012525909,"threshold_uncertainty_score":0.10699034},"labels":[],"label_agreement":null},{"id":"W2404003086","doi":"","title":"The Hamiltonicity of k-Connected [s, t]-Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02613998589114777,"score_gpt":0.2833053795794481,"score_spread":0.2571653936883004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404003086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77468175,0.0009327607,0.05586246,0.0027127664,0.00019194794,0.00012990834,0.0017022245,0.00029886895,0.16348726],"genre_scores_gemma":[0.97731584,0.00044656207,0.006420325,0.000276063,0.000054610995,0.00006053759,0.000623825,0.000049999486,0.014752201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997452,0.00006853666,0.000015197106,0.000058375368,0.00004857197,0.00006400321],"domain_scores_gemma":[0.998511,0.0006839949,0.00028776604,0.000156013,0.00019194046,0.0001691031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020843944,0.00023323836,0.00026489343,0.0008402225,0.0011871549,0.0017092378,0.0005742208,0.0007697751,0.008553299],"category_scores_gemma":[0.0025488434,0.00033665227,0.00038062566,0.0010028802,0.0015597148,0.0018637966,0.0011337693,0.0007129812,0.00093506277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015941075,0.000025262309,0.001220615,0.000117072246,0.000026749118,0.00036128054,0.0005065363,0.0029294705,0.0042334413,0.9712762,0.0060663726,0.013077635],"study_design_scores_gemma":[0.000039885355,0.000023438628,0.0011131321,0.000029740118,0.00002029046,0.00025661057,0.0002912766,0.0071974597,0.0013138404,0.98445904,0.0052390886,0.000016146247],"about_ca_topic_score_codex":0.004133542,"about_ca_topic_score_gemma":0.005149715,"teacher_disagreement_score":0.008553299,"about_ca_system_score_codex":0.00078028085,"about_ca_system_score_gemma":0.0006939972,"threshold_uncertainty_score":0.028613627},"labels":[],"label_agreement":null},{"id":"W2404107916","doi":"","title":"Characterizations and Structure of Sequential Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010124542616694543,"score_gpt":0.2571487610710402,"score_spread":0.24702421845434563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404107916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28917986,0.0027089654,0.5906938,0.0034781995,0.00033960238,0.00041817245,0.004960681,0.0018608284,0.10636002],"genre_scores_gemma":[0.8181113,0.0019238801,0.14254421,0.00072268624,0.0006583065,0.0004170658,0.007396504,0.00064504566,0.02758104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982332,0.0004070649,0.0001624733,0.00064051873,0.00036513933,0.00019163122],"domain_scores_gemma":[0.98838985,0.0053796293,0.0022518365,0.0019351647,0.0012662022,0.0007772689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010648962,0.0008677077,0.00071790285,0.0043864935,0.0018216808,0.0045105675,0.0016131595,0.0012174131,0.01217368],"category_scores_gemma":[0.011545377,0.00084772124,0.0010413205,0.005444914,0.002729301,0.010010022,0.0018759838,0.0022228495,0.0019506095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010473715,0.00008107704,0.002219513,0.00022730013,0.00002848437,0.00020150412,0.000842155,0.0027499122,0.0032600362,0.9613019,0.0044261776,0.024557097],"study_design_scores_gemma":[0.000015595253,0.00004117636,0.0011170077,0.000068875925,0.0000338599,0.0005433401,0.0003988935,0.010149798,0.0015496907,0.96832466,0.017736524,0.00002058348],"about_ca_topic_score_codex":0.0011769964,"about_ca_topic_score_gemma":0.0014981569,"teacher_disagreement_score":0.01217368,"about_ca_system_score_codex":0.001873463,"about_ca_system_score_gemma":0.0009873445,"threshold_uncertainty_score":0.040725052},"labels":[],"label_agreement":null},{"id":"W2404156276","doi":"","title":"Long Paths containing k-ordered vertices in Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014797750166804078,"score_gpt":0.2744156440679045,"score_spread":0.2596178939011004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404156276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5753814,0.004979477,0.28654307,0.003721446,0.0010756203,0.00026438653,0.006526425,0.002728372,0.11877971],"genre_scores_gemma":[0.81883734,0.002846314,0.122532256,0.00079979067,0.00028032967,0.0002698937,0.004469188,0.0006944611,0.049270317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917465,0.00017066047,0.00007842237,0.00021943226,0.00015888383,0.00019791337],"domain_scores_gemma":[0.9929248,0.0037308538,0.0012078361,0.00074008154,0.0007071956,0.0006891757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001473,0.00057946565,0.00052303955,0.0020101613,0.002594464,0.002802635,0.001143412,0.0018840419,0.014874608],"category_scores_gemma":[0.0070456476,0.0007519055,0.0006416212,0.002600635,0.0014699978,0.005866484,0.0025282213,0.001761915,0.0044643874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075054326,0.00014463712,0.004612303,0.0009825743,0.000094306924,0.0022767356,0.0013389268,0.00936653,0.015093903,0.8711792,0.018828606,0.07533174],"study_design_scores_gemma":[0.000038825132,0.00006267992,0.0011104795,0.00017542193,0.000047001988,0.0010256339,0.0005818924,0.009362437,0.004368965,0.9594188,0.02376751,0.00004033342],"about_ca_topic_score_codex":0.0011644418,"about_ca_topic_score_gemma":0.0030193413,"teacher_disagreement_score":0.014874608,"about_ca_system_score_codex":0.0010814401,"about_ca_system_score_gemma":0.0008659736,"threshold_uncertainty_score":0.04976052},"labels":[],"label_agreement":null},{"id":"W2404232981","doi":"","title":"Note on the number of rooted complete N-ary trees.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.020299227730678764,"score_gpt":0.2957994487092154,"score_spread":0.2755002209785366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404232981","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1285751,0.025681147,0.17128901,0.040574033,0.007583492,0.00019119993,0.007032763,0.0014727426,0.61760056],"genre_scores_gemma":[0.7970788,0.019575631,0.107622765,0.003703555,0.0063073626,0.00047252624,0.0033831415,0.000565301,0.061290897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745435,0.0004180917,0.00016016098,0.00080716464,0.00083785376,0.00032240586],"domain_scores_gemma":[0.97918653,0.01582626,0.0007940269,0.0017965084,0.0012338258,0.0011628564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021189968,0.00072750007,0.0013200049,0.003426255,0.001865957,0.0039740754,0.0025262018,0.0015337464,0.01900572],"category_scores_gemma":[0.016043374,0.0006162135,0.0009525679,0.0034695049,0.0036445772,0.009052089,0.0034831644,0.0042503914,0.002819387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004870277,0.000086850305,0.0031800668,0.0008010336,0.00009039283,0.00047917964,0.00022099316,0.0053038,0.0033747198,0.8677962,0.05007229,0.06810752],"study_design_scores_gemma":[0.000047834998,0.00007150201,0.0021415742,0.00011265249,0.00007485789,0.0012644739,0.0001003704,0.0055452613,0.0018844558,0.9409974,0.04772563,0.00003410524],"about_ca_topic_score_codex":0.0009617029,"about_ca_topic_score_gemma":0.001601219,"teacher_disagreement_score":0.01900572,"about_ca_system_score_codex":0.0013262528,"about_ca_system_score_gemma":0.0010412273,"threshold_uncertainty_score":0.06358045},"labels":[],"label_agreement":null},{"id":"W2404421201","doi":"","title":"The cordiality of the complement of a graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Complement (music); Mathematics; Graph; Combinatorics","score_opus":0.01919454894763078,"score_gpt":0.28610220613432136,"score_spread":0.2669076571866906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404421201","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18531507,0.0043290965,0.22523886,0.007595012,0.002500117,0.0001004071,0.0015402086,0.00064657006,0.5727347],"genre_scores_gemma":[0.8771061,0.0025142066,0.050153818,0.0021243158,0.0016568693,0.00012957408,0.0011217617,0.00037745843,0.064815946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986822,0.00035861414,0.000062187115,0.00040911805,0.0002935102,0.00019439343],"domain_scores_gemma":[0.99587774,0.0019226272,0.00037569116,0.0006063411,0.0007179285,0.0004996174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009126738,0.00060759886,0.0007013735,0.0026912752,0.0029053409,0.004600235,0.0010106277,0.0012643901,0.016699323],"category_scores_gemma":[0.0069526294,0.00045337866,0.0009315543,0.0019775343,0.0065617654,0.007318149,0.0034005435,0.0032891864,0.002302315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024549476,0.000006644925,0.00011319899,0.000026689992,0.000004745591,0.00005270365,0.000121697885,0.0001644416,0.000332236,0.9923718,0.0019655423,0.004815715],"study_design_scores_gemma":[0.000008018839,0.000012008373,0.00016903308,0.00002678323,0.000008775934,0.00018610156,0.00008002564,0.0011305418,0.00047205156,0.9838922,0.014003958,0.000010530117],"about_ca_topic_score_codex":0.0033308323,"about_ca_topic_score_gemma":0.0029096913,"teacher_disagreement_score":0.016699323,"about_ca_system_score_codex":0.0015878818,"about_ca_system_score_gemma":0.0010830057,"threshold_uncertainty_score":0.05586475},"labels":[],"label_agreement":null},{"id":"W2404426095","doi":"","title":"The Signed Total Domination Number of Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Graph; Vertex (graph theory)","score_opus":0.017725726149767678,"score_gpt":0.2737648429059831,"score_spread":0.2560391167562154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404426095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67302567,0.0021463083,0.11888194,0.0021599499,0.00069136726,0.000088265195,0.0032842527,0.0006526694,0.19906966],"genre_scores_gemma":[0.97597945,0.00083777134,0.009230552,0.00015940638,0.00022583647,0.0000845744,0.000736529,0.00010095062,0.012644941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992513,0.00018820037,0.00005232983,0.00013566078,0.00024258297,0.00013003343],"domain_scores_gemma":[0.9948835,0.0026931171,0.00072415237,0.00048677233,0.0006459468,0.0005665472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081959466,0.00044507353,0.00045701218,0.0028045173,0.00086300564,0.0026747342,0.00078054075,0.00060108927,0.009369181],"category_scores_gemma":[0.008151636,0.00021634345,0.00028057455,0.0019147906,0.0016569613,0.0041827406,0.0011211145,0.0008941666,0.0009975239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031963247,0.000044965855,0.0037606622,0.00024669856,0.00005715533,0.00013151021,0.00030017958,0.007203284,0.0072214454,0.9009015,0.011037216,0.06877568],"study_design_scores_gemma":[0.00003684089,0.000060611314,0.002585624,0.00007120221,0.000043959462,0.0005075739,0.0001958271,0.020473506,0.0047582723,0.95486593,0.016362138,0.00003866065],"about_ca_topic_score_codex":0.00044844448,"about_ca_topic_score_gemma":0.0007602879,"teacher_disagreement_score":0.009369181,"about_ca_system_score_codex":0.0009957606,"about_ca_system_score_gemma":0.0006119489,"threshold_uncertainty_score":0.031343102},"labels":[],"label_agreement":null},{"id":"W2404683094","doi":"","title":"Characterisation Of Graphs On Domination Parameters.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.0233302204979648,"score_gpt":0.2840831426103755,"score_spread":0.2607529221124107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404683094","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29105335,0.002349377,0.28273183,0.0044484558,0.00042355116,0.0002735132,0.0028742515,0.0016530011,0.41419274],"genre_scores_gemma":[0.93360686,0.00089499104,0.02496667,0.00071954954,0.00036224138,0.00015544279,0.0019561436,0.0006525141,0.036685478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987703,0.0002750003,0.0000812504,0.00032942428,0.0003498326,0.00019421802],"domain_scores_gemma":[0.9939944,0.0029331183,0.0007652951,0.0009201768,0.0007299949,0.00065689953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008611513,0.00075399206,0.00068189175,0.0035100235,0.001817207,0.005227641,0.0016205952,0.0014736714,0.018528372],"category_scores_gemma":[0.0067710336,0.00048599264,0.0006001493,0.0032328041,0.0030314154,0.009006914,0.0025143428,0.0031593225,0.0024974071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006565284,0.000033036795,0.00074743095,0.00008859784,0.0000141404125,0.0001683785,0.00061084254,0.0010958647,0.0022079546,0.9790227,0.003711254,0.012234071],"study_design_scores_gemma":[0.00001237998,0.000011354572,0.00051336596,0.000049332506,0.000012242192,0.0003820377,0.00032694062,0.004039055,0.0012714943,0.97759277,0.01577122,0.000017910092],"about_ca_topic_score_codex":0.001060015,"about_ca_topic_score_gemma":0.0010620023,"teacher_disagreement_score":0.018528372,"about_ca_system_score_codex":0.0016797251,"about_ca_system_score_gemma":0.0006981053,"threshold_uncertainty_score":0.061983585},"labels":[],"label_agreement":null},{"id":"W2404723669","doi":"","title":"A Degree Condition for Graphs to Have (g, f)-Factors.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.04731212229158397,"score_gpt":0.3243610738014469,"score_spread":0.2770489515098629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404723669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5320674,0.0016638469,0.18286975,0.010370383,0.00253214,0.0004182139,0.0076944167,0.002952515,0.25943124],"genre_scores_gemma":[0.95199376,0.0005138199,0.02877114,0.0013659176,0.0009005973,0.0001832099,0.0025752028,0.00037086155,0.013325429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983132,0.00029004132,0.00015364512,0.0005378594,0.0002630312,0.00044223026],"domain_scores_gemma":[0.98685735,0.00659808,0.0008431109,0.0015854454,0.0016239714,0.0024920504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013993072,0.0006620993,0.00095218857,0.0015264278,0.0027496468,0.002727656,0.0010602196,0.002877129,0.020024536],"category_scores_gemma":[0.015695456,0.0007697817,0.0013613125,0.0010486007,0.0029341246,0.006573096,0.0025128901,0.003151535,0.0042844266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013985129,0.00027805628,0.0066606794,0.0003538575,0.000060487208,0.0011455059,0.0011775928,0.0030363947,0.021788483,0.9041547,0.032712016,0.027233625],"study_design_scores_gemma":[0.00035829868,0.00031160982,0.005696594,0.00017329349,0.00009826526,0.0026983495,0.0013230151,0.009300357,0.010653763,0.93808854,0.03114917,0.00014887447],"about_ca_topic_score_codex":0.0018184044,"about_ca_topic_score_gemma":0.0021114242,"teacher_disagreement_score":0.020024536,"about_ca_system_score_codex":0.0009042718,"about_ca_system_score_gemma":0.001321775,"threshold_uncertainty_score":0.066988766},"labels":[],"label_agreement":null},{"id":"W2404724826","doi":"","title":"Spanning trees with a bounded number of leaves in a claw-free graph","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Spanning tree; Minimum degree spanning tree; Claw; Graph; Bounded function; Trémaux tree; Minimum spanning tree; Discrete mathematics; Degree (music); Line graph; Pathwidth; Physics; Biology","score_opus":0.017776776517319338,"score_gpt":0.2891600823010217,"score_spread":0.27138330578370234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404724826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89418066,0.0008757697,0.09586963,0.0006773142,0.000028240267,0.000063137224,0.0006782779,0.00044898974,0.007178069],"genre_scores_gemma":[0.93182516,0.00054091145,0.061051145,0.00029487367,0.000057682417,0.00009811819,0.0012397306,0.00014886091,0.004743578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993519,0.00009730676,0.000051442905,0.00018143133,0.00015756681,0.0001602765],"domain_scores_gemma":[0.995628,0.0024251323,0.00053978723,0.0004107715,0.00029515574,0.0007011523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066095754,0.0006989354,0.0006830846,0.0013979718,0.0010944689,0.0014299995,0.0013900119,0.0013951216,0.0025806157],"category_scores_gemma":[0.0052442392,0.00090854726,0.0005643226,0.0012913493,0.0010010907,0.0030731864,0.0019179217,0.0012219214,0.00073467684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014595841,0.0005942536,0.01503474,0.0012149932,0.00031000178,0.0040059807,0.0031392546,0.13464527,0.2338175,0.5169329,0.011401006,0.07744454],"study_design_scores_gemma":[0.0002533457,0.00029877963,0.0065487446,0.0001492112,0.000146996,0.0034041393,0.0006239479,0.27771837,0.028563708,0.6733339,0.008876093,0.0000827887],"about_ca_topic_score_codex":0.001058269,"about_ca_topic_score_gemma":0.00226724,"teacher_disagreement_score":0.0025806157,"about_ca_system_score_codex":0.0007561824,"about_ca_system_score_gemma":0.0004688355,"threshold_uncertainty_score":0.008633018},"labels":[],"label_agreement":null},{"id":"W2404781106","doi":"","title":"A Sequential Locating Game on Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Mathematical economics","score_opus":0.01985553086630328,"score_gpt":0.28000909311008143,"score_spread":0.26015356224377817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404781106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22294252,0.000358271,0.59803253,0.0036022777,0.00026245584,0.0006766537,0.00083939265,0.0006244151,0.17266148],"genre_scores_gemma":[0.8180064,0.0004648055,0.13508034,0.0005220191,0.00009987586,0.00037855585,0.0005863953,0.00014358442,0.044718172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831855,0.0006960767,0.00009635571,0.00035271412,0.00027013526,0.0002660989],"domain_scores_gemma":[0.995507,0.0028098726,0.0002944499,0.00051500805,0.00025409888,0.00061962695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014009072,0.0007971449,0.00093145896,0.0006685169,0.0015809204,0.002911648,0.0022509603,0.0028156142,0.01690094],"category_scores_gemma":[0.0071636327,0.0005045809,0.0008263084,0.0010629162,0.0021342034,0.0068800724,0.002998252,0.001951749,0.0015291848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030541737,0.0001754306,0.00060006557,0.00020411804,0.000047413876,0.00035908096,0.00037554046,0.022400886,0.0035652637,0.9459659,0.006471803,0.019529037],"study_design_scores_gemma":[0.00012403262,0.00013228222,0.00020609045,0.000032056905,0.000040044237,0.0003184937,0.0003285353,0.084218755,0.001058915,0.90332544,0.010192445,0.000022818087],"about_ca_topic_score_codex":0.0016710161,"about_ca_topic_score_gemma":0.002336246,"teacher_disagreement_score":0.01690094,"about_ca_system_score_codex":0.0014666973,"about_ca_system_score_gemma":0.0016259226,"threshold_uncertainty_score":0.056539237},"labels":[],"label_agreement":null},{"id":"W2404905038","doi":"","title":"Boundary powerful k-alliances in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Alliance; Boundary (topology); Combinatorics; Graph; Offensive; Discrete mathematics; Mathematical analysis; Political science; Operations research","score_opus":0.01297498511765379,"score_gpt":0.2712440401254521,"score_spread":0.25826905500779834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404905038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5172976,0.0031344339,0.3948365,0.002797259,0.00014855497,0.0002579354,0.0013751675,0.0003819232,0.07977057],"genre_scores_gemma":[0.93369216,0.0013367538,0.057213873,0.0003114982,0.00020904325,0.00026729368,0.0006892138,0.000076004086,0.0062040747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710613,0.00092021533,0.00022605798,0.0008344821,0.0005389758,0.00037416068],"domain_scores_gemma":[0.9858628,0.008373185,0.0025367287,0.001345005,0.0006419963,0.0012402708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021945576,0.0008395883,0.0010142371,0.002353423,0.0025979101,0.0031056877,0.0014650676,0.0012999976,0.0048277443],"category_scores_gemma":[0.011006894,0.0007265142,0.0011578827,0.0024944497,0.0045146463,0.010580997,0.0037274396,0.002028859,0.0007935665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012981116,0.0000421999,0.0022210064,0.00024848874,0.00005918651,0.00030049597,0.0010674219,0.008298554,0.0025453547,0.96911937,0.0023194868,0.013648628],"study_design_scores_gemma":[0.000031502594,0.00006943104,0.0014421261,0.00007278406,0.00006917209,0.0012578579,0.00060455047,0.026407424,0.0016293237,0.9570754,0.011309499,0.000030856827],"about_ca_topic_score_codex":0.0005200434,"about_ca_topic_score_gemma":0.0006945755,"teacher_disagreement_score":0.0048277443,"about_ca_system_score_codex":0.001362413,"about_ca_system_score_gemma":0.0004053471,"threshold_uncertainty_score":0.016150415},"labels":[],"label_agreement":null},{"id":"W2404996762","doi":"","title":"Acyclic Total Colorings of Planar Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Planar; Discrete mathematics; Graph; Computer science; Computer graphics (images)","score_opus":0.027790670485247873,"score_gpt":0.2829276525119263,"score_spread":0.25513698202667845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404996762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38038543,0.0024215342,0.34726194,0.0023348932,0.0005641608,0.0001767388,0.0051025096,0.0017799899,0.2599729],"genre_scores_gemma":[0.8582784,0.0019753235,0.07058732,0.00076473795,0.0003261911,0.00015355808,0.0050588944,0.0005987118,0.062256906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994424,0.0001616681,0.000030885836,0.00012228313,0.00013184274,0.0001108305],"domain_scores_gemma":[0.9964568,0.001917139,0.0003879098,0.0004987022,0.00043189203,0.00030746873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005081812,0.00056126446,0.00038527642,0.0018173419,0.0011799538,0.0022816686,0.0008775532,0.000671038,0.01387283],"category_scores_gemma":[0.0035823854,0.0006522898,0.00071665604,0.0022547212,0.0012009912,0.002296937,0.0012019989,0.0014042204,0.0012349754],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009123312,0.0000437692,0.0011386964,0.00024847742,0.000037660946,0.00014735285,0.0003073919,0.006102564,0.0028788736,0.9385418,0.017224764,0.033237357],"study_design_scores_gemma":[0.000029167086,0.000021640006,0.0009373663,0.000046743437,0.00004049862,0.00029150417,0.000194549,0.01232977,0.0013236455,0.96476614,0.02000348,0.000015505451],"about_ca_topic_score_codex":0.0029835494,"about_ca_topic_score_gemma":0.0060203704,"teacher_disagreement_score":0.01387283,"about_ca_system_score_codex":0.0012686212,"about_ca_system_score_gemma":0.0005887656,"threshold_uncertainty_score":0.04640925},"labels":[],"label_agreement":null},{"id":"W2405356971","doi":"","title":"On the existence and the number of (2-d)-kernels in graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03151041872127789,"score_gpt":0.30050542928615226,"score_spread":0.26899501056487435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405356971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8355738,0.003020783,0.08066876,0.0050527873,0.00040241555,0.00008267845,0.0013452033,0.0003854366,0.07346812],"genre_scores_gemma":[0.9749428,0.0009844112,0.016527493,0.00028975547,0.00022085034,0.00009677117,0.0004354217,0.000095237076,0.0064073876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983931,0.00045102774,0.000106773936,0.00043459752,0.00026102312,0.00035347327],"domain_scores_gemma":[0.977485,0.014551313,0.0024373059,0.001747017,0.0011354209,0.0026438911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017111266,0.0005788074,0.0011917198,0.0030519047,0.002935951,0.0051088533,0.002605157,0.0030277125,0.008789746],"category_scores_gemma":[0.014466883,0.00095970347,0.0009286374,0.0020246897,0.0051640184,0.011061895,0.0037898603,0.002910639,0.0010608354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003560354,0.0001364108,0.0048989896,0.00029745913,0.00004326434,0.000190918,0.0005531146,0.004080067,0.00377814,0.9650844,0.0052894233,0.015291832],"study_design_scores_gemma":[0.0000614738,0.000062291336,0.0039732833,0.000116273586,0.000065805434,0.00089234137,0.00067699066,0.02479216,0.0029702191,0.9608509,0.005480271,0.00005798892],"about_ca_topic_score_codex":0.000887251,"about_ca_topic_score_gemma":0.0011429202,"teacher_disagreement_score":0.008789746,"about_ca_system_score_codex":0.0014891394,"about_ca_system_score_gemma":0.0006411096,"threshold_uncertainty_score":0.02940464},"labels":[],"label_agreement":null},{"id":"W2405359541","doi":"","title":"Generating 3-connected quadrangulations on surfaces","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01779331823970243,"score_gpt":0.27962684747481426,"score_spread":0.26183352923511183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405359541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6833798,0.00030521982,0.16982079,0.0008047724,0.0005603419,0.0002957577,0.0005622934,0.0009847253,0.14328618],"genre_scores_gemma":[0.8943757,0.00027158638,0.054364324,0.00035981342,0.0001070117,0.0001618367,0.00071433757,0.0008666758,0.048778664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995604,0.00009179656,0.00002176246,0.00007480736,0.00013780991,0.00011330434],"domain_scores_gemma":[0.99939466,0.00025811902,0.00006862333,0.0000961386,0.000076591015,0.00010590375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000250752,0.0009926718,0.00073192874,0.001283616,0.0013473174,0.0023213672,0.0012004628,0.0015880655,0.023926085],"category_scores_gemma":[0.0013733205,0.0007312751,0.0010473317,0.00113607,0.0014300416,0.0017299948,0.0028411017,0.0019441757,0.0035396582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015904168,0.00020440626,0.00091731874,0.00021860455,0.000037934555,0.00070954603,0.0010236735,0.01714893,0.013615938,0.9027851,0.0073298984,0.05584957],"study_design_scores_gemma":[0.000113983144,0.00010839939,0.0006578522,0.000072686846,0.000032478936,0.0005065461,0.00072898134,0.053741373,0.0086669205,0.9167946,0.018531233,0.00004491477],"about_ca_topic_score_codex":0.00066547585,"about_ca_topic_score_gemma":0.0013543635,"teacher_disagreement_score":0.023926085,"about_ca_system_score_codex":0.00078626396,"about_ca_system_score_gemma":0.00026890196,"threshold_uncertainty_score":0.08004069},"labels":[],"label_agreement":null},{"id":"W2405378676","doi":"","title":"The Diameters of Almost All Bi-Cayley Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cayley graph; Combinatorics; Graph","score_opus":0.01693888341381419,"score_gpt":0.26619785381850813,"score_spread":0.24925897040469394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405378676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6553141,0.0051602963,0.104176,0.0048727137,0.0008113742,0.00008379307,0.0038739482,0.00067132054,0.22503652],"genre_scores_gemma":[0.9474356,0.0025129858,0.024609098,0.00074120966,0.00062203204,0.0001551109,0.0017479125,0.00021057413,0.021965636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934787,0.00017463823,0.00004256935,0.00016014888,0.00015961261,0.00011516558],"domain_scores_gemma":[0.9943403,0.002790067,0.0008586397,0.00052329,0.00068743865,0.0008002273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064785435,0.00062965835,0.00049016706,0.002033068,0.0011793914,0.0029347413,0.0012075636,0.0009651354,0.0076577896],"category_scores_gemma":[0.0075234734,0.00068179815,0.0003875014,0.0012720986,0.0013077611,0.004462288,0.0015951754,0.0017095356,0.0018481278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013900903,0.000023337927,0.0014758433,0.00011628394,0.000028797147,0.000086206805,0.00032588525,0.0020089764,0.0039299424,0.96227354,0.01042383,0.019168325],"study_design_scores_gemma":[0.000027528735,0.000028659828,0.0025448133,0.0000534714,0.00003239869,0.00055621425,0.00032028303,0.010376591,0.0024949259,0.9641556,0.019389892,0.000019716612],"about_ca_topic_score_codex":0.00081794994,"about_ca_topic_score_gemma":0.0011234301,"teacher_disagreement_score":0.0076577896,"about_ca_system_score_codex":0.0008043671,"about_ca_system_score_gemma":0.00040197044,"threshold_uncertainty_score":0.025617898},"labels":[],"label_agreement":null},{"id":"W2405439435","doi":"","title":"Stable Well-Covered Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013570825426856514,"score_gpt":0.2684787006737458,"score_spread":0.2549078752468893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405439435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48877978,0.0029691753,0.19325046,0.0036700368,0.00045196648,0.00012893174,0.0033408355,0.0011041234,0.30630463],"genre_scores_gemma":[0.925368,0.0014377473,0.014994392,0.00041389334,0.00026595764,0.0000822817,0.002332397,0.0002450904,0.054860283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994159,0.00011116735,0.000025992393,0.00013506587,0.00019119303,0.00012073133],"domain_scores_gemma":[0.9982779,0.00073676015,0.00019512734,0.00026293163,0.00027968676,0.0002475379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040792412,0.0005029387,0.0005508418,0.0017960969,0.0013471422,0.0021765118,0.00061457296,0.00084587274,0.015313241],"category_scores_gemma":[0.002286501,0.00046021593,0.00048814018,0.001280421,0.00095410924,0.0042359214,0.0014916983,0.0010698666,0.0028459285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010259043,0.000038550374,0.0010992567,0.00010128416,0.00003965819,0.00030386538,0.00037173423,0.0013130897,0.0046270993,0.96016836,0.011856279,0.019978141],"study_design_scores_gemma":[0.000022053004,0.000024122906,0.0011999928,0.000035209156,0.000042558575,0.0006069859,0.00026611035,0.0070626102,0.003640747,0.9633626,0.023721348,0.000015761609],"about_ca_topic_score_codex":0.0007920166,"about_ca_topic_score_gemma":0.0014482167,"teacher_disagreement_score":0.015313241,"about_ca_system_score_codex":0.00076869974,"about_ca_system_score_gemma":0.0003869824,"threshold_uncertainty_score":0.051227868},"labels":[],"label_agreement":null},{"id":"W2405502509","doi":"","title":"θ-graphs of partial cubes and strong edge colorings.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.017846575939835834,"score_gpt":0.28261183447950045,"score_spread":0.2647652585396646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405502509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3275872,0.0021178613,0.3574241,0.0045185606,0.00076525315,0.00018091057,0.002734226,0.0009910722,0.30368087],"genre_scores_gemma":[0.87161785,0.0015331944,0.06974729,0.0012501795,0.0003235233,0.0002308263,0.002457484,0.00027515547,0.052564424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992803,0.00023041083,0.000038185135,0.00016587389,0.000121233075,0.00016396827],"domain_scores_gemma":[0.9964309,0.0016489142,0.00060817396,0.00047969777,0.0003849761,0.00044735716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005506896,0.0006328202,0.00044835318,0.0010450259,0.001531485,0.0023996981,0.0011022766,0.00094771653,0.019205254],"category_scores_gemma":[0.004386733,0.0007166383,0.00078598945,0.0016247953,0.0018804228,0.0049190084,0.0021874686,0.0019490181,0.0020960025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075135846,0.000023846156,0.00059486536,0.000081532584,0.000019336141,0.00012391788,0.00014256143,0.001895958,0.0009878789,0.97645426,0.0058321417,0.013768477],"study_design_scores_gemma":[0.00002148191,0.000018282964,0.0005701034,0.000037040398,0.000020938107,0.0003129422,0.00024985237,0.004252498,0.00076379033,0.9800126,0.013729274,0.00001121921],"about_ca_topic_score_codex":0.0015484587,"about_ca_topic_score_gemma":0.0021459053,"teacher_disagreement_score":0.019205254,"about_ca_system_score_codex":0.00095028034,"about_ca_system_score_gemma":0.0006140536,"threshold_uncertainty_score":0.064247966},"labels":[],"label_agreement":null},{"id":"W2405545741","doi":"","title":"Maximum Detour Index of Unicyclic Graphs with Given Maximum Degree.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Degree (music); Combinatorics; Statistics; Computer science; Physics; World Wide Web","score_opus":0.03357057070404769,"score_gpt":0.25792935872662576,"score_spread":0.22435878802257808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405545741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9227384,0.00072332704,0.026361989,0.0007023294,0.00007575752,0.000038784034,0.0016430623,0.00027628013,0.047440086],"genre_scores_gemma":[0.988806,0.00037554273,0.0050093425,0.000045909423,0.000044702545,0.00002862726,0.0005851219,0.00005572104,0.0050490187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995869,0.00010018542,0.000023584294,0.00006597307,0.000102272046,0.00012118287],"domain_scores_gemma":[0.9964064,0.0017279675,0.0005947495,0.00035334224,0.0003808532,0.0005367573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004429585,0.00037791237,0.0005595272,0.0019235718,0.0012983957,0.0021291259,0.0008632956,0.0006782454,0.0039339554],"category_scores_gemma":[0.0052517666,0.00023374638,0.00023970287,0.0014273789,0.000878612,0.0021070363,0.0010134551,0.00063232303,0.00060930056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028355033,0.0002668849,0.01610782,0.00087350555,0.00012639929,0.0010853057,0.0020565141,0.042902578,0.05406836,0.7862223,0.015267636,0.07818712],"study_design_scores_gemma":[0.00017501047,0.00026933843,0.010172232,0.00017902086,0.00012463736,0.001821587,0.0012339276,0.119979665,0.02758673,0.81416404,0.02421428,0.00007960679],"about_ca_topic_score_codex":0.0010822127,"about_ca_topic_score_gemma":0.0020851258,"teacher_disagreement_score":0.0039339554,"about_ca_system_score_codex":0.0011831243,"about_ca_system_score_gemma":0.00046794568,"threshold_uncertainty_score":0.013160408},"labels":[],"label_agreement":null},{"id":"W2405578918","doi":"","title":"Dominating cycles in triangle-free graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Independence number; Graph; Dominating set; Connectivity; Discrete mathematics; Vertex (graph theory)","score_opus":0.0340622158210912,"score_gpt":0.2772688516101176,"score_spread":0.2432066357890264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405578918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54049635,0.004659649,0.34575143,0.001184986,0.00029987487,0.0002537524,0.0012912506,0.00040093498,0.10566173],"genre_scores_gemma":[0.9146043,0.0024342134,0.06372203,0.00049902033,0.00017779692,0.0001673987,0.0015210294,0.00010358111,0.01677056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937195,0.000105580664,0.000043855533,0.00015718126,0.00018013413,0.00014137056],"domain_scores_gemma":[0.9973316,0.0014324387,0.00041719532,0.00025557043,0.00026361344,0.00029961273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000416647,0.00046196434,0.00033647852,0.0014140643,0.0012114247,0.0012591255,0.0006701148,0.0006618668,0.0055166176],"category_scores_gemma":[0.003521201,0.0004750671,0.000636462,0.0015574665,0.0010447268,0.0019972685,0.001447508,0.00083571114,0.00071923237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005397202,0.00008217025,0.007958034,0.0007870974,0.00010229628,0.0018873535,0.0017336938,0.019177895,0.032633748,0.8296762,0.008670024,0.0967518],"study_design_scores_gemma":[0.000065878994,0.000112686386,0.003615522,0.000117813775,0.00008255484,0.002856308,0.0005462603,0.04638492,0.014733634,0.8869878,0.044446547,0.000050037102],"about_ca_topic_score_codex":0.0017419187,"about_ca_topic_score_gemma":0.0027140342,"teacher_disagreement_score":0.0055166176,"about_ca_system_score_codex":0.0007460002,"about_ca_system_score_gemma":0.00033070083,"threshold_uncertainty_score":0.01845491},"labels":[],"label_agreement":null},{"id":"W2405614798","doi":"","title":"The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Class (philosophy); Integer (computer science); Discrete mathematics; Graph; Planar graph; Computer science; Artificial intelligence","score_opus":0.011205868209185203,"score_gpt":0.25843431065947703,"score_spread":0.24722844245029182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405614798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8554907,0.000659291,0.03623368,0.00089202117,0.000104037106,0.000036939255,0.00063451816,0.00025704334,0.10569189],"genre_scores_gemma":[0.9909875,0.000257119,0.0033729319,0.00008213567,0.00008139319,0.000016967266,0.0003721382,0.000030236552,0.0047995565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998154,0.00003461034,0.000008162274,0.0000531433,0.000039964947,0.000048818918],"domain_scores_gemma":[0.998696,0.00067048275,0.00026713722,0.00013140209,0.00007192897,0.00016302911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015304156,0.00022682354,0.00025141105,0.0008350219,0.0007445581,0.0015008814,0.0004851579,0.0005603878,0.005354281],"category_scores_gemma":[0.0017185508,0.00017534754,0.00024505876,0.0007788052,0.0008201958,0.0012929856,0.00061835494,0.0007875013,0.00045970496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025661525,0.000083633175,0.0069921003,0.0001712559,0.00003175638,0.0011710763,0.00060152775,0.009309158,0.010217321,0.9245775,0.007831819,0.038756315],"study_design_scores_gemma":[0.00006145352,0.00008291222,0.005288362,0.00005005168,0.00004136506,0.0021918113,0.00052920345,0.04822105,0.0036459223,0.9219577,0.017903479,0.000026770887],"about_ca_topic_score_codex":0.0006314363,"about_ca_topic_score_gemma":0.0008893133,"teacher_disagreement_score":0.005354281,"about_ca_system_score_codex":0.0004356659,"about_ca_system_score_gemma":0.00018592771,"threshold_uncertainty_score":0.017911851},"labels":[],"label_agreement":null},{"id":"W2405659013","doi":"","title":"Independent sets in trees.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.015495804366295458,"score_gpt":0.2755330185237369,"score_spread":0.26003721415744147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405659013","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049510535,0.034414727,0.25696462,0.011483121,0.0030965125,0.00014265484,0.0025536097,0.0009241543,0.64091],"genre_scores_gemma":[0.65436435,0.02206998,0.116651736,0.0038593393,0.006113243,0.00044247354,0.004375578,0.00069426943,0.19142896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991605,0.00021819922,0.00004998649,0.00017654427,0.00028321217,0.00011145631],"domain_scores_gemma":[0.9980445,0.0011896006,0.00012746447,0.00024756382,0.00021343614,0.00017744921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007797015,0.0006370549,0.001088331,0.003144623,0.002139802,0.0032543037,0.0012251256,0.0013844998,0.016057601],"category_scores_gemma":[0.003149103,0.00078306335,0.0011254353,0.003445788,0.0023859593,0.00620942,0.0024326178,0.004343079,0.006028211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016686348,0.000020073481,0.00018127196,0.000098000244,0.000014359409,0.000066108354,0.00022707299,0.0004973285,0.00029416804,0.9675974,0.013480061,0.017507536],"study_design_scores_gemma":[0.0000064999804,0.000004427912,0.00018947403,0.000026646918,0.000011721151,0.00015548742,0.00006175167,0.0012445246,0.00016620259,0.9763796,0.021748286,0.0000054686643],"about_ca_topic_score_codex":0.0011618675,"about_ca_topic_score_gemma":0.0018257891,"teacher_disagreement_score":0.016057601,"about_ca_system_score_codex":0.001506231,"about_ca_system_score_gemma":0.00069860974,"threshold_uncertainty_score":0.05371803},"labels":[],"label_agreement":null},{"id":"W2405693563","doi":"","title":"Graphs with complete minimal k-vertex separators.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Vertex (graph theory); Maximal independent set; Separator (oil production); Clique-sum; Discrete mathematics; Indifference graph; Split graph; Graph; 1-planar graph; Physics","score_opus":0.021869780911674106,"score_gpt":0.27722341290001556,"score_spread":0.25535363198834143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405693563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51979285,0.002931064,0.3170898,0.0022227732,0.0004999935,0.00028786788,0.0025243529,0.0006308424,0.15402038],"genre_scores_gemma":[0.9139543,0.00064086606,0.06461044,0.00043174505,0.00010883345,0.00011232494,0.0013207115,0.000079674086,0.018741166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997346,0.00004935009,0.000013862073,0.000069264235,0.000072311435,0.000060599148],"domain_scores_gemma":[0.9991748,0.0003104666,0.00016183843,0.00014069014,0.000114308634,0.00009778492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023652066,0.0003801829,0.00027403032,0.0005739376,0.0010604889,0.0007411276,0.00055913744,0.00047835155,0.002952815],"category_scores_gemma":[0.0016980408,0.00030769967,0.0005149547,0.0006753229,0.00085225195,0.0016327066,0.0011885552,0.00090921886,0.0007117942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021456079,0.000030793046,0.001170509,0.00022442696,0.0000617611,0.00045280918,0.0005231666,0.006553909,0.009981392,0.93928957,0.00706597,0.034431234],"study_design_scores_gemma":[0.000033904627,0.000041427233,0.0009511699,0.000032129075,0.000028490773,0.00044954667,0.00013578702,0.006959446,0.0034293164,0.9606821,0.02723826,0.000018475248],"about_ca_topic_score_codex":0.0006914858,"about_ca_topic_score_gemma":0.001118955,"teacher_disagreement_score":0.002952815,"about_ca_system_score_codex":0.00065462204,"about_ca_system_score_gemma":0.0004909643,"threshold_uncertainty_score":0.009878159},"labels":[],"label_agreement":null},{"id":"W2405879761","doi":"","title":"A note on the graphs with given small matching number.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Statistics","score_opus":0.029044962929171775,"score_gpt":0.2824514324751962,"score_spread":0.2534064695460244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405879761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06848321,0.033699367,0.43035492,0.045106225,0.02501509,0.00021227235,0.0015323593,0.0019280444,0.39366847],"genre_scores_gemma":[0.6591201,0.02311542,0.21491157,0.009750521,0.014424718,0.00032824633,0.0011560884,0.000940225,0.07625314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992483,0.00025161545,0.000036995778,0.00023454949,0.00016436899,0.00006404324],"domain_scores_gemma":[0.9956098,0.0025985916,0.00023089815,0.00077772693,0.00046180026,0.00032122462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012683705,0.0006377061,0.00090098946,0.0014251216,0.0016667815,0.0014668766,0.001788518,0.0012768717,0.010103517],"category_scores_gemma":[0.009431753,0.0003036411,0.0007444357,0.001736225,0.002143543,0.005313304,0.0020432023,0.0035258252,0.0018803566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014973273,0.000040083873,0.00058759813,0.00055282394,0.00003388563,0.00055094284,0.00018638663,0.002739586,0.0033760015,0.8947076,0.052050494,0.045024686],"study_design_scores_gemma":[0.000012611517,0.00003566449,0.0006682939,0.000058341877,0.000029128141,0.00060730556,0.00008296924,0.0045002694,0.0009387339,0.9407569,0.05228714,0.000022700102],"about_ca_topic_score_codex":0.00095657277,"about_ca_topic_score_gemma":0.0014142246,"teacher_disagreement_score":0.010103517,"about_ca_system_score_codex":0.0010499576,"about_ca_system_score_gemma":0.0005987073,"threshold_uncertainty_score":0.03379965},"labels":[],"label_agreement":null},{"id":"W2406017774","doi":"","title":"Domination In The Cross Product Of Digraphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cross product; Product (mathematics); Combinatorics; Geometry","score_opus":0.012294303277651677,"score_gpt":0.3021413337009847,"score_spread":0.28984703042333304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406017774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6569527,0.0017490006,0.18254831,0.0010690723,0.00012538357,0.00009727851,0.0007698979,0.00034407523,0.15634423],"genre_scores_gemma":[0.94353676,0.0008431621,0.02064233,0.0002310392,0.00012991371,0.00008608056,0.0006313556,0.00012468861,0.033774626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990175,0.00029803082,0.000056762372,0.00024279188,0.00022342455,0.00016143468],"domain_scores_gemma":[0.99485826,0.0032046796,0.00052041304,0.0003930757,0.00046825848,0.00055532774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008504826,0.0003872169,0.0005324703,0.0019884205,0.0014476514,0.0028104298,0.0007370952,0.0007234218,0.010854647],"category_scores_gemma":[0.0054547456,0.00051160133,0.0005222875,0.0015787159,0.0015155041,0.003937847,0.0021497428,0.0010493196,0.0010912499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008585295,0.00003802543,0.0024639543,0.00011122229,0.000045039036,0.000511453,0.0008140337,0.0031292522,0.0029368624,0.96277934,0.0030885818,0.023996476],"study_design_scores_gemma":[0.000037984486,0.00005804622,0.0022792874,0.0000681766,0.00007897229,0.0014373477,0.0005068038,0.02544978,0.003333578,0.94540733,0.02131335,0.000029287263],"about_ca_topic_score_codex":0.0014625787,"about_ca_topic_score_gemma":0.0023093545,"teacher_disagreement_score":0.010854647,"about_ca_system_score_codex":0.0010262404,"about_ca_system_score_gemma":0.00045026987,"threshold_uncertainty_score":0.03631234},"labels":[],"label_agreement":null},{"id":"W2406020986","doi":"","title":"The Vertices of Lower Degree in Contraction-Critical k-Connected Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Contraction (grammar); Combinatorics; Degree (music); Physics; Internal medicine; Medicine","score_opus":0.03778802458224832,"score_gpt":0.29298102535967374,"score_spread":0.2551930007774254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406020986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9432269,0.00039558468,0.020309146,0.00092008745,0.000097943586,0.000040427516,0.00036138683,0.000104929124,0.034543533],"genre_scores_gemma":[0.98502284,0.00024901106,0.005910823,0.00014859205,0.00004163333,0.000038515373,0.00034214396,0.00005299426,0.008193466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997532,0.000051206047,0.0000105242425,0.000052329557,0.00004625225,0.00008659885],"domain_scores_gemma":[0.9978405,0.00086280063,0.00033636895,0.0001917973,0.00025372353,0.00051472354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027205423,0.00037888144,0.00041175447,0.0015534903,0.0016100269,0.0018045212,0.00068080897,0.0009442825,0.007650858],"category_scores_gemma":[0.0035233882,0.0004358333,0.00028914682,0.00094005355,0.0017798626,0.0016963483,0.0012476441,0.0010146361,0.0009269269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009473302,0.00013012796,0.010315752,0.00036952237,0.000039054812,0.002016158,0.0029101996,0.01119215,0.033294436,0.890852,0.009944082,0.03798921],"study_design_scores_gemma":[0.0001385938,0.00009085042,0.009086646,0.00016962027,0.000065583234,0.0017178778,0.0023881656,0.025948016,0.015278978,0.9295365,0.015527018,0.00005212859],"about_ca_topic_score_codex":0.0019627335,"about_ca_topic_score_gemma":0.0034231385,"teacher_disagreement_score":0.007650858,"about_ca_system_score_codex":0.0005920274,"about_ca_system_score_gemma":0.00044364264,"threshold_uncertainty_score":0.025594652},"labels":[],"label_agreement":null},{"id":"W2406179673","doi":"","title":"Note On odd path extendable graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Combinatorics; Computer science; Programming language","score_opus":0.014090335045029358,"score_gpt":0.2849480019081853,"score_spread":0.27085766686315593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406179673","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0641589,0.012106108,0.12385953,0.02573372,0.015326867,0.00014405466,0.001309827,0.0009908141,0.75637025],"genre_scores_gemma":[0.67049146,0.030817132,0.10051608,0.013266765,0.012642095,0.00022956959,0.0016468607,0.0006206797,0.16976938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996952,0.00005316535,0.000013577599,0.00008770008,0.00009656498,0.000053821703],"domain_scores_gemma":[0.99837935,0.00094954163,0.00007964343,0.00024869153,0.00016622769,0.00017652792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065104297,0.00077275577,0.00054289965,0.0010934882,0.0013783376,0.0011246835,0.0010451488,0.00066496263,0.016952707],"category_scores_gemma":[0.0021186885,0.00020806416,0.0006346264,0.0012432922,0.0018243559,0.0039859316,0.0028007806,0.0029576877,0.0018721535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014384529,0.000056034223,0.0007232896,0.00042176075,0.000027343145,0.0012420377,0.0003308128,0.0012896466,0.0032899163,0.8912568,0.051144667,0.050073914],"study_design_scores_gemma":[0.0000123752925,0.000049568913,0.0010079087,0.0000586204,0.000029592093,0.000836247,0.00011375182,0.0008887566,0.0009396149,0.8692941,0.12675159,0.000017875826],"about_ca_topic_score_codex":0.001415709,"about_ca_topic_score_gemma":0.0021923315,"teacher_disagreement_score":0.016952707,"about_ca_system_score_codex":0.00050413504,"about_ca_system_score_gemma":0.00037337485,"threshold_uncertainty_score":0.05671239},"labels":[],"label_agreement":null},{"id":"W2406194317","doi":"","title":"Edge colorings of planar graphs with maximum degree five.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Planar graph; Enhanced Data Rates for GSM Evolution; Planar; Graph; Artificial intelligence; Computer science; Physics; Computer graphics (images)","score_opus":0.03775239169665943,"score_gpt":0.25280587512344765,"score_spread":0.21505348342678823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406194317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7638515,0.0012131671,0.09700886,0.0019384563,0.00032731108,0.00010144219,0.0017325775,0.0007310618,0.13309556],"genre_scores_gemma":[0.9495378,0.0004392054,0.029196346,0.00026997027,0.00006884882,0.00003954255,0.0012565696,0.0001359229,0.01905581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962556,0.00009612239,0.000018173845,0.00006604241,0.0000693069,0.00012470198],"domain_scores_gemma":[0.99818414,0.0008681844,0.00026450944,0.0002359658,0.00018295756,0.0002641671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030016014,0.000385482,0.00029685293,0.0010486546,0.0011945633,0.0014478859,0.00086434215,0.0007594277,0.009190301],"category_scores_gemma":[0.0025583387,0.00046398278,0.0004470665,0.0011292492,0.00096755504,0.0012387548,0.0009693774,0.0010039227,0.0009726347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005209569,0.00016184637,0.005441803,0.00030476443,0.000058935588,0.00080481876,0.00078749354,0.025031937,0.013317894,0.8698819,0.024578564,0.059109032],"study_design_scores_gemma":[0.0001227235,0.000094980904,0.0060138316,0.00010339057,0.00006194959,0.0010392544,0.00085381867,0.051142454,0.0065018786,0.9045839,0.0294296,0.000052231604],"about_ca_topic_score_codex":0.0029946323,"about_ca_topic_score_gemma":0.005101989,"teacher_disagreement_score":0.009190301,"about_ca_system_score_codex":0.0009100031,"about_ca_system_score_gemma":0.00045902384,"threshold_uncertainty_score":0.030744612},"labels":[],"label_agreement":null},{"id":"W2406306592","doi":"","title":"Defensive alliances in regular graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013542901488435264,"score_gpt":0.2653162974456306,"score_spread":0.25177339595719533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406306592","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33515012,0.002076045,0.31551215,0.006213846,0.0004990028,0.00024847488,0.0008740717,0.0010737351,0.33835253],"genre_scores_gemma":[0.9225067,0.00083750737,0.034843773,0.0005713423,0.00016173611,0.00014710505,0.00046657334,0.00011978823,0.040345438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833655,0.00062785327,0.0000986728,0.00037133414,0.00028859568,0.00027701512],"domain_scores_gemma":[0.9927579,0.0029058072,0.0012861883,0.0012057009,0.0005405533,0.0013037084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012116232,0.00042218884,0.00069216924,0.0017550071,0.0029547682,0.0037845946,0.0012937482,0.0016473322,0.01592537],"category_scores_gemma":[0.008297286,0.0004910991,0.0008860518,0.0016804561,0.0027806882,0.0077875257,0.003371653,0.002367616,0.0028914653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003413713,0.000025944439,0.0004889622,0.00004984841,0.000015650923,0.00015744616,0.0004901315,0.00086041307,0.0006304114,0.9862132,0.0026568002,0.008377076],"study_design_scores_gemma":[0.000019606125,0.000019913281,0.00034741388,0.000038227645,0.000022857661,0.00040427534,0.0004964282,0.005515609,0.00042128967,0.980789,0.011912949,0.000012392037],"about_ca_topic_score_codex":0.0008744577,"about_ca_topic_score_gemma":0.0012694885,"teacher_disagreement_score":0.01592537,"about_ca_system_score_codex":0.0011339653,"about_ca_system_score_gemma":0.0007087664,"threshold_uncertainty_score":0.053275704},"labels":[],"label_agreement":null},{"id":"W2406639167","doi":"","title":"Vulnerability Of Mycielski Graphs Via Residual Closeness.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Closeness; Mathematics; Residual; Statistics; Combinatorics; Algorithm","score_opus":0.03400394482779249,"score_gpt":0.3046801913416691,"score_spread":0.2706762465138766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406639167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7907247,0.00089235976,0.11965171,0.0032413998,0.00012289474,0.00008870377,0.0010339981,0.0004922682,0.0837519],"genre_scores_gemma":[0.98922056,0.00027850122,0.004933185,0.00018424791,0.0000616959,0.00003406622,0.00028604447,0.000067124485,0.004934707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989343,0.00031444896,0.00004440088,0.00024385437,0.00026822012,0.00019472197],"domain_scores_gemma":[0.9924306,0.004410684,0.0012380531,0.00079307595,0.0005187591,0.0006088047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008293533,0.0003878978,0.0006380666,0.0021028796,0.0015661513,0.002667307,0.00093020214,0.0012145026,0.00780443],"category_scores_gemma":[0.010374823,0.00047153744,0.0006142532,0.0012320423,0.0026543215,0.0055686547,0.0033911674,0.002196254,0.0007788523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016371523,0.000038349048,0.0032621382,0.00010902021,0.00003468948,0.00024387009,0.0007153526,0.007361328,0.0022547392,0.9737438,0.0028797826,0.009193328],"study_design_scores_gemma":[0.000023739722,0.000029020433,0.0013982686,0.000035981884,0.00003577426,0.0004076949,0.0003643805,0.016071169,0.0012187435,0.97673017,0.003663192,0.000021991298],"about_ca_topic_score_codex":0.0010360419,"about_ca_topic_score_gemma":0.00079938135,"teacher_disagreement_score":0.00780443,"about_ca_system_score_codex":0.0011006691,"about_ca_system_score_gemma":0.00042208075,"threshold_uncertainty_score":0.026108384},"labels":[],"label_agreement":null},{"id":"W2406692538","doi":"","title":"One of Ferran Hurtado's favorite topics - Flips.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Point (geometry); World Wide Web; Information retrieval; Mathematics; Geometry","score_opus":0.10719563354728603,"score_gpt":0.3121231820828642,"score_spread":0.20492754853557818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406692538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046819866,0.06953243,0.45297307,0.08545094,0.019682493,0.0004153817,0.0008907585,0.0023258522,0.3219092],"genre_scores_gemma":[0.5155037,0.040993735,0.21247108,0.019733086,0.011352986,0.00043999584,0.0012739754,0.0018121006,0.19641936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989581,0.00029577434,0.000024434614,0.00033128122,0.00027929313,0.0001111035],"domain_scores_gemma":[0.9975077,0.0014213892,0.00010011223,0.00031845228,0.00035704952,0.00029522632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015297738,0.0010025139,0.000949926,0.001022622,0.0018208607,0.0020525788,0.0010395853,0.002261029,0.012490375],"category_scores_gemma":[0.006406968,0.0005242939,0.0009344514,0.0009677242,0.0022149454,0.0047248206,0.0021580698,0.0044017113,0.0041566896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022420973,0.00011944737,0.0010885816,0.00047740559,0.00007346563,0.00022871506,0.00037897454,0.005050527,0.0054560704,0.6486766,0.13687804,0.20134793],"study_design_scores_gemma":[0.000056893405,0.00023277474,0.0010630309,0.00032858097,0.00005881337,0.0007627979,0.00039344977,0.009524594,0.009600397,0.47238398,0.5054601,0.0001346738],"about_ca_topic_score_codex":0.0029348931,"about_ca_topic_score_gemma":0.0032959918,"teacher_disagreement_score":0.012490375,"about_ca_system_score_codex":0.0023871094,"about_ca_system_score_gemma":0.0009060247,"threshold_uncertainty_score":0.041784406},"labels":[],"label_agreement":null},{"id":"W2406837711","doi":"","title":"Number of disjoint 5-cycles in graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics","score_opus":0.012320935471179507,"score_gpt":0.293827753271477,"score_spread":0.28150681780029746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406837711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7767359,0.0034226559,0.056495734,0.0041176896,0.00055673823,0.00015907788,0.006069099,0.0006232043,0.15181983],"genre_scores_gemma":[0.9568157,0.0010455666,0.02289216,0.00039622514,0.00016429875,0.00021012245,0.0024281756,0.0001213938,0.01592643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998689,0.00028869396,0.00011012073,0.00035809402,0.00031264927,0.00024147637],"domain_scores_gemma":[0.9944999,0.0029066815,0.00083193154,0.00041281982,0.00051268213,0.0008359885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084190594,0.0005766387,0.0007639952,0.003138466,0.0021950975,0.0040066037,0.002063685,0.0016762718,0.023412894],"category_scores_gemma":[0.0065114526,0.00058796984,0.00073704426,0.0019906368,0.0018363197,0.0044387374,0.0018041098,0.0011483314,0.0020567598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070172356,0.00014744751,0.010884917,0.00080492755,0.00020127602,0.00041124912,0.00076227763,0.0077426555,0.007789114,0.89253217,0.016245384,0.061776914],"study_design_scores_gemma":[0.00011268935,0.00009635118,0.005727921,0.00022206202,0.00018349537,0.001434641,0.00069159095,0.015911348,0.005619418,0.9420346,0.027912542,0.000053453598],"about_ca_topic_score_codex":0.0008441234,"about_ca_topic_score_gemma":0.0015824707,"teacher_disagreement_score":0.023412894,"about_ca_system_score_codex":0.0012310592,"about_ca_system_score_gemma":0.00086801534,"threshold_uncertainty_score":0.0783239},"labels":[],"label_agreement":null},{"id":"W2406906987","doi":"","title":"Colourfully panconnected subgraphs II.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Order (exchange); Vertex connectivity; Discrete mathematics","score_opus":0.01684305340759623,"score_gpt":0.2724569552815831,"score_spread":0.25561390187398686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406906987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75596625,0.0018452571,0.11946135,0.000818372,0.00024547178,0.00040582786,0.0045265215,0.00075257197,0.11597844],"genre_scores_gemma":[0.93201876,0.0007494163,0.040609907,0.00037733253,0.00010143736,0.00018208123,0.004340889,0.000107706044,0.021512583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994143,0.00006360834,0.000038301867,0.00021914481,0.000118719356,0.00014607563],"domain_scores_gemma":[0.9987923,0.00026434264,0.00028424678,0.00027596948,0.00019337896,0.00018980188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021179467,0.0004011314,0.0003019218,0.00066457427,0.00082481926,0.0012818535,0.00067396276,0.0005730538,0.006476409],"category_scores_gemma":[0.001241033,0.00037972344,0.0004933634,0.00092014484,0.00077181164,0.0012190302,0.0011430635,0.0008271896,0.0012569819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014662696,0.00021409601,0.019207338,0.0012838573,0.00014510562,0.0026685533,0.0018138782,0.015710216,0.13744019,0.65977776,0.019137327,0.14113533],"study_design_scores_gemma":[0.0001240734,0.00044529405,0.025612801,0.00017971665,0.00021967413,0.008709547,0.00084848225,0.036699392,0.055015095,0.7572935,0.11476067,0.00009166099],"about_ca_topic_score_codex":0.001168999,"about_ca_topic_score_gemma":0.001638998,"teacher_disagreement_score":0.006476409,"about_ca_system_score_codex":0.00063185557,"about_ca_system_score_gemma":0.00032840326,"threshold_uncertainty_score":0.021665752},"labels":[],"label_agreement":null},{"id":"W2406945348","doi":"","title":"Full cycle extendability of triangularly connected almost claw-free graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Structural engineering; Engineering","score_opus":0.011092520383730512,"score_gpt":0.2691681834380562,"score_spread":0.2580756630543257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406945348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80428344,0.00042930897,0.08349079,0.000501912,0.00007363504,0.000057662968,0.0008771937,0.0005512071,0.10973483],"genre_scores_gemma":[0.984148,0.00016999814,0.0054323687,0.00010817556,0.000030498994,0.000023732962,0.0005828706,0.00005646567,0.009447855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997218,0.00003424295,0.000012813973,0.000080044956,0.00007648811,0.00007445735],"domain_scores_gemma":[0.99869823,0.0005062077,0.00014333644,0.0002509769,0.0001596411,0.0002415742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022261494,0.0002587309,0.00027837206,0.00073510996,0.0007509706,0.0011427047,0.0006510659,0.0004928643,0.012630478],"category_scores_gemma":[0.0019074804,0.00025198195,0.00033302978,0.00074292545,0.0009054577,0.0023506584,0.0014801337,0.0009038825,0.0007859992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001979974,0.00007237014,0.0016572415,0.00014969238,0.000025041789,0.00053647714,0.0008580159,0.005380257,0.013425616,0.93533355,0.0039668675,0.038396973],"study_design_scores_gemma":[0.000021343805,0.000039447015,0.001317548,0.000024982486,0.000021789823,0.00041332707,0.00026515205,0.01148069,0.005076653,0.97477233,0.00655083,0.00001603705],"about_ca_topic_score_codex":0.0012443259,"about_ca_topic_score_gemma":0.0014810059,"teacher_disagreement_score":0.012630478,"about_ca_system_score_codex":0.00035222666,"about_ca_system_score_gemma":0.00020947844,"threshold_uncertainty_score":0.042253196},"labels":[],"label_agreement":null},{"id":"W2407087625","doi":"","title":"A novel characterization of n-extendable bipartite graphs","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Characterization (materials science); Combinatorics; Graph; Nanotechnology","score_opus":0.015949664627679903,"score_gpt":0.2696472850536127,"score_spread":0.2536976204259328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407087625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53914124,0.0007667247,0.34413323,0.0021350237,0.00022933763,0.00020088197,0.0018661829,0.00071717036,0.11081021],"genre_scores_gemma":[0.91701216,0.00067794207,0.058785718,0.0006476592,0.00049818057,0.0001972461,0.001571252,0.00023814237,0.020371811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984478,0.00029136604,0.00010095814,0.00060246204,0.00035878204,0.00019866065],"domain_scores_gemma":[0.99411386,0.0026553888,0.0010052312,0.0009207891,0.0004312124,0.0008735891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010225718,0.00085784023,0.00078608154,0.0026158092,0.0015518772,0.0031777357,0.002000224,0.0012964124,0.0075297854],"category_scores_gemma":[0.00515564,0.0005722184,0.0009831294,0.0034048527,0.0023984679,0.00745295,0.0034060488,0.002968206,0.0008265234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019020285,0.00013580848,0.00288375,0.00015263507,0.000026336795,0.0004545435,0.000610418,0.0046082065,0.009121814,0.9528769,0.0036255408,0.025313735],"study_design_scores_gemma":[0.000024004865,0.000063342784,0.0029862046,0.000056657478,0.00003438869,0.0010617981,0.00028502473,0.022543771,0.002012087,0.9557957,0.015101372,0.000035580808],"about_ca_topic_score_codex":0.0006403088,"about_ca_topic_score_gemma":0.00084229273,"teacher_disagreement_score":0.0075297854,"about_ca_system_score_codex":0.0011771517,"about_ca_system_score_gemma":0.00055458164,"threshold_uncertainty_score":0.025189698},"labels":[],"label_agreement":null},{"id":"W2407156328","doi":"","title":"An Extremal Problem Resulting in Many Paths.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical optimization; Applied mathematics; Mathematical economics","score_opus":0.016209006955684398,"score_gpt":0.2811812595192991,"score_spread":0.26497225256361473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407156328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4669433,0.0021196392,0.24228695,0.016130425,0.0016447237,0.00024909765,0.0026397079,0.0013490869,0.26663715],"genre_scores_gemma":[0.8541955,0.0009862586,0.09335332,0.0014711386,0.00033108087,0.00015957846,0.002027828,0.00058286544,0.046892464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893445,0.00031074346,0.000047294663,0.00024517096,0.0002009089,0.00026145647],"domain_scores_gemma":[0.99547714,0.0027767674,0.0003360025,0.00058367546,0.0002856585,0.00054081227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079874136,0.00076776376,0.00080436294,0.0010962924,0.0039097876,0.0025836122,0.001758844,0.0034515318,0.023023289],"category_scores_gemma":[0.009609325,0.00063061237,0.0011252027,0.0014197734,0.0019154022,0.0051909736,0.004347735,0.005071705,0.0025273522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038203254,0.00019506509,0.0010032811,0.00027108594,0.00007334675,0.0013267867,0.0004584933,0.007754563,0.0023486835,0.9178048,0.034443673,0.033938073],"study_design_scores_gemma":[0.00004067201,0.000026778313,0.00024658907,0.000041280167,0.00003023185,0.00049193617,0.00024500073,0.012773562,0.0009462223,0.9779272,0.007214909,0.000015543288],"about_ca_topic_score_codex":0.00077272375,"about_ca_topic_score_gemma":0.0014985437,"teacher_disagreement_score":0.023023289,"about_ca_system_score_codex":0.0009799158,"about_ca_system_score_gemma":0.0008518695,"threshold_uncertainty_score":0.077020526},"labels":[],"label_agreement":null},{"id":"W2407321404","doi":"","title":"On edge colorings of 1-planar graphs without chordal 5-cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Outerplanar graph; Planar graph; Planar; Pathwidth; Graph; Computer science; Telecommunications; Line graph","score_opus":0.019376495285452763,"score_gpt":0.28517836554494047,"score_spread":0.2658018702594877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407321404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5211338,0.0038740148,0.19612412,0.0040247245,0.0009687947,0.00029908455,0.0026698285,0.0011964662,0.2697091],"genre_scores_gemma":[0.851578,0.003672186,0.08558933,0.0017530653,0.00073071383,0.00024239675,0.003554322,0.0007643522,0.05211567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992192,0.0002159571,0.000038406153,0.00016330984,0.00014556086,0.00021765065],"domain_scores_gemma":[0.9963349,0.0021232853,0.0005065693,0.0003668038,0.00029929646,0.00036909964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006262634,0.00086329115,0.00068923936,0.001928151,0.0019833501,0.0026053083,0.0015537611,0.0014623257,0.016637307],"category_scores_gemma":[0.0048070895,0.0008709772,0.0009778067,0.0022968724,0.0019872568,0.0038101638,0.0020749904,0.0023001956,0.0026637083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032719027,0.00013000744,0.0019920885,0.00038947092,0.000051191393,0.0004502614,0.0007028611,0.014546202,0.0043525407,0.91042966,0.022886634,0.04374181],"study_design_scores_gemma":[0.000054135715,0.000039214603,0.0009815228,0.000094175426,0.00003038459,0.0003222924,0.00030774096,0.013914816,0.0009811742,0.97221065,0.011036873,0.000027028427],"about_ca_topic_score_codex":0.0031697932,"about_ca_topic_score_gemma":0.005482261,"teacher_disagreement_score":0.016637307,"about_ca_system_score_codex":0.0016347403,"about_ca_system_score_gemma":0.0007156896,"threshold_uncertainty_score":0.055657327},"labels":[],"label_agreement":null},{"id":"W2407372527","doi":"","title":"Binding numbers and (a, b, k)-critical graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.029864495822640415,"score_gpt":0.2918640294097059,"score_spread":0.2619995335870655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407372527","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34897465,0.0034811103,0.15519176,0.007323693,0.0012325463,0.00016212382,0.0008397844,0.0010090299,0.48178527],"genre_scores_gemma":[0.91380775,0.0010104274,0.03298727,0.0010413269,0.00023117603,0.00016453525,0.0004436702,0.0002061089,0.050107792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992211,0.000228412,0.000041024057,0.0001640205,0.00016510417,0.00018044184],"domain_scores_gemma":[0.9960473,0.0021383835,0.00046772716,0.0002592734,0.00041679142,0.0006705341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007725551,0.0005397224,0.00050538284,0.0030262233,0.003636151,0.0036614414,0.0010831258,0.0017514786,0.02052185],"category_scores_gemma":[0.0058257617,0.0006634036,0.0003916133,0.0017122371,0.0033929613,0.005620178,0.0021125958,0.0027338567,0.0025925855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026631344,0.000009782457,0.0001727614,0.00002966799,0.0000029734624,0.000058695416,0.00013862307,0.00033940477,0.00064093154,0.9924166,0.0024567158,0.0037071516],"study_design_scores_gemma":[0.000010213098,0.0000060838047,0.00017241278,0.00002592166,0.000005546266,0.00012445601,0.0001584193,0.0012699132,0.000414832,0.991585,0.00621756,0.000009644857],"about_ca_topic_score_codex":0.002015092,"about_ca_topic_score_gemma":0.0031065885,"teacher_disagreement_score":0.02052185,"about_ca_system_score_codex":0.0018795781,"about_ca_system_score_gemma":0.00092577474,"threshold_uncertainty_score":0.06865245},"labels":[],"label_agreement":null},{"id":"W2407380772","doi":"","title":"Efficient domination in directed tori and the Vizing's conjecture for directed graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Torus; Combinatorics; Domination analysis; Discrete mathematics; Graph; Geometry","score_opus":0.008464802313407668,"score_gpt":0.26430056715055583,"score_spread":0.25583576483714815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407380772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57044655,0.0019651896,0.15477486,0.010032182,0.0004360132,0.00018475557,0.0017263414,0.00061289134,0.25982115],"genre_scores_gemma":[0.9649643,0.00061128,0.011419006,0.000522366,0.00014529409,0.00010592318,0.0007552105,0.00010265085,0.021373965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873465,0.00033447813,0.000062898274,0.0002244362,0.0002282144,0.00041531154],"domain_scores_gemma":[0.9937594,0.004007954,0.00037116275,0.0010896988,0.00035838317,0.00041349966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012873496,0.00039911337,0.0007797579,0.00073201524,0.002335007,0.0032140038,0.0014746042,0.0015186707,0.012706236],"category_scores_gemma":[0.009551037,0.0005009656,0.0008966898,0.0012005521,0.0032894195,0.0069072135,0.0029769326,0.0023820878,0.0011582699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109769695,0.000035678317,0.0010028691,0.00008342464,0.000013122603,0.00011582662,0.00047545083,0.0054548355,0.0008626142,0.9750354,0.0071467073,0.009664225],"study_design_scores_gemma":[0.000029594788,0.0000097762795,0.00039383344,0.000017591967,0.000012069125,0.00010336071,0.0002139334,0.010796009,0.0005933584,0.9832697,0.0045493874,0.0000114720115],"about_ca_topic_score_codex":0.0027430567,"about_ca_topic_score_gemma":0.0035709569,"teacher_disagreement_score":0.012706236,"about_ca_system_score_codex":0.0014969612,"about_ca_system_score_gemma":0.00093373546,"threshold_uncertainty_score":0.042506635},"labels":[],"label_agreement":null},{"id":"W2407427864","doi":"","title":"On the signed edge domination numbers of K m, n .","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Arithmetic; Telecommunications; Computer science","score_opus":0.012944301504125903,"score_gpt":0.2590284015321941,"score_spread":0.2460841000280682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407427864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71066725,0.0014250912,0.09117912,0.0029786308,0.00051278726,0.00007151039,0.001195567,0.00028987628,0.19168015],"genre_scores_gemma":[0.9685976,0.0006162904,0.0151030915,0.00031758723,0.00021344135,0.000100938014,0.00040532844,0.00009263688,0.0145530775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937373,0.0001855065,0.00004140035,0.00009917533,0.00016052429,0.00013972765],"domain_scores_gemma":[0.99496365,0.0031840545,0.00061904336,0.0002942564,0.00046305233,0.00047603616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010551864,0.0004603469,0.00039117696,0.002494597,0.0012381986,0.0024717094,0.00088011427,0.0007595537,0.009679454],"category_scores_gemma":[0.010227791,0.00024608124,0.0002623361,0.0013510333,0.00197757,0.0045812037,0.0015004941,0.0013595277,0.0012451664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002963052,0.000055269396,0.0021740936,0.00011168463,0.00001592018,0.00013011525,0.00038422545,0.006609597,0.0027745944,0.9456848,0.0077309324,0.034032516],"study_design_scores_gemma":[0.00002950706,0.00003587574,0.0017927781,0.00007467996,0.000015477875,0.00022334559,0.0002326113,0.017174361,0.0014117956,0.9722129,0.006764219,0.000032287964],"about_ca_topic_score_codex":0.00080897927,"about_ca_topic_score_gemma":0.0015744398,"teacher_disagreement_score":0.009679454,"about_ca_system_score_codex":0.0010835439,"about_ca_system_score_gemma":0.0006099723,"threshold_uncertainty_score":0.032381058},"labels":[],"label_agreement":null},{"id":"W2407462674","doi":"","title":"The hypergraph of θ-classes and θ-graphs of partial cubes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Hypergraph; Interval graph; Pathwidth; Indifference graph; Split graph; Discrete mathematics; Vertex (graph theory); Graph; Line graph; 1-planar graph","score_opus":0.010957420666458346,"score_gpt":0.2600561760749702,"score_spread":0.24909875540851187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407462674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47710434,0.0016085847,0.32810342,0.0028398214,0.00028963637,0.00018507386,0.0033016228,0.00035706733,0.18621045],"genre_scores_gemma":[0.93208694,0.0007627372,0.044238266,0.00059069524,0.00011613976,0.00012733242,0.0014815773,0.00007257258,0.020523734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971503,0.000069696485,0.000013766131,0.00008913994,0.000059526858,0.000052799718],"domain_scores_gemma":[0.99915195,0.00029805588,0.00014402748,0.000110838446,0.00013301046,0.00016208619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023610228,0.00020428687,0.00018485171,0.00080279046,0.001032833,0.0013812127,0.0005513626,0.00042402174,0.0074295686],"category_scores_gemma":[0.0014362877,0.00021368657,0.000301952,0.0010417292,0.0012341136,0.0031705059,0.0011503258,0.0010973964,0.00064088625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004640251,0.000011494411,0.0012827284,0.000063100604,0.000009901698,0.000110668145,0.00024657647,0.0011460054,0.0018895894,0.9750351,0.0021627052,0.01799574],"study_design_scores_gemma":[0.00001276744,0.000024592196,0.0031821283,0.00004076917,0.000024530544,0.00053811894,0.0006034566,0.008726627,0.0021308868,0.9457302,0.038968187,0.000017751228],"about_ca_topic_score_codex":0.003129333,"about_ca_topic_score_gemma":0.002571121,"teacher_disagreement_score":0.0074295686,"about_ca_system_score_codex":0.0008339484,"about_ca_system_score_gemma":0.0004273914,"threshold_uncertainty_score":0.024854362},"labels":[],"label_agreement":null},{"id":"W2407485278","doi":"","title":"On traceable and upper traceable numbers of graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02202488961978434,"score_gpt":0.2776144362891288,"score_spread":0.25558954666934447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407485278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2834521,0.004438926,0.38057384,0.006839687,0.0011378212,0.00013891321,0.0012223274,0.0010444496,0.32115194],"genre_scores_gemma":[0.89681035,0.002433901,0.049163833,0.0010112571,0.0012465965,0.0002042736,0.00078287855,0.00038503722,0.047961827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975414,0.000565382,0.00015319698,0.000525643,0.0007246191,0.00048978475],"domain_scores_gemma":[0.981459,0.012701784,0.001334987,0.0018792215,0.001096191,0.0015288662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020404155,0.0010086597,0.0010435744,0.00394077,0.002395828,0.0051900875,0.0020930863,0.001578861,0.014036908],"category_scores_gemma":[0.019221485,0.0006647206,0.0010810101,0.003298145,0.006753342,0.015378224,0.004084645,0.0060894266,0.0017571487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004672166,0.000025542073,0.00026998227,0.00003652928,0.000004864475,0.0000444186,0.00021134278,0.0012006229,0.00033229962,0.9895865,0.0010808373,0.007160289],"study_design_scores_gemma":[0.0000059788763,0.000008938643,0.00012743464,0.000015800688,0.0000039273455,0.000041090396,0.000047045807,0.0027111892,0.00020620221,0.99489105,0.0019349791,0.000006455355],"about_ca_topic_score_codex":0.002147038,"about_ca_topic_score_gemma":0.0023032518,"teacher_disagreement_score":0.014036908,"about_ca_system_score_codex":0.002824706,"about_ca_system_score_gemma":0.0010986851,"threshold_uncertainty_score":0.04695809},"labels":[],"label_agreement":null},{"id":"W2407539193","doi":"","title":"Roman domination subdivision number of a graph and its complement.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Mathematics; Complement (music); Combinatorics; Graph; Discrete mathematics; Geography; Biology; Archaeology","score_opus":0.0162250119811454,"score_gpt":0.2957556756950597,"score_spread":0.27953066371391433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407539193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7011363,0.0006772331,0.039053928,0.0011490855,0.00020090159,0.00004329448,0.0006142396,0.00023155849,0.2568934],"genre_scores_gemma":[0.9691803,0.00024989917,0.009179347,0.00011882527,0.000082507635,0.00003570852,0.00039246478,0.000055472832,0.020705445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996766,0.00008822643,0.00001287476,0.00006465188,0.000079844176,0.000077882054],"domain_scores_gemma":[0.9988827,0.00049083936,0.00016808347,0.00012312269,0.00016007388,0.00017512268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038717242,0.00025404495,0.00035936816,0.0015729923,0.0009896095,0.0016626029,0.00064990664,0.0005090359,0.009772814],"category_scores_gemma":[0.002086849,0.00016443928,0.00035010185,0.0009221596,0.0017652293,0.0016551103,0.00083189557,0.0010321691,0.0011564554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016986148,0.0000330528,0.0020016292,0.000048364556,0.000015143848,0.00012570355,0.00036287622,0.0030217431,0.003659648,0.9691348,0.004075978,0.017351162],"study_design_scores_gemma":[0.00003578137,0.000056122604,0.004226047,0.00004096115,0.000032151755,0.00056371046,0.00033268135,0.027036745,0.0036690298,0.9402248,0.02375546,0.000026490121],"about_ca_topic_score_codex":0.0016423059,"about_ca_topic_score_gemma":0.001630402,"teacher_disagreement_score":0.009772814,"about_ca_system_score_codex":0.000891576,"about_ca_system_score_gemma":0.00039952068,"threshold_uncertainty_score":0.032693326},"labels":[],"label_agreement":null},{"id":"W2407623588","doi":"","title":"The Global Connected Domination In Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.00913539524891057,"score_gpt":0.2703753785844049,"score_spread":0.26123998333549436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407623588","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3211281,0.0123104835,0.24939747,0.008578601,0.0007710201,0.00011074602,0.0009801345,0.00048364422,0.40623984],"genre_scores_gemma":[0.9498782,0.0035597489,0.012621813,0.00080426084,0.0007328649,0.000109201384,0.0003735127,0.0001309256,0.03178951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993511,0.0002143238,0.000026057147,0.00016375221,0.00015755648,0.00008718214],"domain_scores_gemma":[0.9972485,0.0016987005,0.0002523203,0.00030534368,0.000241617,0.0002536816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007071162,0.0004244114,0.00048504162,0.0020608136,0.0013500365,0.002379941,0.00073279487,0.0008716737,0.008880937],"category_scores_gemma":[0.004410473,0.00033176376,0.00051402434,0.0017709966,0.0038205418,0.005267584,0.002062132,0.0018271167,0.00083169655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024265653,0.000008395619,0.00044273297,0.00009108359,0.00001617124,0.000087826855,0.0002829818,0.0010955228,0.00071049074,0.9799936,0.0037279774,0.013518887],"study_design_scores_gemma":[0.000008228312,0.000007289868,0.0004502651,0.000023880408,0.000012715355,0.00018554278,0.00010491639,0.0025234697,0.00029636142,0.9903756,0.006005384,0.000006333347],"about_ca_topic_score_codex":0.0010386177,"about_ca_topic_score_gemma":0.0014085459,"teacher_disagreement_score":0.008880937,"about_ca_system_score_codex":0.0009930284,"about_ca_system_score_gemma":0.00045915227,"threshold_uncertainty_score":0.029709697},"labels":[],"label_agreement":null},{"id":"W2407706320","doi":"","title":"Signed and minus total domination on subclasses of bipartite graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.024405225870331063,"score_gpt":0.2605811588223199,"score_spread":0.23617593295198885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407706320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7791311,0.0007780295,0.06732942,0.0018629634,0.00022749303,0.00007398871,0.0009915709,0.00036895333,0.1492365],"genre_scores_gemma":[0.97071224,0.00036142697,0.0085558165,0.00030949028,0.00021029118,0.00006380526,0.00077654707,0.000121992125,0.018888446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989421,0.00024972655,0.000081140475,0.00024553877,0.0002926225,0.00018900138],"domain_scores_gemma":[0.99452776,0.002745663,0.000744512,0.00059901975,0.00052375894,0.0008591698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011019463,0.00038310728,0.00061499805,0.0017248621,0.0016851111,0.0032151653,0.0009921126,0.0008843446,0.007321538],"category_scores_gemma":[0.006668906,0.0004281952,0.00071562926,0.0010432632,0.0019466848,0.0043557994,0.0018995989,0.0014552223,0.0006691075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011840797,0.000047549485,0.0024308683,0.000058547255,0.00002271333,0.00024547553,0.00039490312,0.0013026113,0.0018771767,0.9751017,0.003915668,0.014484416],"study_design_scores_gemma":[0.00002706011,0.000016065644,0.001509225,0.000035777644,0.000022330607,0.00076864427,0.00025835482,0.0090819,0.0011174493,0.98132116,0.0058238013,0.000018240873],"about_ca_topic_score_codex":0.0013557348,"about_ca_topic_score_gemma":0.0018446337,"teacher_disagreement_score":0.007321538,"about_ca_system_score_codex":0.0012097153,"about_ca_system_score_gemma":0.0005457095,"threshold_uncertainty_score":0.024492979},"labels":[],"label_agreement":null},{"id":"W2407737784","doi":"","title":"Notes on Endomorphisms of Henson Graphs and their Complements.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endomorphism; Mathematics; Combinatorics","score_opus":0.021565794672974346,"score_gpt":0.28024049619726915,"score_spread":0.2586747015242948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407737784","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14020512,0.012905599,0.082024954,0.006663905,0.0032889615,0.000059680366,0.0006457169,0.00030274218,0.75390345],"genre_scores_gemma":[0.8217206,0.011660139,0.035631355,0.002212561,0.002029035,0.00012655258,0.00059816195,0.00018082152,0.12584075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996985,0.000073497,0.000015279755,0.0000543792,0.00010774323,0.000050611055],"domain_scores_gemma":[0.9993327,0.00040310778,0.000045745226,0.0000652873,0.00008019882,0.000072910385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005795358,0.0005673909,0.00038590445,0.0018119005,0.0012894118,0.0016306101,0.00046415132,0.00067283993,0.0094793085],"category_scores_gemma":[0.0011938073,0.0002844873,0.00043811658,0.0019256998,0.0026858707,0.0034816836,0.0016874856,0.0023807734,0.0009619751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014157603,0.000012297571,0.0001236035,0.000032008178,0.0000036314125,0.0001034246,0.00021683826,0.00017437954,0.0005389214,0.987362,0.003268521,0.008150226],"study_design_scores_gemma":[0.000006333048,0.000021247768,0.0005642122,0.000025727337,0.0000066041894,0.0002650459,0.00019361438,0.00041480674,0.0004997439,0.9632598,0.03473208,0.000010690204],"about_ca_topic_score_codex":0.0011512822,"about_ca_topic_score_gemma":0.0019000174,"teacher_disagreement_score":0.0094793085,"about_ca_system_score_codex":0.0010057574,"about_ca_system_score_gemma":0.00044140776,"threshold_uncertainty_score":0.03171146},"labels":[],"label_agreement":null},{"id":"W2407743056","doi":"","title":"On Helly Hypergraphs with Variable Intersection Sizes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Intersection (aeronautics); Cardinality (data modeling); Characterization (materials science); Generalization; Disjoint sets; Discrete mathematics; Computer science","score_opus":0.007428131006928234,"score_gpt":0.23315796827942664,"score_spread":0.2257298372724984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407743056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.369306,0.0010149502,0.6107651,0.0011012653,0.00006622543,0.00042746853,0.0023681896,0.0010671539,0.013883691],"genre_scores_gemma":[0.807785,0.000806744,0.17900701,0.0004381991,0.00021568884,0.0005336614,0.0029972359,0.00030673976,0.007909689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794203,0.0005736387,0.00016957633,0.0005985387,0.00045788364,0.00025840517],"domain_scores_gemma":[0.9865194,0.008029107,0.001953909,0.0018717909,0.00093829806,0.000687435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014562793,0.00083997723,0.0007455162,0.0037383477,0.0019971298,0.0022538719,0.0010285547,0.0011155056,0.003522804],"category_scores_gemma":[0.011571897,0.0008362366,0.0007438833,0.003751008,0.0031860827,0.009597851,0.0029350522,0.0020159895,0.00057935045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010539048,0.00024791728,0.024479792,0.0005475238,0.00020065776,0.0013193367,0.003010445,0.07820253,0.02130288,0.7125388,0.008764751,0.14833146],"study_design_scores_gemma":[0.0000539933,0.00012714064,0.005243754,0.00013574302,0.00008070606,0.0013095022,0.000829097,0.13722503,0.009764871,0.83289486,0.012240961,0.00009427588],"about_ca_topic_score_codex":0.0013119209,"about_ca_topic_score_gemma":0.0014643534,"teacher_disagreement_score":0.0037383477,"about_ca_system_score_codex":0.0020861877,"about_ca_system_score_gemma":0.0008137143,"threshold_uncertainty_score":0.01513648},"labels":[],"label_agreement":null},{"id":"W2408004674","doi":"","title":"On trees with double domination number equal to total domination number plus one.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Graph","score_opus":0.031216537974426327,"score_gpt":0.2883537486928328,"score_spread":0.2571372107184065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408004674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50958323,0.00534553,0.2272179,0.004048151,0.00062594883,0.00015596054,0.0018664174,0.00070939446,0.25044748],"genre_scores_gemma":[0.91685,0.0025883021,0.04188624,0.000920271,0.0007490482,0.00015547815,0.001362037,0.00033410572,0.03515452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891865,0.0003017471,0.000058896072,0.00021377126,0.00021788174,0.0002889692],"domain_scores_gemma":[0.9941391,0.0039190473,0.00052971684,0.00045751128,0.00037966165,0.00057498575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086552114,0.00050095125,0.00086366583,0.0022514767,0.0019300091,0.0025761987,0.0011266693,0.0012675287,0.008614046],"category_scores_gemma":[0.0055637504,0.0004082937,0.0005808591,0.0020494997,0.0021474701,0.005449169,0.0022630459,0.0018563794,0.0013821331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020215087,0.00006645928,0.0018285257,0.00026937248,0.000051150946,0.0005220965,0.000516829,0.008133987,0.004499393,0.93836033,0.012065956,0.033483867],"study_design_scores_gemma":[0.000031564374,0.000030403344,0.0010275989,0.00006418195,0.000040041923,0.0007279145,0.00024410921,0.016611533,0.0012299994,0.97016925,0.009800398,0.000022993836],"about_ca_topic_score_codex":0.0012501809,"about_ca_topic_score_gemma":0.0021955916,"teacher_disagreement_score":0.008614046,"about_ca_system_score_codex":0.0014395309,"about_ca_system_score_gemma":0.0006112593,"threshold_uncertainty_score":0.02881682},"labels":[],"label_agreement":null},{"id":"W2408084491","doi":"","title":"Dominating Sets and Independent Sets in a Tree.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics","score_opus":0.012446516962027863,"score_gpt":0.2880995305409314,"score_spread":0.27565301357890354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408084491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25700474,0.017232772,0.4123596,0.008871793,0.0011277638,0.00022393238,0.0026172798,0.0004539384,0.30010822],"genre_scores_gemma":[0.7906159,0.007401926,0.13525549,0.0014162867,0.0012430162,0.00024947096,0.002117478,0.00019776243,0.061502706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901915,0.0002792114,0.000063392894,0.0002441511,0.00023579164,0.00015836947],"domain_scores_gemma":[0.9965211,0.0023196149,0.00027519258,0.00028807638,0.00026258512,0.00033344224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008725479,0.0005493498,0.00086251454,0.002303734,0.002063856,0.003593864,0.0010585014,0.0012832804,0.0067214672],"category_scores_gemma":[0.004289947,0.00070861576,0.00092722947,0.0031351338,0.0025015385,0.006750435,0.002058813,0.0027555698,0.001580806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044971606,0.00003374761,0.00046914793,0.00013427771,0.000026519538,0.00018367944,0.00044075435,0.0018627356,0.0013044532,0.9761435,0.0053089964,0.014047358],"study_design_scores_gemma":[0.000012353493,0.00001464084,0.00038711232,0.0000347868,0.000026416143,0.00036191533,0.00014805603,0.0041207424,0.00046824044,0.9809269,0.013490187,0.000008653242],"about_ca_topic_score_codex":0.0010965457,"about_ca_topic_score_gemma":0.0019629558,"teacher_disagreement_score":0.0067214672,"about_ca_system_score_codex":0.0015352367,"about_ca_system_score_gemma":0.000603376,"threshold_uncertainty_score":0.022485554},"labels":[],"label_agreement":null},{"id":"W2408167455","doi":"","title":"Alternating Subsets and Successions.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.014368515993745282,"score_gpt":0.28083414515952987,"score_spread":0.2664656291657846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408167455","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0892123,0.0088981725,0.31778964,0.005269736,0.002466467,0.00011996887,0.0009848961,0.0010244761,0.5742343],"genre_scores_gemma":[0.70993394,0.0041809073,0.10687033,0.002207401,0.001791517,0.00021779546,0.0014118309,0.00062093756,0.17276528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985964,0.0005116651,0.00012787277,0.0003132016,0.0002617047,0.00018928747],"domain_scores_gemma":[0.9980622,0.00090690044,0.00015757447,0.00037651023,0.0002826776,0.00021421626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158255,0.00062659563,0.0007121738,0.0018101145,0.0024893368,0.002761563,0.0010336274,0.0009086684,0.017736832],"category_scores_gemma":[0.0039026705,0.0005936275,0.0011483189,0.0016743803,0.0032394177,0.00776393,0.0025954638,0.0027537881,0.004430186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002003329,0.000014415601,0.000150873,0.000035131972,0.0000064224723,0.00008560324,0.00018394885,0.00014099572,0.00031456153,0.9867488,0.0032764794,0.009022663],"study_design_scores_gemma":[0.0000067743467,0.000010232032,0.000151978,0.000016998254,0.000008475827,0.0002451955,0.00011250434,0.0007830136,0.00030283324,0.97833145,0.020023467,0.0000071123573],"about_ca_topic_score_codex":0.0010815066,"about_ca_topic_score_gemma":0.0019646268,"teacher_disagreement_score":0.017736832,"about_ca_system_score_codex":0.0011151397,"about_ca_system_score_gemma":0.0005239909,"threshold_uncertainty_score":0.05933559},"labels":[],"label_agreement":null},{"id":"W2408235952","doi":"","title":"On geodetic and k-geodetic sets in graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Geodesy; Combinatorics; Geography","score_opus":0.009871037274039877,"score_gpt":0.27051668293231473,"score_spread":0.26064564565827486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408235952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5221213,0.012756873,0.32670394,0.007673203,0.00061770977,0.00023408631,0.00169474,0.00021385205,0.12798433],"genre_scores_gemma":[0.93687737,0.006267107,0.044286475,0.00078263716,0.0011003689,0.00024563173,0.00070828985,0.00007899347,0.009653061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774677,0.0006854682,0.00013096533,0.00049611815,0.0005639645,0.00037670688],"domain_scores_gemma":[0.9725628,0.021922864,0.0026336801,0.0010548444,0.0008698814,0.0009559885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018936187,0.0012408787,0.0013664978,0.0043195947,0.0029229955,0.0039457646,0.0021001687,0.0019007807,0.00690445],"category_scores_gemma":[0.014332246,0.0008215573,0.0011003311,0.0065815956,0.005430123,0.009144283,0.0039386144,0.0034853301,0.00085697335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001827569,0.000113676404,0.0043199915,0.0005088539,0.00009201583,0.0004053439,0.001112837,0.028920576,0.0028369087,0.93411773,0.004729841,0.022659471],"study_design_scores_gemma":[0.000037036596,0.00013219194,0.003970328,0.0001605403,0.00010209498,0.0010484909,0.0006837694,0.036846768,0.0021096377,0.9450145,0.0098409485,0.00005372593],"about_ca_topic_score_codex":0.0012973963,"about_ca_topic_score_gemma":0.0015368096,"teacher_disagreement_score":0.00690445,"about_ca_system_score_codex":0.0026927001,"about_ca_system_score_gemma":0.0007438769,"threshold_uncertainty_score":0.023097694},"labels":[],"label_agreement":null},{"id":"W2408343898","doi":"","title":"Restricted total domination in graphs with minimum degree two.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.016865700453849705,"score_gpt":0.27530552873986064,"score_spread":0.2584398282860109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408343898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78514993,0.0015083201,0.11466201,0.0017081256,0.000088050416,0.000105531704,0.0014493467,0.00055255886,0.09477609],"genre_scores_gemma":[0.9713993,0.00050993485,0.013173065,0.00022646379,0.000062195984,0.00008363624,0.0007370915,0.00010455956,0.013703909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993788,0.00017487313,0.000029555044,0.00014340936,0.00012140447,0.00015196051],"domain_scores_gemma":[0.99590474,0.0024182904,0.0004291266,0.0005464359,0.00029711865,0.00040420255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005287144,0.00034649202,0.00055230677,0.0010156638,0.0009689808,0.0014897387,0.0011186166,0.0005262277,0.0067761927],"category_scores_gemma":[0.0035718682,0.00034179032,0.00052181655,0.0010262189,0.0010555645,0.0026630384,0.0013313846,0.00086616504,0.0006409297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092917465,0.0001987057,0.008293365,0.00090911536,0.00021855462,0.0012379199,0.0020058625,0.026322009,0.034915764,0.8076188,0.019309588,0.09804111],"study_design_scores_gemma":[0.00014506873,0.0000870422,0.0043179146,0.000113217146,0.00013812858,0.0018951944,0.00067927997,0.05269882,0.009989907,0.9084806,0.021408506,0.000046272486],"about_ca_topic_score_codex":0.0012583714,"about_ca_topic_score_gemma":0.0021106466,"teacher_disagreement_score":0.0067761927,"about_ca_system_score_codex":0.0006305036,"about_ca_system_score_gemma":0.0004460351,"threshold_uncertainty_score":0.0226686},"labels":[],"label_agreement":null},{"id":"W2408452789","doi":"10.1080/03155986.2005.11732724","title":"Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem","year":2005,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Block (permutation group theory); Integer programming; Enhanced Data Rates for GSM Evolution; Mathematics; Graph; Induced subgraph isomorphism problem; Linear programming; Induced subgraph; Discrete mathematics; Mathematical optimization; Computer science; Line graph; Artificial intelligence","score_opus":0.06202741432814226,"score_gpt":0.3603149411181166,"score_spread":0.2982875267899744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408452789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022554394,0.00096912327,0.9622133,0.0010061831,0.00010620481,0.00023314366,0.0003395624,0.00022917302,0.0123489825],"genre_scores_gemma":[0.19359562,0.0016639794,0.7970339,0.00064685155,0.00018134255,0.00051214715,0.0008228933,0.00036636184,0.005176915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865,0.00063717895,0.00007060879,0.0002287773,0.0002416547,0.00017183162],"domain_scores_gemma":[0.99790883,0.0012984306,0.0002222934,0.00022258231,0.00021725374,0.00013059196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021676342,0.0013034175,0.0010539618,0.00084360316,0.00045916607,0.002165621,0.0029316912,0.0015533683,0.005259158],"category_scores_gemma":[0.005959741,0.0006446646,0.0016941759,0.0018301053,0.00095837715,0.003372422,0.0012906037,0.0028380111,0.0006306797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031585793,0.000404152,0.0009452312,0.00087332266,0.00016955596,0.0001416927,0.00024990755,0.6760481,0.00375911,0.19248112,0.009729657,0.11488238],"study_design_scores_gemma":[0.000092822076,0.00017037868,0.00031944297,0.00008688674,0.00006245059,0.00014054008,0.00016197431,0.90533805,0.002482229,0.08651898,0.004592153,0.00003410698],"about_ca_topic_score_codex":0.0017542479,"about_ca_topic_score_gemma":0.0027708746,"teacher_disagreement_score":0.005259158,"about_ca_system_score_codex":0.0014584478,"about_ca_system_score_gemma":0.0015143169,"threshold_uncertainty_score":0.017593622},"labels":[],"label_agreement":null},{"id":"W2408485812","doi":"","title":"Upper Domination Number and Domination Number in a Tree.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Tree (set theory); Combinatorics; Graph","score_opus":0.008080176089906686,"score_gpt":0.28300423481012643,"score_spread":0.27492405872021974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408485812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3962111,0.006626888,0.2007949,0.0052533206,0.00060811767,0.000121406716,0.002810495,0.0007344428,0.38683936],"genre_scores_gemma":[0.9233935,0.002817202,0.034116697,0.0006675395,0.00053947757,0.0001470068,0.0010470959,0.00018386668,0.03708764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986014,0.00024029284,0.000076087614,0.00028710318,0.00041381872,0.0003813975],"domain_scores_gemma":[0.9922058,0.0053048097,0.00047624006,0.00066125125,0.00062081346,0.00073108583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010251172,0.00047946058,0.0008414512,0.0030746798,0.001731262,0.0037515783,0.0013176554,0.001012385,0.013475088],"category_scores_gemma":[0.0071543297,0.0003906629,0.00050638535,0.0029191775,0.0025221282,0.006370017,0.0020500917,0.0022397267,0.0016718594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015078284,0.00006517366,0.0019522223,0.00017982366,0.000026637097,0.00016998235,0.00048227023,0.004107832,0.004935172,0.9408273,0.008715534,0.038387183],"study_design_scores_gemma":[0.000018313753,0.000026774329,0.0015907539,0.0000629272,0.000038092916,0.0005298802,0.00016851422,0.010436569,0.0027481937,0.96626663,0.018088588,0.00002482818],"about_ca_topic_score_codex":0.0010748698,"about_ca_topic_score_gemma":0.0017987868,"teacher_disagreement_score":0.013475088,"about_ca_system_score_codex":0.0016788506,"about_ca_system_score_gemma":0.0006641659,"threshold_uncertainty_score":0.045078695},"labels":[],"label_agreement":null},{"id":"W2408513405","doi":"","title":"Minimum Degree, Independence Number and (a, b, k)-Critical Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Degree (music); Independence (probability theory); Combinatorics; Discrete mathematics; Statistics; Graph; Physics","score_opus":0.0209072817346366,"score_gpt":0.29422861548338325,"score_spread":0.2733213337487467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408513405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7702254,0.0023519932,0.07095655,0.004756588,0.00023978959,0.00010787754,0.002592624,0.000332361,0.1484368],"genre_scores_gemma":[0.97780085,0.0007907148,0.011362315,0.00022520739,0.00017737286,0.00006851095,0.0009191808,0.000058818878,0.008596956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965894,0.000092742,0.000015115147,0.000091920374,0.00007538073,0.00006588709],"domain_scores_gemma":[0.99481404,0.0030745782,0.0008462436,0.0002387329,0.0003730109,0.0006534981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050004455,0.00036900697,0.00042119148,0.0017690792,0.0013482145,0.0018603225,0.00075806514,0.00091498106,0.0064487346],"category_scores_gemma":[0.0053231264,0.00045601174,0.00026955162,0.001451941,0.0015650986,0.0023187425,0.000723659,0.0014902495,0.00074503967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040863742,0.00013077358,0.008519169,0.00027970847,0.000048396563,0.00045921342,0.00050607405,0.007825636,0.009803632,0.9248737,0.021976313,0.025168689],"study_design_scores_gemma":[0.000054709937,0.00003245094,0.0051614325,0.000052202795,0.000032019638,0.00078344345,0.00030385816,0.013674702,0.0020317354,0.9699508,0.007902575,0.000019976052],"about_ca_topic_score_codex":0.0012591532,"about_ca_topic_score_gemma":0.001858227,"teacher_disagreement_score":0.0064487346,"about_ca_system_score_codex":0.0010642831,"about_ca_system_score_gemma":0.0005121893,"threshold_uncertainty_score":0.021573186},"labels":[],"label_agreement":null},{"id":"W2408734287","doi":"","title":"The Diameter of Connected Domination Critical Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01786029530915067,"score_gpt":0.30252337271576896,"score_spread":0.2846630774066183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408734287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7780704,0.0088625,0.06296649,0.0047580353,0.0005517268,0.00009002176,0.0022932014,0.00044620753,0.14196146],"genre_scores_gemma":[0.9846332,0.0024702486,0.005688753,0.0002365524,0.00045472124,0.00008272698,0.0005157153,0.00009482851,0.005823322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958676,0.00009837496,0.00001748834,0.00010662637,0.000096878444,0.00009382835],"domain_scores_gemma":[0.9922347,0.005175837,0.0008019357,0.00026523,0.00046099973,0.0010613526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006579,0.0004944387,0.00064922223,0.0032444855,0.0010773682,0.002408734,0.0010072985,0.0008728166,0.0049421643],"category_scores_gemma":[0.008927849,0.00044082323,0.00026289094,0.0013855294,0.0021914179,0.0033854465,0.001511866,0.0010602014,0.00067395635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044769558,0.00005019816,0.0058892104,0.00034510053,0.00006177695,0.00040457575,0.00092646835,0.010055471,0.008469264,0.92413664,0.021099493,0.028114155],"study_design_scores_gemma":[0.000065812135,0.000052956635,0.0043506324,0.000122041114,0.000059255755,0.001078323,0.0005665224,0.027592054,0.0038033193,0.9437806,0.018498538,0.000029959076],"about_ca_topic_score_codex":0.0008159143,"about_ca_topic_score_gemma":0.00071051397,"teacher_disagreement_score":0.0049421643,"about_ca_system_score_codex":0.001331786,"about_ca_system_score_gemma":0.000390966,"threshold_uncertainty_score":0.016533256},"labels":[],"label_agreement":null},{"id":"W2409344144","doi":"10.1002/jgt.22362","title":"Optimal‐size clique transversals in chordal graphs","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Treewidth; Clique-sum; Split graph; Vertex (graph theory); Clique graph; Interval graph; Clique; Discrete mathematics; Graph; Block graph; Pathwidth; 1-planar graph; Line graph; Graph power","score_opus":0.020456285358371813,"score_gpt":0.3103444728800291,"score_spread":0.2898881875216573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409344144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88981175,0.0010548963,0.08958423,0.0016845487,0.00016541475,0.00022248845,0.0021967848,0.0005232482,0.014756676],"genre_scores_gemma":[0.95118296,0.00055396213,0.04365563,0.00023675332,0.000116396724,0.00008718593,0.0014478067,0.0001381763,0.0025811223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988102,0.00025008392,0.000065963744,0.0003801498,0.00016248335,0.00033117502],"domain_scores_gemma":[0.98654467,0.00688817,0.0015425206,0.0021861235,0.00079213333,0.0020463201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012615187,0.00065924256,0.001298776,0.00080283644,0.001214332,0.0020179122,0.0018366947,0.0012300418,0.00746065],"category_scores_gemma":[0.009024167,0.00093555334,0.0008646494,0.0009824188,0.0011946794,0.003794014,0.002249756,0.0017138484,0.0008378876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0077286246,0.0010364598,0.023028478,0.0024266466,0.0005335785,0.0017929799,0.0021222648,0.11520069,0.20761783,0.501706,0.03462996,0.102176405],"study_design_scores_gemma":[0.00075510936,0.000833597,0.0074915662,0.00020362023,0.00024540146,0.002792665,0.0018384128,0.26233524,0.038645923,0.66685575,0.017886074,0.000116629904],"about_ca_topic_score_codex":0.0010421457,"about_ca_topic_score_gemma":0.0017140493,"teacher_disagreement_score":0.00746065,"about_ca_system_score_codex":0.00094867917,"about_ca_system_score_gemma":0.00080540916,"threshold_uncertainty_score":0.024958372},"labels":[],"label_agreement":null},{"id":"W2409819057","doi":"10.1007/978-3-030-45771-6_15","title":"Recognizing Even-Cycle and Even-Cut Matroids","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Graphic matroid; Matroid partitioning; Combinatorics; Binary number; Computer science; Class (philosophy); Oriented matroid; Time complexity; Discrete mathematics; Mathematics; Arithmetic; Artificial intelligence","score_opus":0.023010251030053632,"score_gpt":0.2739879953730963,"score_spread":0.2509777443430427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409819057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44949606,0.001166692,0.49560377,0.00093125965,0.00022322625,0.00018602844,0.0025908323,0.0033757759,0.046426304],"genre_scores_gemma":[0.7444064,0.0007238897,0.22062613,0.0003332588,0.00013674228,0.000089654175,0.009367687,0.0006937508,0.023622409],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966097,0.0000329616,0.00002765267,0.0001132615,0.00008442887,0.000080828475],"domain_scores_gemma":[0.9991763,0.00026989463,0.00009746461,0.00018825966,0.00017840002,0.000089688474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019081427,0.0007179884,0.0007549921,0.00082187605,0.0005633434,0.0022841666,0.0012651038,0.00084241875,0.0062653674],"category_scores_gemma":[0.0014966562,0.0005521075,0.0006796858,0.0010571837,0.00045564497,0.0040558535,0.0014547693,0.0012863826,0.0023885723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064707524,0.00035056417,0.012336511,0.00080728706,0.00009191904,0.0012585532,0.0011257889,0.050962027,0.070983715,0.25660434,0.044582285,0.56025],"study_design_scores_gemma":[0.000043337808,0.00013268366,0.004325676,0.000115380295,0.00007874084,0.0013217086,0.0010638523,0.2901226,0.03749028,0.61628956,0.048956756,0.000059516966],"about_ca_topic_score_codex":0.0020652234,"about_ca_topic_score_gemma":0.00415389,"teacher_disagreement_score":0.0062653674,"about_ca_system_score_codex":0.0005625469,"about_ca_system_score_gemma":0.00044941265,"threshold_uncertainty_score":0.020959735},"labels":[],"label_agreement":null},{"id":"W2411014121","doi":"","title":"Finding a Second Hamiltonian cycle in Barnette Graphs","year":2015,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Hamiltonian path; Mathematics; Combinatorics; Graph","score_opus":0.015476916428341658,"score_gpt":0.2466652934985891,"score_spread":0.23118837707024745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411014121","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7731721,0.0004375564,0.1876474,0.0020710658,0.000119744574,0.0002486602,0.0006446717,0.0005603144,0.0350984],"genre_scores_gemma":[0.88782185,0.00028329447,0.09499031,0.00033437123,0.00003946062,0.00015385542,0.0010021145,0.00015699772,0.015217765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999501,0.000073476374,0.000016732765,0.00014533958,0.000098163546,0.0001653433],"domain_scores_gemma":[0.9986304,0.0007029951,0.0002086358,0.00016001957,0.000094111296,0.00020381207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003498938,0.0004675301,0.00052794773,0.0007360135,0.0016411501,0.0013853743,0.0010738847,0.0011787355,0.0075804046],"category_scores_gemma":[0.0019559397,0.0005344042,0.00072125305,0.0010592393,0.0014570319,0.0026436762,0.0016446383,0.0014478747,0.00062235416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007703419,0.00042672732,0.008005481,0.001077156,0.00010919938,0.0013474277,0.002469812,0.138246,0.031456098,0.70961785,0.0144507345,0.09202323],"study_design_scores_gemma":[0.00021538677,0.00027846126,0.0038619523,0.00013802775,0.00007885109,0.0007983586,0.0028191232,0.2854079,0.023070725,0.65785563,0.025369486,0.000106097745],"about_ca_topic_score_codex":0.006555101,"about_ca_topic_score_gemma":0.010654974,"teacher_disagreement_score":0.0075804046,"about_ca_system_score_codex":0.0014159293,"about_ca_system_score_gemma":0.0010882481,"threshold_uncertainty_score":0.025358975},"labels":[],"label_agreement":null},{"id":"W2411941568","doi":"10.23638/dmtcs-20-1-6","title":"A Study of $k$-dipath Colourings of Oriented Graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.020189179021580617,"score_gpt":0.3130555463560788,"score_spread":0.29286636733449817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411941568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.780856,0.0016977395,0.1596219,0.010263066,0.00030797697,0.00026491762,0.00056514196,0.0004706355,0.045952544],"genre_scores_gemma":[0.9603624,0.0011057619,0.026920998,0.0008631514,0.00020703624,0.00012554665,0.00053883815,0.0001237408,0.009752565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990276,0.00024518563,0.000046578425,0.0003030218,0.00017655092,0.00020107313],"domain_scores_gemma":[0.98926395,0.007752183,0.0008955191,0.00097641395,0.00042094238,0.0006910651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012603981,0.00047919582,0.0007433461,0.0007297057,0.0018432498,0.004425806,0.0019162082,0.001802637,0.008456543],"category_scores_gemma":[0.009386691,0.000629126,0.0010974302,0.0013324656,0.003802021,0.008147304,0.0021852737,0.0034416134,0.0006750453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043958786,0.00021020233,0.0043007103,0.00060195406,0.00005290494,0.00059783325,0.0012471697,0.061298564,0.010874782,0.8810738,0.009950983,0.029351512],"study_design_scores_gemma":[0.000090621616,0.00010107578,0.0014954744,0.000078485136,0.000033226042,0.00041282925,0.0007383822,0.09643557,0.004758701,0.88839287,0.0074267536,0.000036079775],"about_ca_topic_score_codex":0.0020148465,"about_ca_topic_score_gemma":0.0014431394,"teacher_disagreement_score":0.008456543,"about_ca_system_score_codex":0.002936646,"about_ca_system_score_gemma":0.0010350749,"threshold_uncertainty_score":0.028290033},"labels":[],"label_agreement":null},{"id":"W2418252267","doi":"","title":"Pancyclism of 3-domination-critical graphs with small minimum degree","year":2008,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Degree (music); Combinatorics","score_opus":0.03469367632630748,"score_gpt":0.22654552902218283,"score_spread":0.19185185269587535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2418252267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93886775,0.00028248303,0.021725375,0.00062808435,0.000040882685,0.00014387672,0.0010062176,0.0002206403,0.03708464],"genre_scores_gemma":[0.9816367,0.00018973416,0.008925645,0.00014765075,0.000038897506,0.00010835447,0.0011067883,0.00006213125,0.007784181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952924,0.00008899216,0.000027758566,0.00011137926,0.000102695194,0.00013992716],"domain_scores_gemma":[0.9957593,0.0019177905,0.0006934254,0.00031424657,0.00046797757,0.0008472177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003292588,0.00041444827,0.0006839725,0.0027240564,0.0021630959,0.0020977526,0.0011405303,0.0010003962,0.008649991],"category_scores_gemma":[0.003114218,0.00054836477,0.00056244584,0.0016068026,0.0012253573,0.0015217172,0.0011560401,0.0012217916,0.00063189893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018767711,0.00029608852,0.013520931,0.0009616667,0.00013179099,0.0032742133,0.0033234295,0.048363052,0.051340263,0.8149012,0.015458051,0.04655263],"study_design_scores_gemma":[0.00024540751,0.00016068007,0.008265165,0.00009121138,0.00008525691,0.0016825716,0.001184003,0.09748031,0.009519358,0.8712256,0.010004213,0.00005624346],"about_ca_topic_score_codex":0.0025134734,"about_ca_topic_score_gemma":0.003948348,"teacher_disagreement_score":0.008649991,"about_ca_system_score_codex":0.0011561783,"about_ca_system_score_gemma":0.0008019208,"threshold_uncertainty_score":0.028937161},"labels":[],"label_agreement":null},{"id":"W24206502","doi":"10.1103/physrevlett.111.175501","title":"A note on the spatiality degree of graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music)","score_opus":0.04942459947340829,"score_gpt":0.2878263316629336,"score_spread":0.2384017321895253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24206502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48417765,0.009097354,0.18027954,0.024373205,0.0014576776,0.00013373404,0.0029171114,0.00064378924,0.29691997],"genre_scores_gemma":[0.9596253,0.0030655991,0.025832346,0.0009860925,0.0006682631,0.000069733964,0.0006174856,0.00016419466,0.00897101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980805,0.00040963574,0.00011522055,0.00060355884,0.00057142385,0.00021963913],"domain_scores_gemma":[0.9896185,0.0063424483,0.000761097,0.0018447186,0.0007587142,0.0006745129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014973632,0.0003676293,0.00053431536,0.0021755374,0.001816977,0.0033984983,0.0007619704,0.0010268296,0.0060410104],"category_scores_gemma":[0.009309357,0.0006211992,0.00048543015,0.0024709017,0.005694956,0.0055343406,0.0027907053,0.0029316912,0.0005492412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048343034,0.000013269053,0.0022627262,0.00011951627,0.000015423993,0.000101322505,0.00045308156,0.002039687,0.0021850073,0.9726721,0.003074267,0.017015312],"study_design_scores_gemma":[0.000014334684,0.0000450293,0.0028471777,0.000047237405,0.000019449782,0.0005556563,0.00015736028,0.00701611,0.002228347,0.9640991,0.022942875,0.000027289576],"about_ca_topic_score_codex":0.00089705986,"about_ca_topic_score_gemma":0.0014515083,"teacher_disagreement_score":0.0060410104,"about_ca_system_score_codex":0.00112721,"about_ca_system_score_gemma":0.00036598145,"threshold_uncertainty_score":0.020209253},"labels":[],"label_agreement":null},{"id":"W242281779","doi":"","title":"Erratum to \"Inducing regularization of graphs, multigraphs and pseudographs\" [Ars Combinatoria 65 (2002), 129-133].","year":2007,"lang":"en","type":"erratum","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regularization (linguistics); Pure mathematics; Computer science; Artificial intelligence","score_opus":0.015201718010173145,"score_gpt":0.27535159430298567,"score_spread":0.2601498762928125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W242281779","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027179328,0.0028185295,0.0022892477,0.08478924,0.8823788,0.0000662743,0.00180958,0.0006523683,0.024924193],"genre_scores_gemma":[0.013702455,0.020344198,0.01262696,0.15395468,0.24818414,0.00039351563,0.008610842,0.0027020706,0.53948116],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965268,0.0006708742,0.0005379681,0.00047343044,0.001525298,0.00026554536],"domain_scores_gemma":[0.98790234,0.003523317,0.0005238759,0.00092292286,0.006546857,0.00058066554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029129053,0.0030514288,0.0028898984,0.0048703835,0.00689614,0.0045255907,0.0046443273,0.005954475,0.07732743],"category_scores_gemma":[0.028026504,0.0015011173,0.0019327905,0.004417812,0.0031507218,0.0058276462,0.0020719573,0.009010826,0.04566547],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002698102,0.000008250512,0.000021421356,0.00007144948,0.000005324981,0.00005538052,0.000014924212,0.00003373895,0.000027923292,0.0018311687,0.9945251,0.0033782774],"study_design_scores_gemma":[0.000059153204,0.0000495739,0.0007387586,0.00034292875,0.000043831962,0.00039167132,0.00013708042,0.0004276881,0.0003430056,0.009293122,0.9881136,0.000059579925],"about_ca_topic_score_codex":0.021647641,"about_ca_topic_score_gemma":0.029173847,"teacher_disagreement_score":0.07732743,"about_ca_system_score_codex":0.0054283515,"about_ca_system_score_gemma":0.0042193267,"threshold_uncertainty_score":0.258686},"labels":[],"label_agreement":null},{"id":"W2423480771","doi":"10.1002/jgt.22053","title":"Minimum Power Dominating Sets of Random Cubic Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Cubic graph; Combinatorics; Heuristics; Random graph; Independent set; Dominating set; Discrete mathematics; Graph; Line graph; Mathematical optimization; Voltage graph; Vertex (graph theory)","score_opus":0.012297420658721215,"score_gpt":0.28186232163078867,"score_spread":0.2695649009720675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2423480771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60946625,0.00046775513,0.38209286,0.0008141838,0.00004431842,0.00034333827,0.0004958796,0.00057272887,0.0057026027],"genre_scores_gemma":[0.9359481,0.00014454017,0.062109392,0.0001201814,0.000017603843,0.00012697621,0.00023447293,0.00006701931,0.0012317442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998403,0.0005295425,0.000059598253,0.00031702252,0.00042773422,0.00026306868],"domain_scores_gemma":[0.98271376,0.0133161135,0.0011807383,0.0012611026,0.0008647789,0.0006635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025297776,0.000567359,0.0010754357,0.0015070273,0.00077621016,0.0011613457,0.002203953,0.00062278024,0.0020918925],"category_scores_gemma":[0.0218682,0.00048582058,0.00065779564,0.001357477,0.0012673163,0.0015403171,0.0014387121,0.0008438725,0.0002060866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00107136,0.00021388812,0.0080804685,0.00054019137,0.00016191212,0.00023211094,0.00042912527,0.82635695,0.025236698,0.07841351,0.0034682972,0.055795517],"study_design_scores_gemma":[0.00004398879,0.0000704422,0.000826231,0.000010408472,0.000013888722,0.00008419964,0.00004551101,0.96884745,0.003680905,0.025716508,0.00064782816,0.000012551303],"about_ca_topic_score_codex":0.0035309754,"about_ca_topic_score_gemma":0.0033732492,"teacher_disagreement_score":0.0035309754,"about_ca_system_score_codex":0.0026535392,"about_ca_system_score_gemma":0.0014675879,"threshold_uncertainty_score":0.019252837},"labels":[],"label_agreement":null},{"id":"W2429536804","doi":"10.1016/j.dam.2016.05.018","title":"On color-critical (<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>,co-<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs","year":2016,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Graph; Chromatic scale; Combinatorics; Mathematics; Discrete mathematics; Algorithm; Physics","score_opus":0.0199158217559506,"score_gpt":0.263607790125686,"score_spread":0.24369196836973542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2429536804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028266277,0.0010712256,0.6244399,0.0027667945,0.0011423415,0.00034971157,0.00589066,0.006540389,0.32953268],"genre_scores_gemma":[0.33843288,0.004229765,0.285533,0.003065284,0.0015220816,0.0005976703,0.018745914,0.012281335,0.33559212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993086,0.00013499035,0.00002463203,0.00016619416,0.00025413922,0.00011141171],"domain_scores_gemma":[0.99750465,0.0010025242,0.00015160858,0.00051711424,0.0006508424,0.00017326897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077539467,0.0010000732,0.00062946754,0.0026365872,0.0015777015,0.0024805546,0.0013413471,0.000753946,0.090300776],"category_scores_gemma":[0.004644239,0.00067571504,0.000951824,0.0021673094,0.0015639821,0.0042346367,0.0025912812,0.0019031125,0.022723623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015477839,0.00006653889,0.0006237242,0.00037532303,0.000031829943,0.00029952955,0.000564719,0.0056110453,0.004559642,0.7219479,0.18316114,0.082603835],"study_design_scores_gemma":[0.00003262749,0.000018409144,0.00050084095,0.00008719611,0.00001803116,0.00023345306,0.00014702835,0.008661885,0.002945792,0.8675295,0.119803056,0.00002221092],"about_ca_topic_score_codex":0.0056252936,"about_ca_topic_score_gemma":0.01034608,"teacher_disagreement_score":0.090300776,"about_ca_system_score_codex":0.0018764462,"about_ca_system_score_gemma":0.001098042,"threshold_uncertainty_score":0.30208617},"labels":[],"label_agreement":null},{"id":"W2438977958","doi":"10.55016/ojs/cdm.v12i1.62598","title":"First-Fit coloring of Cartesian product graphs and its defining sets","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Product (mathematics); Mathematics; Combinatorics; Geometry","score_opus":0.03617069705655002,"score_gpt":0.3428559451413638,"score_spread":0.3066852480848138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2438977958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5221699,0.0005358746,0.4562315,0.00046140404,0.000049000242,0.00008561636,0.00059273647,0.00037848405,0.019495428],"genre_scores_gemma":[0.7176788,0.00035701809,0.27462965,0.00022445677,0.00006602951,0.00017222554,0.0011588756,0.00016216336,0.0055507463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811554,0.00063506817,0.00010240823,0.00050516514,0.00036697133,0.00027485646],"domain_scores_gemma":[0.9941518,0.0029328144,0.00070609106,0.0010367817,0.0007172569,0.00045534485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015082267,0.0006890236,0.00064690295,0.001071051,0.0012575147,0.0017092029,0.0010277521,0.0005604976,0.0022905665],"category_scores_gemma":[0.0050332616,0.0007323009,0.00075016316,0.0013950273,0.0027582021,0.0020706633,0.0012309543,0.0014761371,0.00042763754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022278968,0.00012006743,0.0038460973,0.00017271517,0.000028437096,0.00020110427,0.0009627956,0.02282557,0.010345152,0.9300774,0.0027577311,0.028440101],"study_design_scores_gemma":[0.0000559765,0.00025865308,0.003700871,0.00005797367,0.000040919316,0.00107687,0.00033956062,0.09155349,0.00917164,0.8823491,0.0113388365,0.00005612414],"about_ca_topic_score_codex":0.0014077707,"about_ca_topic_score_gemma":0.001597796,"teacher_disagreement_score":0.0022905665,"about_ca_system_score_codex":0.0011422613,"about_ca_system_score_gemma":0.0008341244,"threshold_uncertainty_score":0.008287728},"labels":[],"label_agreement":null},{"id":"W2443199731","doi":"","title":"Inapproximability of treewidth and related problems","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Partial k-tree; Pathwidth; Tree-depth; Graphical model; Tree decomposition; Combinatorics; Computer science; Mathematics; 1-planar graph; Inference; Discrete mathematics; Graph; Chordal graph; Theoretical computer science; Artificial intelligence; Line graph","score_opus":0.1818545937339058,"score_gpt":0.3737240228359098,"score_spread":0.19186942910200397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2443199731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24210958,0.008616674,0.68684757,0.0180939,0.0004943081,0.00037727502,0.0048289313,0.0024510606,0.03618066],"genre_scores_gemma":[0.71493566,0.0066466997,0.25379172,0.0034752246,0.0013832932,0.00074799766,0.0050532836,0.0013966297,0.012569403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934123,0.0018943725,0.00028841823,0.0017609869,0.0014996363,0.0011443447],"domain_scores_gemma":[0.9351272,0.05619656,0.0026335826,0.0035562438,0.0014638572,0.001022463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045973733,0.0025430396,0.0032608092,0.0019474027,0.00211516,0.007133087,0.0058998717,0.003915017,0.010506834],"category_scores_gemma":[0.041498806,0.00191618,0.0042201723,0.0040441267,0.004291477,0.014801628,0.0035709194,0.009728071,0.0015138612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012322098,0.0008890684,0.005417077,0.002090233,0.00046897083,0.00054676924,0.0017299345,0.40849808,0.0066560498,0.4576705,0.035540156,0.07926092],"study_design_scores_gemma":[0.000103662875,0.000070107635,0.00043747717,0.00009557115,0.00007501015,0.00026984088,0.00020899657,0.25733534,0.0013459626,0.73669064,0.0033380522,0.000029313613],"about_ca_topic_score_codex":0.0036052729,"about_ca_topic_score_gemma":0.0031205066,"teacher_disagreement_score":0.010506834,"about_ca_system_score_codex":0.004186301,"about_ca_system_score_gemma":0.0024289652,"threshold_uncertainty_score":0.03514886},"labels":[],"label_agreement":null},{"id":"W2460448338","doi":"10.1007/s00373-016-1724-9","title":"Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity","year":2016,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Indifference graph; 1-planar graph; Pathwidth; Chordal graph; Discrete mathematics; Cograph; Graph; Line graph; Computer science","score_opus":0.01344883607917286,"score_gpt":0.23785468601881501,"score_spread":0.22440584993964216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460448338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6284331,0.00033301063,0.3082222,0.0011623856,0.00018896957,0.000102533544,0.00035033494,0.0004792911,0.060728204],"genre_scores_gemma":[0.9185887,0.00054760143,0.061794046,0.00023097674,0.00014466622,0.0001430629,0.00037495533,0.0001883039,0.017987719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938786,0.00012482677,0.00004117751,0.00014295007,0.00016452748,0.00013856242],"domain_scores_gemma":[0.9974464,0.001087802,0.00038231973,0.00035815433,0.0002328835,0.00049245567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073112943,0.00053961796,0.000650253,0.002238558,0.0024291258,0.002714744,0.0013240669,0.0013099656,0.008420499],"category_scores_gemma":[0.0042112307,0.00068034424,0.0010711419,0.0015923126,0.0027195506,0.0056164027,0.002845417,0.002878155,0.000848552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022502625,0.000031678002,0.00033094466,0.000031580574,0.0000039738325,0.00019119789,0.0003726147,0.0016645595,0.0010291479,0.9900535,0.00040463245,0.005863735],"study_design_scores_gemma":[0.000009575033,0.000010483293,0.00018844203,0.000020070906,0.0000074740237,0.00011099244,0.00023527998,0.0061557298,0.00048195955,0.9910521,0.0017191083,0.000008886049],"about_ca_topic_score_codex":0.0011399895,"about_ca_topic_score_gemma":0.001641676,"teacher_disagreement_score":0.008420499,"about_ca_system_score_codex":0.0007672098,"about_ca_system_score_gemma":0.00065891,"threshold_uncertainty_score":0.028169394},"labels":[],"label_agreement":null},{"id":"W2476701528","doi":"10.1016/s0012-365x(01)00209-6","title":"On dijoins","year":2002,"lang":"es","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Arc (geometry); Integer (computer science); Minimum weight; Combinatorics; Weight function; Discrete mathematics; Function (biology); Statistics; Computer science; Geometry","score_opus":0.04444712923435091,"score_gpt":0.31091035705345427,"score_spread":0.26646322781910337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476701528","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056704376,0.0037468686,0.10999977,0.010757557,0.004603019,0.000080225305,0.00072816206,0.0005825674,0.8127975],"genre_scores_gemma":[0.52410203,0.0033343125,0.03863309,0.0033043034,0.0014384942,0.00012872198,0.0017347756,0.0010800051,0.42624432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988028,0.00030077295,0.0000720709,0.00030180186,0.00031817408,0.0002045052],"domain_scores_gemma":[0.998519,0.00046414076,0.00009862469,0.0003351484,0.0003540867,0.00022896007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077957223,0.00067476166,0.00080841326,0.002594691,0.0043542273,0.003992591,0.0013520792,0.0013173661,0.039582334],"category_scores_gemma":[0.004902369,0.00046495462,0.0008792158,0.0031727946,0.0029029632,0.0062712724,0.004626803,0.003939604,0.005575059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026889098,0.000012219525,0.00014258898,0.00002377909,0.00000442213,0.000035135872,0.00017275791,0.00027641648,0.00012102824,0.977807,0.008596613,0.012781216],"study_design_scores_gemma":[0.000008703972,0.0000065716627,0.00015017539,0.000026943968,0.0000067297897,0.000075779346,0.00019338758,0.0014213141,0.00015329309,0.90911037,0.0888382,0.000008470199],"about_ca_topic_score_codex":0.0047063283,"about_ca_topic_score_gemma":0.00519951,"teacher_disagreement_score":0.039582334,"about_ca_system_score_codex":0.0020355491,"about_ca_system_score_gemma":0.00091846567,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2476908243","doi":"10.1016/j.dam.2016.07.002","title":"Uniquely forced perfect matching and unique 3-edge-coloring","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Science Foundation of Sri Lanka; Simons Foundation; National Natural Science Foundation of China; National Sanitarium Association; National Science Foundation","keywords":"Mathematics; Combinatorics; Matching (statistics); Edge coloring; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Graph; Computer science; Statistics","score_opus":0.018810681003194614,"score_gpt":0.27401836684245623,"score_spread":0.2552076858392616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476908243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5050995,0.0008141977,0.37877607,0.0024703618,0.00092492206,0.00018848975,0.0011966516,0.0012865978,0.10924325],"genre_scores_gemma":[0.8908199,0.00042313247,0.082618155,0.0007184028,0.00014187497,0.00013248564,0.00060320215,0.00030856865,0.024234219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986833,0.00023712129,0.000083319836,0.00041754785,0.00023637261,0.00034242187],"domain_scores_gemma":[0.99762183,0.0007650399,0.00038354803,0.0005469198,0.00027743418,0.00040518335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087072916,0.0007503562,0.0013039011,0.0009881986,0.0033256698,0.0028301158,0.002200177,0.0021981772,0.012586246],"category_scores_gemma":[0.0046939324,0.0010547643,0.0011697136,0.0013899243,0.0022818218,0.004981856,0.0038498442,0.0031280052,0.0019036136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019330888,0.00008447447,0.00069583463,0.00014021162,0.000029471064,0.00040843364,0.00040182928,0.006002452,0.0047814455,0.9667635,0.0045641153,0.015934939],"study_design_scores_gemma":[0.000042061896,0.000028274322,0.00035371617,0.000025571777,0.00002315551,0.00049630005,0.00017909179,0.012111002,0.0031708684,0.97948533,0.0040527023,0.000032019056],"about_ca_topic_score_codex":0.0014419861,"about_ca_topic_score_gemma":0.0020959168,"teacher_disagreement_score":0.012586246,"about_ca_system_score_codex":0.001257256,"about_ca_system_score_gemma":0.0015568302,"threshold_uncertainty_score":0.04210514},"labels":[],"label_agreement":null},{"id":"W2477185620","doi":"10.1016/j.dam.2016.07.020","title":"Safe set problem on graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Set (abstract data type); Discrete mathematics; Computer science; Programming language","score_opus":0.025103304140731954,"score_gpt":0.287618367183075,"score_spread":0.262515063042343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477185620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29021403,0.0014991994,0.58424234,0.014841008,0.00057204405,0.0003985301,0.0027012832,0.0007381595,0.10479347],"genre_scores_gemma":[0.8104496,0.0015973609,0.13595551,0.0011496329,0.0005827028,0.0005509784,0.003118652,0.0004822279,0.04611347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800354,0.00069864246,0.000097108015,0.00041783167,0.00052875245,0.0002541353],"domain_scores_gemma":[0.991991,0.005758816,0.00047116683,0.0006021906,0.00037952838,0.00079745386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021580965,0.0014594364,0.0027700816,0.0022031886,0.0025537359,0.0062254295,0.004633974,0.0039937687,0.01502557],"category_scores_gemma":[0.009801308,0.0012874538,0.0018653142,0.0030071137,0.004338238,0.010903453,0.005091418,0.0063988864,0.00095298456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016025384,0.0001271313,0.00024395836,0.00020261423,0.00006260347,0.00013154895,0.00039402748,0.03681831,0.00053795753,0.9370893,0.0069357865,0.017296467],"study_design_scores_gemma":[0.000026113294,0.000011788146,0.000043564494,0.000019369902,0.000010969532,0.000025809926,0.00010505147,0.02234802,0.00027256907,0.9759033,0.0012264708,0.0000069180605],"about_ca_topic_score_codex":0.002940062,"about_ca_topic_score_gemma":0.002466502,"teacher_disagreement_score":0.01502557,"about_ca_system_score_codex":0.0030182896,"about_ca_system_score_gemma":0.001991392,"threshold_uncertainty_score":0.05026549},"labels":[],"label_agreement":null},{"id":"W2482477387","doi":"10.1016/j.dam.2016.06.019","title":"A deterministic version of the game of zombies and survivors on graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; Memorial University of Newfoundland; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.013771039968413844,"score_gpt":0.25651936903229,"score_spread":0.24274832906387617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482477387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.359918,0.0006932797,0.5200625,0.00588314,0.00031847967,0.0004028195,0.001739899,0.00044932193,0.110532485],"genre_scores_gemma":[0.9182219,0.00046154225,0.041823827,0.0005248904,0.00015273318,0.00022303543,0.00044317628,0.00013980061,0.038009115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799854,0.00076294935,0.00009132558,0.00040230036,0.00029961587,0.000445266],"domain_scores_gemma":[0.9950742,0.0026849005,0.00043564092,0.00078430964,0.0003611976,0.00065963727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016140084,0.00074096624,0.0015251893,0.0008564538,0.0015881365,0.0036735055,0.003650046,0.0029825936,0.015383994],"category_scores_gemma":[0.009166552,0.0007825762,0.0011833181,0.001208701,0.0033698475,0.0050959224,0.0026424709,0.002893308,0.00068803737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070951864,0.000027128955,0.00025156443,0.00005638372,0.000024336938,0.000067879366,0.00017921955,0.029320419,0.00060751784,0.96410197,0.0023037323,0.0029887964],"study_design_scores_gemma":[0.00007341792,0.00002724166,0.0002123701,0.000015418085,0.000016841685,0.000070504466,0.000120619334,0.10360078,0.00019936953,0.89205694,0.0035786075,0.000027941718],"about_ca_topic_score_codex":0.010525242,"about_ca_topic_score_gemma":0.009364406,"teacher_disagreement_score":0.015383994,"about_ca_system_score_codex":0.0023774519,"about_ca_system_score_gemma":0.0021593117,"threshold_uncertainty_score":0.051464558},"labels":[],"label_agreement":null},{"id":"W2483716866","doi":"10.1016/j.dam.2016.06.030","title":"Well-covered triangulations: Part IV","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Plane (geometry); Triangulation; Graph; Simple (philosophy); Pitteway triangulation; Geometry; Delaunay triangulation","score_opus":0.02604900886195653,"score_gpt":0.2851178197495272,"score_spread":0.25906881088757067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483716866","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26455075,0.0123616755,0.34661922,0.004672469,0.0022159012,0.00037992463,0.003392182,0.0005413361,0.36526656],"genre_scores_gemma":[0.8021124,0.009604863,0.06999086,0.0014032291,0.0016434959,0.00034593418,0.004019282,0.0009207693,0.10995904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916196,0.00017715455,0.000057412064,0.00017141008,0.00028167618,0.00015037738],"domain_scores_gemma":[0.998486,0.0006804242,0.00022440664,0.00022324095,0.00020259264,0.0001834121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006132141,0.0009726797,0.00081904425,0.0027146162,0.0011048197,0.0025429754,0.0014226347,0.001476871,0.01881361],"category_scores_gemma":[0.0038457774,0.00075372047,0.0011520288,0.002370485,0.0020930734,0.0038490067,0.0029751118,0.0031323603,0.0032521759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006524411,0.000038010632,0.00077366736,0.00027196298,0.000032083615,0.00022727737,0.00048348287,0.0046108854,0.0034145638,0.9529446,0.009880066,0.027258094],"study_design_scores_gemma":[0.000014875891,0.000034390923,0.0010134063,0.000090433714,0.000024029692,0.000473863,0.00035197067,0.009532049,0.0012943079,0.9682196,0.018930236,0.00002078732],"about_ca_topic_score_codex":0.0013174013,"about_ca_topic_score_gemma":0.0011536002,"teacher_disagreement_score":0.01881361,"about_ca_system_score_codex":0.0009137157,"about_ca_system_score_gemma":0.00047140213,"threshold_uncertainty_score":0.062937796},"labels":[],"label_agreement":null},{"id":"W2486389624","doi":"10.1007/978-3-319-39817-4_6","title":"Positive Zero Forcing and Edge Clique Coverings","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Clique problem; Clique; Forcing (mathematics); Computer science; Popularity; Uniqueness; Enhanced Data Rates for GSM Evolution; Graph; Context (archaeology); Zero (linguistics); Discrete mathematics; Combinatorics; Mathematics; Theoretical computer science; Chordal graph; 1-planar graph; Artificial intelligence; Mathematical analysis","score_opus":0.013882316641440514,"score_gpt":0.26798024283240585,"score_spread":0.25409792619096533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486389624","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30820882,0.0022669814,0.15721959,0.0036450513,0.0008831672,0.000075244316,0.0006161192,0.00052496366,0.52656],"genre_scores_gemma":[0.92245483,0.00094782945,0.016122809,0.0004477746,0.00044807873,0.000087878725,0.0004112817,0.00019948349,0.058879916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940836,0.00012793881,0.0000205854,0.00012358403,0.00017792996,0.00014163292],"domain_scores_gemma":[0.9977447,0.0014063068,0.00014497837,0.0002514794,0.000183701,0.0002688787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005558274,0.00044934842,0.000681856,0.0013969756,0.0021552858,0.0019599893,0.0008108805,0.0010911584,0.01282335],"category_scores_gemma":[0.0032124782,0.00048502308,0.0007911896,0.00111919,0.0031430451,0.0027180717,0.0025767968,0.0024999743,0.001043556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024370798,0.000007243593,0.000104589984,0.000035615474,0.0000033308881,0.000037680806,0.000095954376,0.000796893,0.00045038905,0.99230766,0.0019056619,0.0042305156],"study_design_scores_gemma":[0.0000102681215,0.0000060897555,0.00013929163,0.00001683669,0.0000045203933,0.00009594835,0.000053295644,0.0023419468,0.0002894589,0.99214983,0.0048855185,0.0000069945418],"about_ca_topic_score_codex":0.00081646495,"about_ca_topic_score_gemma":0.001000522,"teacher_disagreement_score":0.01282335,"about_ca_system_score_codex":0.00093484455,"about_ca_system_score_gemma":0.0004591378,"threshold_uncertainty_score":0.042898357},"labels":[],"label_agreement":null},{"id":"W2490114670","doi":"10.1016/j.dam.2017.04.027","title":"The complexity of tropical graph homomorphisms","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Combinatorics; Graph homomorphism; Conjecture; Discrete mathematics; Constraint satisfaction problem; Vertex (graph theory); Graph; Decision problem; Line graph; Graph power; Algorithm","score_opus":0.06269867441457949,"score_gpt":0.31791921410978163,"score_spread":0.25522053969520214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490114670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.817946,0.0013477793,0.10393216,0.007651431,0.00022629161,0.00006287841,0.0010057668,0.000292146,0.067535475],"genre_scores_gemma":[0.9840958,0.0007235687,0.0069437167,0.00026809794,0.00038009437,0.00007164577,0.0005089854,0.000109397304,0.0068987464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779737,0.0005959839,0.00010543603,0.0004112453,0.0006509285,0.00043920978],"domain_scores_gemma":[0.98188156,0.013449326,0.001297818,0.0013473075,0.00074940734,0.0012746244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016807393,0.00063972257,0.0013837084,0.0023345782,0.0020775986,0.006340883,0.002264755,0.0017544993,0.011711561],"category_scores_gemma":[0.012743394,0.0007146727,0.0011518697,0.0024882297,0.0049607456,0.018514555,0.004109547,0.0042677843,0.00078450225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106779684,0.000043687978,0.0010624975,0.00007464682,0.00001703568,0.00007939257,0.0004704476,0.0054349885,0.00063637353,0.9853881,0.0016098147,0.005076134],"study_design_scores_gemma":[0.000019145793,0.000012159864,0.0003921571,0.00000948707,0.000011699695,0.00008185509,0.00010001302,0.011300787,0.0002673176,0.9869855,0.00080731127,0.000012555472],"about_ca_topic_score_codex":0.0014090261,"about_ca_topic_score_gemma":0.0010981576,"teacher_disagreement_score":0.011711561,"about_ca_system_score_codex":0.0022755684,"about_ca_system_score_gemma":0.0010381655,"threshold_uncertainty_score":0.039179087},"labels":[],"label_agreement":null},{"id":"W2498882618","doi":"10.1090/stml/061/04","title":"Graph products and classes","year":2011,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Graph; Computer science; Theoretical computer science","score_opus":0.035084098261499885,"score_gpt":0.2763680966478449,"score_spread":0.241283998386345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498882618","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005192851,0.0035658625,0.015030692,0.001300543,0.00081819843,0.000047579415,0.00038167989,0.00043036576,0.97323227],"genre_scores_gemma":[0.06213238,0.004131394,0.010606403,0.000542886,0.0005554764,0.000116370014,0.0008476032,0.00066442584,0.920403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997545,0.000035721456,0.0000072729954,0.00007298764,0.00009775156,0.00003182797],"domain_scores_gemma":[0.9998202,0.000039408245,0.000009250117,0.00003957947,0.000047308753,0.00004429605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001877446,0.0006586635,0.0004959544,0.0010118436,0.0014805532,0.0034465904,0.00086838513,0.0004643354,0.09164894],"category_scores_gemma":[0.0006489704,0.00041722687,0.00035200125,0.0020233411,0.0013989846,0.004117509,0.0013846785,0.0020258916,0.022901088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001234183,0.000031537555,0.0000733995,0.000080107544,0.0000031556044,0.000017677086,0.00030756512,0.00024861487,0.00034357278,0.78946877,0.11573729,0.09367591],"study_design_scores_gemma":[0.000004260538,0.000010131808,0.00018972834,0.000045284884,0.0000041511084,0.000062903506,0.00011382154,0.00028111401,0.00022735335,0.3070431,0.69201326,0.0000048623892],"about_ca_topic_score_codex":0.0015201314,"about_ca_topic_score_gemma":0.002895872,"teacher_disagreement_score":0.09164894,"about_ca_system_score_codex":0.0016212603,"about_ca_system_score_gemma":0.0008210803,"threshold_uncertainty_score":0.30659622},"labels":[],"label_agreement":null},{"id":"W2503340257","doi":"10.1016/j.dam.2016.12.012","title":"Dominating and irredundant broadcasts in graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Graph; Function (biology); Discrete mathematics","score_opus":0.023517136945559337,"score_gpt":0.310361409231844,"score_spread":0.2868442722862847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503340257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65685797,0.0028196275,0.26549718,0.005593614,0.00033868573,0.00022524667,0.0013831635,0.0006177795,0.066666715],"genre_scores_gemma":[0.9482405,0.0013630884,0.027204098,0.0006354481,0.00042992548,0.00016695754,0.0006950752,0.00023577143,0.02102909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696594,0.0009294188,0.00018046726,0.0007080993,0.00063943415,0.0005767699],"domain_scores_gemma":[0.96179837,0.027794853,0.0028332367,0.0028397534,0.0021531037,0.002580703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030645865,0.00093487656,0.0019868407,0.0027322478,0.0030879066,0.0057723434,0.003165526,0.0023465601,0.005888031],"category_scores_gemma":[0.022910636,0.0015974247,0.0012727531,0.0029927748,0.004271823,0.0068080607,0.0030154253,0.0036914602,0.00080126576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051908416,0.00013571275,0.0016093289,0.0002876211,0.000055055603,0.00032469042,0.0019417045,0.018223012,0.0029532486,0.95362467,0.004423336,0.015902469],"study_design_scores_gemma":[0.00008517912,0.000050670424,0.00054416276,0.00004726752,0.00007230395,0.0002879273,0.00045292964,0.04372291,0.0013507184,0.9505057,0.0028555116,0.000024802464],"about_ca_topic_score_codex":0.0025287287,"about_ca_topic_score_gemma":0.0033651472,"teacher_disagreement_score":0.005888031,"about_ca_system_score_codex":0.0030396278,"about_ca_system_score_gemma":0.0015934675,"threshold_uncertainty_score":0.022054136},"labels":[],"label_agreement":null},{"id":"W25053562","doi":"10.1099/vir.0.066423-0","title":"Dimensions for Cographs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Biotechnology and Biological Sciences Research Council","keywords":"Mathematics","score_opus":0.01702045984928318,"score_gpt":0.28752908839130725,"score_spread":0.27050862854202407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25053562","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030142022,0.003421797,0.1691841,0.0026980047,0.0030821029,0.0006014261,0.30917594,0.2832122,0.22561018],"genre_scores_gemma":[0.036862206,0.0038123012,0.29570383,0.0027637465,0.0008218526,0.0023427613,0.41655588,0.087881505,0.15325594],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997881,0.00025355726,0.0002315677,0.00073583185,0.00061371364,0.00028427196],"domain_scores_gemma":[0.99788445,0.00054137345,0.00015961878,0.00064717716,0.00049624196,0.0002710056],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017871573,0.0032179353,0.0020490356,0.0043955217,0.0020313784,0.0073439977,0.004022333,0.0027307537,0.43737164],"category_scores_gemma":[0.0076603265,0.0019071084,0.0026955404,0.004637774,0.0012886991,0.00690356,0.0064123794,0.0025763763,0.36216757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038954147,0.00006215278,0.0012667358,0.0017014004,0.000105570085,0.0003348505,0.0007790793,0.00065615936,0.0028329494,0.05170619,0.7642373,0.17592804],"study_design_scores_gemma":[0.000053200034,0.000019313842,0.00067038013,0.00023522436,0.000029619257,0.00023185201,0.0001617915,0.0014969341,0.000994384,0.034800258,0.96126723,0.000039803854],"about_ca_topic_score_codex":0.005423766,"about_ca_topic_score_gemma":0.006085359,"teacher_disagreement_score":0.43737164,"about_ca_system_score_codex":0.0014644364,"about_ca_system_score_gemma":0.002196142,"threshold_uncertainty_score":0.80252105},"labels":[],"label_agreement":null},{"id":"W2507346374","doi":"10.1002/jgt.22416","title":"Bounded diameter arboricity","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arboricity; Mathematics; Combinatorics; Bounded function; Dense graph; Planar graph; Degeneracy (biology); 1-planar graph; Graph; Discrete mathematics; Biology; Chordal graph; Mathematical analysis","score_opus":0.027473957245941583,"score_gpt":0.3093677013235276,"score_spread":0.281893744077586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507346374","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7471394,0.0015047048,0.19122653,0.0009677478,0.000084916195,0.00008075898,0.0012887341,0.00061065744,0.057096526],"genre_scores_gemma":[0.98034346,0.00039764796,0.015929634,0.00015341007,0.00006383049,0.000052097028,0.00052742363,0.00006755385,0.0024649564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993272,0.00010754967,0.000036050744,0.0002187987,0.00017394814,0.00013641476],"domain_scores_gemma":[0.99696404,0.0014808092,0.00042387913,0.00044501998,0.00034432192,0.0003418666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038854883,0.0003904447,0.00056440756,0.0011236742,0.00073229225,0.0011164166,0.00076858146,0.0005044097,0.004487967],"category_scores_gemma":[0.0026720276,0.00032777706,0.0004492816,0.00093318213,0.0010724094,0.0022263094,0.0017497122,0.00096759695,0.00042748387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046637192,0.00010757523,0.020819288,0.00051921076,0.00011181435,0.001136902,0.0010847655,0.058780592,0.08473152,0.7692207,0.009115258,0.053906012],"study_design_scores_gemma":[0.000060149898,0.00026513272,0.015976083,0.00015239221,0.00009591506,0.0029807326,0.00064801687,0.13805836,0.022823492,0.78158134,0.03730652,0.00005173573],"about_ca_topic_score_codex":0.0006356548,"about_ca_topic_score_gemma":0.00067617756,"teacher_disagreement_score":0.004487967,"about_ca_system_score_codex":0.00058235443,"about_ca_system_score_gemma":0.00026603616,"threshold_uncertainty_score":0.015013754},"labels":[],"label_agreement":null},{"id":"W2513478778","doi":"10.46298/dmtcs.2151","title":"Connected Tropical Subgraphs in Vertex-Colored Graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université Paris-Sud; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Mathematics; Distance-hereditary graph; Induced subgraph isomorphism problem; Graph factorization; Discrete mathematics; Vertex (graph theory); Colored; Vertex connectivity; Graph; Line graph; Graph power; Voltage graph","score_opus":0.014897976962016534,"score_gpt":0.27965574467572957,"score_spread":0.264757767713713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513478778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70643616,0.0006165827,0.2772701,0.0010657556,0.000041941134,0.00020872024,0.00128037,0.00084982574,0.012230455],"genre_scores_gemma":[0.9338432,0.00042350768,0.062105324,0.00016472818,0.00006357128,0.000092950795,0.0010812363,0.00013685781,0.0020886096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999236,0.00018847283,0.000039875977,0.0002044597,0.00016758038,0.00016360724],"domain_scores_gemma":[0.9932904,0.0045769652,0.00076276646,0.0005821396,0.00030803654,0.0004796966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684338,0.0004161617,0.00057932065,0.0009315459,0.000846654,0.0014082278,0.000937906,0.0006043262,0.0033367071],"category_scores_gemma":[0.005500054,0.0005475591,0.00065611483,0.001237236,0.0013416186,0.0031708346,0.001258218,0.0010397815,0.00027642393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011857915,0.00027956694,0.011830122,0.0010393152,0.00016204377,0.0013345479,0.001477338,0.27761042,0.061998606,0.56340086,0.008490167,0.0711912],"study_design_scores_gemma":[0.000115308976,0.00012914954,0.0042559546,0.000068787325,0.00010044239,0.0010430437,0.00042521046,0.341199,0.019308798,0.6277977,0.0055142967,0.000042224496],"about_ca_topic_score_codex":0.0024213009,"about_ca_topic_score_gemma":0.0032337338,"teacher_disagreement_score":0.0033367071,"about_ca_system_score_codex":0.0012543519,"about_ca_system_score_gemma":0.00080185203,"threshold_uncertainty_score":0.011162341},"labels":[],"label_agreement":null},{"id":"W2514094964","doi":"10.1007/978-3-319-50106-2_39","title":"Stack and Queue Layouts via Layered Separators","year":2016,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Book embedding; Bounded function; Planar graph; 1-planar graph; Mathematics; Vertex (graph theory); Pathwidth; Stack (abstract data type); Graph; Genus; Discrete mathematics; Queue; Chordal graph; Computer science; Line graph","score_opus":0.019318804897004098,"score_gpt":0.30960468144179637,"score_spread":0.29028587654479227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514094964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4636164,0.0008959097,0.4843552,0.001145262,0.00022464442,0.000088994064,0.0010604102,0.0036118748,0.04500126],"genre_scores_gemma":[0.88583165,0.0006303494,0.09319355,0.0002131167,0.000104209554,0.00009526769,0.00063608965,0.0006273305,0.018668365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924767,0.00010482906,0.000045945195,0.00021006928,0.00017765703,0.00021391753],"domain_scores_gemma":[0.9967458,0.0010233498,0.00058846344,0.0007735272,0.0003248527,0.0005439511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005246366,0.000551086,0.00048953155,0.0010634906,0.001579536,0.0028818853,0.0012716383,0.0009311909,0.010535492],"category_scores_gemma":[0.004830572,0.00066284963,0.0006733259,0.0012726457,0.0019843103,0.0067335023,0.0032505905,0.0016236217,0.0014622312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005462452,0.000104191306,0.0027886324,0.00019280834,0.000043591,0.00040562096,0.0008690325,0.035525676,0.019222913,0.88644713,0.006683166,0.04717099],"study_design_scores_gemma":[0.00009474342,0.00017606173,0.0014274068,0.00006785305,0.00006461253,0.0005945297,0.00044436796,0.123010725,0.013524196,0.83657205,0.023931718,0.000091752125],"about_ca_topic_score_codex":0.0023826575,"about_ca_topic_score_gemma":0.0034804856,"teacher_disagreement_score":0.010535492,"about_ca_system_score_codex":0.0015484102,"about_ca_system_score_gemma":0.0011401984,"threshold_uncertainty_score":0.035244703},"labels":[],"label_agreement":null},{"id":"W2514737704","doi":"10.1002/net.21700","title":"The Rainbow Cycle Cover Problem","year":2016,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rainbow; Mathematics; Disjoint sets; Cover (algebra); Integer programming; Combinatorics; Graph; Computer science; Algorithm","score_opus":0.009872359546378906,"score_gpt":0.2553044581065949,"score_spread":0.245432098560216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514737704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093200356,0.0022338761,0.8464018,0.003345849,0.00037951724,0.00065873365,0.0029379576,0.00097536016,0.04986652],"genre_scores_gemma":[0.6018946,0.003605376,0.36298048,0.0008344783,0.00041799486,0.0006632047,0.004506688,0.00045581174,0.024641281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854773,0.00034629361,0.00006093669,0.00037791787,0.00034094628,0.00032617914],"domain_scores_gemma":[0.9986462,0.0007349529,0.00019349199,0.0001729674,0.000109698,0.00014283351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084677106,0.0015041914,0.0009773541,0.0009219544,0.0012214244,0.0019983097,0.0024493856,0.001914694,0.009919311],"category_scores_gemma":[0.0038782305,0.00057196134,0.0013590999,0.0020053783,0.0011403614,0.00449477,0.0023900783,0.0018575026,0.0008557526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026174582,0.0003305286,0.0015747786,0.0005873271,0.00019372323,0.0006673825,0.00028149603,0.4765333,0.0037288426,0.3876677,0.03412294,0.09405035],"study_design_scores_gemma":[0.00010278508,0.00015211047,0.00040259142,0.0000915018,0.00009544837,0.0005755318,0.000184801,0.5181438,0.002912097,0.43618366,0.041119397,0.00003631487],"about_ca_topic_score_codex":0.004000755,"about_ca_topic_score_gemma":0.0047702235,"teacher_disagreement_score":0.009919311,"about_ca_system_score_codex":0.0018522191,"about_ca_system_score_gemma":0.0021982393,"threshold_uncertainty_score":0.033183396},"labels":[],"label_agreement":null},{"id":"W2515761800","doi":"10.1016/j.jctb.2017.06.004","title":"Five-list-coloring graphs on surfaces III. One list of size one and one list of size two","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Lemma (botany); Bounded function; Vertex (graph theory); Graph; Planar graph; List coloring; Discrete mathematics; Mathematical analysis","score_opus":0.028470303022839833,"score_gpt":0.30270284349428384,"score_spread":0.274232540471444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515761800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8055724,0.00035484091,0.0836091,0.0019040046,0.00039575493,0.00016196707,0.0010340759,0.0014314804,0.105536364],"genre_scores_gemma":[0.9254531,0.00021585147,0.046200514,0.00051316206,0.00009462391,0.00011658125,0.0014276486,0.00034403804,0.025634445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908876,0.0001467522,0.000044702676,0.00015620884,0.00018457879,0.0003790404],"domain_scores_gemma":[0.9974043,0.00066979945,0.00027764175,0.000613641,0.0004142725,0.0006203826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048550253,0.0007679672,0.00076280185,0.001014703,0.003179035,0.0038433052,0.0019628578,0.0020632157,0.014396423],"category_scores_gemma":[0.0023608194,0.00073001796,0.0011029694,0.0012234534,0.0021131127,0.0028972852,0.0017897605,0.001805726,0.0020531914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008126188,0.00032097107,0.0050037955,0.0003452138,0.00006578306,0.0010050898,0.00092122273,0.014354682,0.02345062,0.9075034,0.017741917,0.028474623],"study_design_scores_gemma":[0.00019453462,0.00015551448,0.0053726076,0.00010156047,0.00011204311,0.00091548456,0.0017776598,0.06372223,0.015069122,0.89190936,0.020560408,0.00010953609],"about_ca_topic_score_codex":0.005055756,"about_ca_topic_score_gemma":0.006701108,"teacher_disagreement_score":0.014396423,"about_ca_system_score_codex":0.0020349943,"about_ca_system_score_gemma":0.0013649071,"threshold_uncertainty_score":0.04816085},"labels":[],"label_agreement":null},{"id":"W2516346504","doi":"10.1016/j.jctb.2016.07.009","title":"Properties of regular graphs with large girth via local algorithms","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação de Amparo à Pesquisa do Estado do Rio Grande do Sul; Australian Research Council; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Girth (graph theory); Discrete mathematics; Upper and lower bounds","score_opus":0.009874030088849246,"score_gpt":0.23027590097219577,"score_spread":0.22040187088334653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516346504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.869799,0.0005389505,0.102919765,0.0010255056,0.00004747369,0.00011607182,0.0005015338,0.00092787127,0.024123752],"genre_scores_gemma":[0.9814936,0.00029118042,0.013515499,0.00013955595,0.00011628997,0.00011782212,0.00046572986,0.0003654412,0.0034949032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998539,0.0004802526,0.00006823406,0.00039436875,0.00029838108,0.0002197809],"domain_scores_gemma":[0.9776309,0.014655318,0.0029330614,0.0023711792,0.0008843456,0.0015252655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014416366,0.0007883643,0.0017714916,0.0026421917,0.0020392004,0.0044954936,0.0029711428,0.0017579275,0.008613532],"category_scores_gemma":[0.01412645,0.0011718599,0.0014002796,0.0026090231,0.003834348,0.007280667,0.0027388195,0.0027648127,0.0010524417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010412952,0.0004418365,0.00784249,0.0004999659,0.00015502865,0.0007686319,0.0017498045,0.056611773,0.01627893,0.8758102,0.006559577,0.032240555],"study_design_scores_gemma":[0.00015342506,0.0001647699,0.0019580817,0.000055870718,0.0001158397,0.00068655965,0.0005762759,0.09039716,0.0044625513,0.8991176,0.0022500586,0.000061924926],"about_ca_topic_score_codex":0.0005125678,"about_ca_topic_score_gemma":0.0006545952,"teacher_disagreement_score":0.008613532,"about_ca_system_score_codex":0.0013993677,"about_ca_system_score_gemma":0.0008161254,"threshold_uncertainty_score":0.02881509},"labels":[],"label_agreement":null},{"id":"W2516383456","doi":"10.1002/rsa.20743","title":"Arboricity and spanning‐tree packing in random graphs","year":2017,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Arboricity; Combinatorics; Mathematics; Random graph; Graph; Disjoint sets; Spanning tree; Minimum spanning tree; Degeneracy (biology); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Planar graph","score_opus":0.018074560900552906,"score_gpt":0.2960829136122864,"score_spread":0.27800835271173346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516383456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7271904,0.0011098996,0.26048803,0.0013458648,0.00006219246,0.00007133856,0.00017356122,0.0002615488,0.009297202],"genre_scores_gemma":[0.98997915,0.0002619237,0.00845058,0.00010868438,0.00007775913,0.000051308027,0.00008528562,0.000037297566,0.0009479805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862874,0.000565944,0.00006656374,0.00023897529,0.00027530006,0.00022448195],"domain_scores_gemma":[0.98241764,0.0124853505,0.002589561,0.00091080513,0.00066982367,0.0009268243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025509621,0.0006349797,0.0010416678,0.0019109616,0.00093159074,0.0017223016,0.0014902182,0.0012570256,0.0026508246],"category_scores_gemma":[0.015217149,0.00066967076,0.0005640193,0.0011854555,0.0026852041,0.0033296042,0.0016593032,0.0012400794,0.0002751487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004911084,0.00017587461,0.004829323,0.0002486605,0.00011031677,0.00068504916,0.00040455192,0.25550202,0.013975718,0.7055926,0.0034849104,0.014499972],"study_design_scores_gemma":[0.00005963517,0.00009978052,0.0013673486,0.000044096603,0.000025431016,0.00034274973,0.00009148913,0.7042198,0.0033546356,0.28939497,0.0009708398,0.000029192588],"about_ca_topic_score_codex":0.0005899545,"about_ca_topic_score_gemma":0.00056787883,"teacher_disagreement_score":0.0026508246,"about_ca_system_score_codex":0.0012062042,"about_ca_system_score_gemma":0.0003875406,"threshold_uncertainty_score":0.013490915},"labels":[],"label_agreement":null},{"id":"W2517590891","doi":"10.1109/candar.2015.10","title":"A Practical Algorithm for Embedding Graphs on Torus","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Torus; Embedding; Time complexity; Exponential function; Computer science; Graph embedding; Algorithm; Graph; Implementation; Exponential growth; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.10039724446471492,"score_gpt":0.4175264391665561,"score_spread":0.31712919470184114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517590891","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017777674,0.00019846311,0.9652804,0.0005950076,0.0002042524,0.00021835939,0.00031584103,0.006405753,0.009004313],"genre_scores_gemma":[0.16114984,0.00033677777,0.8242996,0.00024460247,0.000102688486,0.00035969392,0.0024539782,0.00068004965,0.010372808],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989065,0.000099958284,0.00009331649,0.00033646953,0.00033469207,0.0002289834],"domain_scores_gemma":[0.9988703,0.00024047359,0.00007945268,0.00039785638,0.00033103768,0.00008082634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042938773,0.0012879947,0.00068409217,0.0009595599,0.0010362121,0.00098403,0.001415833,0.001128252,0.01211752],"category_scores_gemma":[0.0025936079,0.0004619232,0.0008693334,0.0017303843,0.0006818352,0.0033763347,0.0025820963,0.0012888426,0.0041742227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005107734,0.0004142559,0.0012686193,0.00057899236,0.00008076885,0.0006343015,0.00057661853,0.064451076,0.040233776,0.06921876,0.07357184,0.7484603],"study_design_scores_gemma":[0.0004117697,0.0005321018,0.0009608521,0.00005761326,0.0001300754,0.0021084014,0.0008178697,0.655011,0.038386505,0.19216006,0.10928255,0.00014121518],"about_ca_topic_score_codex":0.0020891032,"about_ca_topic_score_gemma":0.0028169318,"teacher_disagreement_score":0.01211752,"about_ca_system_score_codex":0.0008167265,"about_ca_system_score_gemma":0.0016980368,"threshold_uncertainty_score":0.04053718},"labels":[],"label_agreement":null},{"id":"W2519651985","doi":"10.1016/j.jctb.2017.05.006","title":"Layered separators in minor-closed graph classes with applications","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Mathematics; Combinatorics; Graph; Minor (academic); Discrete mathematics; Humanities","score_opus":0.015371805154149988,"score_gpt":0.29770729704332677,"score_spread":0.2823354918891768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519651985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5094778,0.0010367145,0.42185512,0.0021786029,0.00027174008,0.00012141587,0.0005529247,0.00089988555,0.06360589],"genre_scores_gemma":[0.90173256,0.00071153365,0.067550205,0.00036553197,0.0004251777,0.0001653754,0.00061158714,0.00040117546,0.028036961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990915,0.00023203818,0.000053997,0.00026445565,0.00019174366,0.00016631866],"domain_scores_gemma":[0.99414176,0.0030256954,0.00063317345,0.0005122918,0.0005378683,0.0011491403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000826571,0.0008126856,0.001140116,0.0029406168,0.0020653296,0.004075993,0.002172391,0.0017895901,0.009426818],"category_scores_gemma":[0.008403301,0.0008320184,0.0013075785,0.0025135798,0.0027106083,0.0056237844,0.0049064183,0.0039951764,0.0011831598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007531887,0.000053065967,0.00074044004,0.000058870573,0.000013514198,0.000073657306,0.00043086754,0.0024995669,0.0012201216,0.9818602,0.0022302852,0.010744124],"study_design_scores_gemma":[0.00002045492,0.000017854136,0.00037304327,0.000021428967,0.00001761954,0.00011523545,0.00016636847,0.02172653,0.0006235513,0.9736727,0.003232407,0.000012760566],"about_ca_topic_score_codex":0.0011266137,"about_ca_topic_score_gemma":0.001292602,"teacher_disagreement_score":0.009426818,"about_ca_system_score_codex":0.0014211134,"about_ca_system_score_gemma":0.00061090925,"threshold_uncertainty_score":0.031535923},"labels":[],"label_agreement":null},{"id":"W2519804096","doi":"10.4230/lipics.itcs.2017.1","title":"A QPTAS for Facility Location on Unit Disk Graphs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Intersection graph; Mathematics; Bounded function; Conjecture; Graph; Planar graph; Vertex (graph theory); Discrete mathematics; Line graph","score_opus":0.1243178623298497,"score_gpt":0.2416566583914334,"score_spread":0.1173387960615837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519804096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1129072,0.004096211,0.81805754,0.008053013,0.0005188907,0.00089185615,0.007667355,0.0039231735,0.04388479],"genre_scores_gemma":[0.6014699,0.001797019,0.36690098,0.0019411433,0.000399135,0.0010657941,0.0054702987,0.00076885807,0.020186882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981925,0.0005626724,0.00006677074,0.00050936046,0.00022982704,0.00043900695],"domain_scores_gemma":[0.99453896,0.0038774628,0.00028421078,0.0006016283,0.00028764433,0.00041007926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018112771,0.0019746413,0.003383428,0.0009609877,0.0011336079,0.0029419411,0.004525879,0.0036072105,0.013417798],"category_scores_gemma":[0.008265162,0.0010372363,0.0015501825,0.0024614283,0.0014664948,0.0057575493,0.003663136,0.0044864677,0.0016141144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091608614,0.00036614886,0.0012417396,0.00101715,0.00019141324,0.0003965664,0.0002628814,0.7636022,0.0015540571,0.12269576,0.040486164,0.06726974],"study_design_scores_gemma":[0.00027302885,0.00011119388,0.00024244629,0.00006844025,0.000052908625,0.00013108879,0.00012018501,0.85671,0.00040173886,0.13658972,0.0052785673,0.000020602607],"about_ca_topic_score_codex":0.008846042,"about_ca_topic_score_gemma":0.008046269,"teacher_disagreement_score":0.013417798,"about_ca_system_score_codex":0.004639313,"about_ca_system_score_gemma":0.0031883433,"threshold_uncertainty_score":0.044887066},"labels":[],"label_agreement":null},{"id":"W2521832422","doi":"10.23638/lmcs-13(1:1)2017","title":"Logical compactness and constraint satisfaction problems","year":2017,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compact space; Constraint satisfaction problem; Constraint (computer-aided design); Mathematics; Axiom; Hierarchy; Ultrafilter; Local consistency; Constraint satisfaction; Constraint logic programming; Discrete mathematics; Pure mathematics; Probabilistic logic; Statistics","score_opus":0.1790849006281343,"score_gpt":0.4639551405760599,"score_spread":0.2848702399479256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521832422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13032708,0.0024955187,0.8185641,0.011753775,0.00013815949,0.00020030838,0.0006006356,0.00038324454,0.035537273],"genre_scores_gemma":[0.79531676,0.0017465589,0.19284788,0.0016162074,0.000633554,0.00026448912,0.0012701182,0.00012958971,0.006174923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99081635,0.0034000503,0.000560647,0.0013779879,0.0029950931,0.00084975566],"domain_scores_gemma":[0.9390371,0.05192039,0.002743376,0.0023290678,0.002901776,0.0010683704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056901574,0.0009091014,0.0009444489,0.0022939981,0.0019045352,0.0039594877,0.0021900595,0.0019236075,0.008246223],"category_scores_gemma":[0.029569207,0.000708451,0.0020106407,0.002762887,0.0065144645,0.013833225,0.0047234483,0.005604214,0.0007238315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006339611,0.000071661154,0.0013686831,0.000292902,0.00005044613,0.00018416544,0.0004958119,0.014922796,0.0011692378,0.95938057,0.0022848747,0.01971539],"study_design_scores_gemma":[0.000022101476,0.000023661863,0.0006007939,0.00003760129,0.000012762171,0.000104520084,0.00017277949,0.03252643,0.00096765434,0.96285033,0.0026608037,0.000020573454],"about_ca_topic_score_codex":0.0018718338,"about_ca_topic_score_gemma":0.0014842496,"teacher_disagreement_score":0.008246223,"about_ca_system_score_codex":0.00291123,"about_ca_system_score_gemma":0.0012675142,"threshold_uncertainty_score":0.030092776},"labels":[],"label_agreement":null},{"id":"W2522164511","doi":"10.1007/s00373-018-1964-y","title":"Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Regina; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Line graph; Upper and lower bounds; Set (abstract data type); Line (geometry); Graph power","score_opus":0.017773008886015833,"score_gpt":0.2793316129552443,"score_spread":0.26155860406922843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522164511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80623466,0.00054071273,0.12228892,0.0010889145,0.00018526238,0.00006661544,0.0006223735,0.00076124945,0.068211325],"genre_scores_gemma":[0.9564572,0.00040921906,0.02382761,0.00017293682,0.0001563199,0.00012531044,0.0004305539,0.00019223479,0.01822858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935156,0.00009592976,0.000035610312,0.00022110913,0.00013311798,0.0001627253],"domain_scores_gemma":[0.9948619,0.0023560708,0.0006298949,0.00057332835,0.00044973733,0.0011291131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008022839,0.00055707374,0.0008462185,0.0030220842,0.002359426,0.0035333703,0.0017324763,0.0014554198,0.01685798],"category_scores_gemma":[0.004844876,0.0004608466,0.0008468222,0.0017228002,0.0036349122,0.0059946785,0.0018408779,0.0020899514,0.0013387563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099465484,0.000046266647,0.0011803823,0.00007056839,0.000009854581,0.00007028389,0.0003332228,0.0018874919,0.0032995858,0.9813519,0.0012299129,0.010421031],"study_design_scores_gemma":[0.000020058136,0.000034753404,0.001345193,0.00003453587,0.000015523217,0.00015360324,0.00020457561,0.008945306,0.0022294142,0.9837624,0.0032265396,0.000028107173],"about_ca_topic_score_codex":0.000706845,"about_ca_topic_score_gemma":0.0009386023,"teacher_disagreement_score":0.01685798,"about_ca_system_score_codex":0.0010819276,"about_ca_system_score_gemma":0.0006004955,"threshold_uncertainty_score":0.05639559},"labels":[],"label_agreement":null},{"id":"W2522691152","doi":"10.33915/etd.3559","title":"Cycles, Disjoint Spanning Trees and Orientations of Graphs","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Connectivity; Path graph; Discrete mathematics; Graph power; Vertex (graph theory); Line graph; Graph","score_opus":0.023836266989896025,"score_gpt":0.32880651674925776,"score_spread":0.3049702497593617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522691152","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6056961,0.009314441,0.20621112,0.002094777,0.0004483568,0.00028094227,0.00237113,0.0007869616,0.17279612],"genre_scores_gemma":[0.9338461,0.00360277,0.044186126,0.00039059296,0.00032038154,0.0001961279,0.0018033729,0.00011893785,0.015535545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950016,0.00008659278,0.000031191208,0.00012543928,0.00014351775,0.00011305443],"domain_scores_gemma":[0.99895704,0.00035118475,0.0002605553,0.000080853875,0.00016411561,0.00018628492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003198107,0.0005496049,0.00032588138,0.0024024027,0.0013037359,0.0019438076,0.0005833466,0.00056975416,0.003182594],"category_scores_gemma":[0.0024932246,0.0003857728,0.00035281244,0.0024648719,0.0020454233,0.0026779124,0.0013512553,0.00089634815,0.0005161684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044446137,0.000031257747,0.0013856066,0.00008106252,0.000013423382,0.00019755695,0.00054138165,0.0053180684,0.0012112834,0.96124333,0.0033319953,0.026600545],"study_design_scores_gemma":[0.000011823741,0.000018453782,0.00072695,0.000029613062,0.000010787869,0.00022232492,0.0002571725,0.0069803735,0.00054527883,0.97483677,0.016349442,0.0000109607945],"about_ca_topic_score_codex":0.0026758283,"about_ca_topic_score_gemma":0.0026206393,"teacher_disagreement_score":0.003182594,"about_ca_system_score_codex":0.0013510822,"about_ca_system_score_gemma":0.00063923554,"threshold_uncertainty_score":0.01064682},"labels":[],"label_agreement":null},{"id":"W2526410593","doi":"10.1002/jgt.20448","title":"Coloring plane graphs with independent crossings","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Disjoint sets; Vertex (graph theory); Plane (geometry); Graph; Discrete mathematics; Geometry","score_opus":0.013184250265308796,"score_gpt":0.271164064961363,"score_spread":0.25797981469605424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526410593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89452505,0.00041043718,0.07417001,0.00045049982,0.00009895654,0.000068445894,0.00045587865,0.00039912816,0.029421695],"genre_scores_gemma":[0.95707923,0.00033063485,0.03733216,0.00017807381,0.000035494184,0.000053080115,0.0005557247,0.00008919767,0.004346341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948585,0.00010257896,0.000020480195,0.00012972364,0.000102180406,0.00015912806],"domain_scores_gemma":[0.99840206,0.0005757484,0.00034826383,0.00029719068,0.00019373102,0.00018296504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026492853,0.00061644433,0.00048805945,0.0007226883,0.0009751823,0.0016760207,0.0008730757,0.00061333715,0.008488084],"category_scores_gemma":[0.0015399181,0.0004736071,0.0006728256,0.0009147871,0.0009906283,0.0014313482,0.0011028649,0.0009498196,0.00077028177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025924388,0.00056816987,0.018212805,0.00062548934,0.0003696819,0.0017957264,0.001638703,0.15540358,0.17611551,0.45179108,0.02040952,0.17047736],"study_design_scores_gemma":[0.00048423596,0.0005639901,0.0125220325,0.00015353327,0.0003473242,0.0019606396,0.0015415163,0.19777827,0.10917251,0.6174245,0.057898533,0.00015294507],"about_ca_topic_score_codex":0.0036272337,"about_ca_topic_score_gemma":0.0032897226,"teacher_disagreement_score":0.008488084,"about_ca_system_score_codex":0.000883508,"about_ca_system_score_gemma":0.0005648529,"threshold_uncertainty_score":0.028395474},"labels":[],"label_agreement":null},{"id":"W2527528646","doi":"10.5539/jmr.v8n5p101","title":"Even Star Decomposition of Complete Bipartite Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Span (engineering); Font; Life span; Art; Biology","score_opus":0.12643192132662556,"score_gpt":0.4262276552944801,"score_spread":0.2997957339678545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527528646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2577493,0.000795115,0.5846828,0.001947624,0.00040867968,0.00042738602,0.0059903804,0.0014892002,0.1465095],"genre_scores_gemma":[0.683797,0.001221542,0.18772125,0.0013248133,0.00028732215,0.00060585,0.012172004,0.001061546,0.111808725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993216,0.00018278074,0.000034840592,0.00016613484,0.00015207316,0.00014255478],"domain_scores_gemma":[0.99810034,0.00073434983,0.00018992687,0.00020722754,0.00036478986,0.00040343605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081968214,0.0010161003,0.00084931764,0.0016129898,0.0009916107,0.0024333147,0.00089918554,0.0008109435,0.020925032],"category_scores_gemma":[0.0028398104,0.0005889348,0.00096683175,0.001974442,0.0007075503,0.0025401262,0.0015888247,0.0015478028,0.0035597866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004698637,0.00021515909,0.0011457627,0.00064108754,0.000096822696,0.00038422702,0.0005351687,0.03997884,0.006955635,0.82248735,0.041686933,0.08540309],"study_design_scores_gemma":[0.000067639456,0.0000544818,0.0006464354,0.000047425066,0.00003715382,0.00016658285,0.00016840863,0.100697935,0.0014437231,0.8818393,0.014808516,0.000022418644],"about_ca_topic_score_codex":0.0021851875,"about_ca_topic_score_gemma":0.002849907,"teacher_disagreement_score":0.020925032,"about_ca_system_score_codex":0.0012503881,"about_ca_system_score_gemma":0.0010040662,"threshold_uncertainty_score":0.070001245},"labels":[],"label_agreement":null},{"id":"W2527693017","doi":"10.1002/jgt.20057","title":"Disjoint clique cutsets in graphs without long holes","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Dayton","keywords":"Combinatorics; Mathematics; Complete bipartite graph; Cograph; Split graph; Discrete mathematics; Clique graph; Disjoint sets; Block graph; Vertex (graph theory); Separable space; Clique problem; Clique-sum; Bipartite graph; Chordal graph; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.015483659464262872,"score_gpt":0.3015029554822439,"score_spread":0.286019296017981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527693017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53659534,0.00045685645,0.44037408,0.0009037239,0.00008308001,0.00036178116,0.0010145572,0.00068654295,0.019524142],"genre_scores_gemma":[0.79953945,0.0002570088,0.18976432,0.00021491754,0.000048931517,0.00020672045,0.0020807253,0.00015888306,0.007729049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992679,0.00013017579,0.00003697139,0.00020618862,0.0002116057,0.00014726714],"domain_scores_gemma":[0.9978416,0.0008909899,0.00036367506,0.00037577673,0.00028095357,0.0002470357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052874215,0.00045041132,0.00056790485,0.0012345121,0.0011695661,0.0014112332,0.0009201737,0.00077802263,0.0058092894],"category_scores_gemma":[0.003376399,0.00069433625,0.00053421553,0.0013777851,0.0011494878,0.0026927255,0.001830033,0.0009939872,0.00056993886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009941206,0.0002650373,0.0044924035,0.0004755778,0.00012316648,0.0008496529,0.0011573764,0.11257778,0.017647302,0.6835885,0.015738439,0.1620907],"study_design_scores_gemma":[0.00015204273,0.000110228975,0.0022012915,0.00006664234,0.000049961953,0.0006689612,0.00061588234,0.25558484,0.008153911,0.71607625,0.016282447,0.000037452835],"about_ca_topic_score_codex":0.0037754618,"about_ca_topic_score_gemma":0.0047151074,"teacher_disagreement_score":0.0058092894,"about_ca_system_score_codex":0.00092751934,"about_ca_system_score_gemma":0.000707985,"threshold_uncertainty_score":0.019433975},"labels":[],"label_agreement":null},{"id":"W2528053456","doi":"10.1002/jgt.10006","title":"Even‐hole‐free graphs part I: Decomposition theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Joins; Mathematics; Combinatorics; Star (game theory); Decomposition theorem; Robertson–Seymour theorem; Discrete mathematics; Graph; Decomposition; 1-planar graph; Chordal graph; Computer science; Chemistry","score_opus":0.018466310932835055,"score_gpt":0.29944446350443865,"score_spread":0.2809781525716036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528053456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12180204,0.0006207887,0.8476753,0.0005937605,0.0001819261,0.00014383758,0.0010712793,0.0013612938,0.026549742],"genre_scores_gemma":[0.75126845,0.00067507644,0.22892468,0.0007466748,0.00011667751,0.00021716703,0.0029691355,0.00057227735,0.014509844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940443,0.00006273586,0.000033259934,0.00016613421,0.00015342279,0.00018003743],"domain_scores_gemma":[0.99890816,0.00038325245,0.00011483903,0.00021851243,0.00019501272,0.00018016939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005062985,0.0007490031,0.00045101772,0.00080906134,0.00063959754,0.002034328,0.0008783609,0.00059557304,0.010765858],"category_scores_gemma":[0.0014743275,0.00047900763,0.00084492535,0.0006631062,0.0011135362,0.003094241,0.0015668762,0.0014815052,0.0023785252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003973675,0.00024098925,0.0040391027,0.0006008321,0.000095210344,0.0006596503,0.0009773454,0.024531176,0.057424653,0.70343924,0.029671125,0.17792325],"study_design_scores_gemma":[0.00007323586,0.00012875818,0.0025578495,0.000131379,0.000080008336,0.0015118091,0.0004968937,0.07233701,0.051898897,0.8226266,0.048098065,0.00005947881],"about_ca_topic_score_codex":0.0010428578,"about_ca_topic_score_gemma":0.0010615902,"teacher_disagreement_score":0.010765858,"about_ca_system_score_codex":0.00080029864,"about_ca_system_score_gemma":0.00058890675,"threshold_uncertainty_score":0.03601533},"labels":[],"label_agreement":null},{"id":"W2531764386","doi":"","title":"23rd International Workshop on Combinatorial Algorithms (IWOCA 2012)","year":2013,"lang":"en","type":"article","venue":"Murdoch Research Repository (Murdoch University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tamil; Situated; Volume (thermodynamics); Algorithm; Computer science; Library science; Geography; Mathematics; Artificial intelligence; Physics; Art","score_opus":0.042445367253699066,"score_gpt":0.30941762524805416,"score_spread":0.2669722579943551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531764386","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014814829,0.050202187,0.569117,0.021781705,0.041118976,0.00053001835,0.006224582,0.012858823,0.2833519],"genre_scores_gemma":[0.085162744,0.024439724,0.48756033,0.006249976,0.010794383,0.0010316563,0.021832803,0.012013322,0.35091516],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961189,0.0011989988,0.00020255771,0.0010250241,0.0010100347,0.00044444794],"domain_scores_gemma":[0.99501306,0.0014231625,0.0001234678,0.0019480486,0.000862702,0.00062951824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003927542,0.0024594902,0.0032678996,0.0029336265,0.0018087409,0.009856244,0.004760583,0.002913249,0.10147274],"category_scores_gemma":[0.009527821,0.0015402709,0.0032885224,0.0051684054,0.0014170045,0.006970846,0.0051873573,0.006400224,0.04170034],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003352244,0.0003133704,0.00047705104,0.00052598165,0.00010757151,0.00009339844,0.00013222806,0.0055540386,0.0011242203,0.035768703,0.49923086,0.4563374],"study_design_scores_gemma":[0.00013983375,0.000120235956,0.0013584383,0.00060496473,0.00014254019,0.00052597676,0.00020499046,0.036915038,0.0023392614,0.15764396,0.7999374,0.0000672952],"about_ca_topic_score_codex":0.003908397,"about_ca_topic_score_gemma":0.008140328,"teacher_disagreement_score":0.10147274,"about_ca_system_score_codex":0.004041224,"about_ca_system_score_gemma":0.0038806424,"threshold_uncertainty_score":0.33946013},"labels":[],"label_agreement":null},{"id":"W2544865958","doi":"10.1016/j.ejc.2019.04.001","title":"Graph homomorphisms via vector colorings","year":2019,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy; National Research Foundation Singapore","keywords":"Combinatorics; Mathematics; Bipartite graph; Homomorphism; Graph homomorphism; Graph; Discrete mathematics; Multipartite; Unit vector; Graph power; Line graph","score_opus":0.024339746574552523,"score_gpt":0.2597267797700776,"score_spread":0.23538703319552506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544865958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22679433,0.0007154838,0.6441137,0.0023890596,0.00095634407,0.00022458736,0.0006986268,0.0024553922,0.121652395],"genre_scores_gemma":[0.8409957,0.0010218705,0.093196586,0.00079293095,0.00057559926,0.00029716868,0.0006644418,0.00093915267,0.061516546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985927,0.00043838623,0.00006064659,0.00036550482,0.0002617896,0.00028108753],"domain_scores_gemma":[0.9977964,0.0010075761,0.00022141996,0.00031771074,0.0002769537,0.0003799268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094337785,0.00081319496,0.00057547877,0.0022946498,0.0013223466,0.0036665658,0.0012249803,0.0010088255,0.012087942],"category_scores_gemma":[0.0033094597,0.0007201792,0.00096137915,0.0019319041,0.0019765547,0.0056149918,0.0027566038,0.0028249947,0.0021440194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044301167,0.00005508702,0.00013272585,0.00004212871,0.000008496767,0.000043539785,0.00017119224,0.0011631267,0.0012248683,0.98076713,0.0018936462,0.014453813],"study_design_scores_gemma":[0.0000191662,0.000016873288,0.00009556953,0.0000107826445,0.000011738073,0.00008572265,0.00006809878,0.0079561295,0.00089565385,0.98628926,0.004536698,0.000014284124],"about_ca_topic_score_codex":0.0010276762,"about_ca_topic_score_gemma":0.00068417855,"teacher_disagreement_score":0.012087942,"about_ca_system_score_codex":0.0013611128,"about_ca_system_score_gemma":0.0006064239,"threshold_uncertainty_score":0.040438175},"labels":[],"label_agreement":null},{"id":"W2544933647","doi":"10.1007/978-3-319-48749-6_12","title":"Fast Searching on Complete k-partite Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Bipartite graph; Combinatorics; Computer science; Complete bipartite graph; Upper and lower bounds; Discrete mathematics; Graph; Mathematics","score_opus":0.03263267048262919,"score_gpt":0.29235206204778147,"score_spread":0.2597193915651523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544933647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30674383,0.0032792604,0.5547258,0.0016476612,0.00031808726,0.00035159755,0.0033381404,0.008439176,0.121156454],"genre_scores_gemma":[0.5246114,0.0024564015,0.40477622,0.00032799217,0.00023118345,0.00027716943,0.005353233,0.0019175427,0.06004875],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993327,0.00013175598,0.000035536603,0.00014413323,0.00020960945,0.00014624394],"domain_scores_gemma":[0.9969908,0.001853186,0.00013640156,0.00065493485,0.00023694846,0.00012757396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004360936,0.0009401293,0.0014192687,0.0016327307,0.0013540341,0.0021739698,0.0020157536,0.0012941671,0.017103625],"category_scores_gemma":[0.003904447,0.00086716755,0.0009916754,0.0041908734,0.000821946,0.0058456804,0.0023248529,0.0012030877,0.0040235957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010775902,0.00022114297,0.001273735,0.0023181385,0.00015005551,0.0003705055,0.0008265034,0.132181,0.023276089,0.20909117,0.09639577,0.53281844],"study_design_scores_gemma":[0.00017406799,0.00015535722,0.000868308,0.00012408668,0.00008449035,0.00050003163,0.00032890314,0.40458184,0.009127565,0.5650855,0.018913783,0.00005608868],"about_ca_topic_score_codex":0.002418767,"about_ca_topic_score_gemma":0.0041440018,"teacher_disagreement_score":0.017103625,"about_ca_system_score_codex":0.0009833974,"about_ca_system_score_gemma":0.0008632907,"threshold_uncertainty_score":0.0572173},"labels":[],"label_agreement":null},{"id":"W2550083616","doi":"10.1016/j.disc.2016.11.001","title":"On 2-limited packings of complete grid graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Grid; Discrete mathematics; Geometry","score_opus":0.03446265618759715,"score_gpt":0.29242364559519884,"score_spread":0.2579609894076017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550083616","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83450264,0.0008038948,0.09537469,0.0009041832,0.0001900481,0.00009066165,0.0010548511,0.0003720697,0.06670716],"genre_scores_gemma":[0.94743365,0.0006853512,0.029366612,0.0003332187,0.00018445995,0.0001548788,0.0017035605,0.00028772655,0.019850647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917537,0.00023148011,0.000046360303,0.00016089562,0.0002036922,0.00018225465],"domain_scores_gemma":[0.9969048,0.0014200425,0.00062492746,0.00038911536,0.00018017556,0.0004809385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000508376,0.0009596453,0.0014220265,0.001839962,0.0016759472,0.0031247518,0.001648906,0.0015891606,0.012185004],"category_scores_gemma":[0.004542589,0.0011686044,0.00094281445,0.0019868163,0.0021828401,0.0037645518,0.0029892996,0.0020056646,0.0012084593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007154154,0.00019749286,0.0034436637,0.0003574932,0.00006902516,0.000993346,0.0012769169,0.060660787,0.005695785,0.8897646,0.009354124,0.027471349],"study_design_scores_gemma":[0.00006165328,0.000058353176,0.0019149061,0.00006332957,0.000018008883,0.0003822804,0.00041376997,0.08812844,0.00095271616,0.9045075,0.0034759922,0.00002311372],"about_ca_topic_score_codex":0.0019006125,"about_ca_topic_score_gemma":0.002039644,"teacher_disagreement_score":0.012185004,"about_ca_system_score_codex":0.00087456184,"about_ca_system_score_gemma":0.00036155267,"threshold_uncertainty_score":0.0407629},"labels":[],"label_agreement":null},{"id":"W2550851713","doi":"10.1002/jgt.22414","title":"Generating near‐bipartite bricks","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Brick; Vertex (graph theory); Mathematics; Complete bipartite graph; Matching (statistics); Graph; Discrete mathematics; Composite material; Materials science","score_opus":0.02844527706474328,"score_gpt":0.31266091903551524,"score_spread":0.284215641970772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550851713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23451006,0.00033105083,0.71785015,0.00055092014,0.00016544414,0.0003315385,0.00045167626,0.00085802196,0.044951208],"genre_scores_gemma":[0.75436354,0.00019783733,0.21985635,0.000278378,0.000042859898,0.00028815295,0.0007814306,0.0003758897,0.023815483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937147,0.00020831387,0.000017942499,0.00012780372,0.00019551237,0.00007894022],"domain_scores_gemma":[0.99874204,0.0005601961,0.00009636487,0.00030333415,0.00020149641,0.00009663111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064321613,0.00034346056,0.00032007362,0.000827777,0.00077745155,0.0005752367,0.0007892445,0.00065138587,0.010565303],"category_scores_gemma":[0.0029058852,0.00044435897,0.00070972013,0.00043934322,0.0010221316,0.001005138,0.00226989,0.00094529387,0.0013715533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019948492,0.00013076964,0.0019832128,0.00035508213,0.000052480456,0.0005243497,0.0008355575,0.036121067,0.038409613,0.83481336,0.009353116,0.07722197],"study_design_scores_gemma":[0.00013426665,0.0002445771,0.0015604731,0.00012955914,0.000055951827,0.00069471495,0.00041328967,0.16299175,0.026143165,0.772746,0.03482872,0.000057402376],"about_ca_topic_score_codex":0.0004079434,"about_ca_topic_score_gemma":0.0008512942,"teacher_disagreement_score":0.010565303,"about_ca_system_score_codex":0.00040857578,"about_ca_system_score_gemma":0.00023871008,"threshold_uncertainty_score":0.03534448},"labels":[],"label_agreement":null},{"id":"W2552451242","doi":"10.1017/cbo9780511977152","title":"Iterative Methods in Combinatorial Optimization","year":2011,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Variety (cybernetics); Combinatorial optimization; Computer science; Mathematical optimization; Optimization problem; Theoretical computer science; Simple (philosophy); Mathematics; Algorithm; Artificial intelligence; Discrete mathematics","score_opus":0.03728163721373292,"score_gpt":0.28791957560492315,"score_spread":0.25063793839119025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552451242","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013794224,0.032127175,0.7853783,0.001744184,0.0018426437,0.000104441264,0.00017616323,0.00085622957,0.1763915],"genre_scores_gemma":[0.058889784,0.04681454,0.6958222,0.0016522243,0.0025334007,0.0006758487,0.00060525053,0.0014482958,0.19155848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983347,0.00054694596,0.00005930203,0.0001989265,0.00077773695,0.000082408915],"domain_scores_gemma":[0.9985475,0.000959741,0.00005060758,0.00020898508,0.00019094677,0.000042255593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017069328,0.0019372109,0.0013530563,0.0013014898,0.000652494,0.0027780426,0.0016379957,0.0012938245,0.015668707],"category_scores_gemma":[0.0046639782,0.0008887876,0.0015138268,0.0026046801,0.0021381064,0.0027375368,0.0020568185,0.0043170685,0.007713616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002173815,0.000042639604,0.00015143646,0.00047729118,0.00007382091,0.000065210625,0.0001708433,0.031137679,0.00078060484,0.75974405,0.058833804,0.14850087],"study_design_scores_gemma":[0.000022453287,0.000040010404,0.0001810468,0.00024333112,0.000028903107,0.00018058466,0.000058004378,0.08121164,0.0007914755,0.63318384,0.28402779,0.000030967105],"about_ca_topic_score_codex":0.0012441167,"about_ca_topic_score_gemma":0.0016220332,"teacher_disagreement_score":0.015668707,"about_ca_system_score_codex":0.0015687025,"about_ca_system_score_gemma":0.0013309916,"threshold_uncertainty_score":0.0524171},"labels":[],"label_agreement":null},{"id":"W2554213973","doi":"10.5555/3192424.3192432","title":"Tradeoffs between density and size in extracting dense subgraphs: a unified framework","year":2016,"lang":"en","type":"article","venue":"Advances in Social Networks Analysis and Mining","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Range (aeronautics); Maximization; Quadratic equation; Generalization; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.018226966470228687,"score_gpt":0.3146003937833189,"score_spread":0.2963734273130902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554213973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009290093,0.00074112957,0.9880933,0.00032564858,0.000013276688,0.0000854463,0.00006566495,0.0002617094,0.0011237988],"genre_scores_gemma":[0.18845075,0.0013974009,0.8076789,0.00021633183,0.00013086786,0.00044402212,0.00033324424,0.00029276006,0.0010556885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992082,0.0037583874,0.00040181653,0.0014103822,0.0018638426,0.0004834532],"domain_scores_gemma":[0.9770492,0.016160386,0.0012956006,0.0030071258,0.0019093074,0.0005783838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012575003,0.0019920196,0.002785251,0.0054353816,0.0016678474,0.0036492604,0.0041366466,0.002659936,0.0018149302],"category_scores_gemma":[0.041916523,0.0017675414,0.0020229388,0.0051104794,0.0034289537,0.013703444,0.006036371,0.0032141567,0.00045619585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002091615,0.00035365767,0.006584184,0.0006482337,0.00024912038,0.00024945283,0.0007515652,0.5570882,0.00850801,0.1778067,0.0050211526,0.24253058],"study_design_scores_gemma":[0.000022569775,0.00006942102,0.00093862874,0.00005786006,0.00007157872,0.00018466037,0.0001142694,0.9297129,0.0017495761,0.06527292,0.0017687296,0.000036840258],"about_ca_topic_score_codex":0.0035721022,"about_ca_topic_score_gemma":0.007163426,"teacher_disagreement_score":0.012575003,"about_ca_system_score_codex":0.002606653,"about_ca_system_score_gemma":0.0024992265,"threshold_uncertainty_score":0.06650376},"labels":[],"label_agreement":null},{"id":"W2557594551","doi":"10.1002/jgt.22102","title":"Characterizing Graphs with Crossing Number at Least 2","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Crossing number (knot theory); Mathematics; Vertex (graph theory); Disjoint sets; Graph; Discrete mathematics","score_opus":0.01596033645025523,"score_gpt":0.27684189557277383,"score_spread":0.2608815591225186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557594551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94490343,0.00039765373,0.039460145,0.00050811144,0.00008822531,0.00003929068,0.00055449945,0.00024482294,0.013803855],"genre_scores_gemma":[0.98984843,0.00015151256,0.008231871,0.0001267057,0.000057771485,0.000019977975,0.0005939027,0.000032224973,0.0009376259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946004,0.00008985291,0.000031430478,0.00021045847,0.00009141938,0.00011682908],"domain_scores_gemma":[0.99642366,0.0016062316,0.00092474034,0.00029552772,0.00037268456,0.0003771248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004538123,0.0007006076,0.0005189256,0.0022304018,0.0006791377,0.0017300583,0.0005789503,0.0009353582,0.0043097744],"category_scores_gemma":[0.0041485713,0.0003740956,0.00040069222,0.0018077476,0.0009316538,0.002035797,0.0008256028,0.00069816085,0.00040074953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014307321,0.00043638775,0.07424206,0.0009553918,0.00026313946,0.0056057484,0.0021227768,0.11751662,0.14265372,0.52812475,0.018365953,0.10828278],"study_design_scores_gemma":[0.00013615625,0.0003215415,0.024608865,0.00010908039,0.00017902914,0.0052921376,0.0014245742,0.12770604,0.02619109,0.79638976,0.017508293,0.00013348035],"about_ca_topic_score_codex":0.00034994265,"about_ca_topic_score_gemma":0.0003089669,"teacher_disagreement_score":0.0043097744,"about_ca_system_score_codex":0.000658212,"about_ca_system_score_gemma":0.0002826783,"threshold_uncertainty_score":0.014417648},"labels":[],"label_agreement":null},{"id":"W2557672902","doi":"","title":"On proper-path colorings in graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Combinatorics; Discrete mathematics; Computer science; Computer network","score_opus":0.017883129417424988,"score_gpt":0.27404983667660204,"score_spread":0.25616670725917706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557672902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4658503,0.0034140788,0.39468324,0.0077790194,0.0011453042,0.00028323094,0.0017148699,0.0008579695,0.12427204],"genre_scores_gemma":[0.86485463,0.0037815964,0.08419863,0.0018281518,0.0012990565,0.00030692105,0.0025328223,0.0007484991,0.040449776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982185,0.00058646116,0.000095491494,0.00039205202,0.00034604143,0.0003614733],"domain_scores_gemma":[0.9860234,0.009508905,0.0011163261,0.0010857035,0.0009646533,0.0013010027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020215414,0.0017810947,0.0017413119,0.003159076,0.0032326612,0.005124667,0.0030076986,0.0026407621,0.016027028],"category_scores_gemma":[0.012805935,0.001990776,0.0017687702,0.005002814,0.005135197,0.010422089,0.004281655,0.0049229823,0.0013169785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014488559,0.000092128175,0.0010589523,0.000161457,0.000022525623,0.00016248932,0.0006834248,0.010577326,0.0008041922,0.96629846,0.0070344564,0.01295966],"study_design_scores_gemma":[0.00002410034,0.000016535198,0.00026709752,0.00003095841,0.000012451723,0.00006766287,0.00013101348,0.014508587,0.00012511795,0.98292047,0.0018847993,0.000011227158],"about_ca_topic_score_codex":0.004336735,"about_ca_topic_score_gemma":0.0062928,"teacher_disagreement_score":0.016027028,"about_ca_system_score_codex":0.0034530477,"about_ca_system_score_gemma":0.0015464165,"threshold_uncertainty_score":0.05361575},"labels":[],"label_agreement":null},{"id":"W2557683753","doi":"10.55630/sjc.2013.7.115-134","title":"Programming and Testing a Two-Tree Algorithm","year":2013,"lang":"en","type":"article","venue":"Serdica Journal of Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Computer science; GRASP; Algorithm; Path (computing); Tree (set theory); Architecture; Markov chain; Theoretical computer science; Mathematics; Machine learning; Programming language","score_opus":0.020057569802886293,"score_gpt":0.29342859971696356,"score_spread":0.27337102991407725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557683753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04755821,0.00018404417,0.93268,0.0015771909,0.0001500361,0.00038412187,0.00036641664,0.0029108746,0.014189035],"genre_scores_gemma":[0.24643458,0.00009105855,0.74623245,0.0004870698,0.000092928225,0.0005106656,0.0006600715,0.00036811776,0.0051229964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99353397,0.0026557464,0.0003737542,0.0011416087,0.0015626188,0.0007321825],"domain_scores_gemma":[0.9842243,0.011853942,0.00051939406,0.001524788,0.0014572125,0.00042033588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034678485,0.0011260883,0.0008829172,0.0010086496,0.0009969505,0.0018143989,0.0028985774,0.0018041949,0.011378255],"category_scores_gemma":[0.021689465,0.0006380411,0.0015269832,0.0012727852,0.0016622032,0.0046046455,0.0025575515,0.0019593039,0.0016996857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020226487,0.001678208,0.008341537,0.00081404444,0.00020302882,0.0008927374,0.00073903817,0.18934228,0.014517144,0.2606903,0.022659441,0.49809954],"study_design_scores_gemma":[0.00036006255,0.0005430569,0.00064160064,0.000073859854,0.00005327196,0.00034887844,0.00015727959,0.75889826,0.007607402,0.22249854,0.008775074,0.000042654934],"about_ca_topic_score_codex":0.0017479789,"about_ca_topic_score_gemma":0.0017095007,"teacher_disagreement_score":0.011378255,"about_ca_system_score_codex":0.0010619325,"about_ca_system_score_gemma":0.0020179832,"threshold_uncertainty_score":0.038064063},"labels":[],"label_agreement":null},{"id":"W2558490395","doi":"10.1016/j.disc.2017.09.013","title":"Structure and algorithms for (cap, even hole)-free graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Mathematics; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.03568801725379487,"score_gpt":0.3306678270001661,"score_spread":0.2949798097463712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558490395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42379996,0.0014358931,0.50428903,0.006745918,0.0003105704,0.00041457888,0.0020211118,0.0022438345,0.05873914],"genre_scores_gemma":[0.72651654,0.0010618445,0.23117483,0.0013285874,0.00027254305,0.00037535696,0.004952593,0.0010357494,0.033281863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870074,0.0003006258,0.00006780119,0.00038639127,0.00027858096,0.00026591966],"domain_scores_gemma":[0.99014086,0.0062957495,0.0007964385,0.0015472019,0.0006205104,0.00059922657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271892,0.0011283691,0.00111144,0.0017389181,0.0029559205,0.0063825664,0.004100628,0.002607134,0.013445296],"category_scores_gemma":[0.011657141,0.0012656563,0.0014771317,0.0029863848,0.0028372083,0.011855176,0.0040230495,0.004796958,0.0020057783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006619527,0.00050181436,0.003321192,0.00056834175,0.00007755638,0.00022047576,0.0018291702,0.029740077,0.005225738,0.85136807,0.023387646,0.08309797],"study_design_scores_gemma":[0.00008540372,0.00004230921,0.00040741643,0.00004223398,0.000039455103,0.000097611344,0.00026691885,0.03370869,0.001848594,0.9593341,0.004108171,0.00001916738],"about_ca_topic_score_codex":0.0031817378,"about_ca_topic_score_gemma":0.005193158,"teacher_disagreement_score":0.013445296,"about_ca_system_score_codex":0.002739102,"about_ca_system_score_gemma":0.0021114743,"threshold_uncertainty_score":0.044978976},"labels":[],"label_agreement":null},{"id":"W2559029563","doi":"10.1016/j.dam.2017.01.022","title":"Restraints permitting the largest number of colourings","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Bipartite graph; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.029000003550814873,"score_gpt":0.3319107348315454,"score_spread":0.3029107312807305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559029563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6324516,0.0005187405,0.1966278,0.0052726814,0.0014502777,0.00056406786,0.0031536068,0.0044140145,0.1555472],"genre_scores_gemma":[0.9464671,0.0002741034,0.036487438,0.00083575334,0.0002676744,0.0003309416,0.0011099658,0.001399003,0.012828072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949868,0.0010451139,0.00039395475,0.0010078732,0.00089179986,0.0016744857],"domain_scores_gemma":[0.9506542,0.021459432,0.0021036833,0.01669255,0.003916716,0.005173415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035653724,0.0012705909,0.0022633902,0.0020436808,0.00640919,0.0048316973,0.004282706,0.0040013385,0.03010883],"category_scores_gemma":[0.032115526,0.0015490596,0.0020441087,0.002229294,0.004886099,0.0076749194,0.0054622893,0.006835975,0.0048143608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002429814,0.0006080688,0.0055542965,0.0006640953,0.00017200017,0.0011557235,0.0013666592,0.013241745,0.04277175,0.87468153,0.016897148,0.04045703],"study_design_scores_gemma":[0.00021150926,0.00016060512,0.001333136,0.00009244253,0.00009078829,0.0004521959,0.00076377625,0.015124776,0.0155588,0.95635307,0.009724523,0.00013436758],"about_ca_topic_score_codex":0.0021127095,"about_ca_topic_score_gemma":0.00381461,"teacher_disagreement_score":0.03010883,"about_ca_system_score_codex":0.0013645068,"about_ca_system_score_gemma":0.0029573867,"threshold_uncertainty_score":0.1007241},"labels":[],"label_agreement":null},{"id":"W2561228181","doi":"10.1109/focs.2016.38","title":"Structure of Protocols for XOR Functions","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Boolean function; Discrete mathematics; XOR gate; Function (biology); Mathematics; Parity (physics); Communication complexity; Entropy (arrow of time); Computational complexity theory; Computer science; Combinatorics; Theoretical computer science; Algorithm; Logic gate; Physics; Biology","score_opus":0.03665431445611443,"score_gpt":0.3531629271273651,"score_spread":0.31650861267125063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561228181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12314714,0.00058876496,0.8258627,0.002971161,0.0002173813,0.00052857393,0.0009669968,0.0011425982,0.044574693],"genre_scores_gemma":[0.8458575,0.0007993411,0.12324714,0.0008175988,0.0003741816,0.0012592863,0.0012590401,0.00035911638,0.026026817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959143,0.0011173176,0.00030503204,0.00079932384,0.001273607,0.00059041363],"domain_scores_gemma":[0.98896116,0.0061465804,0.0011235261,0.002244613,0.0010309014,0.0004932987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027278713,0.00071355794,0.0010852334,0.0017580831,0.0022004847,0.004588335,0.0020640797,0.0024244378,0.009263898],"category_scores_gemma":[0.011453104,0.0010529552,0.0013895518,0.001564984,0.0032967879,0.009884847,0.006059331,0.0045288745,0.0020117997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006575243,0.000029457728,0.000137233,0.00004436702,0.000010070037,0.00006542685,0.0001964818,0.0037379793,0.0011196616,0.9887362,0.0007734614,0.0050839013],"study_design_scores_gemma":[0.00003682864,0.00003619903,0.00008506858,0.00002038597,0.000014737349,0.000056640773,0.00003472685,0.029822746,0.0015126866,0.96560603,0.0027569137,0.000017125356],"about_ca_topic_score_codex":0.00045705857,"about_ca_topic_score_gemma":0.00042239533,"teacher_disagreement_score":0.009263898,"about_ca_system_score_codex":0.0023487213,"about_ca_system_score_gemma":0.002027417,"threshold_uncertainty_score":0.030990839},"labels":[],"label_agreement":null},{"id":"W2562647514","doi":"10.1145/3026744.3026746","title":"An improved homomorphism preservation theorem from lower bounds in circuit complexity","year":2016,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphism; Quantifier elimination; Rank (graph theory); Mathematics; Isomorphism (crystallography); Sentence; Quantifier (linguistics); Discrete mathematics; Upper and lower bounds; Function (biology); Combinatorics; Computer science","score_opus":0.06368496125477932,"score_gpt":0.30681698521299294,"score_spread":0.24313202395821362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562647514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08584034,0.0019018566,0.821829,0.0052935965,0.00041498654,0.00018552973,0.0010744721,0.0035772417,0.07988297],"genre_scores_gemma":[0.8572087,0.0011740169,0.11996261,0.0026321835,0.0012468107,0.0003536783,0.0013379324,0.001264197,0.014819756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944938,0.0009275178,0.00026166753,0.0016130629,0.0019672494,0.00073673535],"domain_scores_gemma":[0.9843329,0.010265623,0.00050714985,0.0034992357,0.0009609738,0.0004340856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033482092,0.0011983921,0.0012973679,0.0017810354,0.0013878179,0.0044775615,0.0043223808,0.0015325791,0.012184716],"category_scores_gemma":[0.016101,0.00087925344,0.0034826978,0.0019419186,0.004199268,0.018145889,0.0063724895,0.009212848,0.001525039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016293509,0.0001417235,0.0009494232,0.00035707725,0.00006215413,0.0001971934,0.00047082375,0.015756376,0.007621459,0.92869514,0.005232395,0.040353276],"study_design_scores_gemma":[0.000029182565,0.00008492065,0.0006168797,0.000028525941,0.000060992577,0.00015905182,0.000056315333,0.043335754,0.006835472,0.9417393,0.0070196036,0.00003393395],"about_ca_topic_score_codex":0.0020018544,"about_ca_topic_score_gemma":0.0018029836,"teacher_disagreement_score":0.012184716,"about_ca_system_score_codex":0.0035797956,"about_ca_system_score_gemma":0.0014818234,"threshold_uncertainty_score":0.040761888},"labels":[],"label_agreement":null},{"id":"W2565352292","doi":"10.1007/978-3-319-44543-4_27","title":"Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Cactus; Vertex (graph theory); Combinatorics; Generalization; Binary tree; Binary number; Tree (set theory); Mathematics; Computer science; Time complexity; Algorithm; Class (philosophy); Discrete mathematics; Graph; Artificial intelligence; Arithmetic","score_opus":0.027257716468281526,"score_gpt":0.2906350169032979,"score_spread":0.2633773004350164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565352292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15462236,0.0025825237,0.7817252,0.0016698022,0.00050791836,0.00030038945,0.0013748892,0.002950156,0.05426672],"genre_scores_gemma":[0.41203836,0.0018702457,0.5535218,0.0004975212,0.0005169521,0.00037704463,0.0036006053,0.0012475856,0.026329782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874866,0.00022562139,0.000064703534,0.00040733124,0.0002883747,0.0002653753],"domain_scores_gemma":[0.9959843,0.0023032697,0.00023974266,0.0009070688,0.00030175323,0.00026397005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010568292,0.0014273076,0.0015719113,0.0016963806,0.0015801348,0.0035645564,0.004678624,0.0018328488,0.015329642],"category_scores_gemma":[0.007221097,0.0013262964,0.001704781,0.0033610081,0.001461574,0.007531332,0.002555426,0.0036160152,0.0019696523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006167151,0.00048645106,0.0020581163,0.0010150705,0.000183275,0.00015782178,0.0007329822,0.08495093,0.0054836506,0.49815375,0.042999625,0.36316162],"study_design_scores_gemma":[0.00009582153,0.000037528403,0.00042737293,0.00005449774,0.00006346258,0.00013440115,0.00013264065,0.23114596,0.0014944505,0.7583695,0.0080219405,0.000022417611],"about_ca_topic_score_codex":0.0040084748,"about_ca_topic_score_gemma":0.0077137114,"teacher_disagreement_score":0.015329642,"about_ca_system_score_codex":0.003284536,"about_ca_system_score_gemma":0.0017246724,"threshold_uncertainty_score":0.051282704},"labels":[],"label_agreement":null},{"id":"W2568140225","doi":"10.1016/j.jctb.2012.11.002","title":"Flow-cut gaps for integer and fractional multiflows","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Integer (computer science); Flow (mathematics); Maximum flow problem; Integer programming; Graph; Discrete mathematics; Planar graph; Mathematical optimization; Computer science; Geometry","score_opus":0.01700801821673222,"score_gpt":0.29596328350016127,"score_spread":0.27895526528342907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568140225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85594475,0.00078852,0.08972486,0.0016040186,0.00024149647,0.000047586273,0.00051124755,0.00045982515,0.050677616],"genre_scores_gemma":[0.9744567,0.00023028911,0.018316466,0.00019206943,0.000113036556,0.000042826574,0.00034403364,0.000112418194,0.0061921333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935704,0.000077696575,0.000031417203,0.0001377082,0.00016010698,0.00023602687],"domain_scores_gemma":[0.99683255,0.0016589253,0.00038715318,0.0002203485,0.0002469015,0.00065407384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010736116,0.00063814415,0.0010722026,0.0028596297,0.0024086998,0.0033123267,0.0015019487,0.0019319823,0.011362631],"category_scores_gemma":[0.0068748905,0.0005065932,0.0007070609,0.0011872376,0.001966708,0.0057006157,0.0023418653,0.0027224866,0.0005430171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016327247,0.000093422466,0.00064725644,0.00007338473,0.0000076029646,0.00013110068,0.00027977512,0.005223673,0.001351209,0.9819271,0.0017202705,0.008382015],"study_design_scores_gemma":[0.000023656652,0.000024179208,0.0004270225,0.000030274174,0.000008452683,0.00011967778,0.00022750566,0.02718948,0.00082,0.9694744,0.0016402778,0.000015096643],"about_ca_topic_score_codex":0.0011886253,"about_ca_topic_score_gemma":0.0011465822,"teacher_disagreement_score":0.011362631,"about_ca_system_score_codex":0.0019303123,"about_ca_system_score_gemma":0.0005774865,"threshold_uncertainty_score":0.03801185},"labels":[],"label_agreement":null},{"id":"W2571724965","doi":"","title":"Paired-domination in claw-free graphs with minimum degree at least four.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Degree (music); Combinatorics; Biology; Physics","score_opus":0.028184767203854506,"score_gpt":0.2531364262116594,"score_spread":0.22495165900780487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571724965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86246705,0.00073250907,0.06586576,0.0015770682,0.00011830297,0.00015042894,0.0012059736,0.00048373133,0.067399174],"genre_scores_gemma":[0.9615825,0.00031314453,0.017724426,0.00031149414,0.000058938866,0.000101914375,0.0010925654,0.000092473056,0.018722603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994394,0.000112808695,0.000028033375,0.00013743875,0.00010997638,0.00017238977],"domain_scores_gemma":[0.9965894,0.0017707226,0.00051061163,0.0002869661,0.0002987486,0.00054355216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042288424,0.0004218364,0.00051393517,0.0014100967,0.0018326158,0.001765956,0.0014084124,0.0011100158,0.009796837],"category_scores_gemma":[0.0036777577,0.0005834956,0.0004978924,0.0012231814,0.0012237448,0.0030240242,0.0018561939,0.0012595664,0.0012742068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010573036,0.00048060634,0.0140567785,0.00088177697,0.00022874749,0.0031835726,0.002411864,0.023484074,0.037649464,0.78535444,0.024395596,0.106815696],"study_design_scores_gemma":[0.00019174803,0.00015105419,0.004888435,0.00018546276,0.00015664277,0.0024440365,0.0014597155,0.048859786,0.017429931,0.9022079,0.02195785,0.0000675169],"about_ca_topic_score_codex":0.0018000588,"about_ca_topic_score_gemma":0.0035868695,"teacher_disagreement_score":0.009796837,"about_ca_system_score_codex":0.0007582346,"about_ca_system_score_gemma":0.0007565067,"threshold_uncertainty_score":0.032773674},"labels":[],"label_agreement":null},{"id":"W2571725614","doi":"","title":"On the 2-rainbow bondage number of planar graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Planar graph; Combinatorics; Rainbow; Graph; Computer graphics (images); Computer science; Optics; Physics","score_opus":0.015961758262073477,"score_gpt":0.27647453151757984,"score_spread":0.26051277325550637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571725614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63294584,0.0044262903,0.08294675,0.005730048,0.0015578247,0.0001069346,0.0012090544,0.0005627373,0.27051455],"genre_scores_gemma":[0.9672638,0.0017302525,0.01256644,0.00037089156,0.0006300768,0.000114595576,0.00039461735,0.00017060855,0.016758705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922717,0.00018876833,0.000033503155,0.0001737114,0.00021522482,0.00016163003],"domain_scores_gemma":[0.9959209,0.0023426602,0.00065715786,0.0002803649,0.00024706437,0.0005518788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010779939,0.0006574788,0.0008191156,0.0032126354,0.0019292305,0.0025262847,0.0017513251,0.0017888704,0.017526202],"category_scores_gemma":[0.0073683294,0.00047879812,0.0004926191,0.0021528464,0.0030754441,0.00721494,0.0024372172,0.0024581568,0.0020635377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028288286,0.000057046735,0.0013224685,0.00019098252,0.000024560404,0.00011302819,0.00027113457,0.008027116,0.0023465448,0.9570859,0.009171586,0.02110668],"study_design_scores_gemma":[0.00003557808,0.00004451015,0.0011134385,0.000060055903,0.000021131787,0.00015532043,0.00014682335,0.015337408,0.0011309974,0.97627,0.0056492626,0.000035374338],"about_ca_topic_score_codex":0.0009818703,"about_ca_topic_score_gemma":0.0014192638,"teacher_disagreement_score":0.017526202,"about_ca_system_score_codex":0.0014566982,"about_ca_system_score_gemma":0.00056297117,"threshold_uncertainty_score":0.058631003},"labels":[],"label_agreement":null},{"id":"W2572445898","doi":"","title":"On independent domination critical graphs and k-factor critical.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factor (programming language); Combinatorics; Discrete mathematics; Computer science","score_opus":0.017014493474890476,"score_gpt":0.3097578847512327,"score_spread":0.29274339127634225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572445898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42823464,0.0076739904,0.17330633,0.005196056,0.0006397853,0.0001464391,0.0009720572,0.00052731123,0.38330334],"genre_scores_gemma":[0.95176667,0.0025643653,0.013501933,0.0006834401,0.0005099239,0.00006870514,0.0005227139,0.00014954779,0.030232782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996164,0.00009198547,0.000014715907,0.0000845854,0.00008211154,0.00011021226],"domain_scores_gemma":[0.9973902,0.0015231126,0.0002652619,0.00020025979,0.00028355097,0.00033758295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004993863,0.00059342105,0.0005317017,0.0029818097,0.0017698574,0.0016016694,0.00075269875,0.0008867486,0.010741084],"category_scores_gemma":[0.003803336,0.00039604795,0.0005170908,0.0019829888,0.0030572265,0.0043146387,0.0015225122,0.0015957381,0.0012598387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047795937,0.00001818338,0.0005764202,0.00008335418,0.000012043126,0.00016789965,0.00032818338,0.0017648502,0.00097063434,0.982797,0.005273643,0.007959934],"study_design_scores_gemma":[0.0000108854865,0.000007372523,0.00032679515,0.000030050978,0.000009973569,0.00019056449,0.0001643328,0.0029080638,0.00034257278,0.990818,0.005183013,0.000008483554],"about_ca_topic_score_codex":0.0020638176,"about_ca_topic_score_gemma":0.0023855395,"teacher_disagreement_score":0.010741084,"about_ca_system_score_codex":0.0015403528,"about_ca_system_score_gemma":0.00049638667,"threshold_uncertainty_score":0.03593248},"labels":[],"label_agreement":null},{"id":"W2572626022","doi":"","title":"Critical Hamiltonian Connected Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Pure mathematics; Mathematical optimization","score_opus":0.016508396975828617,"score_gpt":0.29168138779847747,"score_spread":0.27517299082264884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572626022","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39731675,0.004400895,0.056187894,0.0049896906,0.0009343352,0.00015889855,0.001027175,0.0004093429,0.534575],"genre_scores_gemma":[0.94858015,0.0009651061,0.005994793,0.0007085735,0.0002558061,0.000069541304,0.0005546546,0.000082234656,0.04278921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986184,0.000033034317,0.0000041568546,0.000029076522,0.00003583305,0.000035994228],"domain_scores_gemma":[0.99928683,0.00024247503,0.00010815679,0.000063106614,0.00010374332,0.0001956538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018947497,0.0003708298,0.00025252285,0.0017471112,0.001005278,0.0009976608,0.00047500027,0.0007456949,0.017078536],"category_scores_gemma":[0.0015771165,0.00022381378,0.0001984476,0.00062942045,0.0010607126,0.0015423797,0.0011117354,0.0008946698,0.0010847067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028584524,0.0000150449405,0.0003560487,0.000067376925,0.000008648122,0.00018882798,0.00014063288,0.0005169468,0.0014024283,0.9807355,0.00955311,0.006986796],"study_design_scores_gemma":[0.000024063242,0.000010616203,0.00064858765,0.00003659722,0.000012639653,0.00036323862,0.00021741682,0.0033981376,0.00090397627,0.97997737,0.014400296,0.0000070870797],"about_ca_topic_score_codex":0.00073911034,"about_ca_topic_score_gemma":0.0014356053,"teacher_disagreement_score":0.017078536,"about_ca_system_score_codex":0.00069569476,"about_ca_system_score_gemma":0.0003091163,"threshold_uncertainty_score":0.057133436},"labels":[],"label_agreement":null},{"id":"W2572745867","doi":"","title":"On total domination number of Cartesian product of directed cycles.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Arithmetic; Combinatorics; Geometry","score_opus":0.009828459400459243,"score_gpt":0.2770102242897745,"score_spread":0.2671817648893153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572745867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83115655,0.0033131503,0.09129469,0.001052775,0.00019039171,0.000089052526,0.0023918955,0.0003307236,0.07018066],"genre_scores_gemma":[0.9791535,0.0011566237,0.012603286,0.00010735656,0.00012956097,0.00010433097,0.0008711324,0.000104576226,0.0057695555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876344,0.000324193,0.00007195248,0.00031561393,0.00030239412,0.0002224948],"domain_scores_gemma":[0.98715186,0.009122368,0.00095353695,0.0009031368,0.00093139807,0.000937726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013401335,0.00051174255,0.00089685176,0.0030714672,0.001244503,0.0026281506,0.0015755667,0.0006854201,0.00986127],"category_scores_gemma":[0.009920051,0.00043840735,0.00054023246,0.0024739231,0.0016321323,0.0042969063,0.001300239,0.0011836721,0.00062198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009258604,0.00013119714,0.019214036,0.00092627463,0.00022461322,0.0004032154,0.0012348574,0.041940387,0.010902475,0.8305256,0.01688676,0.07668475],"study_design_scores_gemma":[0.00009665617,0.0001820785,0.009088468,0.00017765892,0.00023080932,0.0012968652,0.0006060694,0.11657616,0.0069133956,0.8492071,0.0155528635,0.000071798764],"about_ca_topic_score_codex":0.0013280988,"about_ca_topic_score_gemma":0.0016457142,"teacher_disagreement_score":0.00986127,"about_ca_system_score_codex":0.0015078405,"about_ca_system_score_gemma":0.0007345176,"threshold_uncertainty_score":0.032989204},"labels":[],"label_agreement":null},{"id":"W2573172438","doi":"","title":"Implicit degree condition for hamiltonicity of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Discrete mathematics; Physics","score_opus":0.029337958254696428,"score_gpt":0.30411784511476975,"score_spread":0.2747798868600733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573172438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4949961,0.0010370521,0.19800276,0.0043862415,0.00077712705,0.00019298523,0.0021438042,0.00047524172,0.29798862],"genre_scores_gemma":[0.97044486,0.00039190013,0.010194055,0.0003394927,0.00030510186,0.00009699191,0.00075777934,0.00009138698,0.01737836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930346,0.00013610108,0.0000432786,0.00013921813,0.00022799597,0.00014994624],"domain_scores_gemma":[0.99581015,0.0024014313,0.0003089853,0.0005156,0.0006013474,0.00036249345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005966094,0.00033771145,0.0004833153,0.000987061,0.0012096,0.0017306053,0.0010568086,0.0013728138,0.016089182],"category_scores_gemma":[0.008019569,0.00041745044,0.00044208192,0.0008294948,0.001995834,0.006141045,0.0016634713,0.002529116,0.0015925112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007923616,0.000038846625,0.0006930135,0.000077979144,0.0000071818267,0.00014458704,0.00024487893,0.001026506,0.002688307,0.986891,0.002714523,0.0053939684],"study_design_scores_gemma":[0.00005076443,0.00002526447,0.0007987748,0.00002835951,0.0000125536635,0.0002329845,0.00015188304,0.0073544458,0.0019555555,0.98414314,0.0052277907,0.000018553783],"about_ca_topic_score_codex":0.0013222301,"about_ca_topic_score_gemma":0.0024073161,"teacher_disagreement_score":0.016089182,"about_ca_system_score_codex":0.00093299244,"about_ca_system_score_gemma":0.0007903599,"threshold_uncertainty_score":0.05382365},"labels":[],"label_agreement":null},{"id":"W2573503267","doi":"","title":"Total Domination in generalized θ graphs and ladder graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Combinatorics; Indifference graph; Graph","score_opus":0.012360631949996733,"score_gpt":0.2662108344896399,"score_spread":0.25385020253964313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573503267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72759736,0.0016379909,0.1288928,0.0015881662,0.00011690625,0.00005726705,0.0005728658,0.00038987707,0.13914679],"genre_scores_gemma":[0.97391033,0.0006475768,0.0068582245,0.0002266418,0.000058710186,0.000044573633,0.00023865546,0.000066460394,0.017948778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946517,0.0001609535,0.00002207675,0.00009903733,0.00011440097,0.00013838506],"domain_scores_gemma":[0.9966754,0.0019093415,0.00041142604,0.00034378358,0.0003041919,0.00035590254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006202579,0.00029244152,0.00037306335,0.001239349,0.001122716,0.0020435718,0.0007717424,0.0005129627,0.0075359666],"category_scores_gemma":[0.003590029,0.00033272797,0.00047025565,0.0014195924,0.0014921728,0.0030336226,0.0012147931,0.0008796481,0.0005610676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056858455,0.000018770968,0.0017411741,0.00008815291,0.00002551109,0.00020215924,0.00050330773,0.0027151962,0.001967358,0.9763579,0.0028042444,0.01351943],"study_design_scores_gemma":[0.000022040547,0.000011794846,0.0010725348,0.000031687367,0.000028848732,0.0003515068,0.0003328101,0.010096564,0.00089901633,0.98140955,0.005731716,0.000011869839],"about_ca_topic_score_codex":0.0021507312,"about_ca_topic_score_gemma":0.0034793762,"teacher_disagreement_score":0.0075359666,"about_ca_system_score_codex":0.000960751,"about_ca_system_score_gemma":0.0004972803,"threshold_uncertainty_score":0.025210321},"labels":[],"label_agreement":null},{"id":"W2573525493","doi":"","title":"Upper bound on the diameter of a total domination vertex critical graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Upper and lower bounds; Graph; Mathematical analysis","score_opus":0.016297136367318665,"score_gpt":0.28457141688818155,"score_spread":0.2682742805208629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573525493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35133684,0.017672433,0.29930395,0.009125399,0.0014743911,0.00028497644,0.0059371283,0.0024067096,0.31245822],"genre_scores_gemma":[0.9200442,0.0052174595,0.049664546,0.0011683746,0.001125526,0.0002883448,0.0019632182,0.000523269,0.020005042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909127,0.0001397504,0.000031974498,0.00021827691,0.00025619424,0.00026259935],"domain_scores_gemma":[0.9863063,0.009955593,0.0005380678,0.000840504,0.0009081414,0.0014513704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011838306,0.0013815094,0.0015003628,0.0032499724,0.0018534863,0.0031615666,0.002210504,0.0012699686,0.011644101],"category_scores_gemma":[0.010777356,0.00061956374,0.0008010471,0.0016847445,0.001845937,0.0035573635,0.003045237,0.002559703,0.0017461452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011056159,0.0002385675,0.0059335553,0.0014337276,0.00028191105,0.0008057115,0.0009878592,0.05534196,0.044906292,0.75923806,0.06821394,0.061512746],"study_design_scores_gemma":[0.00011235667,0.00022524962,0.006073973,0.000375883,0.00032117235,0.0018263785,0.00041875037,0.166524,0.01531904,0.75837004,0.05034265,0.00009042079],"about_ca_topic_score_codex":0.00148604,"about_ca_topic_score_gemma":0.0025275382,"teacher_disagreement_score":0.011644101,"about_ca_system_score_codex":0.0022522416,"about_ca_system_score_gemma":0.0008555207,"threshold_uncertainty_score":0.038953364},"labels":[],"label_agreement":null},{"id":"W2573740254","doi":"","title":"Neighbourly regular strength of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.012490780127481652,"score_gpt":0.2589532010007833,"score_spread":0.24646242087330164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573740254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55585104,0.00082178164,0.16892958,0.0027840084,0.0008858038,0.00015547637,0.0012782473,0.0006301545,0.26866388],"genre_scores_gemma":[0.9317758,0.000500691,0.028131742,0.00055921846,0.0003539883,0.00009345014,0.00061247806,0.00021119995,0.037761368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990471,0.00023003237,0.000047153753,0.00023356306,0.00030786783,0.00013420946],"domain_scores_gemma":[0.99551857,0.0015856893,0.0006351276,0.0006402567,0.0007126136,0.0009076179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008442545,0.00048587943,0.0007223877,0.0019223783,0.0013378991,0.002110695,0.001238484,0.0012118472,0.015236968],"category_scores_gemma":[0.0055394894,0.0005025151,0.0006707662,0.0009801222,0.0020901442,0.0032677895,0.0021699641,0.0018200835,0.0026521422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012895447,0.00003955092,0.0009177076,0.00013153549,0.000042758704,0.00041816029,0.00026500318,0.0011052599,0.008327832,0.97440547,0.0032671406,0.010950686],"study_design_scores_gemma":[0.000039145398,0.00007559222,0.0012746454,0.000046474917,0.00005605683,0.0011631657,0.00032073533,0.00733689,0.0036168497,0.97315854,0.0128810825,0.00003080585],"about_ca_topic_score_codex":0.00060461543,"about_ca_topic_score_gemma":0.00090894295,"teacher_disagreement_score":0.015236968,"about_ca_system_score_codex":0.0005590959,"about_ca_system_score_gemma":0.0003967204,"threshold_uncertainty_score":0.05097276},"labels":[],"label_agreement":null},{"id":"W2573798597","doi":"","title":"Equitable and List Equitable Colorings of Graphs with Bounded Maximum Average Degree.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bounded function; Degree (music); Combinatorics; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.023622399493169022,"score_gpt":0.2620874077055633,"score_spread":0.2384650082123943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573798597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44404945,0.0010485821,0.45840153,0.003225543,0.0003637991,0.00021030675,0.0026295253,0.0016047338,0.08846639],"genre_scores_gemma":[0.89132434,0.000634085,0.07768168,0.0007254432,0.00026130502,0.00022318888,0.0016931476,0.00071260694,0.026744297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824405,0.00061144773,0.00008865501,0.00031876427,0.0002924618,0.00044463325],"domain_scores_gemma":[0.98457587,0.007935914,0.0015644607,0.0028495605,0.0016389497,0.0014352218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015885034,0.0007792647,0.00074530666,0.001508445,0.0022750867,0.002869435,0.0023893474,0.0012013487,0.01467764],"category_scores_gemma":[0.015107958,0.0008055327,0.0006318047,0.002045067,0.0014705657,0.0058566537,0.002350645,0.0020205826,0.0015207322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007716461,0.00027486656,0.0026693929,0.00036110549,0.00006465231,0.0003632528,0.00084787793,0.053457685,0.007069566,0.85814756,0.018753564,0.057218723],"study_design_scores_gemma":[0.000074605196,0.00006656737,0.00091216865,0.0000624307,0.000046618,0.00030156664,0.0003404262,0.097254515,0.0030544985,0.8881727,0.009681123,0.000032779782],"about_ca_topic_score_codex":0.0021963469,"about_ca_topic_score_gemma":0.004766155,"teacher_disagreement_score":0.01467764,"about_ca_system_score_codex":0.002073051,"about_ca_system_score_gemma":0.0011994359,"threshold_uncertainty_score":0.04910159},"labels":[],"label_agreement":null},{"id":"W2573856633","doi":"","title":"Resistance Distance of Three Classes of Join Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Combinatorics","score_opus":0.018444873667050863,"score_gpt":0.26835553325632894,"score_spread":0.24991065958927808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573856633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7936353,0.00075774745,0.07179098,0.0020786144,0.00015367172,0.00011034054,0.001302016,0.000840324,0.12933104],"genre_scores_gemma":[0.973258,0.00031215884,0.011198049,0.00028788863,0.00010809259,0.00007442426,0.0012944511,0.00014989733,0.013317005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985367,0.0002582696,0.000071270166,0.00036195322,0.00046177718,0.0003100299],"domain_scores_gemma":[0.99329245,0.0030800444,0.0011487342,0.0007778616,0.0004541008,0.001246831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010820713,0.00053850893,0.00067361793,0.0027099124,0.0019451132,0.00472222,0.0017292539,0.0022363544,0.015595963],"category_scores_gemma":[0.0071475413,0.00042373122,0.0008030097,0.0014064548,0.002116095,0.0040747155,0.0020099452,0.0022166774,0.0019651272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025219528,0.00009815257,0.0028534594,0.00008968209,0.000033044093,0.00016783368,0.00059390947,0.003160006,0.0038227541,0.96923816,0.004976543,0.014714253],"study_design_scores_gemma":[0.00010831188,0.00017900544,0.005905839,0.00007684733,0.000090464826,0.0012266539,0.0010209271,0.031256925,0.0053611244,0.9338352,0.020865481,0.000073230476],"about_ca_topic_score_codex":0.0009900017,"about_ca_topic_score_gemma":0.00091246545,"teacher_disagreement_score":0.015595963,"about_ca_system_score_codex":0.0015267913,"about_ca_system_score_gemma":0.0005050198,"threshold_uncertainty_score":0.052173734},"labels":[],"label_agreement":null},{"id":"W2574512124","doi":"","title":"Forbidden subgraph conditions for Hamilton cycles in implicit claw-heavy graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Induced subgraph isomorphism problem; Combinatorics; Biology; Graph; Line graph","score_opus":0.02018336651925866,"score_gpt":0.3056736585531554,"score_spread":0.28549029203389675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574512124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6653872,0.00058470946,0.18530537,0.0017013306,0.00043164808,0.0006707759,0.0038515823,0.0011650615,0.14090225],"genre_scores_gemma":[0.95851773,0.0002603191,0.026045006,0.00036082734,0.00015045854,0.00026123802,0.0027801737,0.00019507526,0.011429037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991678,0.00015829713,0.00005664166,0.00014399736,0.00025819088,0.00021496609],"domain_scores_gemma":[0.99545985,0.0027064339,0.00047461427,0.00032489243,0.0006060952,0.0004280784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006430372,0.0004790668,0.0005693329,0.0017374486,0.0014112667,0.0018857152,0.0012549476,0.001443369,0.014792035],"category_scores_gemma":[0.006571645,0.000509331,0.000602593,0.0012010038,0.0015494211,0.003239298,0.0014446396,0.0018785488,0.0013497685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047038918,0.00021345784,0.0029766166,0.00035725208,0.000047474332,0.0011874742,0.0007459269,0.009756428,0.013800821,0.93789583,0.010054986,0.022493273],"study_design_scores_gemma":[0.00011830974,0.00005759164,0.0011452072,0.0000630874,0.000035844303,0.00043216432,0.0005491692,0.027180558,0.006449835,0.958459,0.005466968,0.000042245876],"about_ca_topic_score_codex":0.0030327055,"about_ca_topic_score_gemma":0.0058044638,"teacher_disagreement_score":0.014792035,"about_ca_system_score_codex":0.0011453306,"about_ca_system_score_gemma":0.0011571258,"threshold_uncertainty_score":0.049484253},"labels":[],"label_agreement":null},{"id":"W2574604220","doi":"10.1002/jgt.22169","title":"Grünbaum colorings of even triangulations on surfaces","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Exploratory Research for Advanced Technology; Japan Science and Technology Agency; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Klein bottle; Mathematics; Combinatorics; Triangulation; Torus; Surface (topology); Point set triangulation; Projective plane; Boundary (topology); Plane (geometry); Geometry; Delaunay triangulation; Mathematical analysis","score_opus":0.03733898809966781,"score_gpt":0.33191517968683176,"score_spread":0.29457619158716397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574604220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9142917,0.00017432569,0.066884875,0.00020545228,0.000103069055,0.00002294966,0.00012434517,0.00022580837,0.017967427],"genre_scores_gemma":[0.9765787,0.00009753518,0.019007506,0.000057660076,0.000030233552,0.000026387983,0.00013327054,0.00006977388,0.003998902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994344,0.00013168222,0.00002976749,0.00011073769,0.000115082665,0.00017830134],"domain_scores_gemma":[0.99834824,0.0006279858,0.00022824664,0.00036239222,0.00021600275,0.00021713394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039236012,0.00033391739,0.0003498199,0.00076178665,0.0012478759,0.0011067673,0.0004612221,0.00056127354,0.0043915086],"category_scores_gemma":[0.002274485,0.00034251442,0.0005762582,0.000513823,0.001420071,0.0016496982,0.0012901685,0.00083461375,0.0004150067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028224604,0.000070992486,0.009167912,0.00010513684,0.000028859436,0.00076519145,0.0012790889,0.023347605,0.029278832,0.90808237,0.0024312213,0.02516042],"study_design_scores_gemma":[0.000039046052,0.00015644063,0.005007731,0.000053765183,0.000034171288,0.00071174646,0.001119485,0.06051645,0.014903041,0.90511036,0.012291532,0.00005612796],"about_ca_topic_score_codex":0.0011048244,"about_ca_topic_score_gemma":0.0017974227,"teacher_disagreement_score":0.0043915086,"about_ca_system_score_codex":0.0008033583,"about_ca_system_score_gemma":0.00030232215,"threshold_uncertainty_score":0.014691114},"labels":[],"label_agreement":null},{"id":"W2574740122","doi":"","title":"Two-Distance-Transitve Graphs Of Valency 7.","year":2016,"lang":"sl","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Valency; Mathematics; Combinatorics; Linguistics; Philosophy","score_opus":0.015891366817252495,"score_gpt":0.28257321282705694,"score_spread":0.26668184600980444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574740122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59914637,0.0006023704,0.12104473,0.0029298554,0.0003357172,0.00019198588,0.004229135,0.0008481759,0.2706717],"genre_scores_gemma":[0.9051807,0.00032566383,0.037539013,0.0005044675,0.000082401195,0.00009850617,0.0033798283,0.00019247673,0.052696947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939275,0.00011787204,0.000033744538,0.00015846192,0.00016168071,0.00013553708],"domain_scores_gemma":[0.9976399,0.0008386704,0.00029413143,0.00034582306,0.00045188476,0.00042955606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046152336,0.0006127493,0.00048335214,0.0016320569,0.0019408006,0.002578096,0.0013243834,0.001212459,0.017296154],"category_scores_gemma":[0.002568882,0.00046974065,0.0005753603,0.0015419452,0.0016409172,0.003049951,0.0017980728,0.0019705044,0.003186219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027462997,0.00010690528,0.0013521424,0.00015975059,0.000043386106,0.0005678869,0.0006174798,0.0014604998,0.0066897487,0.96493804,0.007330381,0.016459182],"study_design_scores_gemma":[0.000059106547,0.000054383418,0.0014308031,0.00005838263,0.000046100413,0.00084901444,0.00063428987,0.00499755,0.0047744517,0.95845234,0.02861585,0.000027690323],"about_ca_topic_score_codex":0.0014568508,"about_ca_topic_score_gemma":0.0026605355,"teacher_disagreement_score":0.017296154,"about_ca_system_score_codex":0.0011288443,"about_ca_system_score_gemma":0.0005897369,"threshold_uncertainty_score":0.057861447},"labels":[],"label_agreement":null},{"id":"W2575008982","doi":"","title":"A new version for Co-PI Iindex of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pi; Graph; Combinatorics; Geometry","score_opus":0.018288781800409767,"score_gpt":0.2950765841365649,"score_spread":0.27678780233615513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575008982","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111805145,0.0021148063,0.5514654,0.0034787182,0.016300475,0.00038773555,0.007076135,0.00988349,0.3981127],"genre_scores_gemma":[0.17729819,0.0026689714,0.37377903,0.0044368906,0.004100218,0.0011937226,0.013392678,0.009565851,0.41356453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986633,0.0002145099,0.00010871071,0.00050141354,0.00034325724,0.00016881611],"domain_scores_gemma":[0.998642,0.0002518643,0.00007124581,0.00057075435,0.000342671,0.00012155504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086789863,0.001181481,0.000859925,0.0024685652,0.002469224,0.003792122,0.0019055614,0.0013872881,0.071076505],"category_scores_gemma":[0.0027409159,0.0007666631,0.0014420074,0.002651484,0.0019814218,0.008306594,0.0034019528,0.004131154,0.022535916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015871722,0.00007248512,0.0005135058,0.00034820838,0.000044846103,0.0005946928,0.00051668845,0.000610275,0.0030445484,0.78302646,0.1262441,0.08482544],"study_design_scores_gemma":[0.000023106211,0.00003958569,0.00047728862,0.000073508745,0.00003645435,0.0011648067,0.00014029036,0.0023453983,0.0022598235,0.29601902,0.6973741,0.000046591507],"about_ca_topic_score_codex":0.0019530384,"about_ca_topic_score_gemma":0.0026482719,"teacher_disagreement_score":0.071076505,"about_ca_system_score_codex":0.0010648982,"about_ca_system_score_gemma":0.00080057245,"threshold_uncertainty_score":0.23777461},"labels":[],"label_agreement":null},{"id":"W2575159521","doi":"","title":"Star coloring of Cartesian product of paths and cycles.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Star (game theory); Cartesian coordinate system; Product (mathematics); Pure mathematics; Combinatorics; Geometry; Mathematical analysis","score_opus":0.014895824934223171,"score_gpt":0.26191021000611775,"score_spread":0.24701438507189458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575159521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36351416,0.0017120154,0.4640074,0.0011133881,0.0007654588,0.00013560585,0.0015515547,0.0014806809,0.16571973],"genre_scores_gemma":[0.81811255,0.0009738145,0.12090087,0.00035070512,0.00021979699,0.00009762022,0.0014526304,0.00048192672,0.057409983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993624,0.00018481468,0.000035224934,0.00018102462,0.00011449257,0.00012205164],"domain_scores_gemma":[0.99815035,0.00065326545,0.00019905086,0.00034680738,0.00040350243,0.0002470139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050284766,0.00044958515,0.0004888936,0.00093858136,0.0011016845,0.0016926732,0.00063000264,0.0005529085,0.01195111],"category_scores_gemma":[0.00217862,0.00055155944,0.0006512617,0.001352919,0.0014323968,0.002743979,0.0016268573,0.0010887297,0.0020113068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013180799,0.000035750265,0.0009693101,0.00013013356,0.000021406539,0.00023709719,0.00040755494,0.0031076118,0.0031586394,0.9623602,0.00891679,0.020523652],"study_design_scores_gemma":[0.00002822403,0.00006767778,0.0007971719,0.000041752573,0.000035510522,0.0006232169,0.00025118262,0.016170867,0.0035858986,0.94497085,0.033404335,0.00002343635],"about_ca_topic_score_codex":0.0022620556,"about_ca_topic_score_gemma":0.0030983593,"teacher_disagreement_score":0.01195111,"about_ca_system_score_codex":0.0007558953,"about_ca_system_score_gemma":0.000775483,"threshold_uncertainty_score":0.03998047},"labels":[],"label_agreement":null},{"id":"W2575188506","doi":"","title":"On the signed star domination numbers of trees.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Combinatorics; Mathematical analysis","score_opus":0.014020620469574039,"score_gpt":0.26280127864075636,"score_spread":0.24878065817118233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575188506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4460817,0.0040321434,0.23295279,0.0039288667,0.0011920091,0.0001002944,0.0011763579,0.00045391085,0.31008193],"genre_scores_gemma":[0.94074804,0.0019242709,0.030410426,0.0005841317,0.00071122183,0.00013124882,0.0005154145,0.00016845501,0.024806766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991466,0.0002585713,0.000054372296,0.00012408457,0.00026899544,0.00014748778],"domain_scores_gemma":[0.99440837,0.0036846427,0.00056242896,0.00031622575,0.0005452559,0.00048300685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011374245,0.00049721065,0.0005423871,0.0029638405,0.0012013665,0.0028072777,0.0008567525,0.0008573034,0.009676018],"category_scores_gemma":[0.009793424,0.0003040571,0.00035521673,0.0021010533,0.0023702222,0.006804157,0.0016761499,0.002027308,0.0014812689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080750055,0.000021644866,0.00060162833,0.0000652292,0.0000083514,0.000053793443,0.00019567707,0.002648939,0.0010839704,0.97077495,0.0036982272,0.020766838],"study_design_scores_gemma":[0.000012663455,0.000018951016,0.00046335332,0.00003339588,0.00000706681,0.00010431541,0.00009401276,0.0072470084,0.00057549,0.9860341,0.005395302,0.000014422426],"about_ca_topic_score_codex":0.00074421294,"about_ca_topic_score_gemma":0.0011436009,"teacher_disagreement_score":0.009676018,"about_ca_system_score_codex":0.0011682198,"about_ca_system_score_gemma":0.0005821291,"threshold_uncertainty_score":0.032369494},"labels":[],"label_agreement":null},{"id":"W2575220639","doi":"","title":"Arc-Transitive Pentavalent Graphs Of Order Four Times A Prime Power.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Prime power; Arc (geometry); Prime (order theory); Order (exchange); Combinatorics; Discrete mathematics; Geometry; Business","score_opus":0.013361877877724427,"score_gpt":0.2661985043003224,"score_spread":0.25283662642259797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575220639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50771046,0.0007378359,0.09857639,0.0020969163,0.0010048272,0.00014806367,0.0023148821,0.0013908028,0.38601986],"genre_scores_gemma":[0.9105915,0.0005832791,0.02487365,0.0004025426,0.00015811538,0.000071394374,0.0016020035,0.00025003165,0.06146744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967,0.0000592025,0.00002005462,0.000079245874,0.00008195439,0.00008950196],"domain_scores_gemma":[0.99878377,0.00043526624,0.00023725667,0.0002173528,0.00014011795,0.00018615741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022861586,0.00038207986,0.00046119682,0.00096866133,0.0013446535,0.0016401754,0.00068054104,0.0004810459,0.01578905],"category_scores_gemma":[0.0014213746,0.00041217628,0.00047949003,0.00087883003,0.0011118307,0.0018096975,0.0012149852,0.0013884373,0.0023710919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018731912,0.0000617677,0.0007217572,0.00010083902,0.00003350277,0.0008238019,0.0004083511,0.0016976509,0.0077023716,0.96202195,0.009114544,0.017126258],"study_design_scores_gemma":[0.0000408795,0.000061029816,0.00092441204,0.000029984216,0.00004412811,0.00069573894,0.0003113166,0.0043208334,0.0042314418,0.9643939,0.02492472,0.000021553407],"about_ca_topic_score_codex":0.00089716155,"about_ca_topic_score_gemma":0.0016837713,"teacher_disagreement_score":0.01578905,"about_ca_system_score_codex":0.0005401308,"about_ca_system_score_gemma":0.00045152236,"threshold_uncertainty_score":0.05281967},"labels":[],"label_agreement":null},{"id":"W2575803557","doi":"","title":"The Structure and Automorphisms of Semi-directed Graphs.","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Automorphism; Computer science; Mathematics; Combinatorics","score_opus":0.010183790082802537,"score_gpt":0.25503622250835684,"score_spread":0.2448524324255543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575803557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70604926,0.00066015153,0.26556286,0.0014518473,0.00011997901,0.00008903236,0.00031218506,0.00022553744,0.025529241],"genre_scores_gemma":[0.9864596,0.00025231525,0.009514449,0.00007010512,0.000060473707,0.000047018166,0.00010286081,0.000026836735,0.0034664064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991799,0.0003421014,0.000040198396,0.00019135489,0.00016595105,0.00008060749],"domain_scores_gemma":[0.9925661,0.0044562607,0.001326705,0.0007688612,0.00039345722,0.0004885669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010742674,0.0002572094,0.00028183515,0.0013598301,0.0009945129,0.0016565591,0.00054341374,0.00078330137,0.0023786284],"category_scores_gemma":[0.0067487448,0.00036552397,0.00054721686,0.0006114892,0.0038297067,0.002692234,0.0012508634,0.0010522848,0.00028786832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025986361,0.000013695156,0.00093646016,0.000028974182,0.000007867467,0.000080684185,0.00029523295,0.003301449,0.0013717756,0.9903715,0.00025977206,0.0033066685],"study_design_scores_gemma":[0.00001602704,0.000037030528,0.0007907685,0.000020526226,0.000013213933,0.00032238115,0.00013739445,0.029854884,0.001499828,0.9636607,0.0036326589,0.000014681118],"about_ca_topic_score_codex":0.00052714994,"about_ca_topic_score_gemma":0.00046073084,"teacher_disagreement_score":0.0023786284,"about_ca_system_score_codex":0.0009883511,"about_ca_system_score_gemma":0.00034782532,"threshold_uncertainty_score":0.007957339},"labels":[],"label_agreement":null},{"id":"W2576316065","doi":"","title":"Bicoloured ordered trees, non-nesting partitions and non-crossing partitions.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Nesting (process); Combinatorics","score_opus":0.020219836248142803,"score_gpt":0.28565529809543233,"score_spread":0.2654354618472895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576316065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46510464,0.0041767317,0.27215523,0.0013567837,0.0007720248,0.00013787652,0.0013329715,0.0011459698,0.2538177],"genre_scores_gemma":[0.87738705,0.0010896729,0.06913868,0.0005502968,0.00025370944,0.00008112831,0.0014340203,0.00038685772,0.049678646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995535,0.000087157314,0.000028385732,0.00010282234,0.00011672184,0.00011141798],"domain_scores_gemma":[0.99859124,0.00044889632,0.0002352137,0.00031538442,0.00017020156,0.00023903835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034247478,0.0003187438,0.00041985678,0.0012468809,0.0016409719,0.0022577539,0.00091794564,0.0008417415,0.010298649],"category_scores_gemma":[0.002250669,0.000479758,0.00045263264,0.0015721127,0.0017097765,0.0030212868,0.0014022285,0.0016076113,0.0019900308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009822279,0.00004224707,0.00075171574,0.00010304739,0.000012742158,0.00037054418,0.00043001055,0.0015750988,0.0033132888,0.9658194,0.0052110613,0.022272633],"study_design_scores_gemma":[0.0000142104755,0.000024650115,0.0009887142,0.00005566157,0.000017915032,0.00066419464,0.00033535156,0.005868363,0.001284085,0.9725873,0.0181412,0.00001828054],"about_ca_topic_score_codex":0.001375777,"about_ca_topic_score_gemma":0.0032458862,"teacher_disagreement_score":0.010298649,"about_ca_system_score_codex":0.0006263416,"about_ca_system_score_gemma":0.00036485938,"threshold_uncertainty_score":0.03445238},"labels":[],"label_agreement":null},{"id":"W2576567135","doi":"","title":"On the forcing connected geodetic number and the connected geodetic number of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Geodesy; Forcing (mathematics); Combinatorics; Geology; Mathematical analysis","score_opus":0.011563575579334354,"score_gpt":0.26113307531360913,"score_spread":0.24956949973427478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576567135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43313527,0.0057346984,0.18330422,0.013055135,0.001433907,0.00011608866,0.0014829902,0.00042684277,0.36131075],"genre_scores_gemma":[0.9428039,0.0025758098,0.021725068,0.0014949951,0.0015018098,0.00017342914,0.00074079714,0.00015606696,0.028828163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992237,0.00024133625,0.00003747753,0.00018117981,0.00017002114,0.00014622281],"domain_scores_gemma":[0.99332654,0.004526942,0.00055961905,0.000477655,0.0004419744,0.0006673315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010529431,0.0005468899,0.00096183625,0.0033786832,0.0026492747,0.0025178168,0.0012261441,0.0018011722,0.012644407],"category_scores_gemma":[0.0074428045,0.0004587417,0.0007667318,0.0026559934,0.0058533945,0.0076090125,0.0034610117,0.0031085191,0.0013727419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030697127,0.0000107224,0.00030147997,0.000038122216,0.0000055250534,0.000049232993,0.00012142582,0.0012120202,0.00026873781,0.99198407,0.0023662893,0.0036117681],"study_design_scores_gemma":[0.000010225777,0.000009810344,0.00042266038,0.000020686348,0.0000078297135,0.00008068319,0.00007612975,0.0027953177,0.00014656111,0.9925955,0.0038231374,0.000011375815],"about_ca_topic_score_codex":0.0019237493,"about_ca_topic_score_gemma":0.0022683297,"teacher_disagreement_score":0.012644407,"about_ca_system_score_codex":0.0018962286,"about_ca_system_score_gemma":0.0007255919,"threshold_uncertainty_score":0.042299747},"labels":[],"label_agreement":null},{"id":"W2577346904","doi":"","title":"p-Factor-Criticality of Vertex-Transitive Graphs with Large Girth.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Transitive relation; Vertex (graph theory); Odd graph; Criticality; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Physics","score_opus":0.01251476753406263,"score_gpt":0.2697306604009778,"score_spread":0.2572158928669152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577346904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7774879,0.0013385921,0.106200546,0.0020331459,0.00022700631,0.00014180217,0.0012593236,0.000976645,0.11033516],"genre_scores_gemma":[0.98699236,0.00034987522,0.006714453,0.00017357078,0.000110291265,0.00004646765,0.00043681735,0.000116060095,0.005060187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945265,0.000111837435,0.000023516272,0.00014310215,0.00011365876,0.00015521406],"domain_scores_gemma":[0.99475276,0.0026234195,0.0007367736,0.00055162905,0.0004872889,0.0008481325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005651356,0.00056878076,0.0006721036,0.001947454,0.0015018514,0.0025408997,0.00096944947,0.0010015654,0.009444021],"category_scores_gemma":[0.007334056,0.00047911907,0.0005748062,0.0009651392,0.0026014564,0.0030579315,0.0016975881,0.0015960969,0.0011138555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029855254,0.00006585429,0.003087552,0.00019398193,0.00004378115,0.00067471043,0.0005651221,0.0064653954,0.005953518,0.95874494,0.009183818,0.014722779],"study_design_scores_gemma":[0.000040723713,0.000027205953,0.00071241066,0.000034304936,0.000021847634,0.0004809469,0.00021627633,0.013013722,0.0018842713,0.9802831,0.0032707353,0.000014294753],"about_ca_topic_score_codex":0.0015331986,"about_ca_topic_score_gemma":0.0014573281,"teacher_disagreement_score":0.009444021,"about_ca_system_score_codex":0.0010272958,"about_ca_system_score_gemma":0.0006634605,"threshold_uncertainty_score":0.031593442},"labels":[],"label_agreement":null},{"id":"W2577389189","doi":"","title":"Enumeration of the degree sequences of 3-connected graphs and cactus graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Cactus; Degree (music); Combinatorics; Biology; Botany; Physics","score_opus":0.026795077744073213,"score_gpt":0.2623174185012079,"score_spread":0.23552234075713466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577389189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67415524,0.0013207822,0.14125283,0.0016574522,0.00035816315,0.00019169887,0.005180262,0.0010243434,0.17485929],"genre_scores_gemma":[0.8652818,0.0008152818,0.09719385,0.00038749105,0.00011477012,0.00018016706,0.0056478605,0.00026268134,0.030116027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996019,0.00010015569,0.000026112526,0.00007756618,0.000118044205,0.00007624575],"domain_scores_gemma":[0.9983713,0.00079043966,0.00017337354,0.00020332827,0.00027421935,0.0001872887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002640122,0.00042877154,0.00034744633,0.0021543321,0.0009847502,0.0013809043,0.0008064455,0.00080805353,0.011510244],"category_scores_gemma":[0.0031639799,0.0003073965,0.00037919852,0.002192299,0.0007330872,0.0018796417,0.00085162,0.001118329,0.0015470432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031697896,0.00015391447,0.0045413417,0.00033372274,0.00003423779,0.0003716963,0.0008674182,0.012079459,0.01120602,0.81959605,0.019351926,0.13114733],"study_design_scores_gemma":[0.00003327681,0.00005316792,0.0033846796,0.00013472559,0.000026099147,0.00062570255,0.00044647293,0.041918557,0.007566396,0.91014934,0.035626788,0.00003478319],"about_ca_topic_score_codex":0.0018319408,"about_ca_topic_score_gemma":0.0032260704,"teacher_disagreement_score":0.011510244,"about_ca_system_score_codex":0.00082123955,"about_ca_system_score_gemma":0.0006351392,"threshold_uncertainty_score":0.038505614},"labels":[],"label_agreement":null},{"id":"W2577405957","doi":"","title":"Rainbow vertex connection number of dense and sparse graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Connection (principal bundle); Mathematics; Vertex (graph theory); Rainbow; Combinatorics; Dense graph; Graph; Chordal graph; 1-planar graph; Geometry; Physics; Optics","score_opus":0.015736897010209912,"score_gpt":0.2748202763442786,"score_spread":0.25908337933406866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577405957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87853646,0.001243648,0.03416906,0.0014441147,0.00025717245,0.000041585008,0.0023239711,0.00045292944,0.08153096],"genre_scores_gemma":[0.9894684,0.0003149815,0.004955929,0.000071367474,0.00008131733,0.000027272492,0.00061952206,0.000054353455,0.004406936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996037,0.00008362393,0.000017910215,0.00010725969,0.00009421632,0.00009333515],"domain_scores_gemma":[0.996588,0.0019027487,0.0004711392,0.0002642167,0.00024213284,0.00053170533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005349855,0.0003181982,0.000386878,0.0024821043,0.0009584512,0.0015603,0.0009954191,0.000728538,0.011467083],"category_scores_gemma":[0.005002441,0.00030779294,0.0002713791,0.0015293836,0.0011833631,0.0029049625,0.0010742724,0.0009206013,0.00078741525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006849961,0.00010862959,0.009765416,0.00030212058,0.000057116988,0.00027901167,0.00045721966,0.012874876,0.007738519,0.90225434,0.022223933,0.04325385],"study_design_scores_gemma":[0.000074681186,0.00007620085,0.008880066,0.00007024994,0.0000732486,0.00068460725,0.00035617716,0.056844953,0.0037123556,0.9204974,0.0086850375,0.000045019642],"about_ca_topic_score_codex":0.0009510833,"about_ca_topic_score_gemma":0.0014529846,"teacher_disagreement_score":0.011467083,"about_ca_system_score_codex":0.0009128142,"about_ca_system_score_gemma":0.0004426362,"threshold_uncertainty_score":0.03836119},"labels":[],"label_agreement":null},{"id":"W2577800761","doi":"","title":"On the Q-index and index of triangle-free quasi-tree graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Tree (set theory); Discrete mathematics; Computer science","score_opus":0.0168470497386582,"score_gpt":0.25894127368911746,"score_spread":0.24209422395045926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577800761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47640088,0.0050543393,0.23728886,0.004818039,0.0012925462,0.00012025344,0.0014084859,0.00061745575,0.27299902],"genre_scores_gemma":[0.93669087,0.0022656515,0.030569538,0.00089018245,0.0008813315,0.00010947306,0.000773606,0.00037913406,0.027440222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993387,0.00016720821,0.000037784823,0.00011348876,0.00020214528,0.00014064857],"domain_scores_gemma":[0.9949468,0.0027958746,0.0006439226,0.0004875292,0.0005387573,0.0005871588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010897326,0.000421057,0.00074886496,0.002592989,0.0017508226,0.0030462733,0.001533999,0.0012171941,0.010377755],"category_scores_gemma":[0.006791598,0.00042373146,0.00051323563,0.002303916,0.002799557,0.0076864613,0.002015649,0.0021027124,0.0019436085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000764946,0.000026832653,0.0005414471,0.000046580444,0.000005897269,0.00007892988,0.00023911531,0.0009368205,0.0010985011,0.98430806,0.0033968987,0.009244262],"study_design_scores_gemma":[0.000012271469,0.000012707264,0.00036514646,0.000020110041,0.0000067622677,0.00012956404,0.00009965779,0.0046149376,0.00037130225,0.9910772,0.0032801658,0.000010065684],"about_ca_topic_score_codex":0.0017747588,"about_ca_topic_score_gemma":0.0019016195,"teacher_disagreement_score":0.010377755,"about_ca_system_score_codex":0.0013793934,"about_ca_system_score_gemma":0.0006937158,"threshold_uncertainty_score":0.034717083},"labels":[],"label_agreement":null},{"id":"W2578103029","doi":"","title":"Tournaments whose indecomposability graph admits a vertex cover of size 2.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Vertex cover; Cover (algebra); Discrete mathematics","score_opus":0.014072295542171206,"score_gpt":0.2799166196258348,"score_spread":0.2658443240836636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578103029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92163974,0.00028575648,0.01814358,0.0013374418,0.00012292413,0.000055698158,0.0019845788,0.0003931234,0.056037195],"genre_scores_gemma":[0.9845024,0.00012128086,0.0053263395,0.00015766123,0.000063800966,0.000033605716,0.0015048274,0.000047735663,0.008242283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995859,0.00007677089,0.000020003501,0.00010676853,0.000065085726,0.00014546522],"domain_scores_gemma":[0.99831885,0.00080272416,0.0002709398,0.00021026349,0.00009487546,0.00030232957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002577308,0.00047149402,0.0004997567,0.00056835456,0.0017233924,0.0025443644,0.00078688905,0.0011359617,0.013575859],"category_scores_gemma":[0.0019031669,0.0004049483,0.00057464186,0.00073365745,0.0006425471,0.0014444834,0.000804348,0.001010802,0.0007054974],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003464723,0.00078358984,0.02729116,0.00071025384,0.00044121407,0.0076911394,0.0016193293,0.023031846,0.07791676,0.7245506,0.05951145,0.072988],"study_design_scores_gemma":[0.0006432064,0.00048267675,0.024635045,0.000098535995,0.00028291313,0.005994154,0.0011827641,0.081673436,0.02110788,0.81532085,0.048478052,0.000100458165],"about_ca_topic_score_codex":0.0015342926,"about_ca_topic_score_gemma":0.002360416,"teacher_disagreement_score":0.013575859,"about_ca_system_score_codex":0.0006468666,"about_ca_system_score_gemma":0.0003535114,"threshold_uncertainty_score":0.04541576},"labels":[],"label_agreement":null},{"id":"W2578758224","doi":"","title":"On The Detour Monophonic Number of a Graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.015210940631470826,"score_gpt":0.27634517660121527,"score_spread":0.26113423596974444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578758224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6577411,0.0020311521,0.094910376,0.0076961843,0.001627196,0.000079177255,0.0008226386,0.00044915764,0.23464294],"genre_scores_gemma":[0.9649798,0.0007489287,0.012651938,0.00052712817,0.0007802847,0.00010198254,0.0002825213,0.00015295704,0.01977441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992976,0.00022703735,0.000027514954,0.0001341992,0.00016943867,0.00014415637],"domain_scores_gemma":[0.99534863,0.002774949,0.0005195713,0.00034141506,0.0003278561,0.00068759976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008568697,0.00057234603,0.0006608914,0.003135791,0.0020231516,0.0021880725,0.0012287871,0.0014729629,0.010599463],"category_scores_gemma":[0.0068647107,0.0003273046,0.00037476793,0.0013249688,0.003239652,0.0046528834,0.0019434053,0.002436071,0.0014328859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011050281,0.000024891591,0.00048826484,0.000062626765,0.000007685242,0.0000975636,0.00019418423,0.001502467,0.0013800989,0.98301065,0.0037939872,0.009327047],"study_design_scores_gemma":[0.000021029782,0.00002865688,0.0006375485,0.000034191722,0.000009508434,0.00017073409,0.000106081796,0.0083133085,0.00066783355,0.9848969,0.0050944737,0.000019744952],"about_ca_topic_score_codex":0.0009565495,"about_ca_topic_score_gemma":0.0015218453,"teacher_disagreement_score":0.010599463,"about_ca_system_score_codex":0.001237378,"about_ca_system_score_gemma":0.000501565,"threshold_uncertainty_score":0.035458744},"labels":[],"label_agreement":null},{"id":"W2578989106","doi":"","title":"A characterization of the graphs with high degree sum that are not covered by three cycles.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Characterization (materials science); Combinatorics; Discrete mathematics; Materials science; Nanotechnology","score_opus":0.0214172698619869,"score_gpt":0.23372365351360555,"score_spread":0.21230638365161864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578989106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8800684,0.0010327839,0.06195778,0.001248401,0.00014714326,0.0000972399,0.0022964536,0.00051294506,0.052638832],"genre_scores_gemma":[0.97778225,0.0003666492,0.014326076,0.00025337996,0.00011092663,0.00007140111,0.002169481,0.00015716313,0.0047626193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948174,0.00007802736,0.000029384004,0.00016573006,0.00011336242,0.00013173782],"domain_scores_gemma":[0.9969023,0.0012208575,0.00059655413,0.00038380412,0.00030922182,0.0005871671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035450797,0.0006583372,0.00063027703,0.00249147,0.001600546,0.0023845353,0.0010600222,0.00091764826,0.0056546186],"category_scores_gemma":[0.0034431217,0.0003967915,0.0005871805,0.002220466,0.0013867043,0.002547183,0.0016269363,0.001336975,0.0009850224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010715895,0.00032498696,0.019641755,0.0006798912,0.00013848783,0.002150596,0.0020183874,0.013024148,0.06430574,0.79256743,0.019588364,0.08448869],"study_design_scores_gemma":[0.00008663951,0.00021762507,0.02331428,0.00023428592,0.00022070121,0.007142748,0.002115235,0.061751146,0.022877006,0.8367294,0.045195688,0.00011524926],"about_ca_topic_score_codex":0.0008512504,"about_ca_topic_score_gemma":0.00087163644,"teacher_disagreement_score":0.0056546186,"about_ca_system_score_codex":0.0006530925,"about_ca_system_score_gemma":0.00047941052,"threshold_uncertainty_score":0.018916607},"labels":[],"label_agreement":null},{"id":"W2579056633","doi":"10.4230/lipics.isaac.2016.20","title":"Degree-Constrained Orientation of Maximum Satisfaction : Graph Classes and Parameterized Complexity","year":2016,"lang":"en","type":"article","venue":"TU/e Research Portal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Combinatorics; Treewidth; Mathematics; Chordal graph; Pathwidth; Degeneracy (biology); Discrete mathematics; Parameterized complexity; Indifference graph; Split graph; 1-planar graph; Independent set; Bipartite graph; Bounded function; Time complexity; Clique-sum; Graph; Line graph","score_opus":0.14200655131551848,"score_gpt":0.3923633862723219,"score_spread":0.25035683495680344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579056633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22562487,0.0008059061,0.7374273,0.006447114,0.00009475943,0.00037489444,0.0025954058,0.0016355661,0.024994165],"genre_scores_gemma":[0.74136436,0.0009240309,0.24295194,0.000779524,0.0002036283,0.00044248134,0.0040282793,0.00060072413,0.008705005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975667,0.0007055874,0.00012438309,0.0007287221,0.0005060416,0.00036860665],"domain_scores_gemma":[0.9910125,0.0057098726,0.0009801633,0.0015260852,0.00035736698,0.00041391022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017065689,0.0009082062,0.0010525942,0.00078506087,0.0011138084,0.004877259,0.0025148129,0.0016562571,0.012358452],"category_scores_gemma":[0.011693517,0.0008311911,0.0019821057,0.0024824883,0.0018427296,0.009580886,0.002449891,0.0034105966,0.000840446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040810782,0.000525008,0.0061747753,0.00060386054,0.00015365928,0.0001920743,0.00069640705,0.20703454,0.0065012453,0.6485121,0.01860477,0.11059336],"study_design_scores_gemma":[0.00010778614,0.00003800451,0.0009793849,0.000034489178,0.00004569675,0.00015289245,0.00021399149,0.4011945,0.0024627207,0.5886266,0.006117415,0.000026464963],"about_ca_topic_score_codex":0.0053617065,"about_ca_topic_score_gemma":0.006172454,"teacher_disagreement_score":0.012358452,"about_ca_system_score_codex":0.0040938375,"about_ca_system_score_gemma":0.002159442,"threshold_uncertainty_score":0.041343153},"labels":[],"label_agreement":null},{"id":"W2579231286","doi":"","title":"Domination numbers of m-cactus chains","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cactus; Mathematics; Equidistant; Combinatorics; Domination analysis; Graph; Invariant (physics); Upper and lower bounds; Discrete mathematics; Geometry; Botany; Biology; Mathematical analysis","score_opus":0.013307967540432569,"score_gpt":0.274592659922865,"score_spread":0.26128469238243246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579231286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8547777,0.00085295475,0.09061037,0.00029245994,0.000048338614,0.000055972687,0.0005301888,0.00015471881,0.052677307],"genre_scores_gemma":[0.970698,0.00027905553,0.023834113,0.00004726618,0.000029098252,0.00007238339,0.0002957677,0.000041459076,0.0047029834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996278,0.00003779792,0.000025743022,0.00010252125,0.000113454604,0.00009266511],"domain_scores_gemma":[0.9987457,0.00064918026,0.00018930875,0.000091618575,0.0001741079,0.00015013479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029926322,0.0003328149,0.00029496272,0.0018344887,0.00095044606,0.0011096352,0.0008248393,0.00048435736,0.0066236584],"category_scores_gemma":[0.0025219843,0.00020915513,0.00025289872,0.0011843279,0.000681779,0.0016034296,0.0007147756,0.0006019599,0.00027569753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053488015,0.00011710291,0.019011473,0.0005911782,0.000076489,0.00089362677,0.0011290642,0.072110504,0.060825817,0.7356073,0.0041067046,0.104995854],"study_design_scores_gemma":[0.000055254077,0.00014053597,0.011917369,0.00018669962,0.00006335684,0.0014700805,0.0007290406,0.3638324,0.041178677,0.5610618,0.019280734,0.00008411319],"about_ca_topic_score_codex":0.00084507477,"about_ca_topic_score_gemma":0.0015456473,"teacher_disagreement_score":0.0066236584,"about_ca_system_score_codex":0.0011578663,"about_ca_system_score_gemma":0.00024062129,"threshold_uncertainty_score":0.022158325},"labels":[],"label_agreement":null},{"id":"W2579377738","doi":"","title":"On the {4, -k}-hypomorphy for digraphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.022155598587601417,"score_gpt":0.273440382427533,"score_spread":0.2512847838399316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579377738","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25102893,0.0037492595,0.28398904,0.009361465,0.0018146657,0.00022306053,0.0029802395,0.0011922703,0.44566107],"genre_scores_gemma":[0.8519487,0.002021445,0.07032398,0.002997792,0.00078569015,0.0002091266,0.001810653,0.00061014935,0.06929252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906105,0.00027098457,0.000081254526,0.00023602268,0.00016745455,0.00018323252],"domain_scores_gemma":[0.9987476,0.0005375261,0.00014828012,0.0002122245,0.00016644242,0.00018793874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091973774,0.00067074195,0.00073261646,0.0018982891,0.003195185,0.0041157594,0.0010892926,0.0018764096,0.013312003],"category_scores_gemma":[0.0025488858,0.0007830111,0.001092228,0.0018693543,0.003301705,0.01014413,0.003686464,0.0041267974,0.0024115443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025190184,0.000019449506,0.00017787218,0.00004200148,0.000006906673,0.000102804224,0.00022623973,0.0002868893,0.00047375145,0.98911333,0.0032503405,0.0062752054],"study_design_scores_gemma":[0.000013111751,0.000014285801,0.00022901794,0.00002651783,0.000007937987,0.00019349446,0.00012823241,0.0009841541,0.00023653598,0.990042,0.008112499,0.000012190579],"about_ca_topic_score_codex":0.001989009,"about_ca_topic_score_gemma":0.0029601776,"teacher_disagreement_score":0.013312003,"about_ca_system_score_codex":0.0020585556,"about_ca_system_score_gemma":0.0009349087,"threshold_uncertainty_score":0.044533134},"labels":[],"label_agreement":null},{"id":"W2579740192","doi":"","title":"Weakly convex and convex domination numbers of some products of graphs","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Convex set; Convex polytope; Subderivative; Dominating set; Convex analysis; Regular polygon; Discrete mathematics; Graph; Vertex (graph theory); Convex optimization; Geometry","score_opus":0.01142241835444885,"score_gpt":0.2557556759484341,"score_spread":0.24433325759398528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579740192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89548665,0.00058417505,0.07992296,0.00041669398,0.000030681294,0.000058019774,0.00095147337,0.00009047565,0.02245893],"genre_scores_gemma":[0.9724187,0.00041173436,0.021704856,0.00005677793,0.00008264174,0.000090937734,0.00063611317,0.000034459597,0.004563832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900913,0.0002036323,0.00006463633,0.0002855367,0.00029294315,0.00014401446],"domain_scores_gemma":[0.9962282,0.0020006625,0.00057430693,0.00023857506,0.00039820932,0.00055999815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086496794,0.00054409343,0.00051858986,0.002112986,0.0010988624,0.002030298,0.000500608,0.0003787742,0.0022342901],"category_scores_gemma":[0.0036609734,0.0002823343,0.00051530474,0.0012948674,0.0021665555,0.0027337994,0.0008729126,0.0007413925,0.00016383608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003540681,0.0000691888,0.012542824,0.00019651157,0.00009218071,0.00036889728,0.001268494,0.02302252,0.012014292,0.91952705,0.002702958,0.027841078],"study_design_scores_gemma":[0.00004599746,0.00017959358,0.013836868,0.000053745516,0.000094624455,0.0012576807,0.0006397102,0.15884718,0.008029173,0.79839176,0.018559387,0.0000642561],"about_ca_topic_score_codex":0.0011761507,"about_ca_topic_score_gemma":0.0012468434,"teacher_disagreement_score":0.0022342901,"about_ca_system_score_codex":0.0014367499,"about_ca_system_score_gemma":0.0004398291,"threshold_uncertainty_score":0.010424435},"labels":[],"label_agreement":null},{"id":"W2579796062","doi":"","title":"Matchings in 4-total restrained domination vertex critical graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.012588696912176423,"score_gpt":0.28900393182183975,"score_spread":0.27641523490966335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579796062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8305109,0.0005854258,0.06254486,0.0007980297,0.00012804625,0.00018202774,0.0008693603,0.0005021467,0.10387917],"genre_scores_gemma":[0.95768183,0.0002509797,0.0173598,0.00021003645,0.00003863683,0.000078367615,0.0007293364,0.000101032565,0.023549953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966836,0.000056014356,0.00001714694,0.000069257,0.000086735134,0.00010247331],"domain_scores_gemma":[0.9988356,0.00041756354,0.00021288684,0.00013553943,0.00018675336,0.00021166449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002802198,0.0003672512,0.00043510244,0.0015378278,0.0015344189,0.0013286518,0.00088037504,0.00076624274,0.011390668],"category_scores_gemma":[0.002143549,0.00038670746,0.0003930293,0.0010784777,0.00091313856,0.00177742,0.0012182299,0.0008047743,0.0011246926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046355254,0.00011798429,0.0035350188,0.0003324929,0.00006947047,0.001413024,0.0010725236,0.00988954,0.01711923,0.91414297,0.009343461,0.042500775],"study_design_scores_gemma":[0.00012129924,0.00007835104,0.002601475,0.00010666671,0.00008938238,0.0012218877,0.0008265704,0.033651203,0.009760826,0.925885,0.02562313,0.000034302757],"about_ca_topic_score_codex":0.002241847,"about_ca_topic_score_gemma":0.00360621,"teacher_disagreement_score":0.011390668,"about_ca_system_score_codex":0.0009369713,"about_ca_system_score_gemma":0.00054146245,"threshold_uncertainty_score":0.038105547},"labels":[],"label_agreement":null},{"id":"W2582739324","doi":"10.48550/arxiv.1401.5714","title":"Reconfiguration of Dominating Sets","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Control reconfiguration; Graph; Domination analysis; Adjacency list; Discrete mathematics; Connected dominating set; Computer science","score_opus":0.078056358029308,"score_gpt":0.22691487864325507,"score_spread":0.14885852061394705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582739324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1660758,0.0032951348,0.75832033,0.0031398258,0.00075833715,0.00070425204,0.0016550393,0.001137904,0.06491341],"genre_scores_gemma":[0.6857794,0.0021022654,0.28863308,0.0011179377,0.00036342474,0.00052951765,0.0018988763,0.00039840434,0.019177143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734193,0.0007504471,0.00016073324,0.0009794319,0.0004007407,0.0003666537],"domain_scores_gemma":[0.99426925,0.0029448518,0.0005794415,0.0012284013,0.0003844008,0.0005936743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014820145,0.0013107955,0.0014778157,0.0011620844,0.0018919286,0.0025482385,0.0029259222,0.0014835253,0.0075437096],"category_scores_gemma":[0.008656937,0.0009863216,0.0020404835,0.001969164,0.0016422394,0.0052330643,0.003321394,0.0020515556,0.001188125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005608611,0.000342354,0.0024228864,0.0012685027,0.00029705168,0.0009162908,0.00095522904,0.42457,0.017465271,0.38063496,0.016381918,0.15418468],"study_design_scores_gemma":[0.00018234672,0.0005311328,0.0011307467,0.00013741181,0.00015352231,0.001472031,0.0005177457,0.42162228,0.009705124,0.50033766,0.064137,0.00007292015],"about_ca_topic_score_codex":0.0012400398,"about_ca_topic_score_gemma":0.001291468,"teacher_disagreement_score":0.0075437096,"about_ca_system_score_codex":0.0021591852,"about_ca_system_score_gemma":0.00089616113,"threshold_uncertainty_score":0.025236249},"labels":[],"label_agreement":null},{"id":"W2582871424","doi":"10.1007/978-3-319-21840-3_33","title":"The Complexity of Dominating Set Reconfiguration","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control reconfiguration; Computer science; Set (abstract data type); Programming language; Embedded system","score_opus":0.08715331853177619,"score_gpt":0.3293101202288042,"score_spread":0.242156801697028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582871424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2745447,0.014616873,0.39737463,0.017855357,0.0016050049,0.00042330366,0.003732031,0.0013085346,0.2885396],"genre_scores_gemma":[0.90759546,0.006891211,0.0536277,0.00078954984,0.0014684785,0.00037268884,0.0018025733,0.00052062725,0.026931737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696976,0.00078871334,0.00015571085,0.00054448657,0.0010932066,0.00044816185],"domain_scores_gemma":[0.9862292,0.0102237305,0.00071837154,0.0017063838,0.0005640319,0.0005583338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017042324,0.0009837595,0.0017497746,0.0012756567,0.0015280945,0.00656513,0.00274172,0.0018104798,0.010936549],"category_scores_gemma":[0.013872654,0.001175701,0.0018222627,0.003258481,0.0027365347,0.009495418,0.0030927954,0.0044231694,0.0011938796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038567872,0.000106288615,0.00090861856,0.0006590143,0.00010292803,0.00018700636,0.00035211135,0.11462926,0.003155621,0.78743327,0.02006119,0.07201904],"study_design_scores_gemma":[0.0000514548,0.000033448476,0.00041783633,0.000051027597,0.000045216442,0.00022333152,0.000089946196,0.08497327,0.0008992827,0.9053072,0.007884385,0.000023645753],"about_ca_topic_score_codex":0.0014964375,"about_ca_topic_score_gemma":0.0013735319,"teacher_disagreement_score":0.010936549,"about_ca_system_score_codex":0.005036082,"about_ca_system_score_gemma":0.0019000247,"threshold_uncertainty_score":0.036586404},"labels":[],"label_agreement":null},{"id":"W2585451022","doi":"10.1016/j.dam.2016.08.016","title":"Characterizations of (<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mn>4</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs","year":2016,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Induced subgraph; Algorithm; Discrete mathematics","score_opus":0.019238483340077613,"score_gpt":0.2523574263767693,"score_spread":0.23311894303669167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585451022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030783491,0.0013072899,0.58689004,0.0041789776,0.0010038378,0.00068394834,0.031181287,0.019329727,0.32464138],"genre_scores_gemma":[0.31523597,0.002973349,0.25960317,0.003292144,0.0012071114,0.0022649989,0.09553509,0.015280733,0.30460748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964025,0.00040581299,0.00044254656,0.00096320256,0.0011415352,0.0006443754],"domain_scores_gemma":[0.99333125,0.0015133374,0.00082049053,0.0013223868,0.0025503032,0.00046226554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019127548,0.0016868125,0.00084239466,0.004267067,0.0021170308,0.008721677,0.0021858322,0.0021664237,0.0931231],"category_scores_gemma":[0.009572835,0.00077834143,0.0018269193,0.004501413,0.0020861528,0.010171329,0.0034701878,0.0026906496,0.05768543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036840752,0.00023131567,0.0029096352,0.0008010953,0.000072265335,0.0007405328,0.0020541206,0.006747022,0.011371498,0.65597355,0.20750251,0.111228056],"study_design_scores_gemma":[0.0000580004,0.000099316974,0.002638662,0.00033917802,0.00006843451,0.0010031089,0.0012308194,0.03163157,0.014314735,0.27555007,0.6729263,0.00013976038],"about_ca_topic_score_codex":0.009027785,"about_ca_topic_score_gemma":0.009519855,"teacher_disagreement_score":0.0931231,"about_ca_system_score_codex":0.0032924067,"about_ca_system_score_gemma":0.0025181512,"threshold_uncertainty_score":0.31152785},"labels":[],"label_agreement":null},{"id":"W2585703313","doi":"10.1016/j.jctb.2018.06.007","title":"The list chromatic number of graphs with small clique number","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Clique number; Chromatic scale; Mathematics; Clique; Graph; Discrete mathematics","score_opus":0.01616007451721822,"score_gpt":0.2906845463848654,"score_spread":0.27452447186764717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585703313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88769233,0.0010478485,0.05574281,0.0049096053,0.00032734385,0.00008297416,0.0025369425,0.0011224451,0.046537835],"genre_scores_gemma":[0.9817669,0.00037544017,0.008429992,0.0003571695,0.00026404206,0.00012015488,0.0010741431,0.00031252296,0.007299594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906284,0.00024040778,0.000029621144,0.00029297284,0.00018320227,0.00019101652],"domain_scores_gemma":[0.98314697,0.011452845,0.0015463126,0.0012410734,0.0010070178,0.0016058495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011621647,0.00073085644,0.00088341575,0.003459867,0.0028017876,0.005014446,0.0027717787,0.0022811324,0.014338553],"category_scores_gemma":[0.014473002,0.0009819616,0.00051374856,0.0023990544,0.0029755149,0.0063929684,0.0015848413,0.002068359,0.0010730635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001484692,0.00022309409,0.012182965,0.0006557294,0.000116564144,0.00031105717,0.00082846754,0.037753507,0.019020248,0.8710311,0.03121344,0.02517901],"study_design_scores_gemma":[0.00020186297,0.00011047495,0.0073394296,0.000116651085,0.00015276702,0.00047795937,0.0004416883,0.15481842,0.006638825,0.8231409,0.006455221,0.0001056983],"about_ca_topic_score_codex":0.0026838188,"about_ca_topic_score_gemma":0.004156526,"teacher_disagreement_score":0.014338553,"about_ca_system_score_codex":0.0027447334,"about_ca_system_score_gemma":0.0015584307,"threshold_uncertainty_score":0.047967255},"labels":[],"label_agreement":null},{"id":"W2586403007","doi":"","title":"Vertex-disjoint cycles passing through specified elements in graphs","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Disjoint sets; Vertex (graph theory); Computer science; Combinatorics; Graph; Mathematics","score_opus":0.031754642399546465,"score_gpt":0.30442901628539404,"score_spread":0.2726743738858476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586403007","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6838774,0.00039923337,0.27897897,0.00061247346,0.00014436705,0.00041201952,0.0007865275,0.0009318105,0.033857122],"genre_scores_gemma":[0.863712,0.00047149803,0.11473636,0.00033978952,0.000052509615,0.0005812077,0.0012975876,0.0003806976,0.018428212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876034,0.000297072,0.00012329244,0.00026530906,0.0002946292,0.00025921955],"domain_scores_gemma":[0.9938631,0.0029349576,0.00084922294,0.0007139474,0.0009279078,0.0007108371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008956519,0.0008747139,0.0007363169,0.0027700076,0.002847489,0.0040026004,0.0021170105,0.0023153045,0.004953649],"category_scores_gemma":[0.008699205,0.001178503,0.0008868753,0.0028115897,0.0019772057,0.004831796,0.0025908537,0.0014942368,0.0009388376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042858714,0.00012756704,0.0023833103,0.00020962783,0.000055223543,0.00070227036,0.001959253,0.009262128,0.007910317,0.94920653,0.0024035336,0.025351694],"study_design_scores_gemma":[0.00007536329,0.00006817992,0.0007025096,0.00010357354,0.00009099533,0.00024036209,0.0009137235,0.026273917,0.011909214,0.95067835,0.008906699,0.000037096826],"about_ca_topic_score_codex":0.003195753,"about_ca_topic_score_gemma":0.0046700495,"teacher_disagreement_score":0.004953649,"about_ca_system_score_codex":0.0013516222,"about_ca_system_score_gemma":0.0013291308,"threshold_uncertainty_score":0.016571641},"labels":[],"label_agreement":null},{"id":"W2589794168","doi":"10.1016/j.dam.2017.01.025","title":"Proximity, remoteness and girth in graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Vertex (graph theory); Upper and lower bounds; Graph; Discrete mathematics","score_opus":0.02733397661248872,"score_gpt":0.30344173437951144,"score_spread":0.27610775776702273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589794168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8890269,0.0016377915,0.09752042,0.0011692406,0.00008282421,0.00003034469,0.00024267595,0.00013073992,0.010159068],"genre_scores_gemma":[0.9858709,0.0007309477,0.010561926,0.00007657654,0.00023328204,0.000040997147,0.00017789847,0.000032635504,0.002274843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980477,0.00070668367,0.0001006379,0.00054723106,0.00041404154,0.00018367953],"domain_scores_gemma":[0.97204566,0.021193424,0.0029642154,0.0014025596,0.0006349435,0.0017592667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016068041,0.00062587525,0.0015553093,0.0035111848,0.0019842272,0.0036369057,0.0019764174,0.0017781603,0.0041438737],"category_scores_gemma":[0.017711336,0.0008370034,0.0006827224,0.0037263243,0.0067810114,0.008438506,0.0048309113,0.0029136408,0.00042051147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052193046,0.00021613507,0.012122738,0.00040183082,0.000112761445,0.00042939812,0.0031707417,0.027918031,0.0045285216,0.9171465,0.0013458402,0.032085564],"study_design_scores_gemma":[0.00003368688,0.00010131449,0.0024252532,0.000030853855,0.000052668845,0.00043785726,0.00043879234,0.015469624,0.0006440444,0.9792086,0.0011310756,0.000026228265],"about_ca_topic_score_codex":0.0005454578,"about_ca_topic_score_gemma":0.00051135174,"teacher_disagreement_score":0.0041438737,"about_ca_system_score_codex":0.0007296761,"about_ca_system_score_gemma":0.00045153953,"threshold_uncertainty_score":0.01386261},"labels":[],"label_agreement":null},{"id":"W2591604206","doi":"","title":"On the complexity of recognizing tenacious graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.07314943444469264,"score_gpt":0.31333394933723807,"score_spread":0.24018451489254544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591604206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44681907,0.007149053,0.35581616,0.034054335,0.0013481388,0.0005462525,0.009056445,0.0032626688,0.14194788],"genre_scores_gemma":[0.85640234,0.0028236879,0.10038238,0.0024545062,0.0009846553,0.0003592483,0.011791252,0.00087009056,0.023931846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588263,0.0010984476,0.00033829064,0.0010335338,0.0010233884,0.0006237398],"domain_scores_gemma":[0.9527164,0.03887897,0.0017697931,0.0038560438,0.0015965382,0.0011823351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020910287,0.0009730648,0.00161246,0.0018526794,0.0030805245,0.0071041165,0.003531457,0.0030862554,0.018639967],"category_scores_gemma":[0.0326358,0.0009770069,0.0020063587,0.0034261944,0.0036703409,0.021404825,0.0057424987,0.0060886764,0.0030272563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007728317,0.00044564417,0.0069621815,0.0011146249,0.00021362177,0.00074136915,0.0017019971,0.04440171,0.0037329027,0.7579363,0.06860338,0.11337349],"study_design_scores_gemma":[0.000029608535,0.000022699789,0.00069002784,0.000042645563,0.000037402788,0.00027998054,0.00035164529,0.04399325,0.0009731309,0.9473974,0.0061532687,0.000029031258],"about_ca_topic_score_codex":0.005132969,"about_ca_topic_score_gemma":0.0064022345,"teacher_disagreement_score":0.018639967,"about_ca_system_score_codex":0.003007238,"about_ca_system_score_gemma":0.0019383794,"threshold_uncertainty_score":0.06235683},"labels":[],"label_agreement":null},{"id":"W25916205","doi":"10.1007/s13277-015-3292-7","title":"The Linear 2-Arboricity of Outerplanar Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Dense graph; Outerplanar graph; Pathwidth; 1-planar graph; Combinatorics; Chordal graph; Graph; Planar graph; Line graph","score_opus":0.013677726103518254,"score_gpt":0.27601834291488475,"score_spread":0.2623406168113665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25916205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73239076,0.0026835673,0.17230558,0.0015181877,0.00020270998,0.00012066043,0.0023947544,0.00038639735,0.08799742],"genre_scores_gemma":[0.96755713,0.0017289236,0.018738296,0.00022358076,0.00017458614,0.00008440163,0.0011791214,0.00008007143,0.010233862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997161,0.00007057094,0.000016271799,0.000081146674,0.00006560456,0.000050298604],"domain_scores_gemma":[0.9984932,0.0007081551,0.00045053745,0.000118387994,0.000093373026,0.00013645412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023786582,0.00037958822,0.00023904008,0.001143462,0.0004972142,0.0009856955,0.0003898134,0.00041799978,0.004275861],"category_scores_gemma":[0.0018580261,0.00021868742,0.0003888276,0.00092390267,0.0009740091,0.0014383127,0.0008441616,0.00058557733,0.00057920086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037495687,0.00007019629,0.0056339256,0.00076823874,0.00010065651,0.0015065718,0.0009413722,0.031123644,0.030015005,0.8391196,0.008718833,0.08162704],"study_design_scores_gemma":[0.00004668736,0.00014625612,0.006687111,0.000056328274,0.000057990655,0.0022903979,0.00025571772,0.045533627,0.0050168186,0.90903485,0.030834349,0.00003975291],"about_ca_topic_score_codex":0.00075620797,"about_ca_topic_score_gemma":0.0014226239,"teacher_disagreement_score":0.004275861,"about_ca_system_score_codex":0.0004357076,"about_ca_system_score_gemma":0.00019548579,"threshold_uncertainty_score":0.014304161},"labels":[],"label_agreement":null},{"id":"W2591800080","doi":"","title":"On the upper broadcast domination number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.020878372076711466,"score_gpt":0.3067115787654745,"score_spread":0.28583320668876305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591800080","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18134521,0.009417451,0.1893226,0.021817636,0.0020808906,0.00019363403,0.0037228575,0.0012123706,0.5908874],"genre_scores_gemma":[0.9017963,0.0051677236,0.031810395,0.0026741808,0.002038688,0.00052521477,0.0015838845,0.00057688996,0.053826798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765706,0.0006014894,0.00008275055,0.00043121245,0.0006464419,0.0005810976],"domain_scores_gemma":[0.9758513,0.019165235,0.0010146815,0.0015153919,0.0011256952,0.0013276935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024840059,0.00080311607,0.001427523,0.0029384745,0.0028444377,0.004486506,0.0026290945,0.0019201848,0.026237959],"category_scores_gemma":[0.022505041,0.0005971259,0.0006747687,0.0028474377,0.003530806,0.009109229,0.0033967819,0.005386445,0.004207463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023309811,0.0000546534,0.00083212834,0.00022866852,0.000021519565,0.00008163643,0.00027284902,0.005829304,0.0015003472,0.941175,0.026995204,0.02277564],"study_design_scores_gemma":[0.000048030965,0.0000234325,0.0005902388,0.00009086278,0.000027870843,0.00019465569,0.00008782098,0.017173816,0.0010892138,0.96721655,0.013430825,0.000026843316],"about_ca_topic_score_codex":0.0018757052,"about_ca_topic_score_gemma":0.0023630161,"teacher_disagreement_score":0.026237959,"about_ca_system_score_codex":0.0034791545,"about_ca_system_score_gemma":0.0016121976,"threshold_uncertainty_score":0.08777475},"labels":[],"label_agreement":null},{"id":"W2591835446","doi":"","title":"The Maximum Size of C 4 -Free Planar Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Combinatorics; Planar graph; Graph; Computer science; Computer graphics (images)","score_opus":0.017474622676120894,"score_gpt":0.27933435601917594,"score_spread":0.26185973334305507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591835446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7983769,0.0024994917,0.040862508,0.008188174,0.00028872787,0.00012958958,0.014526583,0.0008627309,0.13426517],"genre_scores_gemma":[0.9730055,0.0008977129,0.011715912,0.00043622273,0.00022876673,0.00015749664,0.003261274,0.0002653012,0.01003197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991357,0.00017116561,0.000040234663,0.00019508337,0.00020750877,0.00025038765],"domain_scores_gemma":[0.9890742,0.007844639,0.00095814845,0.00063479156,0.00057879795,0.00090950425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079878554,0.000634328,0.00067376526,0.0021891387,0.0011656304,0.0033720073,0.0020438158,0.0017151396,0.014928407],"category_scores_gemma":[0.009604638,0.0005617207,0.0005701657,0.0018248875,0.0015636896,0.004863744,0.0017665043,0.0014833453,0.0015568341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024503253,0.00016730741,0.0089710755,0.0012758881,0.00020039092,0.00047359915,0.0008814145,0.035169378,0.032586046,0.77956784,0.058193527,0.080063336],"study_design_scores_gemma":[0.00017209105,0.00013658647,0.0063739284,0.00016333236,0.00013647802,0.0008318134,0.0004953708,0.048098635,0.015420796,0.90754324,0.020557396,0.000070359136],"about_ca_topic_score_codex":0.0019113036,"about_ca_topic_score_gemma":0.0023161992,"teacher_disagreement_score":0.014928407,"about_ca_system_score_codex":0.0014816858,"about_ca_system_score_gemma":0.0012630792,"threshold_uncertainty_score":0.049940467},"labels":[],"label_agreement":null},{"id":"W2591852761","doi":"","title":"Panconnectedness of K-trees with Sufficiently Large Toughness.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Tree (set theory); Combinatorics; Composite material; Materials science","score_opus":0.017093275294003507,"score_gpt":0.2818853324690745,"score_spread":0.264792057175071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591852761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80977434,0.0009486551,0.108887486,0.0027794105,0.0001984665,0.00007800255,0.0016624483,0.0005082511,0.07516288],"genre_scores_gemma":[0.9740071,0.00039489532,0.01611415,0.00036952161,0.00014504662,0.00007494325,0.000751492,0.00014086075,0.00800199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993191,0.00015162748,0.000037814647,0.00017441632,0.00016255297,0.00015456865],"domain_scores_gemma":[0.98849773,0.0070608268,0.0011750286,0.0008595098,0.00089372194,0.0015132019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007821513,0.00047480068,0.0006206193,0.001702639,0.0015584558,0.0025238874,0.0012015913,0.0012320745,0.011927558],"category_scores_gemma":[0.010358879,0.00073577475,0.0006068635,0.0013130421,0.0020481749,0.0051866416,0.0021380181,0.0020423117,0.0011273146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030167607,0.00008104818,0.003292373,0.00031396013,0.00006381865,0.0006786434,0.0008493076,0.009717337,0.008981249,0.95044464,0.010605058,0.014670851],"study_design_scores_gemma":[0.000038201193,0.000036212237,0.0020206415,0.0000508812,0.000039327355,0.0006774792,0.00029139488,0.02962517,0.0015133661,0.96140987,0.004274157,0.000023290557],"about_ca_topic_score_codex":0.0011579738,"about_ca_topic_score_gemma":0.0018027399,"teacher_disagreement_score":0.011927558,"about_ca_system_score_codex":0.000794989,"about_ca_system_score_gemma":0.00040221808,"threshold_uncertainty_score":0.039901614},"labels":[],"label_agreement":null},{"id":"W2591927635","doi":"","title":"A Fan-type result on fractional ID-k-factor-critical graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Factor (programming language); Combinatorics; Computer science; Geology; Programming language","score_opus":0.03812353792731751,"score_gpt":0.35103290513582835,"score_spread":0.3129093672085108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591927635","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22455297,0.0033365537,0.17943497,0.004261575,0.00119576,0.000115072624,0.0011654809,0.0010021476,0.5849355],"genre_scores_gemma":[0.9188386,0.0013553954,0.02690517,0.0012293676,0.0004571034,0.00007195887,0.0008235225,0.00026091677,0.050057918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996966,0.000052678894,0.000010322739,0.000089281224,0.0000788098,0.00007231276],"domain_scores_gemma":[0.9985045,0.0006985234,0.00013529322,0.0001710252,0.00025559295,0.00023501615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004726568,0.0005769837,0.00050934654,0.001888573,0.0019926727,0.0018812141,0.00088528683,0.0010085636,0.01425567],"category_scores_gemma":[0.0034842782,0.00036936702,0.00049489964,0.0012460401,0.0018753052,0.0032182934,0.00145736,0.0017788191,0.001586715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092065835,0.000030170371,0.0007460794,0.00014722408,0.000013049844,0.00018619833,0.0002614119,0.0017558686,0.0019214813,0.97396934,0.0106080165,0.010269007],"study_design_scores_gemma":[0.000024742105,0.0000187802,0.00049759867,0.00006584405,0.000029951112,0.00042005634,0.00020121645,0.006104014,0.0016100181,0.9710023,0.020010546,0.000015041949],"about_ca_topic_score_codex":0.0016615617,"about_ca_topic_score_gemma":0.0021068538,"teacher_disagreement_score":0.01425567,"about_ca_system_score_codex":0.001295984,"about_ca_system_score_gemma":0.000485237,"threshold_uncertainty_score":0.047689974},"labels":[],"label_agreement":null},{"id":"W2591998382","doi":"10.1016/j.dam.2017.02.001","title":"Non-edge orientation and vertex ordering characterizations of some classes of bigraphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Bipartite graph; Interval graph; Chordal graph; Mathematics; Permutation graph; Vertex (graph theory); Complete bipartite graph; Discrete mathematics; Indifference graph; Directed acyclic graph; Pathwidth; Graph; Line graph; 1-planar graph","score_opus":0.022062988815600343,"score_gpt":0.30128016225120774,"score_spread":0.27921717343560737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591998382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9178699,0.00037285866,0.049675323,0.0007938548,0.00008505033,0.000058907135,0.00078571844,0.00026900848,0.030089308],"genre_scores_gemma":[0.9813774,0.00028597986,0.010565904,0.00023713878,0.00013850318,0.000057285277,0.0012846176,0.00011571723,0.0059374827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994399,0.00008220602,0.000034908415,0.00018669925,0.00011085327,0.0001455214],"domain_scores_gemma":[0.9962614,0.0013475821,0.0007132313,0.00046630835,0.00026766956,0.00094377523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005175829,0.0006797843,0.0008415619,0.0020834703,0.0021259382,0.0032753279,0.0014368062,0.0010294945,0.005983576],"category_scores_gemma":[0.0026899583,0.0006337596,0.00086818787,0.0019958273,0.0023402793,0.0033940452,0.0013979066,0.0019210642,0.00043730292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021794447,0.00019513047,0.0083695585,0.00015795472,0.000034126988,0.00049357367,0.0010437884,0.0031711352,0.0059928787,0.95905507,0.003320122,0.017948773],"study_design_scores_gemma":[0.00004410039,0.000057565605,0.0065752994,0.000036708538,0.000038377068,0.0005492187,0.0005782496,0.018682048,0.0014751554,0.96751595,0.0044162725,0.000031131945],"about_ca_topic_score_codex":0.001592873,"about_ca_topic_score_gemma":0.0020777767,"teacher_disagreement_score":0.005983576,"about_ca_system_score_codex":0.0012388416,"about_ca_system_score_gemma":0.00070826133,"threshold_uncertainty_score":0.020017028},"labels":[],"label_agreement":null},{"id":"W2592020534","doi":"","title":"The signed cycle domatic number of a graph","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014183076852899861,"score_gpt":0.30502034391492233,"score_spread":0.29083726706202245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592020534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6864145,0.0007103568,0.15631168,0.0021986018,0.0011053409,0.00014309541,0.0013902921,0.00054984546,0.15117638],"genre_scores_gemma":[0.93218875,0.00047273084,0.033214632,0.0003637022,0.00033932665,0.00016905997,0.0007340676,0.00013116299,0.03238641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937266,0.00016686216,0.000050015227,0.00014269062,0.00016946271,0.00009832746],"domain_scores_gemma":[0.99818736,0.0006449549,0.000290088,0.00013896015,0.00033279127,0.0004057842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054589706,0.00046771622,0.00048618705,0.0037250058,0.0015185486,0.0035229044,0.00077165314,0.0010450438,0.009227304],"category_scores_gemma":[0.0030971179,0.00026818836,0.00031270107,0.0019834447,0.0019546184,0.0036552434,0.0012696952,0.0011029163,0.0011861104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015295533,0.000028378447,0.0011577865,0.000074848715,0.00001016322,0.000093168506,0.00021815118,0.0014175124,0.0036790518,0.9641154,0.003156261,0.025896253],"study_design_scores_gemma":[0.000030274245,0.00007146671,0.0011038269,0.00004645968,0.000018661278,0.00037030593,0.00017631525,0.0102664605,0.0036032838,0.9661373,0.01813367,0.000041879222],"about_ca_topic_score_codex":0.00047045585,"about_ca_topic_score_gemma":0.00074608834,"teacher_disagreement_score":0.009227304,"about_ca_system_score_codex":0.0009834536,"about_ca_system_score_gemma":0.0007429998,"threshold_uncertainty_score":0.030868411},"labels":[],"label_agreement":null},{"id":"W2592152114","doi":"10.5614/ejgta.2017.5.2.14","title":"On the nullity number of graphs","year":2016,"lang":"fr","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Clique number; Upper and lower bounds; Graph; Clique; Discrete mathematics; Domination analysis; Linear algebra; Vertex (graph theory); Geometry","score_opus":0.32268975650327775,"score_gpt":0.5750101694187498,"score_spread":0.2523204129154721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592152114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46589494,0.0055915643,0.39106774,0.007884708,0.0005887848,0.00012997862,0.0011628161,0.00042351955,0.12725596],"genre_scores_gemma":[0.94706434,0.002366895,0.04031959,0.00066020875,0.00060472696,0.00016933263,0.0005894613,0.00031120246,0.007914301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558985,0.0014578584,0.00022884754,0.00097237056,0.0010700729,0.00068110734],"domain_scores_gemma":[0.9436822,0.043077074,0.0030461515,0.004044206,0.0029561955,0.0031942578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004793135,0.0009825119,0.0013059095,0.0038834657,0.002716419,0.0032111255,0.0024704754,0.001553361,0.005548472],"category_scores_gemma":[0.029118573,0.00088830036,0.0014123593,0.0020617966,0.007161575,0.010521368,0.0046320567,0.0042528016,0.0006995275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028408118,0.000051119132,0.002462931,0.00018842741,0.000041143005,0.00015251809,0.00034797675,0.008343692,0.0037622298,0.9722455,0.0021392782,0.009981136],"study_design_scores_gemma":[0.000023658196,0.000062100306,0.0007977678,0.00005417042,0.000032238542,0.0002244011,0.00009741855,0.027057538,0.0024196682,0.9654659,0.0037341556,0.00003087085],"about_ca_topic_score_codex":0.00048577663,"about_ca_topic_score_gemma":0.0004901287,"teacher_disagreement_score":0.005548472,"about_ca_system_score_codex":0.0019126867,"about_ca_system_score_gemma":0.0006170936,"threshold_uncertainty_score":0.025348842},"labels":[],"label_agreement":null},{"id":"W2592318313","doi":"10.21914/anziamj.v58i0.10993","title":"Isolated Scattering Number Can be Computed in Polynomial Time for Interval Graphs","year":2017,"lang":"en","type":"article","venue":"ANZIAM Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"China Scholarship Council; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Interval graph; Planarity testing; Combinatorics; Mathematics; Discrete mathematics; Interval (graph theory); Conjecture; Graph theory; Graph; Indifference graph; Chordal graph; 1-planar graph","score_opus":0.029942500811953328,"score_gpt":0.32584863179448786,"score_spread":0.29590613098253454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592318313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17128773,0.0013567292,0.78463876,0.0013107514,0.0001930779,0.00031974944,0.004461209,0.010361908,0.026070131],"genre_scores_gemma":[0.6426889,0.00048664032,0.33694103,0.00025679468,0.00012930477,0.00026923328,0.008701693,0.001353013,0.009173384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865997,0.00014449078,0.00007397292,0.00037575632,0.00039852972,0.00034726126],"domain_scores_gemma":[0.9949818,0.0028969331,0.00039096273,0.0009450229,0.0005285479,0.00025682495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007057404,0.001638232,0.0011180802,0.0016212458,0.0009056622,0.0026135326,0.0018495974,0.00083422294,0.012542634],"category_scores_gemma":[0.0064228238,0.0004429494,0.0015833095,0.0019848468,0.00086007995,0.0049208337,0.0019252377,0.0017005459,0.0033190886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019971493,0.0004452768,0.0114727905,0.0015116845,0.00029094247,0.00083729636,0.0007384042,0.40565097,0.03529614,0.10385867,0.04756129,0.39033937],"study_design_scores_gemma":[0.00011910105,0.000105692525,0.0015860139,0.00006131656,0.00007871881,0.00038508765,0.00021601057,0.7815109,0.008204531,0.20159344,0.0060982704,0.00004099776],"about_ca_topic_score_codex":0.004512581,"about_ca_topic_score_gemma":0.012392186,"teacher_disagreement_score":0.012542634,"about_ca_system_score_codex":0.0025417495,"about_ca_system_score_gemma":0.0018991721,"threshold_uncertainty_score":0.041959286},"labels":[],"label_agreement":null},{"id":"W2593543367","doi":"","title":"Covering finite groups by subset products.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.02073209783085663,"score_gpt":0.27983381248092654,"score_spread":0.2591017146500699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593543367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42809504,0.002955773,0.33928764,0.0016874443,0.00045466528,0.0001087688,0.0008372278,0.0010851615,0.22548833],"genre_scores_gemma":[0.9211696,0.0013434603,0.044366844,0.00030490238,0.00034289336,0.000091214606,0.0008496515,0.0002740145,0.031257357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993773,0.00018482731,0.000039831633,0.00014793492,0.00015603656,0.000094113355],"domain_scores_gemma":[0.998611,0.00063007156,0.0001523205,0.0003492996,0.00010392211,0.00015332029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050822337,0.00046348988,0.0005317727,0.0011115125,0.0009000435,0.0018241059,0.00055143173,0.0005002398,0.007358598],"category_scores_gemma":[0.0019132083,0.00039207074,0.00084539247,0.0010502542,0.0014219155,0.0044849133,0.0024569775,0.0012115061,0.0015491083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000599882,0.00003075605,0.0007996231,0.00007853892,0.00002523579,0.0001744707,0.0006088915,0.0013194323,0.002506535,0.96678,0.0033648168,0.024251694],"study_design_scores_gemma":[0.000013510627,0.000037946567,0.0005316601,0.00002781395,0.000026269081,0.00054486166,0.0002461585,0.004276654,0.0024434275,0.9758065,0.016034761,0.00001049678],"about_ca_topic_score_codex":0.00039989222,"about_ca_topic_score_gemma":0.0005428934,"teacher_disagreement_score":0.007358598,"about_ca_system_score_codex":0.0005243894,"about_ca_system_score_gemma":0.00026600753,"threshold_uncertainty_score":0.024617016},"labels":[],"label_agreement":null},{"id":"W2593589874","doi":"","title":"Roman domination edge critical graphs having precisely two cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.026605463062883215,"score_gpt":0.34238888851757715,"score_spread":0.31578342545469396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593589874","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41546488,0.0010674061,0.06803786,0.0013979042,0.0003544925,0.0001424395,0.0013003899,0.0006416099,0.5115929],"genre_scores_gemma":[0.92925006,0.00049194973,0.017341802,0.00042951095,0.00009133246,0.000079158584,0.0010260636,0.000158844,0.05113126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996537,0.00008091404,0.000014599007,0.000077009136,0.00007056337,0.000103179314],"domain_scores_gemma":[0.9989981,0.0003784238,0.00014150594,0.00013963824,0.0001816922,0.0001606402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025858489,0.00046230358,0.0003762399,0.0011726271,0.001464329,0.0016231879,0.0005632454,0.0007667223,0.017660497],"category_scores_gemma":[0.0018710803,0.0003452185,0.00030907328,0.00071447657,0.0011584288,0.0018886594,0.0011849548,0.0009926865,0.0020350446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002220393,0.00003963527,0.0009963375,0.00015239377,0.000021995544,0.0005706301,0.000279936,0.0014264842,0.009208524,0.96287054,0.00893556,0.015276038],"study_design_scores_gemma":[0.00009994373,0.00006240901,0.0022265962,0.00011996942,0.000060063157,0.0017673178,0.00063677406,0.009721945,0.014346703,0.9014126,0.069501564,0.000044092678],"about_ca_topic_score_codex":0.00094109,"about_ca_topic_score_gemma":0.001741729,"teacher_disagreement_score":0.017660497,"about_ca_system_score_codex":0.00066254806,"about_ca_system_score_gemma":0.00045628217,"threshold_uncertainty_score":0.059080243},"labels":[],"label_agreement":null},{"id":"W2594112171","doi":"","title":"Vertices of Degree 9 in Contraction Critical 8-Connected Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Contraction (grammar); Combinatorics; Physics","score_opus":0.04019856368834564,"score_gpt":0.3374120237219961,"score_spread":0.29721346003365046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594112171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9313405,0.00026993905,0.016590472,0.00066078233,0.00011663324,0.00005165071,0.00028552796,0.00013527834,0.050549086],"genre_scores_gemma":[0.9821869,0.00014423241,0.006659848,0.00013579133,0.000028773453,0.000048733833,0.00036404788,0.000053143394,0.010378517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977976,0.000045245146,0.000008726475,0.000042147825,0.000043067284,0.00008111075],"domain_scores_gemma":[0.998933,0.00043358695,0.00017617193,0.00007535107,0.00012773037,0.00025418063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002219006,0.00036391898,0.0003554627,0.0010367952,0.0014042432,0.0009978204,0.00059786305,0.0007515681,0.010064804],"category_scores_gemma":[0.0015323843,0.00036091107,0.0002804753,0.0005835015,0.0011622444,0.0011569744,0.0011463942,0.00088547374,0.0010954186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012917796,0.00015939935,0.007977379,0.00039528566,0.00005691364,0.0035731285,0.002258525,0.009715642,0.041818913,0.8845393,0.012647875,0.03556583],"study_design_scores_gemma":[0.000215247,0.00013434123,0.008705022,0.00020124509,0.00010032756,0.0021871475,0.0027054506,0.027541738,0.022454105,0.90694624,0.028760899,0.000048132966],"about_ca_topic_score_codex":0.0010690291,"about_ca_topic_score_gemma":0.0024156568,"teacher_disagreement_score":0.010064804,"about_ca_system_score_codex":0.0004762988,"about_ca_system_score_gemma":0.0004304227,"threshold_uncertainty_score":0.033670127},"labels":[],"label_agreement":null},{"id":"W2594200469","doi":"","title":"Rainbow connection numbers of ladders and Mobius ladders.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Connection (principal bundle); Mathematics; Rainbow; Combinatorics; Topology (electrical circuits); Geometry; Physics; Quantum mechanics","score_opus":0.018724114707772615,"score_gpt":0.29011712497642955,"score_spread":0.2713930102686569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594200469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57185143,0.0019619053,0.10405461,0.0018058026,0.0008203768,0.00007466887,0.0006087235,0.0006638525,0.3181587],"genre_scores_gemma":[0.9476803,0.00075885694,0.016317677,0.00021950748,0.00020200659,0.00005194701,0.00022567376,0.0001271915,0.034416918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995696,0.00008465164,0.000025931,0.00008187343,0.0001319414,0.00010594673],"domain_scores_gemma":[0.99870396,0.00044157045,0.00023349465,0.00013269669,0.00016644405,0.00032187218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049739407,0.0003764681,0.00036150598,0.003036514,0.0014173877,0.0020947063,0.0007537952,0.0008419332,0.014939175],"category_scores_gemma":[0.003118524,0.000356247,0.0003532858,0.001542686,0.0017577166,0.0040371246,0.0015736852,0.0013277644,0.0018923132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041261563,0.000014444913,0.00036297354,0.00003079501,0.000004639439,0.000044919514,0.00012325491,0.0004546499,0.00096864044,0.9885562,0.0017648742,0.007633427],"study_design_scores_gemma":[0.000016226657,0.000019764166,0.000691234,0.00002910477,0.000009690498,0.000170845,0.00011750988,0.002962271,0.000867663,0.9882576,0.006842871,0.000015234508],"about_ca_topic_score_codex":0.0007407488,"about_ca_topic_score_gemma":0.0012091271,"teacher_disagreement_score":0.014939175,"about_ca_system_score_codex":0.0009530104,"about_ca_system_score_gemma":0.00048142043,"threshold_uncertainty_score":0.049976587},"labels":[],"label_agreement":null},{"id":"W2594391380","doi":"","title":"Spanning 3-ended trees in k-connected claw-free graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Spanning tree; Structural engineering","score_opus":0.025766973302576705,"score_gpt":0.2983453865105893,"score_spread":0.27257841320801257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594391380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80982244,0.0010608607,0.11799466,0.0009341675,0.00014972358,0.00011413769,0.0013834885,0.0007474116,0.067793146],"genre_scores_gemma":[0.94644386,0.00051619817,0.031196304,0.00025740257,0.000042118594,0.00007351591,0.0014056405,0.00013764844,0.019927341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996444,0.000058560003,0.000030290064,0.00008566072,0.000085627886,0.00009537871],"domain_scores_gemma":[0.9984281,0.0006574653,0.00027279978,0.00015646536,0.00019522391,0.00028998757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002573502,0.00035779394,0.0004201965,0.0013437823,0.001389184,0.00172818,0.0009339529,0.0013469703,0.008867364],"category_scores_gemma":[0.0022515107,0.00051619456,0.00044760038,0.0014323648,0.0009808859,0.002729222,0.0019328595,0.0011309372,0.0026314973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032786562,0.00016119138,0.0039947885,0.0004864595,0.00007329854,0.0020312213,0.0019869127,0.010247771,0.021886958,0.88351387,0.010004369,0.06528535],"study_design_scores_gemma":[0.000041574545,0.000049769034,0.0024815365,0.0001315256,0.00005433275,0.0015351976,0.0008806663,0.018732822,0.007472454,0.95228285,0.016296625,0.000040757397],"about_ca_topic_score_codex":0.0009791114,"about_ca_topic_score_gemma":0.0022248556,"teacher_disagreement_score":0.008867364,"about_ca_system_score_codex":0.000493505,"about_ca_system_score_gemma":0.0003345515,"threshold_uncertainty_score":0.029664278},"labels":[],"label_agreement":null},{"id":"W2594885100","doi":"","title":"Subgraphs And Similarity Of Vertices.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Similarity (geometry); Artificial intelligence; Computer science","score_opus":0.023551922607211114,"score_gpt":0.300733246410696,"score_spread":0.27718132380348487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594885100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7079305,0.0035416693,0.21698049,0.0025947238,0.00026149114,0.00013344482,0.0018608076,0.00056619116,0.06613064],"genre_scores_gemma":[0.9608344,0.0009171182,0.026927527,0.00029766574,0.00027410124,0.000086403976,0.0016706447,0.000111686946,0.008880431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998558,0.00048427965,0.00009162337,0.00044141413,0.00029146046,0.00013331427],"domain_scores_gemma":[0.99206346,0.0036673925,0.0017641011,0.0012236737,0.0006624502,0.0006189625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077600044,0.0003049585,0.0008298892,0.0039014735,0.0011891916,0.0026996173,0.0011782544,0.0011491287,0.006790511],"category_scores_gemma":[0.01202805,0.00036030432,0.0006094946,0.003440925,0.0020262925,0.005294974,0.0021120852,0.00095546286,0.0010516619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017958053,0.00008416818,0.009896406,0.00020030522,0.000096009295,0.00029734054,0.0008131285,0.0050854953,0.0032784692,0.92748517,0.0050690374,0.047514956],"study_design_scores_gemma":[0.000020357593,0.000037867158,0.005986341,0.000041298128,0.000056339206,0.0006803717,0.00038783942,0.01491414,0.0012212874,0.968493,0.008144355,0.00001673687],"about_ca_topic_score_codex":0.0010055184,"about_ca_topic_score_gemma":0.0013623734,"teacher_disagreement_score":0.006790511,"about_ca_system_score_codex":0.0009579326,"about_ca_system_score_gemma":0.00035615143,"threshold_uncertainty_score":0.022716522},"labels":[],"label_agreement":null},{"id":"W2595320992","doi":"","title":"Nordhaus-Gaddum Relations for Proximity and Remoteness in Graphs","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.02090497517781242,"score_gpt":0.2545152877863284,"score_spread":0.233610312608516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595320992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18505247,0.01274956,0.68878025,0.0036484052,0.0005738403,0.00015939909,0.0012655859,0.00026015297,0.107510366],"genre_scores_gemma":[0.8368234,0.0049815574,0.14672801,0.0006993877,0.0008233495,0.0002454082,0.00045817698,0.000063036925,0.00917762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827075,0.000524561,0.00014322167,0.00038615896,0.0004830137,0.00019217502],"domain_scores_gemma":[0.99486226,0.003516375,0.0003822125,0.00034151014,0.00055998255,0.00033762655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002594421,0.0007845347,0.0010339913,0.0039309296,0.0016984344,0.002044342,0.0014445886,0.0013856072,0.004377949],"category_scores_gemma":[0.008955788,0.00047391123,0.0008813638,0.0029713984,0.0031576124,0.006550724,0.0022434976,0.0032490413,0.0005848344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003584916,0.000012271465,0.00033568323,0.00007537255,0.00001207292,0.0001074941,0.00029118004,0.0033618766,0.0007858027,0.98565894,0.0012394025,0.008084104],"study_design_scores_gemma":[0.000012478497,0.00004629167,0.0009436582,0.00006441523,0.000023868508,0.00034942105,0.00020460949,0.018127048,0.0007394249,0.9716788,0.007780026,0.00002986473],"about_ca_topic_score_codex":0.0010872625,"about_ca_topic_score_gemma":0.0013165133,"teacher_disagreement_score":0.004377949,"about_ca_system_score_codex":0.0016351218,"about_ca_system_score_gemma":0.00043749518,"threshold_uncertainty_score":0.014645755},"labels":[],"label_agreement":null},{"id":"W2596648514","doi":"","title":"On the Feedback Vertex Set Polytope of a Series-Parallel Graph","year":2006,"lang":"fr","type":"article","venue":"Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Vertex (graph theory); Pathwidth; Polytope; Indifference graph; Subdivision; Discrete mathematics; Maximal independent set; Series (stratigraphy); 1-planar graph; Graph; Line graph","score_opus":0.016078159843473577,"score_gpt":0.2133130183830099,"score_spread":0.19723485853953632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596648514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5906169,0.0007630327,0.28140748,0.00244449,0.0003194726,0.0004231554,0.004438451,0.0007539978,0.11883294],"genre_scores_gemma":[0.85755694,0.0011627068,0.07407041,0.00040902226,0.0003419941,0.0007585727,0.0028733157,0.00039231378,0.06243473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994351,0.00010845681,0.000017507982,0.00012720811,0.00019895178,0.00011266694],"domain_scores_gemma":[0.99854714,0.00071968336,0.0002669326,0.00007094398,0.00012708068,0.00026824174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003919065,0.0013094953,0.0015898243,0.0014468258,0.0016553112,0.002592519,0.001747735,0.0014486222,0.021941539],"category_scores_gemma":[0.0019531725,0.00064497185,0.0008106488,0.0016195842,0.0016511141,0.0015306795,0.0014118623,0.0017906774,0.0013828679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033560034,0.00020477433,0.0008934179,0.00040893923,0.000060844402,0.000511532,0.00028633155,0.33087727,0.005688046,0.6224063,0.015745046,0.022581898],"study_design_scores_gemma":[0.00016045386,0.000142916,0.0009475851,0.00008552374,0.000026676515,0.00028575718,0.00017279336,0.46744198,0.0018557719,0.52226305,0.006579,0.0000384578],"about_ca_topic_score_codex":0.004156455,"about_ca_topic_score_gemma":0.0042591244,"teacher_disagreement_score":0.021941539,"about_ca_system_score_codex":0.002062242,"about_ca_system_score_gemma":0.0010067093,"threshold_uncertainty_score":0.07340175},"labels":[],"label_agreement":null},{"id":"W2597508670","doi":"10.1002/jgt.21884","title":"SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Mathematics; Planar straight-line graph; Book embedding; Vertex (graph theory); Outerplanar graph; Embedding; Polyhedral graph; Discrete mathematics; Neighbourhood (mathematics); Graph; 1-planar graph; Pathwidth; Chordal graph; Line graph; Computer science","score_opus":0.03866764437602641,"score_gpt":0.30251051878559765,"score_spread":0.2638428744095712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597508670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7512182,0.00012309282,0.22575898,0.00028741462,0.000020786161,0.00009953446,0.00038922258,0.00034627283,0.021756524],"genre_scores_gemma":[0.938422,0.00019835835,0.054461863,0.00005684379,0.000012822736,0.000091651724,0.00059129985,0.000085676584,0.006079524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966717,0.00006461774,0.000016036567,0.00009142402,0.00008249364,0.0000782147],"domain_scores_gemma":[0.9987764,0.00044466127,0.00021736402,0.00031677654,0.00013416719,0.00011062394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002049215,0.00056703214,0.00046405732,0.0005101806,0.00066287274,0.0009291132,0.0006737977,0.0005151446,0.0049091503],"category_scores_gemma":[0.0014437421,0.00040580792,0.0005328209,0.0005448647,0.00079582655,0.0028144685,0.0017592921,0.0011010293,0.0005828231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083115057,0.00034274696,0.0062063253,0.00043128777,0.00013754057,0.0015426652,0.0014251982,0.1228181,0.09285533,0.671676,0.0040046773,0.097729],"study_design_scores_gemma":[0.00010718695,0.00038793875,0.0057899673,0.00007142301,0.00013041859,0.0016897816,0.0013327787,0.25353554,0.07131562,0.637399,0.028185531,0.0000547696],"about_ca_topic_score_codex":0.0008849132,"about_ca_topic_score_gemma":0.0010120296,"teacher_disagreement_score":0.0049091503,"about_ca_system_score_codex":0.00041570453,"about_ca_system_score_gemma":0.0002337475,"threshold_uncertainty_score":0.016422749},"labels":[],"label_agreement":null},{"id":"W2598883699","doi":"10.1002/jgt.22111","title":"Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Chordal graph; Combinatorics; Mathematics; Treewidth; Split graph; Clique-sum; Interval graph; Indifference graph; Discrete mathematics; Bounded function; Independence number; Induced subgraph; Pathwidth; Vertex (graph theory); Graph; 1-planar graph; Line graph","score_opus":0.025118459155473852,"score_gpt":0.3149270744807101,"score_spread":0.2898086153252363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598883699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89696014,0.0004816462,0.08392877,0.00067393295,0.000030900646,0.000056005738,0.0011698256,0.0003377874,0.016360978],"genre_scores_gemma":[0.98667395,0.00012694311,0.011445611,0.00008337026,0.000040696876,0.00003180052,0.0004963006,0.00005975143,0.001041628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937457,0.00010147464,0.000027399888,0.00020701771,0.00012426828,0.00016534525],"domain_scores_gemma":[0.99293876,0.0048316866,0.0005803091,0.0007131235,0.00036211894,0.00057397014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064944994,0.00039793964,0.000434709,0.0011805181,0.00085864286,0.0015639673,0.0014812301,0.00054491195,0.0032515824],"category_scores_gemma":[0.0045792647,0.00038989424,0.0005116067,0.00088331307,0.0011715847,0.002468463,0.0011552959,0.0010348093,0.00023292235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012753916,0.00035672114,0.046262544,0.0008382333,0.0002723931,0.0008067167,0.0019553392,0.10303418,0.09598836,0.67310894,0.011586732,0.06451444],"study_design_scores_gemma":[0.00007984451,0.00011290547,0.019857163,0.000075990494,0.00009583406,0.00070784404,0.0005386984,0.23687461,0.027839439,0.7064529,0.0072897184,0.00007505434],"about_ca_topic_score_codex":0.0021016323,"about_ca_topic_score_gemma":0.0023420914,"teacher_disagreement_score":0.0032515824,"about_ca_system_score_codex":0.001088905,"about_ca_system_score_gemma":0.00047090944,"threshold_uncertainty_score":0.010877609},"labels":[],"label_agreement":null},{"id":"W2599299976","doi":"","title":"Variable Neighborhood Search for Extremal Graphs. 22. Extending Bounds for Independence to Upper Irredundance","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Mathematics; Mathematical proof; Independence number; Graph; Discrete mathematics; Independent set; Independence (probability theory)","score_opus":0.01918832843579429,"score_gpt":0.2993492857366926,"score_spread":0.28016095730089835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599299976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27518708,0.0036906616,0.66420895,0.0032846965,0.00018554424,0.00024527646,0.0016160344,0.0011048636,0.05047686],"genre_scores_gemma":[0.85575426,0.00075737963,0.1349896,0.00042445541,0.0002006156,0.00020202193,0.0015580896,0.00025301726,0.005860443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984145,0.00061937084,0.000068813664,0.00036247954,0.00029568103,0.00023912372],"domain_scores_gemma":[0.99015725,0.0072907396,0.00062590686,0.0011420716,0.00038452778,0.0003994786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021163528,0.0004924782,0.0010815797,0.0019694,0.0015191792,0.0018893419,0.0020089333,0.0008982598,0.005356115],"category_scores_gemma":[0.013346939,0.00067235215,0.0008014304,0.0020249304,0.0018160605,0.0045314077,0.0023478945,0.0021690733,0.00058748253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010475313,0.00027382717,0.014782706,0.0006162095,0.00019516548,0.0002870672,0.00079065695,0.18704568,0.005792898,0.6148317,0.016794933,0.15754162],"study_design_scores_gemma":[0.000070012706,0.00010395057,0.0025001874,0.000058438254,0.00007754357,0.00015867903,0.00011878856,0.43256095,0.0029757186,0.5548337,0.0065119355,0.000030024055],"about_ca_topic_score_codex":0.0025422222,"about_ca_topic_score_gemma":0.0043309284,"teacher_disagreement_score":0.005356115,"about_ca_system_score_codex":0.0018660598,"about_ca_system_score_gemma":0.00075245026,"threshold_uncertainty_score":0.017917931},"labels":[],"label_agreement":null},{"id":"W2599540576","doi":"10.1002/jgt.20344","title":"Average distance and maximum induced forest","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Graph; Conjecture; Bipartite graph; Bound graph; Path graph; Order (exchange); Discrete mathematics; Graph power; Line graph","score_opus":0.02272741783119209,"score_gpt":0.2674605634724172,"score_spread":0.2447331456412251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599540576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.789491,0.0013826645,0.18365972,0.0007578436,0.000054213273,0.000050371476,0.00090595544,0.00044612552,0.023252143],"genre_scores_gemma":[0.97591054,0.0002235377,0.021299476,0.00006820571,0.00005139754,0.00003471442,0.0004200666,0.00006437112,0.0019276993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992067,0.0001678949,0.000032440847,0.00023674766,0.00018912432,0.00016710261],"domain_scores_gemma":[0.99205434,0.0045622024,0.0010765889,0.00069071027,0.00074210035,0.00087407854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007055121,0.00035354894,0.0006717847,0.0019027123,0.0010976294,0.0011579142,0.001352224,0.00069789874,0.0040746653],"category_scores_gemma":[0.0066130366,0.0003307554,0.00034231026,0.001588387,0.0012869549,0.002819092,0.0010300006,0.00090761494,0.0005148781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010137543,0.00030459938,0.023580734,0.0005954793,0.00015416808,0.00041272474,0.00082725805,0.19310203,0.020455444,0.657397,0.010947752,0.091208994],"study_design_scores_gemma":[0.00006180978,0.00021934211,0.008030124,0.000040097224,0.00005808485,0.0010067879,0.0002487867,0.22717875,0.008335516,0.7474336,0.0073417593,0.000045346234],"about_ca_topic_score_codex":0.0009910407,"about_ca_topic_score_gemma":0.0012788756,"teacher_disagreement_score":0.0040746653,"about_ca_system_score_codex":0.0014079992,"about_ca_system_score_gemma":0.0004164806,"threshold_uncertainty_score":0.013631105},"labels":[],"label_agreement":null},{"id":"W2600215958","doi":"10.4310/joc.2016.v7.n2.a1","title":"Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Danmarks Tekniske Universitet","keywords":"Combinatorics; Group (periodic table); Claw; Enhanced Data Rates for GSM Evolution; Mathematics; Planar; Computer science; Physics; Telecommunications; Engineering; Structural engineering; Computer graphics (images)","score_opus":0.013092982817670634,"score_gpt":0.27448150736668137,"score_spread":0.26138852454901074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600215958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8339665,0.001249977,0.13512515,0.0017076471,0.000098146025,0.00014287654,0.0006464237,0.0003616851,0.026701568],"genre_scores_gemma":[0.93633,0.0013393535,0.05407013,0.00040292848,0.00012255946,0.00014439273,0.0013363705,0.00012619092,0.0061281165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953234,0.00007050759,0.000026890651,0.00015506116,0.00009921643,0.00011588298],"domain_scores_gemma":[0.9970733,0.0014857175,0.00062309345,0.00026526712,0.00017792964,0.00037473327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042224696,0.0008207033,0.0005685206,0.0018425698,0.0012989944,0.0020522284,0.0010989363,0.0012420997,0.0051754564],"category_scores_gemma":[0.003073166,0.0008830732,0.0011082281,0.0020185807,0.0034816535,0.0034434947,0.0018767079,0.002765095,0.0005567457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043337425,0.00027553618,0.011402455,0.00056344626,0.00008192893,0.0009953004,0.0032318172,0.029166492,0.01727559,0.86563843,0.0061061126,0.06482942],"study_design_scores_gemma":[0.00007682689,0.00011456674,0.0056905905,0.000071420385,0.00009548176,0.0008231423,0.00082282367,0.021461148,0.004520893,0.9569765,0.009284179,0.00006248627],"about_ca_topic_score_codex":0.0029713688,"about_ca_topic_score_gemma":0.0031923265,"teacher_disagreement_score":0.0051754564,"about_ca_system_score_codex":0.0012587197,"about_ca_system_score_gemma":0.00051635643,"threshold_uncertainty_score":0.0173136},"labels":[],"label_agreement":null},{"id":"W2602127376","doi":"","title":"On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function","year":2004,"lang":"en","type":"preprint","venue":"Tilburg University Research Portal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Technische Universiteit Delft; Universiteit Utrecht; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Semidefinite programming; Bounded function; Approximation algorithm; Graph; Relaxation (psychology); Discrete mathematics; Function (biology); Algorithm; Mathematical optimization","score_opus":0.05670983328273239,"score_gpt":0.3036296669863463,"score_spread":0.24691983370361392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602127376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03157552,0.0010999306,0.9571774,0.0011309953,0.00009433734,0.00015667905,0.00018943814,0.0012313412,0.0073443935],"genre_scores_gemma":[0.27927983,0.0009877816,0.7091162,0.00091424544,0.00017222099,0.00046813133,0.0009930776,0.00061708066,0.007451454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971635,0.0010847464,0.00012828641,0.00063758675,0.00060527836,0.000380564],"domain_scores_gemma":[0.9902238,0.0066827163,0.000638144,0.001515798,0.00059871527,0.00034082972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034749894,0.0023413529,0.0021995709,0.0012268106,0.001286526,0.0033229599,0.004243785,0.0028325985,0.0072547304],"category_scores_gemma":[0.016649434,0.001101139,0.0018712583,0.0029498264,0.0022721284,0.007839709,0.0034530018,0.0050292965,0.0019075113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011980447,0.00053391705,0.00210074,0.00037723721,0.00014198716,0.0001102251,0.00045593694,0.6607616,0.00531921,0.16722043,0.008691189,0.15308955],"study_design_scores_gemma":[0.00007312355,0.00008826845,0.00020477673,0.000030485218,0.000022898294,0.00006694342,0.00004723066,0.89386666,0.0010917359,0.10269672,0.0017932294,0.000017983844],"about_ca_topic_score_codex":0.004022788,"about_ca_topic_score_gemma":0.004387897,"teacher_disagreement_score":0.0072547304,"about_ca_system_score_codex":0.0035075513,"about_ca_system_score_gemma":0.0024361787,"threshold_uncertainty_score":0.025449216},"labels":[],"label_agreement":null},{"id":"W2604168044","doi":"","title":"Automated Generation of Conjectures on Forbidden Subgraph Characterization","year":2007,"lang":"en","type":"other","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; École de Technologie Supérieure","funders":"","keywords":"Combinatorics; Induced subgraph isomorphism problem; Characterization (materials science); Cograph; Split graph; Induced subgraph; Mathematics; Discrete mathematics; Graph; Distance-hereditary graph; Class (philosophy); Computer science; Line graph; Pathwidth; Graph power; Voltage graph; Artificial intelligence","score_opus":0.018208286242535607,"score_gpt":0.2738985082275193,"score_spread":0.2556902219849837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604168044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31550807,0.00019580062,0.6633596,0.0016187271,0.00007530566,0.00058818416,0.0025608807,0.007946858,0.008146534],"genre_scores_gemma":[0.62475294,0.00010500144,0.36647433,0.00022516093,0.000054173033,0.00032611724,0.005661447,0.0005802512,0.0018206678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957004,0.0015387322,0.0002595524,0.0010177919,0.0010845644,0.00039887914],"domain_scores_gemma":[0.93197393,0.0522767,0.0036491365,0.0084667625,0.0029874982,0.0006459184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003938994,0.0009191849,0.0012878991,0.0027348343,0.0013140811,0.0019447847,0.0021358044,0.0015273425,0.00500185],"category_scores_gemma":[0.03882685,0.000640828,0.0015457629,0.0020197202,0.0019162401,0.0042011207,0.0022904845,0.0016568579,0.00076391303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020953603,0.0018459475,0.04391289,0.0012868142,0.0002678554,0.0012886841,0.001961526,0.22624959,0.0408943,0.1660752,0.03200012,0.48212165],"study_design_scores_gemma":[0.00016788021,0.00015344792,0.002126494,0.000054637567,0.000053302105,0.00036629126,0.0003998737,0.8274526,0.02242916,0.14197192,0.0047835256,0.000040874143],"about_ca_topic_score_codex":0.002175933,"about_ca_topic_score_gemma":0.0042201523,"teacher_disagreement_score":0.00500185,"about_ca_system_score_codex":0.0016812994,"about_ca_system_score_gemma":0.0026356482,"threshold_uncertainty_score":0.020831585},"labels":[],"label_agreement":null},{"id":"W2604224124","doi":"10.1002/jgt.10070","title":"Fold‐2‐covering triangular embeddings","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Université du Maine","keywords":"Combinatorics; Mathematics; Conjecture; Euler characteristic; Vertex (graph theory); Surface (topology); Triangulation; Graph; Discrete mathematics; Geometry","score_opus":0.014731016123299518,"score_gpt":0.27928599252315794,"score_spread":0.2645549763998584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604224124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.859616,0.00029029165,0.082767114,0.00020723647,0.00010879025,0.00005531175,0.00032967373,0.00053106394,0.056094605],"genre_scores_gemma":[0.9824019,0.000088693196,0.010598981,0.000060850663,0.00002621671,0.000023526787,0.00040283,0.000057805097,0.0063392916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976665,0.00003129435,0.000011035795,0.000054897897,0.00006885568,0.000067245506],"domain_scores_gemma":[0.9995491,0.00007714595,0.00009469461,0.00013027502,0.000055112174,0.00009356568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011250735,0.00026664181,0.00028439186,0.00051376695,0.0005645391,0.00083091634,0.00038651322,0.0005041098,0.0071563353],"category_scores_gemma":[0.00090899365,0.00021446015,0.0003807024,0.00039253675,0.0007521943,0.0008558423,0.0012039692,0.0004364307,0.00083008455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064257695,0.0001279853,0.01260423,0.0002594263,0.00006388518,0.0017077487,0.0018365309,0.049610563,0.06724523,0.6959185,0.011915712,0.1580676],"study_design_scores_gemma":[0.00009097287,0.00043318773,0.020659374,0.0001302259,0.0000827677,0.004448558,0.0019633647,0.29539502,0.04795203,0.5319865,0.096770145,0.00008787994],"about_ca_topic_score_codex":0.00091420166,"about_ca_topic_score_gemma":0.0011016757,"teacher_disagreement_score":0.0071563353,"about_ca_system_score_codex":0.00048312687,"about_ca_system_score_gemma":0.00013160982,"threshold_uncertainty_score":0.023940325},"labels":[],"label_agreement":null},{"id":"W2604526143","doi":"10.1007/s00373-018-1943-3","title":"On Well-Covered Cartesian Products","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Simons Foundation","keywords":"Cartesian product; Mathematics; Combinatorics; Cartesian coordinate system; Graph; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.01298566698275696,"score_gpt":0.2510953005535228,"score_spread":0.23810963357076584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604526143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62922704,0.0040347558,0.23374128,0.004133684,0.00047065524,0.00008645016,0.0010637802,0.00057020586,0.12667213],"genre_scores_gemma":[0.92114556,0.0028819004,0.0328311,0.00076225464,0.00057123613,0.000135289,0.0012140111,0.00044271114,0.040015996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783933,0.00060458435,0.00012287052,0.000521322,0.00055984355,0.00035201618],"domain_scores_gemma":[0.9939779,0.003592253,0.00048210393,0.00069197494,0.0006805943,0.00057512283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017359606,0.0014740223,0.0015148801,0.004281136,0.0029199217,0.004660252,0.001377978,0.0017233184,0.010253009],"category_scores_gemma":[0.005873786,0.0016793326,0.0013305303,0.004987887,0.0049212845,0.015040339,0.0057656504,0.0037584228,0.0014177543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044429875,0.000017954442,0.00039991693,0.000052742365,0.000009970925,0.00012519176,0.0007286766,0.0006389235,0.00040703508,0.99180025,0.0011935394,0.0045813555],"study_design_scores_gemma":[0.000008885096,0.000013103075,0.0002555642,0.000020418802,0.000014681467,0.00019120787,0.00018149301,0.0014279289,0.00022941378,0.99487174,0.0027749373,0.0000107418455],"about_ca_topic_score_codex":0.0014903445,"about_ca_topic_score_gemma":0.0015443234,"teacher_disagreement_score":0.010253009,"about_ca_system_score_codex":0.0015311504,"about_ca_system_score_gemma":0.00058840576,"threshold_uncertainty_score":0.03429973},"labels":[],"label_agreement":null},{"id":"W2604916992","doi":"10.46298/dmtcs.2092","title":"Complexity of conditional colouring with given template","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Statistics Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Template; Vertex (graph theory); Graph; Induced subgraph; Time complexity; Discrete mathematics; Computer science","score_opus":0.027875562355967724,"score_gpt":0.29527200499150835,"score_spread":0.26739644263554063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604916992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64990103,0.0004297785,0.32659343,0.0034143666,0.00010450632,0.00035654363,0.003807309,0.0024264834,0.012966614],"genre_scores_gemma":[0.90542835,0.00033858474,0.08335728,0.0003949987,0.00009425276,0.00022106784,0.0043714847,0.0006013816,0.005192705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964948,0.0009777748,0.000182359,0.0009700709,0.0007093161,0.0006657031],"domain_scores_gemma":[0.9663017,0.0261643,0.0013642972,0.0040719747,0.0009216737,0.001176037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024804224,0.0008149073,0.0019872503,0.000722543,0.0016707225,0.0045871134,0.0043803942,0.002798407,0.014328979],"category_scores_gemma":[0.023610758,0.0007923688,0.0018986661,0.0021935636,0.0025318952,0.009341127,0.0032623068,0.0023207301,0.0010356791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014371631,0.0003746623,0.005691286,0.0008138381,0.00017452102,0.0006045852,0.0008313991,0.6747709,0.009950426,0.21355914,0.018174771,0.07361731],"study_design_scores_gemma":[0.00012865999,0.00007484723,0.0007533994,0.000022090264,0.00006651548,0.00020936804,0.00019086241,0.66080874,0.0038775112,0.33206922,0.001767361,0.00003143497],"about_ca_topic_score_codex":0.006259874,"about_ca_topic_score_gemma":0.004792837,"teacher_disagreement_score":0.014328979,"about_ca_system_score_codex":0.003413475,"about_ca_system_score_gemma":0.0027663973,"threshold_uncertainty_score":0.047935247},"labels":[],"label_agreement":null},{"id":"W2605443665","doi":"10.26493/1855-3974.1013.46a","title":"Uniformly dissociated graphs","year":2017,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Univerza v Mariboru; Javna Agencija za Raziskovalno Dejavnost RS; Simons Foundation","keywords":"Combinatorics; Mathematics; Induced subgraph; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.04310956707898594,"score_gpt":0.3163105992394612,"score_spread":0.27320103216047525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605443665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60838646,0.0016166104,0.2768697,0.0009872449,0.00016435489,0.00021954157,0.0036515386,0.0006016566,0.1075029],"genre_scores_gemma":[0.9382078,0.0009200111,0.036801897,0.0003978386,0.0001118546,0.0001801588,0.0048254393,0.00011593064,0.018439157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989423,0.00014174439,0.000063468106,0.00038463043,0.00023583691,0.00023211462],"domain_scores_gemma":[0.99810505,0.0004412011,0.00033061788,0.0004683025,0.00027117616,0.00038357062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033253737,0.00056231313,0.00058479287,0.0012836539,0.0015995039,0.0016680261,0.001445607,0.00074690185,0.008441491],"category_scores_gemma":[0.0022948661,0.0004144599,0.00041600186,0.0015540725,0.0018154564,0.003111001,0.0027896836,0.0014853291,0.0014064427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040722787,0.000058041063,0.005096265,0.0002084249,0.000056724715,0.0008149183,0.00080630154,0.013145357,0.013207232,0.9198889,0.0056755454,0.04063509],"study_design_scores_gemma":[0.00005658113,0.000095097035,0.0036421844,0.00006442225,0.000059355352,0.0013907566,0.00092663226,0.02298074,0.0070363525,0.90436757,0.05934298,0.000037431488],"about_ca_topic_score_codex":0.0011595429,"about_ca_topic_score_gemma":0.0010642755,"teacher_disagreement_score":0.008441491,"about_ca_system_score_codex":0.0009451075,"about_ca_system_score_gemma":0.00047599498,"threshold_uncertainty_score":0.028239548},"labels":[],"label_agreement":null},{"id":"W2605510696","doi":"10.1016/j.disc.2017.03.007","title":"Reconfiguring dominating sets in some well-covered and other classes of graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Simons Foundation","keywords":"Combinatorics; Mathematics; Dominating set; Vertex (graph theory); Graph; Discrete mathematics; Bound graph; Domination analysis; Graph power; Line graph","score_opus":0.035875787122762744,"score_gpt":0.32940287477408253,"score_spread":0.2935270876513198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605510696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9178882,0.00040287228,0.06530891,0.00090639055,0.00007395222,0.0000739341,0.0006390392,0.0002597806,0.014446916],"genre_scores_gemma":[0.96406555,0.00041627372,0.026882293,0.00021052425,0.00008174679,0.00007358772,0.0007951469,0.000149392,0.007325569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999203,0.00013514265,0.00003747014,0.0002585642,0.00016516008,0.0002005092],"domain_scores_gemma":[0.9950713,0.0023710662,0.00054124277,0.00069495157,0.00030491746,0.0010164221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008153201,0.00074079965,0.00095749594,0.0016675307,0.001813053,0.0027963398,0.0015156694,0.001057884,0.0041855737],"category_scores_gemma":[0.0048106452,0.0007033384,0.001054706,0.0014032839,0.0016726762,0.003784386,0.0017212746,0.0015114163,0.00035792615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009688297,0.00038371878,0.010937097,0.00046088695,0.00022404146,0.0014632444,0.0031783916,0.103033446,0.038248435,0.7605681,0.011634137,0.06889972],"study_design_scores_gemma":[0.00013819647,0.0001925406,0.005860319,0.000055609453,0.00011719067,0.0012961357,0.0011011192,0.17828944,0.008261848,0.7940446,0.010593269,0.00004963111],"about_ca_topic_score_codex":0.0015645579,"about_ca_topic_score_gemma":0.002430553,"teacher_disagreement_score":0.0041855737,"about_ca_system_score_codex":0.001558732,"about_ca_system_score_gemma":0.0005797783,"threshold_uncertainty_score":0.014002204},"labels":[],"label_agreement":null},{"id":"W2605695111","doi":"10.4236/ojdm.2017.72007","title":"Length of the Longest Path and Diameter in Orientations of Graphs","year":2017,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Combinatorics; Interval (graph theory); Path (computing); Property (philosophy); Interval graph; Pathwidth; Discrete mathematics; Longest path problem; Indifference graph; Graph; Chordal graph; Line graph; Computer science","score_opus":0.0416074269276484,"score_gpt":0.35081594703235613,"score_spread":0.30920852010470773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605695111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.829612,0.0064350674,0.13260925,0.002098918,0.00038415412,0.00005170924,0.0016665272,0.00035430223,0.026788048],"genre_scores_gemma":[0.9740959,0.0021984153,0.019652285,0.00016016913,0.0010050987,0.00012788552,0.00078655407,0.0001180405,0.0018555995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986518,0.00027715677,0.000110091634,0.000555766,0.00023662543,0.00016857123],"domain_scores_gemma":[0.983356,0.010489013,0.0030720066,0.0009099638,0.00056457985,0.0016084258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011615371,0.0008717323,0.0010172868,0.0024422503,0.0008274253,0.002960704,0.0015886356,0.0014535056,0.0030077395],"category_scores_gemma":[0.012878511,0.0006188762,0.0005144594,0.0031528987,0.0038666204,0.0081122145,0.0018581456,0.001902935,0.0005285131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010214935,0.00023133899,0.028474329,0.00046221423,0.0000938363,0.0007149822,0.0015931973,0.027608281,0.017042814,0.87014467,0.0070691267,0.045543697],"study_design_scores_gemma":[0.00007276322,0.00022439427,0.0134477895,0.00009703313,0.00006722108,0.0012057843,0.00052241597,0.043105815,0.0032635026,0.9298079,0.008094829,0.000090624584],"about_ca_topic_score_codex":0.0006028885,"about_ca_topic_score_gemma":0.0003492914,"teacher_disagreement_score":0.0030077395,"about_ca_system_score_codex":0.001134028,"about_ca_system_score_gemma":0.00029539387,"threshold_uncertainty_score":0.01006192},"labels":[],"label_agreement":null},{"id":"W2605957025","doi":"","title":"K-dominating sets of $P_(2k+2)\\times P_n$ and $P_m\\times P_n$","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Animal science; Biology","score_opus":0.014342453309719075,"score_gpt":0.2858869884345875,"score_spread":0.2715445351248684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605957025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.933383,0.0014231567,0.031799283,0.000884778,0.00010764491,0.00016382456,0.0031211383,0.00019618886,0.028920934],"genre_scores_gemma":[0.9350335,0.0012175315,0.047495678,0.0002407901,0.000115018745,0.00026279836,0.003888858,0.00017405713,0.011571844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908984,0.00016221155,0.00005099912,0.00026810152,0.0001872993,0.00024155165],"domain_scores_gemma":[0.99399287,0.0041037113,0.0006522336,0.00037702298,0.00033373662,0.0005404422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073094346,0.0008855758,0.0007120465,0.0012623667,0.0023435983,0.002175589,0.0012745375,0.0007714314,0.0063495054],"category_scores_gemma":[0.0047441144,0.000651209,0.0007885649,0.0011525172,0.0010037826,0.003088291,0.0013519782,0.0010415581,0.0009018346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005902324,0.0008612033,0.058177985,0.0029791156,0.00083948945,0.0034072618,0.0038254643,0.18416184,0.18024191,0.34265387,0.035972986,0.18097652],"study_design_scores_gemma":[0.00046102365,0.00063296006,0.06404864,0.00032757866,0.0006168693,0.012381593,0.0023294694,0.32417747,0.14117838,0.36395416,0.08958659,0.0003053557],"about_ca_topic_score_codex":0.0010761885,"about_ca_topic_score_gemma":0.002214072,"teacher_disagreement_score":0.0063495054,"about_ca_system_score_codex":0.0018421288,"about_ca_system_score_gemma":0.0007149063,"threshold_uncertainty_score":0.021241188},"labels":[],"label_agreement":null},{"id":"W2606086083","doi":"10.1016/j.jctb.2018.04.003","title":"Infinitely many excluded minors for frame matroids and for lifted-graphic matroids","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Class (philosophy); Combinatorics; Graphic matroid; Frame (networking); Mathematics; Computer science; Artificial intelligence","score_opus":0.021781755135505218,"score_gpt":0.3062087531804304,"score_spread":0.28442699804492516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606086083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7932476,0.000558536,0.14651747,0.0019244393,0.0003419536,0.00013171388,0.0007378583,0.00052285625,0.05601759],"genre_scores_gemma":[0.9403731,0.00049212,0.030363008,0.00047328978,0.000542446,0.00027802368,0.0017047297,0.0003065327,0.025466733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988489,0.00019980298,0.00007962225,0.00026931905,0.00028149344,0.00032085532],"domain_scores_gemma":[0.99702007,0.0011796884,0.00041284907,0.00025465427,0.00030681712,0.00082587416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092924817,0.0013388348,0.0015625042,0.0024865307,0.00412813,0.006658733,0.0019052224,0.0022094199,0.012277276],"category_scores_gemma":[0.00497333,0.0011368694,0.0019600808,0.0020591444,0.003308263,0.006342154,0.0033072678,0.004350531,0.0015418386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023793925,0.00012769658,0.0010279509,0.00009563121,0.000028441676,0.0004830034,0.0009410442,0.0012338612,0.0029807363,0.9804715,0.003323072,0.009049071],"study_design_scores_gemma":[0.00006151233,0.000039748196,0.0005261986,0.000023437731,0.00003730648,0.00033165555,0.0002798419,0.0067493105,0.0010416298,0.987498,0.0033807675,0.000030562267],"about_ca_topic_score_codex":0.0012433336,"about_ca_topic_score_gemma":0.0020741483,"teacher_disagreement_score":0.012277276,"about_ca_system_score_codex":0.0015827601,"about_ca_system_score_gemma":0.0008137189,"threshold_uncertainty_score":0.041071594},"labels":[],"label_agreement":null},{"id":"W2606103541","doi":"10.1142/s0218195916600013","title":"The Price of Order","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Order (exchange); Discrete mathematics; Graph","score_opus":0.013356323884241277,"score_gpt":0.32675577623270985,"score_spread":0.31339945234846855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606103541","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0615547,0.020460365,0.27840537,0.052042823,0.007892105,0.0001490959,0.001986127,0.002174542,0.57533485],"genre_scores_gemma":[0.700244,0.015715515,0.11072766,0.015956739,0.0071924916,0.00041430056,0.0018372978,0.003462504,0.1444494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950696,0.0010881219,0.00020594598,0.0010818422,0.0017550399,0.0007995108],"domain_scores_gemma":[0.97969604,0.009007093,0.0010737606,0.0065881144,0.002393231,0.0012417482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031229178,0.0015108299,0.0018767855,0.00172957,0.0038229143,0.008574834,0.0023354436,0.0028968041,0.042847708],"category_scores_gemma":[0.021045038,0.0010251758,0.0017421875,0.0026794078,0.007879983,0.026004564,0.0055554807,0.0094870655,0.0089719575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009164352,0.000024078612,0.00031547394,0.00011158116,0.000019343079,0.000076772834,0.00017605517,0.002164768,0.00037883813,0.96152216,0.017967915,0.017151287],"study_design_scores_gemma":[0.000023456772,0.000035209796,0.00015923746,0.000063254694,0.000017916369,0.000146649,0.00011273476,0.004081114,0.00046905963,0.92264336,0.07222613,0.000022018456],"about_ca_topic_score_codex":0.0037850365,"about_ca_topic_score_gemma":0.004408753,"teacher_disagreement_score":0.042847708,"about_ca_system_score_codex":0.0052818027,"about_ca_system_score_gemma":0.0022065497,"threshold_uncertainty_score":0.14333993},"labels":[],"label_agreement":null},{"id":"W2606500388","doi":"10.1016/j.dam.2018.01.007","title":"Minimal obstructions to 2-polar cographs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Cograph; Combinatorics; Mathematics; Induced subgraph; Partition (number theory); Disjoint sets; Split graph; Multipartite; Induced path; Discrete mathematics; Graph; Polar; Chordal graph; 1-planar graph; Longest path problem","score_opus":0.020745311594055366,"score_gpt":0.2972813654376966,"score_spread":0.27653605384364127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606500388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55545247,0.00086231675,0.16124007,0.004578114,0.0011228769,0.0001998012,0.001380692,0.0014904174,0.27367318],"genre_scores_gemma":[0.9149232,0.00060755503,0.020824103,0.00075453875,0.00040956205,0.00017492988,0.001356225,0.0006480185,0.06030178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903935,0.00017604305,0.00004543753,0.0001990897,0.00022524217,0.00031473913],"domain_scores_gemma":[0.9981997,0.00082082645,0.00016939963,0.00016774426,0.00016040576,0.00048181036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005291475,0.0010129123,0.0011943608,0.002814348,0.0040697493,0.0052437643,0.0012178081,0.002183991,0.019757403],"category_scores_gemma":[0.0025879398,0.001141021,0.001297678,0.0020503718,0.0038968376,0.0055546667,0.0064399173,0.0054030907,0.0026280007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007589527,0.000036594585,0.00021939755,0.000052672338,0.0000076050933,0.00021413626,0.0005214609,0.00046706182,0.0007770289,0.99263096,0.0021152708,0.00288187],"study_design_scores_gemma":[0.00003768881,0.000012533061,0.00026917655,0.000019560865,0.00001233606,0.00014136438,0.00031540354,0.0013195844,0.00058236474,0.99057794,0.00669861,0.000013580942],"about_ca_topic_score_codex":0.0013684833,"about_ca_topic_score_gemma":0.0019338285,"teacher_disagreement_score":0.019757403,"about_ca_system_score_codex":0.001276905,"about_ca_system_score_gemma":0.0006935516,"threshold_uncertainty_score":0.066095054},"labels":[],"label_agreement":null},{"id":"W2607431919","doi":"10.1016/j.dam.2017.03.004","title":"The game of Cops and Robber on circulant graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Mathematics; Circulant graph; Combinatorics; Wreath product; Discrete mathematics; Graph; Product (mathematics); Line graph; Voltage graph; Geometry","score_opus":0.02411534211884052,"score_gpt":0.29690292364961196,"score_spread":0.27278758153077143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607431919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47994587,0.0009970971,0.29897952,0.008188661,0.00053806975,0.00045065736,0.000937202,0.0005411982,0.20942165],"genre_scores_gemma":[0.9303758,0.00047611658,0.027335588,0.0005767913,0.00019328897,0.00022787652,0.00031850647,0.00018739338,0.040308595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715424,0.0014201079,0.00007293289,0.00035029094,0.00038672247,0.0006156833],"domain_scores_gemma":[0.99223834,0.0051489575,0.0004099313,0.00061773113,0.00037255854,0.0012123944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002018104,0.0013097404,0.0022727328,0.0010967839,0.0027165185,0.005080608,0.002943886,0.005152664,0.0124557875],"category_scores_gemma":[0.01405861,0.0008988707,0.0009752812,0.0012380955,0.0038056383,0.0063571753,0.002761579,0.0032082943,0.0010383748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000275892,0.00006943783,0.00019746448,0.00008670323,0.000032177693,0.0001573749,0.00022069781,0.0323252,0.0008712683,0.95299834,0.007296299,0.0054692356],"study_design_scores_gemma":[0.00008035185,0.000047795504,0.00013963463,0.000021226,0.000017639986,0.00007289911,0.00015340297,0.15708381,0.00033174755,0.83827114,0.0037524959,0.000027827497],"about_ca_topic_score_codex":0.008600654,"about_ca_topic_score_gemma":0.007601897,"teacher_disagreement_score":0.0124557875,"about_ca_system_score_codex":0.002982307,"about_ca_system_score_gemma":0.0027177073,"threshold_uncertainty_score":0.041668773},"labels":[],"label_agreement":null},{"id":"W2608271081","doi":"10.1016/j.disc.2018.03.026","title":"On 1-uniqueness and dense critical graphs for tree-depth","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Uniqueness; Conjecture; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.03676595863659552,"score_gpt":0.35349044696105836,"score_spread":0.3167244883244628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608271081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5018837,0.0045528677,0.37655878,0.0075426702,0.0005708212,0.00023430356,0.0008685539,0.0004968167,0.10729147],"genre_scores_gemma":[0.92291105,0.0020349578,0.04808897,0.0015478261,0.000730652,0.00024189503,0.0008168844,0.00045953406,0.023168268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884087,0.00032926822,0.000054301985,0.0003432387,0.0002036852,0.00022867812],"domain_scores_gemma":[0.9899042,0.0068875896,0.0009028496,0.0004984303,0.00072407455,0.0010827853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002253753,0.0014383977,0.0017648898,0.0044228756,0.004612194,0.0043873554,0.002806473,0.0032597587,0.011197085],"category_scores_gemma":[0.016748112,0.0014404579,0.0017268651,0.0028316234,0.0073621618,0.014664729,0.0061460966,0.0062190345,0.0008127902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003686995,0.000019450232,0.00039137914,0.00006830413,0.000008551376,0.00006339417,0.00045637577,0.001276483,0.00036374797,0.9936526,0.0010269415,0.002635909],"study_design_scores_gemma":[0.0000091871025,0.000007789746,0.00015876367,0.00001882091,0.000009095314,0.00005501821,0.0001388999,0.0028327513,0.00012986812,0.9957431,0.00088625733,0.000010393389],"about_ca_topic_score_codex":0.0022203804,"about_ca_topic_score_gemma":0.0032013964,"teacher_disagreement_score":0.011197085,"about_ca_system_score_codex":0.0024774075,"about_ca_system_score_gemma":0.0012318175,"threshold_uncertainty_score":0.037458003},"labels":[],"label_agreement":null},{"id":"W2612340482","doi":"","title":"The upper vertex detour monophonic number of a graph.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Graph","score_opus":0.015572685197471878,"score_gpt":0.30079238006768977,"score_spread":0.28521969487021787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612340482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62682796,0.00080597465,0.06478722,0.0027010369,0.0011406677,0.00008392172,0.0020541137,0.0007547058,0.30084443],"genre_scores_gemma":[0.9470132,0.0004526449,0.013225063,0.00034934297,0.00030544103,0.00009287837,0.0007490158,0.00018858585,0.037623722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939966,0.000119957906,0.000027369993,0.000120279685,0.00015551681,0.00017726059],"domain_scores_gemma":[0.9980136,0.0008215356,0.00022816232,0.00024547256,0.0002301958,0.00046092825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004432495,0.000552082,0.00054545805,0.002668388,0.0018854844,0.0025370582,0.0010210567,0.0011539327,0.019215679],"category_scores_gemma":[0.0029761798,0.00022940083,0.0003540107,0.0012059525,0.0019082525,0.0024327554,0.0014812124,0.0015276537,0.0032426696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003348709,0.00006498892,0.0012706394,0.00016112534,0.000020645117,0.0003154353,0.0004065877,0.001911172,0.010718031,0.94424254,0.009265264,0.031288914],"study_design_scores_gemma":[0.000039597977,0.0000895951,0.0028400922,0.00010019698,0.0000372308,0.00072823424,0.0003124815,0.011395569,0.0074479077,0.94654953,0.030403119,0.000056447836],"about_ca_topic_score_codex":0.0009137927,"about_ca_topic_score_gemma":0.0013821088,"teacher_disagreement_score":0.019215679,"about_ca_system_score_codex":0.0008407367,"about_ca_system_score_gemma":0.00052993314,"threshold_uncertainty_score":0.064282835},"labels":[],"label_agreement":null},{"id":"W2612445428","doi":"","title":"Strongly Connected Components in graphs, formal proof of Tarjan1972 algorithm","year":2016,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Algorithm; Theoretical computer science","score_opus":0.02896939037415305,"score_gpt":0.262117333551516,"score_spread":0.23314794317736295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612445428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0229564,0.0010123542,0.9314109,0.0028583903,0.0004044579,0.00030915573,0.0005294368,0.0023606597,0.038158245],"genre_scores_gemma":[0.26005846,0.0016707368,0.7090066,0.0010263827,0.00032005872,0.00082513026,0.0010302725,0.000908804,0.025153497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841654,0.00037024944,0.0000925741,0.0003481001,0.0006180038,0.00015460205],"domain_scores_gemma":[0.9950192,0.0031210822,0.00018675013,0.00057473074,0.0009373982,0.00016083413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023425182,0.0010077707,0.00048547942,0.0019904454,0.0016078562,0.0025728398,0.0017110802,0.0011706799,0.012110084],"category_scores_gemma":[0.011375301,0.0010630859,0.0018482051,0.0014749342,0.0039792187,0.0038765527,0.0030315234,0.004021401,0.002096219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093963965,0.00014626082,0.0008436538,0.0004207548,0.000031556643,0.0003537138,0.0011124365,0.013327029,0.0057050325,0.91383445,0.0103684105,0.05376264],"study_design_scores_gemma":[0.00013884905,0.00012742514,0.0009030566,0.00027008183,0.000069095884,0.00046561376,0.00030211333,0.051687792,0.012836272,0.8488411,0.08428674,0.000071978524],"about_ca_topic_score_codex":0.0040461975,"about_ca_topic_score_gemma":0.0060460577,"teacher_disagreement_score":0.012110084,"about_ca_system_score_codex":0.002198396,"about_ca_system_score_gemma":0.003042447,"threshold_uncertainty_score":0.040512264},"labels":[],"label_agreement":null},{"id":"W2612680057","doi":"","title":"On the monophonic sets of the strong product graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Combinatorics; Geometry","score_opus":0.025582562171351,"score_gpt":0.29246198838400117,"score_spread":0.26687942621265015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612680057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47509927,0.0023745594,0.2718774,0.0037025842,0.00074895355,0.00011153376,0.0010315304,0.00045465425,0.2445996],"genre_scores_gemma":[0.9270181,0.0010818373,0.03462935,0.0009480973,0.0006800424,0.00015087794,0.0007233752,0.00024973144,0.03451855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989077,0.0003604594,0.000054205862,0.00021708205,0.00026611786,0.00019443863],"domain_scores_gemma":[0.99667656,0.001918448,0.00035520122,0.0003844984,0.000264925,0.00040025456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009315654,0.00062241347,0.00081199396,0.0024513295,0.002589006,0.002591338,0.0013059872,0.0014101805,0.012665384],"category_scores_gemma":[0.004027389,0.00075628795,0.0010583608,0.0014299728,0.003362123,0.0059498027,0.0032934507,0.0025040063,0.0017017679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033530512,0.00001481913,0.0001307767,0.000031156917,0.000006260242,0.000059364324,0.00014831906,0.0005249058,0.0005624203,0.9929877,0.0012448662,0.004255846],"study_design_scores_gemma":[0.000008460779,0.000010816807,0.00016903816,0.00001694689,0.000006279092,0.0000915108,0.000059006787,0.00239578,0.00026590138,0.9947778,0.0021900965,0.000008341866],"about_ca_topic_score_codex":0.000836374,"about_ca_topic_score_gemma":0.0011597443,"teacher_disagreement_score":0.012665384,"about_ca_system_score_codex":0.0010760111,"about_ca_system_score_gemma":0.00045360168,"threshold_uncertainty_score":0.04236996},"labels":[],"label_agreement":null},{"id":"W2612960494","doi":"","title":"Locating and differentiating-total dominating sets in unicyclic graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; Graph","score_opus":0.018250348461669817,"score_gpt":0.2988495086141311,"score_spread":0.2805991601524613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612960494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6467774,0.0022431698,0.2719614,0.0018692949,0.00022531266,0.0002785948,0.0015776968,0.00087815314,0.07418907],"genre_scores_gemma":[0.8987313,0.0011101081,0.07093378,0.00030036573,0.00008822227,0.00012387901,0.0012053949,0.00015372786,0.02735331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990934,0.00018715482,0.000063377054,0.00026656184,0.00021761953,0.0001719453],"domain_scores_gemma":[0.99288815,0.0036060128,0.000924164,0.0011522421,0.00074223126,0.0006871719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007569762,0.0006105222,0.00086660916,0.0016261595,0.0016831036,0.0024154957,0.0020121788,0.0011996101,0.0049684932],"category_scores_gemma":[0.009891262,0.000776013,0.0005843889,0.0022312128,0.0018068461,0.0033256444,0.002763849,0.0012986653,0.001166434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005429833,0.00016625844,0.0065550273,0.000841669,0.000085607564,0.001250344,0.0018117386,0.03056709,0.015028093,0.830631,0.011722886,0.100797415],"study_design_scores_gemma":[0.000099951736,0.0001492571,0.0020979797,0.00019747064,0.0001319378,0.0029984238,0.0013900315,0.050432418,0.015967645,0.905906,0.02057212,0.000056815057],"about_ca_topic_score_codex":0.001323807,"about_ca_topic_score_gemma":0.0024915424,"teacher_disagreement_score":0.0049684932,"about_ca_system_score_codex":0.0012830342,"about_ca_system_score_gemma":0.00074385985,"threshold_uncertainty_score":0.016621292},"labels":[],"label_agreement":null},{"id":"W2613720717","doi":"10.1016/j.dam.2018.09.037","title":"Solving the clique cover problem on (bull, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e19\" altimg=\"si5.gif\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs","year":2018,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Cover (algebra); Mathematics; Graph; Clique; Discrete mathematics","score_opus":0.019581381596273616,"score_gpt":0.25814978523491006,"score_spread":0.23856840363863643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613720717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2962575,0.0012346009,0.52908486,0.0109256115,0.0006395558,0.0011192764,0.016417667,0.003935816,0.1403851],"genre_scores_gemma":[0.5569058,0.0008015745,0.3569371,0.0011958733,0.00037898653,0.00046907566,0.017088331,0.0014543529,0.064768896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998914,0.00030265583,0.000027840602,0.00032887052,0.00018957535,0.0002369918],"domain_scores_gemma":[0.99485296,0.0039746393,0.00018338217,0.0004696343,0.00027868678,0.00024068149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011750126,0.001110239,0.001018567,0.00088780536,0.0018989433,0.0024510263,0.0016594059,0.0018881848,0.031071698],"category_scores_gemma":[0.008117534,0.00053629454,0.0013930034,0.0016409813,0.0010251235,0.0032698633,0.0017001032,0.0020195981,0.0031632865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012239781,0.0007986415,0.003937584,0.0017608133,0.0004239438,0.0009727594,0.0010524628,0.25647065,0.008235151,0.24897721,0.25455955,0.22158736],"study_design_scores_gemma":[0.00035280717,0.00021682859,0.0018476723,0.00013310277,0.00016127752,0.00043553655,0.0005758894,0.355859,0.005902455,0.59488547,0.039586566,0.000043289892],"about_ca_topic_score_codex":0.008383053,"about_ca_topic_score_gemma":0.019961962,"teacher_disagreement_score":0.031071698,"about_ca_system_score_codex":0.0015508832,"about_ca_system_score_gemma":0.0025335527,"threshold_uncertainty_score":0.103945196},"labels":[],"label_agreement":null},{"id":"W2613721126","doi":"","title":"The orientable genus of the generalized Petersen graph P(km, m).","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Combinatorics; Petersen graph; Graph; Botany; Line graph; Biology; Voltage graph","score_opus":0.01885727857213785,"score_gpt":0.2842798774385462,"score_spread":0.26542259886640834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613721126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7962793,0.0010038624,0.020827847,0.0015566166,0.00036123022,0.000039099832,0.0005601046,0.00031576108,0.17905621],"genre_scores_gemma":[0.987186,0.0004189752,0.0028528757,0.000117531,0.000088523346,0.000020532761,0.00018987554,0.00007651776,0.009049131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998398,0.000029487745,0.0000046350424,0.000040130108,0.000041384552,0.000044526314],"domain_scores_gemma":[0.9997023,0.0000864342,0.00008226023,0.000031220614,0.000027852877,0.00006991182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012894267,0.0005506129,0.00031904114,0.0015414107,0.0011490099,0.001719824,0.0005598942,0.0008104611,0.00862693],"category_scores_gemma":[0.001040481,0.00031148858,0.0002748545,0.0006992252,0.0017521023,0.0017637535,0.0015861501,0.001169008,0.0011055561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120203295,0.000024157593,0.0022222525,0.000114845345,0.00002207806,0.0006226286,0.00057799683,0.004644559,0.0054273424,0.9584102,0.0059022116,0.021911513],"study_design_scores_gemma":[0.000023844977,0.000035145542,0.00556187,0.0000792073,0.000035150708,0.00094240624,0.000656666,0.013202193,0.002418028,0.96207523,0.014940875,0.000029459588],"about_ca_topic_score_codex":0.0011053502,"about_ca_topic_score_gemma":0.0012270409,"teacher_disagreement_score":0.00862693,"about_ca_system_score_codex":0.0006097935,"about_ca_system_score_gemma":0.0003019261,"threshold_uncertainty_score":0.028859973},"labels":[],"label_agreement":null},{"id":"W2616398144","doi":"10.5539/jmr.v9n3p38","title":"The [a,b]-domination and [a,b]-total Domination of Graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chengdu University","keywords":"Domination analysis; Mathematics; Combinatorics; Vertex (graph theory); Dominating set; Row; Graph; Discrete mathematics","score_opus":0.08169630544752136,"score_gpt":0.4265267107685333,"score_spread":0.34483040532101195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616398144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8173021,0.0018879679,0.13510288,0.0015744603,0.000086054024,0.00022502133,0.0034716886,0.00041536384,0.039934494],"genre_scores_gemma":[0.9365703,0.0010952915,0.05414152,0.00021790511,0.000083128376,0.0002031004,0.0022936433,0.00006515233,0.005329799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869424,0.00032502954,0.000102922924,0.00032854147,0.00028603856,0.00026309298],"domain_scores_gemma":[0.99661595,0.0018150345,0.00049673615,0.00035264032,0.00036862007,0.00035095328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061046693,0.0005472017,0.00053404144,0.0012235193,0.0015008157,0.0020188938,0.0011549983,0.00063206285,0.0025241782],"category_scores_gemma":[0.003435728,0.00044931672,0.0006428638,0.0021270057,0.0016353055,0.0028166277,0.0010992734,0.00085237494,0.00025479912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015845147,0.00035575146,0.024694517,0.0013652703,0.00036143578,0.0009832951,0.002642958,0.19331849,0.048887596,0.5318078,0.023179445,0.17081891],"study_design_scores_gemma":[0.0001919822,0.00023604397,0.016669724,0.00017670635,0.00018186356,0.0023252654,0.001552268,0.25713012,0.01754504,0.65533304,0.0485305,0.0001275226],"about_ca_topic_score_codex":0.006123904,"about_ca_topic_score_gemma":0.006044198,"teacher_disagreement_score":0.006123904,"about_ca_system_score_codex":0.0015144518,"about_ca_system_score_gemma":0.0010368619,"threshold_uncertainty_score":0.012176514},"labels":[],"label_agreement":null},{"id":"W2617479596","doi":"10.1016/j.tcs.2017.05.018","title":"The entire chromatic number of graphs embedded on the torus with large maximum degree","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Torus; Combinatorics; Mathematics; Graph; Colored; Degree (music); Chromatic scale; Edge coloring; Discrete mathematics; Graph power; Physics; Geometry; Line graph","score_opus":0.023421179190116572,"score_gpt":0.3095576618514181,"score_spread":0.28613648266130154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617479596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97777486,0.00027016335,0.0069874907,0.0006107346,0.000038770497,0.000009228142,0.0004981743,0.00014658789,0.013663951],"genre_scores_gemma":[0.99521023,0.0001844777,0.0018164475,0.000047099693,0.000044416276,0.000018212,0.00035525212,0.000065251785,0.002258751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997981,0.00004423104,0.0000058673354,0.000057422545,0.00003913316,0.000055318444],"domain_scores_gemma":[0.99660057,0.0018767938,0.0005294659,0.0002471012,0.00025950003,0.0004866132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039861017,0.00039114195,0.00033228067,0.001914807,0.0010949892,0.0016008797,0.0009259753,0.0006707093,0.006770248],"category_scores_gemma":[0.003430279,0.00040000086,0.00024392283,0.0010550447,0.0017275253,0.0024118759,0.0008350429,0.0006509728,0.00036573905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002831406,0.00021901976,0.027219135,0.0006990305,0.00017605623,0.0008420065,0.0015926294,0.26932153,0.07020385,0.567222,0.021706259,0.037967175],"study_design_scores_gemma":[0.00020199837,0.00020928487,0.030965852,0.00012612173,0.00014702087,0.00073571166,0.0012111283,0.46805045,0.013995472,0.4776116,0.0066519473,0.00009330361],"about_ca_topic_score_codex":0.0026490376,"about_ca_topic_score_gemma":0.004024739,"teacher_disagreement_score":0.006770248,"about_ca_system_score_codex":0.0011082767,"about_ca_system_score_gemma":0.0005668544,"threshold_uncertainty_score":0.022648752},"labels":[],"label_agreement":null},{"id":"W2619788868","doi":"10.1007/978-3-319-59250-3_23","title":"Min-Max Theorems for Packing and Covering Odd (u, v)-trails","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Disjoint sets; Cover (algebra); Mathematics; Vertex (graph theory); Graph; Upper and lower bounds; Vertex cover; Packing problems","score_opus":0.03460716648484819,"score_gpt":0.33221708495910884,"score_spread":0.29760991847426066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619788868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18677166,0.0034213462,0.6664425,0.0047231754,0.00064840657,0.00018568285,0.0025009974,0.0012614916,0.13404474],"genre_scores_gemma":[0.79829127,0.00378068,0.13947695,0.0015599784,0.0011881256,0.0005892613,0.0026408432,0.0019810572,0.050491843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998247,0.00038960436,0.00010527994,0.00041575576,0.00041859157,0.0004237044],"domain_scores_gemma":[0.9930676,0.0044733277,0.0004950925,0.0008444406,0.00047207196,0.0006474767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002741029,0.002408796,0.0021661741,0.0031260832,0.0029843708,0.007511726,0.0039325557,0.0018274342,0.016127566],"category_scores_gemma":[0.011001725,0.0017217557,0.0027200838,0.0040669558,0.0036474299,0.0149471,0.005236476,0.006015767,0.001983908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002069456,0.00006355814,0.0006300347,0.000236835,0.000042854797,0.00008989826,0.00035835322,0.006573072,0.0012343319,0.9629678,0.007972934,0.019623451],"study_design_scores_gemma":[0.000017502252,0.00001912024,0.00018979328,0.000028596734,0.000028804836,0.000073102565,0.00006234585,0.0127783585,0.0006538025,0.9834589,0.002677072,0.0000125589395],"about_ca_topic_score_codex":0.001512267,"about_ca_topic_score_gemma":0.0019459272,"teacher_disagreement_score":0.016127566,"about_ca_system_score_codex":0.0031298492,"about_ca_system_score_gemma":0.0015402393,"threshold_uncertainty_score":0.05395204},"labels":[],"label_agreement":null},{"id":"W2621197517","doi":"10.1007/s00453-017-0328-y","title":"On the Planar Split Thickness of Graphs","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Victoria; University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Planar graph; 1-planar graph; Planar straight-line graph; Outerplanar graph; Bipartite graph; Planar; Book embedding; Treewidth","score_opus":0.029007367667131502,"score_gpt":0.2991719772455107,"score_spread":0.2701646095783792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621197517","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67603034,0.005344245,0.19803423,0.0058489144,0.0007713372,0.0001097591,0.0012124681,0.00050131115,0.11214745],"genre_scores_gemma":[0.8970302,0.005334577,0.060391344,0.0008419383,0.0014134534,0.00021334889,0.0013665459,0.0008134072,0.032595217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901366,0.00027774708,0.00004126877,0.00018634184,0.00027428902,0.00020660456],"domain_scores_gemma":[0.99157715,0.005304288,0.0010166548,0.0006570646,0.0005752695,0.0008694822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015653126,0.0013622125,0.0012706878,0.003665502,0.0015451317,0.0033437063,0.002785765,0.0017979607,0.017017337],"category_scores_gemma":[0.015181774,0.0014302179,0.00092948717,0.0033086608,0.004413496,0.0104185445,0.004619847,0.0044976985,0.0019682287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042767805,0.00007200852,0.0043207696,0.00034385532,0.0000728124,0.0003335948,0.001053506,0.030530207,0.004835556,0.9011323,0.009743069,0.047134697],"study_design_scores_gemma":[0.000048092694,0.000054377688,0.0021528453,0.000101386584,0.00006504335,0.00027546982,0.0004910573,0.039640572,0.0013291901,0.94892937,0.0068781814,0.000034377117],"about_ca_topic_score_codex":0.0015007543,"about_ca_topic_score_gemma":0.0015782613,"teacher_disagreement_score":0.017017337,"about_ca_system_score_codex":0.0016421182,"about_ca_system_score_gemma":0.00071141846,"threshold_uncertainty_score":0.056928635},"labels":[],"label_agreement":null},{"id":"W2623222487","doi":"","title":"Valid inequalities and separation algorithms for the set partitioning problem","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Solver; Set (abstract data type); Mathematics; Cutting-plane method; Mathematical optimization; Algorithm; Clique; Inequality; Computer science; Combinatorics; Integer programming","score_opus":0.03367840485521143,"score_gpt":0.311213719513426,"score_spread":0.27753531465821457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623222487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004055728,0.00043734393,0.9883433,0.00052486977,0.00007815306,0.00011474453,0.00015385707,0.00021060958,0.006081493],"genre_scores_gemma":[0.09174517,0.0013598736,0.8973087,0.00041732204,0.00019092116,0.00042196456,0.0012289851,0.0003442416,0.0069829295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955819,0.0017604656,0.0002344568,0.00063250744,0.0013440443,0.00044662086],"domain_scores_gemma":[0.9919064,0.006204104,0.00057824585,0.00055703305,0.00056424807,0.00018994237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039854296,0.0023293886,0.0011715367,0.0014663412,0.0013226874,0.0033167405,0.0032719295,0.0015755608,0.008797552],"category_scores_gemma":[0.0135802785,0.0011963295,0.0022618705,0.003146087,0.0017112007,0.0057485565,0.0029785635,0.007101762,0.0015841413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022794005,0.0003151091,0.00047836232,0.0005627227,0.00012398843,0.00015456001,0.00030701453,0.23727183,0.0033687372,0.5482648,0.010429074,0.19849591],"study_design_scores_gemma":[0.00011370554,0.00008042986,0.00018152046,0.0000962948,0.000057903835,0.0001142899,0.00008823018,0.59527165,0.002774424,0.39081535,0.010375604,0.000030652824],"about_ca_topic_score_codex":0.0033000752,"about_ca_topic_score_gemma":0.0051078205,"teacher_disagreement_score":0.008797552,"about_ca_system_score_codex":0.0026991358,"about_ca_system_score_gemma":0.002719636,"threshold_uncertainty_score":0.029430747},"labels":[],"label_agreement":null},{"id":"W2624330451","doi":"","title":"Variable Neighborhood Search for Extremal Graphs: 5. Three Ways to Automate Finding Conjectures","year":2000,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Variable neighborhood search; Heuristic; Variable (mathematics); Mathematics; Algebraic number; Series (stratigraphy); Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Metaheuristic","score_opus":0.024638150233571892,"score_gpt":0.2699066596012974,"score_spread":0.2452685093677255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624330451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.143517,0.0002735441,0.8405685,0.0007171194,0.000043594056,0.0001613658,0.00021469065,0.0025527007,0.011951489],"genre_scores_gemma":[0.45856836,0.00013604735,0.53666824,0.00014298737,0.00003634514,0.00017279606,0.00048019394,0.0003125519,0.0034824118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980798,0.00072042714,0.000094594194,0.00045345453,0.0004439022,0.00020785385],"domain_scores_gemma":[0.99393266,0.0029407346,0.00041242113,0.0020227425,0.00048615682,0.00020519143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023086327,0.00051900966,0.001143942,0.0016799802,0.0012205965,0.0024591754,0.0024526615,0.0011501482,0.0066719265],"category_scores_gemma":[0.007999769,0.00048757446,0.0009884844,0.001118736,0.002858212,0.0038270568,0.002944555,0.0011909747,0.0010254323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000825941,0.0003854118,0.02039731,0.00055382005,0.00014360779,0.0002387355,0.0011495665,0.06193022,0.01739655,0.644676,0.0061043235,0.24619853],"study_design_scores_gemma":[0.00016469251,0.00019992248,0.0027945507,0.00007830749,0.000061627485,0.00035278234,0.0004947293,0.4605485,0.02413275,0.50334215,0.0077447724,0.00008525121],"about_ca_topic_score_codex":0.0013593024,"about_ca_topic_score_gemma":0.0027394434,"teacher_disagreement_score":0.0066719265,"about_ca_system_score_codex":0.0008668086,"about_ca_system_score_gemma":0.001042975,"threshold_uncertainty_score":0.022319853},"labels":[],"label_agreement":null},{"id":"W2625770470","doi":"","title":"The Largest Small Octagon","year":2001,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Quadratic growth; Combinatorics; Conjecture; Mathematics; Unit (ring theory); Quadratic equation; Discrete mathematics; Algorithm; Geometry; Mathematics education","score_opus":0.024866541822454145,"score_gpt":0.26823908615889047,"score_spread":0.24337254433643632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625770470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4525281,0.0044485885,0.3904686,0.0047330707,0.00079719396,0.00018478818,0.0019241264,0.0013373335,0.14357819],"genre_scores_gemma":[0.86303633,0.0010968498,0.09385997,0.0005527096,0.00023355037,0.0000923718,0.0010351373,0.00042181273,0.039671317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996369,0.00008002724,0.000013456091,0.000115167466,0.00008563395,0.00006870173],"domain_scores_gemma":[0.99924743,0.0002776449,0.000096601114,0.00012971561,0.00010742218,0.00014117672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023598029,0.00044468758,0.0007281521,0.0007851764,0.0011261925,0.0022964943,0.000669793,0.001085509,0.012252534],"category_scores_gemma":[0.0025054237,0.00054963503,0.0005012395,0.00059665483,0.001562133,0.0022188956,0.0015498823,0.0015629237,0.0017680884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006052385,0.00010322603,0.0029645406,0.00046989997,0.000033526398,0.00047839628,0.00041308606,0.034313977,0.015984287,0.75920266,0.033167493,0.15226357],"study_design_scores_gemma":[0.000073265124,0.00012266709,0.0015396578,0.00010448635,0.000023110268,0.0005390886,0.00038025307,0.090835795,0.00738754,0.8413864,0.05756369,0.00004402387],"about_ca_topic_score_codex":0.0014642942,"about_ca_topic_score_gemma":0.001931596,"teacher_disagreement_score":0.012252534,"about_ca_system_score_codex":0.00046679782,"about_ca_system_score_gemma":0.00051137246,"threshold_uncertainty_score":0.040988803},"labels":[],"label_agreement":null},{"id":"W2626158319","doi":"","title":"A Learning Optimization Algorithm in Graph Theory. Versatile Search for Extremal Graphs Using a Learning Algorithm","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Algorithm; Variable neighborhood search; Heuristic; Computer science; Feature (linguistics); Optimization problem; Extremal optimization; Graph; Mathematics; Invariant (physics); Mathematical optimization; Theoretical computer science; Metaheuristic; Meta-optimization","score_opus":0.016419768284362,"score_gpt":0.2747208318595703,"score_spread":0.2583010635752083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626158319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001636469,0.00028458677,0.9959459,0.00012176147,0.000030859548,0.000040992236,0.000033313205,0.0003398128,0.0015662337],"genre_scores_gemma":[0.05692541,0.00038282978,0.93889034,0.00017987544,0.00009013809,0.00027971494,0.0002034525,0.00022656759,0.0028216618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919206,0.0003362683,0.000040979034,0.00017884505,0.00020675224,0.000045077886],"domain_scores_gemma":[0.9988348,0.00077819184,0.0000831009,0.00013152265,0.00013378201,0.000038532457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015348874,0.0011580383,0.001323577,0.0014257032,0.00073142216,0.0010936981,0.0014864102,0.0015148578,0.003830727],"category_scores_gemma":[0.003977463,0.00070084806,0.0010881091,0.0017095146,0.0014989745,0.0016458671,0.0016939451,0.0021147693,0.0014062726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011557199,0.00012565863,0.000985383,0.0003068707,0.00017521738,0.000085123545,0.00013856053,0.48305112,0.0030206472,0.12891258,0.009078287,0.37400493],"study_design_scores_gemma":[0.000037634785,0.00006192685,0.00015501665,0.000030334104,0.000018152297,0.000053555566,0.00001436699,0.9157287,0.0009373728,0.0784408,0.00450784,0.00001430222],"about_ca_topic_score_codex":0.0018422488,"about_ca_topic_score_gemma":0.0020418318,"teacher_disagreement_score":0.003830727,"about_ca_system_score_codex":0.0008503825,"about_ca_system_score_gemma":0.0010966203,"threshold_uncertainty_score":0.012815058},"labels":[],"label_agreement":null},{"id":"W2626630915","doi":"10.1016/j.tcs.2017.12.024","title":"New results on edge partitions of 1-plane graphs","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cubic graph; Planar graph; Distance-regular graph; Regular graph; Graph power; Vertex (graph theory); Discrete mathematics; Complement graph; Butterfly graph; Line graph; Graph; Voltage graph","score_opus":0.0309586809723489,"score_gpt":0.32480655874926573,"score_spread":0.29384787777691684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626630915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39329177,0.008005442,0.43804926,0.0045313626,0.0013475376,0.00034191893,0.0032578674,0.0010874876,0.15008742],"genre_scores_gemma":[0.7098881,0.008314915,0.21537478,0.0031172626,0.0029434618,0.0006868673,0.0069415737,0.0018930832,0.050839875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811804,0.00043084798,0.00010451171,0.00051297405,0.00047071488,0.00036301735],"domain_scores_gemma":[0.9910278,0.005664866,0.0008639928,0.001076848,0.0005395942,0.0008269727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012841999,0.002018863,0.0019893688,0.00429898,0.0032495337,0.006462185,0.0042688525,0.0021482909,0.01744519],"category_scores_gemma":[0.008109191,0.0016705412,0.001996155,0.006671519,0.0036019664,0.0125340205,0.004569865,0.006946265,0.0023005763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074451294,0.00033938358,0.0027271977,0.00081411796,0.00012542856,0.0003220616,0.0016730115,0.019218732,0.0075973608,0.8888774,0.023017824,0.054542936],"study_design_scores_gemma":[0.00007620355,0.00009266929,0.002061469,0.00011501641,0.000117828415,0.00039091444,0.0006386572,0.025667854,0.0017655479,0.95154124,0.017488252,0.00004441583],"about_ca_topic_score_codex":0.0013416716,"about_ca_topic_score_gemma":0.001782181,"teacher_disagreement_score":0.01744519,"about_ca_system_score_codex":0.0015997094,"about_ca_system_score_gemma":0.00057947886,"threshold_uncertainty_score":0.05835992},"labels":[],"label_agreement":null},{"id":"W2627073450","doi":"","title":"Integral Simplex Using Decomposition for the Set Partitioning Problem","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Simplex; Sequence (biology); Mathematics; Simplex algorithm; Degeneracy (biology); Constructive; Mathematical optimization; Polytope; Integer (computer science); Set (abstract data type); Combinatorics; Decomposition; Variable (mathematics); Revised simplex method; Algorithm; Linear programming; Computer science; Mathematical analysis","score_opus":0.028016135409146208,"score_gpt":0.3056867098088424,"score_spread":0.27767057439969617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2627073450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010748774,0.00032469834,0.9776177,0.00013253654,0.000038809205,0.00008838281,0.00009866974,0.00018654324,0.0107638845],"genre_scores_gemma":[0.13799804,0.0007816096,0.85498464,0.00009051914,0.000056791418,0.00035344594,0.00043469452,0.00022505784,0.0050751753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914694,0.0002717395,0.000030112158,0.000093949995,0.0003554548,0.00010185383],"domain_scores_gemma":[0.9993973,0.00034304478,0.000045745524,0.00007876817,0.000090355104,0.000044904467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087638997,0.0009331151,0.0009908689,0.0010640104,0.0005732679,0.0013072286,0.0010562711,0.00075991644,0.005387784],"category_scores_gemma":[0.0026660871,0.00044984705,0.0010121327,0.0017577108,0.0008548004,0.0014451095,0.0015480894,0.0023768637,0.0012532216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015197683,0.00016047727,0.00049440475,0.00029857637,0.000057031437,0.00012645377,0.00018496477,0.5497952,0.006500272,0.25994593,0.0061186245,0.1761661],"study_design_scores_gemma":[0.000026314732,0.000048669543,0.000116198426,0.00003009648,0.00001560185,0.000094976065,0.000033103606,0.9018667,0.0020485944,0.08838572,0.007320905,0.000013090875],"about_ca_topic_score_codex":0.0020851207,"about_ca_topic_score_gemma":0.0023463068,"teacher_disagreement_score":0.005387784,"about_ca_system_score_codex":0.0009453375,"about_ca_system_score_gemma":0.0011409203,"threshold_uncertainty_score":0.018023908},"labels":[],"label_agreement":null},{"id":"W2650918751","doi":"10.1007/978-3-540-28639-4_17","title":"Simplifying the Weft Hierarchy","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Hierarchy; Normalization (sociology); Monotone polygon; Simple (philosophy); Computer science; Discrete mathematics; Calculus (dental); Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics; Geometry; Philosophy; Epistemology","score_opus":0.02571374060812506,"score_gpt":0.28915049709039936,"score_spread":0.2634367564822743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2650918751","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051007055,0.002747267,0.24049233,0.0045572273,0.00095481455,0.00005125514,0.0002977671,0.0012497364,0.6986427],"genre_scores_gemma":[0.6616961,0.003923028,0.10050805,0.0013762228,0.0008233577,0.00010288688,0.00067053194,0.0015952698,0.22930461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949765,0.000094292605,0.000018689969,0.000090150104,0.00016749722,0.00013162878],"domain_scores_gemma":[0.9992969,0.0001766888,0.000037145746,0.00031268,0.000103317136,0.00007324815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000378685,0.00059329433,0.0008242661,0.0010621252,0.0023728667,0.002133721,0.0013256826,0.001013824,0.025308212],"category_scores_gemma":[0.0019871811,0.0005255976,0.0008906378,0.0011675073,0.003124764,0.00797489,0.0034021258,0.004296517,0.0065264404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016031605,0.000013405015,0.000036715574,0.00002939098,0.0000032085047,0.000027847687,0.00017127111,0.00049363583,0.00046120235,0.9773032,0.007053479,0.0143906],"study_design_scores_gemma":[0.000006553227,0.000005675739,0.000037608468,0.000017617589,0.000004628036,0.000047271784,0.0000595488,0.0016739146,0.00030763343,0.97081953,0.027014362,0.000005682493],"about_ca_topic_score_codex":0.0024338865,"about_ca_topic_score_gemma":0.003880532,"teacher_disagreement_score":0.025308212,"about_ca_system_score_codex":0.0013396261,"about_ca_system_score_gemma":0.00066037255,"threshold_uncertainty_score":0.084664464},"labels":[],"label_agreement":null},{"id":"W26810115","doi":"","title":"Panpositionable Hamiltonian Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009376700706981624,"score_gpt":0.24881460989277235,"score_spread":0.23943790918579072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26810115","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19359437,0.002440203,0.2113901,0.0029261387,0.0010646879,0.00016479335,0.0030254025,0.0013050217,0.5840893],"genre_scores_gemma":[0.79539686,0.0013458184,0.03657446,0.00072978047,0.00019547535,0.00008256309,0.0022221797,0.00028532508,0.16316739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997613,0.000045436682,0.000010025753,0.00006584289,0.000057977395,0.000059529666],"domain_scores_gemma":[0.9994286,0.00020274597,0.00007104209,0.00014839001,0.000070229835,0.00007912036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018504728,0.00043057906,0.00027223144,0.00053232163,0.0010232326,0.0011704492,0.0008389601,0.0007470834,0.053433664],"category_scores_gemma":[0.0011539405,0.00027944637,0.00030504545,0.0006833207,0.00083929114,0.0024741879,0.0016541468,0.0013953947,0.005364105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013335735,0.00007898132,0.00074078754,0.00019512192,0.000029169963,0.0008329462,0.000402297,0.0015213721,0.00908578,0.89097834,0.01950978,0.07649205],"study_design_scores_gemma":[0.000038690134,0.0000428028,0.0008398315,0.000053586275,0.000027132051,0.00078365754,0.00031048158,0.004119873,0.0058301506,0.9194952,0.068441555,0.000017173605],"about_ca_topic_score_codex":0.00060496246,"about_ca_topic_score_gemma":0.001716466,"teacher_disagreement_score":0.053433664,"about_ca_system_score_codex":0.00057265325,"about_ca_system_score_gemma":0.00031904448,"threshold_uncertainty_score":0.17875338},"labels":[],"label_agreement":null},{"id":"W26989905","doi":"","title":"On (g, f, n)-critical graphs","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012069397914073562,"score_gpt":0.286034205727043,"score_spread":0.27396480781296945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26989905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7477624,0.0013627161,0.08371233,0.0027741448,0.00036697215,0.00022451475,0.0007404453,0.00038879784,0.16266759],"genre_scores_gemma":[0.945225,0.0009157306,0.0187717,0.0005573469,0.00020991317,0.00014141951,0.00077588926,0.00016624038,0.03323676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942917,0.00015734714,0.000021273692,0.00012170725,0.00010164231,0.00016880546],"domain_scores_gemma":[0.99739754,0.0012897019,0.00037522425,0.00015705006,0.00021615071,0.00056428317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066726643,0.0011924403,0.0009918871,0.0043810657,0.0036086473,0.0031280168,0.001221015,0.0016505623,0.010599548],"category_scores_gemma":[0.0030510023,0.000853196,0.00071850006,0.0020597088,0.0026592175,0.0042419718,0.0029912302,0.0017642792,0.00090744253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017335352,0.000037414426,0.00090797024,0.0001157943,0.00001584287,0.0004613349,0.00048595853,0.0031300709,0.0023423238,0.9799559,0.0047165877,0.007657533],"study_design_scores_gemma":[0.00004203017,0.000021021971,0.00053605,0.000055768083,0.000016451091,0.00029178144,0.0002862457,0.0066095004,0.0009237392,0.98660266,0.004599907,0.000014780144],"about_ca_topic_score_codex":0.0030006974,"about_ca_topic_score_gemma":0.005301812,"teacher_disagreement_score":0.010599548,"about_ca_system_score_codex":0.002498978,"about_ca_system_score_gemma":0.0007059594,"threshold_uncertainty_score":0.03545904},"labels":[],"label_agreement":null},{"id":"W2726740999","doi":"10.1007/s00453-018-00538-5","title":"Maximum Induced Matching Algorithms via Vertex Ordering Characterizations","year":2019,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Line graph; Factor-critical graph; Discrete mathematics; Graph; Graph power","score_opus":0.015788022930710435,"score_gpt":0.26864112702820914,"score_spread":0.2528531040974987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726740999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079743296,0.0006928079,0.8851888,0.0019683486,0.00017727976,0.00032812398,0.0010020992,0.0031155625,0.027783621],"genre_scores_gemma":[0.5972154,0.0006728926,0.3791791,0.0010264223,0.00041964423,0.00061458984,0.0031691259,0.0017076923,0.015995134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947299,0.0015999558,0.00031046153,0.0014032667,0.0013027672,0.00065374014],"domain_scores_gemma":[0.9799691,0.012507157,0.0010571847,0.0042223064,0.0014024079,0.0008417161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026567047,0.0014954695,0.0016916003,0.0031553484,0.0020905123,0.005807918,0.00519842,0.0030045772,0.013493325],"category_scores_gemma":[0.022579348,0.0014775074,0.0017661268,0.005830622,0.0020206142,0.016092068,0.006673775,0.005891655,0.002625477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013787997,0.0011963972,0.0027854247,0.00064598024,0.00014334194,0.00015051704,0.00064828165,0.06629988,0.0075433063,0.6334519,0.021113487,0.26464272],"study_design_scores_gemma":[0.00013143732,0.00012227983,0.00042145542,0.00007575689,0.000087034314,0.000132641,0.00016178789,0.26434144,0.005195877,0.7224709,0.0068252482,0.00003419473],"about_ca_topic_score_codex":0.0007579022,"about_ca_topic_score_gemma":0.0018139094,"teacher_disagreement_score":0.013493325,"about_ca_system_score_codex":0.0029483302,"about_ca_system_score_gemma":0.0020943277,"threshold_uncertainty_score":0.04513967},"labels":[],"label_agreement":null},{"id":"W2728728684","doi":"10.48550/arxiv.1707.00083","title":"Notes on Growing a Tree in a Graph","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; University of British Columbia; McGill University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Spanning tree; Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Random graph; Tree (set theory); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.11561484606021308,"score_gpt":0.24108335698521177,"score_spread":0.1254685109249987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2728728684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30101132,0.012660621,0.55912775,0.025343193,0.0045475904,0.00016585579,0.0018172232,0.001780917,0.09354544],"genre_scores_gemma":[0.8128911,0.0071030813,0.12648496,0.004736921,0.004918629,0.0003792425,0.0018243681,0.0014859751,0.040175576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986443,0.0003839294,0.000066034416,0.0003300424,0.00043116478,0.00014450794],"domain_scores_gemma":[0.9886437,0.0088220555,0.000556295,0.00072170945,0.0005913921,0.0006649153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002222083,0.00093508145,0.0011486635,0.0019546342,0.002099802,0.0020622488,0.002206933,0.0028790925,0.0089576],"category_scores_gemma":[0.021220611,0.0005588263,0.0012172346,0.0030540598,0.0037334652,0.0054123495,0.0024835912,0.003599197,0.0012538687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028485717,0.00008716716,0.0022156928,0.0005067731,0.00006487494,0.0006598892,0.0009910609,0.05868174,0.009541229,0.8521668,0.03491583,0.039884172],"study_design_scores_gemma":[0.00007256895,0.0001403132,0.001230543,0.00008662056,0.000053992942,0.00033659357,0.00024456988,0.096200824,0.0021062272,0.8869486,0.012528608,0.000050595387],"about_ca_topic_score_codex":0.0035584557,"about_ca_topic_score_gemma":0.0024994083,"teacher_disagreement_score":0.0089576,"about_ca_system_score_codex":0.001511756,"about_ca_system_score_gemma":0.00075601484,"threshold_uncertainty_score":0.029966116},"labels":[],"label_agreement":null},{"id":"W2730440053","doi":"10.1007/978-3-319-62127-2_9","title":"Dynamic Graph Coloring","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Japan Society for the Promotion of Science; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Exploratory Research for Advanced Technology; Fonds De La Recherche Scientifique - FNRS; Carleton University","keywords":"Combinatorics; List coloring; Omega; Graph; Vertex (graph theory); Fractional coloring; Mathematics; Complete coloring; Binary logarithm; Brooks' theorem; Edge coloring; Upper and lower bounds; Graph coloring; Discrete mathematics; Graph power; Physics; Line graph","score_opus":0.026295172870889456,"score_gpt":0.3273733207876667,"score_spread":0.30107814791677723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730440053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10915643,0.0023484507,0.8239803,0.0021711998,0.00066348986,0.0005041902,0.0014236592,0.0049642413,0.05478795],"genre_scores_gemma":[0.4481763,0.0016979343,0.5193847,0.0012395035,0.00040917602,0.0005672612,0.0027039521,0.002626639,0.023194497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953193,0.0008487665,0.00019334606,0.0014267672,0.0012522726,0.00095948076],"domain_scores_gemma":[0.9849726,0.0069047646,0.0012362077,0.0050030784,0.0011419589,0.0007413336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020847258,0.0016353211,0.0017237762,0.001263773,0.0023676304,0.003881483,0.0042121625,0.0016365943,0.013025419],"category_scores_gemma":[0.012050407,0.0008737926,0.0011947762,0.0029125893,0.0016387212,0.0070107994,0.0028751954,0.0026868735,0.003087253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014465085,0.0008020806,0.006536887,0.0011179851,0.00028818796,0.00036609476,0.00060479995,0.37581354,0.030863408,0.23695394,0.036431078,0.30877542],"study_design_scores_gemma":[0.00023210717,0.00042945155,0.0020506834,0.00009488703,0.0001875371,0.0011288212,0.0003448738,0.71358603,0.018125642,0.186733,0.07701262,0.00007434867],"about_ca_topic_score_codex":0.0037439917,"about_ca_topic_score_gemma":0.005960478,"teacher_disagreement_score":0.013025419,"about_ca_system_score_codex":0.004265663,"about_ca_system_score_gemma":0.0032554637,"threshold_uncertainty_score":0.043574393},"labels":[],"label_agreement":null},{"id":"W2734443656","doi":"","title":"A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for some NP-Hard Graph Optimization Problems","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Semidefinite programming; Mathematics; Hierarchy; Relaxation (psychology); Combinatorics; Projection (relational algebra); Graph; Mathematical optimization; Discrete mathematics; Algorithm","score_opus":0.01711668131733231,"score_gpt":0.24752913590911976,"score_spread":0.23041245459178744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734443656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026989406,0.0011028292,0.95139265,0.0010729333,0.00007779982,0.00019716092,0.00034061674,0.000606517,0.018220097],"genre_scores_gemma":[0.29168257,0.0019000064,0.69510424,0.0008744284,0.00021105805,0.00054496765,0.0015595495,0.00038096102,0.0077421586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983986,0.0006960004,0.00007197609,0.00023306224,0.000427204,0.00017312828],"domain_scores_gemma":[0.99704105,0.0017772081,0.00023336522,0.00034462367,0.00037100917,0.00023287987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031812554,0.0017920629,0.0012876034,0.0009842915,0.0007361724,0.001716398,0.001639998,0.0011537222,0.0056343754],"category_scores_gemma":[0.0063581006,0.0008318623,0.0014620069,0.0012388162,0.0012497444,0.002721472,0.0020932257,0.005242685,0.0013561577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029010253,0.00052166614,0.00085681514,0.0007708833,0.00008720889,0.0002254205,0.0003434529,0.6121879,0.008468871,0.21395315,0.015890934,0.14640361],"study_design_scores_gemma":[0.00004396128,0.00012403142,0.00019413247,0.000049835755,0.0000145101985,0.00008587859,0.000052364376,0.9119413,0.001324645,0.08302333,0.0031240329,0.000021956284],"about_ca_topic_score_codex":0.0012807937,"about_ca_topic_score_gemma":0.002667657,"teacher_disagreement_score":0.0056343754,"about_ca_system_score_codex":0.001385166,"about_ca_system_score_gemma":0.0015215396,"threshold_uncertainty_score":0.018848836},"labels":[],"label_agreement":null},{"id":"W2736876508","doi":"10.46298/dmtcs.3396","title":"The Windy Postman Problem on Series-Parallel Graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Universidad Autónoma Metropolitana","keywords":"Mathematics; Combinatorics; Eulerian path; Conjecture; Polyhedron; Graph; Discrete mathematics; Pure mathematics","score_opus":0.013783356894273988,"score_gpt":0.28233515400538395,"score_spread":0.26855179711110994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736876508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5068828,0.00072975445,0.44363475,0.0014474944,0.000110099085,0.00019205706,0.0012674981,0.0004835454,0.04525198],"genre_scores_gemma":[0.896572,0.00097554026,0.08757089,0.00016596486,0.00013070546,0.00015193218,0.0011592199,0.00011863575,0.013155058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995566,0.000079655954,0.00002551988,0.00013057228,0.00011338919,0.000094272174],"domain_scores_gemma":[0.9989053,0.00045519063,0.0002521023,0.00017715094,0.00009524586,0.00011505444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003787352,0.0005566887,0.0006084867,0.00050163094,0.001096437,0.0012797347,0.0008628857,0.00076998165,0.0046262564],"category_scores_gemma":[0.0021326675,0.00048771276,0.0006146512,0.0013228107,0.0012178528,0.0036335536,0.0011124345,0.0010714,0.0003410158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037944753,0.00015138299,0.0020646965,0.00025956004,0.000043085143,0.0003822653,0.0003093197,0.3661129,0.005300888,0.5591976,0.010307453,0.055491406],"study_design_scores_gemma":[0.000063141524,0.00013248083,0.0009056176,0.000032101358,0.000019812544,0.00039812434,0.00026492955,0.3782914,0.0034641526,0.60480005,0.011607925,0.00002020489],"about_ca_topic_score_codex":0.0030393866,"about_ca_topic_score_gemma":0.0025591978,"teacher_disagreement_score":0.0046262564,"about_ca_system_score_codex":0.00096764223,"about_ca_system_score_gemma":0.00070184795,"threshold_uncertainty_score":0.015476346},"labels":[],"label_agreement":null},{"id":"W2737383490","doi":"10.1007/978-3-319-71147-8_11","title":"A New Graph Parameter to Measure Linearity","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Discrete mathematics; Sigma; Conjecture; Vertex (graph theory); Bipartite graph; Graph","score_opus":0.045763194477085434,"score_gpt":0.3095016994705648,"score_spread":0.26373850499347934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737383490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03456544,0.002996006,0.8309298,0.0037295804,0.0027238107,0.0001314321,0.00043369434,0.001565499,0.12292478],"genre_scores_gemma":[0.60958064,0.0029555066,0.2927288,0.0045230873,0.0056504384,0.0006394795,0.0007066939,0.0033591213,0.079856254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737585,0.0008840756,0.00015315985,0.0008288169,0.00057745725,0.00018062517],"domain_scores_gemma":[0.99574584,0.0017941174,0.00040229017,0.0010233199,0.0006089568,0.0004255128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020787655,0.001292591,0.0014851876,0.004876325,0.0021136748,0.0037008354,0.0022480267,0.0025598588,0.011149438],"category_scores_gemma":[0.007437938,0.0006953567,0.0012947848,0.00326475,0.0067132683,0.013017678,0.004711578,0.0057666483,0.0028315561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015893247,0.000015109662,0.0001001838,0.000056999943,0.000008532548,0.000020276679,0.00011831756,0.00050688896,0.0013893197,0.98271024,0.0021485363,0.0129097225],"study_design_scores_gemma":[0.000009171104,0.00004796304,0.00024043993,0.00003985619,0.000022551156,0.00019421903,0.000105085914,0.0064161085,0.0019816207,0.9699009,0.02100129,0.00004073996],"about_ca_topic_score_codex":0.00041385015,"about_ca_topic_score_gemma":0.0003905964,"teacher_disagreement_score":0.011149438,"about_ca_system_score_codex":0.0023456663,"about_ca_system_score_gemma":0.0006045661,"threshold_uncertainty_score":0.03729856},"labels":[],"label_agreement":null},{"id":"W2737902914","doi":"","title":"Proximity and Remoteness in Graphs: Results and Conjectures","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Independence number; Upper and lower bounds; Graph; Matching (statistics); Discrete mathematics; Statistics","score_opus":0.01002575101590103,"score_gpt":0.24838504648810705,"score_spread":0.23835929547220602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737902914","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50044745,0.03597967,0.37364239,0.01525753,0.000495338,0.000098354976,0.0008718103,0.0009462906,0.072261155],"genre_scores_gemma":[0.96129555,0.008468056,0.022516739,0.0006841774,0.0019666038,0.00009604733,0.00041766482,0.00021920302,0.004335944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99490416,0.0012852539,0.00029060594,0.001770773,0.0012867115,0.00046254208],"domain_scores_gemma":[0.9191145,0.06559654,0.0054501393,0.005137898,0.0019001286,0.0028007783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053289817,0.0011922499,0.002161894,0.005119426,0.002504628,0.0053589786,0.003319811,0.0028607135,0.0070234286],"category_scores_gemma":[0.04703071,0.0012147571,0.001454547,0.006086016,0.009123951,0.024468798,0.005631442,0.005225368,0.001240725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082213106,0.00032075806,0.010084504,0.0012177286,0.00011931851,0.0005237303,0.0029274328,0.03950134,0.0039267675,0.8773983,0.0056943037,0.05746369],"study_design_scores_gemma":[0.000041042655,0.00017933092,0.003605695,0.00012811826,0.00006829208,0.0006126835,0.00068497064,0.031665895,0.0015338012,0.9563824,0.0050501875,0.000047517868],"about_ca_topic_score_codex":0.0011373038,"about_ca_topic_score_gemma":0.0006125511,"teacher_disagreement_score":0.0070234286,"about_ca_system_score_codex":0.0021918193,"about_ca_system_score_gemma":0.0005387453,"threshold_uncertainty_score":0.028182685},"labels":[],"label_agreement":null},{"id":"W2739099791","doi":"10.1007/s00373-017-1833-0","title":"On Color Critical Graphs with Large Adaptable Chromatic Numbers","year":2017,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Combinatorics; Mathematics; Critical graph; Monochromatic color; Chromatic scale; Edge coloring; Discrete mathematics; Graph; Colored; Graph power; Line graph; Physics","score_opus":0.01692756262995187,"score_gpt":0.28940403621936756,"score_spread":0.2724764735894157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739099791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77983665,0.0009506453,0.15583566,0.002638933,0.0003223324,0.00010674726,0.00035546132,0.0009816604,0.058971815],"genre_scores_gemma":[0.9636355,0.00059521507,0.019765373,0.00041151882,0.00022766012,0.00009956002,0.0002879634,0.0003386915,0.014638486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996222,0.000121622026,0.000008590411,0.00008976796,0.000078640944,0.00007908521],"domain_scores_gemma":[0.99299026,0.0042856648,0.0007484621,0.00061003456,0.0004067537,0.000958807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063082454,0.0011133421,0.00082265085,0.0021126904,0.001578253,0.0021871491,0.0015643918,0.001449108,0.009130589],"category_scores_gemma":[0.007278155,0.00082563306,0.0005733786,0.0014543737,0.0032037743,0.0037289187,0.0021454145,0.0027240796,0.0007266824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020679261,0.000084774416,0.0018650638,0.00012726401,0.000026161923,0.0003032685,0.00040552483,0.039034218,0.006450063,0.93395966,0.0059983064,0.011538878],"study_design_scores_gemma":[0.000040524454,0.000029713881,0.0010145115,0.000027202526,0.000023232144,0.00014660346,0.00020388338,0.07460219,0.0010131283,0.92071855,0.002156577,0.000023710676],"about_ca_topic_score_codex":0.002376692,"about_ca_topic_score_gemma":0.0038572978,"teacher_disagreement_score":0.009130589,"about_ca_system_score_codex":0.001836324,"about_ca_system_score_gemma":0.00061120396,"threshold_uncertainty_score":0.030544877},"labels":[],"label_agreement":null},{"id":"W2739569002","doi":"","title":"Even time constraints on the watchman's walk.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Neighbourhood (mathematics); Traverse; Combinatorics; Vertex (graph theory); Mathematics; Conjecture; Tree (set theory); Interval (graph theory); Computer science; Discrete mathematics; Graph; Geography; Cartography","score_opus":0.0222203577737518,"score_gpt":0.26578216034643154,"score_spread":0.24356180257267973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739569002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2929138,0.0010525064,0.6495919,0.0021291424,0.00043141562,0.00023580533,0.0014569078,0.00041847627,0.051769953],"genre_scores_gemma":[0.93234324,0.00076262245,0.050693177,0.00034620138,0.00012960903,0.0002667614,0.0006877595,0.00012653855,0.014644096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906915,0.00023060944,0.000060738574,0.00022197531,0.00014210862,0.00027545248],"domain_scores_gemma":[0.9923287,0.0047151474,0.00078881666,0.00077058375,0.00036595765,0.0010308005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011072999,0.00057678955,0.0006496313,0.00053648243,0.0010906751,0.0017235071,0.0011263057,0.0009993779,0.009295466],"category_scores_gemma":[0.010122936,0.000377852,0.00056306855,0.00059379643,0.0017220244,0.003670172,0.0014089362,0.0016988025,0.00084821734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030637765,0.0000379333,0.001202534,0.0001124261,0.00002613585,0.0004902445,0.00033889947,0.03277698,0.004932823,0.94769484,0.0024214834,0.009659361],"study_design_scores_gemma":[0.000110372705,0.00011715781,0.0006713636,0.00004834304,0.000027632255,0.0002421224,0.00018721979,0.12953019,0.001813542,0.85559905,0.011623589,0.00002938186],"about_ca_topic_score_codex":0.0034680592,"about_ca_topic_score_gemma":0.0059057926,"teacher_disagreement_score":0.009295466,"about_ca_system_score_codex":0.00085103995,"about_ca_system_score_gemma":0.0010428156,"threshold_uncertainty_score":0.031096399},"labels":[],"label_agreement":null},{"id":"W2739994513","doi":"","title":"A Note on \\(r\\)-Equitable \\(k\\)-Colorings of Trees","year":2013,"lang":"ca","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Graph; Order (exchange); Discrete mathematics","score_opus":0.01594935515695807,"score_gpt":0.26736908492634925,"score_spread":0.2514197297693912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739994513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3476563,0.0020907114,0.5321427,0.0029709998,0.00065400405,0.000104320294,0.0003483959,0.00086856144,0.113164015],"genre_scores_gemma":[0.8385373,0.0015977486,0.14446625,0.0006962349,0.00034683253,0.00008043487,0.00029537443,0.0003933236,0.01358649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989157,0.00038030386,0.000070927264,0.00019791452,0.00020274534,0.00023239019],"domain_scores_gemma":[0.9969908,0.0015306314,0.0002446104,0.0006624471,0.0003580457,0.00021339979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012104881,0.0004014512,0.00045931578,0.0004089372,0.001337124,0.0012853733,0.0010160756,0.00033288408,0.0029359958],"category_scores_gemma":[0.0038916476,0.00045989297,0.0005048525,0.00092704134,0.0016886202,0.0022445333,0.0013697004,0.00223797,0.00041422294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043029056,0.00012610963,0.0037854689,0.00026079433,0.000043114025,0.0006630491,0.0011334452,0.03412376,0.023832478,0.84487516,0.010714356,0.08001208],"study_design_scores_gemma":[0.00007153508,0.00027164127,0.0041999803,0.00011748316,0.00007878275,0.0013534913,0.00072152645,0.096660525,0.024102202,0.7961966,0.07614295,0.00008330796],"about_ca_topic_score_codex":0.004168627,"about_ca_topic_score_gemma":0.0057997736,"teacher_disagreement_score":0.004168627,"about_ca_system_score_codex":0.0010743937,"about_ca_system_score_gemma":0.00065179385,"threshold_uncertainty_score":0.009821892},"labels":[],"label_agreement":null},{"id":"W2740078596","doi":"","title":"Edge contraction and cop-win critical graphs.","year":2015,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Edge contraction; Combinatorics; Graph; Mathematics; Vertex (graph theory); Computer science; Discrete mathematics; Line graph; Voltage graph","score_opus":0.06036837910370964,"score_gpt":0.35186802948024765,"score_spread":0.291499650376538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740078596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6752552,0.00095971033,0.27947628,0.0012220668,0.00012095629,0.00043793285,0.0010813728,0.0003118354,0.041134585],"genre_scores_gemma":[0.9145024,0.00058718026,0.07264852,0.0003297891,0.000095664414,0.00025809667,0.0018569143,0.00014069873,0.009580762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990976,0.00020210096,0.000035235218,0.00029067643,0.00018441556,0.00019005663],"domain_scores_gemma":[0.9957349,0.0022160031,0.00061393576,0.00034814433,0.0003946309,0.00069241715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008133895,0.000876109,0.0009071956,0.0017281899,0.0016784342,0.0014887382,0.0012494535,0.0010822708,0.0059704483],"category_scores_gemma":[0.0053792563,0.0005217601,0.0006661078,0.0010068782,0.0025256071,0.0027715825,0.0015743611,0.0018130902,0.00060086243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049490924,0.00016126015,0.007097399,0.00039784278,0.00006252791,0.00068858056,0.00072857796,0.045346804,0.008654942,0.8862246,0.008371394,0.041771132],"study_design_scores_gemma":[0.000079627884,0.00018902055,0.003226886,0.000075921766,0.000054672928,0.0012061679,0.00089207495,0.14550824,0.0054030563,0.82632047,0.016993202,0.000050560044],"about_ca_topic_score_codex":0.0019119723,"about_ca_topic_score_gemma":0.0016294043,"teacher_disagreement_score":0.0059704483,"about_ca_system_score_codex":0.0012362907,"about_ca_system_score_gemma":0.00087238837,"threshold_uncertainty_score":0.019973159},"labels":[],"label_agreement":null},{"id":"W2741433091","doi":"","title":"Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Partition (number theory); Transitive relation; Algebra homomorphism; Vertex (graph theory); Graph homomorphism; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.014305240025111307,"score_gpt":0.2726525584143579,"score_spread":0.2583473183892466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741433091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42976105,0.0013351787,0.54988045,0.0023520167,0.00007425009,0.00035644497,0.0018305089,0.0006118764,0.013798214],"genre_scores_gemma":[0.8398302,0.0011616999,0.14969118,0.00024408502,0.00018167771,0.00038311843,0.0020666586,0.00010313943,0.0063382094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982942,0.00052644184,0.00011972492,0.0005341343,0.00029702793,0.0002284501],"domain_scores_gemma":[0.989795,0.0071003945,0.00083376945,0.0013674556,0.00037061013,0.0005327998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013748627,0.0007069575,0.001085632,0.0011139839,0.0006948589,0.0028367066,0.0017260646,0.0012679386,0.0057363375],"category_scores_gemma":[0.009291291,0.0007305667,0.0013173165,0.0016889104,0.0018453642,0.0068202554,0.0017062909,0.0024328586,0.00037480224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004788257,0.00040274704,0.0032048456,0.0005805371,0.00012511176,0.00029894774,0.0008360172,0.18516685,0.0054044984,0.71732146,0.006055265,0.08012489],"study_design_scores_gemma":[0.00009784928,0.00012052416,0.0012994754,0.000037100708,0.000044647557,0.00026941128,0.0002598911,0.23671427,0.0020638297,0.755999,0.0030646762,0.000029376155],"about_ca_topic_score_codex":0.0016627802,"about_ca_topic_score_gemma":0.0019592757,"teacher_disagreement_score":0.0057363375,"about_ca_system_score_codex":0.0026077775,"about_ca_system_score_gemma":0.0012678233,"threshold_uncertainty_score":0.019190013},"labels":[],"label_agreement":null},{"id":"W2742004821","doi":"","title":"The 2-star spectrum of stars.","year":2009,"lang":"es","type":"article","venue":"Digital Commons - East Tennessee State University (East Tennessee State University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Stars; Star (game theory); Graph; Chromatic scale; Spectrum (functional analysis); Block (permutation group theory); Element (criminal law); Tree (set theory); Discrete mathematics; Astrophysics; Physics","score_opus":0.012915187581400854,"score_gpt":0.20784282458879344,"score_spread":0.19492763700739257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742004821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72383493,0.0020896841,0.1472513,0.0011600612,0.00019929382,0.00007548709,0.0013397612,0.00022571342,0.123823784],"genre_scores_gemma":[0.9500949,0.00068746996,0.037733905,0.00033670742,0.00011778898,0.00006261395,0.000839176,0.000063436906,0.010063939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996014,0.000084395826,0.000021807235,0.00012250863,0.000098247496,0.00007165327],"domain_scores_gemma":[0.99916196,0.00029586628,0.00015419912,0.00009418663,0.00012653266,0.0001672622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005201961,0.00031602118,0.00036903442,0.0012945752,0.0012785462,0.0012985917,0.0003656517,0.00052816793,0.0058198464],"category_scores_gemma":[0.0014623167,0.0002795772,0.00046986563,0.00080400513,0.0012710885,0.0021769954,0.0009970042,0.00058345275,0.00091369863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020757939,0.000034798675,0.002682011,0.00008768901,0.00001818804,0.00024254168,0.0007023184,0.0031208245,0.005703699,0.9616732,0.0039276853,0.021599399],"study_design_scores_gemma":[0.00002320761,0.000054917567,0.0020755015,0.00003833125,0.000010152142,0.00061443343,0.00044815036,0.011833185,0.0015838689,0.970008,0.013296092,0.000014084158],"about_ca_topic_score_codex":0.0009199011,"about_ca_topic_score_gemma":0.00085798494,"teacher_disagreement_score":0.0058198464,"about_ca_system_score_codex":0.00059546635,"about_ca_system_score_gemma":0.00027692725,"threshold_uncertainty_score":0.01946938},"labels":[],"label_agreement":null},{"id":"W2742025611","doi":"10.1016/j.disc.2017.06.006","title":"On nice and injective-nice tournaments","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; York University","funders":"","keywords":"Nice; Tournament; Mathematics; Combinatorics; Injective function; Homomorphism; Vertex (graph theory); Discrete mathematics; Graph; Computer science","score_opus":0.031090017430859575,"score_gpt":0.3399343565656918,"score_spread":0.3088443391348322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742025611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7219378,0.0012162435,0.13460025,0.0040247524,0.00041757707,0.000116785326,0.0007418384,0.0003613742,0.13658342],"genre_scores_gemma":[0.9624408,0.0006819895,0.013861194,0.00048723695,0.00045195234,0.00010114398,0.00071824493,0.00016039138,0.021097125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744236,0.00080005947,0.00011837138,0.00044838304,0.0005567755,0.0006338904],"domain_scores_gemma":[0.98763496,0.0065732524,0.0014410994,0.0010979037,0.0010235735,0.0022292137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019393556,0.0011728834,0.002115784,0.0021063697,0.004424585,0.008740466,0.0027693415,0.003081623,0.010708241],"category_scores_gemma":[0.014170574,0.0012636846,0.0018777326,0.0028233605,0.006096594,0.00956954,0.0050675226,0.004759469,0.0008448231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015079473,0.00004096917,0.0007835474,0.00004555081,0.00001775391,0.0001287644,0.00035134732,0.0019781739,0.00047847803,0.99175924,0.0013830862,0.0028821814],"study_design_scores_gemma":[0.000048996262,0.000023255596,0.0005053256,0.000015058291,0.000019517825,0.00011634897,0.00016512649,0.0073628537,0.00012810403,0.9902334,0.0013661426,0.00001584462],"about_ca_topic_score_codex":0.0030458812,"about_ca_topic_score_gemma":0.003971504,"teacher_disagreement_score":0.010708241,"about_ca_system_score_codex":0.002249499,"about_ca_system_score_gemma":0.0009888546,"threshold_uncertainty_score":0.03582263},"labels":[],"label_agreement":null},{"id":"W2743168372","doi":"10.1007/s00493-019-3848-z","title":"Clustered Colouring in Minor-Closed Classes","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Monochromatic color; Conjecture; Chromatic scale; Graph; Windmill graph; Friendship graph; Integer (computer science); Graph coloring","score_opus":0.014357102561388977,"score_gpt":0.268063887531273,"score_spread":0.253706784969884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743168372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6684651,0.0004189053,0.2655563,0.0014320394,0.00024024276,0.00015594135,0.0006853154,0.0008648488,0.062181246],"genre_scores_gemma":[0.92437744,0.00024552975,0.04855545,0.00033019163,0.00020732345,0.00010858264,0.00074872345,0.00041788645,0.025008962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986608,0.00021916364,0.00005609987,0.0005294909,0.00026160027,0.00027294067],"domain_scores_gemma":[0.9944864,0.0023219949,0.0005478419,0.0009423228,0.0006873059,0.001014138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006586494,0.00051450473,0.0012991943,0.0017875369,0.0029427805,0.00416262,0.0022712746,0.0015594392,0.012936867],"category_scores_gemma":[0.0047009303,0.0008416008,0.0012535594,0.0023089973,0.0030897832,0.00419627,0.0025298633,0.0026324838,0.001283262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012434686,0.00006459396,0.0011784994,0.00007239708,0.000016839547,0.00012784934,0.00076329656,0.0022944026,0.003231436,0.97743964,0.0029989807,0.011687791],"study_design_scores_gemma":[0.000036581554,0.000021669824,0.0008894389,0.000017745444,0.000020234975,0.00020706312,0.0002065925,0.0098826075,0.001223921,0.9821988,0.005280621,0.000014859799],"about_ca_topic_score_codex":0.002942807,"about_ca_topic_score_gemma":0.0034939095,"teacher_disagreement_score":0.012936867,"about_ca_system_score_codex":0.0022760243,"about_ca_system_score_gemma":0.000703322,"threshold_uncertainty_score":0.043278098},"labels":[],"label_agreement":null},{"id":"W2743273005","doi":"","title":"Counting the Number of Non-Equivalent Vertex Colorings of a Graph","year":2013,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Degree (music); Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.0173763702336796,"score_gpt":0.2725153298099485,"score_spread":0.2551389595762689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743273005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80965173,0.00044329764,0.17471346,0.0006634386,0.000120026976,0.00009028699,0.0006593148,0.0004908172,0.0131676365],"genre_scores_gemma":[0.93263966,0.0003307489,0.06032845,0.00013349866,0.00012206327,0.0001323172,0.000983526,0.00026797087,0.005061759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965687,0.0007770308,0.00020120718,0.0009200926,0.0008651284,0.0006678592],"domain_scores_gemma":[0.98145735,0.011776705,0.0022095288,0.002643227,0.00090501306,0.001008204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021528886,0.0009322091,0.00095364754,0.00250785,0.0018772993,0.0028619028,0.002880377,0.0015558848,0.0053014876],"category_scores_gemma":[0.0152415205,0.0005700671,0.00094483595,0.0020986232,0.0034717035,0.0046609333,0.0014961063,0.0015417997,0.00045148339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011192528,0.00031060184,0.0411558,0.0006206897,0.00027063402,0.0006831586,0.0013947688,0.082588084,0.045131564,0.72202367,0.005965196,0.09873666],"study_design_scores_gemma":[0.00013432857,0.00038469105,0.010420055,0.00007674101,0.00018579024,0.001794842,0.00051797123,0.22477734,0.027300298,0.725232,0.009019401,0.00015644719],"about_ca_topic_score_codex":0.0009358182,"about_ca_topic_score_gemma":0.0017822313,"teacher_disagreement_score":0.0053014876,"about_ca_system_score_codex":0.0017569336,"about_ca_system_score_gemma":0.00090704823,"threshold_uncertainty_score":0.017735183},"labels":[],"label_agreement":null},{"id":"W2744335011","doi":"","title":"Augmenting Chains in Graphs Without a Skew Star","year":2003,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Corollary; Combinatorics; Mathematics; Chordal graph; Skew; Maximal independent set; Indifference graph; Generalization; Degree (music); Star (game theory); Interval graph; Pathwidth; Discrete mathematics; Class (philosophy); Matching (statistics); Cograph; Vertex (graph theory); Bipartite graph; 1-planar graph; Graph; Line graph; Computer science","score_opus":0.014547034210685027,"score_gpt":0.2619308745918902,"score_spread":0.24738384038120514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744335011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41268715,0.00028118127,0.574674,0.00025199566,0.000028513663,0.00019533481,0.00029064773,0.00066883833,0.010922337],"genre_scores_gemma":[0.6187201,0.00042837378,0.37358618,0.00007141377,0.000040523668,0.0002101862,0.0008324811,0.00010808156,0.0060026906],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996712,0.000067254856,0.000023196842,0.00009897296,0.00007232748,0.0000670427],"domain_scores_gemma":[0.99825424,0.00084939157,0.00022743992,0.00040485314,0.00014900946,0.00011506436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047683463,0.00047989064,0.00052138476,0.00061897264,0.0008451343,0.0008017374,0.0008334209,0.0006519535,0.0057296543],"category_scores_gemma":[0.0020507379,0.00031555872,0.00062623,0.0010961212,0.0006921481,0.00285786,0.0015892795,0.00095775875,0.00091957726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064863556,0.00052805815,0.0060939053,0.00059185043,0.000069850175,0.0006689776,0.00088659156,0.2533514,0.08817924,0.2744225,0.0037572333,0.37080178],"study_design_scores_gemma":[0.00007115292,0.0005434181,0.0010805614,0.000072277006,0.000059815196,0.0005308015,0.00032782077,0.59926265,0.04546937,0.3382159,0.014338278,0.000027997334],"about_ca_topic_score_codex":0.0007742344,"about_ca_topic_score_gemma":0.001525506,"teacher_disagreement_score":0.0057296543,"about_ca_system_score_codex":0.00035346035,"about_ca_system_score_gemma":0.00058679923,"threshold_uncertainty_score":0.019167602},"labels":[],"label_agreement":null},{"id":"W2745422027","doi":"10.37236/6361","title":"Quasi-Eulerian Hypergraphs","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Hypergraph; Eulerian path; Mathematics; Combinatorics; Euler's formula; Traverse; Connected component; Euler characteristic; Graph; Discrete mathematics; Pure mathematics; Lagrangian; Mathematical analysis","score_opus":0.014251556329555026,"score_gpt":0.28635943656400586,"score_spread":0.2721078802344508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745422027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4773137,0.001433128,0.4703226,0.000995187,0.00013186708,0.000114870825,0.0014562784,0.0004886288,0.047743782],"genre_scores_gemma":[0.8891845,0.0010440322,0.0921015,0.00022050149,0.00007890849,0.00009935388,0.0007953341,0.00012531727,0.016350653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996886,0.00007061383,0.00001957348,0.00010774792,0.000047605285,0.00006591129],"domain_scores_gemma":[0.9989039,0.000431413,0.00015264966,0.00019887066,0.00014845785,0.00016471007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034573753,0.0002879468,0.0002610106,0.000729706,0.0008097421,0.0009561873,0.00050201383,0.00045537058,0.006052853],"category_scores_gemma":[0.001527712,0.00034336693,0.00032128,0.0007666865,0.0010077563,0.0034574445,0.0010881678,0.000866534,0.00041946853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058460224,0.000020951979,0.0018554328,0.000099592056,0.000012593836,0.00024856153,0.00031816313,0.010713901,0.0048573227,0.962463,0.0017552776,0.017596764],"study_design_scores_gemma":[0.000018183067,0.000044749908,0.0022049868,0.00006492198,0.000021935371,0.0006278102,0.0004073863,0.053620137,0.0048732883,0.9064369,0.03164925,0.00003036846],"about_ca_topic_score_codex":0.0014414329,"about_ca_topic_score_gemma":0.0022858526,"teacher_disagreement_score":0.006052853,"about_ca_system_score_codex":0.00087651354,"about_ca_system_score_gemma":0.0004948888,"threshold_uncertainty_score":0.02024883},"labels":[],"label_agreement":null},{"id":"W2749551738","doi":"10.37236/6738","title":"On $t$-Common List-Colorings","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Planar graph; Graph; Integer (computer science); Chromatic scale; Upper and lower bounds; Discrete mathematics","score_opus":0.014894760056865311,"score_gpt":0.3002501605083333,"score_spread":0.285355400451468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749551738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07246523,0.0015906135,0.8474431,0.0015883814,0.00092826656,0.0003030856,0.0011585569,0.0016135786,0.07290913],"genre_scores_gemma":[0.52853423,0.0028569982,0.41609827,0.002349743,0.0012478201,0.00075874146,0.0028185933,0.0015715522,0.043764047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966612,0.0007991333,0.00014357915,0.0010389969,0.0006478396,0.0007092979],"domain_scores_gemma":[0.99455065,0.0020613275,0.0005771041,0.001418201,0.00073566986,0.0006570055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00160755,0.0020060425,0.0010162411,0.001737772,0.002531145,0.002962795,0.0025874968,0.0011516146,0.015075042],"category_scores_gemma":[0.0059211957,0.0006758187,0.0017126038,0.0038813818,0.0031790275,0.0070259934,0.0050309408,0.0042884443,0.0027510305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021903082,0.0001400473,0.0009601991,0.0002640502,0.00005338834,0.00027509246,0.00042618412,0.03232773,0.003973915,0.8897494,0.016473807,0.05513715],"study_design_scores_gemma":[0.000076951015,0.00011698857,0.00043621086,0.000071245675,0.00005369439,0.0005144557,0.00022276645,0.120150834,0.0034090371,0.8290822,0.045789864,0.00007576891],"about_ca_topic_score_codex":0.0032475668,"about_ca_topic_score_gemma":0.003962607,"teacher_disagreement_score":0.015075042,"about_ca_system_score_codex":0.0032433881,"about_ca_system_score_gemma":0.0018173081,"threshold_uncertainty_score":0.050431013},"labels":[],"label_agreement":null},{"id":"W2751545277","doi":"10.1007/978-3-319-73915-1_16","title":"EPG-representations with Small Grid-Size","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University; University of Waterloo","funders":"","keywords":"Treewidth; Pathwidth; Combinatorics; Monotone polygon; Bounded function; Mathematics; Vertex (graph theory); Discrete mathematics; Upper and lower bounds; Grid; Chordal graph; Graph; Line graph; Geometry","score_opus":0.028752380461927893,"score_gpt":0.28799816126131905,"score_spread":0.25924578079939115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751545277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06063934,0.00051788235,0.80684,0.0011543166,0.0008969963,0.00020423866,0.0016088354,0.006375462,0.121762924],"genre_scores_gemma":[0.4597349,0.0007745923,0.45931962,0.000980356,0.00038076387,0.00046612366,0.0036437034,0.004112595,0.07058738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948287,0.00012088644,0.00003451301,0.000101308375,0.00016661643,0.00009381904],"domain_scores_gemma":[0.9983181,0.0003937387,0.000063160194,0.0008857728,0.00020819118,0.00013112584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004719322,0.0007103115,0.0006364826,0.0008882424,0.00069986586,0.0020905123,0.001246825,0.0012138862,0.03170213],"category_scores_gemma":[0.0038854508,0.00037743853,0.0005911404,0.0013702236,0.0008764626,0.003883351,0.0026195305,0.0028594367,0.008483987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031041197,0.0001723868,0.00039233238,0.0003239526,0.000030623123,0.00029683457,0.00023272318,0.016846297,0.007934464,0.67609066,0.046152107,0.25121716],"study_design_scores_gemma":[0.000051990937,0.000045582783,0.00016469952,0.000050802697,0.000022454708,0.00021474784,0.0001015943,0.04907373,0.0037421752,0.91359717,0.03291608,0.000018966064],"about_ca_topic_score_codex":0.00045093926,"about_ca_topic_score_gemma":0.00093059224,"teacher_disagreement_score":0.03170213,"about_ca_system_score_codex":0.00038838494,"about_ca_system_score_gemma":0.00043235876,"threshold_uncertainty_score":0.10605419},"labels":[],"label_agreement":null},{"id":"W2751588130","doi":"10.1016/j.disc.2018.06.021","title":"Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Hypergraph; Vertex (graph theory); Euler's formula; Spanning tree; Euler characteristic; Traverse; Discrete mathematics; Graph; Mathematical analysis","score_opus":0.01965353357901875,"score_gpt":0.2796994088672856,"score_spread":0.26004587528826684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751588130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77729815,0.00068040553,0.17809255,0.0010477683,0.00010939779,0.000088280474,0.0008820566,0.00027564046,0.041525695],"genre_scores_gemma":[0.9299182,0.00092160446,0.04883245,0.00024618497,0.00008723325,0.000117108546,0.0011000129,0.00018577593,0.018591361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995542,0.00012032754,0.000020251357,0.00009949423,0.000081978746,0.00012371645],"domain_scores_gemma":[0.9974324,0.0012146808,0.0004402886,0.00019169106,0.00024073158,0.00048017167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052429165,0.0005786287,0.0005903727,0.001814,0.0019112327,0.0024005065,0.0010714082,0.0016012822,0.009213521],"category_scores_gemma":[0.0046547037,0.0008859349,0.0006675336,0.0021083702,0.0015447926,0.0038969172,0.0015447381,0.0017780446,0.00069306826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016734934,0.00004913361,0.0027521509,0.00013490094,0.000031550164,0.00068112655,0.0007771768,0.017103486,0.0026208078,0.9566996,0.0040847934,0.014897858],"study_design_scores_gemma":[0.000030241083,0.00002416084,0.0016207013,0.000057797442,0.000033583598,0.0006145173,0.00086856016,0.044173468,0.0011974237,0.946781,0.0045773615,0.000021235743],"about_ca_topic_score_codex":0.0016854545,"about_ca_topic_score_gemma":0.0023144116,"teacher_disagreement_score":0.009213521,"about_ca_system_score_codex":0.001121247,"about_ca_system_score_gemma":0.000503079,"threshold_uncertainty_score":0.030822277},"labels":[],"label_agreement":null},{"id":"W2751727209","doi":"10.1142/s1793830917500653","title":"Disjoint dominating sets with a perfect matching","year":2017,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; Mount Allison University","keywords":"Combinatorics; Disjoint sets; Mathematics; Independence number; Discrete mathematics; Graph; Cardinality (data modeling); Matching (statistics); Computer science","score_opus":0.02575959521276084,"score_gpt":0.32599605541480425,"score_spread":0.3002364602020434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751727209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25756252,0.002281898,0.68445426,0.0022950296,0.0002385576,0.0003212123,0.0017243553,0.00045476138,0.050667316],"genre_scores_gemma":[0.8361393,0.001037298,0.14534505,0.00060382107,0.00026729165,0.00026769802,0.00098898,0.00013498006,0.01521554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966768,0.0008315573,0.00020979096,0.0010710844,0.00084892,0.00036175895],"domain_scores_gemma":[0.992724,0.003768508,0.0010334174,0.0014259767,0.00042016397,0.00062810566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023415433,0.0011516601,0.0013804178,0.0011250167,0.001417584,0.0025661073,0.0018237568,0.0012778504,0.0046739806],"category_scores_gemma":[0.011727269,0.0008101194,0.0012615895,0.002281382,0.0020056847,0.00649554,0.0031010527,0.0017653754,0.0008925199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000379787,0.00013092908,0.0016707109,0.00040509936,0.00013529358,0.00045123367,0.00049627636,0.09011653,0.0043783276,0.85892767,0.0047570844,0.038150992],"study_design_scores_gemma":[0.000085161024,0.00011976302,0.0005428852,0.000051262443,0.000079046265,0.0006671581,0.00011740918,0.1319883,0.0034350336,0.8468564,0.016024917,0.000032689408],"about_ca_topic_score_codex":0.0008560548,"about_ca_topic_score_gemma":0.000728261,"teacher_disagreement_score":0.0046739806,"about_ca_system_score_codex":0.0020330912,"about_ca_system_score_gemma":0.0010414991,"threshold_uncertainty_score":0.015636027},"labels":[],"label_agreement":null},{"id":"W2754102152","doi":"10.1287/moor.2017.0864","title":"Opposite Elements in Clutters","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Matroid; Combinatorics; Clutter; Ideal (ethics); Set (abstract data type); Cover (algebra); Property (philosophy); Discrete mathematics; Degenerate energy levels; Algorithm; Computer science","score_opus":0.1486357248062392,"score_gpt":0.46244065175271837,"score_spread":0.31380492694647916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754102152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5430692,0.0011463354,0.38971454,0.0010517574,0.00028208588,0.00008630827,0.00049405784,0.00057305506,0.063582644],"genre_scores_gemma":[0.9261255,0.00038632486,0.061836466,0.00035813983,0.00015897633,0.00007721745,0.00063221797,0.00013735444,0.0102878185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979557,0.00036072204,0.00016962491,0.0006520393,0.0004298855,0.0004319975],"domain_scores_gemma":[0.9959849,0.0016864081,0.0006114336,0.00079682004,0.0004120061,0.0005084735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012128402,0.00045012566,0.00058719283,0.0016303663,0.0026995237,0.0032066475,0.00066677603,0.0010062826,0.005412473],"category_scores_gemma":[0.0048507745,0.0006228921,0.00088060333,0.001552634,0.0051174667,0.008100118,0.0033601136,0.0014595406,0.00077311334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110689594,0.000035075725,0.0036047308,0.00005818747,0.000014675635,0.00039475964,0.0010907634,0.0030918284,0.0034759943,0.97354853,0.0011407378,0.01343418],"study_design_scores_gemma":[0.000017621467,0.000083482504,0.0018027475,0.000049945902,0.000029179844,0.0014466343,0.0012375641,0.009522535,0.0057360465,0.9513386,0.028699024,0.00003662647],"about_ca_topic_score_codex":0.00089302775,"about_ca_topic_score_gemma":0.00080603326,"teacher_disagreement_score":0.005412473,"about_ca_system_score_codex":0.0010296656,"about_ca_system_score_gemma":0.00047212324,"threshold_uncertainty_score":0.01810646},"labels":[],"label_agreement":null},{"id":"W2754199588","doi":"10.1002/jgt.20000","title":"Some remarks on domination","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012409671328413885,"score_gpt":0.2852600797355756,"score_spread":0.27285040840716174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754199588","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08023674,0.02464798,0.14520791,0.3457172,0.008957719,0.00014362088,0.0012656956,0.0010430617,0.39278007],"genre_scores_gemma":[0.8125574,0.01355237,0.02338397,0.07205741,0.016222956,0.0002264028,0.0007067201,0.0004843589,0.06080843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664426,0.00091476523,0.00014462828,0.00084625435,0.0008802431,0.0005699229],"domain_scores_gemma":[0.98281866,0.011174944,0.0008189502,0.0017028782,0.0023522836,0.0011322981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00473197,0.0008590303,0.0010384173,0.0018285557,0.0029203282,0.002854245,0.0027826736,0.002667628,0.022575455],"category_scores_gemma":[0.017453553,0.0003715161,0.0015932877,0.002162497,0.006433044,0.01002213,0.003528101,0.0058082896,0.0024532217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011900047,0.000048610982,0.0017186888,0.00021112044,0.000036382953,0.00032523103,0.0008162739,0.0026295683,0.0010120815,0.9273851,0.049376756,0.016321156],"study_design_scores_gemma":[0.00003540935,0.000041725198,0.0010364233,0.000121592886,0.00002083346,0.00029219262,0.0005087609,0.0031991468,0.0005757366,0.91055864,0.08358393,0.000025669964],"about_ca_topic_score_codex":0.0045958636,"about_ca_topic_score_gemma":0.0023995086,"teacher_disagreement_score":0.022575455,"about_ca_system_score_codex":0.0019852547,"about_ca_system_score_gemma":0.0005798902,"threshold_uncertainty_score":0.07552248},"labels":[],"label_agreement":null},{"id":"W2754517646","doi":"10.3390/a11040052","title":"Introduction to Reconfiguration","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":181,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control reconfiguration; Sequence (biology); Computer science; Graph; Space (punctuation); Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.01935662206999441,"score_gpt":0.30259472380446173,"score_spread":0.28323810173446734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754517646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028952877,0.095948905,0.5852987,0.013417409,0.009695749,0.000352119,0.0017293905,0.0024748526,0.28818762],"genre_scores_gemma":[0.11969711,0.18392485,0.49999362,0.019639576,0.022819564,0.001313596,0.0037096422,0.0022202213,0.14668189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730515,0.0004890963,0.00022672604,0.0009999311,0.0007213824,0.00025761916],"domain_scores_gemma":[0.9965424,0.0020471367,0.00019012023,0.00061558257,0.0004286698,0.00017618934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012208214,0.0021405646,0.0013380547,0.0021716375,0.001500675,0.004466836,0.0027759746,0.0031269195,0.03360787],"category_scores_gemma":[0.0048940233,0.0009831851,0.002053383,0.005224087,0.004543376,0.007071408,0.0026769023,0.00628924,0.013824569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054040676,0.000042516884,0.0002644585,0.0009678903,0.000034802055,0.00016940791,0.0002725501,0.006583157,0.0008826502,0.75553083,0.075603746,0.159594],"study_design_scores_gemma":[0.000011164265,0.000037325437,0.00018717759,0.00034312427,0.000016562619,0.0005053128,0.00006833531,0.0035977843,0.00033291883,0.37347445,0.62139964,0.00002618984],"about_ca_topic_score_codex":0.0022573746,"about_ca_topic_score_gemma":0.0016567553,"teacher_disagreement_score":0.03360787,"about_ca_system_score_codex":0.0024927445,"about_ca_system_score_gemma":0.0017085391,"threshold_uncertainty_score":0.1124295},"labels":[],"label_agreement":null},{"id":"W2755482418","doi":"10.37236/7311","title":"Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs","year":2018,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Degenerate energy levels; Graph; Planar graph; Degree (music); Induced subgraph; Planar; Discrete mathematics; Physics; Computer science; Quantum mechanics; Vertex (graph theory)","score_opus":0.025519931330893145,"score_gpt":0.2824454042820947,"score_spread":0.25692547295120155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755482418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87854373,0.0005954029,0.09092549,0.0005432087,0.0000322414,0.00012173605,0.0028451146,0.00047215336,0.025920955],"genre_scores_gemma":[0.9672902,0.0004238905,0.024539934,0.00017219159,0.00004666201,0.000116780306,0.004252972,0.0001202342,0.003037053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990256,0.00014755996,0.00006344816,0.00023640582,0.00029918287,0.00022786477],"domain_scores_gemma":[0.99657506,0.001542836,0.0006941146,0.00046975553,0.00032694574,0.00039120988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034643192,0.00053794996,0.000667194,0.0012676881,0.00077737233,0.001193588,0.0012372921,0.0005628016,0.00569991],"category_scores_gemma":[0.0036268614,0.00070770003,0.00087344047,0.00164581,0.0008915124,0.002364065,0.0020814538,0.0008952799,0.0006114729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028508755,0.000584912,0.04324035,0.0021351287,0.00038757504,0.0037261406,0.00243045,0.12724474,0.19984965,0.4603049,0.018236587,0.13900882],"study_design_scores_gemma":[0.00021815556,0.00038888873,0.03513158,0.00018119921,0.00027803995,0.007455059,0.0012151528,0.23966883,0.07286942,0.6116907,0.030775853,0.0001271434],"about_ca_topic_score_codex":0.0010067405,"about_ca_topic_score_gemma":0.0013574472,"teacher_disagreement_score":0.00569991,"about_ca_system_score_codex":0.0009746091,"about_ca_system_score_gemma":0.00033198588,"threshold_uncertainty_score":0.019068062},"labels":[],"label_agreement":null},{"id":"W2756635846","doi":"","title":"Paired domination number of generalized Petersen graphs P(n, 2).","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Discrete mathematics; Graph","score_opus":0.02345321183381491,"score_gpt":0.31202324743164106,"score_spread":0.2885700355978261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756635846","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8823421,0.0004713412,0.018017452,0.0008010217,0.000092847906,0.000041730862,0.0009941724,0.00018793339,0.09705142],"genre_scores_gemma":[0.9908832,0.00013628215,0.0033189761,0.00006346006,0.000035247624,0.000034323122,0.00029972996,0.00002317825,0.005205609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996308,0.000086559834,0.000012816313,0.00008799367,0.00008758862,0.00009420925],"domain_scores_gemma":[0.9984736,0.0008897361,0.00022016089,0.000113050824,0.00009799271,0.00020540341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035321558,0.00031144405,0.00030905852,0.0014206059,0.001302694,0.0020239796,0.0006793377,0.00072679255,0.011176019],"category_scores_gemma":[0.0023147848,0.0002566893,0.00021446403,0.0010264223,0.000935725,0.002167461,0.00090916164,0.0007835175,0.00070686155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006999022,0.00016347057,0.0071616345,0.00033818147,0.0001008247,0.00064657134,0.0007042623,0.018254349,0.011778129,0.8892694,0.016069962,0.054813273],"study_design_scores_gemma":[0.00010653905,0.0001216343,0.0073154196,0.00007711112,0.00009509502,0.001114801,0.0006429624,0.048459396,0.008943039,0.9169601,0.016117347,0.000046414523],"about_ca_topic_score_codex":0.00050811947,"about_ca_topic_score_gemma":0.0009793343,"teacher_disagreement_score":0.011176019,"about_ca_system_score_codex":0.0006682959,"about_ca_system_score_gemma":0.0005195309,"threshold_uncertainty_score":0.03738749},"labels":[],"label_agreement":null},{"id":"W2756820758","doi":"","title":"Dynamical 2-domination in Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016735094177169986,"score_gpt":0.3040113863474141,"score_spread":0.2872762921702441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756820758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43414533,0.0034056539,0.20553033,0.0041584363,0.0008469617,0.00012447315,0.00084085483,0.00063988444,0.35030806],"genre_scores_gemma":[0.9528861,0.0007383608,0.013131969,0.0005981299,0.0002971659,0.0000867318,0.00035646907,0.00013308549,0.03177192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949944,0.00015464905,0.000020404128,0.00009734674,0.00012897601,0.00009920635],"domain_scores_gemma":[0.99873143,0.000587994,0.00015825711,0.0001565971,0.00015999317,0.00020567386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044426005,0.00031702546,0.00032629046,0.001247694,0.0011032568,0.0017128037,0.0006916711,0.0008462052,0.009676881],"category_scores_gemma":[0.0023623158,0.00026970584,0.0005792955,0.00067276886,0.0016094109,0.0028162743,0.0014459458,0.0012059738,0.0010480323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020833286,0.000014945499,0.00034486124,0.000040869105,0.0000093832805,0.0001108846,0.00021753673,0.0011452824,0.001394653,0.9879396,0.002841056,0.005920041],"study_design_scores_gemma":[0.000014561823,0.000008430598,0.0003433118,0.000013336543,0.0000046930954,0.00024570053,0.0000837991,0.007265264,0.00049216516,0.985756,0.0057633463,0.000009379932],"about_ca_topic_score_codex":0.0008781701,"about_ca_topic_score_gemma":0.0015451588,"teacher_disagreement_score":0.009676881,"about_ca_system_score_codex":0.0009620283,"about_ca_system_score_gemma":0.00034818923,"threshold_uncertainty_score":0.032372355},"labels":[],"label_agreement":null},{"id":"W2757265255","doi":"10.1145/3282431","title":"Surjective H-Colouring over Reflexive Digraphs","year":2018,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Leverhulme Trust","keywords":"Surjective function; Mathematics; Combinatorics; Homomorphism; Transitive relation; Discrete mathematics; Unary operation; Digraph","score_opus":0.039183734717893305,"score_gpt":0.3530785267569117,"score_spread":0.3138947920390184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757265255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7771182,0.0003492034,0.20839372,0.0009810637,0.000043553853,0.000227563,0.0015530649,0.0008583966,0.010475243],"genre_scores_gemma":[0.95759207,0.0002228386,0.037521385,0.00018211197,0.000047189442,0.000076057804,0.0010792791,0.00007992667,0.0031992004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975758,0.00047384953,0.00019911946,0.0009821402,0.00034945784,0.00041956824],"domain_scores_gemma":[0.98608553,0.0084083015,0.0013252401,0.002587543,0.00063252804,0.00096079905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012652948,0.0006989341,0.0009024045,0.00082445896,0.0011749492,0.0039344057,0.0016229878,0.0010847021,0.0046993247],"category_scores_gemma":[0.006871922,0.0005578386,0.0016859856,0.0011116496,0.002844148,0.006472728,0.0024799493,0.0022707323,0.0003343452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087334967,0.00036457877,0.01698007,0.000970563,0.00027352825,0.0015182788,0.0023790286,0.12975118,0.026981125,0.73345315,0.0032267994,0.08322825],"study_design_scores_gemma":[0.000116763746,0.00015915664,0.003283002,0.000049668102,0.00013256099,0.0005841117,0.0005253302,0.1432664,0.013018946,0.83455104,0.0042391634,0.00007390073],"about_ca_topic_score_codex":0.0043935124,"about_ca_topic_score_gemma":0.0037661095,"teacher_disagreement_score":0.0046993247,"about_ca_system_score_codex":0.0022731263,"about_ca_system_score_gemma":0.0012496285,"threshold_uncertainty_score":0.016492784},"labels":[],"label_agreement":null},{"id":"W2757265658","doi":"","title":"On edge contractible graphs.","year":2017,"lang":"ceb","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Contractible space; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.02807968809315036,"score_gpt":0.3185918459763213,"score_spread":0.2905121578831709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757265658","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23845938,0.0029742804,0.35284582,0.004957552,0.0008413805,0.00018816907,0.0018469443,0.00087508705,0.39701143],"genre_scores_gemma":[0.79692304,0.0034263332,0.08402787,0.0014128706,0.0007098684,0.00021241062,0.0027033072,0.00054972264,0.11003461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989422,0.0002613837,0.00005234618,0.0002110022,0.00033583815,0.00019720984],"domain_scores_gemma":[0.99699175,0.0014673125,0.00032607457,0.0005328499,0.0002996618,0.00038228597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009001315,0.0006619883,0.00064208306,0.0021231247,0.0021614374,0.0022557955,0.0013122613,0.0011447814,0.016248457],"category_scores_gemma":[0.004012475,0.00046796078,0.0008656028,0.0025090266,0.0027567046,0.0071440884,0.0032074312,0.0030892058,0.0022126662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002736211,0.00002321922,0.00025079367,0.00006381698,0.0000074221443,0.00008573504,0.00018689624,0.0012675036,0.0004810889,0.98281753,0.0038977885,0.01089074],"study_design_scores_gemma":[0.000007090647,0.000008459026,0.00024664873,0.000030891297,0.0000073329957,0.00014392012,0.00010603254,0.0036010772,0.00032246497,0.9849636,0.01055511,0.0000073301007],"about_ca_topic_score_codex":0.0021820373,"about_ca_topic_score_gemma":0.0029503074,"teacher_disagreement_score":0.016248457,"about_ca_system_score_codex":0.0012829632,"about_ca_system_score_gemma":0.0006438264,"threshold_uncertainty_score":0.054356515},"labels":[],"label_agreement":null},{"id":"W2757539395","doi":"","title":"List vertex arboricity of graphs without forbidden minors.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Dense graph; Graph; 1-planar graph; Chordal graph; Planar graph","score_opus":0.023466917598065268,"score_gpt":0.3038951707554761,"score_spread":0.2804282531574108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757539395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.782601,0.00049906224,0.122786544,0.0010486298,0.00012807538,0.00013283371,0.0038315495,0.0013175292,0.08765475],"genre_scores_gemma":[0.9545044,0.00027637673,0.021793874,0.00021245377,0.000094253584,0.00009036616,0.0036571485,0.00019735073,0.01917385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965453,0.00008116753,0.00003187521,0.000080990925,0.000075057884,0.00007643651],"domain_scores_gemma":[0.9967277,0.0017878965,0.00058682525,0.00032378314,0.0003247833,0.00024897535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024908193,0.0003244569,0.00034403044,0.0011198471,0.0010585417,0.001951279,0.0007317589,0.00061952235,0.009650053],"category_scores_gemma":[0.0028033801,0.0003572961,0.00042495833,0.0011837392,0.00065854174,0.0019722793,0.00081209926,0.00085070916,0.0016089964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009669839,0.00024291653,0.009415008,0.00055134454,0.00009860292,0.0018650893,0.0014225969,0.008236619,0.03545057,0.85993415,0.018486986,0.06332898],"study_design_scores_gemma":[0.00010656898,0.0001878053,0.00451095,0.00009252518,0.00011846256,0.0021431036,0.0007136389,0.029341318,0.015251079,0.92260337,0.02488828,0.00004282495],"about_ca_topic_score_codex":0.00086522347,"about_ca_topic_score_gemma":0.001433963,"teacher_disagreement_score":0.009650053,"about_ca_system_score_codex":0.0005226648,"about_ca_system_score_gemma":0.00040025797,"threshold_uncertainty_score":0.03228265},"labels":[],"label_agreement":null},{"id":"W2758261578","doi":"","title":"List vertex arboricity of planar graphs with 5-cycles not adjacent to 3-cycles and 4-cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Planar graph; Planar; Dense graph; 1-planar graph; Graph; Chordal graph; Computer science","score_opus":0.02108818712877475,"score_gpt":0.28472312712576175,"score_spread":0.263634939996987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758261578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86203974,0.0005640278,0.023554701,0.00055455463,0.00010936117,0.000116167925,0.00951271,0.00095434015,0.10259438],"genre_scores_gemma":[0.96494037,0.00033326665,0.012806224,0.000119430886,0.000050131333,0.000083569,0.009484793,0.0001141214,0.012067955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998416,0.000024730823,0.000016620377,0.00003194058,0.000038466307,0.00004666744],"domain_scores_gemma":[0.9986927,0.0005917503,0.0002852688,0.00009079854,0.0002192392,0.00012020113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010182394,0.0002710918,0.00025220573,0.0015752113,0.00092746806,0.0011547359,0.00049482886,0.00044844556,0.016717006],"category_scores_gemma":[0.001276733,0.00020658769,0.0002652108,0.0016099334,0.0003493242,0.0009954547,0.0005230393,0.00044682875,0.0019081716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029576046,0.00039812818,0.054693215,0.0020323163,0.00027623083,0.0051784585,0.0020339394,0.029153902,0.11521511,0.5011657,0.06747266,0.21942268],"study_design_scores_gemma":[0.0003025068,0.0008438656,0.046649933,0.0003996235,0.00041481832,0.0057184277,0.0034250594,0.0877111,0.08266931,0.6334591,0.13827077,0.00013551489],"about_ca_topic_score_codex":0.0013782136,"about_ca_topic_score_gemma":0.002309607,"teacher_disagreement_score":0.016717006,"about_ca_system_score_codex":0.000435868,"about_ca_system_score_gemma":0.00032091507,"threshold_uncertainty_score":0.055924},"labels":[],"label_agreement":null},{"id":"W2758506936","doi":"","title":"Limited packing vs tuple domination in graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tuple; Combinatorics; Discrete mathematics","score_opus":0.023760716884239745,"score_gpt":0.3022128325809602,"score_spread":0.27845211569672046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758506936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43476176,0.0072109983,0.38674533,0.0058504418,0.0006696954,0.00015093754,0.0012323958,0.0010869456,0.16229145],"genre_scores_gemma":[0.9281173,0.002755329,0.04564319,0.0010817534,0.0005230818,0.00011702283,0.00071540393,0.0004041248,0.020642849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979492,0.0007294661,0.00010015338,0.00039071208,0.0004383436,0.0003921545],"domain_scores_gemma":[0.98670954,0.008177456,0.0010630796,0.0026051388,0.00052456517,0.00092014804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017791011,0.00051855476,0.0010728422,0.0012421133,0.0018309592,0.0036234153,0.0021061832,0.0016076074,0.013699545],"category_scores_gemma":[0.011376942,0.00061686867,0.00084441184,0.0025543813,0.0032065532,0.011522836,0.0032923878,0.0025556048,0.001599676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032659332,0.00012878932,0.0017981488,0.00028666182,0.00004470532,0.0002595448,0.00056463666,0.013389164,0.0026463196,0.9171093,0.008175348,0.055270784],"study_design_scores_gemma":[0.00003341719,0.000079993675,0.0007132159,0.00010871329,0.00005719922,0.0006256626,0.00034470583,0.03470058,0.0023477033,0.950456,0.010509812,0.000022898035],"about_ca_topic_score_codex":0.00091568794,"about_ca_topic_score_gemma":0.0012322529,"teacher_disagreement_score":0.013699545,"about_ca_system_score_codex":0.0012116082,"about_ca_system_score_gemma":0.0007002819,"threshold_uncertainty_score":0.045829475},"labels":[],"label_agreement":null},{"id":"W2758767216","doi":"","title":"More on domination polynomial and domination root.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Root (linguistics); Polynomial; Mathematical analysis; Linguistics; Philosophy","score_opus":0.015441702672047083,"score_gpt":0.3030483105918106,"score_spread":0.2876066079197635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758767216","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006228895,0.1013584,0.095957644,0.112592064,0.026669627,0.000084405714,0.0039296653,0.001133295,0.652046],"genre_scores_gemma":[0.13688259,0.08839719,0.06635392,0.07551568,0.037659567,0.00023082484,0.0070518446,0.0025620472,0.58534634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901474,0.00020755312,0.000043842367,0.00021554054,0.00037321707,0.00014510757],"domain_scores_gemma":[0.99771714,0.0012140003,0.00010506161,0.0004454496,0.00038948646,0.00012892664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012588786,0.001217259,0.0016054407,0.0030417107,0.0015953045,0.0023387603,0.0022675714,0.0024651063,0.08363988],"category_scores_gemma":[0.004149537,0.0006811357,0.0016821217,0.0052585197,0.0035297242,0.016759854,0.0020079634,0.0054150913,0.018517554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006231214,0.0001496425,0.0005901206,0.0007246006,0.00006370544,0.00022856129,0.0004377981,0.001255392,0.0010587451,0.534763,0.39310706,0.06755917],"study_design_scores_gemma":[0.000017500097,0.000024638362,0.00086325547,0.00015622932,0.000022943717,0.00022128937,0.00012973163,0.0004860385,0.00052384817,0.5443745,0.45314363,0.000036307585],"about_ca_topic_score_codex":0.006318884,"about_ca_topic_score_gemma":0.010427835,"teacher_disagreement_score":0.08363988,"about_ca_system_score_codex":0.002265461,"about_ca_system_score_gemma":0.00068967626,"threshold_uncertainty_score":0.27980334},"labels":[],"label_agreement":null},{"id":"W2759598964","doi":"","title":"On the domination number of digraphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01990610623612386,"score_gpt":0.3113467483938648,"score_spread":0.2914406421577409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759598964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5234935,0.0057961303,0.14966705,0.008432412,0.0006393947,0.00013804466,0.0031286033,0.00061927055,0.3080856],"genre_scores_gemma":[0.95917153,0.002165093,0.018102013,0.00051098655,0.0005928356,0.0001540727,0.0009567727,0.00018741572,0.01815929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830294,0.0005329387,0.0000930146,0.00033680495,0.00041123418,0.00032291657],"domain_scores_gemma":[0.9749767,0.0200188,0.0013691911,0.0011240848,0.0009148429,0.0015964396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019170566,0.0007192283,0.0011033961,0.0049342285,0.0019948892,0.0039622267,0.0018830227,0.0014150013,0.013927058],"category_scores_gemma":[0.016904926,0.0006436491,0.0006246033,0.003473066,0.003208947,0.00992408,0.0023423221,0.0028261864,0.0012310587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001756789,0.000054031407,0.0025759088,0.000201791,0.000041173193,0.00011847721,0.0004004791,0.008505569,0.0014258621,0.9523865,0.009419301,0.024695132],"study_design_scores_gemma":[0.000035524125,0.000027569056,0.0014611372,0.00007898,0.00003653843,0.0002917817,0.00014340109,0.025510514,0.00086217746,0.9643025,0.007223617,0.000026339587],"about_ca_topic_score_codex":0.0015355801,"about_ca_topic_score_gemma":0.0020860268,"teacher_disagreement_score":0.013927058,"about_ca_system_score_codex":0.002715014,"about_ca_system_score_gemma":0.00080091355,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2760251569","doi":"","title":"On the rainbow connection number of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Connection (principal bundle); Rainbow; Combinatorics; Geometry; Physics","score_opus":0.023847869553828203,"score_gpt":0.3087465662367306,"score_spread":0.28489869668290235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760251569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48600137,0.009417348,0.14062709,0.010266768,0.0027479155,0.00011769563,0.0014269204,0.0009491331,0.3484458],"genre_scores_gemma":[0.95282984,0.003634412,0.020121872,0.0007033116,0.0013949862,0.00015822859,0.0005930837,0.00035160937,0.020212786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989629,0.00032844403,0.000048840222,0.00023972143,0.00023680142,0.0001833381],"domain_scores_gemma":[0.99168944,0.0054020076,0.00087800465,0.0005991904,0.0005300322,0.00090140285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015340217,0.00078920997,0.00095844985,0.005452762,0.0020010837,0.0026166306,0.0019216312,0.0017555793,0.01626261],"category_scores_gemma":[0.013132113,0.0005409293,0.00052765664,0.003413775,0.003748117,0.010474027,0.0029498881,0.0031552147,0.0021538546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014447975,0.00004062081,0.0010914472,0.0001719056,0.000019937472,0.0000721718,0.00019379177,0.003608895,0.0010641556,0.96664566,0.009087517,0.017859425],"study_design_scores_gemma":[0.000019529478,0.000024812813,0.0008143529,0.00006065244,0.000019179086,0.0001324454,0.0000890207,0.009813471,0.0005194778,0.98349,0.0049932185,0.000023728022],"about_ca_topic_score_codex":0.00093420834,"about_ca_topic_score_gemma":0.0011227647,"teacher_disagreement_score":0.01626261,"about_ca_system_score_codex":0.0017688974,"about_ca_system_score_gemma":0.00058858295,"threshold_uncertainty_score":0.0544039},"labels":[],"label_agreement":null},{"id":"W2761096769","doi":"10.1002/jgt.22032","title":"Planar Digraphs of Digirth Five Are 2‐Colorable","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Digraph; Combinatorics; Mathematics; Conjecture; Monochromatic color; Planar; Planar graph; Colored; Discrete mathematics; Computer science; Graph; Physics","score_opus":0.013728620320958772,"score_gpt":0.2608323699805069,"score_spread":0.24710374965954812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761096769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87020147,0.0006741201,0.067367785,0.0017800395,0.00017947645,0.00018106533,0.0026650743,0.000816099,0.056134924],"genre_scores_gemma":[0.9766722,0.00041520494,0.012437489,0.00050572015,0.000041987794,0.00007845737,0.0018750536,0.000045339486,0.007928498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939203,0.0000847324,0.000040034178,0.00018573916,0.00009146138,0.00020599566],"domain_scores_gemma":[0.9967051,0.0016657977,0.0005078565,0.0003943904,0.00035153408,0.00037529363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033909967,0.0005460555,0.00062832783,0.00077695464,0.0013055508,0.0024466491,0.0008654807,0.0007132952,0.009572085],"category_scores_gemma":[0.0025043706,0.0007817794,0.0008318396,0.0010732291,0.0014068579,0.0021641396,0.0012397475,0.0014069552,0.00070854457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001926041,0.0003897103,0.016662475,0.0018637751,0.00034509925,0.0020079352,0.002048803,0.05961591,0.045998495,0.7691825,0.019864991,0.080094256],"study_design_scores_gemma":[0.00044493016,0.00031729884,0.010790054,0.00017190966,0.00032629346,0.001708896,0.001409692,0.047444023,0.027418308,0.8673717,0.04240724,0.0001897734],"about_ca_topic_score_codex":0.004126842,"about_ca_topic_score_gemma":0.005698362,"teacher_disagreement_score":0.009572085,"about_ca_system_score_codex":0.0016494218,"about_ca_system_score_gemma":0.0007802604,"threshold_uncertainty_score":0.03202182},"labels":[],"label_agreement":null},{"id":"W2761101429","doi":"10.1137/17m1160094","title":"Doubly Exponentially Many Ingleton Matroids","year":2018,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Combinatorics; Mathematics; Set (abstract data type); Graphic matroid; Exponential growth; Exponential function; Matroid partitioning; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.03661481439885163,"score_gpt":0.3226857304034973,"score_spread":0.2860709160046457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761101429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90090245,0.00059013604,0.06150759,0.002773899,0.00010481591,0.000035485064,0.0013154153,0.0003608501,0.032409396],"genre_scores_gemma":[0.96186495,0.0003796987,0.023208464,0.00044963384,0.00018693667,0.0001016674,0.0016766383,0.000114352115,0.012017607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852765,0.00025412667,0.000084275984,0.00039134626,0.00040596278,0.0003367142],"domain_scores_gemma":[0.9937989,0.0028148715,0.000888021,0.0012883845,0.0005597656,0.0006499705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396759,0.00063551276,0.0008384299,0.00087675033,0.0015563596,0.0031390258,0.0016758938,0.0012433738,0.0063444595],"category_scores_gemma":[0.0066154306,0.00054432324,0.0007705402,0.0013409333,0.0014063623,0.0059295655,0.0022591883,0.0022044647,0.0006256871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070892595,0.00022199491,0.009932816,0.0002416853,0.00008677741,0.00052841956,0.00068416103,0.013370794,0.011349583,0.9077906,0.010090346,0.044993863],"study_design_scores_gemma":[0.0000576734,0.000071061775,0.00379892,0.0000424237,0.000071586954,0.0011096185,0.0003073815,0.06585151,0.005958513,0.90867925,0.014013368,0.000038652903],"about_ca_topic_score_codex":0.0006325805,"about_ca_topic_score_gemma":0.0009372302,"teacher_disagreement_score":0.0063444595,"about_ca_system_score_codex":0.0015927235,"about_ca_system_score_gemma":0.00047705285,"threshold_uncertainty_score":0.02122438},"labels":[],"label_agreement":null},{"id":"W276204174","doi":"10.5555/2095116.2095171","title":"Finding an induced path of given parity in planar graphs in polynomial time","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Longest path problem; Mathematics; Discrete mathematics; Parity (physics); Planar graph; Time complexity; Graph; Chordal graph; Physics","score_opus":0.04210135392847901,"score_gpt":0.3148093836442222,"score_spread":0.27270802971574315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W276204174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60971725,0.0005101346,0.3682689,0.0027266988,0.00011391298,0.00057091797,0.0031390758,0.0046803774,0.010272785],"genre_scores_gemma":[0.7192355,0.0005500002,0.26836267,0.00033015184,0.00007902329,0.0002310268,0.0062723975,0.0003439162,0.0045953183],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908304,0.00015886109,0.00007252854,0.00031984007,0.00016300693,0.00020265135],"domain_scores_gemma":[0.9961533,0.0025420624,0.0005342461,0.00039523336,0.00020677102,0.00016842024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006170333,0.0007373885,0.0010554418,0.0005874467,0.00105272,0.002162927,0.0011589736,0.0011747931,0.005214681],"category_scores_gemma":[0.005296534,0.0006970556,0.0015644185,0.0012176892,0.0011927384,0.004091653,0.0015430005,0.0013459008,0.0007486327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037425635,0.0013523232,0.019976879,0.004187331,0.000462639,0.0021126124,0.0018707686,0.22897302,0.10484265,0.12841867,0.029106962,0.47495362],"study_design_scores_gemma":[0.00085074804,0.0011474363,0.004926481,0.00015343635,0.00041595913,0.0021908765,0.0013271588,0.4468149,0.06468267,0.46339765,0.013963694,0.00012902438],"about_ca_topic_score_codex":0.0026307967,"about_ca_topic_score_gemma":0.003756024,"teacher_disagreement_score":0.005214681,"about_ca_system_score_codex":0.0011727621,"about_ca_system_score_gemma":0.0021928833,"threshold_uncertainty_score":0.017444909},"labels":[],"label_agreement":null},{"id":"W2763773774","doi":"10.1016/j.jcss.2015.06.011","title":"The complexity of minimum-length path decompositions","year":2015,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki; Narodowe Centrum Nauki","keywords":"Mathematics; Combinatorics; Pathwidth; Discrete mathematics; Path (computing); Time complexity; Graph; Generalization; Longest path problem; Chordal graph; Line graph; Computer science","score_opus":0.08791787131458557,"score_gpt":0.33166942746323375,"score_spread":0.24375155614864819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763773774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6998765,0.0021823486,0.24318764,0.007859262,0.00026673725,0.0003996149,0.0093845185,0.0020237518,0.03481968],"genre_scores_gemma":[0.85381293,0.0015243309,0.12618653,0.0004950874,0.00029505248,0.00030277827,0.0073697274,0.00079276814,0.009220822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975222,0.00065353024,0.00018011528,0.00049535296,0.0007429951,0.00040577337],"domain_scores_gemma":[0.9752407,0.019248478,0.0016261591,0.0019182638,0.0009818145,0.0009845884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017680941,0.0012232693,0.0017156443,0.0016925443,0.001424532,0.006157373,0.0029895226,0.0024617314,0.017083092],"category_scores_gemma":[0.021759674,0.0012420511,0.0016661087,0.003340074,0.0015981406,0.010379901,0.002916873,0.0027192351,0.0018540095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002955353,0.0007673615,0.008339414,0.0018979369,0.0003726337,0.0005734789,0.0013390554,0.4626088,0.017766522,0.24373998,0.043713015,0.21592635],"study_design_scores_gemma":[0.00029965065,0.00013001499,0.0013869983,0.000071744966,0.0001141034,0.00029197824,0.0004098722,0.4809095,0.0024291957,0.51068085,0.0032357613,0.000040334846],"about_ca_topic_score_codex":0.0028715571,"about_ca_topic_score_gemma":0.004049383,"teacher_disagreement_score":0.017083092,"about_ca_system_score_codex":0.002637746,"about_ca_system_score_gemma":0.0025284006,"threshold_uncertainty_score":0.057148576},"labels":[],"label_agreement":null},{"id":"W2765788600","doi":"10.1002/jgt.22143","title":"Retraction: ‘Quasi‐Graphic Matroids’ by J. Geelen, B. Gerards and G. Whittle","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Mathematics; Combinatorics","score_opus":0.01420890413153508,"score_gpt":0.29248860798138504,"score_spread":0.27827970384984996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765788600","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036646635,0.0037042813,0.004133555,0.11508958,0.8711075,0.000030219264,0.00087578915,0.0003415806,0.0043509994],"genre_scores_gemma":[0.03249668,0.026781263,0.021898488,0.14817859,0.6021518,0.00039561072,0.006002814,0.0032592162,0.15883559],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9903464,0.0025704768,0.0015730882,0.0016800301,0.003290444,0.0005395807],"domain_scores_gemma":[0.9518265,0.019379664,0.002207524,0.0033931907,0.02137235,0.0018207463],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0071125976,0.0036718673,0.002216162,0.003795501,0.0039722756,0.005832408,0.0042755217,0.007949222,0.046131887],"category_scores_gemma":[0.10765904,0.0013205317,0.0025427565,0.0030668075,0.00472058,0.0068331105,0.0035310509,0.013853196,0.028732968],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022686192,0.0000038613503,0.000022357937,0.00017003858,0.000016847534,0.000084570995,0.0000803344,0.000052713433,0.00008960702,0.00482797,0.9888721,0.005756919],"study_design_scores_gemma":[0.000018824065,0.000022442926,0.00027319894,0.00027106382,0.000034500703,0.00059850636,0.00011413656,0.00028497603,0.0002732578,0.0060315994,0.9920387,0.00003880398],"about_ca_topic_score_codex":0.0044493047,"about_ca_topic_score_gemma":0.0031841055,"teacher_disagreement_score":0.99205077,"about_ca_system_score_codex":0.005059768,"about_ca_system_score_gemma":0.0047138524,"threshold_uncertainty_score":0.1543265},"labels":[],"label_agreement":null},{"id":"W2766314920","doi":"10.48550/arxiv.1710.10112","title":"Hyperopic Cops and Robbers","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; St. Francis Xavier University; Acadia University; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Countable set; Discrete mathematics","score_opus":0.09949136672195237,"score_gpt":0.22190846105803536,"score_spread":0.12241709433608298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766314920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5315443,0.00073667313,0.37661818,0.00153246,0.00018576033,0.00016360727,0.00050929136,0.00032667682,0.088383034],"genre_scores_gemma":[0.9658107,0.00024413146,0.024351701,0.00016115636,0.000069250775,0.00012369691,0.00016158295,0.00008452065,0.008993226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986035,0.0003919912,0.000050047034,0.00037164235,0.00030968455,0.00027326125],"domain_scores_gemma":[0.99695504,0.0012652215,0.000497641,0.0004352506,0.00022716232,0.00061977265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007154615,0.00074713957,0.00082484126,0.001008233,0.0013319865,0.0025007068,0.0016578252,0.0010814756,0.008679792],"category_scores_gemma":[0.0056252833,0.00043884784,0.0005897856,0.00071988144,0.0036708503,0.005169636,0.0027643538,0.0017806522,0.00051929546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010945185,0.000028795706,0.0010431502,0.00006820642,0.000026513078,0.00027535696,0.00029231983,0.014427791,0.002869127,0.9719545,0.0016454458,0.0072592716],"study_design_scores_gemma":[0.000038518516,0.00008841175,0.0015090017,0.00004845839,0.000033035547,0.0005214714,0.00045662498,0.11572007,0.0026898272,0.8669346,0.011908663,0.000051290495],"about_ca_topic_score_codex":0.0018381613,"about_ca_topic_score_gemma":0.0016487812,"teacher_disagreement_score":0.008679792,"about_ca_system_score_codex":0.0011641313,"about_ca_system_score_gemma":0.0005496931,"threshold_uncertainty_score":0.02903676},"labels":[],"label_agreement":null},{"id":"W2766367798","doi":"10.23638/dmtcs-20-2-4","title":"Complexity of locally-injective homomorphisms to tournaments","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Homomorphism; Injective function; Mathematics; Neighbourhood (mathematics); Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.04145060192530764,"score_gpt":0.3299344338413944,"score_spread":0.2884838319160868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766367798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89138,0.00060597644,0.07689434,0.0048342035,0.00011181815,0.00027948077,0.0024089313,0.0010506322,0.022434605],"genre_scores_gemma":[0.9728961,0.00040028544,0.016195543,0.0003644637,0.0001628466,0.00017342968,0.0024608443,0.00018825523,0.0071583013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972312,0.0007382291,0.00018969581,0.00084987184,0.00039631358,0.0005946257],"domain_scores_gemma":[0.98372144,0.011542456,0.001189753,0.0015107897,0.0005856507,0.0014498644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016955289,0.00079148216,0.0014237582,0.00064056145,0.0017059507,0.0075493553,0.003203371,0.0020621587,0.018068142],"category_scores_gemma":[0.016194597,0.0008073501,0.0019318424,0.0013943891,0.0025397807,0.011318854,0.0038962916,0.0034783594,0.001193634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029545021,0.0012303178,0.02428465,0.0018618968,0.00044656981,0.0012573805,0.0050169104,0.19376822,0.012479192,0.64213216,0.02467388,0.08989441],"study_design_scores_gemma":[0.0003964182,0.00016430476,0.0026682154,0.000057954163,0.0001540581,0.00051587186,0.0011642099,0.16663466,0.004205128,0.81931555,0.004661401,0.000062292194],"about_ca_topic_score_codex":0.0035059634,"about_ca_topic_score_gemma":0.002907668,"teacher_disagreement_score":0.018068142,"about_ca_system_score_codex":0.0029204895,"about_ca_system_score_gemma":0.0017956815,"threshold_uncertainty_score":0.060443938},"labels":[],"label_agreement":null},{"id":"W2766396921","doi":"10.1016/j.jctb.2017.10.001","title":"Domination in tournaments","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; McGill University; Agence Nationale de la Recherche; National Science Foundation","keywords":"Tournament; Conjecture; Combinatorics; Mathematics; Vertex (graph theory); Dimension (graph theory); Transitive relation; Set (abstract data type); Bounded function; Class (philosophy); Discrete mathematics; Computer science; Artificial intelligence; Graph","score_opus":0.016693407880547576,"score_gpt":0.30968788798114705,"score_spread":0.2929944801005995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766396921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86113286,0.00089598045,0.058915265,0.0019689824,0.00015344222,0.00006150653,0.00028384675,0.00019144075,0.076396614],"genre_scores_gemma":[0.9862388,0.00022245545,0.0034204626,0.00013743169,0.00012555494,0.000041281794,0.00017282617,0.000050292838,0.009590913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980393,0.0007435682,0.000087415894,0.0003358743,0.0003315199,0.00046239703],"domain_scores_gemma":[0.98841405,0.0074246577,0.0011450442,0.0006669653,0.00076108583,0.0015882029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016861164,0.00047884698,0.001353976,0.0020858075,0.0032765267,0.0073855286,0.0016001946,0.0016635061,0.00876022],"category_scores_gemma":[0.012781497,0.0008195997,0.0009400133,0.002651615,0.0033410457,0.0039700083,0.0022460064,0.002312571,0.00051037536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026118907,0.00009996568,0.0043392642,0.00008252286,0.00006860771,0.0002760009,0.0009957743,0.00819452,0.0015088718,0.967979,0.0036294726,0.012564845],"study_design_scores_gemma":[0.00008721999,0.00003261685,0.0014466651,0.000020002824,0.00004389111,0.00029524945,0.00026005475,0.033474937,0.0003698602,0.96107394,0.0028719795,0.000023532995],"about_ca_topic_score_codex":0.003465824,"about_ca_topic_score_gemma":0.003579338,"teacher_disagreement_score":0.00876022,"about_ca_system_score_codex":0.002254836,"about_ca_system_score_gemma":0.00089436804,"threshold_uncertainty_score":0.029305816},"labels":[],"label_agreement":null},{"id":"W2767821037","doi":"","title":"Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Edge coloring; Planar graph; Outerplanar graph; Planar; Pathwidth; Computer science; Graph; Telecommunications; Computer graphics (images); Line graph","score_opus":0.029177778095805466,"score_gpt":0.3063361373083527,"score_spread":0.2771583592125472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767821037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6742799,0.0017066797,0.1382373,0.0012153361,0.00043860305,0.00015102523,0.0022076117,0.0011601632,0.18060322],"genre_scores_gemma":[0.91038424,0.00073026336,0.057626817,0.00035998938,0.00007592035,0.00006444726,0.0021799265,0.0002607243,0.028317673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996964,0.00006976935,0.000014855699,0.00006140663,0.000053263357,0.00010427445],"domain_scores_gemma":[0.9991109,0.0003627635,0.00014977902,0.00014362599,0.00012629581,0.000106672305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019168244,0.00038497004,0.0003344944,0.0006233063,0.00095497456,0.0013250741,0.00088140793,0.0007110254,0.010711448],"category_scores_gemma":[0.0015654467,0.0003730637,0.0003911011,0.0009110985,0.00063233904,0.0012274121,0.0008716244,0.00078285293,0.0015557115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086641783,0.000231616,0.005372202,0.0006583675,0.00007455932,0.0011524507,0.00073326845,0.030556621,0.027506093,0.7755991,0.03366707,0.12358218],"study_design_scores_gemma":[0.00013439807,0.00014215465,0.005115486,0.00012933716,0.00008529218,0.0013856062,0.0007155795,0.052230444,0.012451122,0.88630664,0.041251272,0.000052759795],"about_ca_topic_score_codex":0.0029615401,"about_ca_topic_score_gemma":0.004997286,"teacher_disagreement_score":0.010711448,"about_ca_system_score_codex":0.0006539626,"about_ca_system_score_gemma":0.0004802597,"threshold_uncertainty_score":0.03583342},"labels":[],"label_agreement":null},{"id":"W2767932262","doi":"","title":"Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Wheel graph; Planar graph; Planar; Graph; Graph power; Computer science; Line graph; Computer graphics (images)","score_opus":0.034848686404975196,"score_gpt":0.3167078772517278,"score_spread":0.2818591908467526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767932262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6016638,0.0011349432,0.09906428,0.003737062,0.00077169185,0.00025661988,0.006964763,0.0022566018,0.2841503],"genre_scores_gemma":[0.89667624,0.0011496614,0.04051598,0.0011041701,0.00012950835,0.00017790677,0.007143129,0.00037961444,0.052723743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952626,0.000048311522,0.000019018125,0.00015346608,0.00009163834,0.00016128787],"domain_scores_gemma":[0.9987576,0.0003678932,0.00030716282,0.00020195474,0.00017816853,0.00018728059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002430467,0.000931347,0.0007025004,0.00078769337,0.0016411251,0.0023060038,0.0013504119,0.0012616003,0.026129093],"category_scores_gemma":[0.0012441742,0.000673713,0.0010363829,0.0011574803,0.0015943842,0.0022275343,0.0014924457,0.0016892554,0.0037162546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001550243,0.000549284,0.0056224014,0.0020713052,0.00040364158,0.0022242535,0.00088469207,0.014045821,0.06261277,0.67249715,0.058973297,0.17856506],"study_design_scores_gemma":[0.00025671563,0.00034156116,0.010066214,0.00022005869,0.00038282995,0.0024336532,0.0006902663,0.008663855,0.03445115,0.82731396,0.11504451,0.00013521346],"about_ca_topic_score_codex":0.0020210517,"about_ca_topic_score_gemma":0.0032827302,"teacher_disagreement_score":0.026129093,"about_ca_system_score_codex":0.00082974456,"about_ca_system_score_gemma":0.00070902717,"threshold_uncertainty_score":0.08741051},"labels":[],"label_agreement":null},{"id":"W2770344522","doi":"10.1016/j.dam.2017.10.027","title":"Perfect Roman domination in trees","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Johannesburg; National Research Foundation","keywords":"Mathematics; Combinatorics; Domination analysis; Vertex (graph theory); Minimum weight; Graph; Upper and lower bounds; Dominating set; Function (biology)","score_opus":0.023091819163926455,"score_gpt":0.31078932494871553,"score_spread":0.2876975057847891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770344522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7050993,0.000877326,0.06674884,0.0022777414,0.00017884737,0.00006652471,0.0003932881,0.00027580958,0.22408226],"genre_scores_gemma":[0.9774383,0.00029755657,0.0053524235,0.00021153172,0.000100291785,0.000032888034,0.00017565284,0.00006579692,0.016325597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985781,0.00047691577,0.000050759554,0.00019537356,0.0003300668,0.0003688727],"domain_scores_gemma":[0.9957202,0.0024695809,0.00048538906,0.00037090268,0.00040617606,0.00054781896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010947259,0.0002931964,0.00090063974,0.0015742539,0.0029383656,0.0045445906,0.0008832806,0.0011253646,0.008464111],"category_scores_gemma":[0.007653935,0.0005342514,0.0005024792,0.0020417026,0.003478958,0.0037958187,0.0020974204,0.0017839278,0.0009059082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042993317,0.000009713992,0.00034919335,0.000023129607,0.000005577867,0.00006469387,0.00031325634,0.0010217145,0.00033509647,0.9935582,0.0011205834,0.0031558818],"study_design_scores_gemma":[0.000022100463,0.000007276729,0.00025695667,0.000011092343,0.0000080226355,0.00011843099,0.00014034242,0.0047383355,0.00028830388,0.99193656,0.0024649652,0.0000076141446],"about_ca_topic_score_codex":0.0014962472,"about_ca_topic_score_gemma":0.0018368267,"teacher_disagreement_score":0.008464111,"about_ca_system_score_codex":0.0012083098,"about_ca_system_score_gemma":0.00080693397,"threshold_uncertainty_score":0.028315246},"labels":[],"label_agreement":null},{"id":"W2778851403","doi":"10.1137/1.9781611975031.17","title":"A Polynomial Excluded-Minor Approximation of Treedepth","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Combinatorics; Mathematics; Pathwidth; Minor (academic); Partial k-tree; 1-planar graph; Discrete mathematics; Tree decomposition; Graph minor; Planar graph; Bounded function; Tree-depth; Graph; Chordal graph; Line graph; Voltage graph","score_opus":0.07880150073156854,"score_gpt":0.27821666726179095,"score_spread":0.1994151665302224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778851403","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13017382,0.0022470574,0.82200265,0.0025308644,0.00038280236,0.00014292581,0.0014395046,0.004205391,0.036875043],"genre_scores_gemma":[0.6523529,0.0015463287,0.32093036,0.0010259486,0.00030750278,0.00020857061,0.0023876722,0.0016324179,0.019608347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908125,0.00010923321,0.0000301379,0.00033680064,0.0002973256,0.00014530956],"domain_scores_gemma":[0.99571544,0.0021031492,0.0002663902,0.0014118381,0.00027647865,0.00022680135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008408068,0.0010122273,0.0010616235,0.00080075517,0.000941729,0.002467774,0.002080922,0.0008004298,0.009244382],"category_scores_gemma":[0.0071577313,0.00055856194,0.0014678508,0.0014250448,0.0013014562,0.005750282,0.0020974232,0.0034730912,0.0024586632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013769587,0.00034646524,0.0044738464,0.0009573536,0.00009823899,0.00031017308,0.0008292872,0.080259874,0.040214386,0.55089855,0.041487377,0.27874753],"study_design_scores_gemma":[0.00012575049,0.0003041838,0.0021438804,0.00011704279,0.00011086695,0.0007986731,0.00016618613,0.35798484,0.013591764,0.5793498,0.0452357,0.00007127523],"about_ca_topic_score_codex":0.0022346196,"about_ca_topic_score_gemma":0.0033941986,"teacher_disagreement_score":0.009244382,"about_ca_system_score_codex":0.0026968622,"about_ca_system_score_gemma":0.0014215878,"threshold_uncertainty_score":0.030925512},"labels":[],"label_agreement":null},{"id":"W2779612036","doi":"10.1016/j.disc.2018.05.017","title":"Throttling for the game of Cops and Robbers on graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Bandwidth throttling; Combinatorics; Mathematics; Hypercube; Graph; Discrete mathematics; Physics","score_opus":0.04886693414521081,"score_gpt":0.34045688068476365,"score_spread":0.29158994653955284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779612036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3335036,0.00073043804,0.56365407,0.0039885533,0.0003820098,0.00044180106,0.0006499201,0.0007223983,0.09592725],"genre_scores_gemma":[0.9095435,0.0005090996,0.044858027,0.00041680745,0.00017400699,0.00031092335,0.0004175411,0.0003474136,0.043422688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986975,0.00041767527,0.00004957082,0.00030184462,0.00017232145,0.00036111465],"domain_scores_gemma":[0.9963032,0.0021508667,0.00028481704,0.00027483897,0.00018337755,0.0008028927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012806797,0.0021126382,0.0017166489,0.0011899673,0.0023472335,0.0032631967,0.0028249412,0.0032068978,0.022673871],"category_scores_gemma":[0.008159489,0.00086098886,0.0012306097,0.00089583365,0.003448671,0.006279551,0.00282756,0.00388596,0.0014612408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035331422,0.00013457531,0.000380423,0.00023177787,0.00004952005,0.00021780991,0.00066658796,0.101779684,0.0019446623,0.87300515,0.007930035,0.013306513],"study_design_scores_gemma":[0.0000467585,0.000052171185,0.000121233075,0.000021819651,0.000016056934,0.000036351194,0.00016459668,0.20157762,0.00024129164,0.79586256,0.0018345668,0.000024925503],"about_ca_topic_score_codex":0.0076169735,"about_ca_topic_score_gemma":0.006641022,"teacher_disagreement_score":0.022673871,"about_ca_system_score_codex":0.0022851676,"about_ca_system_score_gemma":0.0018701339,"threshold_uncertainty_score":0.07585168},"labels":[],"label_agreement":null},{"id":"W2779660954","doi":"10.1137/1.9781611975031.15","title":"A submodular measure and approximate Gomory-Hu theorem for packing odd trails","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Discrete mathematics; Vertex (graph theory); Dual graph; Disjoint sets; Bipartite graph; Perimeter; Submodular set function; Graph; Planar graph; Geometry","score_opus":0.08882011198420672,"score_gpt":0.2753661026118458,"score_spread":0.18654599062763907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779660954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41302988,0.00035332787,0.57924944,0.0004708911,0.0000345211,0.00005430828,0.0005004609,0.00071490376,0.0055922666],"genre_scores_gemma":[0.84260714,0.00019343334,0.15431747,0.00015212309,0.000043498458,0.000090365866,0.00051288644,0.00013650434,0.0019465238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994442,0.0000919969,0.00003186079,0.00014932884,0.00018037562,0.00010231461],"domain_scores_gemma":[0.99797016,0.0008813205,0.0002701837,0.0005637141,0.0001539026,0.00016068178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075156917,0.00040854522,0.00082458305,0.0013009246,0.0007060694,0.0015473806,0.0011161466,0.0005480797,0.0018363188],"category_scores_gemma":[0.005426619,0.0003365077,0.00071999186,0.0014027074,0.0018767589,0.0044362326,0.0018606447,0.0011118292,0.0002727747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026089128,0.00009073549,0.0039347806,0.00013445127,0.000047227633,0.00019232275,0.00061342266,0.084938414,0.011066831,0.82590884,0.003352536,0.069459535],"study_design_scores_gemma":[0.000030825115,0.00014735515,0.001181338,0.000029606248,0.00002316581,0.00022835398,0.00014502111,0.43451792,0.007765413,0.55223745,0.0036522562,0.000041262094],"about_ca_topic_score_codex":0.0017845053,"about_ca_topic_score_gemma":0.0014292893,"teacher_disagreement_score":0.0018363188,"about_ca_system_score_codex":0.0015088911,"about_ca_system_score_gemma":0.00065390376,"threshold_uncertainty_score":0.0109478235},"labels":[],"label_agreement":null},{"id":"W2780248561","doi":"10.48550/arxiv.1408.4099","title":"Continuous Yao Graphs","year":2014,"lang":"en","type":"article","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Combinatorics; Vertex (graph theory); Mathematics; Algebraic number; Graph; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.021165714211939666,"score_gpt":0.244958602101487,"score_spread":0.22379288788954735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780248561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20212257,0.0024310125,0.73211986,0.0009276266,0.0002301206,0.00013734774,0.0007902694,0.00046430653,0.06077692],"genre_scores_gemma":[0.78068525,0.0020677852,0.18976344,0.00047998445,0.00030137456,0.00024951066,0.0010583253,0.0002754583,0.025119008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902785,0.00023572061,0.00003028458,0.0002949305,0.00027085052,0.00014041546],"domain_scores_gemma":[0.99855167,0.0005658396,0.00024980088,0.00019665729,0.00020849622,0.00022738903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005442589,0.00064095866,0.0005489434,0.0013496522,0.0008298948,0.001453224,0.0011154823,0.0007453763,0.007451962],"category_scores_gemma":[0.0027334914,0.00034375212,0.0004734554,0.0017613397,0.0015242224,0.004585629,0.0019248347,0.0015517916,0.0007196973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044612316,0.000029135683,0.00058077875,0.00006535952,0.000014683351,0.00011425491,0.00014346119,0.011182721,0.0027641794,0.9694083,0.001310635,0.014341797],"study_design_scores_gemma":[0.000043684267,0.000116377014,0.0011322629,0.000045420988,0.0000320731,0.0006260889,0.0002715458,0.059032787,0.0023501306,0.8832651,0.05303942,0.000045166395],"about_ca_topic_score_codex":0.001015552,"about_ca_topic_score_gemma":0.0015002042,"teacher_disagreement_score":0.007451962,"about_ca_system_score_codex":0.0010870586,"about_ca_system_score_gemma":0.0004372033,"threshold_uncertainty_score":0.024929285},"labels":[],"label_agreement":null},{"id":"W2782559833","doi":"10.1016/j.dam.2017.12.025","title":"On the b-chromatic number of cartesian products","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Cartesian product; Chromatic scale; Mathematics; Combinatorics; Cartesian coordinate system; Product (mathematics); Upper and lower bounds; Degree (music); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.021711555029133123,"score_gpt":0.29433126071343874,"score_spread":0.2726197056843056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782559833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72030663,0.0028062663,0.08674942,0.0047323583,0.0006042898,0.00007059314,0.0010242321,0.00033825007,0.18336804],"genre_scores_gemma":[0.96040493,0.0016073702,0.019181082,0.0006910214,0.00048386754,0.00013857937,0.00065812765,0.00021244082,0.01662262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999127,0.00024499896,0.00003489459,0.00023866532,0.000178852,0.00017554831],"domain_scores_gemma":[0.9929762,0.00440592,0.0007701918,0.00036579155,0.0005569036,0.00092496816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014185166,0.00081519893,0.00092893036,0.0047105425,0.0026473526,0.004419404,0.0017469259,0.0016742145,0.016039379],"category_scores_gemma":[0.0064801904,0.0007237555,0.0005333369,0.004383444,0.0059072957,0.0061023403,0.0025450895,0.0033776043,0.0014174377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023631472,0.00003775724,0.0012682044,0.00009432206,0.000015633717,0.00004746988,0.00042998613,0.0029707323,0.0016208467,0.9785568,0.004439879,0.010281931],"study_design_scores_gemma":[0.00004451155,0.000040278082,0.0016581044,0.000056416928,0.000021506816,0.000109298664,0.00023591137,0.009845426,0.0006805677,0.98221415,0.005060305,0.000033487697],"about_ca_topic_score_codex":0.00438279,"about_ca_topic_score_gemma":0.0030542326,"teacher_disagreement_score":0.016039379,"about_ca_system_score_codex":0.0025092796,"about_ca_system_score_gemma":0.000954804,"threshold_uncertainty_score":0.053657055},"labels":[],"label_agreement":null},{"id":"W2782669095","doi":"","title":"Edge domination in grids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.02811728436622272,"score_gpt":0.3019724679526868,"score_spread":0.27385518358646405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782669095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8563123,0.00071140175,0.075871244,0.0014186784,0.00010263248,0.00006740766,0.00038749736,0.00023406083,0.06489488],"genre_scores_gemma":[0.97911215,0.00030878,0.00866742,0.00015239824,0.000050779287,0.00004456614,0.00018969124,0.00007120916,0.011403058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994128,0.00016389762,0.000026214942,0.0001102184,0.000121302466,0.00016562319],"domain_scores_gemma":[0.99465203,0.0033737211,0.00048227774,0.0004756373,0.00042631134,0.0005900889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062140793,0.00031437172,0.0008011655,0.0012326104,0.0015502188,0.002798544,0.0012670428,0.0008668858,0.008618534],"category_scores_gemma":[0.0060880105,0.00052217604,0.0004361223,0.0016501569,0.001777091,0.002617054,0.0018924555,0.0012043271,0.0004740158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029107754,0.00007743218,0.0043826234,0.00011990849,0.00003743019,0.0003318722,0.00068536337,0.029563861,0.00392187,0.9338253,0.0054650926,0.021298127],"study_design_scores_gemma":[0.00006668875,0.000028729452,0.0016313693,0.00003784679,0.000030515857,0.0003754315,0.0004759689,0.08856206,0.001604001,0.9018378,0.005330762,0.00001880648],"about_ca_topic_score_codex":0.0030494884,"about_ca_topic_score_gemma":0.0031294788,"teacher_disagreement_score":0.008618534,"about_ca_system_score_codex":0.001042834,"about_ca_system_score_gemma":0.0005786298,"threshold_uncertainty_score":0.02883184},"labels":[],"label_agreement":null},{"id":"W2783355325","doi":"","title":"Upward Order-Preserving 8-Grid-Drawings of Binary Trees.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary number; Binary tree; Grid; Computer graphics (images); Algorithm; Mathematics; Geometry; Arithmetic","score_opus":0.05160737549822516,"score_gpt":0.31323921461039234,"score_spread":0.2616318391121672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783355325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25640842,0.0007649839,0.5932435,0.0008858457,0.000402507,0.00038926728,0.004106096,0.0027969142,0.14100248],"genre_scores_gemma":[0.600454,0.00092239736,0.3392378,0.0002824687,0.00007835653,0.00024348061,0.0050343447,0.0009746649,0.052772462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993449,0.00014051885,0.000042475265,0.000106210806,0.0002164315,0.00014942825],"domain_scores_gemma":[0.9985582,0.00032367164,0.00014927106,0.0004933441,0.00031965837,0.00015591313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030938783,0.00047653678,0.00055828516,0.000886787,0.0010151786,0.0020649906,0.0011316162,0.00085267145,0.0151445335],"category_scores_gemma":[0.0025535477,0.00065504643,0.0005000691,0.0013412475,0.0006972326,0.0018906072,0.0015702067,0.0016904667,0.0044956794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049487577,0.00024666355,0.0022869776,0.00041823354,0.00005119576,0.00069884444,0.0012158505,0.028174391,0.030683646,0.67097294,0.03703597,0.22772038],"study_design_scores_gemma":[0.00015381954,0.00012963457,0.002666868,0.0001651726,0.00006868491,0.0010777938,0.00100046,0.08055376,0.023656473,0.7656163,0.12485544,0.000055665187],"about_ca_topic_score_codex":0.003018011,"about_ca_topic_score_gemma":0.005288927,"teacher_disagreement_score":0.0151445335,"about_ca_system_score_codex":0.0006204652,"about_ca_system_score_gemma":0.0005952808,"threshold_uncertainty_score":0.05066347},"labels":[],"label_agreement":null},{"id":"W2783589701","doi":"10.1016/j.disopt.2017.08.005","title":"A linear time algorithm for the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml167\" display=\"inline\" overflow=\"scroll\" altimg=\"si167.gif\"><mml:mn>3</mml:mn></mml:math>-neighbour Travelling Salesman Problem on a Halin graph and extensions","year":2017,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Travelling salesman problem; Hamiltonian path; Algorithm; Graph; Discrete mathematics","score_opus":0.020127424260410667,"score_gpt":0.2707476361752828,"score_spread":0.25062021191487216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783589701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006411565,0.00042933002,0.9476553,0.0015063165,0.0003785913,0.0007085226,0.0015045606,0.011986163,0.02941965],"genre_scores_gemma":[0.06612011,0.00034198398,0.8998302,0.0005054634,0.00022520554,0.0010301835,0.004015265,0.0019272987,0.026004298],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981577,0.00023362768,0.000139448,0.00069839595,0.00048361532,0.00028732256],"domain_scores_gemma":[0.99714726,0.00157829,0.00014866688,0.0005544894,0.00036721159,0.00020402065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013568824,0.0029582684,0.0018053227,0.0019468525,0.001825326,0.003545457,0.004435689,0.0030194032,0.06520268],"category_scores_gemma":[0.0059744315,0.0011544549,0.0026189736,0.0026127966,0.0012757806,0.004899599,0.0038162156,0.00367861,0.02332064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088718307,0.00096830126,0.0007970208,0.0010125872,0.0001754696,0.00029307685,0.00042743527,0.08166296,0.008747185,0.08564517,0.16175576,0.6576279],"study_design_scores_gemma":[0.00093478087,0.00040412348,0.00077936525,0.0001447968,0.00013271623,0.0006459915,0.00037601602,0.65581125,0.0072405827,0.2814659,0.0519237,0.00014075631],"about_ca_topic_score_codex":0.00787008,"about_ca_topic_score_gemma":0.015026409,"teacher_disagreement_score":0.06520268,"about_ca_system_score_codex":0.0033144082,"about_ca_system_score_gemma":0.0050313515,"threshold_uncertainty_score":0.21812469},"labels":[],"label_agreement":null},{"id":"W2784637848","doi":"","title":"Monochromatic Connectivity in Monochromatic-Star-Free Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Star (game theory); Combinatorics; Physics; Mathematical analysis; Optics","score_opus":0.017513092888051526,"score_gpt":0.27416907273808583,"score_spread":0.2566559798500343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784637848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9224864,0.0005233517,0.051990263,0.0006592426,0.00005804785,0.00008589714,0.0009318278,0.00021437406,0.023050543],"genre_scores_gemma":[0.97873515,0.00049248064,0.015883893,0.00020579153,0.000059575497,0.00008216582,0.0007324268,0.000051055347,0.003757328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994229,0.00011467292,0.000037726648,0.00016534064,0.00013428951,0.0001250896],"domain_scores_gemma":[0.99569064,0.0019708665,0.0008965155,0.00039277287,0.0004884917,0.0005606287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003906467,0.00044427472,0.00082766893,0.001650432,0.0017304397,0.0022033313,0.0012356644,0.0009756325,0.008370319],"category_scores_gemma":[0.0037424755,0.00063060125,0.00045717557,0.0024359054,0.0013439212,0.0029188152,0.0013409199,0.00084624306,0.000623736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011797886,0.00023801457,0.013311017,0.0010652861,0.000164062,0.002540239,0.002743585,0.034444198,0.028673926,0.83007437,0.01292348,0.07264212],"study_design_scores_gemma":[0.00015770266,0.00014312576,0.008288607,0.00008454242,0.00013038883,0.0015600247,0.0011158877,0.063013576,0.005920156,0.91212404,0.007410669,0.000051327865],"about_ca_topic_score_codex":0.0023072877,"about_ca_topic_score_gemma":0.0037817694,"teacher_disagreement_score":0.008370319,"about_ca_system_score_codex":0.0006399601,"about_ca_system_score_gemma":0.00057646143,"threshold_uncertainty_score":0.028001487},"labels":[],"label_agreement":null},{"id":"W2788116683","doi":"","title":"Trees With Given Degree Sequence in S-Order","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Sequence (biology); Order (exchange); Combinatorics; Chemistry; Business","score_opus":0.032819757193961276,"score_gpt":0.29169857787915165,"score_spread":0.25887882068519036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788116683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84889096,0.00033389978,0.097670265,0.0012121717,0.00016764719,0.00012431266,0.0029700394,0.0006945122,0.04793613],"genre_scores_gemma":[0.92281884,0.00056081393,0.051856466,0.000264133,0.00009725839,0.00008307256,0.0024203134,0.00023335569,0.021665782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995553,0.00006346558,0.00003448228,0.0000941839,0.00010575101,0.00014687801],"domain_scores_gemma":[0.99771,0.0009343531,0.00022451725,0.00029783385,0.00043004903,0.00040316867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038920296,0.0003670893,0.000806595,0.0013126783,0.0015719067,0.0028974516,0.00066054217,0.0008311175,0.0073656263],"category_scores_gemma":[0.0024244275,0.0003767704,0.00055623706,0.0018961177,0.0011898993,0.002168669,0.0007600997,0.0012122113,0.001232074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048504802,0.00018997942,0.005588355,0.00026425882,0.000043946802,0.00086588896,0.0012810961,0.016405584,0.018051665,0.91737264,0.0076331147,0.031818356],"study_design_scores_gemma":[0.00009308832,0.00011868517,0.0031535176,0.00007445049,0.00006447695,0.0010286144,0.0007300624,0.041147288,0.006843092,0.9253249,0.02138001,0.000041847696],"about_ca_topic_score_codex":0.0025451062,"about_ca_topic_score_gemma":0.005814265,"teacher_disagreement_score":0.0073656263,"about_ca_system_score_codex":0.0012630642,"about_ca_system_score_gemma":0.001112282,"threshold_uncertainty_score":0.024640441},"labels":[],"label_agreement":null},{"id":"W2788975631","doi":"10.4230/lipics.swat.2018.27","title":"Reconfiguration of Colorable Sets in Classes of Perfect Graphs","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Chordal graph; Interval graph; Indifference graph; Pathwidth; Combinatorics; Maximal independent set; Split graph; Mathematics; Discrete mathematics; Cograph; Treewidth; Longest path problem; Independent set; Clique-sum; Time complexity; 1-planar graph; Graph; Line graph","score_opus":0.08404564682421786,"score_gpt":0.23550534945761173,"score_spread":0.15145970263339387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788975631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67416835,0.0005379299,0.3050231,0.0009667016,0.000069661146,0.0002745929,0.0012530801,0.0013515401,0.016355054],"genre_scores_gemma":[0.9502941,0.0003062366,0.044383988,0.000160292,0.0000721689,0.00015506205,0.001307669,0.00014226568,0.0031781888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979619,0.00025098375,0.00013375487,0.00088299444,0.00039513534,0.00037530018],"domain_scores_gemma":[0.99293655,0.0038867912,0.0011161765,0.0012548774,0.00023778793,0.0005677409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085983204,0.00060730154,0.0006270876,0.00091873656,0.0013059612,0.0031445874,0.0016091204,0.00091446424,0.0064651524],"category_scores_gemma":[0.0066669327,0.0006097189,0.0014421062,0.0012076095,0.0018687353,0.006138799,0.0017781638,0.0017163524,0.0003477578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078760437,0.0003455824,0.010166438,0.0006804123,0.00018045318,0.00084739266,0.0016971637,0.25058344,0.022601627,0.58284765,0.005861246,0.123400986],"study_design_scores_gemma":[0.000101416306,0.00012293382,0.0037983176,0.00004457636,0.000076726115,0.000735368,0.00062554044,0.21521907,0.009791847,0.76090354,0.008532234,0.000048433994],"about_ca_topic_score_codex":0.002855286,"about_ca_topic_score_gemma":0.0026249727,"teacher_disagreement_score":0.0064651524,"about_ca_system_score_codex":0.0029976263,"about_ca_system_score_gemma":0.0010187455,"threshold_uncertainty_score":0.021749377},"labels":[],"label_agreement":null},{"id":"W2790020036","doi":"10.1007/978-3-319-94776-1_36","title":"Reconfiguring Spanning and Induced Subgraphs","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Control reconfiguration; Reachability; Induced subgraph isomorphism problem; Combinatorics; Subgraph isomorphism problem; Matching (statistics); Graph factorization; Independent set; Graph; Mathematics; Induced subgraph; Clique; Computer science; Split graph; Distance-hereditary graph; Theoretical computer science; Discrete mathematics; Line graph; Graph power; Vertex (graph theory); Pathwidth; Voltage graph","score_opus":0.036604699689667876,"score_gpt":0.3142294430628079,"score_spread":0.27762474337314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790020036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62447894,0.00028989316,0.34456113,0.0004923276,0.00021275727,0.00012490762,0.0003879306,0.0035311533,0.025921032],"genre_scores_gemma":[0.8897058,0.0001584649,0.10395391,0.00015267044,0.000045723926,0.000053398093,0.00045461592,0.0005219111,0.004953436],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999653,0.000076741344,0.000020308364,0.00010992783,0.00005836531,0.00008164019],"domain_scores_gemma":[0.99764156,0.00069399324,0.00016467976,0.0010489293,0.0001833689,0.00026741027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027388902,0.000452018,0.00042813865,0.000619665,0.00047308343,0.0006945606,0.0011152023,0.0005790143,0.005481208],"category_scores_gemma":[0.0028525002,0.00036037818,0.0004636103,0.00061437325,0.0004873551,0.0017063569,0.0012883431,0.00065072475,0.0009223023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013437395,0.0004664043,0.0056402725,0.000517873,0.00016491175,0.001402571,0.0008960609,0.20088999,0.1915692,0.116595775,0.012596058,0.46791714],"study_design_scores_gemma":[0.0001157973,0.00034853196,0.0032248222,0.00006382681,0.00015704054,0.0012166202,0.0007278155,0.68529177,0.062873125,0.22811615,0.01781523,0.000049267623],"about_ca_topic_score_codex":0.000554329,"about_ca_topic_score_gemma":0.0013055464,"teacher_disagreement_score":0.005481208,"about_ca_system_score_codex":0.0002836545,"about_ca_system_score_gemma":0.00029377223,"threshold_uncertainty_score":0.018336475},"labels":[],"label_agreement":null},{"id":"W2791062024","doi":"","title":"Digraph Isomorpshism Using Subdigraph Equivalent Vertices And Degree Pair Association.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Association (psychology); Mathematics; Degree (music); Combinatorics; Psychology; Physics; Acoustics","score_opus":0.04405361338829382,"score_gpt":0.2994501956152897,"score_spread":0.25539658222699585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791062024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19971558,0.00045678893,0.625079,0.0014270144,0.00065345503,0.00030892476,0.0010791782,0.0018948396,0.16938531],"genre_scores_gemma":[0.69865865,0.0005330492,0.24023652,0.0007930769,0.0002916407,0.00029181235,0.0019144266,0.00043159243,0.05684916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994462,0.00011939885,0.000029144094,0.00019799489,0.00010963523,0.00009763935],"domain_scores_gemma":[0.9991179,0.00028220096,0.000067708206,0.0003053017,0.00010605269,0.0001208974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375009,0.00043850412,0.0006894837,0.0009446132,0.0014049634,0.0017633161,0.0011872527,0.00081935845,0.012085727],"category_scores_gemma":[0.0018449788,0.0003983376,0.00083766883,0.0010143312,0.0010211237,0.0021901776,0.0027314865,0.0021071616,0.0022387188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016816467,0.00019907886,0.0007780001,0.0001698436,0.000039168666,0.00041768933,0.00037544692,0.0045092897,0.005653619,0.8996427,0.011016357,0.07703052],"study_design_scores_gemma":[0.000058610876,0.00006900644,0.0006448719,0.000046174046,0.0000752888,0.00052480993,0.0002267436,0.028165849,0.0039577633,0.940911,0.025296664,0.000023208735],"about_ca_topic_score_codex":0.00092072587,"about_ca_topic_score_gemma":0.0017913184,"teacher_disagreement_score":0.012085727,"about_ca_system_score_codex":0.00066130655,"about_ca_system_score_gemma":0.0007243159,"threshold_uncertainty_score":0.040430844},"labels":[],"label_agreement":null},{"id":"W2791423452","doi":"","title":"On the Linear 2-Arboricity of Planar Graphs without Intersecting 3-Cycles or Intersecting 4-Cycles.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Planar; Planar graph; Combinatorics; Graph; Computer science","score_opus":0.03236417449053471,"score_gpt":0.3100225160815461,"score_spread":0.2776583415910114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791423452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67901903,0.002983135,0.070655786,0.0034260459,0.00038138212,0.000105690124,0.0014626363,0.0003596485,0.24160655],"genre_scores_gemma":[0.95927525,0.0025090163,0.014489021,0.00076906156,0.0005050309,0.00008305302,0.0014673059,0.00015523628,0.020746952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968445,0.00008691588,0.000018865821,0.0000660848,0.000065868226,0.00007779581],"domain_scores_gemma":[0.99782157,0.0013849144,0.0003458892,0.0001386046,0.00015811822,0.00015098759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034816551,0.00045481816,0.000398405,0.0012470845,0.00078923814,0.0014210206,0.00083778345,0.0008838127,0.011128837],"category_scores_gemma":[0.0029695074,0.00040517692,0.00049330137,0.0013864738,0.0016714361,0.003135554,0.0013160245,0.0015345322,0.0016931639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044738554,0.00014593515,0.0041807555,0.00049629377,0.000061572886,0.0008285498,0.00083145004,0.017217135,0.006993647,0.901568,0.016358778,0.0508705],"study_design_scores_gemma":[0.00004800349,0.000081354636,0.0017860483,0.000072806986,0.000035259105,0.00043563984,0.00034857335,0.02063283,0.0015687619,0.96779424,0.007170322,0.000026280977],"about_ca_topic_score_codex":0.0015302765,"about_ca_topic_score_gemma":0.0022171028,"teacher_disagreement_score":0.011128837,"about_ca_system_score_codex":0.0006212205,"about_ca_system_score_gemma":0.0003196397,"threshold_uncertainty_score":0.037229717},"labels":[],"label_agreement":null},{"id":"W2792181057","doi":"10.37236/8278","title":"Split Graphs: Combinatorial Species and Asymptotics","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Combinatorics; Split graph; Mathematics; Chordal graph; Conjecture; Clique-sum; Indifference graph; Clique; Graph; Cograph; 1-planar graph; Pathwidth; Discrete mathematics; Block graph; Line graph","score_opus":0.013820382609624227,"score_gpt":0.26091308678651526,"score_spread":0.24709270417689103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792181057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48947752,0.0038854221,0.41529748,0.005371522,0.00042425893,0.00014011713,0.0022772825,0.0014145295,0.08171177],"genre_scores_gemma":[0.936023,0.0014221264,0.050055224,0.0014016776,0.00048159796,0.00023888143,0.0015099088,0.0006517704,0.008215776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798155,0.000471487,0.000063162326,0.000705507,0.0005013551,0.00027688438],"domain_scores_gemma":[0.97508776,0.016773047,0.0019690727,0.0029409665,0.00170591,0.0015231356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021723236,0.00078930013,0.0010735318,0.0030547145,0.002595312,0.0034314755,0.0028333783,0.0020929507,0.012643066],"category_scores_gemma":[0.039638456,0.00077628146,0.00086378434,0.0022290926,0.003712348,0.010235072,0.003052025,0.0030443785,0.0011164029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017037579,0.00009849541,0.010593018,0.00027695313,0.00008005651,0.00025587803,0.0007396028,0.023796078,0.0047908924,0.925602,0.01129464,0.022301868],"study_design_scores_gemma":[0.000025609783,0.00002804638,0.0015220005,0.00006611376,0.000035118646,0.0005741686,0.00031852687,0.07886216,0.0014337798,0.91066015,0.0064488933,0.000025493211],"about_ca_topic_score_codex":0.0013661523,"about_ca_topic_score_gemma":0.0018212118,"teacher_disagreement_score":0.012643066,"about_ca_system_score_codex":0.0027281502,"about_ca_system_score_gemma":0.0008354484,"threshold_uncertainty_score":0.042295277},"labels":[],"label_agreement":null},{"id":"W2792621676","doi":"","title":"Formulas for various domination numbers of products of paths and cycles.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.014255761740252596,"score_gpt":0.28473081464186345,"score_spread":0.27047505290161084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792621676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26341408,0.004682619,0.364282,0.0048789238,0.00088448543,0.00025025904,0.004331429,0.0013146946,0.35596144],"genre_scores_gemma":[0.8941495,0.0012867157,0.0793681,0.00068416086,0.00046209892,0.00022167056,0.0013211601,0.00030536935,0.022201272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987155,0.00027756224,0.000119909164,0.0002046276,0.00047241995,0.00020995241],"domain_scores_gemma":[0.9933976,0.0047237007,0.0004503444,0.0003573004,0.0008042741,0.00026667523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017959123,0.0008646375,0.0006765005,0.0036421332,0.0015661549,0.0046822,0.0023565367,0.001299039,0.017218545],"category_scores_gemma":[0.010886835,0.00060219254,0.0011828622,0.003147626,0.0020777865,0.0090110935,0.0014700328,0.003210529,0.0016165983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055590048,0.00003088212,0.000564921,0.000113737384,0.00001701233,0.00013448039,0.0002545014,0.0012284552,0.00068175956,0.981316,0.004086214,0.011516401],"study_design_scores_gemma":[0.000015304493,0.000011010763,0.00030576723,0.000056741046,0.000028237328,0.00026248055,0.00012785195,0.0076754238,0.0010166737,0.9855751,0.004905321,0.000020033598],"about_ca_topic_score_codex":0.0013438008,"about_ca_topic_score_gemma":0.0025752848,"teacher_disagreement_score":0.017218545,"about_ca_system_score_codex":0.0029595008,"about_ca_system_score_gemma":0.00075717276,"threshold_uncertainty_score":0.05760181},"labels":[],"label_agreement":null},{"id":"W2792869388","doi":"10.1007/978-3-319-61199-0","title":"Profinite Graphs and Groups","year":2017,"lang":"de","type":"book","venue":"Ergebnisse der Mathematik und ihrer Grenzgebiete","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Profinite group; Mathematics; Sociology; Computer science; Group (periodic table); Physics","score_opus":0.037553492994821566,"score_gpt":0.3150043441704566,"score_spread":0.277450851175635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792869388","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00820563,0.18790884,0.0070010154,0.010778863,0.0060734837,0.00002552141,0.00026910432,0.00023755281,0.77949995],"genre_scores_gemma":[0.22018711,0.15172406,0.0055928896,0.0045171473,0.017284038,0.00014579666,0.0008031782,0.00028469422,0.599461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977845,0.00006413463,0.0000070942133,0.00003188707,0.00009439054,0.000023989825],"domain_scores_gemma":[0.99975866,0.000106714804,0.000021713699,0.000034254565,0.00003654745,0.00004206205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003227422,0.00085669535,0.0005510387,0.0020699834,0.0012878396,0.0030652422,0.0005344121,0.0008173473,0.017387295],"category_scores_gemma":[0.00097456924,0.0003441182,0.00028441192,0.0029403665,0.0024589344,0.0026612745,0.0011500409,0.0021822867,0.005355742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000131368615,0.000017280285,0.00007425877,0.00015618726,0.0000071669106,0.0000273262,0.00028902089,0.00038220186,0.0002597035,0.87730694,0.091160946,0.030305859],"study_design_scores_gemma":[0.0000070708143,0.000009266725,0.00020906971,0.0000894003,0.0000059090817,0.0000857469,0.00009705209,0.00027939957,0.000081426464,0.719713,0.27941754,0.0000051595543],"about_ca_topic_score_codex":0.0008861603,"about_ca_topic_score_gemma":0.0011528443,"teacher_disagreement_score":0.017387295,"about_ca_system_score_codex":0.0015125717,"about_ca_system_score_gemma":0.00065078394,"threshold_uncertainty_score":0.058166325},"labels":[],"label_agreement":null},{"id":"W2793430794","doi":"10.1007/s13398-018-0503-2","title":"The optimal t-pebbling number of a certain complete m-ary tree","year":2018,"lang":"es","type":"article","venue":"Revista de la Real Academia de Ciencias Exactas Físicas y Naturales Serie A Matemáticas","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Tree (set theory); Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02170637069724794,"score_gpt":0.34333904925236497,"score_spread":0.321632678555117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793430794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83380425,0.0015777037,0.09746896,0.0030042294,0.0002403004,0.000095248666,0.0017215046,0.0005641561,0.06152364],"genre_scores_gemma":[0.90632254,0.00079761504,0.08036111,0.00033897895,0.00014301077,0.0001094575,0.0011527201,0.0002485976,0.010525849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993765,0.0001319495,0.000029331324,0.00014842529,0.00014427736,0.00016955486],"domain_scores_gemma":[0.99780005,0.0011325747,0.00020943055,0.00025211961,0.0001614158,0.00044431048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090456347,0.00052351266,0.001108067,0.001435222,0.0017109946,0.002925086,0.0013223831,0.0019359398,0.010102153],"category_scores_gemma":[0.0057686693,0.00045328788,0.0005569182,0.0015853673,0.001332175,0.0033979379,0.0009393051,0.00165685,0.001051705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013452081,0.00023863309,0.0038392998,0.0007472352,0.0000883973,0.00034342363,0.00054676295,0.062230866,0.020084007,0.79858184,0.022734689,0.08921959],"study_design_scores_gemma":[0.0001816739,0.00023664595,0.0029988948,0.00013291153,0.00010279465,0.0006982881,0.00032805663,0.16852167,0.0060118316,0.8076854,0.013049011,0.00005288358],"about_ca_topic_score_codex":0.0010627052,"about_ca_topic_score_gemma":0.0019836088,"teacher_disagreement_score":0.010102153,"about_ca_system_score_codex":0.0019130528,"about_ca_system_score_gemma":0.0014819899,"threshold_uncertainty_score":0.03379506},"labels":[],"label_agreement":null},{"id":"W2793769875","doi":"","title":"Disjoint cycles in directed graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics","score_opus":0.01647823941276952,"score_gpt":0.28604266281789886,"score_spread":0.2695644234051293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793769875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22323391,0.015682172,0.48462576,0.0057443334,0.0014224217,0.00041848104,0.0033100408,0.0010042774,0.26455867],"genre_scores_gemma":[0.7492533,0.009504238,0.14839923,0.0018709833,0.0009837815,0.0006216324,0.0036644689,0.00047910807,0.08522334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855095,0.00047016557,0.00012683054,0.00039336065,0.00029957108,0.00015908036],"domain_scores_gemma":[0.9949261,0.0030104995,0.0006176481,0.00046745915,0.0005319062,0.00044625855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074563845,0.0007303196,0.0006985735,0.0034813758,0.0019584126,0.0034142307,0.0011665252,0.0014843344,0.011024795],"category_scores_gemma":[0.007455638,0.00075927435,0.00087083696,0.0034935141,0.0019155227,0.0061379024,0.0025935327,0.0018755328,0.0025115232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043699587,0.00003061133,0.0006148482,0.00022277811,0.00003211805,0.0002256857,0.00044332823,0.0016000224,0.00081907824,0.9564305,0.006386908,0.03315054],"study_design_scores_gemma":[0.00001256311,0.000010502309,0.00021270341,0.00007775164,0.00002561775,0.0003113413,0.00017808852,0.0037584007,0.00061540736,0.9694103,0.02537524,0.000012094795],"about_ca_topic_score_codex":0.0017642371,"about_ca_topic_score_gemma":0.0026391025,"teacher_disagreement_score":0.011024795,"about_ca_system_score_codex":0.0014409964,"about_ca_system_score_gemma":0.00090348424,"threshold_uncertainty_score":0.036881626},"labels":[],"label_agreement":null},{"id":"W2793906705","doi":"","title":"On the total signed domination number of P m [square] C n .","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Combinatorics; Geometry","score_opus":0.014231687359934055,"score_gpt":0.2905970341272533,"score_spread":0.2763653467673192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793906705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6995863,0.00082964957,0.06469628,0.0027362271,0.00044046104,0.00007354864,0.0015175465,0.00042170752,0.22969836],"genre_scores_gemma":[0.9690058,0.00044063712,0.010072125,0.00032470239,0.00020135213,0.000104164756,0.00067824626,0.00015207165,0.019020813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936134,0.0001427177,0.00003235687,0.0001308524,0.00017641563,0.00015630692],"domain_scores_gemma":[0.9960253,0.00234033,0.0004684105,0.00030514604,0.00041023004,0.0004505433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074639026,0.00048248903,0.00037759202,0.0021198883,0.0014298285,0.0022950908,0.0010448726,0.000777226,0.013309572],"category_scores_gemma":[0.005906117,0.00024022015,0.00025994668,0.0013947623,0.00172462,0.003093969,0.0015087561,0.0012152924,0.0012881076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039782972,0.00006970256,0.0037014906,0.00021078765,0.000035950707,0.00019857778,0.0005573223,0.0094101615,0.006145601,0.9101253,0.0171527,0.051994592],"study_design_scores_gemma":[0.00003570629,0.000057011704,0.0026034976,0.000068821464,0.000031438292,0.0003701675,0.00026725806,0.027412899,0.0039461586,0.9522841,0.012881286,0.000041605974],"about_ca_topic_score_codex":0.0011113368,"about_ca_topic_score_gemma":0.00214441,"teacher_disagreement_score":0.013309572,"about_ca_system_score_codex":0.0011861303,"about_ca_system_score_gemma":0.0007141134,"threshold_uncertainty_score":0.044524968},"labels":[],"label_agreement":null},{"id":"W2794063315","doi":"10.1016/j.ejc.2017.12.001","title":"The monotonicity property of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml4\" display=\"inline\" overflow=\"scroll\" altimg=\"si4.gif\"><mml:mi>M</mml:mi></mml:math>-partition problems","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Partition (number theory); Monotonic function; Scroll; Mathematics; Combinatorics; Discrete mathematics; Mathematical analysis; Theology; Philosophy","score_opus":0.02150163503203327,"score_gpt":0.25267805859292525,"score_spread":0.23117642356089196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794063315","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15200125,0.0018156312,0.39582822,0.016942931,0.00068686926,0.00043084036,0.0047125584,0.00084153377,0.42674017],"genre_scores_gemma":[0.81652844,0.002191104,0.09788188,0.0032212914,0.0009286676,0.0010972986,0.005899124,0.001338441,0.07091373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976428,0.00065662747,0.0001118023,0.0006063122,0.0004972221,0.00048518967],"domain_scores_gemma":[0.986586,0.0089461915,0.0006298818,0.0013476216,0.0017215767,0.0007687507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023118705,0.0009324627,0.001122969,0.0011418065,0.0024910066,0.0048388704,0.0033004642,0.0019905772,0.040571667],"category_scores_gemma":[0.01886861,0.00078888057,0.0013208488,0.0015890222,0.0031094695,0.011083611,0.0033666429,0.0058649266,0.0059542577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015193009,0.000118217926,0.0014470944,0.00041226158,0.000034467746,0.0001281634,0.00034303387,0.0030254757,0.002931413,0.9370486,0.0275418,0.026817692],"study_design_scores_gemma":[0.00005294224,0.00006791257,0.0017223919,0.00011949518,0.000035633137,0.0006157262,0.000291234,0.021820283,0.004647692,0.9491683,0.021428507,0.000029962386],"about_ca_topic_score_codex":0.0019643137,"about_ca_topic_score_gemma":0.0026645483,"teacher_disagreement_score":0.040571667,"about_ca_system_score_codex":0.0015758346,"about_ca_system_score_gemma":0.002012105,"threshold_uncertainty_score":0.13572574},"labels":[],"label_agreement":null},{"id":"W2794432627","doi":"","title":"Maximal independent sets in complementary prism graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prism; Combinatorics; Discrete mathematics; Optics; Physics","score_opus":0.022734535536246138,"score_gpt":0.30125144275730725,"score_spread":0.2785169072210611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794432627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3109836,0.001900326,0.39293525,0.002446274,0.0006190292,0.00023881104,0.0030868186,0.0010080526,0.2867819],"genre_scores_gemma":[0.86228395,0.0012766779,0.09762094,0.0008010043,0.0002792936,0.00025231714,0.00254738,0.00021471217,0.034723766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888355,0.00027626514,0.00005430047,0.00027037604,0.00033262215,0.00018288576],"domain_scores_gemma":[0.99606377,0.0022304382,0.0004568131,0.0003854969,0.00044353437,0.00042003885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007645608,0.000510452,0.0006058695,0.0018419536,0.0020957591,0.0025430345,0.0012064138,0.0011026164,0.0122295935],"category_scores_gemma":[0.004969424,0.0008637926,0.0009702787,0.0019243913,0.0020219889,0.003992904,0.002539562,0.0025198727,0.0018070816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006973749,0.000034496894,0.0005579194,0.00017205911,0.000029123885,0.00022824365,0.00022919248,0.0019720364,0.0021164613,0.9761001,0.0057950076,0.012695704],"study_design_scores_gemma":[0.000029835968,0.000021206177,0.00064342486,0.00005936941,0.0000477413,0.0005124285,0.00022201522,0.0093074255,0.0024222145,0.97490215,0.01181465,0.000017695525],"about_ca_topic_score_codex":0.0014392087,"about_ca_topic_score_gemma":0.0025290041,"teacher_disagreement_score":0.0122295935,"about_ca_system_score_codex":0.0011442967,"about_ca_system_score_gemma":0.001183118,"threshold_uncertainty_score":0.040912032},"labels":[],"label_agreement":null},{"id":"W2794722099","doi":"10.37236/8594","title":"On Essentially 4-Edge-Connected Cubic Bricks","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Federal de Mato Grosso do Sul; Universidade Estadual de Campinas; University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Fundação de Amparo à Pesquisa do Estado de São Paulo; Universität Wien; Massey University","keywords":"Combinatorics; Bipartite graph; Mathematics; Cubic graph; Conjecture; Invariant (physics); Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.01661771185908935,"score_gpt":0.2803089121190195,"score_spread":0.26369120025993015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794722099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70504344,0.0011491288,0.06710699,0.0006675792,0.00015972684,0.00013444167,0.0012882192,0.00035512642,0.22409546],"genre_scores_gemma":[0.9315819,0.0009789133,0.02571485,0.0003099293,0.00009178266,0.00009433795,0.0015757817,0.0001472676,0.039505325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965537,0.000054913515,0.000008561973,0.000068838366,0.000097035634,0.000115312694],"domain_scores_gemma":[0.99963164,0.00012093846,0.000066699824,0.00006576758,0.000056091838,0.000058749498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015240838,0.000493001,0.0004456942,0.0012768813,0.0016429918,0.0010911875,0.0008924484,0.0007672438,0.014374604],"category_scores_gemma":[0.0009823861,0.0006395814,0.0005853717,0.0012462189,0.0014874048,0.0017288177,0.001697728,0.0013698811,0.0017023109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002770083,0.00005329938,0.0013822825,0.0002525089,0.000031340798,0.0005011497,0.0005670947,0.03093396,0.0064049843,0.9282123,0.007467899,0.02391623],"study_design_scores_gemma":[0.00012139121,0.00010022672,0.004892404,0.00014456728,0.000054467488,0.0005604167,0.0005766332,0.06947288,0.0038624562,0.8740365,0.04611343,0.00006462403],"about_ca_topic_score_codex":0.01475907,"about_ca_topic_score_gemma":0.017696898,"teacher_disagreement_score":0.01475907,"about_ca_system_score_codex":0.0013295846,"about_ca_system_score_gemma":0.0004625068,"threshold_uncertainty_score":0.048087895},"labels":[],"label_agreement":null},{"id":"W2794856912","doi":"10.3390/a11040040","title":"Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Multipartite; Bipartite graph; Discrete mathematics; Graph; Physics","score_opus":0.03247363405629961,"score_gpt":0.2995775671209701,"score_spread":0.2671039330646705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794856912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8914128,0.00050643994,0.08424667,0.00052964635,0.000030594947,0.00012670567,0.0011842665,0.0002737333,0.021689193],"genre_scores_gemma":[0.98322636,0.00025732277,0.013420134,0.00006021046,0.000023751201,0.000101331934,0.0009854689,0.00003842013,0.001886959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948716,0.00011212559,0.000027683376,0.00015654202,0.000107049265,0.000109470144],"domain_scores_gemma":[0.99644583,0.0018336104,0.00073055783,0.00024940175,0.0003988469,0.0003417254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032115844,0.00033103017,0.00027709152,0.0013871196,0.00065188797,0.0013288537,0.0006316307,0.00051989494,0.0022193824],"category_scores_gemma":[0.0037860025,0.00044992834,0.0004486418,0.0015526725,0.001758068,0.0013251915,0.00082348933,0.00056946237,0.00015077717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005468892,0.00011848712,0.02063003,0.00040246398,0.00007706731,0.0017078843,0.002112746,0.0896682,0.019740077,0.8182474,0.0057821516,0.040966634],"study_design_scores_gemma":[0.00007914327,0.00012096645,0.01867933,0.00006462708,0.00007952033,0.0012878554,0.0008124649,0.1923741,0.005795383,0.7723992,0.008244087,0.000063291365],"about_ca_topic_score_codex":0.0039397893,"about_ca_topic_score_gemma":0.0040845787,"teacher_disagreement_score":0.0039397893,"about_ca_system_score_codex":0.0010046182,"about_ca_system_score_gemma":0.00048573216,"threshold_uncertainty_score":0.007833719},"labels":[],"label_agreement":null},{"id":"W2795132552","doi":"10.23638/dmtcs-21-3-23","title":"On the multipacking number of grid graphs","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Agence Nationale de la Recherche; Thompson Rivers University","keywords":"Mathematics; Grid; Combinatorics; Computer science; Geometry","score_opus":0.017292022634676753,"score_gpt":0.30150910850861823,"score_spread":0.28421708587394146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795132552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57373106,0.00625182,0.3433131,0.004609535,0.00051627564,0.00017247052,0.0010714326,0.0009024532,0.069431745],"genre_scores_gemma":[0.94372654,0.002241335,0.045246407,0.0004040265,0.0002883185,0.0001557649,0.0005204548,0.0001965149,0.0072206017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858606,0.0003594513,0.00006159423,0.00033654258,0.00034615633,0.00031024963],"domain_scores_gemma":[0.99059945,0.0065366123,0.0008432976,0.0008123885,0.00050927384,0.0006989849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012128991,0.00063086604,0.0010169022,0.0018757517,0.0015207909,0.0026374639,0.001566011,0.0009215579,0.003624798],"category_scores_gemma":[0.011109219,0.0005692073,0.0005175814,0.0019429002,0.0020495465,0.004845065,0.0022362405,0.001673346,0.00059156003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011848734,0.00011669936,0.00732662,0.00046612683,0.000082470666,0.00035451137,0.0007887081,0.08561802,0.0098007545,0.7846439,0.0116187325,0.09799862],"study_design_scores_gemma":[0.00011910953,0.00016604041,0.0025232208,0.000106154235,0.00005972651,0.00071454886,0.00029357235,0.23353615,0.007993205,0.7382588,0.016178485,0.00005095284],"about_ca_topic_score_codex":0.00162705,"about_ca_topic_score_gemma":0.0010884409,"teacher_disagreement_score":0.003624798,"about_ca_system_score_codex":0.0018654934,"about_ca_system_score_gemma":0.00060210074,"threshold_uncertainty_score":0.013535142},"labels":[],"label_agreement":null},{"id":"W2795132661","doi":"10.1016/j.disc.2018.03.006","title":"Recolouring reflexive digraphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Homomorphism; Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Loop (graph theory); Path (computing); Computer science","score_opus":0.035949377190824854,"score_gpt":0.3399009822795958,"score_spread":0.30395160508877095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795132661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40038982,0.00057813624,0.49732473,0.0010023146,0.00055188616,0.00024631343,0.0011740337,0.004221685,0.09451112],"genre_scores_gemma":[0.773917,0.00060682814,0.1615106,0.0005148998,0.00015773861,0.000093031005,0.0015503067,0.0013898743,0.060259644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918276,0.0001552457,0.000059247956,0.00021923658,0.00021288874,0.00017074488],"domain_scores_gemma":[0.9949746,0.0018873746,0.0002458772,0.0019436645,0.0005096341,0.0004388317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007619624,0.0006231697,0.00065422355,0.0015049077,0.0013037359,0.0017442147,0.0012992258,0.0006100426,0.0134355845],"category_scores_gemma":[0.0037523748,0.0005378897,0.0010089792,0.0010236055,0.0012210814,0.003537942,0.0021254576,0.0024878902,0.002732717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045669609,0.0004297208,0.001514017,0.0005163455,0.0000937501,0.0010629282,0.0019274935,0.011153595,0.030925311,0.7514808,0.012262181,0.18817721],"study_design_scores_gemma":[0.000089928646,0.00020899487,0.00091287645,0.0001310131,0.000122459,0.00075464015,0.00077230536,0.03389392,0.023137204,0.8959883,0.043936115,0.000052248022],"about_ca_topic_score_codex":0.0008965796,"about_ca_topic_score_gemma":0.0023170842,"teacher_disagreement_score":0.0134355845,"about_ca_system_score_codex":0.00067516626,"about_ca_system_score_gemma":0.0005006849,"threshold_uncertainty_score":0.04494649},"labels":[],"label_agreement":null},{"id":"W2795353754","doi":"10.1007/978-3-319-89441-6_7","title":"Approximating Domination on Intersection Graphs of Paths on a Grid","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Graph; String (physics); Approximation algorithm; Mathematics; Physics; Discrete mathematics","score_opus":0.020236276699641596,"score_gpt":0.2799436579717326,"score_spread":0.259707381272091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795353754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5470473,0.0008919287,0.42487624,0.0008013904,0.00008098044,0.00016592386,0.00096935325,0.001516957,0.023649884],"genre_scores_gemma":[0.77712363,0.0006138903,0.20988105,0.00017215968,0.00007825556,0.00015712749,0.0017994333,0.0005518722,0.009622619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983967,0.00041600727,0.00006991234,0.00032645997,0.0004476739,0.00034334435],"domain_scores_gemma":[0.9917225,0.0057218536,0.00046570122,0.0011420943,0.00048577393,0.000462035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012139636,0.0012481005,0.0018782046,0.0018607201,0.0010949867,0.0026050294,0.0034410083,0.0012196596,0.0074569224],"category_scores_gemma":[0.009228731,0.0010863101,0.0012537875,0.003760414,0.0016678149,0.0048777754,0.0039033864,0.0026482365,0.0007568997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014934326,0.00037050087,0.010191988,0.0006460458,0.00022882206,0.0003826352,0.0010557281,0.64244705,0.009607569,0.17629378,0.011563317,0.14571911],"study_design_scores_gemma":[0.00007183875,0.00007111931,0.0007960292,0.00005089789,0.00004351535,0.00015921851,0.0002553374,0.8485755,0.0018532142,0.14554487,0.0025650417,0.000013408803],"about_ca_topic_score_codex":0.00657827,"about_ca_topic_score_gemma":0.009718329,"teacher_disagreement_score":0.0074569224,"about_ca_system_score_codex":0.0024597605,"about_ca_system_score_gemma":0.0011445835,"threshold_uncertainty_score":0.024945915},"labels":[],"label_agreement":null},{"id":"W2797568317","doi":"10.1137/18m1182255","title":"On a Generalization of Spikes","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Marsden Fund; National Science Foundation","keywords":"Matroid; Partition (number theory); Generalization; Matroid partitioning; Graphic matroid; Integer (computer science); Property (philosophy)","score_opus":0.018602800630308204,"score_gpt":0.30100844786668834,"score_spread":0.2824056472363801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797568317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43705976,0.0013405419,0.4198401,0.0052554104,0.0006125087,0.00018320266,0.0011150512,0.00093242014,0.13366102],"genre_scores_gemma":[0.90181255,0.00088080904,0.06852122,0.0016098338,0.00064193585,0.00017475005,0.000795057,0.00035811783,0.025205709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998953,0.0001610583,0.00005417276,0.00033809707,0.00028040595,0.00021325507],"domain_scores_gemma":[0.9973809,0.0008047821,0.0003441615,0.00069572806,0.00034860242,0.00042569096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006709951,0.00053933647,0.00080090744,0.0008646247,0.0018718517,0.0025605042,0.001585541,0.0013572864,0.008792073],"category_scores_gemma":[0.004345137,0.0003537666,0.0016877578,0.0016493944,0.0023512433,0.005823023,0.0035518073,0.0024704717,0.0008978675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007169755,0.000030498988,0.0007308255,0.00005698336,0.000018142386,0.00021903781,0.00021329822,0.010019316,0.0030240684,0.97117597,0.0034098746,0.01103026],"study_design_scores_gemma":[0.000024247329,0.0000643886,0.0005489696,0.000021532236,0.000017099905,0.00041790618,0.0002260204,0.045711394,0.0018002288,0.93351066,0.017637976,0.000019534607],"about_ca_topic_score_codex":0.002350975,"about_ca_topic_score_gemma":0.002149382,"teacher_disagreement_score":0.008792073,"about_ca_system_score_codex":0.0016239253,"about_ca_system_score_gemma":0.0006898637,"threshold_uncertainty_score":0.029412389},"labels":[],"label_agreement":null},{"id":"W280278083","doi":"10.1090/stml/061","title":"The Game of Cops and Robbers on Graphs","year":2011,"lang":"en","type":"book","venue":"Student mathematical library","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":332,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Business","score_opus":0.019958407136896214,"score_gpt":0.2728467777638407,"score_spread":0.25288837062694447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W280278083","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025144339,0.0068183797,0.15892589,0.004541093,0.0020506987,0.00015802022,0.0006435826,0.00054976606,0.80116826],"genre_scores_gemma":[0.2793751,0.009291502,0.0677062,0.0015270459,0.0010291942,0.00035690988,0.0012683806,0.0005910946,0.63885456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996475,0.00008105882,0.000011114598,0.000066994966,0.00013675826,0.00005652469],"domain_scores_gemma":[0.99965894,0.0001906108,0.000023517827,0.00003523639,0.000036092923,0.000055590062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022743575,0.0009103154,0.00077656267,0.0005315302,0.0014294146,0.0027966218,0.0010488948,0.0010930336,0.019183861],"category_scores_gemma":[0.0015741085,0.0005004625,0.00065570604,0.0008880736,0.0016560851,0.0040850015,0.0014651304,0.0021047026,0.0031869914],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027490249,0.000016347642,0.000067140296,0.0001276294,0.00001570829,0.00007774051,0.0002728073,0.006427268,0.00046226446,0.89747316,0.06371154,0.031320754],"study_design_scores_gemma":[0.000012567453,0.000037844056,0.0002883103,0.00013921129,0.000012444004,0.00020232322,0.0002705706,0.015026251,0.00041959263,0.7844861,0.19908357,0.000021248077],"about_ca_topic_score_codex":0.0019935302,"about_ca_topic_score_gemma":0.0028034546,"teacher_disagreement_score":0.019183861,"about_ca_system_score_codex":0.0013042713,"about_ca_system_score_gemma":0.000838815,"threshold_uncertainty_score":0.06417644},"labels":[],"label_agreement":null},{"id":"W2802999861","doi":"10.1016/j.jctb.2019.08.007","title":"Matroid fragility and relaxations of circuit hyperplanes","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Conjecture; Hyperplane; Combinatorics; Bounded function; Mathematics; Function (biology); Discrete mathematics; Mathematical analysis","score_opus":0.01814264768711815,"score_gpt":0.27175819323546824,"score_spread":0.2536155455483501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802999861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7778537,0.0010537163,0.15094928,0.0029458771,0.0001479626,0.00012737146,0.0019862629,0.0004079441,0.06452781],"genre_scores_gemma":[0.95649886,0.0006161387,0.025926335,0.00028890398,0.00025208844,0.00010296838,0.0015445353,0.00017075289,0.014599336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988871,0.00026990016,0.000046111938,0.00024080694,0.0002503542,0.00030581685],"domain_scores_gemma":[0.9952715,0.0026869865,0.0006330119,0.00055052835,0.0002800154,0.0005779524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096043525,0.0006363219,0.00092577294,0.0016410023,0.0014070182,0.0032612402,0.0020256117,0.0014987163,0.02159599],"category_scores_gemma":[0.0086351605,0.0009423448,0.0011510327,0.0019017038,0.0017936741,0.0053785266,0.002031426,0.004460174,0.00093280437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005652427,0.00031390725,0.002376606,0.00027685525,0.000069639216,0.00027196168,0.000795279,0.048036616,0.0051480783,0.8978769,0.009700977,0.03456792],"study_design_scores_gemma":[0.00007495063,0.00007261742,0.0013254844,0.000040272163,0.00002842245,0.00019447092,0.0003984054,0.09846773,0.0012848462,0.8947503,0.0033325164,0.00002993347],"about_ca_topic_score_codex":0.0020741117,"about_ca_topic_score_gemma":0.0019106661,"teacher_disagreement_score":0.02159599,"about_ca_system_score_codex":0.0015700564,"about_ca_system_score_gemma":0.00052650145,"threshold_uncertainty_score":0.07224578},"labels":[],"label_agreement":null},{"id":"W2804339795","doi":"10.1002/jgt.20457","title":"Acyclic dominating partitions","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Partition (number theory); Bipartite graph; Mathematics; Graph; Upper and lower bounds; Vertex (graph theory); Conjecture; Mathematical analysis","score_opus":0.016758006590472153,"score_gpt":0.3044405940250349,"score_spread":0.28768258743456276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804339795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38354796,0.0045516156,0.34254327,0.0051470646,0.00070986926,0.001553315,0.031289924,0.0019275353,0.22872943],"genre_scores_gemma":[0.7347211,0.0027457476,0.16373244,0.0018374718,0.0005049143,0.0010843788,0.03356227,0.00073777256,0.061073888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977301,0.00060832035,0.000117488235,0.00066699693,0.00041370216,0.000463507],"domain_scores_gemma":[0.9941882,0.003065988,0.00038016972,0.0007013318,0.0008347096,0.0008296131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013802219,0.0014699489,0.0012509533,0.0028230853,0.0031971128,0.0037723728,0.0014284627,0.0011087438,0.013742282],"category_scores_gemma":[0.0054850616,0.00093989103,0.0011105229,0.0038032169,0.0017436949,0.0042929747,0.0023214843,0.001955346,0.0025421348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008169968,0.000277424,0.0028501798,0.0013506957,0.00017412292,0.0010498402,0.0022145945,0.03519839,0.0076851887,0.8129922,0.07071848,0.06467187],"study_design_scores_gemma":[0.00019812761,0.00009610833,0.0014971911,0.00018135927,0.0001171893,0.0009723743,0.000712069,0.05308748,0.003724858,0.8689856,0.07037113,0.00005649023],"about_ca_topic_score_codex":0.0030258275,"about_ca_topic_score_gemma":0.004249461,"teacher_disagreement_score":0.013742282,"about_ca_system_score_codex":0.0026949432,"about_ca_system_score_gemma":0.0014379156,"threshold_uncertainty_score":0.045972466},"labels":[],"label_agreement":null},{"id":"W2804416848","doi":"10.1007/s00453-018-0456-z","title":"The Fast Search Number of a Complete k-Partite Graph","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Theory of computation; Mathematics; Fleischer; Discrete mathematics; Complete bipartite graph; Upper and lower bounds; Graph; Computer science; Algorithm","score_opus":0.02728497382287947,"score_gpt":0.32107480510330555,"score_spread":0.2937898312804261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804416848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7582271,0.0017060628,0.19249263,0.0039394153,0.00022888284,0.00013784386,0.004502709,0.0016634995,0.037101805],"genre_scores_gemma":[0.9049739,0.0005660516,0.08006571,0.0003234416,0.00015017769,0.00016421406,0.0025406855,0.0006037075,0.010612103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899477,0.00026423062,0.000037250287,0.00026608165,0.0002465314,0.00019117355],"domain_scores_gemma":[0.98831767,0.008988741,0.0005543348,0.00094976655,0.00062238576,0.0005671326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009960376,0.00067160546,0.0010405445,0.0018647389,0.001486817,0.0026134553,0.001828876,0.0017824178,0.009811623],"category_scores_gemma":[0.013826501,0.0006673288,0.00084304035,0.0019375134,0.0013715907,0.0055653183,0.0012020544,0.0014665478,0.0012702879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034895488,0.00031234263,0.012278044,0.0020704549,0.000293728,0.0005530793,0.0010327719,0.41803905,0.042142652,0.30500057,0.059660234,0.15512753],"study_design_scores_gemma":[0.00019702205,0.00019596796,0.0035304374,0.000085673986,0.0001430003,0.00043383005,0.00023466525,0.69357896,0.00968038,0.2864246,0.005440325,0.000055121385],"about_ca_topic_score_codex":0.0023792586,"about_ca_topic_score_gemma":0.004079792,"teacher_disagreement_score":0.009811623,"about_ca_system_score_codex":0.0015582088,"about_ca_system_score_gemma":0.001976531,"threshold_uncertainty_score":0.032823086},"labels":[],"label_agreement":null},{"id":"W2805891430","doi":"10.1016/j.dam.2018.04.022","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml16\" display=\"inline\" overflow=\"scroll\" altimg=\"si16.gif\"><mml:mi>k</mml:mi></mml:math>-broadcast domination and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml17\" display=\"inline\" overflow=\"scroll\" altimg=\"si16.gif\"><mml:mi>k</mml:mi></mml:math>-multipacking","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Johannesburg; National Research Foundation","keywords":"Mathematics; Vertex (graph theory); Graph; Algorithm; Discrete mathematics; Database; Combinatorics; Computer science","score_opus":0.01952157953672921,"score_gpt":0.2670571021251731,"score_spread":0.24753552258844388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805891430","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013022267,0.00037261308,0.15486509,0.006503401,0.0023243874,0.0006004029,0.15797648,0.11693919,0.5591162],"genre_scores_gemma":[0.022367349,0.0019288922,0.10291673,0.0035218992,0.0011875867,0.00088157045,0.26684278,0.13278033,0.4675728],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987684,0.00022323425,0.00012177395,0.00019281656,0.00052130624,0.00017242543],"domain_scores_gemma":[0.9959078,0.0011020985,0.00021535148,0.0011484409,0.0012064643,0.00041991923],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017423292,0.0017635882,0.001485257,0.0020679377,0.0013252092,0.0065961895,0.0039743776,0.002462591,0.6096722],"category_scores_gemma":[0.0081991125,0.0012954132,0.0014793475,0.0042432835,0.0009929253,0.007491185,0.0029123486,0.0030874722,0.4865179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098073586,0.000038245053,0.00013533173,0.00023079815,0.000009057369,0.000045527533,0.00010050748,0.00039732095,0.0013115037,0.026157988,0.9414607,0.030014846],"study_design_scores_gemma":[0.000050076644,0.000011858771,0.00030246688,0.00006038524,0.000006055586,0.00007997602,0.000063534506,0.0013439851,0.001987711,0.01707345,0.9789883,0.00003219711],"about_ca_topic_score_codex":0.012135651,"about_ca_topic_score_gemma":0.015024094,"teacher_disagreement_score":0.6096722,"about_ca_system_score_codex":0.0033293336,"about_ca_system_score_gemma":0.0022338533,"threshold_uncertainty_score":0.55675524},"labels":[],"label_agreement":null},{"id":"W2807719019","doi":"10.1007/s10878-020-00587-z","title":"Power domination on triangular grids with triangular and hexagonal shape","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Hexagonal crystal system; Mathematics; Graph; Theory of computation; Dominating set; Grid; Domination analysis; Hexagonal tiling; Geometry; Crystallography; Chemistry; Algorithm","score_opus":0.011670298745533731,"score_gpt":0.2498061933835625,"score_spread":0.23813589463802876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807719019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6882424,0.0004704935,0.20801382,0.000796356,0.00012895647,0.00012937443,0.0003975019,0.00029978633,0.101521306],"genre_scores_gemma":[0.96969116,0.00015671458,0.016746596,0.00010468963,0.00003486841,0.000056605768,0.00015126879,0.00007476587,0.012983283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995478,0.00013780726,0.000013331354,0.00006372997,0.00009829124,0.00013900628],"domain_scores_gemma":[0.9972451,0.0016808371,0.00024015445,0.00023045395,0.00029631113,0.00030713732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042033553,0.0003175451,0.0006425434,0.0008673088,0.0010449473,0.0015286098,0.0010471521,0.0005957556,0.009670098],"category_scores_gemma":[0.0041993633,0.00032816446,0.00044941227,0.00090371456,0.0009594191,0.0010700995,0.0012190987,0.00058187364,0.00050001784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068592234,0.000115322,0.0029306835,0.00023825606,0.000064777254,0.00089176197,0.000551469,0.23664519,0.010114393,0.70368993,0.008662515,0.03540969],"study_design_scores_gemma":[0.00012261693,0.000060569026,0.00092259166,0.000026854796,0.000023580196,0.00037542608,0.00028995506,0.6351045,0.0018456514,0.3577686,0.0034374879,0.00002215564],"about_ca_topic_score_codex":0.0046025915,"about_ca_topic_score_gemma":0.003342092,"teacher_disagreement_score":0.009670098,"about_ca_system_score_codex":0.00078619656,"about_ca_system_score_gemma":0.0004934046,"threshold_uncertainty_score":0.032349765},"labels":[],"label_agreement":null},{"id":"W2808380895","doi":"","title":"Random subgraphs of finite graphs. Part III: The phase transition for the n-cube","year":2003,"lang":"en","type":"article","venue":"TU/e Research Portal (Eindhoven University of Technology)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft; Microsoft Research","keywords":"Combinatorics; Mathematics; Discrete mathematics; Computer science","score_opus":0.038815622396553735,"score_gpt":0.314292359575483,"score_spread":0.2754767371789293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808380895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7674382,0.008127772,0.13918814,0.0057706116,0.0005818947,0.0001934699,0.0011054771,0.0006387253,0.076955855],"genre_scores_gemma":[0.9725543,0.0017993669,0.01392644,0.0006441197,0.00031851954,0.0001852669,0.0005502212,0.00014673299,0.00987493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978036,0.000072317096,0.000010684793,0.000045349367,0.000044720055,0.00004662339],"domain_scores_gemma":[0.99832207,0.0011720012,0.00017364828,0.0001525468,0.000066804954,0.00011295102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048057176,0.0002892171,0.0004919898,0.0008043783,0.0005736098,0.0015497287,0.00083070213,0.00091198,0.006291738],"category_scores_gemma":[0.0040187244,0.00037637033,0.00067694805,0.0007825278,0.0014729579,0.0020297957,0.00089998904,0.0009882338,0.00043621255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018977028,0.00009707356,0.001317324,0.0003128395,0.000035585985,0.00017877339,0.00030542418,0.029228274,0.0074318266,0.9307703,0.0107551,0.019377753],"study_design_scores_gemma":[0.00004820361,0.000046359695,0.0012170986,0.000054832904,0.000014653901,0.0002014907,0.0001021862,0.0856988,0.0023291009,0.9068933,0.0033782574,0.00001564284],"about_ca_topic_score_codex":0.0010781095,"about_ca_topic_score_gemma":0.001085298,"teacher_disagreement_score":0.006291738,"about_ca_system_score_codex":0.0007635986,"about_ca_system_score_gemma":0.00047005332,"threshold_uncertainty_score":0.02104801},"labels":[],"label_agreement":null},{"id":"W2808957893","doi":"10.1016/j.dam.2018.05.041","title":"Chronological rectangle digraphs which are two-terminal series–parallel","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rectangle; Generalization; Interval (graph theory); Mathematics; Class (philosophy); Combinatorics; Terminal (telecommunication); Series (stratigraphy); Characterization (materials science); Time complexity; Discrete mathematics; Polynomial; Computer science; Artificial intelligence","score_opus":0.02441270266182032,"score_gpt":0.2966772765144264,"score_spread":0.27226457385260605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808957893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23134187,0.00052743027,0.38625497,0.000748715,0.0011973279,0.00060317025,0.003867123,0.0030153685,0.37244403],"genre_scores_gemma":[0.7146168,0.00069528376,0.15268837,0.0005618467,0.00018756115,0.00040133356,0.0039973515,0.0005075305,0.12634392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959034,0.00006779638,0.000031634867,0.0001390951,0.00007101234,0.000100225334],"domain_scores_gemma":[0.99880743,0.000251639,0.00015159365,0.0003104584,0.00025842388,0.00022057963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034229507,0.00051543344,0.00041294494,0.0010361248,0.0014216047,0.0016044658,0.0010352427,0.0006122242,0.030080665],"category_scores_gemma":[0.0015408164,0.00048474714,0.0005702649,0.0013629522,0.0008540404,0.0020264767,0.00091999886,0.0011344482,0.004786346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030352405,0.00014055498,0.0006365933,0.00028145962,0.00004263299,0.0010673373,0.0003305853,0.005143325,0.012589124,0.933042,0.010419168,0.036003657],"study_design_scores_gemma":[0.00016273331,0.00023843288,0.0015313316,0.00013314116,0.00014216625,0.0017820525,0.00076092733,0.029460376,0.020497141,0.75493497,0.19026154,0.00009517204],"about_ca_topic_score_codex":0.0013564593,"about_ca_topic_score_gemma":0.0028501237,"teacher_disagreement_score":0.030080665,"about_ca_system_score_codex":0.0007422047,"about_ca_system_score_gemma":0.0008790043,"threshold_uncertainty_score":0.100629866},"labels":[],"label_agreement":null},{"id":"W2809063493","doi":"10.1007/978-3-319-71840-8_12","title":"Lexicographic Orientation Algorithms","year":2018,"lang":"en","type":"book-chapter","venue":"Springer monographs in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Lexicographical order; Orientation (vector space); Graph; Computer science; Algorithm; Mathematics; Combinatorics; Geometry","score_opus":0.03766803626619856,"score_gpt":0.29975090573399643,"score_spread":0.26208286946779785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809063493","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013660029,0.0067975433,0.39490488,0.0037419947,0.0014903632,0.00017592928,0.0017326578,0.002989523,0.5745071],"genre_scores_gemma":[0.16369346,0.014392653,0.4923471,0.0020104086,0.0013987864,0.00044006374,0.009285811,0.00385959,0.31257212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926394,0.00014046059,0.000039370476,0.00018046368,0.00027351367,0.00010215421],"domain_scores_gemma":[0.99919564,0.00029034063,0.000029679544,0.0002885665,0.00014509508,0.000050702623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047710468,0.0009399071,0.0007983381,0.0016812498,0.001183663,0.0040817615,0.0012883794,0.0010147585,0.04766045],"category_scores_gemma":[0.0024056106,0.00065618736,0.00083575695,0.004383985,0.0013078898,0.005480527,0.0025077667,0.0033519175,0.022007143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005537755,0.00007808488,0.00018110817,0.00022065839,0.000015525264,0.000031008105,0.0001416607,0.0018003157,0.0010620161,0.6251172,0.075705186,0.29559186],"study_design_scores_gemma":[0.000021054686,0.000013137304,0.00013823384,0.00009883272,0.000016117498,0.00013020402,0.00010367028,0.0053510386,0.0017575944,0.80102104,0.19133517,0.000013825974],"about_ca_topic_score_codex":0.00087600556,"about_ca_topic_score_gemma":0.0013403964,"teacher_disagreement_score":0.04766045,"about_ca_system_score_codex":0.0014278711,"about_ca_system_score_gemma":0.0014215418,"threshold_uncertainty_score":0.15944004},"labels":[],"label_agreement":null},{"id":"W2811248481","doi":"","title":"Branch width and well-quasi-ordering in matroids and graphs","year":2000,"lang":"en","type":"article","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; University of Toronto","keywords":"Matroid; Bounded function; Combinatorics; Mathematics; Class (philosophy); Discrete mathematics; Graphic matroid; Finite field; Tree (set theory); Computer science; Mathematical analysis","score_opus":0.04149826586960008,"score_gpt":0.337673932763571,"score_spread":0.2961756668939709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811248481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7259496,0.0012997962,0.24810626,0.0015813827,0.00010545291,0.000042501717,0.0004935298,0.00037500373,0.02204647],"genre_scores_gemma":[0.94986564,0.0006617083,0.0434241,0.00016403284,0.0001473424,0.000041789914,0.00041376514,0.00007902541,0.005202669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999363,0.00013329621,0.000048450667,0.0001792457,0.00013952522,0.00013650724],"domain_scores_gemma":[0.99592245,0.0015714049,0.0009134134,0.0006286665,0.0003557702,0.0006082307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072743354,0.0005555308,0.00038158265,0.0011476218,0.0009096201,0.0025375567,0.0007263574,0.0005270457,0.0031927393],"category_scores_gemma":[0.0023046557,0.00041409483,0.000583433,0.0013760194,0.0023095652,0.006928683,0.0010679847,0.0016079228,0.00038456512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017391572,0.00010019766,0.0042906743,0.00012392577,0.00002433125,0.00025634046,0.0009870705,0.00682286,0.015319713,0.9498186,0.001395658,0.020686602],"study_design_scores_gemma":[0.00002022182,0.00013069277,0.0031479674,0.000034177363,0.000032374897,0.00056186056,0.0005655851,0.023362573,0.009481235,0.95434505,0.008286824,0.000031393134],"about_ca_topic_score_codex":0.0008977665,"about_ca_topic_score_gemma":0.0013694487,"teacher_disagreement_score":0.0031927393,"about_ca_system_score_codex":0.0009009908,"about_ca_system_score_gemma":0.00035139653,"threshold_uncertainty_score":0.010680795},"labels":[],"label_agreement":null},{"id":"W2825514135","doi":"10.1016/j.jctb.2018.07.001","title":"Peripheral circuits in infinite binary matroids","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Matroid; Electronic circuit; Mathematics; Computer science; Combinatorics; Discrete mathematics; Physics; Arithmetic; Quantum mechanics","score_opus":0.015186765259390072,"score_gpt":0.28264592315740134,"score_spread":0.2674591578980113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2825514135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81326294,0.000704385,0.09358697,0.00094163546,0.000113242175,0.000041186373,0.00030860954,0.0004605703,0.0905804],"genre_scores_gemma":[0.9775978,0.0002078897,0.008172439,0.0001500789,0.0000878485,0.000038159484,0.00019191903,0.00008673144,0.013467208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962926,0.0000949126,0.000020926303,0.000078674355,0.00009785394,0.000078306366],"domain_scores_gemma":[0.9984212,0.0008443477,0.00017298861,0.00012036159,0.0001615043,0.00027971194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032601872,0.0004125916,0.0006157931,0.0013415382,0.0013224253,0.0037032748,0.001042989,0.0009468135,0.010451614],"category_scores_gemma":[0.0026131968,0.00045859348,0.00036167848,0.0012286912,0.0013683679,0.0036369562,0.0014509527,0.0016413539,0.00087630475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095754796,0.000047052108,0.000416852,0.0000654968,0.000005485978,0.00011822752,0.00020108896,0.0017320386,0.0016573244,0.98594296,0.0011192346,0.008598583],"study_design_scores_gemma":[0.000026244832,0.00001996194,0.00032223455,0.00001845581,0.000012813553,0.00017945781,0.000075498065,0.012212264,0.00089767645,0.98461664,0.0016102227,0.000008526506],"about_ca_topic_score_codex":0.0003291866,"about_ca_topic_score_gemma":0.00072843593,"teacher_disagreement_score":0.010451614,"about_ca_system_score_codex":0.0008093605,"about_ca_system_score_gemma":0.0002754847,"threshold_uncertainty_score":0.034964144},"labels":[],"label_agreement":null},{"id":"W2883056852","doi":"10.1007/s00373-018-1925-5","title":"On the Structure of (Even Hole, Kite)-Free Graphs","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Kite; Chordal graph; Vertex (graph theory); Split graph; Discrete mathematics; Graph; 1-planar graph; Geometry","score_opus":0.013030967221145003,"score_gpt":0.24866358694866922,"score_spread":0.23563261972752422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883056852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9155866,0.0010827696,0.036441166,0.0019272068,0.00012152045,0.000031633128,0.00044593826,0.00018727832,0.044175915],"genre_scores_gemma":[0.98154217,0.00057302904,0.006868909,0.00036419005,0.00009307199,0.000025737894,0.00039673658,0.00007473304,0.010061428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970883,0.00007457776,0.000011219372,0.00006671808,0.000056969286,0.00008162443],"domain_scores_gemma":[0.9979894,0.0010384341,0.0003264177,0.0001848872,0.00017665784,0.00028415048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003828926,0.0004856449,0.00058169983,0.0020273535,0.0016034296,0.002732041,0.0010628828,0.0011128543,0.0065303743],"category_scores_gemma":[0.0021124664,0.00050119817,0.00034219277,0.0015990897,0.0025327166,0.0041448204,0.0018253312,0.0014650514,0.00071581244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010526448,0.000043454445,0.0011260832,0.0000897853,0.000012772381,0.00024907535,0.0010685278,0.0037383582,0.0024905507,0.9802013,0.0024212296,0.008453517],"study_design_scores_gemma":[0.000010676543,0.000014331607,0.0006261808,0.000021694157,0.000008827023,0.000080316364,0.00028333144,0.0038714262,0.00033295414,0.9931104,0.0016276835,0.000012213838],"about_ca_topic_score_codex":0.0011866717,"about_ca_topic_score_gemma":0.002078344,"teacher_disagreement_score":0.0065303743,"about_ca_system_score_codex":0.00075845676,"about_ca_system_score_gemma":0.00044625896,"threshold_uncertainty_score":0.021846294},"labels":[],"label_agreement":null},{"id":"W2883247096","doi":"10.1002/jgt.22466","title":"Naji's characterization of circle graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Characterization (materials science); Discrete mathematics","score_opus":0.009212636301056067,"score_gpt":0.2538532904317289,"score_spread":0.24464065413067282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883247096","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22513236,0.0011892718,0.3524395,0.006640855,0.00096139155,0.00017129049,0.0010945924,0.0012475983,0.41112313],"genre_scores_gemma":[0.9180332,0.0008266979,0.046043914,0.0014749842,0.00052824215,0.00020404994,0.00045645755,0.00027938557,0.032153077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856853,0.00027742505,0.00006735485,0.00039517952,0.00046906047,0.00022249125],"domain_scores_gemma":[0.99465203,0.0021770687,0.00040969628,0.00074259104,0.001519452,0.0004991029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092266925,0.0004904386,0.00070900825,0.0021183325,0.0025079395,0.0021680384,0.0014264033,0.0010892157,0.014140929],"category_scores_gemma":[0.00630821,0.00049388665,0.0007781494,0.0018044602,0.0028290018,0.005784663,0.0031071731,0.0026807333,0.0016473589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046114015,0.000018462686,0.0005485793,0.000096301614,0.000009513154,0.00013317623,0.00061916164,0.0007350676,0.00301003,0.9811864,0.0063289306,0.0072682127],"study_design_scores_gemma":[0.000019976955,0.000040614785,0.0022257932,0.000045943383,0.00003829287,0.0007056782,0.0005397975,0.010233352,0.0051807286,0.91202193,0.06888451,0.000063237254],"about_ca_topic_score_codex":0.0020747287,"about_ca_topic_score_gemma":0.0013010814,"teacher_disagreement_score":0.014140929,"about_ca_system_score_codex":0.0010432046,"about_ca_system_score_gemma":0.0005957161,"threshold_uncertainty_score":0.04730612},"labels":[],"label_agreement":null},{"id":"W2883406596","doi":"10.23638/dmtcs-21-3-1","title":"Binding Number, Toughness and General Matching Extendability in Graphs","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Matching (statistics); Graph; Discrete mathematics","score_opus":0.02073836180585886,"score_gpt":0.3185557908663956,"score_spread":0.29781742906053676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883406596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7539853,0.0012901429,0.2052795,0.0025429933,0.00018317271,0.00014018672,0.0014836516,0.00077561574,0.03431952],"genre_scores_gemma":[0.956026,0.0008971192,0.032078348,0.00042360183,0.0002510435,0.00022542638,0.000953988,0.00011179611,0.009032616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979292,0.00025525113,0.0001407147,0.00074805284,0.00044962106,0.00047701562],"domain_scores_gemma":[0.98804575,0.0069847372,0.0015389872,0.0011421652,0.0004566727,0.0018317892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532172,0.0010300104,0.001222001,0.0025397614,0.0015006656,0.002630404,0.0022892132,0.0013415803,0.008321608],"category_scores_gemma":[0.008314614,0.0010397938,0.0015920147,0.0023773692,0.00450682,0.007270851,0.00386775,0.0039595463,0.0006796865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010450514,0.00036014876,0.010169295,0.000624349,0.00015790893,0.00085024897,0.0018650641,0.07251148,0.020761676,0.8393603,0.0070967935,0.04519777],"study_design_scores_gemma":[0.0000834966,0.00017434113,0.0073958375,0.000077006545,0.00007615623,0.00075369154,0.00037329743,0.06419666,0.0034968928,0.9167153,0.006559898,0.00009743615],"about_ca_topic_score_codex":0.0023463916,"about_ca_topic_score_gemma":0.0022654945,"teacher_disagreement_score":0.008321608,"about_ca_system_score_codex":0.0017668138,"about_ca_system_score_gemma":0.0008431126,"threshold_uncertainty_score":0.027838588},"labels":[],"label_agreement":null},{"id":"W2883849606","doi":"10.1016/j.disc.2018.06.026","title":"A complexity dichotomy for signed <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml3\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi mathvariant=\"bold\">H</mml:mi></mml:math>-colouring","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Mathematics; Discrete mathematics; Algorithm; Computer science; Theology","score_opus":0.033416933724127615,"score_gpt":0.290930367711206,"score_spread":0.2575134339870784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883849606","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22014433,0.0036696277,0.24917586,0.043970723,0.0013487587,0.00015159514,0.0031883602,0.00096393324,0.4773867],"genre_scores_gemma":[0.9041264,0.0016508648,0.03440076,0.0058836713,0.0022635437,0.0003222266,0.002447184,0.0005883141,0.048317082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654824,0.0007932942,0.00016531647,0.00083960907,0.0011005338,0.000552994],"domain_scores_gemma":[0.9798902,0.014818994,0.0009119093,0.0017582237,0.001516988,0.0011035807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022342254,0.0007060489,0.0011037871,0.0028833135,0.0036066072,0.008271809,0.0017034992,0.0026444371,0.023747427],"category_scores_gemma":[0.014286822,0.0005655675,0.0019295684,0.0019390159,0.004946887,0.015190168,0.0052330894,0.007516647,0.0031518107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003472836,0.00002089856,0.00015818409,0.00004993887,0.0000065603576,0.000031219308,0.0001063654,0.00063655037,0.00024608755,0.9890342,0.0065812785,0.0030940697],"study_design_scores_gemma":[0.000013498852,0.000007930542,0.00017221249,0.000014356646,0.000005184955,0.000038492886,0.000036549896,0.003815678,0.00014508469,0.9931514,0.0025901797,0.000009427295],"about_ca_topic_score_codex":0.0020370376,"about_ca_topic_score_gemma":0.0014791595,"teacher_disagreement_score":0.023747427,"about_ca_system_score_codex":0.004740572,"about_ca_system_score_gemma":0.0017228427,"threshold_uncertainty_score":0.07944304},"labels":[],"label_agreement":null},{"id":"W2883962117","doi":"10.4230/lipics.mfcs.2018.37","title":"Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; University of California, Santa Barbara; National Science Foundation","keywords":"Diagonal; Combinatorics; Mathematics; Intersection (aeronautics); Line segment; Approximation algorithm; Logarithm; Dominating set; Line (geometry); Discrete mathematics; Geometry; Graph; Mathematical analysis","score_opus":0.028714842930334793,"score_gpt":0.3103756508637333,"score_spread":0.28166080793339854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883962117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25854805,0.0030633002,0.71222246,0.0022204223,0.00029008096,0.00035920276,0.004003928,0.002776587,0.01651592],"genre_scores_gemma":[0.5644196,0.0012420652,0.41938812,0.0007143391,0.00021086623,0.00035517683,0.006643983,0.00059208734,0.006433827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749845,0.0007131379,0.0001171732,0.00088721147,0.0004004773,0.0003835229],"domain_scores_gemma":[0.9960211,0.002289543,0.00047520036,0.0005516754,0.00030311418,0.00035940474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001490676,0.00218077,0.0023532833,0.0013346919,0.0011443883,0.0023816605,0.003165705,0.0014457096,0.0048025204],"category_scores_gemma":[0.008745707,0.0009093818,0.0015981004,0.0036243382,0.001004645,0.004752096,0.003011431,0.002085615,0.0010938273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014838481,0.00030530294,0.0033802674,0.0010291503,0.00032922113,0.00058767525,0.001145011,0.7409233,0.009870382,0.107454285,0.018460585,0.1150311],"study_design_scores_gemma":[0.00010927221,0.00021721055,0.0007508991,0.00007314881,0.00008552419,0.00036212496,0.00041174158,0.87576574,0.004349036,0.109526545,0.008312206,0.000036622696],"about_ca_topic_score_codex":0.0048483904,"about_ca_topic_score_gemma":0.004061999,"teacher_disagreement_score":0.0048483904,"about_ca_system_score_codex":0.002758661,"about_ca_system_score_gemma":0.0011409813,"threshold_uncertainty_score":0.020015597},"labels":[],"label_agreement":null},{"id":"W2885565269","doi":"10.1016/j.ejc.2025.104223","title":"Splitter theorems for graph immersions","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Corollary; Mathematics; Splitter; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Geometry; Telecommunications","score_opus":0.01636324418123912,"score_gpt":0.2859100178305071,"score_spread":0.269546773649268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885565269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43419957,0.0013566337,0.48343378,0.0012763502,0.00030683188,0.00019646306,0.0004717423,0.00079602236,0.077962585],"genre_scores_gemma":[0.9437928,0.0008759146,0.041252606,0.0004537542,0.00018881029,0.00022908617,0.0006327239,0.00026965883,0.012304641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883527,0.00016278803,0.000072386676,0.00034082498,0.0003383007,0.00025046998],"domain_scores_gemma":[0.9936841,0.003266697,0.00068601535,0.0006090188,0.00083543063,0.00091869495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017398389,0.001243256,0.0009174236,0.0030512114,0.0015051824,0.0021298463,0.0012715765,0.0013410662,0.010051273],"category_scores_gemma":[0.006908031,0.00075122365,0.002213876,0.0008909361,0.0031410228,0.008160022,0.006560597,0.0038842,0.0013178342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100034194,0.00004762378,0.0012859826,0.00012737556,0.000045479002,0.0004961301,0.0012285868,0.0029049185,0.0052284594,0.973434,0.0018935468,0.013207897],"study_design_scores_gemma":[0.000041503954,0.00013873959,0.00097199465,0.000052028936,0.000047124333,0.00066209026,0.0005478337,0.017688109,0.0061125783,0.967748,0.005956591,0.000033443448],"about_ca_topic_score_codex":0.00042364097,"about_ca_topic_score_gemma":0.00034674085,"teacher_disagreement_score":0.010051273,"about_ca_system_score_codex":0.0011610333,"about_ca_system_score_gemma":0.00030358377,"threshold_uncertainty_score":0.033624887},"labels":[],"label_agreement":null},{"id":"W2885573521","doi":"10.48550/arxiv.1807.11543","title":"The structure of claw-free binary matroids","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Matroid; Claw; Combinatorics; Mathematics; Rank (graph theory); Binary number; Graphic matroid; Simple (philosophy); Discrete mathematics; Arithmetic; Biology","score_opus":0.04717016372486876,"score_gpt":0.2124765314267545,"score_spread":0.16530636770188573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885573521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8873952,0.0007424727,0.07728169,0.0006708817,0.00004769647,0.000068138936,0.0011353821,0.0003317636,0.032326788],"genre_scores_gemma":[0.962806,0.00034017634,0.022426035,0.00018383579,0.000092978546,0.00008385753,0.001491547,0.00006211518,0.012513548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947304,0.000044458393,0.00002806564,0.00016312717,0.00017280462,0.000118543845],"domain_scores_gemma":[0.9989655,0.00018559898,0.0002554436,0.00015308129,0.00017597752,0.0002643545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025912933,0.00035054403,0.0004124962,0.0019765235,0.0012068661,0.0027700327,0.0009205175,0.0006920353,0.0044162623],"category_scores_gemma":[0.0011794649,0.0005948387,0.00035600734,0.001836164,0.0014090382,0.0028371396,0.0014043507,0.0012363507,0.0007077287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001369371,0.0001044077,0.0029602656,0.00016825681,0.000026987771,0.00027670208,0.0016357403,0.0046554147,0.014312029,0.94084996,0.0038680653,0.031005256],"study_design_scores_gemma":[0.000054348067,0.00010576147,0.0060595954,0.000067634945,0.00003866954,0.0009924343,0.00077989383,0.028854439,0.009396887,0.9324451,0.021144178,0.000061079714],"about_ca_topic_score_codex":0.001819193,"about_ca_topic_score_gemma":0.0017208846,"teacher_disagreement_score":0.0044162623,"about_ca_system_score_codex":0.0010300218,"about_ca_system_score_gemma":0.00037785905,"threshold_uncertainty_score":0.014773846},"labels":[],"label_agreement":null},{"id":"W2885679157","doi":"10.37236/8211","title":"Classes of Graphs with $e$-Positive Chromatic Symmetric Function","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Compute Canada; Natural Sciences and Engineering Research Council of Canada; Wilfrid Laurier University","keywords":"Combinatorics; Mathematics; Conjecture; Interval graph; Chromatic scale; Discrete mathematics; Graph; Comparability graph; Pathwidth; Cograph; Indifference graph; Complement (music); Line graph","score_opus":0.009679500078962637,"score_gpt":0.2523303625708365,"score_spread":0.24265086249187387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885679157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9322478,0.00026965578,0.03444135,0.0006367525,0.000035729736,0.00004234134,0.00035163018,0.00016179863,0.031812876],"genre_scores_gemma":[0.99128026,0.00017869315,0.0044040973,0.00011010972,0.000034493365,0.00004427642,0.00033375333,0.000027934911,0.0035863905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958783,0.000063331245,0.000016729464,0.00012449706,0.00010894821,0.00009871998],"domain_scores_gemma":[0.9982653,0.00081335934,0.00030618397,0.0001507932,0.00019460807,0.00026979722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005097866,0.00051677594,0.00037361216,0.0020374449,0.001051443,0.0021894637,0.00073241646,0.0008219946,0.0047435584],"category_scores_gemma":[0.0019870128,0.00032053748,0.00051945954,0.0011415776,0.0022138667,0.002501348,0.0010978936,0.00088616787,0.0003612391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021630873,0.00008602895,0.011118045,0.000108819666,0.0000337016,0.00037712554,0.00053693773,0.0042967205,0.013373444,0.93305403,0.0027075042,0.034091387],"study_design_scores_gemma":[0.000059592705,0.00008339839,0.011145627,0.00004052518,0.000042747804,0.0016002216,0.000689588,0.022009334,0.010033662,0.94547033,0.008777456,0.000047481415],"about_ca_topic_score_codex":0.000729859,"about_ca_topic_score_gemma":0.0006569433,"teacher_disagreement_score":0.0047435584,"about_ca_system_score_codex":0.0010350577,"about_ca_system_score_gemma":0.00039283806,"threshold_uncertainty_score":0.015868723},"labels":[],"label_agreement":null},{"id":"W2887371649","doi":"10.1007/978-3-642-39206-1_29","title":"On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Travelling salesman problem; Digraph; Mathematics; Linear programming relaxation; Linear programming; Relaxation (psychology); Discrete mathematics; Algorithm","score_opus":0.03251250968723412,"score_gpt":0.30365985449521377,"score_spread":0.27114734480797964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887371649","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34918988,0.0054982128,0.1706149,0.0052587185,0.0006635422,0.00015424014,0.00059882726,0.0006956977,0.46732605],"genre_scores_gemma":[0.95049256,0.0020489981,0.025240889,0.00051920244,0.0009163065,0.0001336813,0.00038670565,0.0005062594,0.019755384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978289,0.00055672834,0.000092308714,0.0002824213,0.0006791239,0.0005605145],"domain_scores_gemma":[0.99178374,0.005338869,0.00058244565,0.00061600655,0.0007228606,0.00095619017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023272464,0.001035689,0.0018728881,0.0040780297,0.0032480238,0.0051187244,0.0038869681,0.0019492899,0.019587765],"category_scores_gemma":[0.016630895,0.00074520154,0.0011033813,0.0041293576,0.0037986827,0.008110281,0.002995169,0.0058455723,0.0021123576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004031018,0.00003384295,0.0002100486,0.000059296843,0.000006278109,0.00003829916,0.0001396868,0.0032426226,0.0004798198,0.98597497,0.0026586775,0.0071161576],"study_design_scores_gemma":[0.000019266896,0.000014391564,0.00025537185,0.000028431508,0.000013867303,0.00010633622,0.0001039669,0.023722742,0.00028261187,0.97286,0.0025789887,0.000013987654],"about_ca_topic_score_codex":0.0024277614,"about_ca_topic_score_gemma":0.002683182,"teacher_disagreement_score":0.019587765,"about_ca_system_score_codex":0.004832138,"about_ca_system_score_gemma":0.001383684,"threshold_uncertainty_score":0.06552756},"labels":[],"label_agreement":null},{"id":"W2888654318","doi":"10.48550/arxiv.2011.08049","title":"Efficient polynomial-time approximation scheme for the genus of dense graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani","keywords":"Combinatorics; Mathematics; Embedding; Genus; Time complexity; Order (exchange); Polynomial; Discrete mathematics; Function (biology); Mathematical analysis; Computer science; Finance","score_opus":0.07299527911596179,"score_gpt":0.2208616486884298,"score_spread":0.14786636957246801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888654318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16081794,0.0009168526,0.81045145,0.0011767916,0.00012171596,0.00026576463,0.0015593881,0.013364359,0.01132577],"genre_scores_gemma":[0.5255451,0.00042874942,0.4629489,0.0002769704,0.00008490295,0.00028369567,0.0035875887,0.0010458566,0.0057983105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998078,0.00021312987,0.00010694157,0.0005193413,0.0006206924,0.00046188384],"domain_scores_gemma":[0.9965766,0.0011881773,0.0002595225,0.001486227,0.00029317112,0.00019617139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011408873,0.0016437905,0.0013805282,0.0010615285,0.001060452,0.0034092306,0.0036212828,0.0013248168,0.0068505323],"category_scores_gemma":[0.0064672423,0.00062515895,0.001799286,0.0018635748,0.00119825,0.0061382228,0.0033026498,0.0029958198,0.0023793504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028717972,0.000539831,0.008141891,0.0010580899,0.0001853986,0.00030215151,0.0013855085,0.4011152,0.03830851,0.1471045,0.024125163,0.37486202],"study_design_scores_gemma":[0.000191946,0.00013657026,0.0009092301,0.000062990075,0.000078948135,0.00017494192,0.00019930296,0.8692351,0.011393142,0.11040233,0.0071748486,0.000040612438],"about_ca_topic_score_codex":0.0059080804,"about_ca_topic_score_gemma":0.008663482,"teacher_disagreement_score":0.0068505323,"about_ca_system_score_codex":0.0042962576,"about_ca_system_score_gemma":0.0028147148,"threshold_uncertainty_score":0.03117168},"labels":[],"label_agreement":null},{"id":"W2889763467","doi":"10.1016/j.dam.2018.08.003","title":"Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.018023949806797272,"score_gpt":0.2931661814805807,"score_spread":0.27514223167378343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889763467","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008073147,0.04694974,0.12256733,0.091215625,0.57589436,0.0006886011,0.010742967,0.0028356228,0.14103256],"genre_scores_gemma":[0.051450986,0.024956347,0.04653658,0.011904182,0.18210278,0.00057286624,0.020456422,0.0036051094,0.6584147],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988231,0.00027793174,0.000053970656,0.0003560012,0.00036658137,0.00012244919],"domain_scores_gemma":[0.99572134,0.00073957193,0.00011324555,0.00035233927,0.002018908,0.0010544704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025193514,0.0019240772,0.0015080501,0.0018758579,0.0019624766,0.0047096326,0.0018711952,0.0015581985,0.121883504],"category_scores_gemma":[0.007067298,0.0005885056,0.0015413985,0.0016229723,0.00068358216,0.0042790296,0.0027023403,0.0042905784,0.044074025],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100893354,0.000050653707,0.00016450381,0.00015998878,0.000015011783,0.00003737418,0.000048852064,0.00072304474,0.00056950573,0.0058785705,0.9492873,0.042964246],"study_design_scores_gemma":[0.00006990749,0.000139443,0.0018591221,0.00044085502,0.000047839138,0.00016371794,0.0003075006,0.002848227,0.0013579484,0.039417785,0.95328873,0.000058858015],"about_ca_topic_score_codex":0.0033581739,"about_ca_topic_score_gemma":0.0062252823,"teacher_disagreement_score":0.121883504,"about_ca_system_score_codex":0.003604656,"about_ca_system_score_gemma":0.0019137256,"threshold_uncertainty_score":0.40774095},"labels":[],"label_agreement":null},{"id":"W2892627562","doi":"10.7561/sacs.2018.2.237","title":"A Precise Characterisation of Step Traces and Their Concurrent Histories","year":2018,"lang":"en","type":"article","venue":"Scientific Annals of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; History; Programming language","score_opus":0.06472090157000439,"score_gpt":0.3354733992565607,"score_spread":0.27075249768655635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892627562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06775242,0.0006830497,0.9110645,0.00031400064,0.00010421146,0.0002216748,0.0007711781,0.00084287,0.018246045],"genre_scores_gemma":[0.7494298,0.00076769514,0.22956496,0.00023503102,0.000219486,0.00051877106,0.0010762654,0.0005006675,0.01768725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978908,0.00029380698,0.00020975081,0.0005534175,0.00078537833,0.00026696178],"domain_scores_gemma":[0.9928227,0.0026108678,0.000980233,0.001951261,0.0011993384,0.00043561464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001752616,0.00071007124,0.00064096786,0.0022295732,0.0011751105,0.0028531787,0.0016598476,0.0010660919,0.0058073173],"category_scores_gemma":[0.0113243675,0.00073266396,0.0010086937,0.0017282013,0.0034069684,0.0074720783,0.0023559525,0.0025628216,0.0009010298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004440781,0.000026261221,0.0009719156,0.00008107685,0.000014902853,0.00022332407,0.0005811853,0.0042578215,0.002915271,0.9776268,0.0003846452,0.012872358],"study_design_scores_gemma":[0.00002094341,0.00007143507,0.0008957693,0.00009224403,0.000040005,0.0004895718,0.0002389987,0.036564276,0.006126737,0.93448687,0.020930871,0.00004229894],"about_ca_topic_score_codex":0.0020672518,"about_ca_topic_score_gemma":0.0015300544,"teacher_disagreement_score":0.0058073173,"about_ca_system_score_codex":0.0010481566,"about_ca_system_score_gemma":0.0012928249,"threshold_uncertainty_score":0.01942736},"labels":[],"label_agreement":null},{"id":"W2894741972","doi":"10.1007/s00373-020-02174-9","title":"Which Graphs Occur as $$\\gamma $$-Graphs?","year":2020,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Split graph; Discrete mathematics; Dominating set; Pathwidth; Graph; Indifference graph; Line graph; Vertex (graph theory)","score_opus":0.027846297911901557,"score_gpt":0.2867018332296616,"score_spread":0.25885553531776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894741972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5088586,0.0058477,0.1625807,0.026127156,0.0021268532,0.00013091078,0.0031080665,0.0024092293,0.2888108],"genre_scores_gemma":[0.92838526,0.0030327218,0.021412585,0.0027157587,0.0008950515,0.00008652494,0.0015502833,0.001100938,0.040820915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987638,0.00030716593,0.000056584857,0.00036739185,0.00020049867,0.00030456285],"domain_scores_gemma":[0.99312955,0.0030356026,0.0009932681,0.0013571854,0.0009479006,0.0005364009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009808168,0.00076704496,0.0010577327,0.0024967089,0.0023834014,0.008100547,0.0021663588,0.00257539,0.026338547],"category_scores_gemma":[0.008682948,0.0009800055,0.0009362654,0.004358333,0.00401188,0.018941924,0.0019877004,0.0020515528,0.0064975894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064519154,0.000035236913,0.0023142146,0.000114083785,0.000019156314,0.00015582477,0.0006858988,0.00053847884,0.00057657564,0.9610724,0.012382971,0.022040596],"study_design_scores_gemma":[0.000006359563,0.0000030999947,0.00034542562,0.000045656514,0.000017031298,0.00020061011,0.0007672572,0.0010379128,0.0006356389,0.9842651,0.012665958,0.0000099347235],"about_ca_topic_score_codex":0.0016924161,"about_ca_topic_score_gemma":0.0021967136,"teacher_disagreement_score":0.026338547,"about_ca_system_score_codex":0.0014435373,"about_ca_system_score_gemma":0.0007331595,"threshold_uncertainty_score":0.08811122},"labels":[],"label_agreement":null},{"id":"W2895524825","doi":"10.22215/etd/2015-10989","title":"Facial Nonrepetitive Graph Colourings","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Bounded function; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.02347699655785219,"score_gpt":0.3341336922054354,"score_spread":0.3106566956475832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895524825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6293019,0.0007603475,0.2727018,0.0006274518,0.00022221563,0.00031126148,0.0015974445,0.0014489961,0.093028516],"genre_scores_gemma":[0.8129675,0.00061980647,0.15110496,0.00021396785,0.00007097003,0.00021807171,0.0021534918,0.00038121274,0.032270055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993469,0.000086013446,0.00003431561,0.00022048713,0.00015791504,0.00015435701],"domain_scores_gemma":[0.99817944,0.00046720586,0.0002194756,0.00058087875,0.00036771793,0.00018537868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002970327,0.0004558922,0.0003734487,0.00046885337,0.000916987,0.00095358666,0.0011880379,0.00057417376,0.010492042],"category_scores_gemma":[0.002371515,0.00032027537,0.0004146245,0.0004656865,0.0011598035,0.0016424013,0.00085510226,0.000927233,0.0017724119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010268918,0.00021799015,0.0038705529,0.0005373433,0.0000464716,0.0014408234,0.0013123302,0.032170903,0.16725484,0.5756511,0.012944008,0.2035267],"study_design_scores_gemma":[0.00014743488,0.0005773234,0.00823289,0.00013557672,0.0001143392,0.0025112343,0.0010026747,0.09087632,0.10597093,0.69792986,0.09237412,0.00012730085],"about_ca_topic_score_codex":0.0024437075,"about_ca_topic_score_gemma":0.004917517,"teacher_disagreement_score":0.010492042,"about_ca_system_score_codex":0.0010237108,"about_ca_system_score_gemma":0.00051809475,"threshold_uncertainty_score":0.035099447},"labels":[],"label_agreement":null},{"id":"W2895552009","doi":"10.4230/lipics.icalp.2020.21","title":"Counting Homomorphisms in Plain Exponential Time","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Exponential function; Mathematics; Exponential growth; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.020173281068611455,"score_gpt":0.28427927199375524,"score_spread":0.2641059909251438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895552009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17998198,0.0014395242,0.75533736,0.0116170645,0.0005031077,0.00062655885,0.0036385823,0.01348759,0.033368282],"genre_scores_gemma":[0.52325237,0.00066818896,0.44444042,0.0020278692,0.0005249584,0.00069366314,0.006297714,0.0018870939,0.020207774],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937854,0.0015373304,0.00035833172,0.0021327606,0.0012879997,0.00089811796],"domain_scores_gemma":[0.9720824,0.018470313,0.001220714,0.0065181777,0.0010742984,0.0006341233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036439782,0.0019614645,0.0018364411,0.0013694911,0.0017882285,0.004917543,0.004120492,0.0023386602,0.018414484],"category_scores_gemma":[0.026919378,0.001070411,0.0022432278,0.0029003404,0.002565983,0.022461701,0.0050133276,0.004896218,0.0037799354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00271203,0.0012212308,0.008145581,0.0019763084,0.0004465209,0.0005168576,0.0013846159,0.07195996,0.022077523,0.33626214,0.07324185,0.48005527],"study_design_scores_gemma":[0.00037619728,0.00015260195,0.0011222311,0.00007224813,0.00016299139,0.0006830391,0.00045884785,0.22035153,0.011980184,0.7494271,0.015152133,0.000060849587],"about_ca_topic_score_codex":0.0018892364,"about_ca_topic_score_gemma":0.0035701545,"teacher_disagreement_score":0.018414484,"about_ca_system_score_codex":0.0025734163,"about_ca_system_score_gemma":0.0032770236,"threshold_uncertainty_score":0.061602652},"labels":[],"label_agreement":null},{"id":"W2896168333","doi":"10.1177/1094342018803672","title":"New BSP/CGM algorithms for spanning trees","year":2018,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Spanning tree; Parallel algorithm; Algorithm; Graph; Computation; Bulk synchronous parallel; Ranking (information retrieval); Theoretical computer science; Parallel computing; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.03186813572026007,"score_gpt":0.3448644533184474,"score_spread":0.3129963175981873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896168333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008800978,0.0005469406,0.9836669,0.00024436938,0.00012628507,0.0001609991,0.00017465773,0.0017143553,0.004564591],"genre_scores_gemma":[0.05230112,0.00023370226,0.9438682,0.00011711471,0.000073925126,0.00026263477,0.00044877382,0.00023490957,0.0024595996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992969,0.00012677902,0.000052245054,0.00016188971,0.00028958658,0.0000724821],"domain_scores_gemma":[0.99915326,0.00025330877,0.000094823714,0.00020237162,0.00023129028,0.00006491613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079253153,0.0010927332,0.0008504535,0.0017198346,0.0010035426,0.0010605872,0.0018463993,0.0011402967,0.004290758],"category_scores_gemma":[0.0038984115,0.0006267829,0.00091438676,0.0023191154,0.00058465294,0.0023367873,0.0017918864,0.0017644118,0.0014512546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025894097,0.0002622785,0.0010120898,0.0005050385,0.000089790046,0.00018599752,0.00023926552,0.2613067,0.012966303,0.1200013,0.023358837,0.5798134],"study_design_scores_gemma":[0.000073401854,0.000058856156,0.00020295761,0.000023019295,0.000023682987,0.00012231771,0.00003810018,0.9271622,0.0035095064,0.058641452,0.010126496,0.000018145984],"about_ca_topic_score_codex":0.0029167095,"about_ca_topic_score_gemma":0.0047066207,"teacher_disagreement_score":0.004290758,"about_ca_system_score_codex":0.0015229298,"about_ca_system_score_gemma":0.0017797642,"threshold_uncertainty_score":0.01435405},"labels":[],"label_agreement":null},{"id":"W2897168502","doi":"10.37236/8240","title":"Chromatic Polynomials of Oriented Graphs","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic polynomial; Combinatorics; Mathematics; Discrete mathematics; Chromatic scale; Foster graph; Graph; Friendship graph; Windmill graph; Line graph; Voltage graph","score_opus":0.012053478142036595,"score_gpt":0.2763215363540942,"score_spread":0.26426805821205757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897168502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8628836,0.00040748165,0.10024046,0.00033968303,0.000055701585,0.00005376889,0.0006995725,0.0002813537,0.035038292],"genre_scores_gemma":[0.9850647,0.00028221725,0.009633754,0.00004891775,0.00004727347,0.000032168417,0.00029082055,0.00009594872,0.004504063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963045,0.000039399492,0.0000086972,0.0001048509,0.0000959172,0.00012066631],"domain_scores_gemma":[0.998596,0.0006755436,0.00025514193,0.0001562325,0.00017656523,0.00014059969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027859112,0.0003681468,0.00023658766,0.0015316505,0.0005865157,0.0017896693,0.00050903665,0.00033031328,0.003950736],"category_scores_gemma":[0.0027287574,0.0001937526,0.0003292305,0.001311385,0.00163152,0.0014541266,0.0006607755,0.00076980155,0.00044291036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019114457,0.00005950854,0.0042207236,0.000093984796,0.000017176339,0.00008714549,0.00046552235,0.025892807,0.016885532,0.9178192,0.0022805464,0.03198677],"study_design_scores_gemma":[0.000036147998,0.00005966867,0.005785666,0.00003460825,0.000028278831,0.00020984611,0.00026978535,0.08344283,0.010052049,0.8910716,0.008958797,0.00005063478],"about_ca_topic_score_codex":0.0031354812,"about_ca_topic_score_gemma":0.0028333298,"teacher_disagreement_score":0.003950736,"about_ca_system_score_codex":0.0018182694,"about_ca_system_score_gemma":0.0005594954,"threshold_uncertainty_score":0.013216555},"labels":[],"label_agreement":null},{"id":"W2897482847","doi":"10.1016/j.dam.2018.08.021","title":"Broadcast domination and multipacking in strongly chordal graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Mathematics; Combinatorics; Interval graph; Graph; Tree (set theory); Treewidth; Discrete mathematics; Pathwidth; 1-planar graph; Line graph","score_opus":0.01801869487767191,"score_gpt":0.29331524957768434,"score_spread":0.27529655470001246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897482847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7818784,0.00079314504,0.18976125,0.0014269239,0.00014358576,0.00017258726,0.0004371435,0.00025839818,0.025128499],"genre_scores_gemma":[0.97057915,0.0005455832,0.01741423,0.00018060385,0.00012816189,0.00010349786,0.00036755187,0.00009101916,0.010590114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859494,0.00030898358,0.00008484699,0.00030316395,0.00031558203,0.00039247677],"domain_scores_gemma":[0.98435175,0.010309449,0.0017186931,0.0013092434,0.0009513292,0.001359484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011821662,0.00062916556,0.0012359828,0.0013701251,0.0027156284,0.0035379652,0.0023162146,0.0014614613,0.0048599676],"category_scores_gemma":[0.014910355,0.000886164,0.0007656552,0.0021251936,0.0026548656,0.005044182,0.00323758,0.002306378,0.000409014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009961871,0.00022137562,0.0055362303,0.00043208327,0.00009217129,0.0007240637,0.0028450864,0.0419362,0.010721384,0.896648,0.0040182536,0.035829004],"study_design_scores_gemma":[0.00016130945,0.00009343358,0.0013754182,0.000054872104,0.00008049401,0.0005228466,0.0010379676,0.119781114,0.0037382736,0.8693003,0.0038140314,0.00003992312],"about_ca_topic_score_codex":0.0031809243,"about_ca_topic_score_gemma":0.0034346664,"teacher_disagreement_score":0.0048599676,"about_ca_system_score_codex":0.0018300776,"about_ca_system_score_gemma":0.0013143796,"threshold_uncertainty_score":0.01625818},"labels":[],"label_agreement":null},{"id":"W2897704917","doi":"10.1137/1.9781611975482.37","title":"Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Laminar flow; Disjoint sets; Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Graph; Discrete mathematics; Planar; Computer science; Physics; Mechanics","score_opus":0.05912181164447611,"score_gpt":0.2845468274974068,"score_spread":0.22542501585293068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897704917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17776482,0.0011176245,0.79110503,0.0010419501,0.00006699539,0.00040226497,0.0022788253,0.0054282392,0.020794284],"genre_scores_gemma":[0.1571151,0.0006401241,0.8285094,0.00017712508,0.000035631427,0.00018736598,0.0050230906,0.0006639148,0.0076482436],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999471,0.00006992825,0.000052676147,0.00014397048,0.0001592722,0.00010316932],"domain_scores_gemma":[0.9983664,0.0010176083,0.00021409077,0.00017382068,0.00012033767,0.00010778063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043787673,0.0013151529,0.0010423393,0.0011707704,0.0010142477,0.002153417,0.0013981608,0.001014395,0.009648212],"category_scores_gemma":[0.0028474838,0.0010599823,0.0018205721,0.0018505977,0.0008402314,0.0041653127,0.0025449004,0.0013597606,0.0025686277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008400301,0.0004604647,0.0048507084,0.0025298283,0.0002730407,0.00077053707,0.001304826,0.110791646,0.052985676,0.071925156,0.025134847,0.72813326],"study_design_scores_gemma":[0.00028011433,0.00048808352,0.003496134,0.0003746832,0.00023227985,0.001781168,0.0019367982,0.4212173,0.06807656,0.45752367,0.044468485,0.00012472604],"about_ca_topic_score_codex":0.0012380641,"about_ca_topic_score_gemma":0.0031022942,"teacher_disagreement_score":0.009648212,"about_ca_system_score_codex":0.0009488111,"about_ca_system_score_gemma":0.0010481232,"threshold_uncertainty_score":0.03227645},"labels":[],"label_agreement":null},{"id":"W2897904393","doi":"10.1016/j.jctb.2022.01.009","title":"Colouring graphs with sparse neighbourhoods: Bounds and applications","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Neighbourhood (mathematics); Conjecture; Clique number; Chromatic scale; Vertex (graph theory); Brooks' theorem; Graph; Edge coloring; Discrete mathematics; Chordal graph; Graph power; 1-planar graph; Line graph","score_opus":0.009261596198324534,"score_gpt":0.24523861306012232,"score_spread":0.23597701686179778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897904393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27315944,0.009315908,0.6100021,0.0067252247,0.00053738133,0.00023929257,0.0014481372,0.0012956957,0.097276755],"genre_scores_gemma":[0.8009513,0.008878523,0.16534741,0.0009949098,0.0018414516,0.0004012654,0.0016113691,0.0008673889,0.019106433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746966,0.0007051366,0.00010693714,0.000675641,0.00070924463,0.0003333922],"domain_scores_gemma":[0.92731416,0.058790628,0.004074736,0.0039629405,0.0022682326,0.003589288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002753716,0.002439203,0.002823566,0.005014075,0.0023051624,0.00603291,0.0057375813,0.0040609553,0.012354717],"category_scores_gemma":[0.03934291,0.0025260998,0.0019917549,0.008595123,0.0073730214,0.01269989,0.0083162505,0.008526108,0.0018153777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051821576,0.00040912227,0.0036466757,0.0007255241,0.00010752523,0.00028914577,0.0010147556,0.09314457,0.004805205,0.8284593,0.013819357,0.05306054],"study_design_scores_gemma":[0.00005152334,0.0000603306,0.0007370696,0.00009581654,0.000077131044,0.00021772715,0.00016353562,0.1370357,0.001020044,0.85765487,0.0028425686,0.000043681237],"about_ca_topic_score_codex":0.0027960727,"about_ca_topic_score_gemma":0.0036171852,"teacher_disagreement_score":0.012354717,"about_ca_system_score_codex":0.002802427,"about_ca_system_score_gemma":0.000998312,"threshold_uncertainty_score":0.041330576},"labels":[],"label_agreement":null},{"id":"W2898198549","doi":"10.1007/978-3-319-97686-0_9","title":"Some of My Favourite Conjectures: Local Conditions Implying Global Cycle Properties","year":2018,"lang":"en","type":"book-chapter","venue":"Problem books in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Eulerian path; Conjecture; Mathematics; Hamiltonian path; Vertex (graph theory); Planar graph; Discrete mathematics; Graph; Pure mathematics","score_opus":0.03615258329350117,"score_gpt":0.29318633940565286,"score_spread":0.2570337561121517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898198549","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05612034,0.009053016,0.07324587,0.058131482,0.0044488036,0.00009644091,0.00085466984,0.0004716524,0.7975777],"genre_scores_gemma":[0.73257285,0.0081528695,0.024174768,0.009813921,0.0065526264,0.00034296128,0.0012917907,0.0007264536,0.21637185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995783,0.00011354314,0.000014699846,0.00015283373,0.00007459327,0.00006608162],"domain_scores_gemma":[0.9983473,0.00091826427,0.00010577501,0.0002490291,0.00021603056,0.000163667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087984727,0.00053509715,0.00062529783,0.00086682144,0.002343082,0.003435101,0.0012904414,0.0020141036,0.029501272],"category_scores_gemma":[0.0045133666,0.0003994105,0.00084370724,0.0015047158,0.004778591,0.01073498,0.0017904838,0.0046618246,0.004188856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021814494,0.000012052761,0.00012560774,0.00006911474,0.0000042343117,0.000028100718,0.00019016772,0.00037745808,0.00021339311,0.9723403,0.019231103,0.007386726],"study_design_scores_gemma":[0.000006924392,0.0000054652623,0.00008596954,0.000027144471,0.0000036816718,0.00002559245,0.00011853245,0.00039970042,0.0001887248,0.9841815,0.014952189,0.0000045853503],"about_ca_topic_score_codex":0.0012162373,"about_ca_topic_score_gemma":0.0011469962,"teacher_disagreement_score":0.029501272,"about_ca_system_score_codex":0.0015610943,"about_ca_system_score_gemma":0.000721677,"threshold_uncertainty_score":0.09869152},"labels":[],"label_agreement":null},{"id":"W2898301962","doi":"10.1016/j.dam.2018.08.027","title":"Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Constant (computer programming); Planar; Decomposition; Combinatorics; Approximation algorithm; Factor (programming language); Algorithm; Planar graph; Discrete mathematics; Graph; Computer science","score_opus":0.019614152468066852,"score_gpt":0.3005821580958938,"score_spread":0.2809680056278269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898301962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17181578,0.0022338566,0.7813057,0.0025103174,0.00034778213,0.0005354858,0.002533826,0.0100286845,0.028688593],"genre_scores_gemma":[0.42931435,0.0006751156,0.5498824,0.0005187794,0.00014133968,0.00038800124,0.005427449,0.00087990816,0.012772628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891865,0.00015804468,0.000047296933,0.0002973986,0.00025013371,0.00032843862],"domain_scores_gemma":[0.9982681,0.000713894,0.00012825863,0.00045170943,0.00024262736,0.00019533471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073087105,0.0021183447,0.002099657,0.0014634612,0.0011101834,0.0024323945,0.0030795187,0.0016015094,0.020682262],"category_scores_gemma":[0.0036123577,0.00063809496,0.001356206,0.0026855066,0.00074471807,0.0043557617,0.002367332,0.0024252338,0.0047144587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030302736,0.0013197783,0.0031184384,0.0012323074,0.00023461036,0.00031976396,0.0005578392,0.20758317,0.023696067,0.042141728,0.0682582,0.6485079],"study_design_scores_gemma":[0.0004958536,0.00021636391,0.000676304,0.000051665484,0.000120505414,0.00019247622,0.00027940058,0.9214605,0.0053640413,0.065195166,0.005920611,0.000027103417],"about_ca_topic_score_codex":0.0073539848,"about_ca_topic_score_gemma":0.012396983,"teacher_disagreement_score":0.020682262,"about_ca_system_score_codex":0.0022716129,"about_ca_system_score_gemma":0.0034596943,"threshold_uncertainty_score":0.06918913},"labels":[],"label_agreement":null},{"id":"W2898645613","doi":"10.1002/jgt.22668","title":"An optimal χ‐bound for (P6, diamond)‐free graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Perfect graph; Discrete mathematics; Chromatic scale; Graph; Clique number; Cograph; Vertex (graph theory); Line graph; Pathwidth","score_opus":0.021355985766179666,"score_gpt":0.31007581000829687,"score_spread":0.28871982424211723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898645613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43692437,0.0012454977,0.45370877,0.006851228,0.0004193001,0.00017169291,0.0016721154,0.001994437,0.09701254],"genre_scores_gemma":[0.8901623,0.0004018561,0.09792643,0.0010274597,0.00011801056,0.00009799154,0.0008449893,0.0003230606,0.009097973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857354,0.0002768511,0.000047268557,0.00037224212,0.00033128166,0.00039886712],"domain_scores_gemma":[0.9909779,0.0063361027,0.00029874092,0.0010073108,0.0005377419,0.0008422467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713598,0.0007776405,0.00082397874,0.0009127429,0.0017056534,0.0027053002,0.0022194933,0.0013337351,0.014076453],"category_scores_gemma":[0.009783197,0.0005196265,0.00057839573,0.0010453928,0.0018984012,0.0050689485,0.0025563342,0.0030295858,0.0013555572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013125004,0.00045350782,0.004172893,0.0006682826,0.00009021686,0.00042337942,0.00047059724,0.10033476,0.022310462,0.7529202,0.037230037,0.07961309],"study_design_scores_gemma":[0.00013883293,0.00025456116,0.0020944255,0.000114580274,0.0000737391,0.00043395083,0.0003276467,0.30785504,0.015040281,0.6540454,0.01954287,0.0000786622],"about_ca_topic_score_codex":0.00322042,"about_ca_topic_score_gemma":0.004431049,"teacher_disagreement_score":0.014076453,"about_ca_system_score_codex":0.0023096204,"about_ca_system_score_gemma":0.0026424783,"threshold_uncertainty_score":0.04709041},"labels":[],"label_agreement":null},{"id":"W2899312866","doi":"10.1002/jgt.22678","title":"The structure of graphs with no K3,3 immersion","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Robertson–Seymour theorem; 1-planar graph; Planar graph; Minor (academic); Indifference graph; Discrete mathematics; Pathwidth; Chordal graph; Graph; Line graph","score_opus":0.0075832166638496725,"score_gpt":0.25330627347158774,"score_spread":0.24572305680773807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899312866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91002905,0.0004131277,0.06254904,0.00089431746,0.000057289362,0.000052690233,0.00061215047,0.00029465652,0.025097672],"genre_scores_gemma":[0.9826251,0.00023954936,0.011073888,0.00018317314,0.00005234672,0.000036035988,0.0005081794,0.00009035597,0.005191333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996803,0.00004356268,0.000018455083,0.00010276823,0.00007122431,0.00008363544],"domain_scores_gemma":[0.99891245,0.00029678762,0.00022664186,0.00015152631,0.00018884767,0.00022374562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002670374,0.00038151426,0.0004827446,0.0015308674,0.0011530261,0.0019229943,0.00072416576,0.0007892291,0.0043264274],"category_scores_gemma":[0.001372557,0.0004562835,0.0006401315,0.00087014766,0.0023282997,0.0029015157,0.0016884377,0.0010699986,0.00061674224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022263786,0.000047192232,0.0026885823,0.00013561487,0.000029404187,0.00050895143,0.0014871322,0.006047196,0.013839689,0.96118045,0.0022048287,0.011608291],"study_design_scores_gemma":[0.000040005485,0.00005952551,0.0029260295,0.000040899857,0.00003376474,0.00044976675,0.0007403363,0.015191664,0.004718782,0.96612465,0.009637314,0.000037221565],"about_ca_topic_score_codex":0.0016528387,"about_ca_topic_score_gemma":0.0010133296,"teacher_disagreement_score":0.0043264274,"about_ca_system_score_codex":0.00087677705,"about_ca_system_score_gemma":0.0003528612,"threshold_uncertainty_score":0.014473379},"labels":[],"label_agreement":null},{"id":"W2899358912","doi":"10.1002/jgt.22677","title":"The structure of graphs with no W4 immersion","year":2021,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Immersion (mathematics); Structured program theorem; Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.01012567712544459,"score_gpt":0.2656434143866309,"score_spread":0.2555177372611863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899358912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82955354,0.0004630709,0.12739374,0.0012715391,0.00009696658,0.000068438516,0.000630236,0.00045172698,0.0400706],"genre_scores_gemma":[0.97982657,0.0001759657,0.01157417,0.00015507046,0.000054341643,0.000034624132,0.00044303297,0.00008893557,0.0076473528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993523,0.00010993943,0.000030026802,0.00020155938,0.0001499766,0.00015623664],"domain_scores_gemma":[0.9980579,0.000607728,0.00028097426,0.00031563832,0.00037645834,0.00036120255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005704625,0.00040452697,0.00059109647,0.0016925314,0.00133656,0.0024876192,0.00092680723,0.001134484,0.005316601],"category_scores_gemma":[0.0026714606,0.00047978907,0.0006070898,0.0009339547,0.003073651,0.004628991,0.0023926196,0.0014806462,0.0006720645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000896286,0.000026648002,0.0013444041,0.00005820792,0.000013673762,0.00025939223,0.00075012556,0.0029945232,0.0043241135,0.98368615,0.0009200587,0.0055331783],"study_design_scores_gemma":[0.000017846396,0.00003695571,0.0008199691,0.000030394533,0.000015680704,0.0001562208,0.0004151741,0.011083876,0.0026510847,0.9787982,0.005957602,0.000016938058],"about_ca_topic_score_codex":0.0015909667,"about_ca_topic_score_gemma":0.0009586644,"teacher_disagreement_score":0.005316601,"about_ca_system_score_codex":0.0011575829,"about_ca_system_score_gemma":0.00037790622,"threshold_uncertainty_score":0.017785847},"labels":[],"label_agreement":null},{"id":"W2899438014","doi":"","title":"Mixed k-rainbow domination numbers in graphs","year":2018,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Mathematics; Domination analysis; Combinatorics; Graph","score_opus":0.03345431103223346,"score_gpt":0.3086433519217288,"score_spread":0.27518904088949536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899438014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7806063,0.0008435002,0.13353601,0.0018882602,0.00018011144,0.00007813987,0.00057395385,0.0004432814,0.081850305],"genre_scores_gemma":[0.9599866,0.00033648068,0.02526357,0.00018865766,0.000103228,0.00012047452,0.00021980239,0.00011612237,0.0136650335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988236,0.0003178119,0.00007898865,0.00027755284,0.00029699365,0.0002051717],"domain_scores_gemma":[0.9950598,0.003034675,0.00049360597,0.00043741096,0.00042603127,0.000548376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015837868,0.00063419197,0.0006786127,0.0031304236,0.0024724372,0.0050114635,0.001641686,0.0012470816,0.009174429],"category_scores_gemma":[0.0066432143,0.0006829056,0.00068855786,0.0026550703,0.003421255,0.0062123896,0.0023352592,0.0019499664,0.0007505543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012195606,0.000018522034,0.0010883164,0.00008757039,0.00001818224,0.0000785674,0.00033857205,0.0020679825,0.0015902489,0.9859995,0.0011740413,0.0074164625],"study_design_scores_gemma":[0.000028658194,0.000014336198,0.0005566202,0.000026016258,0.000024883575,0.00013346487,0.00014252248,0.008463938,0.0009964067,0.98796195,0.001633064,0.00001821122],"about_ca_topic_score_codex":0.0007302169,"about_ca_topic_score_gemma":0.0014662831,"teacher_disagreement_score":0.009174429,"about_ca_system_score_codex":0.0016076028,"about_ca_system_score_gemma":0.00073622155,"threshold_uncertainty_score":0.030691564},"labels":[],"label_agreement":null},{"id":"W2899926070","doi":"10.1017/s0963548320000127","title":"Finding independent transversals efficiently","year":2020,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dominating set; Vertex (graph theory); Partition (number theory); Graph; Independent set; Efficient algorithm; Set (abstract data type)","score_opus":0.05420302350043195,"score_gpt":0.2914215236149398,"score_spread":0.23721850011450785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899926070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33985287,0.0007693568,0.6369054,0.0010788433,0.00015167444,0.00052895676,0.0014150616,0.00404743,0.015250337],"genre_scores_gemma":[0.47806236,0.00039943733,0.5065831,0.00028900534,0.000056601762,0.00023283779,0.0045352397,0.0005407008,0.00930077],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988642,0.0002124376,0.00008762049,0.000414052,0.00018875826,0.0002330431],"domain_scores_gemma":[0.9973732,0.0010051096,0.00022860903,0.00091100833,0.00028996228,0.00019208007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080439134,0.0010266638,0.0013065683,0.0012794537,0.00086688664,0.0016451315,0.0018217587,0.0012337116,0.006844588],"category_scores_gemma":[0.003940216,0.0008790332,0.0015359451,0.0016249005,0.0008137562,0.0031324155,0.002625104,0.0014439992,0.002033366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021055066,0.0011070138,0.014651036,0.0014782842,0.00050668936,0.0010780944,0.0015613415,0.14492303,0.14808522,0.10619818,0.029123375,0.5491823],"study_design_scores_gemma":[0.00034214367,0.0006350071,0.0029897254,0.00014636185,0.00030887593,0.0016113752,0.0013618994,0.67504716,0.051929366,0.24035649,0.025197094,0.000074422205],"about_ca_topic_score_codex":0.0012292232,"about_ca_topic_score_gemma":0.0031842024,"teacher_disagreement_score":0.006844588,"about_ca_system_score_codex":0.0008003657,"about_ca_system_score_gemma":0.0013090812,"threshold_uncertainty_score":0.022897422},"labels":[],"label_agreement":null},{"id":"W2899943641","doi":"","title":"Planar k-NodeTrix Graphs: A New Family of Beyond Planar Graphs","year":2017,"lang":"en","type":"article","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Planar; Combinatorics; Planar graph; 1-planar graph; Planar straight-line graph; Chordal graph; Outerplanar graph; Mathematics; Pathwidth; Computer science; Discrete mathematics; Graph; Line graph; Computer graphics (images)","score_opus":0.023472459383375346,"score_gpt":0.25993526909825093,"score_spread":0.2364628097148756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899943641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2170169,0.0029422734,0.5772824,0.003021308,0.00035778648,0.00032888024,0.0030826642,0.0022795962,0.1936881],"genre_scores_gemma":[0.68104684,0.005203927,0.2225168,0.0012828399,0.0003969369,0.0004364237,0.005972619,0.0013020298,0.08184155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993918,0.00010664248,0.000025266503,0.00021126111,0.00016868119,0.00009634153],"domain_scores_gemma":[0.9981389,0.0005888606,0.00030913125,0.00038932444,0.00031037605,0.00026347305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037917917,0.00079608714,0.00075511844,0.0018748795,0.0019062615,0.0029318877,0.0020716242,0.0013375749,0.01398233],"category_scores_gemma":[0.0024919393,0.00073025766,0.0008423457,0.003114887,0.0016240204,0.0049965326,0.0020708484,0.0022675714,0.0022015614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009080324,0.00004412358,0.0010112947,0.00024299418,0.000023850489,0.00043540396,0.00045813905,0.0068443185,0.0033393656,0.9261574,0.013246325,0.048105836],"study_design_scores_gemma":[0.000044004584,0.00007416675,0.0012451472,0.00008771042,0.00004930564,0.0018099466,0.0005423225,0.025270768,0.0024535153,0.88382506,0.08455285,0.00004517788],"about_ca_topic_score_codex":0.001243545,"about_ca_topic_score_gemma":0.0016605201,"teacher_disagreement_score":0.01398233,"about_ca_system_score_codex":0.0009412694,"about_ca_system_score_gemma":0.00058091746,"threshold_uncertainty_score":0.04677552},"labels":[],"label_agreement":null},{"id":"W2900191601","doi":"10.48550/arxiv.1811.04338","title":"Constructing Geometric Graphs of Cop Number Three","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Computer science","score_opus":0.08510392450003246,"score_gpt":0.23075890539610663,"score_spread":0.14565498089607418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900191601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48421374,0.00021240035,0.47076976,0.0011709068,0.000062793624,0.0002521167,0.00039665718,0.0005864559,0.04233521],"genre_scores_gemma":[0.7327394,0.0003166676,0.25591448,0.00032589503,0.000027569145,0.00024602056,0.001347316,0.00019220183,0.008890408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995098,0.000114375216,0.000020674295,0.00013641757,0.00012016567,0.00009847618],"domain_scores_gemma":[0.9982868,0.0005803786,0.0003328533,0.0003852421,0.00019418233,0.00022048275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034165508,0.0006456803,0.0005349342,0.0008912316,0.0011406738,0.00093755894,0.0011111029,0.00076483627,0.0049062343],"category_scores_gemma":[0.0024114891,0.0005108042,0.0008568076,0.00088439696,0.0021802192,0.0019212991,0.00265952,0.0017054018,0.00073511596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001178063,0.00012132653,0.002750649,0.00028086719,0.0000450807,0.00059217017,0.0012631583,0.04946769,0.016953215,0.87091553,0.0048180893,0.052674334],"study_design_scores_gemma":[0.00010548628,0.00019368729,0.003082911,0.000097232834,0.00009822637,0.0007160129,0.0015353252,0.083276026,0.014410225,0.85142374,0.044999648,0.000061557075],"about_ca_topic_score_codex":0.0015100972,"about_ca_topic_score_gemma":0.0020562704,"teacher_disagreement_score":0.0049062343,"about_ca_system_score_codex":0.0010630925,"about_ca_system_score_gemma":0.00062443846,"threshold_uncertainty_score":0.016412973},"labels":[],"label_agreement":null},{"id":"W2900469667","doi":"10.1007/978-3-030-04618-7_1","title":"Minimum Diameter k-Steiner Forest","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Steiner tree problem; Combinatorics; Approximation algorithm; Undirected graph; Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Minimum spanning tree; Discrete mathematics; Computer science; Telecommunications","score_opus":0.02307190990746621,"score_gpt":0.2786902830341342,"score_spread":0.25561837312666796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900469667","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23699072,0.010411098,0.33797,0.0051582283,0.0015104599,0.00032855885,0.011476693,0.0025523384,0.39360195],"genre_scores_gemma":[0.6001992,0.009148348,0.28688192,0.0006571714,0.00054517546,0.00021934888,0.009216452,0.0010489889,0.092083335],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982905,0.000015896598,0.000013191317,0.000062904175,0.000046240897,0.000032634063],"domain_scores_gemma":[0.99967086,0.00009391878,0.000040333223,0.00006513932,0.00007078404,0.00005903116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012665513,0.0005697365,0.00089199614,0.0005782347,0.0007896707,0.001344658,0.0011901038,0.0008447007,0.013176401],"category_scores_gemma":[0.00068543776,0.0005086314,0.00052583136,0.0014555376,0.00034379278,0.002760779,0.00086872274,0.0013590358,0.004257673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009977961,0.00021519605,0.0017755773,0.004604421,0.00016087218,0.0007214502,0.00043719623,0.03220412,0.067329824,0.36472005,0.13043256,0.39640093],"study_design_scores_gemma":[0.00020397444,0.00035167576,0.0062261457,0.000556011,0.0003230148,0.005997899,0.00056601886,0.07036777,0.024707904,0.64119303,0.24941865,0.00008783555],"about_ca_topic_score_codex":0.00039500804,"about_ca_topic_score_gemma":0.0008412837,"teacher_disagreement_score":0.013176401,"about_ca_system_score_codex":0.00063506566,"about_ca_system_score_gemma":0.00038580422,"threshold_uncertainty_score":0.044079483},"labels":[],"label_agreement":null},{"id":"W2900649734","doi":"10.1016/j.jda.2018.11.013","title":"Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction","year":2018,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Compaction; Vertex (graph theory); Mathematical proof; Bipartite graph; Vertex cover; Mathematics; Computational complexity theory; Combinatorics; Computer science; Time complexity; Discrete mathematics; Graph; Algorithm; Geometry; Geology","score_opus":0.07855679433831916,"score_gpt":0.36484302836865035,"score_spread":0.28628623403033115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900649734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34961453,0.0028478834,0.5980974,0.013830266,0.0006129155,0.0005167553,0.0024494359,0.0020484705,0.029982332],"genre_scores_gemma":[0.82137424,0.0011256029,0.16328038,0.0011827296,0.0008852493,0.00047937265,0.0019986068,0.0006578777,0.00901596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901828,0.003233784,0.0007403014,0.0018112304,0.0026640391,0.0013678607],"domain_scores_gemma":[0.8511694,0.117312044,0.006351527,0.017836528,0.0049009556,0.0024295691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006607648,0.0013448591,0.0026812484,0.0025730429,0.0022402797,0.007570059,0.0057916436,0.003422309,0.010599058],"category_scores_gemma":[0.077908136,0.0010571213,0.002658919,0.005370851,0.00489488,0.020271646,0.0044452786,0.0055557517,0.0012156513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026837294,0.0007156366,0.012312137,0.0009562755,0.00027543807,0.00048847223,0.001038973,0.19629857,0.009127177,0.5814951,0.02030985,0.17429869],"study_design_scores_gemma":[0.00017368389,0.00025315987,0.002079532,0.00006365182,0.00023739773,0.0005015306,0.00028214272,0.47034085,0.005049089,0.517779,0.0031634502,0.00007665759],"about_ca_topic_score_codex":0.002464207,"about_ca_topic_score_gemma":0.0038615053,"teacher_disagreement_score":0.010599058,"about_ca_system_score_codex":0.003975282,"about_ca_system_score_gemma":0.005420459,"threshold_uncertainty_score":0.035457373},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2902878758","doi":"10.1145/3292048.3292050","title":"Constraint satisfaction problems","year":2018,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Constraint satisfaction problem; Constraint (computer-aided design); Constraint satisfaction dual problem; Complexity of constraint satisfaction; Constraint satisfaction; Backtracking; Mathematics; Combinatorics; Computer science; Mathematical economics; Local consistency; Mathematical optimization; Statistics; Geometry","score_opus":0.03928523442880928,"score_gpt":0.31140997275033805,"score_spread":0.2721247383215288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902878758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016952468,0.022419274,0.69042474,0.06793854,0.0031777723,0.0008791361,0.006125381,0.0011653272,0.19091737],"genre_scores_gemma":[0.3234492,0.03142743,0.52019495,0.0193398,0.009790045,0.0016424513,0.01533782,0.000782188,0.07803612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98994154,0.0032387157,0.00076116255,0.002336089,0.0029259836,0.0007965831],"domain_scores_gemma":[0.97953016,0.016438164,0.0006257762,0.0013050581,0.001440223,0.0006606794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054416596,0.0015242297,0.0019157084,0.0024216222,0.004274341,0.007231637,0.0039989543,0.003776608,0.025583535],"category_scores_gemma":[0.024352588,0.000992809,0.0020985415,0.0076602944,0.006002398,0.013468567,0.0057163513,0.010096905,0.003913721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030300058,0.000052266798,0.0002205662,0.0003790425,0.000037743102,0.000117360316,0.00021741934,0.0024634232,0.0001573174,0.93987983,0.02303147,0.033413388],"study_design_scores_gemma":[0.000032161704,0.000012782701,0.00009204808,0.00011792232,0.000011871189,0.00017623471,0.00017227937,0.0068351612,0.00023718862,0.92357975,0.068715915,0.000016615817],"about_ca_topic_score_codex":0.0033449538,"about_ca_topic_score_gemma":0.0026487214,"teacher_disagreement_score":0.025583535,"about_ca_system_score_codex":0.004267896,"about_ca_system_score_gemma":0.003210166,"threshold_uncertainty_score":0.085585475},"labels":[],"label_agreement":null},{"id":"W2903198428","doi":"10.1002/jgt.22433","title":"On ‐connected graphs","year":2018,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"3v Geomatics (Canada)","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Connectivity; Discrete mathematics; Conjecture; Strongly connected component; 1-planar graph; Graph; Chordal graph","score_opus":0.01663824849721421,"score_gpt":0.29265974451295196,"score_spread":0.2760214960157378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903198428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5911511,0.0012253975,0.2830282,0.0023880084,0.00022494349,0.00023102896,0.0012688859,0.0004185808,0.12006387],"genre_scores_gemma":[0.89517826,0.00094053353,0.08579011,0.00053444935,0.00023366696,0.00023727471,0.0018611134,0.00014127613,0.015083272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933726,0.00018514608,0.000024861094,0.00019999297,0.00015808619,0.0000945953],"domain_scores_gemma":[0.99827015,0.0008600009,0.00020630575,0.00025901254,0.00016739716,0.00023703632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037338657,0.00055376976,0.0004260078,0.0010848638,0.0010132877,0.001001274,0.0007327725,0.00070326263,0.0072543835],"category_scores_gemma":[0.0019380223,0.00032214768,0.00055800745,0.0011753517,0.0015584915,0.002860398,0.0016245077,0.0011801663,0.0006054874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013423272,0.00004897288,0.0010944003,0.00017374751,0.000021184043,0.00023914195,0.00033579118,0.022999287,0.0050799567,0.9267242,0.0055489046,0.037600227],"study_design_scores_gemma":[0.00001888721,0.000033367567,0.0005942071,0.000051553794,0.000013574192,0.00022998605,0.00014385175,0.03454852,0.0015653255,0.9466276,0.016161576,0.000011513655],"about_ca_topic_score_codex":0.0007304167,"about_ca_topic_score_gemma":0.00082675024,"teacher_disagreement_score":0.0072543835,"about_ca_system_score_codex":0.00072524307,"about_ca_system_score_gemma":0.00037516077,"threshold_uncertainty_score":0.02426833},"labels":[],"label_agreement":null},{"id":"W2903896173","doi":"10.1137/18m1214196","title":"Corrigendum: Orthogonal Tree Decompositions of Graphs","year":2018,"lang":"en","type":"erratum","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Research Council; Fédération Wallonie-Bruxelles","keywords":"Mathematics; Combinatorics; Tree (set theory); Discrete mathematics","score_opus":0.03365558894771017,"score_gpt":0.31765133029219844,"score_spread":0.2839957413444883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903896173","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042523685,0.004531445,0.005383927,0.052527487,0.91416854,0.000062821666,0.0016046404,0.0010371325,0.020258732],"genre_scores_gemma":[0.03156897,0.024308173,0.018116983,0.09218615,0.44808772,0.0004505258,0.008224246,0.0047143446,0.37234288],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99361116,0.0010640931,0.0006644373,0.0011032001,0.00308011,0.00047695008],"domain_scores_gemma":[0.9751389,0.0047507607,0.0006525226,0.0023301386,0.016090766,0.0010369685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031882157,0.0021310435,0.002120636,0.0050469395,0.003015454,0.0039745606,0.0035164356,0.0030821064,0.08969412],"category_scores_gemma":[0.046201363,0.0010107793,0.00219319,0.0039050828,0.0021413236,0.0049850834,0.002493897,0.0059016678,0.043846525],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002148445,0.00001047425,0.000050903014,0.00011262276,0.000011630439,0.00008112099,0.000016338663,0.000102940045,0.000053469517,0.003210191,0.9862954,0.010033422],"study_design_scores_gemma":[0.00003300052,0.000042494426,0.0009578126,0.0003148867,0.000047979953,0.00041742416,0.000051218434,0.0008414017,0.000485347,0.013641105,0.9830973,0.00007007243],"about_ca_topic_score_codex":0.011528139,"about_ca_topic_score_gemma":0.013031973,"teacher_disagreement_score":0.08969412,"about_ca_system_score_codex":0.005423889,"about_ca_system_score_gemma":0.0029251599,"threshold_uncertainty_score":0.3000567},"labels":[],"label_agreement":null},{"id":"W2907584067","doi":"10.4230/lipics.isaac.2018.67","title":"Succinct Data Structures for Chordal Graphs","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Chordal graph; Computer science; Interval graph; Theoretical computer science; Graph; 1-planar graph","score_opus":0.04590123781032047,"score_gpt":0.34013356367956615,"score_spread":0.2942323258692457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907584067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10425997,0.0019488015,0.8716367,0.0025433907,0.00030971575,0.00043009844,0.0067672534,0.0074212286,0.00468277],"genre_scores_gemma":[0.5503799,0.0011352969,0.43290827,0.00084903126,0.00022436517,0.0006574321,0.008722457,0.0005276825,0.004595509],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972059,0.00048167506,0.00047293512,0.00050352496,0.0010505723,0.00028535965],"domain_scores_gemma":[0.9863418,0.004802834,0.0012534785,0.006023081,0.0012381676,0.00034068935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018881012,0.00093744585,0.0013871851,0.0013487515,0.0011719838,0.003026527,0.0037809988,0.001399311,0.0063995533],"category_scores_gemma":[0.013858069,0.000727559,0.00085220806,0.0038736756,0.0015802521,0.013086024,0.0034156118,0.0022236651,0.00137629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032287259,0.000622884,0.006442609,0.001963784,0.0001661939,0.00038498853,0.0012706652,0.17588241,0.030468712,0.3627348,0.04191531,0.37491888],"study_design_scores_gemma":[0.00035029376,0.000599869,0.0007697047,0.00023575501,0.00010728976,0.00051502936,0.00057907274,0.4291629,0.040376708,0.49561605,0.03155696,0.0001303844],"about_ca_topic_score_codex":0.0017346068,"about_ca_topic_score_gemma":0.0027637503,"teacher_disagreement_score":0.0063995533,"about_ca_system_score_codex":0.0025814665,"about_ca_system_score_gemma":0.0018375848,"threshold_uncertainty_score":0.021408617},"labels":[],"label_agreement":null},{"id":"W2908576804","doi":"10.1016/j.dam.2018.12.012","title":"On directed covering and domination problems","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Dominating set; Directed acyclic graph; Directed graph; Mathematics; Edge cover; Vertex cover; Vertex (graph theory); Feedback arc set; Time complexity; Maximal independent set; Feedback vertex set; Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.011021755888656545,"score_gpt":0.25314728609802806,"score_spread":0.2421255302093715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908576804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37139034,0.014557384,0.36190873,0.014583952,0.0010011155,0.0001917057,0.001346757,0.00027504528,0.23474489],"genre_scores_gemma":[0.86411595,0.011078513,0.054222804,0.0017054877,0.0026812237,0.00037751737,0.0017318382,0.00024395308,0.063842565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856806,0.0005865787,0.00005175465,0.00024875137,0.00034473513,0.00020007168],"domain_scores_gemma":[0.98956686,0.008614485,0.0005298583,0.0003853946,0.00037021175,0.0005331177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001652414,0.0012636182,0.0016621645,0.002732961,0.0020948988,0.003442806,0.0019835143,0.0029287615,0.00882583],"category_scores_gemma":[0.012318846,0.00084512663,0.001377892,0.0056195995,0.003250932,0.00821151,0.003296437,0.0039974465,0.0005980264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009338743,0.00007839853,0.0006905433,0.00018067287,0.00003368835,0.00017929831,0.0004002703,0.013787548,0.00040035736,0.9602697,0.006638298,0.017247802],"study_design_scores_gemma":[0.000019128016,0.000008953663,0.00022596218,0.000024941857,0.000012458773,0.00011728925,0.00008689223,0.020510618,0.00007549515,0.9753184,0.0035921962,0.0000076645965],"about_ca_topic_score_codex":0.0021338481,"about_ca_topic_score_gemma":0.0014762981,"teacher_disagreement_score":0.00882583,"about_ca_system_score_codex":0.0021453756,"about_ca_system_score_gemma":0.000835292,"threshold_uncertainty_score":0.0295254},"labels":[],"label_agreement":null},{"id":"W2908748734","doi":"10.48550/arxiv.1901.05594","title":"Queue Layouts of Graphs with Bounded Degree and Bounded Genus","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Bounded function; Genus; Degree (music); Queue; Combinatorics; Mathematics; Discrete mathematics; Computer science; Physics; Computer network; Zoology; Mathematical analysis; Biology","score_opus":0.08479349942993968,"score_gpt":0.20993539323869792,"score_spread":0.12514189380875823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908748734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6589117,0.0010181159,0.32154542,0.0015805782,0.0001559753,0.00010637746,0.0016191101,0.0013316809,0.013731083],"genre_scores_gemma":[0.92727107,0.00067456375,0.06346691,0.00032546528,0.00006893218,0.0000757441,0.0008239452,0.00030057674,0.0069927126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932337,0.00010864674,0.00003576726,0.00017523988,0.00013927893,0.00021780252],"domain_scores_gemma":[0.99585754,0.0016955192,0.0008308956,0.00060418714,0.00044705477,0.0005647509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006411044,0.00043690708,0.00050132547,0.0011594738,0.0013581442,0.002489011,0.0015834467,0.0007780119,0.0057801586],"category_scores_gemma":[0.005722393,0.0006092541,0.0004573979,0.0014050846,0.0011312029,0.0029513878,0.0015304134,0.0011700378,0.0005670397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001173273,0.00027233406,0.012270917,0.0005152277,0.000115100236,0.0005572501,0.00091783097,0.24009447,0.05013792,0.63025963,0.013261361,0.050424673],"study_design_scores_gemma":[0.00021113998,0.00028341316,0.0058808643,0.00008546208,0.000099490084,0.0004894949,0.0007013382,0.44243407,0.013650692,0.5235925,0.0124683315,0.00010325215],"about_ca_topic_score_codex":0.00441062,"about_ca_topic_score_gemma":0.007421077,"teacher_disagreement_score":0.0057801586,"about_ca_system_score_codex":0.0030261197,"about_ca_system_score_gemma":0.0014079275,"threshold_uncertainty_score":0.021956086},"labels":[],"label_agreement":null},{"id":"W2908903570","doi":"10.1007/s00236-021-00411-z","title":"On Huang and Wong’s algorithm for generalized binary split trees","year":2022,"lang":"en","type":"preprint","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Hong Kong University of Science and Technology; University of Waterloo; Research Grants Council, University Grants Committee; National Science Foundation","keywords":"Algorithm; Mathematics; Binary number; Dynamic programming; Property (philosophy); Time complexity; Optimal binary search tree; Binary tree; Computer science; Tree structure; Interval tree","score_opus":0.02943207565423358,"score_gpt":0.31377478604262427,"score_spread":0.2843427103883907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908903570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04101315,0.0003712907,0.9503887,0.00074320234,0.000115265364,0.00026068513,0.00015389123,0.0016611278,0.0052926484],"genre_scores_gemma":[0.16332667,0.00015782441,0.83043844,0.00024245746,0.0000532805,0.00026879067,0.00045504438,0.00040838082,0.0046490924],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986449,0.00033768287,0.000099061144,0.00028693423,0.00043130116,0.0002001531],"domain_scores_gemma":[0.9983639,0.000775673,0.00008399516,0.00036761304,0.0003404748,0.00006830582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013831536,0.0005766241,0.0008737235,0.0012249418,0.0007771679,0.0011945405,0.0018141235,0.001144915,0.005252604],"category_scores_gemma":[0.005602912,0.00046192607,0.00075432047,0.0021949501,0.0010281291,0.0028522727,0.0022866542,0.001716859,0.0012422345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073787867,0.00016136198,0.0012948945,0.00022361163,0.00007696641,0.00030232154,0.00058594183,0.10704378,0.014244047,0.22507657,0.014437625,0.635815],"study_design_scores_gemma":[0.00029507477,0.00015273775,0.0004306451,0.00004794163,0.0000469446,0.00020466617,0.00017285928,0.71160114,0.010274248,0.25873965,0.017986337,0.000047824593],"about_ca_topic_score_codex":0.0039226185,"about_ca_topic_score_gemma":0.004886625,"teacher_disagreement_score":0.005252604,"about_ca_system_score_codex":0.0011612423,"about_ca_system_score_gemma":0.0020404642,"threshold_uncertainty_score":0.017571688},"labels":[],"label_agreement":null},{"id":"W2911847656","doi":"10.1016/j.dam.2020.01.032","title":"Eternal domination on prisms of graphs","year":2020,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Université de Montréal; Dawson College; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Université de Montréal","keywords":"Combinatorics; Conjecture; Mathematics; Vertex (graph theory); Graph; Domination analysis; Guard (computer science); Dominating set; Clique; Discrete mathematics; Computer science","score_opus":0.03574876745790401,"score_gpt":0.30939730151531986,"score_spread":0.27364853405741585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911847656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65487313,0.0006695648,0.2651136,0.0013440205,0.00018922127,0.00008396299,0.0008530319,0.00040735988,0.076466024],"genre_scores_gemma":[0.92099756,0.0006006003,0.044445176,0.00034581087,0.00016815378,0.00010927845,0.00077467976,0.00016869155,0.032389976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984933,0.00037142893,0.00008824513,0.0003125081,0.00044415597,0.00029040588],"domain_scores_gemma":[0.9928116,0.004303769,0.00081123115,0.00062135037,0.0007013751,0.00075075065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011828176,0.0005834356,0.00076192425,0.0018212107,0.001492897,0.0029980668,0.0015156103,0.0009882743,0.008105694],"category_scores_gemma":[0.0061870995,0.0008231916,0.0009859232,0.0015432715,0.0025826145,0.0041163964,0.0028089988,0.0026212176,0.0005954269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017388891,0.000052844247,0.001336059,0.000100629295,0.000034141656,0.0002646328,0.00057672436,0.00828773,0.0035192529,0.9722569,0.0016938809,0.011703343],"study_design_scores_gemma":[0.00004350923,0.00003081914,0.00081349775,0.000023025788,0.000020759378,0.00025998653,0.00022957128,0.03542552,0.0015613168,0.9579343,0.0036413944,0.000016248137],"about_ca_topic_score_codex":0.0022960706,"about_ca_topic_score_gemma":0.002578297,"teacher_disagreement_score":0.008105694,"about_ca_system_score_codex":0.0010677237,"about_ca_system_score_gemma":0.0006342932,"threshold_uncertainty_score":0.02711624},"labels":[],"label_agreement":null},{"id":"W2911859454","doi":"10.1002/net.21975","title":"The firebreak problem","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Memorial University of Newfoundland","funders":"Biotechnology and Biological Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Vertex (graph theory); Time complexity; Focus (optics); Class (philosophy); Graph; Metric dimension","score_opus":0.018747197674953257,"score_gpt":0.256820096351612,"score_spread":0.23807289867665876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911859454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50162244,0.0029393255,0.40826422,0.01752081,0.0005980863,0.0009409116,0.0053629144,0.0010871254,0.06166409],"genre_scores_gemma":[0.8701725,0.0015762865,0.10133872,0.0015055037,0.00037991581,0.00038505625,0.0052757612,0.00035083867,0.01901552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976815,0.00071128935,0.0001120949,0.0007107299,0.00030227375,0.0004819498],"domain_scores_gemma":[0.9891924,0.007492366,0.00090856315,0.00089878205,0.0005284597,0.0009793985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002105615,0.0008044304,0.0015768694,0.0008256791,0.0032641445,0.0037822204,0.0031714055,0.0039018276,0.020897636],"category_scores_gemma":[0.013384408,0.000965737,0.0013058851,0.001443758,0.0027480442,0.011949568,0.0036731095,0.0051941876,0.001638438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002315258,0.000926169,0.0074218446,0.0012704099,0.00037140166,0.0014573823,0.0016140448,0.18762866,0.008048488,0.5684647,0.06516097,0.15532067],"study_design_scores_gemma":[0.00027721887,0.00017070083,0.0009889781,0.0001240386,0.000103531245,0.00070642756,0.0016135034,0.19516662,0.004599507,0.76869553,0.027511181,0.00004287915],"about_ca_topic_score_codex":0.0025580928,"about_ca_topic_score_gemma":0.0018858325,"teacher_disagreement_score":0.020897636,"about_ca_system_score_codex":0.001745486,"about_ca_system_score_gemma":0.0014120055,"threshold_uncertainty_score":0.06990951},"labels":[],"label_agreement":null},{"id":"W2913253550","doi":"10.1002/jgt.22452","title":"On the clique number of the square of a line graph and its relation to maximum degree of the line graph","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Line graph; Perfect graph; Discrete mathematics; Graph; Conjecture; Block graph; Clique number; Cubic graph; Split graph; Clique graph; Graph power; Voltage graph; Pathwidth","score_opus":0.025816731673697267,"score_gpt":0.2940536123934432,"score_spread":0.26823688071974594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913253550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8127904,0.0033389516,0.13312921,0.0073628984,0.00043850282,0.0000782209,0.0009667318,0.00024689388,0.041648094],"genre_scores_gemma":[0.9857115,0.00092150253,0.009963922,0.00030520352,0.0006694832,0.00007392451,0.00029155458,0.00007689198,0.001986107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987105,0.00046024387,0.000030322955,0.00041024276,0.0001822609,0.00020637944],"domain_scores_gemma":[0.9573355,0.03439975,0.003329254,0.0011576541,0.0014297083,0.002348162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017885689,0.0006015615,0.0012072572,0.0024827868,0.0015982349,0.002418124,0.0018049611,0.0012006686,0.006344297],"category_scores_gemma":[0.016891276,0.0005949433,0.0005619378,0.0022634498,0.004173109,0.0046188184,0.0018260524,0.0023276983,0.0005649377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092925737,0.00040229614,0.019520214,0.00045125466,0.00017491062,0.0007610911,0.0011115298,0.055357665,0.013243572,0.8710926,0.014873573,0.022082036],"study_design_scores_gemma":[0.00012857237,0.00013853444,0.008206563,0.000109110886,0.00008576717,0.00068958034,0.00038456876,0.2992004,0.0030176414,0.6823325,0.005598159,0.000108661865],"about_ca_topic_score_codex":0.0023263122,"about_ca_topic_score_gemma":0.0016526483,"teacher_disagreement_score":0.006344297,"about_ca_system_score_codex":0.0013550435,"about_ca_system_score_gemma":0.00052756513,"threshold_uncertainty_score":0.021223783},"labels":[],"label_agreement":null},{"id":"W2913349045","doi":"10.1002/net.21873","title":"The Firefighter problem: Saving sets of vertices on cubic graphs","year":2019,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Saskatchewan","funders":"","keywords":"Combinatorics; Vertex (graph theory); Degree (music); Graph; Mathematics; Context (archaeology); Computer science; Independent set; Set (abstract data type); Discrete mathematics; Physics; Geography","score_opus":0.012337062270861938,"score_gpt":0.2658854493953632,"score_spread":0.25354838712450123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913349045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.705385,0.00082973676,0.23849097,0.005556429,0.00023387681,0.00056301,0.005943382,0.0012727121,0.041724894],"genre_scores_gemma":[0.88143474,0.0005685119,0.09638957,0.00051472127,0.00007979761,0.00020154678,0.0033173421,0.00026787992,0.017225908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991322,0.00019051527,0.000035075107,0.00016894484,0.00016184789,0.0003114343],"domain_scores_gemma":[0.9969643,0.0019477678,0.00023232913,0.00037321835,0.00014962906,0.0003327733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008942322,0.0006927176,0.001089316,0.0005146791,0.001254196,0.001433513,0.0022792318,0.001399251,0.011132733],"category_scores_gemma":[0.004045775,0.0004187448,0.0010669393,0.0010755884,0.0011287191,0.0029637136,0.001990848,0.0021786077,0.00057587714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008481967,0.00044691542,0.0014528057,0.00048703686,0.00007519987,0.0003917566,0.00033736747,0.81454587,0.005388719,0.0952345,0.023789508,0.057002164],"study_design_scores_gemma":[0.00022718843,0.00015848591,0.0007278063,0.00005892199,0.000040352228,0.0002245275,0.00039013827,0.76882935,0.0048001194,0.21334502,0.011165625,0.000032483877],"about_ca_topic_score_codex":0.012936555,"about_ca_topic_score_gemma":0.0163629,"teacher_disagreement_score":0.012936555,"about_ca_system_score_codex":0.0018444029,"about_ca_system_score_gemma":0.0020219898,"threshold_uncertainty_score":0.03724277},"labels":[],"label_agreement":null},{"id":"W2913482449","doi":"10.1145/3568025","title":"Canonisation and Definability for Graphs of Bounded Rank Width","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bounded function; Mathematics; Rank (graph theory); Treewidth; Discrete mathematics; Combinatorics; Pathwidth; Graph; Mathematical analysis","score_opus":0.042091926921377934,"score_gpt":0.3101518114053621,"score_spread":0.26805988448398416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913482449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6174412,0.0003936802,0.34016368,0.0022745093,0.000115520284,0.00019817802,0.0011534311,0.003147484,0.035112314],"genre_scores_gemma":[0.93529755,0.00020357591,0.054382,0.00048466463,0.0000942189,0.00011385732,0.0019783664,0.00036523645,0.0070804222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711776,0.00050165027,0.00013721368,0.0010260794,0.0006132401,0.0006040921],"domain_scores_gemma":[0.98990214,0.006627817,0.00073424313,0.0017241368,0.00051235897,0.00049923407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016148722,0.00082206825,0.0008349753,0.0013653666,0.0012714862,0.0032919357,0.0019872086,0.0010072456,0.01003496],"category_scores_gemma":[0.01185345,0.00059898925,0.00228318,0.0013123369,0.0033635327,0.008073947,0.0031523637,0.0034230344,0.00068540155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052256905,0.00043085316,0.004679468,0.0004026866,0.000086109874,0.00032930117,0.0013040757,0.022665318,0.010297889,0.89784425,0.004669769,0.05676777],"study_design_scores_gemma":[0.000095624906,0.00013617935,0.0015208415,0.00004515153,0.00011025069,0.00021936718,0.0003549066,0.061992515,0.013033259,0.91696066,0.005470875,0.00006041107],"about_ca_topic_score_codex":0.003788721,"about_ca_topic_score_gemma":0.0041170046,"teacher_disagreement_score":0.01003496,"about_ca_system_score_codex":0.0027738751,"about_ca_system_score_gemma":0.0016165469,"threshold_uncertainty_score":0.03357023},"labels":[],"label_agreement":null},{"id":"W2913508203","doi":"10.1016/j.jctb.2016.04.002","title":"Disjoint dijoins","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Digraph; Disjoint sets; Combinatorics; Conjecture; Pairwise comparison; Partition (number theory); Mathematics; Directed graph; Discrete mathematics","score_opus":0.012839882021510558,"score_gpt":0.26601016317363857,"score_spread":0.25317028115212803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913508203","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2049429,0.00040670065,0.070244074,0.00097219227,0.0013550743,0.00025265384,0.0021209456,0.0007630585,0.7189424],"genre_scores_gemma":[0.56256145,0.0006074733,0.044260792,0.00080825674,0.0003024502,0.0002326877,0.004689009,0.0011116987,0.38542616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989103,0.00009933204,0.000064968146,0.00034320727,0.00029325826,0.00028890366],"domain_scores_gemma":[0.9983658,0.00031779867,0.00017259624,0.00031473758,0.00044916838,0.00037994262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036462277,0.0009568316,0.0008860585,0.0029021408,0.004080112,0.003575157,0.0015026947,0.001120934,0.0625987],"category_scores_gemma":[0.0026016652,0.0006158659,0.00090959924,0.0019092516,0.0017061423,0.0032446247,0.004190408,0.00319863,0.011411926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023647775,0.00015832485,0.001375789,0.00013703248,0.000043337757,0.000588953,0.00049600186,0.00052114885,0.005901424,0.93953466,0.014690943,0.036315862],"study_design_scores_gemma":[0.000056393063,0.00006224594,0.00202276,0.00007085237,0.0000769228,0.001302182,0.0011335476,0.0033289664,0.0064582955,0.8412854,0.14415368,0.00004871061],"about_ca_topic_score_codex":0.0013833467,"about_ca_topic_score_gemma":0.0027757052,"teacher_disagreement_score":0.0625987,"about_ca_system_score_codex":0.0009233113,"about_ca_system_score_gemma":0.0006397445,"threshold_uncertainty_score":0.20941353},"labels":[],"label_agreement":null},{"id":"W2913787130","doi":"10.4230/lipics.ipec.2019.24","title":"Beating Treewidth for Average-Case Subgraph Isomorphism","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Omega; Hypercube; Exponential time hypothesis; Mathematics; Upper and lower bounds; Isomorphism (crystallography); Graph; Discrete mathematics; Physics; Crystallography; Quantum mechanics; Crystal structure","score_opus":0.09811442029294663,"score_gpt":0.22551002333335302,"score_spread":0.12739560304040637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913787130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18433498,0.008992709,0.6927246,0.019379271,0.0009956334,0.0004668527,0.0073394603,0.010573777,0.07519277],"genre_scores_gemma":[0.7455929,0.004331031,0.21255243,0.0069648568,0.0019011835,0.000892056,0.00751633,0.0048163426,0.015432861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98872864,0.002112888,0.0003684547,0.0041705044,0.0022846072,0.0023349496],"domain_scores_gemma":[0.9535593,0.0312604,0.0019276289,0.009983303,0.0014564466,0.001812871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053578345,0.0030284899,0.0040282686,0.0021412412,0.0030211865,0.0067500933,0.008451503,0.0047044144,0.025001952],"category_scores_gemma":[0.047853053,0.0019529744,0.0044491505,0.0046539237,0.003991137,0.026418993,0.008800138,0.010522819,0.006604969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003237855,0.0014746205,0.009772405,0.002243862,0.0007199211,0.00066802837,0.001517081,0.19335864,0.018237164,0.50539416,0.07572659,0.18764968],"study_design_scores_gemma":[0.00022807422,0.00014963467,0.0010088985,0.00011458683,0.0001716956,0.00037511712,0.00016743765,0.25826815,0.0040975157,0.7246461,0.010717288,0.00005553913],"about_ca_topic_score_codex":0.0051885806,"about_ca_topic_score_gemma":0.008494351,"teacher_disagreement_score":0.025001952,"about_ca_system_score_codex":0.005004998,"about_ca_system_score_gemma":0.0042092414,"threshold_uncertainty_score":0.08363986},"labels":[],"label_agreement":null},{"id":"W2913919914","doi":"10.1007/3-540-36478-1_5","title":"Connected Matchings","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Bipartite graph; Combinatorics; Chordal graph; Matching (statistics); Conjecture; Strong perfect graph theorem; Computer science; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Mathematics; 1-planar graph; Artificial intelligence","score_opus":0.018426466080599356,"score_gpt":0.2718294186126292,"score_spread":0.2534029525320299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913919914","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05052982,0.002428118,0.15862682,0.0023588538,0.00088738976,0.0002166383,0.0015679568,0.0012332153,0.78215116],"genre_scores_gemma":[0.4440197,0.00409792,0.08170304,0.0011412904,0.0008260202,0.00041349643,0.0046549086,0.0011288995,0.4620147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939084,0.00009485965,0.000030335046,0.0001951814,0.00020284025,0.00008587052],"domain_scores_gemma":[0.99941397,0.0001852101,0.000056380886,0.00014554788,0.000117058116,0.00008186732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037718008,0.00082220533,0.0008887694,0.0024959287,0.0019919758,0.0028795267,0.0013431323,0.0012801576,0.050393607],"category_scores_gemma":[0.0022085349,0.000640967,0.00089784013,0.0036841088,0.0011275944,0.006088417,0.0029849852,0.0021839007,0.010048436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003414561,0.00002960441,0.00009853664,0.00008254349,0.000012839564,0.000053021806,0.00014865611,0.0005845086,0.00071703136,0.9429121,0.014956601,0.040370446],"study_design_scores_gemma":[0.000010889257,0.000011341593,0.00012118842,0.000029424109,0.000017139493,0.00012884162,0.00007885069,0.0019065606,0.00067623134,0.94528306,0.051729873,0.0000066046246],"about_ca_topic_score_codex":0.0005793615,"about_ca_topic_score_gemma":0.00070721866,"teacher_disagreement_score":0.050393607,"about_ca_system_score_codex":0.0011310687,"about_ca_system_score_gemma":0.00055009336,"threshold_uncertainty_score":0.16858345},"labels":[],"label_agreement":null},{"id":"W2914039150","doi":"10.1016/j.jcss.2011.09.006","title":"Enumerating homomorphisms","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Hungarian Scientific Research Fund; Fonds National de la Recherche Luxembourg","keywords":"Homomorphism; Decision problem; Constraint satisfaction problem; Mathematics; Enumeration; Characterization (materials science); Discrete mathematics; Constraint (computer-aided design); Graph; Time complexity; Computer science; Combinatorics; Algorithm","score_opus":0.055889408027295244,"score_gpt":0.27907293644530284,"score_spread":0.2231835284180076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914039150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24749364,0.0016352457,0.6353284,0.0042880983,0.0007373632,0.0002893085,0.0021563433,0.00428838,0.10378328],"genre_scores_gemma":[0.6499674,0.0009905815,0.28988945,0.0011398206,0.0004743221,0.0003077338,0.004235069,0.0012122905,0.051783368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731773,0.00077145075,0.00023255563,0.0006292078,0.0006670717,0.00038199636],"domain_scores_gemma":[0.98900616,0.0072087715,0.0003280563,0.0020503323,0.00092847616,0.00047813097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019054663,0.0011307654,0.0012803674,0.0035458987,0.0025164017,0.0041991062,0.0027009875,0.0018511896,0.017220087],"category_scores_gemma":[0.012065221,0.0010244249,0.0019991884,0.003750591,0.00219937,0.011302164,0.005503535,0.0055276155,0.0033560153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023344035,0.00028770874,0.0021421374,0.00035325772,0.00007132379,0.00013974113,0.00089488074,0.0045574107,0.0040443824,0.82580036,0.011728075,0.14974724],"study_design_scores_gemma":[0.000019256446,0.00002848514,0.0002743283,0.000038129107,0.00004775789,0.00017899316,0.00012839683,0.011927889,0.0025831566,0.97889733,0.005857977,0.000018358793],"about_ca_topic_score_codex":0.00093931274,"about_ca_topic_score_gemma":0.0016220261,"teacher_disagreement_score":0.017220087,"about_ca_system_score_codex":0.0019564182,"about_ca_system_score_gemma":0.001272624,"threshold_uncertainty_score":0.057606936},"labels":[],"label_agreement":null},{"id":"W2914225674","doi":"10.1007/978-3-662-59204-5_12","title":"Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization","year":2019,"lang":"en","type":"book-chapter","venue":"Bolyai Society mathematical studies","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Matroid; Time complexity; Combinatorics; Discrete mathematics","score_opus":0.05040942084495267,"score_gpt":0.3060948645624244,"score_spread":0.25568544371747176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914225674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06677053,0.0033919981,0.7367679,0.0043022605,0.00046911082,0.000118795666,0.00045934168,0.00065581145,0.18706425],"genre_scores_gemma":[0.6992119,0.0038202053,0.18846384,0.0010175969,0.0007458622,0.00047838944,0.00090508413,0.0009327341,0.10442441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902594,0.0004247461,0.000025719524,0.00021150625,0.00018586847,0.00012622077],"domain_scores_gemma":[0.9986046,0.00079954776,0.00010232248,0.00032274533,0.00008576942,0.00008500714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081696885,0.00076168176,0.0010476495,0.0007556605,0.0013877169,0.0022290153,0.0013864766,0.0011720285,0.013018923],"category_scores_gemma":[0.0043908586,0.00053367985,0.0008050557,0.0016999203,0.0031530214,0.0041921516,0.0025175859,0.0040267557,0.0021141688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041154384,0.000029078705,0.00009370013,0.000061106366,0.000009856472,0.000021420485,0.00008326744,0.017483272,0.0006100444,0.9479309,0.0065806992,0.027055498],"study_design_scores_gemma":[0.000009768603,0.000012642767,0.00006974215,0.00001337889,0.0000045485403,0.000031491305,0.000035916488,0.026476927,0.00032282542,0.9676243,0.005390809,0.000007673645],"about_ca_topic_score_codex":0.0010675315,"about_ca_topic_score_gemma":0.0015588744,"teacher_disagreement_score":0.013018923,"about_ca_system_score_codex":0.0014216643,"about_ca_system_score_gemma":0.0009245675,"threshold_uncertainty_score":0.043552697},"labels":[],"label_agreement":null},{"id":"W2914264140","doi":"","title":"Tree decompositions and linear time algorithms","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Tree decomposition; K-ary tree; Mathematics; Combinatorics; Tree (set theory); Tree-depth; Algorithm; Treewidth; Disjoint sets; Modular decomposition; Time complexity; Discrete mathematics; Pathwidth; Computer science; Graph; Chordal graph; Tree structure; 1-planar graph; Line graph; Binary tree","score_opus":0.020676154589276702,"score_gpt":0.3101919391587306,"score_spread":0.2895157845694539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914264140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03183201,0.003392692,0.9308553,0.0029219345,0.00032556753,0.00023578739,0.0007341236,0.0047528306,0.024949742],"genre_scores_gemma":[0.22698571,0.0028007985,0.7493447,0.0014389665,0.00046106972,0.0005939786,0.0035244953,0.0013473526,0.013503004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959915,0.0009110417,0.00029096598,0.0011656857,0.0008838573,0.0007568891],"domain_scores_gemma":[0.99162453,0.0054932726,0.00053342135,0.0013706966,0.0007043082,0.00027389132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019648026,0.0016555366,0.0014964659,0.0014008691,0.0014209293,0.0039227265,0.0023644047,0.0015911714,0.011185581],"category_scores_gemma":[0.012025919,0.0010951165,0.0018654331,0.0037357432,0.002265752,0.010381649,0.0028232357,0.0038903465,0.0036489344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007403898,0.00048624742,0.001149042,0.0012360347,0.00015658798,0.00016809549,0.0006919443,0.1027808,0.007400054,0.5857039,0.036399264,0.26308763],"study_design_scores_gemma":[0.0001872382,0.00009586622,0.0001973304,0.00009883061,0.00006493695,0.0001451305,0.00012562596,0.1668025,0.0035232236,0.8099012,0.01882617,0.00003200074],"about_ca_topic_score_codex":0.0032551992,"about_ca_topic_score_gemma":0.0031775301,"teacher_disagreement_score":0.011185581,"about_ca_system_score_codex":0.0034772458,"about_ca_system_score_gemma":0.0022201196,"threshold_uncertainty_score":0.037419498},"labels":[],"label_agreement":null},{"id":"W2914325802","doi":"10.2298/aadm190206002i","title":"Connected domination game: Predomination, Staller-start game, and lexicographic products","year":2022,"lang":"en","type":"preprint","venue":"Applicable Analysis and Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Lexicographical order; Vertex (graph theory); Mathematics; Combinatorics; Mathematical economics; Relation (database); Set (abstract data type); Product (mathematics); Discrete mathematics; Computer science; Graph","score_opus":0.01770118539843372,"score_gpt":0.2830918267864466,"score_spread":0.2653906413880129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914325802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5559451,0.0012842083,0.38793337,0.0012685987,0.00010546522,0.00025216135,0.00035341468,0.00020696709,0.05265079],"genre_scores_gemma":[0.9528059,0.00053755974,0.038884427,0.00022154853,0.00007130266,0.00018589213,0.00018597991,0.00007195475,0.007035428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838054,0.0007712704,0.000063277505,0.00030273662,0.00023993541,0.00024214172],"domain_scores_gemma":[0.9889431,0.007701642,0.0009915512,0.0005431113,0.00045472156,0.0013658681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00163229,0.00093598,0.0010143119,0.0014241887,0.0011995061,0.0028820143,0.0016554001,0.001199634,0.006275915],"category_scores_gemma":[0.012786955,0.00040889083,0.00072909356,0.0013394494,0.0037713912,0.005877139,0.0020660954,0.0017794033,0.00038319515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038926344,0.0001453972,0.0028733434,0.00015889476,0.000058494996,0.00029678852,0.00055188057,0.025032725,0.004944087,0.9505186,0.0017721573,0.013258435],"study_design_scores_gemma":[0.00009651426,0.00014627913,0.0012851306,0.000043910237,0.00005563011,0.00037709318,0.00031009802,0.13892226,0.0021875554,0.8529581,0.0035665713,0.0000508479],"about_ca_topic_score_codex":0.0018040705,"about_ca_topic_score_gemma":0.0017966141,"teacher_disagreement_score":0.006275915,"about_ca_system_score_codex":0.0015605667,"about_ca_system_score_gemma":0.0009447442,"threshold_uncertainty_score":0.02099508},"labels":[],"label_agreement":null},{"id":"W2914843939","doi":"10.1007/978-3-642-02927-1_64","title":"Elimination Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Chordal graph; Combinatorics; Indifference graph; Split graph; Pathwidth; Discrete mathematics; Mathematics; Block graph; Clique-sum; 1-planar graph; Graph; Line graph","score_opus":0.019465804196152136,"score_gpt":0.28247516914168813,"score_spread":0.263009364945536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914843939","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016713232,0.00096775306,0.08855402,0.0013202002,0.00055786263,0.000108018634,0.0012444524,0.0007956546,0.8897388],"genre_scores_gemma":[0.21985532,0.002234355,0.042885844,0.0010305446,0.0003673129,0.00019965219,0.0051245154,0.0010043154,0.7272981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997429,0.000041050218,0.0000088559655,0.000060986993,0.00009675572,0.000049472685],"domain_scores_gemma":[0.9996995,0.00007638857,0.000018881568,0.00006790681,0.00010666871,0.000030793475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001810488,0.00058806234,0.0004177542,0.0012399335,0.0014523027,0.0018899894,0.0007938845,0.00050376443,0.06085548],"category_scores_gemma":[0.00068428967,0.00039165313,0.0005127823,0.0012809987,0.00069405645,0.002128339,0.0009198135,0.0018410358,0.018631991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023341654,0.000032745113,0.00011425789,0.000077300065,0.000008497264,0.00006196427,0.00012941772,0.0004824735,0.0014942655,0.891452,0.051811855,0.054311853],"study_design_scores_gemma":[0.000012459009,0.000014720424,0.00030472295,0.000036188223,0.000017945833,0.00029264507,0.00011662,0.0013543325,0.0024553023,0.7487979,0.24658634,0.000010959778],"about_ca_topic_score_codex":0.0006993675,"about_ca_topic_score_gemma":0.0011136316,"teacher_disagreement_score":0.06085548,"about_ca_system_score_codex":0.0006553608,"about_ca_system_score_gemma":0.0005135175,"threshold_uncertainty_score":0.20358187},"labels":[],"label_agreement":null},{"id":"W2914939413","doi":"10.4230/lipics.icalp.2019.91","title":"Toward a Dichotomy for Approximation of $H$-coloring","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Digraph; Combinatorics; Homomorphism; Mathematics; Approximation algorithm; Discrete mathematics; Time complexity; Arc (geometry); Graph","score_opus":0.04762587225070952,"score_gpt":0.31523348949259755,"score_spread":0.26760761724188803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914939413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22711001,0.0027121857,0.73648685,0.008629536,0.00025211214,0.00024287251,0.0015779891,0.005366652,0.01762188],"genre_scores_gemma":[0.6461525,0.00090853224,0.34011698,0.0022706843,0.00027663822,0.0003274792,0.002544261,0.0007793955,0.0066235983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966929,0.0007852742,0.00016276109,0.0010281982,0.0007545588,0.0005762625],"domain_scores_gemma":[0.9900142,0.006313934,0.00066867867,0.0021017676,0.00043919813,0.00046230745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034152807,0.0015789474,0.0018638072,0.0014281492,0.0010784453,0.004088196,0.003724358,0.0023979954,0.0059301644],"category_scores_gemma":[0.016638476,0.001068235,0.0018200566,0.0020719583,0.002121532,0.008456288,0.004307469,0.006622008,0.0013262565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043559936,0.0013810608,0.013671421,0.0010533489,0.00023393014,0.0002867352,0.0014590117,0.43337575,0.012421144,0.2405313,0.040378023,0.25085226],"study_design_scores_gemma":[0.00011239064,0.00012870532,0.00061708246,0.000070659466,0.00003630432,0.00010514605,0.00016160529,0.8590828,0.0022534835,0.13387467,0.003536761,0.000020362275],"about_ca_topic_score_codex":0.006086325,"about_ca_topic_score_gemma":0.006654669,"teacher_disagreement_score":0.0061671995,"about_ca_system_score_codex":0.0061671995,"about_ca_system_score_gemma":0.0034065149,"threshold_uncertainty_score":0.0447464},"labels":[],"label_agreement":null},{"id":"W2915110324","doi":"10.5539/jmr.v11n2p20","title":"Strong Geodetic Number in Some Networks","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Geodetic datum; Mathematics; Geodesic; Combinatorics; Vertex (graph theory); Upper and lower bounds; Graph; Cardinality (data modeling); Discrete mathematics; Geometry; Computer science; Geodesy; Mathematical analysis; Geography","score_opus":0.06925974995608906,"score_gpt":0.40523395817142205,"score_spread":0.33597420821533297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915110324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78334177,0.001203274,0.18415578,0.0009687615,0.0001042938,0.000082161554,0.0012055748,0.00029756434,0.02864083],"genre_scores_gemma":[0.9566625,0.0007792759,0.03816321,0.00011042516,0.0000911493,0.000105621046,0.00048966415,0.00003408808,0.003564126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907255,0.00021365212,0.00006574723,0.0003062568,0.00019403259,0.00014770431],"domain_scores_gemma":[0.9957023,0.0022055516,0.0006783962,0.00052400806,0.00038043642,0.00050938054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009533605,0.0005325264,0.0006100321,0.0017497138,0.0014521948,0.001528248,0.0006986527,0.00069100794,0.0031661207],"category_scores_gemma":[0.0046039354,0.00047352875,0.00045101068,0.0015210949,0.0017822278,0.00336942,0.0016082681,0.00090994284,0.00032576738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032165967,0.000046749967,0.009377477,0.00028898023,0.00007548808,0.0004717497,0.00063144765,0.052620854,0.013111603,0.89364964,0.003288865,0.026115388],"study_design_scores_gemma":[0.00006029644,0.0002261027,0.0076033045,0.0000935032,0.00011104712,0.0019060951,0.00044260657,0.17455438,0.010765853,0.7805039,0.0236545,0.00007846825],"about_ca_topic_score_codex":0.0006804425,"about_ca_topic_score_gemma":0.0009484039,"teacher_disagreement_score":0.0031661207,"about_ca_system_score_codex":0.00096076325,"about_ca_system_score_gemma":0.0005103798,"threshold_uncertainty_score":0.010591686},"labels":[],"label_agreement":null},{"id":"W2916219982","doi":"10.1007/s10732-020-09453-x","title":"A tabu search for the design of capacitated rooted survivable planar networks","year":2020,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Tabu search; Combinatorics; Mathematics; Planar graph; Mathematical optimization; Shortest path problem; Graph; Path (computing); Integer programming; Computer science","score_opus":0.08577908369528642,"score_gpt":0.30450855670640997,"score_spread":0.21872947301112355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916219982","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14223814,0.0015724415,0.8225098,0.0010675611,0.00015980296,0.0006399548,0.001195142,0.002442904,0.028174242],"genre_scores_gemma":[0.49253356,0.0005295915,0.49798784,0.0003885746,0.000056822428,0.0006068358,0.0010839985,0.00037483033,0.0064379782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992291,0.0004117225,0.000024244357,0.00010140037,0.000089785215,0.00014368162],"domain_scores_gemma":[0.9961486,0.0031102975,0.00019436608,0.0001223273,0.0002972804,0.00012716047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014675432,0.0015176653,0.0014883853,0.0027109243,0.0008971428,0.0015403801,0.002092417,0.0021749486,0.013021538],"category_scores_gemma":[0.0074415226,0.001273776,0.0009495092,0.002233594,0.0011710107,0.0016553419,0.0012160469,0.0012885929,0.001132055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019222366,0.00012474103,0.0005881701,0.00016753658,0.00003536581,0.000051289928,0.00008142181,0.9279671,0.00052586995,0.0079667615,0.0036089695,0.05869057],"study_design_scores_gemma":[0.00005125557,0.00007597358,0.0000722521,0.000025521458,0.000011654282,0.000011109092,0.00005589634,0.99203414,0.00019511992,0.0068705967,0.0005901371,0.000006284999],"about_ca_topic_score_codex":0.008114025,"about_ca_topic_score_gemma":0.009057824,"teacher_disagreement_score":0.013021538,"about_ca_system_score_codex":0.0017237837,"about_ca_system_score_gemma":0.0023817634,"threshold_uncertainty_score":0.04356134},"labels":[],"label_agreement":null},{"id":"W2916766399","doi":"10.1016/j.tcs.2013.05.025","title":"The 2-surviving rate of planar graphs without 6-cycles","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Planar graph; Planar; Mathematics; Graph; Computer science; Discrete mathematics; Computer graphics (images)","score_opus":0.01347688049830958,"score_gpt":0.27745239259162785,"score_spread":0.26397551209331827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916766399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9151591,0.001419629,0.039272178,0.0018136668,0.000129625,0.00007455183,0.0017320899,0.00055473245,0.039844386],"genre_scores_gemma":[0.98079795,0.0013940712,0.0068513863,0.00020172817,0.00018346864,0.00014736835,0.0012731551,0.00029302025,0.008857893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998845,0.00032485178,0.000052174135,0.00020649601,0.00023362898,0.0003378694],"domain_scores_gemma":[0.9865118,0.008249137,0.0014910755,0.0013011657,0.00093132653,0.0015155022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020272494,0.000996152,0.0011540882,0.003382886,0.0018714773,0.0032259815,0.0026388504,0.0019004894,0.0089561185],"category_scores_gemma":[0.017680801,0.00069963787,0.0009639982,0.001987236,0.0021368617,0.0051493365,0.001906855,0.0021037553,0.0013171554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009787945,0.0001817709,0.0089771105,0.0005047107,0.0001146887,0.00053078047,0.0014683347,0.07265884,0.012657317,0.8413435,0.0165403,0.04404392],"study_design_scores_gemma":[0.00011348475,0.00015227529,0.0043556597,0.00012605803,0.0001238965,0.0009172225,0.0007398907,0.13471656,0.006930353,0.84444654,0.007282396,0.0000955292],"about_ca_topic_score_codex":0.001656231,"about_ca_topic_score_gemma":0.001084417,"teacher_disagreement_score":0.0089561185,"about_ca_system_score_codex":0.001206207,"about_ca_system_score_gemma":0.0008872244,"threshold_uncertainty_score":0.029961169},"labels":[],"label_agreement":null},{"id":"W2918538746","doi":"","title":"The Domination Cover Pebbling Number For Some Cyclic Graphs And Path Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Path (computing); Indifference graph; Cover (algebra); Pathwidth; Chordal graph; Discrete mathematics; Graph; Computer science; Line graph; Computer network","score_opus":0.014403940922441131,"score_gpt":0.2921953203004329,"score_spread":0.27779137937799175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918538746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79910564,0.0016215309,0.05888929,0.0028469027,0.0001941244,0.00007800792,0.0017429449,0.00041656155,0.13510495],"genre_scores_gemma":[0.97667515,0.0006747282,0.011742834,0.00016839162,0.00012969083,0.00009588792,0.0005849974,0.00007447659,0.00985382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999468,0.00010130658,0.000024584935,0.00012050952,0.00014893405,0.00013667882],"domain_scores_gemma":[0.9954516,0.0031695494,0.00042295794,0.00028002064,0.00024887366,0.00042702857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006093697,0.00042848103,0.00048233426,0.0021909717,0.0015444608,0.002229273,0.0010339618,0.00108457,0.011651105],"category_scores_gemma":[0.0061655343,0.00030773075,0.0003542134,0.0018377806,0.0014451866,0.0037090145,0.0010056042,0.0014221978,0.00089878496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004669755,0.00010109591,0.0043798,0.00025673833,0.000046319346,0.00034456298,0.0005725938,0.014772242,0.0077419695,0.9069616,0.015306275,0.04904975],"study_design_scores_gemma":[0.000050628056,0.00006196492,0.0034219662,0.000059155034,0.000052083844,0.0008065065,0.00025969552,0.053023454,0.0044184546,0.92611265,0.011695197,0.000038277118],"about_ca_topic_score_codex":0.0011823633,"about_ca_topic_score_gemma":0.0014724847,"teacher_disagreement_score":0.011651105,"about_ca_system_score_codex":0.0014975978,"about_ca_system_score_gemma":0.0007064561,"threshold_uncertainty_score":0.03897679},"labels":[],"label_agreement":null},{"id":"W2918809886","doi":"","title":"On r-(k)-pancyclic Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.016269665712103143,"score_gpt":0.2883168699452045,"score_spread":0.27204720423310136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918809886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41126207,0.0032164964,0.17260996,0.0048177717,0.0008275568,0.0002564896,0.003278507,0.0011820592,0.40254906],"genre_scores_gemma":[0.90600616,0.0030582985,0.028057138,0.0011864825,0.00045988362,0.0001444168,0.0017513733,0.00029565842,0.059040483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989496,0.00024261035,0.00005222759,0.0002411003,0.00022941755,0.00028497368],"domain_scores_gemma":[0.9967007,0.0014678448,0.00066582224,0.00047750233,0.0002962214,0.00039182566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043918708,0.0007764165,0.0006883289,0.0017260514,0.0014262995,0.002094177,0.001221201,0.0011343111,0.017746544],"category_scores_gemma":[0.0034850966,0.00053603004,0.00068040943,0.0025774792,0.0017443375,0.004448251,0.0030103705,0.0016693996,0.004618492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021859321,0.00007807893,0.00096056814,0.00040496635,0.000045626413,0.00062149076,0.00060117437,0.006793627,0.005981466,0.9229017,0.022834647,0.03855801],"study_design_scores_gemma":[0.00004440819,0.000048706526,0.0008381796,0.000088184344,0.00003703115,0.00081622787,0.0002007326,0.012372569,0.0018801944,0.9681206,0.015521698,0.000031594114],"about_ca_topic_score_codex":0.0016499354,"about_ca_topic_score_gemma":0.002488952,"teacher_disagreement_score":0.017746544,"about_ca_system_score_codex":0.0011147154,"about_ca_system_score_gemma":0.00046986248,"threshold_uncertainty_score":0.059368074},"labels":[],"label_agreement":null},{"id":"W2918914696","doi":"","title":"On wy-Perfect Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.015544611197801513,"score_gpt":0.2865267648438405,"score_spread":0.27098215364603895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918914696","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24925344,0.0035813923,0.33579293,0.0058458517,0.0010147751,0.00019373512,0.002307054,0.0012385249,0.40077233],"genre_scores_gemma":[0.8517092,0.0029506718,0.051683206,0.0017659868,0.00054689567,0.00017641275,0.0020957997,0.00046378284,0.08860819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999038,0.00024611028,0.000055203684,0.00019620797,0.00021612024,0.0002483345],"domain_scores_gemma":[0.997879,0.0008379091,0.00032295773,0.00040440078,0.00023693236,0.00031876226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007779908,0.0007682842,0.0007354691,0.0024084866,0.002180299,0.002706098,0.0009209658,0.0010195072,0.015881376],"category_scores_gemma":[0.0035913084,0.0005316262,0.00080393616,0.0023071493,0.0024474289,0.008448359,0.003292984,0.002161463,0.0027210333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024564319,0.000012813935,0.00030857156,0.00006126587,0.000009600353,0.00008734367,0.00015073466,0.0007344252,0.0004742767,0.9866623,0.004116018,0.007358081],"study_design_scores_gemma":[0.00000775131,0.000007648944,0.00024345727,0.000031167547,0.000010241237,0.00014078486,0.00011914654,0.0021947294,0.00036954592,0.9883836,0.008484016,0.000007894682],"about_ca_topic_score_codex":0.0019331494,"about_ca_topic_score_gemma":0.0033631586,"teacher_disagreement_score":0.015881376,"about_ca_system_score_codex":0.0013570233,"about_ca_system_score_gemma":0.00064951245,"threshold_uncertainty_score":0.05312854},"labels":[],"label_agreement":null},{"id":"W2919107023","doi":"","title":"Number of Spanning trees in Different Products of Complete and Complete Tripartite Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Discrete mathematics","score_opus":0.035141965112555865,"score_gpt":0.2987868566843932,"score_spread":0.26364489157183735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919107023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9279998,0.001007911,0.038571626,0.00083263806,0.0000959914,0.000043396023,0.003437783,0.00026404098,0.027746703],"genre_scores_gemma":[0.9798187,0.0003490455,0.0131052835,0.00008294219,0.00006141215,0.00005621797,0.001943131,0.000094562565,0.0044887457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889624,0.00031998314,0.00008233936,0.00031784474,0.00023469504,0.0001489045],"domain_scores_gemma":[0.9869354,0.008096654,0.0015353984,0.0011204332,0.00095877005,0.0013534636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012978709,0.00029734237,0.00052190333,0.0017128778,0.0009248362,0.003049451,0.0014534843,0.0011146585,0.013141465],"category_scores_gemma":[0.010651832,0.0004916623,0.0005083944,0.0013455322,0.0013782516,0.0040915017,0.0010337047,0.00075409806,0.0007957853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020048283,0.00022471562,0.02828336,0.00097569486,0.00030722574,0.00053419045,0.0014585005,0.028564919,0.017589424,0.8413596,0.019322846,0.05937471],"study_design_scores_gemma":[0.00013374894,0.00023716442,0.020618761,0.00016297522,0.00039477018,0.0038630997,0.0012898385,0.08705825,0.011316726,0.8587644,0.016083786,0.00007648372],"about_ca_topic_score_codex":0.00033194537,"about_ca_topic_score_gemma":0.00062737364,"teacher_disagreement_score":0.013141465,"about_ca_system_score_codex":0.00071818783,"about_ca_system_score_gemma":0.00048297172,"threshold_uncertainty_score":0.04396254},"labels":[],"label_agreement":null},{"id":"W2919239201","doi":"","title":"Well-Partitioned and Balanced Well-Partitioned Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012745691456855977,"score_gpt":0.2689667954612418,"score_spread":0.2562211040043858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919239201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41464764,0.0037567506,0.4593731,0.002839247,0.00057308516,0.0002277146,0.0031266734,0.0009413805,0.11451448],"genre_scores_gemma":[0.8968877,0.0019251906,0.06565093,0.0008990606,0.00036507766,0.00016055415,0.0024585926,0.00029231625,0.03136041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990294,0.00021568454,0.00005744541,0.00026233002,0.00020851483,0.00022665219],"domain_scores_gemma":[0.9961725,0.0012606453,0.00065673364,0.0007442828,0.00056950643,0.0005963699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008088247,0.00068432523,0.000526164,0.0017186276,0.0010620463,0.0028095266,0.0009225066,0.0009467586,0.011734543],"category_scores_gemma":[0.004840317,0.0006731982,0.00043445363,0.001513235,0.0013541469,0.0075093727,0.001693522,0.0013515918,0.002381723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032528501,0.00008461372,0.0017275229,0.00016259776,0.000041974283,0.00039952286,0.00045829552,0.006842081,0.00936121,0.9342514,0.009972761,0.036372714],"study_design_scores_gemma":[0.000036630416,0.000040433843,0.0009955096,0.000041455914,0.000031027346,0.0005597467,0.00037210312,0.011779293,0.0024465267,0.9717836,0.011895372,0.000018312352],"about_ca_topic_score_codex":0.0008368703,"about_ca_topic_score_gemma":0.0015299473,"teacher_disagreement_score":0.011734543,"about_ca_system_score_codex":0.0007207927,"about_ca_system_score_gemma":0.0004869994,"threshold_uncertainty_score":0.039255977},"labels":[],"label_agreement":null},{"id":"W2919325040","doi":"","title":"Linear list r-hued colorings of graphs with bounded maximum subgraph average degrees.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Induced subgraph; Discrete mathematics; Graph","score_opus":0.016832516482014084,"score_gpt":0.2655245428264735,"score_spread":0.2486920263444594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919325040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4448476,0.0009912543,0.49060455,0.0019719508,0.00027868766,0.00022925982,0.0032781519,0.004873481,0.052924972],"genre_scores_gemma":[0.87104017,0.000458034,0.10814153,0.00068271375,0.00012965816,0.00017529067,0.001918216,0.00082216057,0.016632251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988708,0.0003555403,0.000044911685,0.00024783233,0.00014885713,0.00033207654],"domain_scores_gemma":[0.99093115,0.0048426115,0.0008366728,0.0015326302,0.00088313175,0.0009737327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010838918,0.0007883403,0.00067372486,0.0010697641,0.0014414438,0.002414168,0.0024326409,0.0009144085,0.013139684],"category_scores_gemma":[0.008106725,0.0007906815,0.0006831631,0.0014357003,0.0013101458,0.0029696953,0.0016536588,0.0015645295,0.0025371006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023949922,0.00068496104,0.006858939,0.0012154292,0.0001930731,0.00076114683,0.0012495213,0.1689276,0.04249757,0.60357803,0.05178319,0.11985549],"study_design_scores_gemma":[0.00022938079,0.00022153783,0.0021659909,0.00011071437,0.00011554126,0.00049372105,0.0005740944,0.3861515,0.013271273,0.58698505,0.009597403,0.000083763814],"about_ca_topic_score_codex":0.0035673468,"about_ca_topic_score_gemma":0.0067729265,"teacher_disagreement_score":0.013139684,"about_ca_system_score_codex":0.0021038274,"about_ca_system_score_gemma":0.0013149707,"threshold_uncertainty_score":0.043956637},"labels":[],"label_agreement":null},{"id":"W2919759756","doi":"","title":"A note on the edge colorings of planar graphs without 7-cycles with three chords.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Enhanced Data Rates for GSM Evolution; Planar; Edge coloring; Graph; Computer science; Artificial intelligence; Line graph; Computer graphics (images)","score_opus":0.02086344610799311,"score_gpt":0.27806442402816783,"score_spread":0.2572009779201747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919759756","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085016295,0.018054,0.29550016,0.02068286,0.026461804,0.00028615005,0.0020283263,0.0028280863,0.54914236],"genre_scores_gemma":[0.54013604,0.02070445,0.31519124,0.007953918,0.0101959,0.00020629869,0.001765982,0.0012940152,0.10255206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993024,0.0001778083,0.000043790962,0.00016620486,0.00020405096,0.000105667095],"domain_scores_gemma":[0.99714166,0.0015103191,0.00017192523,0.0005882846,0.0003500304,0.0002377771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008006186,0.0007629094,0.00066068606,0.0010356432,0.0020861072,0.0017481777,0.0022003287,0.0011247725,0.011770131],"category_scores_gemma":[0.004807099,0.0005939068,0.0012996522,0.0015687228,0.0023619123,0.0027830005,0.0018764391,0.0044591413,0.002913451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055056124,0.0001182353,0.0013987217,0.000897412,0.000111316745,0.0015897992,0.0005000595,0.011927497,0.012724908,0.7092939,0.13004774,0.1308399],"study_design_scores_gemma":[0.00004703367,0.000122044585,0.0015944347,0.00015030592,0.00008070387,0.0013758382,0.000303437,0.00870558,0.0044555287,0.79465795,0.18841194,0.00009518975],"about_ca_topic_score_codex":0.00466689,"about_ca_topic_score_gemma":0.0081257075,"teacher_disagreement_score":0.011770131,"about_ca_system_score_codex":0.00108691,"about_ca_system_score_gemma":0.0007986226,"threshold_uncertainty_score":0.039375007},"labels":[],"label_agreement":null},{"id":"W2920204422","doi":"","title":"Spanning 3-ended trees in quasi-claw-free graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Combinatorics; Spanning tree; Biology","score_opus":0.021387877771457828,"score_gpt":0.29092617063252935,"score_spread":0.2695382928610715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920204422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75491244,0.00091241696,0.17478068,0.0011619357,0.00021501388,0.00012078959,0.001327921,0.00079911546,0.065769754],"genre_scores_gemma":[0.92291105,0.0004600182,0.04910387,0.0003862676,0.00006231473,0.00008337335,0.0014967463,0.00019042882,0.025305888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996124,0.0000836414,0.000029295836,0.000084780586,0.00009095542,0.00009897034],"domain_scores_gemma":[0.9982071,0.0008008718,0.00027411254,0.00019017176,0.00022748428,0.0003001693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004129077,0.00028493788,0.00036136777,0.0011714005,0.0013584212,0.0016907669,0.0008770474,0.0011643297,0.009003008],"category_scores_gemma":[0.0022611183,0.0005427635,0.00044801296,0.0011210868,0.0009764675,0.0031033,0.0015606581,0.0011491703,0.0019260001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017500107,0.00009551791,0.0023194326,0.0002304665,0.00003340336,0.0009639969,0.0010112823,0.0039684637,0.012126803,0.9412374,0.00592615,0.031912234],"study_design_scores_gemma":[0.00003623881,0.00004825746,0.00189657,0.00008684696,0.000036609832,0.0010666864,0.00057958986,0.013622832,0.005226871,0.96341187,0.013961138,0.000026530914],"about_ca_topic_score_codex":0.00092269696,"about_ca_topic_score_gemma":0.002255186,"teacher_disagreement_score":0.009003008,"about_ca_system_score_codex":0.00053985487,"about_ca_system_score_gemma":0.00036930226,"threshold_uncertainty_score":0.030118108},"labels":[],"label_agreement":null},{"id":"W2920329972","doi":"","title":"A New Lower Bound on the Total Domination Number of a Tree.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Domination analysis; Combinatorics; Upper and lower bounds; Mathematical analysis; Graph","score_opus":0.015207045081257102,"score_gpt":0.2931586158511737,"score_spread":0.2779515707699166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920329972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07227004,0.011859222,0.61334884,0.0067973146,0.002541674,0.00021600912,0.004922609,0.0019281697,0.28611618],"genre_scores_gemma":[0.6265308,0.008459936,0.26889822,0.0032372668,0.0041204453,0.0007949777,0.00622377,0.0022784227,0.079456165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974657,0.00033201417,0.00013708719,0.0006493675,0.00097241404,0.00044333216],"domain_scores_gemma":[0.9886341,0.007203744,0.00055423635,0.0016819314,0.0010129511,0.0009130242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019088719,0.0016357602,0.0016184826,0.0041390317,0.0020822354,0.0056801494,0.0041174055,0.002248659,0.022896837],"category_scores_gemma":[0.01241465,0.0007374391,0.0014071722,0.0036809405,0.0021141304,0.01103768,0.003433103,0.006015607,0.004908132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042544873,0.0002495128,0.0024649738,0.001021562,0.00016166501,0.00031008545,0.00040488917,0.03079632,0.020943929,0.76329416,0.06777105,0.11215647],"study_design_scores_gemma":[0.000049160313,0.000103100516,0.0017418542,0.00023588963,0.00017248148,0.0010036267,0.00015166128,0.115645975,0.006734443,0.8087038,0.065377824,0.00008023077],"about_ca_topic_score_codex":0.0012243412,"about_ca_topic_score_gemma":0.0029376,"teacher_disagreement_score":0.022896837,"about_ca_system_score_codex":0.0030616361,"about_ca_system_score_gemma":0.0013007097,"threshold_uncertainty_score":0.07659751},"labels":[],"label_agreement":null},{"id":"W2920365169","doi":"","title":"First Reformulated Zagreb Index And Some Graph Operations.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Graph; Combinatorics; Computer science; World Wide Web","score_opus":0.013728541977211137,"score_gpt":0.27196476074937176,"score_spread":0.25823621877216063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920365169","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06883533,0.0068109343,0.3120914,0.0053611957,0.0039569456,0.000121238154,0.001730739,0.00055783166,0.6005344],"genre_scores_gemma":[0.69497997,0.0055706026,0.15101571,0.0024268194,0.0027842696,0.0002135935,0.0013913901,0.00081535045,0.14080225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992735,0.00017017545,0.00004747591,0.0001659821,0.00021097357,0.00013193111],"domain_scores_gemma":[0.99923456,0.00023886729,0.000068042245,0.0001686048,0.00020430368,0.00008568058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010300041,0.0008043369,0.00093525526,0.0027923165,0.0021194143,0.0032021787,0.0013765758,0.0010545112,0.014243507],"category_scores_gemma":[0.0035602616,0.00025794076,0.0008699836,0.0030226791,0.0025471116,0.007891513,0.002180269,0.0039100777,0.0042838594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010431313,0.000006854417,0.00005243986,0.000027349453,0.0000027396322,0.0000199828,0.0000562205,0.00021715788,0.0001847498,0.98833185,0.0028750561,0.008215034],"study_design_scores_gemma":[0.0000046603777,0.000011993549,0.00012585931,0.000021774566,0.0000072507128,0.00008660915,0.0000432107,0.0011981467,0.00037913688,0.9757336,0.02237725,0.000010526469],"about_ca_topic_score_codex":0.0022020682,"about_ca_topic_score_gemma":0.0025584372,"teacher_disagreement_score":0.014243507,"about_ca_system_score_codex":0.001909429,"about_ca_system_score_gemma":0.0008548961,"threshold_uncertainty_score":0.047649324},"labels":[],"label_agreement":null},{"id":"W2920555783","doi":"","title":"On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Involution (esoterism); Mathematics; Combinatorics; Completeness (order theory); Discrete mathematics; Psychology","score_opus":0.043728775567516934,"score_gpt":0.2635209263663286,"score_spread":0.2197921507988117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920555783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67810744,0.0018851869,0.27373758,0.012000562,0.00023346748,0.00050428446,0.003366788,0.0013836119,0.028781094],"genre_scores_gemma":[0.9146784,0.0011766125,0.07063036,0.0011100319,0.0004472927,0.0005497519,0.0030085063,0.00046819533,0.007930782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99249685,0.0024856683,0.00040544945,0.001884034,0.0011813382,0.0015466398],"domain_scores_gemma":[0.9258839,0.0658422,0.0026561988,0.0027928422,0.0011906663,0.0016342569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043759374,0.0021743297,0.0030330543,0.0016336527,0.0025120215,0.008446681,0.004886465,0.0039579947,0.007384876],"category_scores_gemma":[0.02995751,0.0014178859,0.003618992,0.0026430879,0.0061037233,0.01354384,0.004600497,0.0068499614,0.00074309285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031898557,0.0012293252,0.009870128,0.0018028573,0.00068455347,0.0012990045,0.002739052,0.5363019,0.00907383,0.37182412,0.01515409,0.046831347],"study_design_scores_gemma":[0.00030779795,0.0001468929,0.0011312504,0.0000663928,0.00013136501,0.00028811046,0.00032370928,0.33705705,0.0016685078,0.65719146,0.0016207705,0.00006668699],"about_ca_topic_score_codex":0.0090544345,"about_ca_topic_score_gemma":0.006752619,"teacher_disagreement_score":0.0090544345,"about_ca_system_score_codex":0.0053693354,"about_ca_system_score_gemma":0.003465534,"threshold_uncertainty_score":0.038957417},"labels":[],"label_agreement":null},{"id":"W2920588083","doi":"","title":"One class of primitive 2-arc transitive graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Arc (geometry); Class (philosophy); Combinatorics; Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.02076743782908075,"score_gpt":0.27991681813936203,"score_spread":0.2591493803102813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920588083","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29053265,0.0012800422,0.1240263,0.0027798521,0.0011181515,0.0002881547,0.0041313376,0.0025674598,0.573276],"genre_scores_gemma":[0.9093658,0.0006647854,0.023774074,0.00052127254,0.0004702183,0.00011376538,0.0031403436,0.00024948898,0.06170028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994531,0.00005570969,0.000025561934,0.00018126877,0.00015738558,0.00012683294],"domain_scores_gemma":[0.9984724,0.00044025973,0.00020523438,0.00043565247,0.0001852429,0.00026133077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024910402,0.00053281605,0.00049903104,0.0011939217,0.0017195417,0.0026706364,0.0012102753,0.001205863,0.023269907],"category_scores_gemma":[0.0017381618,0.0002735015,0.00067139877,0.0009742963,0.0012392286,0.0029254798,0.0012898841,0.0017635033,0.003223774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012011431,0.00009418498,0.0010746962,0.00015334135,0.000015599448,0.00045373137,0.00028691572,0.0007273405,0.0025988114,0.93595105,0.014212857,0.044311337],"study_design_scores_gemma":[0.000040224666,0.000063625695,0.0014140245,0.000053611075,0.000023955168,0.0015194181,0.0002442498,0.004215813,0.0022623506,0.92477363,0.06535593,0.00003308999],"about_ca_topic_score_codex":0.0006580076,"about_ca_topic_score_gemma":0.0010291076,"teacher_disagreement_score":0.023269907,"about_ca_system_score_codex":0.00070402346,"about_ca_system_score_gemma":0.0007071492,"threshold_uncertainty_score":0.07784563},"labels":[],"label_agreement":null},{"id":"W2920676263","doi":"","title":"Plane graphs without homeomorphically irreducible spanning trees","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Plane (geometry); Geometry","score_opus":0.021787341638129926,"score_gpt":0.28831440027833233,"score_spread":0.26652705864020243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920676263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6678133,0.0009875434,0.18598919,0.001833653,0.00018004836,0.0001455928,0.0020980153,0.00095887476,0.13999379],"genre_scores_gemma":[0.92183936,0.0010398942,0.042531226,0.00043168524,0.00010512935,0.00008751243,0.0020708465,0.00026279996,0.031631432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999468,0.00009663083,0.000029138868,0.00014627042,0.00013632812,0.00012357492],"domain_scores_gemma":[0.9986022,0.00046385638,0.00030760223,0.00029742403,0.00016292723,0.0001659032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003055388,0.00070354424,0.00074650336,0.0015834505,0.0013562558,0.0035301752,0.0010448218,0.0014082508,0.012325809],"category_scores_gemma":[0.0020069804,0.0007846042,0.0006490404,0.0021011762,0.001408132,0.0041989908,0.0018008891,0.0023931284,0.0022421565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011616318,0.00005831745,0.000857278,0.00010240616,0.000037176236,0.00030090177,0.00029856668,0.0026708334,0.0043668426,0.9721306,0.003976609,0.01508426],"study_design_scores_gemma":[0.0000410424,0.000026312391,0.0010756208,0.000032366857,0.00006416136,0.0006805306,0.00036407495,0.00784423,0.003072148,0.97495383,0.01182607,0.00001974863],"about_ca_topic_score_codex":0.0010840265,"about_ca_topic_score_gemma":0.001447521,"teacher_disagreement_score":0.012325809,"about_ca_system_score_codex":0.00061513815,"about_ca_system_score_gemma":0.00034947842,"threshold_uncertainty_score":0.041234016},"labels":[],"label_agreement":null},{"id":"W2920684777","doi":"","title":"Twin signed total domination numbers in directed graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01073964492393636,"score_gpt":0.27440831720286907,"score_spread":0.2636686722789327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920684777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5642094,0.0011501041,0.30453357,0.001323551,0.00056463963,0.00010630362,0.00090656546,0.00064051565,0.12656532],"genre_scores_gemma":[0.94787353,0.00040555972,0.031499952,0.00019711923,0.00014204155,0.00009931828,0.00033471873,0.00010760887,0.019340167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991171,0.00023208417,0.00007153384,0.00017232317,0.00026864323,0.00013819446],"domain_scores_gemma":[0.9965037,0.0016506553,0.00049089163,0.00036030577,0.0005496661,0.0004448667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095699704,0.00034464794,0.00038612692,0.001865583,0.0010238385,0.0027145066,0.0006564185,0.0006065698,0.006923403],"category_scores_gemma":[0.0059794514,0.00028035208,0.00031241262,0.0014657394,0.0014840171,0.004008473,0.0014354781,0.0010409441,0.0007732939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099209516,0.000021398204,0.0010979561,0.000093164235,0.000015761487,0.00012707061,0.0002663978,0.0019158155,0.0030118488,0.9629933,0.0024706817,0.027887315],"study_design_scores_gemma":[0.000022259475,0.000030472373,0.0005965885,0.000036962687,0.000022514734,0.00036166704,0.00016751655,0.011276592,0.0026203599,0.9755086,0.009334813,0.000021722652],"about_ca_topic_score_codex":0.0004046589,"about_ca_topic_score_gemma":0.0008805971,"teacher_disagreement_score":0.006923403,"about_ca_system_score_codex":0.0007902153,"about_ca_system_score_gemma":0.000562397,"threshold_uncertainty_score":0.023161113},"labels":[],"label_agreement":null},{"id":"W2920730178","doi":"","title":"Dominating set and hamiltonicity in claw-heavy graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Combinatorics; Set (abstract data type); Biology; Computer science; Programming language","score_opus":0.019312237141795082,"score_gpt":0.29657290160451144,"score_spread":0.27726066446271636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920730178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77338785,0.0016893444,0.12109004,0.0033988943,0.00029680802,0.0002020638,0.001352418,0.00032525425,0.098257266],"genre_scores_gemma":[0.96502864,0.0005777776,0.01134239,0.00043558408,0.00016792316,0.00008264975,0.0007546202,0.00005266882,0.021557724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952865,0.00009153479,0.000018505292,0.00012645808,0.00011557142,0.000119308184],"domain_scores_gemma":[0.996784,0.0017954715,0.0004116897,0.00027905975,0.00025599828,0.00047380108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004307962,0.00039625246,0.00050146435,0.0015084271,0.0015890683,0.0017757498,0.0011773143,0.0008733956,0.00733823],"category_scores_gemma":[0.0034218258,0.000495866,0.000457859,0.001378677,0.0019289788,0.002316576,0.0016528063,0.0014151279,0.00055731647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020499148,0.00010677572,0.0028022714,0.00021215797,0.0000480603,0.00049709406,0.0007284267,0.0064751483,0.0074697887,0.95072067,0.008387407,0.022347283],"study_design_scores_gemma":[0.000057732526,0.000057167224,0.0018984347,0.000040093528,0.00003955404,0.00047592603,0.00040476964,0.018879782,0.0027173678,0.9684549,0.0069515337,0.000022807182],"about_ca_topic_score_codex":0.003811846,"about_ca_topic_score_gemma":0.0059520225,"teacher_disagreement_score":0.00733823,"about_ca_system_score_codex":0.0013183596,"about_ca_system_score_gemma":0.00077458826,"threshold_uncertainty_score":0.024548829},"labels":[],"label_agreement":null},{"id":"W2920782108","doi":"","title":"2-upper bound graphs of posets","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015371943110201996,"score_gpt":0.2894162301046144,"score_spread":0.2740442869944124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920782108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21868354,0.0019500748,0.5682213,0.005370675,0.0007008152,0.0002674157,0.0036765663,0.0023859572,0.19874366],"genre_scores_gemma":[0.7411548,0.0017980352,0.12957063,0.0030137396,0.00089452247,0.00060799165,0.0073651066,0.0018550516,0.113740094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714726,0.0006136432,0.00015504443,0.00079677714,0.0007141259,0.00057310617],"domain_scores_gemma":[0.9926777,0.0037773186,0.00068038306,0.0011434348,0.0007014638,0.0010196028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013521075,0.0021285273,0.0018209969,0.003896921,0.003937741,0.00980382,0.0035162368,0.0027332988,0.038982306],"category_scores_gemma":[0.0069397027,0.0019053664,0.0026235725,0.004747946,0.003293931,0.012281329,0.0063853706,0.006449037,0.005573373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016311185,0.00012560507,0.0006060869,0.00017081996,0.000037682457,0.00019611818,0.0007829831,0.00380063,0.0018003847,0.97148263,0.007577438,0.01325648],"study_design_scores_gemma":[0.00002303405,0.000018946226,0.00037082477,0.000035268502,0.000029519075,0.00015014973,0.00018672559,0.0052601015,0.0009446045,0.9846311,0.008331015,0.000018737876],"about_ca_topic_score_codex":0.0025636617,"about_ca_topic_score_gemma":0.0038158805,"teacher_disagreement_score":0.038982306,"about_ca_system_score_codex":0.002175674,"about_ca_system_score_gemma":0.0009266824,"threshold_uncertainty_score":0.13040876},"labels":[],"label_agreement":null},{"id":"W2921478501","doi":"10.1007/s00493-020-4177-y","title":"On the Density of C7-Critical Graphs","year":2022,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Homomorphism; Planar graph; Modulo; Girth (graph theory); Conjecture; Graph homomorphism; Graph; Discrete mathematics; Odd graph; 1-planar graph; Graph power; Line graph","score_opus":0.0345622702573892,"score_gpt":0.3188477609824474,"score_spread":0.28428549072505815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921478501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7658805,0.0029121235,0.099412635,0.0056286766,0.0003021892,0.00010191322,0.0009129219,0.00048211243,0.12436694],"genre_scores_gemma":[0.98090094,0.001229649,0.008791774,0.00043260923,0.00041318146,0.000113698174,0.0005392418,0.00015386751,0.0074250167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990226,0.0003485378,0.000026824855,0.00014490307,0.0002658864,0.00019117631],"domain_scores_gemma":[0.9846635,0.01096707,0.0009309159,0.0006190949,0.0012183507,0.0016011588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015850026,0.00068855524,0.001195856,0.0053089713,0.0021953816,0.0035511744,0.0021699022,0.0019135117,0.013173649],"category_scores_gemma":[0.01732547,0.00081612467,0.00054363156,0.0023029405,0.004211175,0.004680247,0.0026299823,0.00234157,0.00089935126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007029354,0.000030456282,0.0011288176,0.000091785645,0.000010610044,0.00007284285,0.00026470856,0.0031681138,0.00084231864,0.9865955,0.0035081923,0.004216434],"study_design_scores_gemma":[0.000023333883,0.000012729606,0.0010219956,0.000055115408,0.0000120992045,0.00016410262,0.00017785077,0.026457839,0.0006366403,0.9697267,0.0016937114,0.000017877917],"about_ca_topic_score_codex":0.002791504,"about_ca_topic_score_gemma":0.0020579866,"teacher_disagreement_score":0.013173649,"about_ca_system_score_codex":0.0023337845,"about_ca_system_score_gemma":0.00089370104,"threshold_uncertainty_score":0.044070244},"labels":[],"label_agreement":null},{"id":"W2922137268","doi":"10.37236/8584","title":"On Density-Critical Matroids","year":2020,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Marsden Fund; National Science Foundation","keywords":"Matroid; Graphic matroid; Matroid partitioning; Rank (graph theory); Simple (philosophy)","score_opus":0.01426340436832554,"score_gpt":0.2810035618421438,"score_spread":0.2667401574738183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922137268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7167448,0.002046343,0.20668554,0.0015882404,0.00012245128,0.00013073838,0.00067693094,0.000450338,0.071554676],"genre_scores_gemma":[0.96701294,0.0009209871,0.023194678,0.0002927939,0.00022214,0.000108750915,0.00064460695,0.000068226924,0.007534871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990054,0.00018850717,0.000051621268,0.00021712836,0.00031420361,0.00022326145],"domain_scores_gemma":[0.9965485,0.0015402675,0.0005061175,0.0003658711,0.0003815405,0.00065773097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006441425,0.00073302357,0.0005913366,0.0020528426,0.0018104177,0.0019045976,0.0008525435,0.00095919205,0.0049772398],"category_scores_gemma":[0.0056778225,0.00063558575,0.00067219103,0.0014236904,0.003066822,0.0031353976,0.0026733251,0.0017505669,0.0005941166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010217887,0.000065338114,0.0028763404,0.00014574784,0.000020289584,0.00039244693,0.00065628916,0.009263661,0.0046879086,0.9639255,0.00312211,0.014742122],"study_design_scores_gemma":[0.000029312487,0.000071999624,0.0022843431,0.00006238147,0.000022909546,0.00077884726,0.0003567811,0.042493258,0.0033267976,0.93869954,0.011838704,0.000035167704],"about_ca_topic_score_codex":0.003055977,"about_ca_topic_score_gemma":0.0025244146,"teacher_disagreement_score":0.0049772398,"about_ca_system_score_codex":0.0018762916,"about_ca_system_score_gemma":0.0005226085,"threshold_uncertainty_score":0.016650498},"labels":[],"label_agreement":null},{"id":"W2930774002","doi":"10.1017/s0004972719000352","title":"A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS","year":2019,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Unicode; Mathematics; Clique number; Vertex (graph theory); Graph; Chromatic scale; Discrete mathematics; Computer science","score_opus":0.025648063600059345,"score_gpt":0.30192473956816396,"score_spread":0.2762766759681046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2930774002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2682159,0.0049998583,0.36943233,0.008972848,0.0009513873,0.00030146187,0.006593044,0.0030168754,0.3375163],"genre_scores_gemma":[0.81667626,0.0030088795,0.11587137,0.0021371054,0.00092663086,0.00060566654,0.004785084,0.0012884709,0.054700486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984627,0.00020019981,0.000049752944,0.00057377113,0.00031540397,0.00039821738],"domain_scores_gemma":[0.9924159,0.0046647834,0.00042906246,0.00095902494,0.000638352,0.0008928395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014842496,0.0014714978,0.0007883576,0.0031989522,0.0024082942,0.0032732813,0.0028335643,0.0014238993,0.020723876],"category_scores_gemma":[0.007596528,0.0007060273,0.0010723425,0.0027696404,0.0030709591,0.0057834038,0.0029149835,0.0037539366,0.003376911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007429177,0.00020233738,0.004046015,0.0005426114,0.00011007526,0.00028494716,0.0006870207,0.032334667,0.017098771,0.84155405,0.05707379,0.045322835],"study_design_scores_gemma":[0.000114208735,0.00015391655,0.005606849,0.00021759351,0.0001379836,0.00067285006,0.00024582408,0.097713344,0.01079217,0.8203907,0.06381064,0.00014393085],"about_ca_topic_score_codex":0.0056360983,"about_ca_topic_score_gemma":0.007177796,"teacher_disagreement_score":0.020723876,"about_ca_system_score_codex":0.004301119,"about_ca_system_score_gemma":0.0017838147,"threshold_uncertainty_score":0.06932831},"labels":[],"label_agreement":null},{"id":"W2935502686","doi":"10.1007/s00453-023-01204-1","title":"Finding Optimal Solutions with Neighborly Help","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Japan Society for the Promotion of Science; Eidgenössische Technische Hochschule Zürich; Alexander von Humboldt-Stiftung; Heinrich-Heine-Universität Düsseldorf; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Edge cover; Theory of computation; Vertex cover; Combinatorics; Vertex (graph theory); Edge coloring; Graph; Computer science; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Mathematics; Algorithm; Line graph; Artificial intelligence; Graph power","score_opus":0.026548626414717717,"score_gpt":0.29098596922594716,"score_spread":0.26443734281122944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935502686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2838045,0.0009862488,0.6449873,0.005596589,0.0003081716,0.0004072904,0.0013149413,0.0023079636,0.06028698],"genre_scores_gemma":[0.67177206,0.0003203989,0.3135733,0.00076813536,0.00016917894,0.00025976973,0.0019784218,0.00044525595,0.010713474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866724,0.00028787254,0.000061206316,0.00048452045,0.00027491528,0.00022434036],"domain_scores_gemma":[0.9977737,0.0012550937,0.00018003653,0.0004521536,0.00018587359,0.00015304805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009050951,0.0010062357,0.0010680549,0.0008249831,0.0009050636,0.0020573433,0.0017969239,0.001881574,0.011965719],"category_scores_gemma":[0.0069175954,0.00061276625,0.0012605193,0.0010915622,0.0014269779,0.0035906737,0.0017601261,0.0023527516,0.0013772098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000940795,0.0007496195,0.0038761434,0.00069725316,0.00022637573,0.00040787391,0.0005852718,0.5842525,0.0077895373,0.21521084,0.034108926,0.15115497],"study_design_scores_gemma":[0.00011070108,0.00012179326,0.00046192846,0.000055991542,0.000058718157,0.00013441397,0.00023497018,0.65893686,0.004069435,0.32892716,0.006860444,0.000027555257],"about_ca_topic_score_codex":0.0028413557,"about_ca_topic_score_gemma":0.0037810185,"teacher_disagreement_score":0.011965719,"about_ca_system_score_codex":0.0016136434,"about_ca_system_score_gemma":0.0013815068,"threshold_uncertainty_score":0.040029347},"labels":[],"label_agreement":null},{"id":"W2938191358","doi":"10.1145/3385731","title":"Planar Graphs Have Bounded Queue-Number","year":2020,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Treewidth; Planar graph; 1-planar graph; Bounded function; Pathwidth; Book embedding; Tree-depth; Indifference graph; Clique-sum; Graph product","score_opus":0.04225608643793,"score_gpt":0.310918355023021,"score_spread":0.268662268585091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938191358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33860987,0.0010086348,0.61401516,0.0017598604,0.00016266607,0.00017342485,0.0011827039,0.0012029911,0.041884772],"genre_scores_gemma":[0.9041152,0.00085473777,0.080339655,0.00044075446,0.00011150104,0.0001675477,0.00075449806,0.000358985,0.012857108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988632,0.000121684745,0.000049994687,0.000322864,0.0003226344,0.00031959408],"domain_scores_gemma":[0.99341244,0.0028106805,0.0011458343,0.0010572695,0.0009754362,0.00059832144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006562036,0.0009049817,0.00084198255,0.0009228029,0.0016094644,0.0029091518,0.0017494655,0.0008803269,0.00807234],"category_scores_gemma":[0.00604815,0.00054177095,0.0011969369,0.0012022412,0.0021522432,0.006989599,0.0033228463,0.0023075412,0.00092137745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004126276,0.000100589736,0.0038862212,0.00031443426,0.000053678665,0.00022062173,0.0006829223,0.028228212,0.015970467,0.9147733,0.003988394,0.03136857],"study_design_scores_gemma":[0.00006590276,0.00019520587,0.0019851995,0.0000458694,0.00009268552,0.00041748182,0.0002975033,0.069236085,0.010626975,0.8976608,0.019320667,0.000055737863],"about_ca_topic_score_codex":0.0030862833,"about_ca_topic_score_gemma":0.0035318397,"teacher_disagreement_score":0.00807234,"about_ca_system_score_codex":0.00230838,"about_ca_system_score_gemma":0.001065097,"threshold_uncertainty_score":0.027004719},"labels":[],"label_agreement":null},{"id":"W2939719063","doi":"10.1007/s00373-019-02123-1","title":"The Intersection of Two Vertex Coloring Problems","year":2019,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Induced subgraph; Graph coloring; Complete coloring; Chordal graph; Greedy coloring; Graph; Discrete mathematics; Graph power; Line graph","score_opus":0.02231037702462028,"score_gpt":0.2768498994107605,"score_spread":0.2545395223861402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939719063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55857444,0.0024000418,0.21236877,0.011134309,0.0005990902,0.0002085113,0.002025274,0.0006859291,0.21200363],"genre_scores_gemma":[0.9159165,0.0012071483,0.053948212,0.00070284633,0.00039060877,0.00017400176,0.00290097,0.00025550835,0.024504239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964169,0.001394342,0.000153632,0.0007002829,0.00064832513,0.0006865807],"domain_scores_gemma":[0.9873081,0.009103951,0.00069548475,0.0008687092,0.00090622716,0.0011174949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019944515,0.0009672854,0.0015323128,0.0023203327,0.0030267902,0.007918907,0.0029630375,0.0036707665,0.017406514],"category_scores_gemma":[0.013740196,0.0010168459,0.0014630891,0.0034995521,0.0029423733,0.009279268,0.0043477747,0.0056751124,0.0013388558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074531883,0.00029362153,0.0017906803,0.0002832931,0.00008021649,0.00036013484,0.00068518316,0.009243359,0.0013724634,0.9343381,0.012022392,0.038785253],"study_design_scores_gemma":[0.00007838889,0.00004094064,0.00057707675,0.00007002331,0.000048584654,0.00025789498,0.00058904954,0.031788636,0.0015084046,0.95811355,0.0069032535,0.000024328388],"about_ca_topic_score_codex":0.0017593674,"about_ca_topic_score_gemma":0.0011406124,"teacher_disagreement_score":0.017406514,"about_ca_system_score_codex":0.0025914686,"about_ca_system_score_gemma":0.0018318668,"threshold_uncertainty_score":0.05823064},"labels":[],"label_agreement":null},{"id":"W2942927459","doi":"10.1142/s0219265919400048","title":"Search Numbers in Networks with Special Topologies","year":2019,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Vertex (graph theory); Chordal graph; Combinatorics; Mathematics; Indifference graph; Maximal independent set; Computer science; Time complexity; Discrete mathematics; Graph; 1-planar graph","score_opus":0.011921708208131324,"score_gpt":0.2694484824025898,"score_spread":0.25752677419445846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942927459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54978,0.0012133863,0.43558824,0.0008118602,0.00004972108,0.000082083854,0.0004018248,0.0006076668,0.011465273],"genre_scores_gemma":[0.85829,0.00044706094,0.1367342,0.00008073182,0.000038787744,0.00013188971,0.00039521584,0.00012822237,0.00375392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938595,0.00012825798,0.0000442905,0.00019676755,0.000112020185,0.00013273592],"domain_scores_gemma":[0.99571073,0.0030862845,0.0005457405,0.00029085815,0.00020890393,0.0001574727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080187153,0.00035021582,0.0007758673,0.0010531413,0.00067815714,0.0013091897,0.0009211606,0.0009406242,0.0038687643],"category_scores_gemma":[0.00853971,0.00039137914,0.0004391977,0.0011932623,0.0010076986,0.0039308136,0.000727594,0.0006269953,0.00034223258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081066694,0.00013785274,0.0048915083,0.0006393094,0.00009827174,0.00041799122,0.00044922388,0.59127116,0.019035352,0.28411323,0.0042129788,0.09392239],"study_design_scores_gemma":[0.00008550197,0.00015097903,0.0012293071,0.00003507886,0.000047926587,0.0004894712,0.00016271987,0.7552752,0.008305637,0.22979797,0.004393058,0.000027248903],"about_ca_topic_score_codex":0.00065054244,"about_ca_topic_score_gemma":0.0011998729,"teacher_disagreement_score":0.0038687643,"about_ca_system_score_codex":0.0008988142,"about_ca_system_score_gemma":0.00056744524,"threshold_uncertainty_score":0.012942314},"labels":[],"label_agreement":null},{"id":"W2943721094","doi":"","title":"Total E¢ cient Dominating Sets in Cayley Graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Discrete mathematics; Cayley graph; Combinatorics; Graph","score_opus":0.013314213253175125,"score_gpt":0.27855471568546386,"score_spread":0.26524050243228875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943721094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76145214,0.002288905,0.18535522,0.0024894094,0.00027422144,0.00042639006,0.004175382,0.00065186707,0.042886615],"genre_scores_gemma":[0.91350394,0.0017250694,0.062372956,0.0005418892,0.00014448608,0.00027700813,0.0032318258,0.00022929591,0.017973475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998635,0.00036861165,0.00008132427,0.0002876385,0.00038166356,0.00024577486],"domain_scores_gemma":[0.9924355,0.004223062,0.00065892,0.0008964717,0.00072392606,0.0010620094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012574999,0.0014887977,0.0018267905,0.0019155619,0.0018654836,0.0053436765,0.002903227,0.001464165,0.008956872],"category_scores_gemma":[0.0071380087,0.0015263763,0.0010747623,0.003461959,0.0016618384,0.0043717637,0.00252064,0.0018896341,0.000826084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008429156,0.00048389158,0.0063430592,0.001309967,0.00033471588,0.0006879297,0.001161573,0.160976,0.020135071,0.7034733,0.025287485,0.07896411],"study_design_scores_gemma":[0.00028996085,0.00016944588,0.0022226146,0.00012104219,0.00023828728,0.0006151364,0.0005640415,0.19295496,0.0071016513,0.78470826,0.010963596,0.00005108823],"about_ca_topic_score_codex":0.0023902662,"about_ca_topic_score_gemma":0.007511491,"teacher_disagreement_score":0.008956872,"about_ca_system_score_codex":0.0026011718,"about_ca_system_score_gemma":0.0016798204,"threshold_uncertainty_score":0.029963732},"labels":[],"label_agreement":null},{"id":"W2944171269","doi":"10.1016/j.jctb.2020.07.001","title":"The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Graph; Tree (set theory); Degree (music); Component (thermodynamics); Connected component; Physics","score_opus":0.026241279213906985,"score_gpt":0.29976136910398044,"score_spread":0.2735200898900734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944171269","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3629976,0.0016815139,0.090834126,0.029071242,0.0035249419,0.00007083908,0.0016368804,0.00077256415,0.50941026],"genre_scores_gemma":[0.9587947,0.0006423296,0.012559155,0.0028675178,0.0010992786,0.000051722393,0.0010303599,0.00013958495,0.022815362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992131,0.00011821286,0.000028858294,0.0002420173,0.00019417355,0.00020365753],"domain_scores_gemma":[0.9972005,0.0013745414,0.00024083932,0.0005310609,0.00036535133,0.000287777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008488351,0.00051324733,0.0009569119,0.0010140452,0.0026589911,0.0035245137,0.0012137111,0.0026676154,0.023339342],"category_scores_gemma":[0.0036095197,0.00047446584,0.00088848156,0.0011455467,0.0038693948,0.00831301,0.0021690188,0.004486131,0.00275147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099331235,0.000038203023,0.0005408102,0.00010047615,0.000011152874,0.00021209587,0.0001512953,0.000398819,0.0010266566,0.98495954,0.0066100815,0.005851658],"study_design_scores_gemma":[0.000018073519,0.000007025608,0.00028758016,0.000014014753,0.000004533552,0.00016121939,0.00008724,0.0008989211,0.00034331816,0.99403256,0.004138532,0.0000069821185],"about_ca_topic_score_codex":0.0008294098,"about_ca_topic_score_gemma":0.0011336462,"teacher_disagreement_score":0.023339342,"about_ca_system_score_codex":0.00070505036,"about_ca_system_score_gemma":0.00053372566,"threshold_uncertainty_score":0.07807785},"labels":[],"label_agreement":null},{"id":"W2945020291","doi":"10.1007/978-3-319-62127-2_9","title":"Dynamic graph coloring","year":2017,"lang":"en","type":"book-chapter","venue":"Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; List coloring; Vertex (graph theory); Graph; Fractional coloring; Complete coloring; Edge coloring; Upper and lower bounds; Wheel graph; Chromatic scale; Mathematics; Graph coloring; Brooks' theorem; Path graph; Graph power; Discrete mathematics; Computer science; Line graph","score_opus":0.014514479801589115,"score_gpt":0.22145743033225293,"score_spread":0.2069429505306638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945020291","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04987805,0.0067653204,0.7770821,0.0017028276,0.0012847098,0.0003906163,0.0010352331,0.0044238195,0.15743737],"genre_scores_gemma":[0.3077689,0.007190605,0.57955956,0.0011385672,0.0006088267,0.00050873525,0.0029079202,0.0029860234,0.0973308],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842703,0.00022736522,0.000053833046,0.00046384003,0.00057335076,0.00025460662],"domain_scores_gemma":[0.996151,0.0016491357,0.00021667071,0.0013357387,0.00047309263,0.0001743035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007964138,0.000984655,0.00091047323,0.0009220651,0.0013985058,0.0025795114,0.0021313862,0.00090256525,0.016491346],"category_scores_gemma":[0.0043784063,0.000536544,0.0006865534,0.0025709695,0.00080773834,0.0036359245,0.0015777354,0.0017883708,0.004795458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004388474,0.0003023512,0.0019930864,0.00088261813,0.0000843563,0.00026240112,0.00034742118,0.121814586,0.02054123,0.27530217,0.056083184,0.5219478],"study_design_scores_gemma":[0.00012817243,0.0002719703,0.0018338951,0.00018643856,0.00011363053,0.001897304,0.0002911378,0.3082761,0.02390268,0.22610009,0.43693945,0.00005921296],"about_ca_topic_score_codex":0.002227953,"about_ca_topic_score_gemma":0.0034102725,"teacher_disagreement_score":0.016491346,"about_ca_system_score_codex":0.0032157642,"about_ca_system_score_gemma":0.0017941641,"threshold_uncertainty_score":0.055169046},"labels":[],"label_agreement":null},{"id":"W2946703759","doi":"10.4230/lipics.mfcs.2019.59","title":"Counting Homomorphisms Modulo a Prime Number","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Combinatorics; Modulo; Mathematics; Discrete mathematics; Graph homomorphism; Graph; Prime (order theory); Prime number; Graph power; Line graph","score_opus":0.022752544219782747,"score_gpt":0.29763978576484207,"score_spread":0.27488724154505934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946703759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5181272,0.0029808395,0.4295257,0.012709091,0.0006189241,0.00046708086,0.002907073,0.0020077433,0.030656284],"genre_scores_gemma":[0.8160205,0.0016653141,0.16483358,0.0013548834,0.0014024943,0.00046523358,0.003337969,0.0004181679,0.010501869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934198,0.001708265,0.0004386351,0.0023715273,0.0014010177,0.00066080067],"domain_scores_gemma":[0.9658965,0.025096778,0.0023814314,0.00397813,0.0011936291,0.0014535838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033514504,0.0013041178,0.0020111823,0.0027231341,0.0022642058,0.0054092314,0.0030998222,0.002538048,0.007826264],"category_scores_gemma":[0.026618574,0.0010558229,0.0018816441,0.0035420472,0.0050464817,0.02248602,0.004455233,0.004883042,0.0009775953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093636144,0.00042514724,0.011347638,0.0011034245,0.00024147144,0.000726058,0.0015917141,0.059566997,0.008043926,0.74880964,0.020873647,0.14633395],"study_design_scores_gemma":[0.000059822356,0.000059241338,0.0007835108,0.000039989547,0.00005647492,0.00039199664,0.00019319128,0.061373208,0.002874005,0.929519,0.004608395,0.000041071296],"about_ca_topic_score_codex":0.0011713353,"about_ca_topic_score_gemma":0.0008971654,"teacher_disagreement_score":0.007826264,"about_ca_system_score_codex":0.0028045266,"about_ca_system_score_gemma":0.0019718073,"threshold_uncertainty_score":0.02618146},"labels":[],"label_agreement":null},{"id":"W294789553","doi":"","title":"Combinatorics and Graph Theory, by J. M. Harris, J. L. Hirst, M. J. Mossinghoff","year":2001,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph theory; Graph; Discrete mathematics","score_opus":0.01213149790422024,"score_gpt":0.2321512127070419,"score_spread":0.22001971480282165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W294789553","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042151045,0.7887262,0.028134335,0.08605138,0.017485362,0.00002493654,0.00034218738,0.00036763164,0.07465298],"genre_scores_gemma":[0.1075871,0.6656051,0.03454295,0.015826702,0.037514683,0.000119494754,0.00085923803,0.0006452215,0.13729951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993186,0.00021641095,0.00003817058,0.00016183163,0.0002192275,0.000045799366],"domain_scores_gemma":[0.99796605,0.0013452537,0.00012464976,0.00012419766,0.00027002775,0.00016974998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001541159,0.0015080501,0.001016537,0.003083635,0.0017951073,0.0034892058,0.00091757916,0.0012920881,0.0060369805],"category_scores_gemma":[0.0041170456,0.00094055396,0.00079421035,0.004727853,0.0056844973,0.008459111,0.0012607115,0.0056250487,0.002973152],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005993426,0.000050579416,0.00086106826,0.0006588303,0.00007881554,0.00013570045,0.00074557425,0.0022048983,0.00057580444,0.48986718,0.42790392,0.07685775],"study_design_scores_gemma":[0.000014134321,0.000022454326,0.0011111585,0.00032234014,0.000022667738,0.00031311697,0.00031041272,0.0011565702,0.00016210372,0.49389184,0.5026522,0.000021023734],"about_ca_topic_score_codex":0.006627939,"about_ca_topic_score_gemma":0.010560873,"teacher_disagreement_score":0.006627939,"about_ca_system_score_codex":0.0031893812,"about_ca_system_score_gemma":0.0016903284,"threshold_uncertainty_score":0.023140728},"labels":[],"label_agreement":null},{"id":"W2948073045","doi":"10.1142/s1793830920500391","title":"A separator-based method for generating weakly chordal graphs","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Treewidth; Graph; Block graph; Outerplanar graph; Discrete mathematics; Computer science; Pathwidth; Algorithm; Line graph; 1-planar graph","score_opus":0.044234334651032416,"score_gpt":0.36754259478659695,"score_spread":0.3233082601355645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948073045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011521112,0.0000915701,0.9785366,0.00012997296,0.000059599155,0.00021975451,0.0005181559,0.0053288047,0.0035943612],"genre_scores_gemma":[0.08406052,0.00009508304,0.90789306,0.00010356464,0.000030537252,0.00029639967,0.0017568035,0.0010575044,0.00470649],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998429,0.00022157872,0.00014753289,0.00038542066,0.0006738408,0.00014263015],"domain_scores_gemma":[0.9964204,0.00089553813,0.0002631908,0.0016653822,0.0005853601,0.00017007743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008524931,0.0009093271,0.00088089413,0.0017025125,0.0010735353,0.0015402054,0.0026283793,0.0009110282,0.011519405],"category_scores_gemma":[0.0044804104,0.00077350944,0.0012412032,0.0025783917,0.0011008737,0.003827633,0.003220651,0.0015136935,0.005306154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009406166,0.000326131,0.001889134,0.0008776027,0.00010495694,0.0003933542,0.0007068312,0.02552395,0.096236326,0.1374495,0.021205237,0.71434635],"study_design_scores_gemma":[0.0004381847,0.0007533735,0.0009136743,0.000107002816,0.00012939195,0.0010462628,0.00046196504,0.43467507,0.20905097,0.24595934,0.106238164,0.0002266115],"about_ca_topic_score_codex":0.00094560464,"about_ca_topic_score_gemma":0.001600571,"teacher_disagreement_score":0.011519405,"about_ca_system_score_codex":0.000898182,"about_ca_system_score_gemma":0.0014240281,"threshold_uncertainty_score":0.03853625},"labels":[],"label_agreement":null},{"id":"W2948217655","doi":"","title":"Two Tallest Trees","year":2017,"lang":"en","type":"article","venue":"Dalhousie review","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geology","score_opus":0.05008914162275741,"score_gpt":0.36955627844989253,"score_spread":0.3194671368271351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948217655","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059635073,0.06878481,0.12037027,0.080098554,0.0059637316,0.00014665868,0.0032678365,0.001358419,0.6603747],"genre_scores_gemma":[0.5968434,0.04492609,0.081177995,0.021308983,0.0053889737,0.0003093497,0.0036986216,0.00093083194,0.24541569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988487,0.0001625851,0.00005484775,0.0002900071,0.00039173424,0.00025203294],"domain_scores_gemma":[0.9969298,0.0010485684,0.00023253879,0.0006702085,0.0007258485,0.00039293143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007602017,0.00040302714,0.00073646894,0.002043532,0.0027289533,0.0036316533,0.0012981286,0.0021005315,0.020897355],"category_scores_gemma":[0.006655277,0.00039298416,0.0004428958,0.0025386093,0.003194769,0.0076329582,0.0024350989,0.0037829159,0.005765129],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063972846,0.00002424898,0.0004295903,0.00016275626,0.000018616593,0.00013441991,0.0003415274,0.000330713,0.00056349096,0.8102784,0.05527552,0.1323768],"study_design_scores_gemma":[0.000014400555,0.000016502037,0.0005439776,0.00015829217,0.000022279737,0.00046918384,0.00026706967,0.00043928262,0.00061568065,0.73248494,0.26495054,0.000017820714],"about_ca_topic_score_codex":0.0024769832,"about_ca_topic_score_gemma":0.004247643,"teacher_disagreement_score":0.020897355,"about_ca_system_score_codex":0.001861388,"about_ca_system_score_gemma":0.0023967342,"threshold_uncertainty_score":0.06990862},"labels":[],"label_agreement":null},{"id":"W2949180570","doi":"10.24963/ijcai.2019/180","title":"Local Search with Efficient Automatic Configuration for Minimum Vertex Cover","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Youth Innovation Promotion Association of the Chinese Academy of Sciences; Youth Innovation Promotion Association; Chinese Academy of Sciences","keywords":"Computer science; Vertex cover; Configurator; Solver; Cover (algebra); Local search (optimization); Vertex (graph theory); Parametric statistics; Theoretical computer science; Process (computing); Graph; Algorithm; Mathematics","score_opus":0.014976730716252074,"score_gpt":0.2824998663726041,"score_spread":0.26752313565635205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949180570","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10282947,0.00091917085,0.8779164,0.00034624315,0.00008925156,0.00027290435,0.00025162235,0.0060680155,0.011306906],"genre_scores_gemma":[0.6669952,0.00022320997,0.32779312,0.00024634908,0.000041974447,0.00035894342,0.000643594,0.00077194686,0.0029257091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989722,0.00035433355,0.000048473263,0.00021701473,0.00025650082,0.00015146242],"domain_scores_gemma":[0.99825007,0.00096405216,0.00017198884,0.00032643505,0.00019819861,0.00008926349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001144897,0.00090972014,0.0011515077,0.0011489595,0.0006402517,0.0010587822,0.00206246,0.0013358938,0.004816248],"category_scores_gemma":[0.005721199,0.0006009999,0.00075278874,0.0013027838,0.0010019324,0.001803757,0.0017162584,0.0015505708,0.00094787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018834381,0.000132623,0.0011559114,0.00014911273,0.00004312328,0.00015095594,0.00012546509,0.8648243,0.00516481,0.008816774,0.0047262874,0.11452235],"study_design_scores_gemma":[0.000026475998,0.000042087544,0.00010177958,0.000010672315,0.000007683645,0.000034325934,0.000020218778,0.99414486,0.00140955,0.0035587754,0.00063594076,0.0000075711177],"about_ca_topic_score_codex":0.003485653,"about_ca_topic_score_gemma":0.0059211478,"teacher_disagreement_score":0.004816248,"about_ca_system_score_codex":0.001132658,"about_ca_system_score_gemma":0.0012123793,"threshold_uncertainty_score":0.01611191},"labels":[],"label_agreement":null},{"id":"W2949183653","doi":"10.1145/2493132.2462381","title":"Robust geometric spanners","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Robustness (evolution); Treewidth; Computer science; Mathematics; Dimension (graph theory); Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.07011186444677173,"score_gpt":0.30116297992944385,"score_spread":0.23105111548267213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949183653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29203245,0.0012411001,0.6216406,0.00064806023,0.00027561397,0.00015625804,0.00079690875,0.001467679,0.08174132],"genre_scores_gemma":[0.871033,0.00085605594,0.1055048,0.00046028316,0.0002456361,0.00018520783,0.0010659093,0.0003329182,0.020316072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993943,0.000096890275,0.000031099637,0.00020752665,0.00017169422,0.00009847185],"domain_scores_gemma":[0.99846625,0.00041274392,0.0003453594,0.0004500115,0.00014765943,0.0001778604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003304979,0.000641749,0.00047278142,0.0007500166,0.00057427527,0.0010653341,0.0007517934,0.001003575,0.00915419],"category_scores_gemma":[0.0025416985,0.0003544982,0.00053718296,0.0006165404,0.001448665,0.0026545792,0.0022696576,0.0012086072,0.0019453927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011215522,0.000053172127,0.00080664316,0.00021653353,0.000036627956,0.0004073586,0.00018867219,0.029153004,0.041875068,0.8799724,0.004213545,0.04296491],"study_design_scores_gemma":[0.000032945645,0.00025606673,0.0011630743,0.00006409885,0.000040058138,0.0012683732,0.00022132199,0.0707604,0.027807755,0.8674595,0.030878011,0.000048431903],"about_ca_topic_score_codex":0.00011115168,"about_ca_topic_score_gemma":0.00016963124,"teacher_disagreement_score":0.00915419,"about_ca_system_score_codex":0.0003173841,"about_ca_system_score_gemma":0.00017873,"threshold_uncertainty_score":0.030623853},"labels":[],"label_agreement":null},{"id":"W2949183888","doi":"10.48550/arxiv.0911.3803","title":"Twins of rayless graphs","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Genealogy; Combinatorics; Mathematics; Computer science; History","score_opus":0.06093305704776881,"score_gpt":0.3270812670996542,"score_spread":0.2661482100518854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949183888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7383501,0.0006304986,0.21199746,0.00056840305,0.00021949457,0.00013272693,0.00039967234,0.00029344825,0.047408197],"genre_scores_gemma":[0.94543666,0.00039707206,0.04088592,0.00023769085,0.00011386252,0.00011644693,0.0004611173,0.00013454109,0.012216744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987042,0.00033044646,0.00009258426,0.00036046075,0.0002872672,0.00022497086],"domain_scores_gemma":[0.99743724,0.000928896,0.00042236378,0.00040487453,0.00038593885,0.00042062387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006812422,0.00046348636,0.0006087408,0.0017121825,0.0018335773,0.0024356132,0.0009919325,0.00088375085,0.004104556],"category_scores_gemma":[0.004143787,0.0006560514,0.00084298523,0.0007379857,0.002578117,0.0036076885,0.0033625048,0.0014675668,0.0006877702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020139007,0.000042265332,0.002631275,0.000087379674,0.000029708037,0.0005834379,0.0008459966,0.0013935476,0.008813634,0.9736723,0.0011419022,0.010557289],"study_design_scores_gemma":[0.000037314006,0.00008905593,0.0012797434,0.000057020097,0.000077472745,0.0009779474,0.0008540308,0.010891131,0.008463215,0.9664665,0.010774321,0.00003239196],"about_ca_topic_score_codex":0.00072031753,"about_ca_topic_score_gemma":0.00060246064,"teacher_disagreement_score":0.004104556,"about_ca_system_score_codex":0.0006316978,"about_ca_system_score_gemma":0.000411561,"threshold_uncertainty_score":0.013731122},"labels":[],"label_agreement":null},{"id":"W2949221968","doi":"10.1002/jgt.20343","title":"Contractors and connectors of graph algebras","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Hungarian Scientific Research Fund","keywords":"Mathematics; Homomorphism; Graph homomorphism; Combinatorics; Line graph; Discrete mathematics; Algebra homomorphism; Voltage graph; Graph","score_opus":0.019154664229650918,"score_gpt":0.26516413356009655,"score_spread":0.24600946933044562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949221968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7287352,0.0004588496,0.24033305,0.000616771,0.00014406143,0.00011282769,0.00014002011,0.0003415594,0.029117675],"genre_scores_gemma":[0.9805188,0.000189052,0.013967281,0.000100703095,0.00012318531,0.00006661517,0.00009330814,0.00008072543,0.004860372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788636,0.00063347444,0.000120680226,0.00045404898,0.000581545,0.00032389903],"domain_scores_gemma":[0.99576783,0.0015005568,0.0006128299,0.0006695301,0.0006016833,0.0008474557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026829536,0.00046394893,0.00060777756,0.0016865564,0.0017368434,0.003367278,0.0011524179,0.001036146,0.0046340222],"category_scores_gemma":[0.006995447,0.00043235836,0.00093314133,0.0013053176,0.005177035,0.010186419,0.0026945844,0.002049955,0.000526464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020683165,0.00001477153,0.00021979533,0.000009275862,0.000003425983,0.00004839806,0.00018954302,0.0006560957,0.0009171083,0.9958902,0.00011215581,0.0019185385],"study_design_scores_gemma":[0.000022988632,0.000054601984,0.00033431093,0.000012092204,0.0000122209,0.00027206438,0.0003120263,0.012753116,0.0025875808,0.9799953,0.0036144252,0.000029341873],"about_ca_topic_score_codex":0.0009610408,"about_ca_topic_score_gemma":0.00062376214,"teacher_disagreement_score":0.0046340222,"about_ca_system_score_codex":0.0012609354,"about_ca_system_score_gemma":0.0010103346,"threshold_uncertainty_score":0.015502334},"labels":[],"label_agreement":null},{"id":"W2949269876","doi":"10.48550/arxiv.1308.3385","title":"Meyniel's conjecture on the cop number: a survey","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjecture; Combinatorics; Graph; Mathematics; Order (exchange); Constant (computer programming); Collatz conjecture; Discrete mathematics; Computer science; Economics","score_opus":0.11521905486426176,"score_gpt":0.22613452526269748,"score_spread":0.11091547039843572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949269876","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0635141,0.6249194,0.056063637,0.028058244,0.0025175305,0.000068621455,0.00078823854,0.0003206987,0.22374953],"genre_scores_gemma":[0.40482897,0.52891463,0.02607572,0.0047695534,0.00948344,0.00013410966,0.0017176287,0.00030509176,0.02377092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989392,0.00014599325,0.000055902492,0.00042864383,0.00029476546,0.00013561762],"domain_scores_gemma":[0.9963347,0.002621508,0.00018939952,0.00025522636,0.00039573907,0.00020337166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017366293,0.00079552596,0.0013432788,0.0036724813,0.0017808676,0.0032080011,0.0016967584,0.002190564,0.0059649637],"category_scores_gemma":[0.006084024,0.00073635165,0.0006364008,0.004898223,0.0037536067,0.010408353,0.0018401353,0.003457369,0.0015628723],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009319033,0.00009977555,0.0024516382,0.001375676,0.00003850419,0.00016396485,0.00028114577,0.00440383,0.0007165666,0.77278876,0.027332075,0.19025494],"study_design_scores_gemma":[0.000023887449,0.00009420534,0.0027236524,0.00081159413,0.00004058845,0.0009140597,0.00057562854,0.008447949,0.0013953453,0.6603115,0.32457924,0.00008241583],"about_ca_topic_score_codex":0.0020887055,"about_ca_topic_score_gemma":0.0010151037,"teacher_disagreement_score":0.0059649637,"about_ca_system_score_codex":0.002881011,"about_ca_system_score_gemma":0.0012258558,"threshold_uncertainty_score":0.02090323},"labels":[],"label_agreement":null},{"id":"W2949415695","doi":"10.48550/arxiv.1308.0377","title":"Point determining digraphs, $\\{0,1\\}$-matrix partitions, and dualities in full homomorphisms","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Digraph; Combinatorics; Diagonal; Mathematics; Diagonal matrix; Point (geometry); Vertex (graph theory); Matrix (chemical analysis); Homomorphism; Discrete mathematics; Graph; Geometry","score_opus":0.07283567837583571,"score_gpt":0.22538938786909732,"score_spread":0.1525537094932616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949415695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8994998,0.00015659405,0.06937024,0.00051365444,0.000051708623,0.00005081005,0.00031359532,0.00038969883,0.02965387],"genre_scores_gemma":[0.9794755,0.000094746596,0.012359213,0.00010091168,0.00003775378,0.000040385017,0.0002639544,0.000063715735,0.007563918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991891,0.00014012828,0.00003558344,0.000244479,0.00016001321,0.00023076846],"domain_scores_gemma":[0.9980354,0.0006567465,0.00025492528,0.00031757777,0.00019592565,0.0005393905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043231633,0.00043470698,0.00055605813,0.0010357231,0.001818936,0.0024378086,0.00086446985,0.0007274436,0.0073197116],"category_scores_gemma":[0.0022397542,0.00051802443,0.0005766456,0.0007378767,0.0020671445,0.0036669194,0.002418039,0.0017055772,0.00092313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019430672,0.000121574674,0.0015291573,0.000092219445,0.000016801489,0.0003715361,0.0011475183,0.003668149,0.007522883,0.97096,0.0015057671,0.012870073],"study_design_scores_gemma":[0.000066316636,0.000089988716,0.0011424912,0.000019138664,0.000035115725,0.0005194281,0.0006138673,0.018807229,0.00696481,0.96467984,0.007015815,0.00004583799],"about_ca_topic_score_codex":0.0011023433,"about_ca_topic_score_gemma":0.0013062404,"teacher_disagreement_score":0.0073197116,"about_ca_system_score_codex":0.0009263676,"about_ca_system_score_gemma":0.00047922324,"threshold_uncertainty_score":0.0244869},"labels":[],"label_agreement":null},{"id":"W2949460568","doi":"10.14288/1.0043364","title":"The Complexity of the Comparator Circuit Value Problem","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Conjecture; Bipartite graph; Combinatorics; Class (philosophy); Discrete mathematics; Oracle; Complexity class; Comparator; P; Space (punctuation); Time complexity; Graph; Computer science","score_opus":0.19575173089292822,"score_gpt":0.2374048105381054,"score_spread":0.04165307964517717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949460568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5735561,0.002765016,0.31877515,0.019324068,0.00026472533,0.00066996145,0.005269278,0.0013901133,0.07798557],"genre_scores_gemma":[0.93681616,0.0010692201,0.046381086,0.0008835905,0.00033163064,0.00042837684,0.0034939086,0.00023586726,0.010360045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589336,0.0010004056,0.00023212384,0.0009686024,0.0012430473,0.0006624965],"domain_scores_gemma":[0.98661023,0.010630674,0.0007042161,0.0011002957,0.00053751265,0.00041699773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018362787,0.00065420824,0.0011714357,0.0010783004,0.001637567,0.0058482527,0.0023657007,0.002631987,0.011087155],"category_scores_gemma":[0.0153745925,0.00062105415,0.0018916818,0.002078344,0.002925356,0.013006728,0.0029187086,0.0044240286,0.0006455031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006043761,0.00029924922,0.003653076,0.0006421952,0.00016851208,0.00030292833,0.0007828652,0.09220484,0.003533191,0.81997824,0.014295137,0.06353538],"study_design_scores_gemma":[0.00009928506,0.000047610374,0.0009645885,0.00003745866,0.000033605917,0.00017851449,0.00015535366,0.1152845,0.002168766,0.87486935,0.0061331512,0.000027678823],"about_ca_topic_score_codex":0.0028717755,"about_ca_topic_score_gemma":0.0015457768,"teacher_disagreement_score":0.011087155,"about_ca_system_score_codex":0.0045712944,"about_ca_system_score_gemma":0.0024174615,"threshold_uncertainty_score":0.037090182},"labels":[],"label_agreement":null},{"id":"W2949460886","doi":"10.48550/arxiv.1307.7621","title":"Packing Steiner Trees","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Conjecture; Disjoint sets; Graph; Spanning tree; Tree (set theory); Minimum degree spanning tree; Discrete mathematics","score_opus":0.0927021641227326,"score_gpt":0.21549238368014328,"score_spread":0.12279021955741068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949460886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44521353,0.003603233,0.3524153,0.0026399568,0.00079432735,0.00025547046,0.0046453513,0.0019971407,0.18843575],"genre_scores_gemma":[0.76545113,0.0027609502,0.18987268,0.0008886863,0.0003883624,0.00024475376,0.007793871,0.0006264907,0.03197305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902534,0.00014991681,0.000069889276,0.00028657305,0.00023889745,0.00022933695],"domain_scores_gemma":[0.9985335,0.0004044729,0.00021828657,0.00050567725,0.00013903035,0.00019904487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037653808,0.0007490366,0.0012045199,0.0009711574,0.0018892544,0.0018915569,0.0013960539,0.0015702619,0.01968934],"category_scores_gemma":[0.0034128146,0.00096072396,0.00086183264,0.0022846165,0.0011200642,0.0041008233,0.0031830007,0.0017443018,0.0044150404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008460922,0.00022435027,0.0055790693,0.00069950474,0.00015406155,0.0018302008,0.0013353887,0.045241073,0.019486854,0.6841163,0.06081677,0.17967029],"study_design_scores_gemma":[0.00014033432,0.00028122892,0.003982899,0.0001801578,0.0001090029,0.0032607543,0.00084161747,0.1290447,0.012159673,0.75706226,0.09286212,0.00007520379],"about_ca_topic_score_codex":0.00096887455,"about_ca_topic_score_gemma":0.0014841012,"teacher_disagreement_score":0.01968934,"about_ca_system_score_codex":0.00092107285,"about_ca_system_score_gemma":0.000502021,"threshold_uncertainty_score":0.065867424},"labels":[],"label_agreement":null},{"id":"W2949599905","doi":"10.48550/arxiv.1206.4854","title":"Constraint satisfaction parameterized by solution size","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Parameterized complexity; Constraint satisfaction problem; Cardinality (data modeling); Mathematics; Complexity of constraint satisfaction; Constraint satisfaction dual problem; Constraint (computer-aided design); Constraint satisfaction; Combinatorics; Set (abstract data type); Vertex cover; Variable (mathematics); Mathematical optimization; Discrete mathematics; Local consistency; Time complexity; Computer science; Statistics","score_opus":0.07530897034138763,"score_gpt":0.22187996696642703,"score_spread":0.14657099662503942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949599905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3051755,0.0012625743,0.64840806,0.0060036653,0.00009590463,0.0004394829,0.004004261,0.0025031,0.032107495],"genre_scores_gemma":[0.81079763,0.0007196202,0.17471434,0.00063674734,0.00012224779,0.0007354809,0.0035954262,0.00092888065,0.007749525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951251,0.0016113285,0.000283733,0.0014892848,0.0008026144,0.00068784837],"domain_scores_gemma":[0.97888595,0.015247403,0.001795891,0.002772169,0.00080287305,0.0004957479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00224109,0.0011622831,0.001484801,0.00078264,0.00092549244,0.0042265556,0.0025023073,0.0020683361,0.011773759],"category_scores_gemma":[0.029485773,0.0009008384,0.0018193782,0.002485605,0.0016527505,0.007754348,0.0022992208,0.0031361235,0.00093723554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069956004,0.00035522928,0.0048664697,0.00085810444,0.000296705,0.00033014794,0.00067521754,0.7053078,0.0131522715,0.20313162,0.010615316,0.05971153],"study_design_scores_gemma":[0.00010494438,0.000082399674,0.0007380163,0.00004434903,0.00006352936,0.00018204357,0.00014939776,0.77003205,0.00342584,0.2209301,0.0042161625,0.000031302126],"about_ca_topic_score_codex":0.0033478418,"about_ca_topic_score_gemma":0.003890051,"teacher_disagreement_score":0.011773759,"about_ca_system_score_codex":0.0036313965,"about_ca_system_score_gemma":0.0025714955,"threshold_uncertainty_score":0.039387167},"labels":[],"label_agreement":null},{"id":"W2949684529","doi":"10.1137/1.9781611975482.144","title":"On the Spanning and Routing Ratio of Theta-Four","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Computer science; Mathematics; Euclidean distance; Routing (electronic design automation); Graph; Discrete mathematics; Computer network; Artificial intelligence","score_opus":0.10635308016882122,"score_gpt":0.2731127318756878,"score_spread":0.16675965170686657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949684529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5054921,0.008471581,0.30578738,0.0039921487,0.0004491664,0.00019454444,0.0010628682,0.0025047485,0.17204554],"genre_scores_gemma":[0.85202694,0.0028905435,0.12923175,0.00078063476,0.000257797,0.0002155855,0.000914693,0.0007670509,0.012915076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772805,0.0006717847,0.00007057193,0.0005401719,0.00056684547,0.0004226735],"domain_scores_gemma":[0.98942274,0.0074936957,0.00066669536,0.0012319488,0.0007496623,0.0004352957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021182226,0.0011271777,0.0008698232,0.0018368922,0.0010163737,0.0025261755,0.0027198056,0.0010099458,0.009191157],"category_scores_gemma":[0.01703401,0.00051046105,0.00068719883,0.0020540603,0.0017803633,0.0046686507,0.0017729054,0.0020027424,0.0035589577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020029964,0.00028326354,0.0053206924,0.00057547766,0.00016494271,0.0003546413,0.0005789454,0.14810747,0.024383929,0.44320765,0.032408,0.34261203],"study_design_scores_gemma":[0.00015894843,0.00044848456,0.0025533698,0.00017074466,0.0001592048,0.001190915,0.00039025035,0.58409333,0.018957982,0.36908132,0.022712598,0.00008277906],"about_ca_topic_score_codex":0.0019095377,"about_ca_topic_score_gemma":0.0011132006,"teacher_disagreement_score":0.009191157,"about_ca_system_score_codex":0.0020735175,"about_ca_system_score_gemma":0.0010127418,"threshold_uncertainty_score":0.030747473},"labels":[],"label_agreement":null},{"id":"W2949778016","doi":"10.7151/dmgt.2230","title":"Block graphs with large paired domination multisubdivision number","year":2019,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Domination analysis; Mathematics; Block (permutation group theory); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence; Vertex (graph theory)","score_opus":0.009081031418182142,"score_gpt":0.26549238221620197,"score_spread":0.25641135079801985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949778016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.917858,0.00033122025,0.06190624,0.00034164957,0.000024899413,0.00006232067,0.00058138644,0.00018944472,0.018704766],"genre_scores_gemma":[0.97759026,0.00017409935,0.01760666,0.000076482946,0.000022202852,0.00008532598,0.00044615997,0.000030064248,0.0039686626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996426,0.000075663054,0.000016846716,0.000081132814,0.000092577975,0.0000911792],"domain_scores_gemma":[0.998128,0.00083751173,0.00037055108,0.00021064914,0.00016038735,0.0002929671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024295473,0.00025090962,0.00037397494,0.0007142288,0.0006590934,0.00087220385,0.00044349398,0.00037363495,0.0039829584],"category_scores_gemma":[0.0013822028,0.0002773146,0.00024355495,0.0006856851,0.00063072296,0.0015973008,0.0007963694,0.00052530935,0.00032517346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010835245,0.00022643156,0.014044611,0.00039214897,0.00010934593,0.0014703106,0.00069992506,0.07625313,0.097487666,0.73307925,0.008588822,0.06656483],"study_design_scores_gemma":[0.00017806728,0.0003313541,0.01687428,0.00007904612,0.000107742264,0.0021486985,0.00071622257,0.26977488,0.02997549,0.6527152,0.027031071,0.00006781126],"about_ca_topic_score_codex":0.00082113466,"about_ca_topic_score_gemma":0.0019197016,"teacher_disagreement_score":0.0039829584,"about_ca_system_score_codex":0.0006775661,"about_ca_system_score_gemma":0.00038745452,"threshold_uncertainty_score":0.01332432},"labels":[],"label_agreement":null},{"id":"W2949844502","doi":"10.48550/arxiv.1312.5012","title":"The Highly Connected Matroids in Minor-closed Classes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Marsden Fund; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Minor (academic); Characterization (materials science); Class (philosophy); Mathematics; State (computer science); Combinatorics; Graphic matroid; Field (mathematics); Discrete mathematics; Computer science; Pure mathematics; Physics; Algorithm; Artificial intelligence","score_opus":0.06075827200381531,"score_gpt":0.21047176577669133,"score_spread":0.14971349377287602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949844502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7935839,0.00056765333,0.15176342,0.005249177,0.0001841021,0.000099333534,0.0010442889,0.00030143384,0.04720681],"genre_scores_gemma":[0.9777129,0.00028194953,0.01536746,0.00026968445,0.0003611686,0.00005930399,0.0005768907,0.000058115475,0.0053125066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994336,0.000105622734,0.000028209974,0.0002213425,0.00012224358,0.00008892484],"domain_scores_gemma":[0.99718827,0.0010835885,0.0005105673,0.00040451568,0.0002559088,0.00055712275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005686274,0.00047310305,0.00050447945,0.0012120133,0.0013550667,0.003128393,0.0009776582,0.00100388,0.0065364596],"category_scores_gemma":[0.0040831864,0.00044234833,0.0007264775,0.0010073963,0.0026535229,0.006373012,0.001490456,0.0023662928,0.00046390053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000804688,0.000035035704,0.0011225344,0.00006574779,0.00000952514,0.00008903356,0.0003951219,0.0018123613,0.0031439636,0.98657924,0.0017335217,0.004933474],"study_design_scores_gemma":[0.000021117254,0.000031430125,0.0010561598,0.00002028469,0.000009591747,0.00026720602,0.00021876169,0.010779778,0.0014573851,0.98132336,0.004803046,0.000011872476],"about_ca_topic_score_codex":0.0006684781,"about_ca_topic_score_gemma":0.0007559597,"teacher_disagreement_score":0.0065364596,"about_ca_system_score_codex":0.0010059251,"about_ca_system_score_gemma":0.00030933798,"threshold_uncertainty_score":0.02186662},"labels":[],"label_agreement":null},{"id":"W2949906226","doi":"10.1016/j.dam.2014.12.006","title":"The cost of perfection for matchings in graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Combinatorics; Mathematics; Bipartite graph; Matching (statistics); Strong perfect graph theorem; Triangulation; Minimum weight; Cubic graph; Upper and lower bounds; Polygon mesh; Chordal graph; Discrete mathematics; Line graph; 1-planar graph; Graph; Geometry","score_opus":0.015273570900178775,"score_gpt":0.28621066416236846,"score_spread":0.2709370932621897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949906226","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8572538,0.0018984815,0.08724758,0.009328031,0.00036196926,0.000111769215,0.0013439943,0.000587375,0.041867014],"genre_scores_gemma":[0.9830692,0.0008109523,0.009258134,0.00023872918,0.00021163249,0.000056531666,0.0003380228,0.00015960619,0.0058572222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979311,0.0006320184,0.00012767238,0.00027841193,0.0005591618,0.0004717024],"domain_scores_gemma":[0.9674897,0.02398656,0.002146792,0.0029365532,0.0014434453,0.001996893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021957052,0.0006481764,0.0019097705,0.0020460638,0.0014577701,0.004197005,0.0027553209,0.0032590756,0.016486559],"category_scores_gemma":[0.036268707,0.0010482436,0.0008608519,0.0028986547,0.0029699367,0.012986488,0.0025952032,0.0023277316,0.0008078499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014870518,0.00017679237,0.0045152167,0.00053927395,0.00012717991,0.0003297176,0.00045451624,0.101322,0.0033795973,0.82073295,0.013439982,0.05349572],"study_design_scores_gemma":[0.00010170936,0.00013005105,0.0013982299,0.000064938606,0.000102915634,0.00028396116,0.00030479842,0.17114574,0.0015658969,0.8222111,0.0026495191,0.00004111174],"about_ca_topic_score_codex":0.001644527,"about_ca_topic_score_gemma":0.0017883333,"teacher_disagreement_score":0.016486559,"about_ca_system_score_codex":0.0025871966,"about_ca_system_score_gemma":0.0012324061,"threshold_uncertainty_score":0.055153012},"labels":[],"label_agreement":null},{"id":"W2949986906","doi":"10.48550/arxiv.0907.3497","title":"A certifying algorithm for 3-colorability of P5-free graphs","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Natural Sciences and Engineering Research Council of Canada; University of Guelph","funders":"","keywords":"Computer science; Combinatorics; Algorithm; Mathematics","score_opus":0.09121376702777372,"score_gpt":0.3435038505590445,"score_spread":0.25229008353127075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949986906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09608835,0.00022890272,0.8811255,0.001518832,0.0001919979,0.0003163313,0.0008806981,0.013152414,0.006496971],"genre_scores_gemma":[0.53896064,0.0001896858,0.45299783,0.0005177725,0.00010858455,0.00030530393,0.0035256397,0.0010464311,0.0023480537],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974381,0.00035046303,0.00023863118,0.0009161104,0.00056221016,0.0004944567],"domain_scores_gemma":[0.98291045,0.009871592,0.0010182138,0.004071251,0.0015089987,0.00061947934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002274591,0.0011309658,0.0014121049,0.0010391566,0.001765042,0.0026669607,0.0034805043,0.0019621153,0.0069403998],"category_scores_gemma":[0.0140942335,0.00079151377,0.0024669196,0.0012773265,0.0022608086,0.005149466,0.005026095,0.0041971565,0.0017333778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018835168,0.00095524284,0.011998072,0.0013929161,0.00033027265,0.0014775929,0.0016544216,0.119190454,0.063308515,0.18780886,0.04019195,0.56980824],"study_design_scores_gemma":[0.0005441025,0.00037081965,0.0019051414,0.00011483326,0.00026141765,0.001117457,0.0005067479,0.45703748,0.0657895,0.45706943,0.015117802,0.00016512904],"about_ca_topic_score_codex":0.0022792523,"about_ca_topic_score_gemma":0.0020841258,"teacher_disagreement_score":0.0069403998,"about_ca_system_score_codex":0.0015486386,"about_ca_system_score_gemma":0.0029324887,"threshold_uncertainty_score":0.023217916},"labels":[],"label_agreement":null},{"id":"W2950016669","doi":"10.48550/arxiv.1405.3527","title":"On word-representability of polyomino triangulations","year":2014,"lang":"en","type":"preprint","venue":"Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyomino; Combinatorics; Alphabet; Graph; Mathematics; Word (group theory); Combinatorics on words; Transitive relation; Regular polygon; Discrete mathematics; Computer science; Geometry; Linguistics","score_opus":0.0217490484981604,"score_gpt":0.24008088421726628,"score_spread":0.2183318357191059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950016669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7384314,0.00029241084,0.22261702,0.0005759946,0.000090491565,0.00010049859,0.00057382614,0.00036738603,0.036950998],"genre_scores_gemma":[0.91789895,0.00044312837,0.067277454,0.00018186185,0.000068016714,0.00018890815,0.0011697245,0.00022924009,0.012542642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991272,0.00018247857,0.00005271807,0.00023534916,0.00021221489,0.00019000191],"domain_scores_gemma":[0.9970798,0.0012582067,0.0005737025,0.0005049863,0.00031803164,0.00026512446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040067465,0.0004938224,0.0005039921,0.00073683955,0.001187747,0.0019222238,0.0008063791,0.0009344581,0.00856048],"category_scores_gemma":[0.003871244,0.00050750957,0.000795241,0.0010204862,0.00221881,0.002460871,0.0018793931,0.001531528,0.00081080094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002067027,0.00009293144,0.0022368154,0.00015541106,0.000029457531,0.0004863189,0.0014638982,0.027581485,0.013801164,0.9171101,0.0024566434,0.034379113],"study_design_scores_gemma":[0.000051462677,0.000105759136,0.0012072747,0.000059171358,0.00003104883,0.0003555713,0.00092724967,0.051247165,0.0062344423,0.9298706,0.009863131,0.000047109203],"about_ca_topic_score_codex":0.0030149524,"about_ca_topic_score_gemma":0.0035982342,"teacher_disagreement_score":0.00856048,"about_ca_system_score_codex":0.0011251764,"about_ca_system_score_gemma":0.0005186793,"threshold_uncertainty_score":0.028637648},"labels":[],"label_agreement":null},{"id":"W2950068027","doi":"10.48550/arxiv.1310.0340","title":"Complexity of Coloring Graphs without Paths and Cycles","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Complement (music); Characterization (materials science); Induced subgraph; Discrete mathematics; Path (computing); Graph; Physics; Computer science; Chemistry","score_opus":0.13625949017910327,"score_gpt":0.23511716082380074,"score_spread":0.09885767064469747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950068027","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81997997,0.0009294163,0.13500558,0.0056826137,0.00015227708,0.00037633287,0.005656763,0.0021180192,0.030099059],"genre_scores_gemma":[0.924714,0.00074218,0.057000894,0.00058972405,0.0001372512,0.0002706352,0.006159244,0.00052539556,0.009860595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980597,0.00043066937,0.00010199015,0.00051582116,0.00039085597,0.0005009633],"domain_scores_gemma":[0.9885471,0.008659115,0.000782794,0.0008913007,0.0005033631,0.0006163338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009078022,0.001061399,0.0010224828,0.00096072856,0.0014506909,0.0042771767,0.0022720203,0.0017924265,0.010571611],"category_scores_gemma":[0.008607577,0.0008793108,0.0016794892,0.001935846,0.0015482052,0.005958388,0.0019107588,0.002060692,0.00087506033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001732487,0.0007110933,0.023417791,0.0014628584,0.00036731793,0.0009993206,0.0015818259,0.6039661,0.022036655,0.21019302,0.029078407,0.10445312],"study_design_scores_gemma":[0.00028565986,0.00010443938,0.0038373587,0.00005142645,0.00012776816,0.0005197685,0.00051209546,0.61460257,0.0059319898,0.3683964,0.0055754883,0.00005504424],"about_ca_topic_score_codex":0.010885316,"about_ca_topic_score_gemma":0.010152762,"teacher_disagreement_score":0.010885316,"about_ca_system_score_codex":0.0035627596,"about_ca_system_score_gemma":0.002818797,"threshold_uncertainty_score":0.035365522},"labels":[],"label_agreement":null},{"id":"W2950071671","doi":"10.82308/49985","title":"The least-used direction pivot rule on acyclic unique sink orientations","year":2011,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Vancouver Island University; Ministère du Développement Économique, de l’Innovation et de l’Exportation; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Combinatorics; Directed acyclic graph; Mathematics; Exponential function","score_opus":0.03935685852775888,"score_gpt":0.27431352374215706,"score_spread":0.23495666521439817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950071671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113689244,0.0005756243,0.851358,0.00027041443,0.00015635649,0.0002021004,0.0003961465,0.00068395963,0.032668244],"genre_scores_gemma":[0.4416828,0.0010498186,0.53613335,0.00024086284,0.0000929089,0.00035332917,0.00080674095,0.0005238249,0.019116301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989215,0.0002518303,0.00010021579,0.00023896171,0.0003064209,0.00018107683],"domain_scores_gemma":[0.9961649,0.0018142632,0.00037226282,0.0009241384,0.000526291,0.00019810269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012268311,0.00039276414,0.00057139224,0.0010242806,0.001227546,0.0013991751,0.00093083654,0.00061288365,0.0057000183],"category_scores_gemma":[0.006350264,0.00040477983,0.0006370398,0.0010668001,0.0017216933,0.002698729,0.0014114543,0.0012425913,0.0014827859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024335686,0.000061219034,0.002775799,0.00032073472,0.000030280575,0.00040178667,0.00039217455,0.026495565,0.016800122,0.72819537,0.005603115,0.21868064],"study_design_scores_gemma":[0.000086399414,0.00029132701,0.0012468689,0.00016137365,0.00005054526,0.0010991454,0.00053550553,0.10662793,0.045543376,0.78289104,0.061384432,0.00008200691],"about_ca_topic_score_codex":0.0012992381,"about_ca_topic_score_gemma":0.0027542622,"teacher_disagreement_score":0.0057000183,"about_ca_system_score_codex":0.00055279763,"about_ca_system_score_gemma":0.00085908436,"threshold_uncertainty_score":0.01906848},"labels":[],"label_agreement":null},{"id":"W2950074414","doi":"10.48550/arxiv.1310.1845","title":"On triangulating k-outerplanar graphs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Outerplanar graph; Mathematics; Graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.07838541225661151,"score_gpt":0.2205766183609507,"score_spread":0.14219120610433916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950074414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16229647,0.0006918224,0.8131618,0.0004462473,0.00010798046,0.00008954944,0.00024092357,0.00043214127,0.022533095],"genre_scores_gemma":[0.5412242,0.0025443009,0.4358067,0.00037261107,0.00018814075,0.0001584526,0.0014556044,0.000866781,0.017383179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993648,0.00016709589,0.000027146521,0.00015056676,0.00018342007,0.000106975334],"domain_scores_gemma":[0.9983346,0.0007952864,0.00021690517,0.0003166561,0.00021163683,0.00012499177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006185106,0.00081285404,0.0006828776,0.0012342035,0.0015166388,0.0009927787,0.0015666038,0.00092086795,0.0052322284],"category_scores_gemma":[0.0045383754,0.0004832549,0.00086657907,0.0013454035,0.0023587965,0.003104417,0.003391433,0.0016138093,0.0014207495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010974476,0.00005780055,0.001125328,0.0002920144,0.000033449454,0.0004889344,0.00084984605,0.18751837,0.012078062,0.7201619,0.0046770587,0.07260746],"study_design_scores_gemma":[0.00002650054,0.00007015355,0.0002811735,0.000080410646,0.000028181363,0.0003007787,0.00047507032,0.22063278,0.005992384,0.75535804,0.016722303,0.00003234342],"about_ca_topic_score_codex":0.002712304,"about_ca_topic_score_gemma":0.0031529074,"teacher_disagreement_score":0.0052322284,"about_ca_system_score_codex":0.0007229094,"about_ca_system_score_gemma":0.00039490545,"threshold_uncertainty_score":0.0175035},"labels":[],"label_agreement":null},{"id":"W2950178342","doi":"10.48550/arxiv.1309.0225","title":"Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Bounded function; Vertex (graph theory); Chromatic scale; Graph; Order (exchange); Discrete mathematics","score_opus":0.012488788454081549,"score_gpt":0.2677304958011391,"score_spread":0.2552417073470576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950178342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81451607,0.0019561492,0.11006074,0.005524591,0.00020502116,0.000057293924,0.0007464666,0.0006719157,0.066261835],"genre_scores_gemma":[0.9781724,0.0006862302,0.012021792,0.0004392895,0.00013643953,0.00003536521,0.00037924544,0.00011406974,0.00801517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918,0.00011574197,0.000030161124,0.00023038837,0.00019593797,0.00024775593],"domain_scores_gemma":[0.99302727,0.0041125217,0.00041059463,0.0013215748,0.00037265196,0.00075531215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076891115,0.00043186653,0.00075695413,0.00073177944,0.0011301915,0.0022198511,0.0011252151,0.0009906244,0.008057493],"category_scores_gemma":[0.005738843,0.00048332772,0.0008639996,0.0010030268,0.0020078486,0.004160987,0.0014385368,0.0017191848,0.0006170104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088900083,0.00024912166,0.011121247,0.0004034786,0.000049059032,0.00031573785,0.0012340212,0.038023498,0.01588409,0.8697288,0.009916235,0.052185737],"study_design_scores_gemma":[0.00012967318,0.00010745281,0.0048169275,0.00007232441,0.000043707907,0.00027904863,0.0005821644,0.062417332,0.00554659,0.9149266,0.011024475,0.000053665957],"about_ca_topic_score_codex":0.0055417987,"about_ca_topic_score_gemma":0.0068649803,"teacher_disagreement_score":0.008057493,"about_ca_system_score_codex":0.0017766148,"about_ca_system_score_gemma":0.000952135,"threshold_uncertainty_score":0.026955068},"labels":[],"label_agreement":null},{"id":"W2950283919","doi":"10.48550/arxiv.1110.6668","title":"On minor-closed classes of matroids with exponential growth rate","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Exponential function; Mathematics; Rank (graph theory); Base (topology); Matroid; Prime power; Integer (computer science); Zero (linguistics); Minor (academic); Prime (order theory); Mathematical analysis","score_opus":0.06938279682279737,"score_gpt":0.19922687239338066,"score_spread":0.1298440755705833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950283919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7997341,0.001371821,0.1556891,0.0016380324,0.00013370434,0.00013316036,0.0010763911,0.000693827,0.0395298],"genre_scores_gemma":[0.9590066,0.0008342714,0.0207044,0.0003439101,0.0005210337,0.00023734776,0.0018189253,0.0002479246,0.016285433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881774,0.00022213458,0.000054993543,0.00031427914,0.00029687354,0.00029396213],"domain_scores_gemma":[0.99248224,0.0035935552,0.0011552499,0.000484019,0.0007142106,0.0015706402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011363627,0.0011718951,0.0013218555,0.0023825942,0.0018238914,0.0037627476,0.0013318501,0.00092691806,0.006390004],"category_scores_gemma":[0.007635515,0.00079233263,0.0014363048,0.0015106644,0.002620976,0.0048838016,0.0025386226,0.002426398,0.00090409257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004568037,0.0001986214,0.0041796914,0.00017776093,0.00004598671,0.00032225787,0.0010095277,0.012213194,0.007409726,0.94937575,0.005713598,0.018897142],"study_design_scores_gemma":[0.00015736531,0.00024072954,0.0037053223,0.00007147919,0.00003892866,0.0010734801,0.00032456522,0.15109499,0.0029269557,0.83008,0.010211539,0.00007470209],"about_ca_topic_score_codex":0.002194047,"about_ca_topic_score_gemma":0.0014869431,"teacher_disagreement_score":0.006390004,"about_ca_system_score_codex":0.002338611,"about_ca_system_score_gemma":0.0005597448,"threshold_uncertainty_score":0.02137667},"labels":[],"label_agreement":null},{"id":"W2950286736","doi":"10.48550/arxiv.0708.2514","title":"Minimum Cost Homomorphisms to Reflexive Digraphs","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Reflexivity; Mathematics; Computer science; Combinatorics; Discrete mathematics; Business; Algebra over a field; Pure mathematics; Sociology","score_opus":0.09504498766400758,"score_gpt":0.3712476264208572,"score_spread":0.2762026387568496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950286736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19819036,0.0011669237,0.7630461,0.0027404998,0.00018116024,0.0006955876,0.0041454844,0.0026580663,0.027175874],"genre_scores_gemma":[0.6680958,0.0010418383,0.30854562,0.0005769419,0.00022073172,0.00064539415,0.0042718016,0.0003469052,0.01625483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840313,0.00039972583,0.00011464061,0.00058314577,0.00026681522,0.0002325551],"domain_scores_gemma":[0.99596584,0.002320864,0.0003419819,0.0007422095,0.0003147584,0.0003143699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009998645,0.00097274093,0.0008399404,0.000874349,0.0006440053,0.0021946577,0.0018164009,0.0009892946,0.00906093],"category_scores_gemma":[0.006576802,0.00080465357,0.0011516886,0.0011337633,0.0013888136,0.005241715,0.001942707,0.0025113416,0.0008963503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005388904,0.0005034723,0.0015848147,0.0012680755,0.00013827345,0.00038990268,0.0009773403,0.180243,0.009065536,0.59052575,0.01754155,0.1972234],"study_design_scores_gemma":[0.00013256841,0.00014327545,0.0006237175,0.00006154817,0.000059907044,0.00026785917,0.00026802626,0.17714426,0.0041913227,0.80496824,0.012102086,0.00003719053],"about_ca_topic_score_codex":0.0020041533,"about_ca_topic_score_gemma":0.0026476863,"teacher_disagreement_score":0.00906093,"about_ca_system_score_codex":0.0025053406,"about_ca_system_score_gemma":0.0013293067,"threshold_uncertainty_score":0.030311823},"labels":[],"label_agreement":null},{"id":"W2950307179","doi":"10.48550/arxiv.1408.1461","title":"Ordering without forbidden patterns","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Substructure; Graph; Time complexity; Discrete mathematics","score_opus":0.07952086875495745,"score_gpt":0.2255192431905829,"score_spread":0.14599837443562544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950307179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24219438,0.0007492248,0.6784307,0.0029530826,0.0004034013,0.0008077916,0.008790611,0.005985876,0.059685003],"genre_scores_gemma":[0.49487913,0.00040351908,0.4539431,0.0010636301,0.00016149884,0.0003136974,0.012302653,0.0010672892,0.03586551],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976053,0.00031258477,0.00022282847,0.0007816471,0.00059186446,0.00048570847],"domain_scores_gemma":[0.99320626,0.0022083267,0.00054419413,0.0025489563,0.00095300097,0.00053930224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010036783,0.0008427712,0.0010173058,0.0010518242,0.0016510276,0.0024009976,0.0020029587,0.0011197489,0.012684551],"category_scores_gemma":[0.0064430456,0.0007428087,0.0012527584,0.0015465829,0.0012327841,0.0057000425,0.002603397,0.0018025176,0.002326901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018160257,0.000872812,0.011393865,0.0011930682,0.00015175286,0.0013456038,0.0012631366,0.035707027,0.039336685,0.41937393,0.056186248,0.43135983],"study_design_scores_gemma":[0.00016989965,0.00024217906,0.0019284687,0.00011364936,0.000088400375,0.0010521915,0.0005053234,0.12537159,0.031135933,0.7672629,0.07205578,0.00007360827],"about_ca_topic_score_codex":0.002715968,"about_ca_topic_score_gemma":0.0045444826,"teacher_disagreement_score":0.012684551,"about_ca_system_score_codex":0.0014125711,"about_ca_system_score_gemma":0.002628032,"threshold_uncertainty_score":0.042434037},"labels":[],"label_agreement":null},{"id":"W2950371578","doi":"10.48550/arxiv.1507.07581","title":"Testing Consumer Rationality using Perfect Graphs and Oriented Discs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rationality; Axiom; Vertex (graph theory); Reduction (mathematics); Mathematics; Vertex cover; Revealed preference; Combinatorics; Binary number; Planar graph; Time complexity; Mathematical economics; Discrete mathematics; Graph; Arithmetic","score_opus":0.18619599099771478,"score_gpt":0.2585643161157203,"score_spread":0.0723683251180055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950371578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67387563,0.00024340696,0.30730066,0.0027302983,0.00004122226,0.00031299173,0.0020473811,0.0006425111,0.012805913],"genre_scores_gemma":[0.9121766,0.0001980659,0.08422382,0.0002406347,0.000031684256,0.00013494575,0.0012339598,0.00006970142,0.0016905637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934349,0.002953153,0.0004292094,0.0012947746,0.0012803932,0.0006076044],"domain_scores_gemma":[0.9518651,0.03763989,0.0037025681,0.0048340126,0.0009889554,0.00096955866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038976802,0.0008935678,0.0013076657,0.001294447,0.0010515212,0.0033459046,0.0024229565,0.0020014876,0.004094005],"category_scores_gemma":[0.039256286,0.0009509818,0.001761369,0.0022121302,0.0032494352,0.007813079,0.0025692168,0.0019620713,0.00032669262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010550371,0.00040737184,0.009640132,0.00032001888,0.00019226539,0.00059073674,0.0006365015,0.37934127,0.0050575077,0.5510262,0.004613648,0.047119226],"study_design_scores_gemma":[0.00021872712,0.00010892883,0.0013807549,0.00003229328,0.000044978802,0.00021061399,0.00027429452,0.46631896,0.004309651,0.5253859,0.0016738913,0.000040975974],"about_ca_topic_score_codex":0.0060909824,"about_ca_topic_score_gemma":0.004428702,"teacher_disagreement_score":0.0060909824,"about_ca_system_score_codex":0.003085239,"about_ca_system_score_gemma":0.0015381214,"threshold_uncertainty_score":0.02238512},"labels":[],"label_agreement":null},{"id":"W2950389635","doi":"10.48550/arxiv.1104.3283","title":"Practical and Efficient Split Decomposition via Graph-Labelled Trees","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ackermann function; Lexicographical order; Decomposition; Graph; Modular decomposition; Mathematics; Combinatorics; Context (archaeology); Graph factorization; Inverse; Algorithm; Computer science; Discrete mathematics; Voltage graph; Line graph; Pathwidth","score_opus":0.08764214792040059,"score_gpt":0.25423231157142284,"score_spread":0.16659016365102225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950389635","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027163887,0.000109752546,0.9667976,0.00011060217,0.000020780799,0.00006808487,0.0001261365,0.0018754883,0.0037276826],"genre_scores_gemma":[0.20652977,0.00011355041,0.78843486,0.00009716001,0.000022976727,0.00009578358,0.0007791737,0.00042486787,0.0035019026],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992028,0.00015471407,0.000045676377,0.0001920837,0.0002903809,0.00011438425],"domain_scores_gemma":[0.99879164,0.0004992186,0.00008678362,0.00036899326,0.00016513695,0.000088246234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055231043,0.00043454164,0.00054655795,0.0009110529,0.0005746739,0.0011957109,0.0009163635,0.0006286911,0.004350822],"category_scores_gemma":[0.0025386745,0.0004349076,0.0006517609,0.0010930091,0.0008366849,0.0027466817,0.0017546738,0.0011279919,0.0018862454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037716373,0.00017825353,0.0015120413,0.00035943938,0.00004196531,0.00030957788,0.0008305044,0.066351205,0.06269047,0.21537687,0.012316921,0.63965553],"study_design_scores_gemma":[0.00007696014,0.00015095652,0.000728239,0.00004609106,0.000033343276,0.0003783733,0.0002853532,0.5763687,0.04613282,0.35510677,0.020650318,0.000042040738],"about_ca_topic_score_codex":0.001184896,"about_ca_topic_score_gemma":0.002313444,"teacher_disagreement_score":0.004350822,"about_ca_system_score_codex":0.000678906,"about_ca_system_score_gemma":0.0008070359,"threshold_uncertainty_score":0.014554918},"labels":[],"label_agreement":null},{"id":"W2950466444","doi":"10.48550/arxiv.1409.5295","title":"On the Minimum Edge-Density of 4-Critical Graphs of Girth Five","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Klein bottle; Corollary; Mathematics; Combinatorics; Girth (graph theory); Odd graph; Torus; Enhanced Data Rates for GSM Evolution; Graph; Chordal graph; Discrete mathematics; 1-planar graph; Computer science; Geometry","score_opus":0.0598087162081411,"score_gpt":0.22564373212861327,"score_spread":0.16583501592047217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950466444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95103186,0.00093242584,0.032712996,0.0009993252,0.00003995591,0.0000365452,0.00019648953,0.000077504665,0.01397301],"genre_scores_gemma":[0.9896875,0.00043615673,0.008337516,0.000094044226,0.00004767243,0.000049678016,0.00016298368,0.000039852363,0.0011446405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996413,0.0001234413,0.000011473391,0.00006179343,0.00006866044,0.00009338229],"domain_scores_gemma":[0.9941803,0.0040946235,0.00057492574,0.00019222958,0.00033950037,0.00061840203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006888729,0.0005699014,0.00075223227,0.001944968,0.0012572405,0.0012764479,0.0013589328,0.00097584265,0.0030834563],"category_scores_gemma":[0.007587834,0.0005866714,0.00036983387,0.0008617608,0.002515903,0.0019858936,0.0016013326,0.0009091824,0.00030653313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006901489,0.00013300538,0.0140782185,0.00048467956,0.00009501532,0.00078105874,0.001193533,0.076989524,0.024942074,0.84882045,0.007300685,0.024491662],"study_design_scores_gemma":[0.00010457494,0.0001236026,0.0060428632,0.00012572542,0.00006226751,0.0008665784,0.0007633262,0.18370639,0.007461698,0.79713184,0.0035571333,0.000054066353],"about_ca_topic_score_codex":0.0011601731,"about_ca_topic_score_gemma":0.0011192092,"teacher_disagreement_score":0.0030834563,"about_ca_system_score_codex":0.0010942338,"about_ca_system_score_gemma":0.0003868636,"threshold_uncertainty_score":0.010315239},"labels":[],"label_agreement":null},{"id":"W2950539700","doi":"10.48550/arxiv.1407.6761","title":"Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Planar; Treewidth; Constant (computer programming); Minor (academic); Graph; Discrete mathematics; Physics; Pathwidth","score_opus":0.04802291551903676,"score_gpt":0.23271096964705235,"score_spread":0.1846880541280156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950539700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10270257,0.0023152197,0.8273689,0.002009176,0.0002543954,0.00058771233,0.0041262154,0.026196888,0.034438975],"genre_scores_gemma":[0.29525048,0.0009614042,0.6695915,0.00063055294,0.00010509826,0.00057560025,0.013131423,0.0021786226,0.017575262],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988445,0.00009951286,0.00005179209,0.00031751563,0.00030683796,0.0003797574],"domain_scores_gemma":[0.99877876,0.00034565403,0.00009569967,0.00042822812,0.0002093866,0.00014219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043659608,0.002922666,0.0014157662,0.0013517289,0.0009928842,0.0019994634,0.0030836845,0.0011308936,0.021877807],"category_scores_gemma":[0.0022399994,0.00074824184,0.0017152522,0.0026428327,0.0007263487,0.004616456,0.002851242,0.0024155246,0.008790344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022414967,0.0007257488,0.0027576284,0.001338875,0.00019183574,0.00035766975,0.00080703886,0.098296605,0.04345404,0.040418122,0.09047385,0.71893704],"study_design_scores_gemma":[0.00082039426,0.0004939749,0.001822005,0.00015597914,0.0002458656,0.0006779962,0.0006950939,0.8040445,0.031089075,0.11329728,0.04657218,0.00008572078],"about_ca_topic_score_codex":0.010301341,"about_ca_topic_score_gemma":0.014592374,"teacher_disagreement_score":0.021877807,"about_ca_system_score_codex":0.0024874725,"about_ca_system_score_gemma":0.0023140525,"threshold_uncertainty_score":0.07318854},"labels":[],"label_agreement":null},{"id":"W2950552832","doi":"10.48550/arxiv.math/0608672","title":"Factor-Critical Property in 3-Dominating-Critical Graphs","year":2006,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Dominating set; Vertex (graph theory); Mathematics; Neighbourhood (mathematics); Conjecture; Graph; Discrete mathematics","score_opus":0.08527411829881888,"score_gpt":0.2498760844083057,"score_spread":0.1646019661094868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950552832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82260716,0.0011632658,0.13222504,0.0013708287,0.000104242645,0.00015505987,0.0011940057,0.00045958057,0.040720925],"genre_scores_gemma":[0.9800228,0.00044635742,0.014986869,0.0002512432,0.00006367295,0.000054380573,0.00068974146,0.000067110326,0.0034177862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960333,0.000043661847,0.000021557242,0.00014840563,0.00007613731,0.00010687818],"domain_scores_gemma":[0.99783903,0.0009964671,0.00033125587,0.00022635059,0.00024213527,0.00036468843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035024085,0.00049993803,0.0005005207,0.0010701062,0.0012478271,0.0016624825,0.00062700396,0.00068349746,0.0049442425],"category_scores_gemma":[0.0027362627,0.00043967608,0.0006082887,0.0009890576,0.0016125198,0.0021086873,0.0012923768,0.0007242271,0.0005339068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006244363,0.00013021276,0.011634634,0.00055816583,0.00010387756,0.0018927256,0.0025318349,0.023992443,0.044749815,0.85012597,0.014754317,0.048901573],"study_design_scores_gemma":[0.00012519625,0.00016783334,0.0036241182,0.00009910358,0.00010656768,0.0027791571,0.0009447754,0.048632875,0.025443133,0.8855017,0.032509986,0.000065577726],"about_ca_topic_score_codex":0.0029303757,"about_ca_topic_score_gemma":0.0023468204,"teacher_disagreement_score":0.0049442425,"about_ca_system_score_codex":0.0010187188,"about_ca_system_score_gemma":0.00065142935,"threshold_uncertainty_score":0.01654011},"labels":[],"label_agreement":null},{"id":"W2950649163","doi":"10.48550/arxiv.1308.1068","title":"List H-Coloring a Graph by Removing Few Vertices","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Parameterized complexity; Discrete mathematics; Conjecture; Homomorphism; Graph homomorphism; Vertex (graph theory); Graph; Graph power; Line graph","score_opus":0.0736527274133749,"score_gpt":0.21130699010994505,"score_spread":0.13765426269657016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950649163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46913022,0.0002241212,0.5018321,0.001973709,0.0001498055,0.0006123304,0.0034819515,0.004258341,0.018337427],"genre_scores_gemma":[0.7099718,0.00017083585,0.26938075,0.0007602786,0.000078116995,0.00031526817,0.005149491,0.00047536503,0.013698006],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904674,0.00022478956,0.000048207457,0.00035909383,0.00011433128,0.00020679591],"domain_scores_gemma":[0.99523133,0.002093234,0.00032807488,0.0018134534,0.00022876512,0.0003051428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010748289,0.0007503937,0.00077698013,0.00038151824,0.0011870668,0.0014439175,0.0025033823,0.0010739727,0.011826304],"category_scores_gemma":[0.003911391,0.00050369266,0.0009782098,0.00092397927,0.0011793178,0.00585883,0.0017745229,0.00186901,0.0016701516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038924708,0.0017174887,0.01711996,0.0017388494,0.00031823988,0.0014363244,0.0022748047,0.2177659,0.085919894,0.29779553,0.04237533,0.3276452],"study_design_scores_gemma":[0.00064589526,0.00075583125,0.0036640894,0.00009848994,0.000258869,0.0010314508,0.0012639649,0.47040936,0.09909666,0.38872778,0.033939447,0.00010810126],"about_ca_topic_score_codex":0.0029406461,"about_ca_topic_score_gemma":0.0036096864,"teacher_disagreement_score":0.011826304,"about_ca_system_score_codex":0.0012040971,"about_ca_system_score_gemma":0.002022542,"threshold_uncertainty_score":0.03956294},"labels":[],"label_agreement":null},{"id":"W2950818896","doi":"10.48550/arxiv.1107.4824","title":"Approximation Algorithms for Digraph Width Parameters","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Digraph; Pathwidth; Combinatorics; Mathematics; Bounded function; Discrete mathematics; Partial k-tree; Approximation algorithm; Directed graph; Graph","score_opus":0.1534640730755815,"score_gpt":0.23403806709388975,"score_spread":0.08057399401830825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950818896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08263812,0.0014355403,0.8951659,0.0015396972,0.00013340042,0.0002131133,0.001340008,0.0041800574,0.013354171],"genre_scores_gemma":[0.35833192,0.001154852,0.628499,0.0005027072,0.000099280114,0.00036049253,0.0037608778,0.0005308776,0.0067600124],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831796,0.00029039284,0.00010851581,0.00055172894,0.00038121286,0.00035027927],"domain_scores_gemma":[0.99594325,0.0021232117,0.0003299175,0.001112265,0.00025856483,0.00023272466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017099646,0.0018710314,0.0012024598,0.0019493818,0.00085434486,0.0034714625,0.002856246,0.0016956797,0.0063924203],"category_scores_gemma":[0.008472651,0.0009639023,0.0016086893,0.0034655293,0.0008450219,0.00572067,0.0026058918,0.0032974177,0.0015340595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000993097,0.00074489735,0.004795045,0.00069006614,0.00022580664,0.00014367251,0.00056765514,0.3683993,0.012261506,0.12523766,0.024735393,0.46120587],"study_design_scores_gemma":[0.00014502634,0.00007123108,0.0004918419,0.000045109096,0.000085018124,0.00016212466,0.00016109682,0.8513895,0.0043685357,0.13835604,0.004701991,0.000022501708],"about_ca_topic_score_codex":0.0031617065,"about_ca_topic_score_gemma":0.0077756713,"teacher_disagreement_score":0.0063924203,"about_ca_system_score_codex":0.0037386778,"about_ca_system_score_gemma":0.0022838102,"threshold_uncertainty_score":0.027126074},"labels":[],"label_agreement":null},{"id":"W2950941451","doi":"10.48550/arxiv.1707.05252","title":"Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Hypergraph; Euler's formula; Vertex (graph theory); Mathematics; Traverse; Spanning tree; Euler characteristic; Graph; Discrete mathematics; Mathematical analysis; Geography","score_opus":0.0643260378107674,"score_gpt":0.2216052011505142,"score_spread":0.1572791633397468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950941451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6590352,0.0014678229,0.3207616,0.0009873857,0.000043999527,0.00012295382,0.0012197087,0.0003106313,0.016050793],"genre_scores_gemma":[0.87707525,0.0011791069,0.11457187,0.0001795568,0.000070181995,0.00013916513,0.0014076858,0.00011539141,0.0052619013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928147,0.00021840676,0.000050854058,0.00022314646,0.00010050577,0.00012554525],"domain_scores_gemma":[0.99527305,0.0028330158,0.00074182695,0.00041532554,0.0002259249,0.0005109824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007214751,0.0004026157,0.00046003636,0.0012142394,0.0011351979,0.0017009655,0.0006129926,0.0011707124,0.0040661115],"category_scores_gemma":[0.0056893397,0.0006023283,0.0005978471,0.0015969024,0.0017322882,0.005862636,0.0012836374,0.0014161579,0.0002878074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031073726,0.000093094044,0.0058522383,0.00033143203,0.00006596095,0.0010298986,0.0015833513,0.09944453,0.007462628,0.8384145,0.0045658634,0.040845938],"study_design_scores_gemma":[0.000037541326,0.000074853335,0.0028525367,0.00011488577,0.00004235506,0.0012200155,0.0010908814,0.15648244,0.0029170236,0.8240672,0.011051561,0.000048768416],"about_ca_topic_score_codex":0.0014283832,"about_ca_topic_score_gemma":0.0016792086,"teacher_disagreement_score":0.0040661115,"about_ca_system_score_codex":0.0011421208,"about_ca_system_score_gemma":0.0005662029,"threshold_uncertainty_score":0.013602495},"labels":[],"label_agreement":null},{"id":"W2951138970","doi":"10.48550/arxiv.1510.07744","title":"Colourings, Homomorphisms, and Partitions of Transitive Digraphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Transitive relation; Homomorphism; Combinatorics; Transitive reduction; Class (philosophy); Mathematics; Discrete mathematics; Computer science; Graph; Artificial intelligence; Voltage graph; Line graph","score_opus":0.09354078684527288,"score_gpt":0.21550231649353965,"score_spread":0.12196152964826677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951138970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8721116,0.0011709355,0.105846345,0.0034046783,0.00013111834,0.00018157063,0.0019425247,0.00038377682,0.014827378],"genre_scores_gemma":[0.959631,0.0009827238,0.030991914,0.00036077338,0.0002537731,0.00014686602,0.002305153,0.00014194548,0.005185831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713147,0.00077478494,0.0001892432,0.000963467,0.00041451937,0.0005264682],"domain_scores_gemma":[0.9698185,0.021847662,0.0027732656,0.002794165,0.0006738277,0.0020925782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017664767,0.001194771,0.0013693046,0.0020819453,0.0022280738,0.0062181302,0.002420899,0.0024615454,0.008614212],"category_scores_gemma":[0.017963443,0.0010419566,0.0019931071,0.002918589,0.0038109315,0.015341395,0.0029252325,0.004028374,0.00061260397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052732637,0.00042016731,0.007994909,0.00059114106,0.00015220174,0.00056915276,0.0016056608,0.078135245,0.005014251,0.86821586,0.007652009,0.029122066],"study_design_scores_gemma":[0.000060063478,0.00005495652,0.001229405,0.000027498168,0.00004605806,0.00032273383,0.0003280953,0.065190814,0.001337271,0.929322,0.0020434193,0.00003769057],"about_ca_topic_score_codex":0.0027893134,"about_ca_topic_score_gemma":0.003452718,"teacher_disagreement_score":0.008614212,"about_ca_system_score_codex":0.0030872019,"about_ca_system_score_gemma":0.0010598672,"threshold_uncertainty_score":0.028817415},"labels":[],"label_agreement":null},{"id":"W2951243173","doi":"","title":"Small Chvatal rank","year":2007,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Polytope; Mathematics; Facet (psychology); Polyhedron; Context (archaeology); Rank (graph theory); Graph; Set (abstract data type); Integer programming; Integer (computer science); Birkhoff polytope; Discrete mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.12973717833692952,"score_gpt":0.22246036547870088,"score_spread":0.09272318714177136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951243173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2604665,0.0002783782,0.7067246,0.0006297305,0.00013171721,0.000452413,0.0009330725,0.0021811808,0.028202504],"genre_scores_gemma":[0.7402464,0.00013142964,0.24853334,0.00027758072,0.00007287274,0.00040579602,0.0010606862,0.0004620166,0.008809891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824727,0.0002944422,0.00008697288,0.00038712646,0.00063480827,0.00034928747],"domain_scores_gemma":[0.99134564,0.0027851497,0.00061364396,0.0034887257,0.0011582118,0.00060859683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015430416,0.0006290097,0.0011081785,0.0012798967,0.0013897709,0.0016982089,0.0015318007,0.0007832018,0.010473335],"category_scores_gemma":[0.011444334,0.00044747582,0.0011562195,0.00088971877,0.0018858981,0.0028286548,0.0033203491,0.0020733767,0.002196491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011755895,0.00036585593,0.009819843,0.00044482577,0.000098974066,0.00048335327,0.00081389904,0.073539265,0.09238073,0.6071511,0.011122213,0.20260438],"study_design_scores_gemma":[0.00023452207,0.0013642843,0.00384107,0.00008337273,0.000062354986,0.0008181012,0.00052274,0.301455,0.09922453,0.5676805,0.02453812,0.00017538661],"about_ca_topic_score_codex":0.001990078,"about_ca_topic_score_gemma":0.003455666,"teacher_disagreement_score":0.010473335,"about_ca_system_score_codex":0.00078264484,"about_ca_system_score_gemma":0.0021395385,"threshold_uncertainty_score":0.035036802},"labels":[],"label_agreement":null},{"id":"W2951293305","doi":"","title":"Elementary block of plane bipartite graphs","year":2003,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Bipartite graph; Block (permutation group theory); Combinatorics; Plane (geometry); Mathematics; Geometry; Graph","score_opus":0.012443945043523768,"score_gpt":0.21494113112251453,"score_spread":0.20249718607899075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951293305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5659853,0.00050050946,0.14104977,0.0007270906,0.00021605723,0.00042175667,0.0057338644,0.00076442264,0.28460127],"genre_scores_gemma":[0.8573714,0.00052331964,0.03212041,0.00030965975,0.0001231739,0.00035391346,0.0067968033,0.00031093965,0.10209042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996686,0.00007265387,0.000015110335,0.000058725847,0.0000759075,0.00010895836],"domain_scores_gemma":[0.99924505,0.00023776431,0.00011360156,0.00010897152,0.00015471662,0.00013985723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002431967,0.00040496126,0.00065719563,0.0012639017,0.0010822894,0.0019252121,0.00093855715,0.0008015601,0.023996525],"category_scores_gemma":[0.0011053255,0.0003489572,0.0005175311,0.0010781834,0.00063210283,0.001479337,0.0008230539,0.0012564337,0.004471264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021785274,0.00006647226,0.0005270536,0.00012249262,0.00001608808,0.00014330649,0.00017216141,0.003094353,0.004808767,0.96622646,0.010692663,0.013912392],"study_design_scores_gemma":[0.00006899242,0.000074846874,0.0016722126,0.00003683107,0.000035118013,0.00022774245,0.0001588657,0.026133165,0.0038383426,0.9442171,0.023515811,0.000021033253],"about_ca_topic_score_codex":0.00230684,"about_ca_topic_score_gemma":0.00296894,"teacher_disagreement_score":0.023996525,"about_ca_system_score_codex":0.0006585421,"about_ca_system_score_gemma":0.0006382162,"threshold_uncertainty_score":0.08027637},"labels":[],"label_agreement":null},{"id":"W2951395643","doi":"10.48550/arxiv.1109.3741","title":"Immersing complete digraphs","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Digraph; Combinatorics; Eulerian path; Mathematics; Immersion (mathematics); Simple (philosophy); Graph; Degree (music); Discrete mathematics; Physics; Pure mathematics","score_opus":0.15978167917923303,"score_gpt":0.22007362580840445,"score_spread":0.06029194662917142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951395643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46567717,0.00046744174,0.49670315,0.0010088681,0.00015588437,0.00022471863,0.00065840257,0.0005719026,0.03453251],"genre_scores_gemma":[0.8393404,0.00065114273,0.14058276,0.0003002017,0.00005217927,0.00016633715,0.0010818775,0.00014740365,0.017677749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994936,0.00008943437,0.000031506534,0.00019552975,0.00008235805,0.000107685504],"domain_scores_gemma":[0.99876654,0.00050285755,0.00011706398,0.00021293384,0.00009962549,0.00030101396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043539456,0.00074055116,0.0006019705,0.00048742298,0.0012293953,0.0010462432,0.0008778952,0.0010214443,0.007978282],"category_scores_gemma":[0.002749856,0.00063348067,0.0008442163,0.00057464675,0.0017284103,0.0029884614,0.003906558,0.0016116672,0.00085222156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031090184,0.00024102085,0.0020641917,0.0005593048,0.00009341369,0.0014724901,0.0027646592,0.08389788,0.031366203,0.7834562,0.003507336,0.09026641],"study_design_scores_gemma":[0.00010167153,0.00030322818,0.00087866414,0.000120635734,0.00006723027,0.00053628645,0.0013532399,0.09445848,0.015069383,0.84237736,0.044675935,0.000057840716],"about_ca_topic_score_codex":0.0013252167,"about_ca_topic_score_gemma":0.001955277,"teacher_disagreement_score":0.007978282,"about_ca_system_score_codex":0.00070151256,"about_ca_system_score_gemma":0.00042033152,"threshold_uncertainty_score":0.026690066},"labels":[],"label_agreement":null},{"id":"W2951514643","doi":"","title":"Game Brush Number","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Brush; Combinatorics; Mathematics; Vertex (graph theory); Graph; Complete graph; Discrete mathematics","score_opus":0.07064228950838786,"score_gpt":0.2223838940448167,"score_spread":0.15174160453642885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951514643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2905214,0.0007270421,0.6220842,0.002153187,0.00028716525,0.00039572234,0.00043589066,0.0003891186,0.08300622],"genre_scores_gemma":[0.94068515,0.00031839142,0.03873123,0.00030368,0.0000697558,0.00031069363,0.00016927163,0.00007590212,0.01933588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890935,0.00040290607,0.00003688221,0.00024071816,0.00020864153,0.00020145698],"domain_scores_gemma":[0.99628913,0.002294736,0.00039942912,0.00025219514,0.00021715798,0.0005474126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010429765,0.0009754894,0.001115359,0.00057042553,0.0008105418,0.0019464865,0.0016438734,0.0015551939,0.010311866],"category_scores_gemma":[0.010463407,0.00034700488,0.00077460374,0.00035539406,0.0023181625,0.0034985607,0.0014569715,0.0016735739,0.00065104855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014171306,0.000121701945,0.0014812151,0.00011869603,0.000046080913,0.00020845614,0.00030335877,0.09233775,0.0029823137,0.8876149,0.0030033074,0.011640541],"study_design_scores_gemma":[0.000060384136,0.00014166604,0.0006194753,0.00002549433,0.000017058397,0.00017220041,0.00012704203,0.57884645,0.0006342556,0.4130303,0.006293486,0.0000322364],"about_ca_topic_score_codex":0.0023558752,"about_ca_topic_score_gemma":0.0017774954,"teacher_disagreement_score":0.010311866,"about_ca_system_score_codex":0.0021949678,"about_ca_system_score_gemma":0.0010940264,"threshold_uncertainty_score":0.034496665},"labels":[],"label_agreement":null},{"id":"W2951550992","doi":"10.1002/jgt.20086","title":"Circular chromatic index of graphs of maximum degree 3","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Graph; Edge coloring; Bound graph; Graph power; Degree (music); Discrete mathematics; Line graph; Physics","score_opus":0.02337219878357789,"score_gpt":0.27783629775663776,"score_spread":0.2544640989730599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951550992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9538952,0.00025210137,0.016834889,0.0003998501,0.000038799808,0.00003479037,0.00036955462,0.0001939502,0.02798085],"genre_scores_gemma":[0.99457836,0.000096426236,0.0031185464,0.000044417975,0.000021030124,0.000018280665,0.00019950961,0.00003063164,0.0018928656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995142,0.00005869914,0.000018226092,0.00009053164,0.00013358734,0.00018476328],"domain_scores_gemma":[0.99655366,0.001368072,0.00068566063,0.0003938105,0.00047160377,0.0005270976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043665833,0.00023017595,0.00037994428,0.0020182896,0.0012872956,0.0019291735,0.0006561786,0.00045205877,0.006232499],"category_scores_gemma":[0.0025728447,0.0002841051,0.00030886885,0.0016636844,0.0014697193,0.0011938972,0.0008204577,0.00057056826,0.0003665607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020565856,0.00013885243,0.029959438,0.0004183628,0.0001096483,0.0005478932,0.0019516667,0.07075572,0.049837377,0.78477305,0.010698913,0.04875253],"study_design_scores_gemma":[0.00022865215,0.00022659362,0.031095283,0.00009994037,0.00011862147,0.00092789903,0.0012871004,0.25283176,0.024602868,0.6633193,0.025133338,0.00012858275],"about_ca_topic_score_codex":0.006559028,"about_ca_topic_score_gemma":0.007369142,"teacher_disagreement_score":0.006559028,"about_ca_system_score_codex":0.0025304132,"about_ca_system_score_gemma":0.00094714784,"threshold_uncertainty_score":0.020849764},"labels":[],"label_agreement":null},{"id":"W2951570929","doi":"10.48550/arxiv.0812.2734","title":"Asteroids in rooted and directed path graphs","year":2008,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.05878365691958065,"score_gpt":0.20272310439802835,"score_spread":0.1439394474784477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951570929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31791112,0.0018362291,0.61519563,0.00089514465,0.00017282914,0.00020875444,0.001763007,0.0007809929,0.061236337],"genre_scores_gemma":[0.8293271,0.0013471496,0.15658331,0.00032944916,0.00012651492,0.00017673825,0.0017365966,0.00011966477,0.010253393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931896,0.00010915911,0.000061015162,0.00023986177,0.00018258688,0.00008846257],"domain_scores_gemma":[0.9980002,0.0008750326,0.0004004896,0.00022720797,0.00029494875,0.00020213096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044106177,0.00036763618,0.00035843274,0.0014365332,0.0011374967,0.0019309875,0.00077217683,0.00085276936,0.0042897374],"category_scores_gemma":[0.0027560794,0.00043495296,0.0005309825,0.0018524297,0.0016686518,0.004200235,0.0017665202,0.0012654208,0.00074930716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062840154,0.000022886132,0.0008427656,0.00014903053,0.00001647969,0.00042770445,0.0006469894,0.0072752307,0.00437501,0.959117,0.0015973562,0.025466705],"study_design_scores_gemma":[0.000014837876,0.000028191278,0.0006034503,0.000043110755,0.00002068384,0.0005691128,0.00035381998,0.017890155,0.0022329187,0.95870703,0.01951662,0.00001995933],"about_ca_topic_score_codex":0.0017000798,"about_ca_topic_score_gemma":0.0015801439,"teacher_disagreement_score":0.0042897374,"about_ca_system_score_codex":0.0011467339,"about_ca_system_score_gemma":0.0005332886,"threshold_uncertainty_score":0.014350653},"labels":[],"label_agreement":null},{"id":"W2951573614","doi":"10.48550/arxiv.1704.05655","title":"Characterizations and algorithms for generalized Cops and Robbers games","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Algorithm; Computer science; Mathematics","score_opus":0.1143097118518677,"score_gpt":0.2499193171167826,"score_spread":0.13560960526491492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951573614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032855075,0.0004949072,0.9506865,0.000757407,0.00008727982,0.00038171117,0.0005883556,0.000775266,0.013373453],"genre_scores_gemma":[0.2756998,0.0010817557,0.7026843,0.0005800241,0.00025941423,0.0011691238,0.0031819171,0.0008704005,0.014473207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962573,0.00090634706,0.0002755911,0.0009828679,0.00087383774,0.0007039768],"domain_scores_gemma":[0.9952615,0.0024736994,0.0005465242,0.00086673105,0.00053119566,0.00032046888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002132076,0.0022716962,0.0017307322,0.0022251457,0.001521142,0.0059568207,0.004287294,0.002191834,0.008827987],"category_scores_gemma":[0.010466473,0.0010891659,0.0020809628,0.0029685532,0.0025545561,0.011867482,0.0041650357,0.0046996637,0.0019650438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000980986,0.00012818603,0.00071044575,0.00029474762,0.000053321553,0.00008787835,0.00057837076,0.045455247,0.001373377,0.89648026,0.0058429833,0.048897166],"study_design_scores_gemma":[0.000040182917,0.00003237594,0.00018229532,0.00005272634,0.000026520915,0.00009382559,0.0001566891,0.12513603,0.0009071666,0.86520493,0.008138178,0.000029020113],"about_ca_topic_score_codex":0.003597552,"about_ca_topic_score_gemma":0.0042451774,"teacher_disagreement_score":0.008827987,"about_ca_system_score_codex":0.0034849045,"about_ca_system_score_gemma":0.0022520649,"threshold_uncertainty_score":0.029532552},"labels":[],"label_agreement":null},{"id":"W2951604368","doi":"10.48550/arxiv.0707.0226","title":"Star-uniform Graphs","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Star (game theory); Combinatorics; Mathematics; A* search algorithm; Discrete mathematics; Tree-depth; Matching (statistics); Graph; Line graph; Pathwidth; Statistics","score_opus":0.06557293404830593,"score_gpt":0.33126311057641655,"score_spread":0.2656901765281106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951604368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35611105,0.0019110987,0.5603314,0.0008773867,0.00017027296,0.0003052199,0.0040541016,0.000939727,0.075299665],"genre_scores_gemma":[0.86204445,0.0013639228,0.11590653,0.00046793834,0.00017281027,0.00018513564,0.0032874555,0.0001783683,0.016393397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919564,0.00013029491,0.000050145718,0.0003699152,0.0001170676,0.00013689147],"domain_scores_gemma":[0.9985701,0.00042042224,0.00022716737,0.00030147872,0.00028504152,0.00019580344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040282455,0.0005633107,0.0005107638,0.001206056,0.0012280687,0.0011759318,0.0007568063,0.0006083205,0.0072118565],"category_scores_gemma":[0.0021777765,0.000408096,0.00052482565,0.0015860542,0.0012534126,0.0030015593,0.0012845307,0.00065248844,0.0009852893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022604616,0.000050026836,0.0025026556,0.00023261811,0.00004356657,0.00031015498,0.00045563185,0.008796642,0.008714828,0.92458194,0.007866304,0.04621958],"study_design_scores_gemma":[0.000034130768,0.00009721634,0.0026349474,0.00006826821,0.000056099903,0.0011958281,0.00037701355,0.03557187,0.0065557417,0.89266235,0.060713515,0.000032866526],"about_ca_topic_score_codex":0.0011140492,"about_ca_topic_score_gemma":0.0014617501,"teacher_disagreement_score":0.0072118565,"about_ca_system_score_codex":0.0006607915,"about_ca_system_score_gemma":0.00035545928,"threshold_uncertainty_score":0.024126112},"labels":[],"label_agreement":null},{"id":"W2951675595","doi":"10.48550/arxiv.1110.4900","title":"Planar graphs have exponentially many 3-arboricities","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar graph; Planar; Combinatorics; Exponential growth; Projective test; Mathematics; Graph; Colored; Book embedding; Discrete mathematics; Class (philosophy); Outerplanar graph; 1-planar graph; Computer science; Pure mathematics; Pathwidth; Line graph; Artificial intelligence; Mathematical analysis; Computer graphics (images); Sociology","score_opus":0.09411833119335782,"score_gpt":0.20764326287073334,"score_spread":0.11352493167737553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951675595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6924517,0.00576955,0.20203891,0.009805694,0.00032219777,0.00012487055,0.0051493393,0.003632125,0.08070561],"genre_scores_gemma":[0.93535125,0.003234692,0.03519404,0.0014032589,0.00027381783,0.0002579478,0.003139545,0.00069740164,0.020447966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983803,0.00027991345,0.00008474839,0.00034427183,0.00050391845,0.00040690982],"domain_scores_gemma":[0.98797077,0.007903317,0.0010252113,0.0016682907,0.0008735393,0.00055877835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007559619,0.0009321291,0.0010511396,0.0010379822,0.0015465674,0.0034503397,0.0015619084,0.0014865891,0.013413607],"category_scores_gemma":[0.00837549,0.00093873474,0.0013262433,0.001828459,0.0018707598,0.0066642426,0.0031799132,0.003015692,0.002235684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00132918,0.0003051085,0.014144072,0.0013854566,0.00023862996,0.0013332043,0.001052616,0.051493675,0.028885843,0.7320419,0.043635253,0.12415516],"study_design_scores_gemma":[0.00013726501,0.000094184354,0.004726299,0.00014664944,0.0001430478,0.0023758705,0.00038523495,0.056674715,0.009861225,0.8896064,0.035773512,0.00007556127],"about_ca_topic_score_codex":0.0007101947,"about_ca_topic_score_gemma":0.0014588361,"teacher_disagreement_score":0.013413607,"about_ca_system_score_codex":0.0014079382,"about_ca_system_score_gemma":0.00043158603,"threshold_uncertainty_score":0.044873},"labels":[],"label_agreement":null},{"id":"W2951693280","doi":"10.48550/arxiv.1302.2340","title":"On the extension complexity of combinatorial polytopes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Polytope; Extension (predicate logic); Combinatorics; Mathematics; Polyhedron; Matching (statistics); Exponential function; Discrete mathematics; Graph; Computational complexity theory; Computer science; Algorithm","score_opus":0.13837325063371858,"score_gpt":0.23009945500279433,"score_spread":0.09172620436907575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951693280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43802214,0.002641457,0.49240324,0.0043797833,0.00026295419,0.00023894828,0.0012165699,0.00050347217,0.06033151],"genre_scores_gemma":[0.8992285,0.002773876,0.08479352,0.0007795956,0.0006507748,0.00034808627,0.0021105555,0.00030713234,0.0090079345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974004,0.00054293714,0.00010037515,0.0005084105,0.0010300128,0.0004178696],"domain_scores_gemma":[0.98349243,0.012470506,0.0006095625,0.0020361503,0.0007168575,0.0006746135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016392673,0.0009799924,0.0014540816,0.0014860379,0.0011581426,0.0028076463,0.002167398,0.0010082758,0.008616977],"category_scores_gemma":[0.010447082,0.0005892526,0.0020923961,0.0024717506,0.0033064568,0.012130702,0.0047287825,0.0077109705,0.0006411569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000433508,0.00025048826,0.004453929,0.000612189,0.0000883335,0.00055016915,0.0009015664,0.12282291,0.006780931,0.7903929,0.006685483,0.066027686],"study_design_scores_gemma":[0.00003711312,0.00007853574,0.0017187918,0.00006551371,0.00003175992,0.0004173185,0.00015306601,0.13811108,0.0016336949,0.85001427,0.0076999767,0.000038846545],"about_ca_topic_score_codex":0.0010961138,"about_ca_topic_score_gemma":0.00086354074,"teacher_disagreement_score":0.008616977,"about_ca_system_score_codex":0.0018112746,"about_ca_system_score_gemma":0.00068051676,"threshold_uncertainty_score":0.028826654},"labels":[],"label_agreement":null},{"id":"W2951732239","doi":"10.48550/arxiv.math/0406140","title":"The structure and labelled enumeration of K_{3,3}-subdivision-free projective-planar graphs","year":2004,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Subdivision; Combinatorics; Planar; Projective test; Mathematics; Projective plane; Discrete mathematics; Computer science; Pure mathematics; Geometry; Computer graphics (images); Geography","score_opus":0.03678046063136805,"score_gpt":0.20756060523045602,"score_spread":0.17078014459908797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951732239","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9457233,0.00012081802,0.037713982,0.0000990924,0.000007174575,0.000020660305,0.00028631094,0.00010632249,0.015922358],"genre_scores_gemma":[0.98201615,0.00011452628,0.014340204,0.00003287964,0.00000713,0.000026515176,0.0006356209,0.000025112613,0.002801858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998265,0.000031232772,0.000009015728,0.000044870492,0.000036029563,0.00005238198],"domain_scores_gemma":[0.9994486,0.00019238911,0.00014098165,0.00007463347,0.000083878906,0.00005955573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013565771,0.00025850677,0.00022508283,0.0010753139,0.0006288712,0.0009311332,0.0005024224,0.00044472743,0.0026602887],"category_scores_gemma":[0.00079783885,0.00021992234,0.00021723351,0.0009194652,0.00082832895,0.001135039,0.0005535632,0.00036230122,0.00022924076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003301141,0.00014108016,0.017061342,0.0003136121,0.00004397053,0.0012525836,0.0018056558,0.05238023,0.07194525,0.75807744,0.0026446267,0.09400409],"study_design_scores_gemma":[0.000054622928,0.0001640066,0.028879868,0.00009950491,0.000090236885,0.0018959304,0.0011381871,0.15894349,0.036387768,0.7506408,0.021622004,0.00008349505],"about_ca_topic_score_codex":0.0016768617,"about_ca_topic_score_gemma":0.0025594558,"teacher_disagreement_score":0.0026602887,"about_ca_system_score_codex":0.00055407366,"about_ca_system_score_gemma":0.00027767333,"threshold_uncertainty_score":0.00889951},"labels":[],"label_agreement":null},{"id":"W2951736941","doi":"10.48550/arxiv.1503.03572","title":"Almost all 5-regular graphs have a 3-flow","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Conjecture; Discrete mathematics; Graph; Assertion; 1-planar graph; Chordal graph; Computer science","score_opus":0.11297934206482801,"score_gpt":0.23203906278413408,"score_spread":0.11905972071930607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951736941","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9080001,0.0007675741,0.06493934,0.0024287673,0.00009740321,0.00004836975,0.0007696617,0.0006343364,0.0223144],"genre_scores_gemma":[0.9913316,0.00023963113,0.0054522445,0.00041547653,0.000052685074,0.00004264322,0.00040082927,0.00006233007,0.0020025913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912375,0.00022976061,0.000038605333,0.00023132384,0.0001768954,0.00019967298],"domain_scores_gemma":[0.9938699,0.0033711889,0.0009914127,0.0008153357,0.00046911792,0.0004829479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009387272,0.00048358485,0.0006630382,0.0009928368,0.0017670769,0.0018147039,0.0008911348,0.0011971022,0.004557232],"category_scores_gemma":[0.008101639,0.0005127037,0.0009941473,0.00078044744,0.002742758,0.0024584362,0.0012179851,0.0012962876,0.00056473847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012347269,0.00021091416,0.024580587,0.00041877903,0.00017873956,0.0007514233,0.0010686108,0.038694922,0.018132335,0.84713376,0.0139077455,0.053687427],"study_design_scores_gemma":[0.00011206697,0.00017416997,0.009579404,0.0001169681,0.00011200328,0.0012151194,0.00061137724,0.07400522,0.009731177,0.8906413,0.013628017,0.00007323908],"about_ca_topic_score_codex":0.001462743,"about_ca_topic_score_gemma":0.001475199,"teacher_disagreement_score":0.004557232,"about_ca_system_score_codex":0.0009119101,"about_ca_system_score_gemma":0.0005771894,"threshold_uncertainty_score":0.015245438},"labels":[],"label_agreement":null},{"id":"W2951748744","doi":"10.48550/arxiv.1105.4163","title":"The number of points in a matroid with no n-point line as a minor","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Minor (academic); Prime power; Mathematics; Rank (graph theory); Integer (computer science); Line (geometry); Prime (order theory); Point (geometry); Projective plane; Discrete mathematics; Geometry; Computer science; Humanities","score_opus":0.05439467276213062,"score_gpt":0.22114490710934628,"score_spread":0.16675023434721567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951748744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9301998,0.00034897643,0.039746188,0.0018835501,0.000066779554,0.00006738874,0.0015895108,0.00028769628,0.025810156],"genre_scores_gemma":[0.9683309,0.00028638507,0.018487956,0.00013246422,0.000120944525,0.00011822469,0.001107302,0.000066758665,0.011349033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882585,0.0002927168,0.000082217746,0.0002864317,0.0002636926,0.00024901523],"domain_scores_gemma":[0.9953752,0.002070239,0.0009177698,0.00055785367,0.00034595863,0.0007328409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088937895,0.0006758396,0.0007150733,0.0013762513,0.0015557967,0.0031246094,0.0014809564,0.001102692,0.009067548],"category_scores_gemma":[0.004122962,0.000545813,0.0006402975,0.0009959694,0.0025429525,0.003930821,0.0019657193,0.0012048761,0.0016740472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037182637,0.00036399512,0.03695958,0.00090391503,0.00028729372,0.0016703806,0.0023287046,0.030114027,0.09014922,0.73132384,0.015488769,0.086692],"study_design_scores_gemma":[0.0005289321,0.0012756159,0.02595127,0.00018586661,0.00030093957,0.0065804156,0.0022169787,0.12553836,0.08776371,0.69598436,0.053407166,0.000266344],"about_ca_topic_score_codex":0.000705372,"about_ca_topic_score_gemma":0.00079401425,"teacher_disagreement_score":0.009067548,"about_ca_system_score_codex":0.0011620589,"about_ca_system_score_gemma":0.0005129341,"threshold_uncertainty_score":0.030333936},"labels":[],"label_agreement":null},{"id":"W2951827106","doi":"","title":"On Infinite-finite Duality Pairs of Directed Graphs","year":2013,"lang":"en","type":"article","venue":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Royal Military College of Canada","funders":"","keywords":"Antichain; Mathematics; Combinatorics; Duality (order theory); Constraint satisfaction problem; Discrete mathematics; Partially ordered set","score_opus":0.02299426730019268,"score_gpt":0.25768131178639625,"score_spread":0.23468704448620356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951827106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42741773,0.001119476,0.48889813,0.0010845824,0.00015849121,0.00010173528,0.000382951,0.00034085158,0.08049592],"genre_scores_gemma":[0.91638374,0.0005043427,0.077111475,0.00030145046,0.00010504566,0.00011830847,0.00045356876,0.00010055946,0.0049214005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975337,0.0011516879,0.00012239299,0.00041819952,0.00044905642,0.00032504436],"domain_scores_gemma":[0.99430877,0.0038962162,0.00047040274,0.00033113602,0.0005381824,0.00045531557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002128658,0.0005240698,0.00061008625,0.0022920116,0.0020968874,0.0029915045,0.00074551126,0.00080316653,0.0031360027],"category_scores_gemma":[0.0070052054,0.0006715395,0.00087840727,0.0014124614,0.003813233,0.005830525,0.0025007057,0.0029125924,0.000505982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034547807,0.000020006028,0.0003786315,0.00003595193,0.000004885838,0.00013800288,0.00019883922,0.0015486775,0.00094608736,0.99234116,0.00025941635,0.00409383],"study_design_scores_gemma":[0.0000075148523,0.000016616175,0.00015369274,0.000019741607,0.000006425937,0.00012584512,0.00009933508,0.0061996416,0.00088022335,0.99076813,0.0017138848,0.000008799118],"about_ca_topic_score_codex":0.0005481999,"about_ca_topic_score_gemma":0.00060814666,"teacher_disagreement_score":0.0031360027,"about_ca_system_score_codex":0.0015623531,"about_ca_system_score_gemma":0.0006282165,"threshold_uncertainty_score":0.011335731},"labels":[],"label_agreement":null},{"id":"W2951892290","doi":"10.1002/jgt.20302","title":"A Characterization of the degree sequences of 2‐trees","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Degree (music); Characterization (materials science); Vertex (graph theory); Tree (set theory); Graph; Discrete mathematics","score_opus":0.0482485410025316,"score_gpt":0.2735561371976695,"score_spread":0.22530759619513793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951892290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.774646,0.00032592306,0.20962481,0.00029205374,0.00007269147,0.00012261687,0.0014125106,0.0005744819,0.012928962],"genre_scores_gemma":[0.9183945,0.00015854483,0.076992154,0.000085200125,0.000034894903,0.00007702564,0.0013530508,0.00007489671,0.0028297643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996555,0.000047854148,0.000028370738,0.0001028247,0.00010484093,0.000060644994],"domain_scores_gemma":[0.9988588,0.00041838663,0.00023125476,0.00012609066,0.00021435617,0.00015117755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019413744,0.00024945172,0.00023629078,0.0011244403,0.0003784791,0.0010000303,0.00036186422,0.00038444137,0.0026439342],"category_scores_gemma":[0.0017988639,0.00022389894,0.00018576573,0.0008706694,0.00041648737,0.0015306525,0.00062546885,0.00054814003,0.00050444965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010564544,0.0003079396,0.02344328,0.00043045986,0.00003535088,0.0007535399,0.0016898796,0.060377844,0.18128215,0.47981563,0.007615704,0.24319175],"study_design_scores_gemma":[0.00007660093,0.000381474,0.014482218,0.00013961931,0.00003092609,0.002091299,0.0007335454,0.3028299,0.07217271,0.551495,0.055451952,0.00011469864],"about_ca_topic_score_codex":0.00047583843,"about_ca_topic_score_gemma":0.0007855806,"teacher_disagreement_score":0.0026439342,"about_ca_system_score_codex":0.00039642383,"about_ca_system_score_gemma":0.00028615425,"threshold_uncertainty_score":0.008844852},"labels":[],"label_agreement":null},{"id":"W2952000975","doi":"10.48550/arxiv.1109.0562","title":"A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Logical matrix; Binary number; Graph; Mathematics; Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics; Physics; Chemistry; Arithmetic; Quantum mechanics","score_opus":0.09947937265376473,"score_gpt":0.2435869787612181,"score_spread":0.14410760610745338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952000975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6675446,0.0024897198,0.27678445,0.0036456566,0.00030561758,0.00020894146,0.002482434,0.0011547094,0.04538385],"genre_scores_gemma":[0.92183775,0.0012404307,0.06707483,0.0007875572,0.0002070277,0.00038990664,0.0015071637,0.0005313203,0.0064240433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774665,0.00035612594,0.00016165196,0.00062053517,0.0005350536,0.00058006623],"domain_scores_gemma":[0.9802681,0.013309736,0.0018947641,0.0020643235,0.001179635,0.001283433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013265047,0.0013608192,0.0012823837,0.0017699011,0.0029657842,0.003192958,0.0019970187,0.0020164666,0.0070023825],"category_scores_gemma":[0.014956455,0.0013551512,0.0010274344,0.002055747,0.0029133304,0.006025846,0.002687727,0.0034330804,0.0013050751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031585493,0.00037024103,0.015961865,0.001423511,0.00020139928,0.0019278652,0.0026839592,0.055799715,0.08889332,0.7018966,0.015707105,0.111975856],"study_design_scores_gemma":[0.00012220748,0.00043676246,0.0039757495,0.00015948743,0.00012684708,0.0013925835,0.0004199627,0.077798925,0.030861082,0.867906,0.016637549,0.00016283714],"about_ca_topic_score_codex":0.0013094798,"about_ca_topic_score_gemma":0.0014529106,"teacher_disagreement_score":0.0070023825,"about_ca_system_score_codex":0.0012499033,"about_ca_system_score_gemma":0.0011164274,"threshold_uncertainty_score":0.023425281},"labels":[],"label_agreement":null},{"id":"W2952198500","doi":"10.48550/arxiv.1311.7064","title":"On the Relationships between Zero Forcing Numbers and Certain Graph Coverings","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Forcing (mathematics); Upper and lower bounds; Zero (linguistics); Cubic graph; Line graph; Voltage graph; Mathematical analysis","score_opus":0.11205783283402425,"score_gpt":0.21773127407193346,"score_spread":0.10567344123790921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952198500","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7934808,0.00084300083,0.14010078,0.0014192589,0.00009958828,0.00004993931,0.00038246604,0.00030195928,0.0633221],"genre_scores_gemma":[0.97716683,0.0004924529,0.018369185,0.00021780103,0.0001532565,0.00005957899,0.00027549756,0.00010461835,0.0031606122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905354,0.00021136309,0.000053314812,0.00027114124,0.00022419482,0.00018644048],"domain_scores_gemma":[0.9834976,0.012779112,0.0014100444,0.0009755893,0.0005656599,0.00077189703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014206392,0.00055705017,0.0006383501,0.0025724876,0.0016250577,0.0025828972,0.0009278397,0.0010575267,0.004877898],"category_scores_gemma":[0.011373241,0.00047760727,0.0005612016,0.0016627652,0.0053774677,0.005107535,0.0020413974,0.0018587514,0.0004969898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007703172,0.000022736052,0.0019978785,0.00006190717,0.000009079918,0.000106277614,0.00025025418,0.0061627286,0.0026296577,0.9792604,0.0009802389,0.008441808],"study_design_scores_gemma":[0.0000125378265,0.000030124276,0.0011016182,0.000025712752,0.00001103655,0.0002117981,0.00008712593,0.015826259,0.0014250011,0.9794956,0.0017519883,0.000021221633],"about_ca_topic_score_codex":0.00075877627,"about_ca_topic_score_gemma":0.0007952565,"teacher_disagreement_score":0.004877898,"about_ca_system_score_codex":0.0015780479,"about_ca_system_score_gemma":0.0005280723,"threshold_uncertainty_score":0.016318202},"labels":[],"label_agreement":null},{"id":"W2952243533","doi":"10.48550/arxiv.1005.2642","title":"Pebbles and Branching Programs for Tree Evaluation","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Combinatorics; Branching (polymer chemistry); Upper and lower bounds; Tree (set theory); Mathematics; Binary decision diagram; Binary tree; Discrete mathematics; Simple (philosophy); Binary number; Algorithm; Arithmetic","score_opus":0.13205724166628377,"score_gpt":0.25744923355847604,"score_spread":0.12539199189219227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952243533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07650807,0.00047936084,0.90453255,0.0019125273,0.00007154375,0.00018056457,0.00026755998,0.0018573868,0.014190517],"genre_scores_gemma":[0.4772217,0.0006502656,0.508148,0.00088175683,0.00013602946,0.0007620965,0.00078373373,0.0007442463,0.010672153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969619,0.00074952614,0.00018552304,0.0006797375,0.0007667754,0.00065650296],"domain_scores_gemma":[0.99310607,0.005199641,0.00039182694,0.00065232074,0.0004376752,0.00021242561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017515679,0.00093970966,0.0008368244,0.00086826883,0.0015944754,0.0029678433,0.0017069889,0.0015139523,0.007788403],"category_scores_gemma":[0.0106195295,0.00065764174,0.001805133,0.0017201548,0.0042848196,0.0076298197,0.0033404026,0.006203499,0.0009425387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022575585,0.00015523832,0.0010945514,0.00028263679,0.000024839692,0.00011604502,0.0006523945,0.038089655,0.0072855907,0.8893334,0.0025698617,0.060170002],"study_design_scores_gemma":[0.000047544596,0.000073535695,0.00026273265,0.000054903423,0.000029823783,0.00008100715,0.00011859953,0.13523443,0.008267463,0.8492086,0.006589517,0.00003187494],"about_ca_topic_score_codex":0.004123949,"about_ca_topic_score_gemma":0.004363244,"teacher_disagreement_score":0.007788403,"about_ca_system_score_codex":0.0035577521,"about_ca_system_score_gemma":0.0024295498,"threshold_uncertainty_score":0.02605474},"labels":[],"label_agreement":null},{"id":"W2952290346","doi":"10.4230/lipics.socg.2019.14","title":"Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Banff International Research Station for Mathematical Innovation and Discovery; Grantová Agentura České Republiky; Canada Research Chairs; Deutsche Forschungsgemeinschaft","keywords":"Conjecture; Bounded function; Degree (music); Combinatorics; Mathematics; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.11880124555955007,"score_gpt":0.24814766067678265,"score_spread":0.12934641511723258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952290346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8033398,0.0012762155,0.109163225,0.0054240944,0.00019993394,0.00010991016,0.001394639,0.00057568407,0.078516416],"genre_scores_gemma":[0.9660746,0.0006384183,0.026588395,0.0008615505,0.00009636277,0.00010224079,0.0007449825,0.00013795552,0.0047555226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990553,0.00013743628,0.000025849577,0.0003344911,0.00015957945,0.00028735754],"domain_scores_gemma":[0.9929421,0.0042501613,0.00069181185,0.00096941565,0.0005492053,0.00059725787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009109518,0.00089727435,0.00061419705,0.0010871446,0.0020440998,0.0022116494,0.0015517827,0.0016339996,0.0058447546],"category_scores_gemma":[0.0068708966,0.00053656683,0.000727636,0.0012468992,0.002983084,0.004511904,0.0014228156,0.002927006,0.0008251258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005243546,0.0001581276,0.008860661,0.0005666284,0.00007177361,0.0007165799,0.0011380878,0.02446786,0.023275536,0.89598954,0.013424322,0.030806614],"study_design_scores_gemma":[0.00010801499,0.00010100302,0.0036621362,0.0001503896,0.000054540385,0.0011904658,0.0008239842,0.03505548,0.01800171,0.9198028,0.020976255,0.00007325589],"about_ca_topic_score_codex":0.0015479223,"about_ca_topic_score_gemma":0.0018670461,"teacher_disagreement_score":0.0058447546,"about_ca_system_score_codex":0.001568138,"about_ca_system_score_gemma":0.00081969774,"threshold_uncertainty_score":0.019552588},"labels":[],"label_agreement":null},{"id":"W2952349276","doi":"10.48550/arxiv.1611.09536","title":"Restraints Permitting the Largest Number of Colourings","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Bipartite graph; Vertex (graph theory); Mathematics; Graph","score_opus":0.07266757873148916,"score_gpt":0.23625558711239217,"score_spread":0.163588008380903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952349276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8590264,0.0006319361,0.10109549,0.0023431126,0.00018694984,0.00016574594,0.0022738476,0.0015323842,0.032744024],"genre_scores_gemma":[0.932328,0.00033411704,0.05658937,0.00045754763,0.00012971103,0.00026457012,0.0019165195,0.0007474751,0.0072327377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971495,0.0005560324,0.0002399563,0.00088037446,0.0004677819,0.00070634746],"domain_scores_gemma":[0.9778112,0.010819198,0.0026002612,0.0057186955,0.0011342693,0.0019163324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018079206,0.0012550607,0.0016966027,0.0012073484,0.0040260903,0.002295806,0.0034323432,0.0024530278,0.009928747],"category_scores_gemma":[0.02042489,0.0014668006,0.0016304656,0.0016387695,0.0036557193,0.0042128265,0.0029994608,0.0038261497,0.0025283175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033007516,0.0010569479,0.03419663,0.0014239978,0.0004919163,0.0022297176,0.003221791,0.12678696,0.07598543,0.61118746,0.0442444,0.09587392],"study_design_scores_gemma":[0.00029107727,0.0005319302,0.009761698,0.00015180538,0.00017466427,0.0022377972,0.00196541,0.1265121,0.023384482,0.81613445,0.018633494,0.00022109046],"about_ca_topic_score_codex":0.0019083676,"about_ca_topic_score_gemma":0.002884852,"teacher_disagreement_score":0.009928747,"about_ca_system_score_codex":0.0012636846,"about_ca_system_score_gemma":0.0015377641,"threshold_uncertainty_score":0.033214927},"labels":[],"label_agreement":null},{"id":"W2952355925","doi":"10.48550/arxiv.1406.0941","title":"Augmentative Message Passing for Traveling Salesman Problem and Graph\\n Partitioning","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Computer science; Cutting-plane method; 2-opt; Mathematical optimization; Message passing; Graph; Optimization problem; Combinatorial optimization; Context (archaeology); Graph partition; Domain (mathematical analysis); Benchmark (surveying); Theoretical computer science; Mathematics; Algorithm; Parallel computing; Integer programming","score_opus":0.08733762938479313,"score_gpt":0.23904274680149667,"score_spread":0.15170511741670356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952355925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02444677,0.00032596747,0.9659679,0.00071018137,0.000073848685,0.00015831954,0.00012449108,0.0005226695,0.007669868],"genre_scores_gemma":[0.36017746,0.0005187341,0.6286242,0.00029134154,0.00014942448,0.0004489642,0.00039966276,0.00022229526,0.009167853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991628,0.00039846773,0.000027770335,0.00015538406,0.0001496276,0.000106050575],"domain_scores_gemma":[0.9973356,0.0018504472,0.00022870682,0.0003450519,0.00014496427,0.0000952305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016152498,0.0012380589,0.0009392067,0.00075028784,0.00068267755,0.0012791065,0.0016978679,0.0014019401,0.0061815316],"category_scores_gemma":[0.006554586,0.00043106655,0.0008361513,0.0011042661,0.0011554555,0.0032213053,0.0015076826,0.002126954,0.0007633406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024165573,0.00021090035,0.00047991195,0.00029893336,0.000045723194,0.00015623982,0.00027513373,0.68710965,0.0037817596,0.1647818,0.008163524,0.13445477],"study_design_scores_gemma":[0.000025533092,0.00006766167,0.0000704578,0.0000150305295,0.000012586451,0.00003877251,0.00003172809,0.9447613,0.0012294764,0.049896058,0.0038435503,0.000007870182],"about_ca_topic_score_codex":0.0031245572,"about_ca_topic_score_gemma":0.0032171798,"teacher_disagreement_score":0.0061815316,"about_ca_system_score_codex":0.001250282,"about_ca_system_score_gemma":0.0010579736,"threshold_uncertainty_score":0.020679295},"labels":[],"label_agreement":null},{"id":"W2952555057","doi":"10.26686/wgtn.12212528","title":"Certifying non-representability of matroids over prime fields","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund","keywords":"Matroid; Prime (order theory); Mathematics; Computer science; Combinatorics","score_opus":0.06243789805997328,"score_gpt":0.35538502633549324,"score_spread":0.29294712827551994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952555057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.620599,0.00069797074,0.33997053,0.004724938,0.00037710604,0.00025526385,0.001046163,0.0043268544,0.028002337],"genre_scores_gemma":[0.96870875,0.0002597613,0.026600895,0.00021966493,0.00023912605,0.00006374089,0.0006275863,0.00015951911,0.0031208952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551636,0.001062758,0.00033854152,0.0009899867,0.0013600878,0.00073216413],"domain_scores_gemma":[0.96661884,0.020117706,0.0042894855,0.0065079597,0.0016803772,0.000785713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026049204,0.00089872937,0.0011489082,0.00082183135,0.0013656749,0.0048152013,0.0018110591,0.001920982,0.007693863],"category_scores_gemma":[0.028338159,0.0008120527,0.001051417,0.0014333574,0.0035246275,0.008138962,0.003761402,0.0036818413,0.0013156848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023818093,0.0005775352,0.015687045,0.001467845,0.000377651,0.002582043,0.0017572613,0.16064562,0.04731057,0.53902566,0.017725138,0.21046196],"study_design_scores_gemma":[0.00022190956,0.00042338556,0.0018693932,0.00012461373,0.000110863875,0.0019302458,0.0003805511,0.19612773,0.032809358,0.75785893,0.008057092,0.00008591843],"about_ca_topic_score_codex":0.0008704143,"about_ca_topic_score_gemma":0.0008500747,"teacher_disagreement_score":0.007693863,"about_ca_system_score_codex":0.0017426801,"about_ca_system_score_gemma":0.0018626384,"threshold_uncertainty_score":0.025738537},"labels":[],"label_agreement":null},{"id":"W2952565476","doi":"10.55016/ojs/cdm.v5i2.62032","title":"The Cops and Robber game on graphs with forbidden (induced) subgraphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fédération Wallonie-Bruxelles; Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematical economics; Computer science; Mathematics","score_opus":0.012035481921575131,"score_gpt":0.2990309502276869,"score_spread":0.2869954683061118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952565476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6664141,0.00027443646,0.31594157,0.00081495737,0.000040644358,0.00018761528,0.0006410497,0.00029142373,0.015394187],"genre_scores_gemma":[0.93870926,0.0003317796,0.055198997,0.00014613464,0.000039094066,0.000196402,0.0005484292,0.00012915698,0.0047008316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990376,0.00032435838,0.00004893293,0.00021532275,0.00013438288,0.00023943593],"domain_scores_gemma":[0.99358565,0.004249484,0.00084666855,0.00041297975,0.00020090396,0.00070439465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092273863,0.0008242559,0.0012151992,0.0007158885,0.00089552096,0.0014927697,0.0016460889,0.0012301274,0.0033424876],"category_scores_gemma":[0.0070432397,0.0004490356,0.0006965605,0.0007394813,0.0020206277,0.004327794,0.0012970084,0.0014691834,0.00027422712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009881048,0.00033167386,0.0026801184,0.00039645258,0.00011605212,0.00078300637,0.00083948264,0.26052102,0.014009292,0.68932873,0.005162092,0.024844011],"study_design_scores_gemma":[0.00012796573,0.00017780247,0.0012127741,0.000030320814,0.000044815617,0.0002653535,0.0002298585,0.519146,0.0032178266,0.47284743,0.002661997,0.000037740654],"about_ca_topic_score_codex":0.0024068926,"about_ca_topic_score_gemma":0.0024150284,"teacher_disagreement_score":0.0033424876,"about_ca_system_score_codex":0.0013104966,"about_ca_system_score_gemma":0.0008449245,"threshold_uncertainty_score":0.011181712},"labels":[],"label_agreement":null},{"id":"W2952648278","doi":"10.48550/arxiv.1505.04235","title":"Triangulating planar graphs while keeping the pathwidth small","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pathwidth; Planar graph; Outerplanar graph; Combinatorics; Mathematics; Planar; Planar straight-line graph; 1-planar graph; Discrete mathematics; Graph; Line graph; Computer science","score_opus":0.1652076121399514,"score_gpt":0.22358768163761225,"score_spread":0.058380069497660864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952648278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20238362,0.0006533582,0.7697301,0.0011977829,0.00012658439,0.0001493879,0.00034671213,0.0012743233,0.024138054],"genre_scores_gemma":[0.47625282,0.0015237896,0.50868136,0.00044333664,0.0001686108,0.0001924744,0.0011618074,0.00077603624,0.010799744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929523,0.00014851616,0.000035180467,0.00020344464,0.00019812118,0.00011950429],"domain_scores_gemma":[0.99747664,0.0010012821,0.00032551,0.00084458414,0.00021132574,0.00014068632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005687469,0.0008577282,0.00071024924,0.0007300145,0.001069384,0.0011743635,0.0017835958,0.0009271857,0.0053795725],"category_scores_gemma":[0.0039616227,0.00078946975,0.0009581157,0.000998683,0.0015598217,0.004297555,0.0032940062,0.0021618807,0.0013697878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003753732,0.0001147576,0.0017403169,0.0010165006,0.00014072898,0.00073913817,0.0007207172,0.2720609,0.07206947,0.4369221,0.0091728745,0.20492719],"study_design_scores_gemma":[0.000105090294,0.00017695698,0.0006076304,0.00012867106,0.00013499692,0.0007663275,0.0007607991,0.31743774,0.045515593,0.596393,0.037919346,0.00005384519],"about_ca_topic_score_codex":0.0015622022,"about_ca_topic_score_gemma":0.0024173432,"teacher_disagreement_score":0.0053795725,"about_ca_system_score_codex":0.00064337096,"about_ca_system_score_gemma":0.0005507877,"threshold_uncertainty_score":0.01799649},"labels":[],"label_agreement":null},{"id":"W2952658105","doi":"10.48550/arxiv.1009.3502","title":"Simultaneous Interval Graphs","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interval graph; Combinatorics; Chordal graph; Indifference graph; Pathwidth; Split graph; Bipartite graph; Cograph; Mathematics; Maximal independent set; Discrete mathematics; Interval (graph theory); Vertex (graph theory); Graph; 1-planar graph; Line graph","score_opus":0.056219126773442096,"score_gpt":0.22186823967991592,"score_spread":0.16564911290647383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952658105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057461556,0.0009842206,0.9181785,0.0011802046,0.0002991929,0.0003776957,0.0017597562,0.0014616506,0.018297244],"genre_scores_gemma":[0.4548925,0.001344667,0.51803267,0.0009842853,0.00043442682,0.00054726476,0.0076898104,0.0007192125,0.015355098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721473,0.00047577303,0.00014216216,0.0012583735,0.00057003135,0.00033897322],"domain_scores_gemma":[0.993909,0.0031149741,0.00067971036,0.001400543,0.00057253055,0.00032322548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011348877,0.0012806661,0.0013608426,0.001316951,0.001900959,0.0032238555,0.0032584283,0.002057021,0.013441155],"category_scores_gemma":[0.007808511,0.0008375787,0.0020484233,0.0034902506,0.0018014961,0.009950572,0.0033334787,0.0037827452,0.0022484097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005183786,0.00026301647,0.0015038714,0.0008446435,0.00011402351,0.00040364036,0.000910617,0.046560828,0.0064649344,0.6428907,0.020354493,0.2791708],"study_design_scores_gemma":[0.00007172805,0.00015372998,0.0006094713,0.00009526851,0.00007771266,0.0006366054,0.0005605663,0.11411432,0.005337203,0.83091354,0.04737009,0.000059778453],"about_ca_topic_score_codex":0.002278605,"about_ca_topic_score_gemma":0.0016703717,"teacher_disagreement_score":0.013441155,"about_ca_system_score_codex":0.0015858156,"about_ca_system_score_gemma":0.0011145422,"threshold_uncertainty_score":0.04496509},"labels":[],"label_agreement":null},{"id":"W2952697189","doi":"10.48550/arxiv.1101.2630","title":"Minimum degree condition forcing complete graph immersion","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Disjoint sets; Complement graph; Graph power; Line graph","score_opus":0.1731671707257376,"score_gpt":0.23352034678209177,"score_spread":0.06035317605635418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952697189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71416533,0.00066885725,0.19037561,0.0061420742,0.0002574529,0.00019504993,0.001532955,0.00090918306,0.08575351],"genre_scores_gemma":[0.9599191,0.0003267966,0.024410143,0.00055256905,0.00018451801,0.00012082156,0.001027999,0.0001377317,0.013320318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987469,0.0001995143,0.000052769465,0.00044684715,0.00030318464,0.00025091445],"domain_scores_gemma":[0.9950035,0.0025332049,0.0003537538,0.00061959325,0.00064579264,0.0008441106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075927144,0.0006171827,0.00085485453,0.0008613995,0.0012785188,0.001615539,0.0010033753,0.0016328418,0.0069663418],"category_scores_gemma":[0.0061040325,0.00063014973,0.001210766,0.00063024886,0.0023784416,0.0039670905,0.0046369755,0.0036533875,0.0006923384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029078862,0.00010246047,0.0019855862,0.00028294994,0.000047187335,0.00059299805,0.0015316842,0.014264632,0.017958663,0.9435359,0.006113651,0.013293533],"study_design_scores_gemma":[0.00008403593,0.00012516088,0.0011170265,0.000032675707,0.000025823505,0.0003727861,0.00039207953,0.043778706,0.005965124,0.93689704,0.011178443,0.000031036354],"about_ca_topic_score_codex":0.0015279935,"about_ca_topic_score_gemma":0.0018370023,"teacher_disagreement_score":0.0069663418,"about_ca_system_score_codex":0.0020402991,"about_ca_system_score_gemma":0.00060458377,"threshold_uncertainty_score":0.02330476},"labels":[],"label_agreement":null},{"id":"W2952726132","doi":"10.1016/j.ejc.2018.02.027","title":"Maximum colored trees in edge-colored graphs","year":2019,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College Saint-Jean","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Ministère de l'Éducation Nationale","keywords":"Colored; Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Materials science; Artificial intelligence","score_opus":0.01409644265845204,"score_gpt":0.24717553546455168,"score_spread":0.23307909280609965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952726132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44082448,0.001339519,0.5055852,0.0022704946,0.00029827518,0.00019992655,0.002148345,0.0012838539,0.046049956],"genre_scores_gemma":[0.79485923,0.0012277421,0.17995429,0.0007638205,0.00019703366,0.00024976634,0.0020941999,0.00065023877,0.020003747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986702,0.0003648433,0.00007459149,0.0003166571,0.00024780008,0.00032585507],"domain_scores_gemma":[0.9915523,0.0056358804,0.0006498136,0.00053499686,0.00068050507,0.000946526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011407455,0.0008025794,0.0011127536,0.0020334658,0.0019322259,0.0049267425,0.0022242279,0.0021063825,0.008663171],"category_scores_gemma":[0.008216972,0.0015880232,0.001130857,0.0030323307,0.0017324449,0.005182411,0.0026023102,0.0022512614,0.0012207028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004164215,0.0001745525,0.0023717298,0.00058610813,0.00007433692,0.00048022196,0.00088128267,0.02776881,0.0125096515,0.9145274,0.0084972475,0.031712286],"study_design_scores_gemma":[0.00006422589,0.000029378856,0.0008924977,0.00009608202,0.000056459146,0.000298635,0.00021655453,0.05602704,0.0033237867,0.93439585,0.004575257,0.000024262361],"about_ca_topic_score_codex":0.0020628152,"about_ca_topic_score_gemma":0.003986111,"teacher_disagreement_score":0.008663171,"about_ca_system_score_codex":0.0018037483,"about_ca_system_score_gemma":0.0012143668,"threshold_uncertainty_score":0.028981209},"labels":[],"label_agreement":null},{"id":"W2952752670","doi":"10.48550/arxiv.1605.03203","title":"Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Rounding; Combinatorics; Spanning tree; Degree (music); Approximation algorithm; Constant (computer programming); Mathematical optimization; Minimum spanning tree; Reduction (mathematics); Lagrangian relaxation; Discrete mathematics; Computer science","score_opus":0.06834909232928307,"score_gpt":0.2194286375278627,"score_spread":0.15107954519857963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952752670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03892685,0.00045297947,0.9540815,0.0003719926,0.000057441503,0.000117216645,0.00021899454,0.00032078425,0.005452344],"genre_scores_gemma":[0.32337302,0.0006808617,0.667874,0.00026512644,0.00010959708,0.00030095037,0.00078558223,0.0004789652,0.0061318767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990023,0.00027822534,0.000041301177,0.00023595705,0.00028752867,0.00015473171],"domain_scores_gemma":[0.9985102,0.00083684543,0.00015016797,0.00025104548,0.00016203523,0.0000896781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010460848,0.0013892171,0.0011072446,0.00059921254,0.00047473525,0.0010849687,0.0023925412,0.0011633332,0.005407479],"category_scores_gemma":[0.004589814,0.00074311026,0.0009544134,0.0015773891,0.0007931462,0.0030594696,0.0018774531,0.0020246683,0.00091744197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014272393,0.00016357901,0.00058496575,0.00029287714,0.00005572554,0.00013310616,0.00012872137,0.8517334,0.003489386,0.05110597,0.0051468303,0.08702279],"study_design_scores_gemma":[0.000016700453,0.000036876372,0.00010145331,0.00001850593,0.000011003777,0.00004452791,0.000027705815,0.96332973,0.0010071225,0.033645585,0.0017547626,0.000006100164],"about_ca_topic_score_codex":0.0033028868,"about_ca_topic_score_gemma":0.0035640767,"teacher_disagreement_score":0.005407479,"about_ca_system_score_codex":0.0011250399,"about_ca_system_score_gemma":0.0009597309,"threshold_uncertainty_score":0.01808983},"labels":[],"label_agreement":null},{"id":"W2952856253","doi":"","title":"Reconfiguration of Dominating Sets","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Graph; Control reconfiguration; Adjacency list; Domination analysis; Discrete mathematics; Connected dominating set; Computer science","score_opus":0.078056358029308,"score_gpt":0.22691487864325507,"score_spread":0.14885852061394705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952856253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20319842,0.0024728759,0.7533138,0.0017537824,0.00039135496,0.00048668787,0.00097570434,0.0010437287,0.03636364],"genre_scores_gemma":[0.73270524,0.0015223199,0.24991262,0.00053716364,0.00023382028,0.0003472326,0.0013215049,0.00028797658,0.013132171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779046,0.00060135266,0.00012791296,0.00081677805,0.00033489574,0.000328557],"domain_scores_gemma":[0.99520326,0.0023876743,0.0005860523,0.0010129052,0.00030534057,0.0005047295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012977275,0.0011298448,0.0014874225,0.0009944513,0.001356332,0.002244197,0.0026577068,0.0012781097,0.0047990554],"category_scores_gemma":[0.006518703,0.0008449511,0.0015903588,0.0016701571,0.0013834718,0.004438251,0.0024967492,0.0014893954,0.00077702163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052542,0.00033701363,0.002207973,0.0009421659,0.00023502047,0.000807869,0.00081300066,0.56768376,0.022128653,0.25864917,0.0088425325,0.13682745],"study_design_scores_gemma":[0.00016608408,0.00056543516,0.0010792894,0.0000955526,0.00011715224,0.0011305123,0.00036168168,0.61482257,0.010773443,0.33503512,0.03579447,0.000058692956],"about_ca_topic_score_codex":0.0009622597,"about_ca_topic_score_gemma":0.0009233279,"teacher_disagreement_score":0.0047990554,"about_ca_system_score_codex":0.00171445,"about_ca_system_score_gemma":0.00067980436,"threshold_uncertainty_score":0.016054511},"labels":[],"label_agreement":null},{"id":"W2952863668","doi":"10.48550/arxiv.1410.7676","title":"The densest matroids in minor-closed classes with exponential growth rate","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Matroid; Mathematics; Finite field; Prime power; Integer (computer science); Rank (graph theory); Constant (computer programming); Function (biology); Exponential function; Finite set; Prime (order theory); Minor (academic); Discrete mathematics; Mathematical analysis","score_opus":0.043225620052471304,"score_gpt":0.19808401154318214,"score_spread":0.15485839149071084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952863668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79188454,0.0008948934,0.18369015,0.0011163297,0.00006107699,0.0001054336,0.0007663457,0.00056746183,0.020913856],"genre_scores_gemma":[0.9567209,0.000526157,0.0305645,0.00017314129,0.00025416625,0.00017911266,0.00079674204,0.00017649896,0.010608734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886584,0.00020134622,0.000058337486,0.0003092157,0.0003126593,0.0002525881],"domain_scores_gemma":[0.9912839,0.0036657813,0.0014937556,0.000985086,0.0010085178,0.0015629535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012553046,0.00082410633,0.00097601925,0.0018558874,0.0012002576,0.004059571,0.0016272732,0.0008168754,0.0034752898],"category_scores_gemma":[0.010797008,0.0008331704,0.0012463494,0.0012000764,0.002452517,0.005147912,0.0021600924,0.0023807588,0.0005939478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026995028,0.0000868327,0.0029639003,0.00014400724,0.000027260083,0.00012879336,0.0008906821,0.0117985625,0.010062994,0.9533762,0.0026224954,0.0176284],"study_design_scores_gemma":[0.000067388326,0.00015168608,0.004180543,0.00007191314,0.000037893682,0.0007856124,0.0003165405,0.14670739,0.010796564,0.8274833,0.009331038,0.00007011736],"about_ca_topic_score_codex":0.0017443325,"about_ca_topic_score_gemma":0.001364885,"teacher_disagreement_score":0.004059571,"about_ca_system_score_codex":0.0024250387,"about_ca_system_score_gemma":0.0007555691,"threshold_uncertainty_score":0.017594993},"labels":[],"label_agreement":null},{"id":"W2952930798","doi":"10.48550/arxiv.1308.2843","title":"The robber strikes back","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Carleton University; St. Francis Xavier University","funders":"","keywords":"Bipartite graph; Combinatorics; Vertex (graph theory); Graph; Mathematics; Discrete mathematics; Computer science","score_opus":0.08252482297315175,"score_gpt":0.2111936004055462,"score_spread":0.12866877743239444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952930798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47688958,0.0012197564,0.405924,0.006688949,0.00096642727,0.00046138192,0.0011217946,0.00068285735,0.106045134],"genre_scores_gemma":[0.9039727,0.00052070926,0.055031415,0.0009396519,0.00020059715,0.0002615524,0.00047665474,0.00025934156,0.03833747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840695,0.000389086,0.000051920004,0.00050781504,0.00019637954,0.00044794436],"domain_scores_gemma":[0.9975485,0.0010227698,0.00033721369,0.00032428873,0.00014917103,0.00061808276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077587477,0.0014410458,0.0016503856,0.00072096236,0.0019903528,0.0019169579,0.0025827042,0.002782798,0.016071966],"category_scores_gemma":[0.0055284207,0.00065223384,0.0010788209,0.0004915876,0.0026674124,0.0048962873,0.00250851,0.0026968329,0.0015427808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002507983,0.00057102635,0.003881831,0.00092930876,0.0004749166,0.003296592,0.0011234019,0.25832132,0.02114994,0.6348951,0.02956145,0.043287035],"study_design_scores_gemma":[0.0001788273,0.0007387246,0.0018207415,0.00012113165,0.00014399811,0.0012205312,0.0010847029,0.57772404,0.005399844,0.3832677,0.028169654,0.00013009107],"about_ca_topic_score_codex":0.0043598786,"about_ca_topic_score_gemma":0.0038485168,"teacher_disagreement_score":0.016071966,"about_ca_system_score_codex":0.0014862062,"about_ca_system_score_gemma":0.00086825603,"threshold_uncertainty_score":0.05376613},"labels":[],"label_agreement":null},{"id":"W2952959002","doi":"10.48550/arxiv.0709.3126","title":"Induced forests in regular graphs with large girth","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Girth (graph theory); Combinatorics; Mathematics","score_opus":0.05086317177513819,"score_gpt":0.3203814492806558,"score_spread":0.2695182775055176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952959002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50950336,0.0010486885,0.4769642,0.0007259012,0.000050604474,0.00012297562,0.0005272298,0.0008367791,0.010220206],"genre_scores_gemma":[0.9353085,0.00057304197,0.059686467,0.00016854104,0.00009842093,0.00019048054,0.00055944297,0.00021981266,0.003195315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985637,0.00049853337,0.000058386177,0.00032416926,0.0002905419,0.00026472993],"domain_scores_gemma":[0.9732421,0.021735478,0.0018309971,0.0016768749,0.00075461535,0.00075991545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001306539,0.000403227,0.0005933786,0.0011871838,0.0007028014,0.0015614935,0.0009915181,0.0009789211,0.002241398],"category_scores_gemma":[0.01453601,0.0005865881,0.00073446473,0.0010608637,0.001965315,0.0029528867,0.0010720693,0.0012531255,0.00036336418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059754367,0.0001867699,0.010625232,0.00052881433,0.00012463515,0.0008931933,0.00069107633,0.30028254,0.03475938,0.5976099,0.0040751253,0.049625732],"study_design_scores_gemma":[0.00004883098,0.000090221525,0.0029502427,0.000038620125,0.000044485158,0.00064413913,0.000115776595,0.39412916,0.006777671,0.591952,0.0031774307,0.000031373933],"about_ca_topic_score_codex":0.00077282276,"about_ca_topic_score_gemma":0.0015000806,"teacher_disagreement_score":0.002241398,"about_ca_system_score_codex":0.0010271916,"about_ca_system_score_gemma":0.0005679636,"threshold_uncertainty_score":0.0074982643},"labels":[],"label_agreement":null},{"id":"W2953051110","doi":"10.48550/arxiv.1504.06586","title":"A Lex-BFS-based recognition algorithm for Robinsonian matrices","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Changchun Institute of Applied Chemistry; Universitat Politècnica de Catalunya; Università degli Studi G. d'Annunzio Chieti - Pescara; Université Paris Diderot; Universitetet i Bergen; Università degli Studi di Firenze; Tel Aviv University; Technische Universität Berlin; Sapienza Università di Roma; Uniwersytet Warszawski; Albert-Ludwigs-Universität Freiburg; Weizmann Institute of Science; Eidgenössische Technische Hochschule Zürich; Technische Universiteit Eindhoven; Institut national de recherche en informatique et en automatique (INRIA); University of Leicester; Centre National de la Recherche Scientifique; University of Oxford; Université du Québec en Outaouais; Princeton University","keywords":"Combinatorics; Lexicographical order; Recursion (computer science); Adjacency matrix; Enumeration; Simple (philosophy); Mathematics; Matrix (chemical analysis); Adjacency list; Similarity (geometry); Interval (graph theory); Algorithm; Tree (set theory); Computer science; Discrete mathematics; Graph; Artificial intelligence","score_opus":0.13374642092011313,"score_gpt":0.24275036420840104,"score_spread":0.10900394328828791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953051110","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01976367,0.0001875842,0.9695263,0.00025512034,0.0000756375,0.00014150339,0.0006115978,0.0049842144,0.004454294],"genre_scores_gemma":[0.08415716,0.0001050665,0.90823674,0.00014863328,0.000037899732,0.00011447707,0.00192855,0.00037853426,0.004893001],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926394,0.00010342118,0.00008515262,0.00022020785,0.00023594007,0.000091299946],"domain_scores_gemma":[0.9988133,0.0003586557,0.000108047505,0.00027264564,0.00038017367,0.00006723143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005307811,0.0008831287,0.00074798235,0.0014871095,0.0006818755,0.0012485422,0.0013407493,0.00084005244,0.0089161275],"category_scores_gemma":[0.0037439032,0.00043844894,0.0008011986,0.0017851152,0.0006722279,0.0029753381,0.0013378419,0.001380258,0.004538774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044448976,0.00023004912,0.0014598066,0.0003060252,0.000042185206,0.00020499664,0.00031896995,0.031694572,0.048246887,0.073388204,0.026008299,0.8176554],"study_design_scores_gemma":[0.0001592362,0.0003484971,0.0007450844,0.00006914448,0.000049144164,0.000815383,0.00038112665,0.7273456,0.04834843,0.18472777,0.03691711,0.000093477465],"about_ca_topic_score_codex":0.0033094424,"about_ca_topic_score_gemma":0.0049367812,"teacher_disagreement_score":0.0089161275,"about_ca_system_score_codex":0.00093475595,"about_ca_system_score_gemma":0.001685822,"threshold_uncertainty_score":0.029827476},"labels":[],"label_agreement":null},{"id":"W2953104796","doi":"10.48550/arxiv.math/0606469","title":"Semisymmetric Graphs from Polytopes","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of New Brunswick","funders":"","keywords":"Polytope; Business; Combinatorics; Computer science; Mathematics","score_opus":0.04428529211623256,"score_gpt":0.2971751022415443,"score_spread":0.25288981012531175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953104796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7076258,0.0003583447,0.16492733,0.0005203907,0.00023680564,0.00010469865,0.0005187471,0.00058838626,0.1251196],"genre_scores_gemma":[0.9546874,0.0002725633,0.027971396,0.00016993044,0.000098261764,0.00006465567,0.0004839543,0.00015899024,0.016092936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997875,0.00004001104,0.000010845961,0.00005100184,0.00006975354,0.00004097996],"domain_scores_gemma":[0.99965096,0.000070112,0.0000714594,0.00006833885,0.000050461178,0.00008869093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015962674,0.00034010122,0.00022698773,0.0006815991,0.0006433869,0.0010741987,0.00033375222,0.00035967372,0.007644091],"category_scores_gemma":[0.000564636,0.0002584979,0.00038500823,0.00029807864,0.0011094967,0.0013304093,0.0011894606,0.0007990112,0.00073803455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038379087,0.00001224556,0.00015035237,0.00004481342,0.0000045538864,0.00015517937,0.00016153917,0.0018035963,0.0071024015,0.98269504,0.0010104183,0.006821362],"study_design_scores_gemma":[0.000022444301,0.00004659552,0.00072781,0.000023403796,0.000009145212,0.00059281406,0.00024983674,0.010258527,0.0062890975,0.9679942,0.013767275,0.000018776911],"about_ca_topic_score_codex":0.00042258724,"about_ca_topic_score_gemma":0.0006588042,"teacher_disagreement_score":0.007644091,"about_ca_system_score_codex":0.00050120556,"about_ca_system_score_gemma":0.00020433246,"threshold_uncertainty_score":0.025572002},"labels":[],"label_agreement":null},{"id":"W2953110844","doi":"10.48550/arxiv.math/0202052","title":"A classification of plane and planar 2-trees","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Planar; Plane (geometry); Computer science; Mathematics; Geometry; Computer graphics (images)","score_opus":0.08731393709567446,"score_gpt":0.3101359359801462,"score_spread":0.22282199888447174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953110844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7120714,0.002707147,0.18055767,0.0014896006,0.00026205744,0.00012754851,0.0012581163,0.00015669341,0.101369716],"genre_scores_gemma":[0.908216,0.0017810735,0.063235916,0.00036099966,0.000245244,0.000115717194,0.0015219918,0.00010358054,0.024419572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997905,0.000023228544,0.000014566971,0.00004484188,0.00008223251,0.00004473002],"domain_scores_gemma":[0.9996346,0.00010613729,0.00006517052,0.000032478427,0.00009476903,0.00006685204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025378374,0.00022669078,0.0002538382,0.0015097448,0.000701441,0.001344797,0.00064131676,0.001017063,0.004942751],"category_scores_gemma":[0.0010512727,0.0001655563,0.00039838604,0.0009279422,0.0008290147,0.00261127,0.0005334017,0.000790827,0.00057980896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000121658395,0.000009640202,0.0015503067,0.000050932904,0.000002895022,0.00008950843,0.00024396692,0.0019575804,0.004969223,0.9751046,0.0014340462,0.014575255],"study_design_scores_gemma":[0.000018721299,0.000046094578,0.006014499,0.00008374045,0.000013430799,0.0013262206,0.00044828636,0.0670656,0.0038059396,0.88571644,0.035409823,0.00005115613],"about_ca_topic_score_codex":0.0011540651,"about_ca_topic_score_gemma":0.0013192577,"teacher_disagreement_score":0.004942751,"about_ca_system_score_codex":0.0007793761,"about_ca_system_score_gemma":0.00027855206,"threshold_uncertainty_score":0.016535103},"labels":[],"label_agreement":null},{"id":"W2953175718","doi":"10.48550/arxiv.1409.6952","title":"A 0.821-ratio purely combinatorial algorithm for maximum $k$-vertex cover in bipartite graphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Vertex cover; Bipartite graph; Combinatorics; Bounded function; Cover (algebra); Greedy algorithm; Vertex (graph theory); Mathematics; Approximation algorithm; Combinatorial algorithms; Discrete mathematics; Algorithm; Graph","score_opus":0.05102069242716498,"score_gpt":0.22248638255844194,"score_spread":0.17146569013127697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953175718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07397202,0.00082432275,0.8960472,0.0014151694,0.00020496074,0.0003793731,0.0004340931,0.005546002,0.021176856],"genre_scores_gemma":[0.36544427,0.00035027292,0.62523264,0.0005971159,0.0002279002,0.00051998295,0.0010839019,0.0007350894,0.0058088815],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970041,0.0010461797,0.00015444402,0.0005302276,0.0008773074,0.00038779262],"domain_scores_gemma":[0.9931005,0.0044751144,0.00043952864,0.0014182152,0.00032024606,0.00024628954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024894597,0.0017236796,0.0013976037,0.0014718322,0.0011796177,0.003113611,0.0044846833,0.0025865568,0.009096932],"category_scores_gemma":[0.014304654,0.0007692541,0.0014802022,0.002396536,0.0015166793,0.004923071,0.0027275146,0.0026517615,0.0032243072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029704503,0.0014535225,0.0038579933,0.0010995384,0.00025086,0.0003120388,0.0003462903,0.3100449,0.044475693,0.13629586,0.029730583,0.4691622],"study_design_scores_gemma":[0.0003653919,0.00045114994,0.0010977826,0.000052288015,0.00008495216,0.00050836283,0.000083960986,0.8968477,0.010981142,0.084394276,0.005064278,0.000068709145],"about_ca_topic_score_codex":0.0013294062,"about_ca_topic_score_gemma":0.0023218598,"teacher_disagreement_score":0.009096932,"about_ca_system_score_codex":0.0026949213,"about_ca_system_score_gemma":0.0026988548,"threshold_uncertainty_score":0.030432224},"labels":[],"label_agreement":null},{"id":"W2953189329","doi":"10.48550/arxiv.1612.06473","title":"Sorting Networks On Restricted Topologies","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Sorting network; Sorting; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Line graph; Computer science; Sorting algorithm; Algorithm","score_opus":0.09646893039623879,"score_gpt":0.23207899575908034,"score_spread":0.13561006536284154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953189329","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46207538,0.0012066234,0.47930235,0.0021147465,0.00012690565,0.00019794595,0.002298782,0.0019094277,0.05076782],"genre_scores_gemma":[0.8643335,0.0014974308,0.117949374,0.00045526426,0.0001215211,0.0003201862,0.0016321657,0.00024287893,0.013447761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989686,0.00022144617,0.000080010126,0.00033868453,0.0002234688,0.00016767076],"domain_scores_gemma":[0.9955048,0.002426109,0.0005919117,0.0008011499,0.0003696389,0.0003063231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061588525,0.00049139035,0.0006269161,0.0012613528,0.00090744987,0.0019354444,0.0009857472,0.0010027388,0.0073945047],"category_scores_gemma":[0.00586292,0.0005018031,0.0005363684,0.0018160613,0.001183153,0.005904653,0.0016948009,0.0010740929,0.0008622187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005585509,0.000092998904,0.0023636553,0.0005514169,0.00008336534,0.00038499216,0.00034719583,0.27871892,0.022227306,0.61382014,0.006528854,0.07432265],"study_design_scores_gemma":[0.00006204741,0.00010977979,0.0014780418,0.0000660306,0.000056253524,0.00055162085,0.00023604246,0.2974022,0.008836129,0.6701687,0.020993952,0.000039228802],"about_ca_topic_score_codex":0.0013353913,"about_ca_topic_score_gemma":0.0020050968,"teacher_disagreement_score":0.0073945047,"about_ca_system_score_codex":0.0014424537,"about_ca_system_score_gemma":0.0006227808,"threshold_uncertainty_score":0.02473706},"labels":[],"label_agreement":null},{"id":"W2953233053","doi":"10.48550/arxiv.1009.0358","title":"Dichotomy for tree-structured trigraph list homomorphism problems","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Graph homomorphism; Combinatorics; Algebra homomorphism; Mathematics; Partition (number theory); Tree (set theory); Discrete mathematics; Time complexity; Class (philosophy); Computer science; Graph; Line graph; Voltage graph","score_opus":0.0667668106424947,"score_gpt":0.21711699562087675,"score_spread":0.15035018497838204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953233053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59740514,0.001810832,0.29916677,0.013322867,0.0003505386,0.00029840044,0.0038595984,0.0019306939,0.0818551],"genre_scores_gemma":[0.93578357,0.000906841,0.046601325,0.0014449189,0.00054615916,0.00028056142,0.0036149921,0.00021114526,0.010610452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856216,0.00041766287,0.00008411237,0.00037230446,0.0002882719,0.0002754096],"domain_scores_gemma":[0.9927695,0.005491253,0.0004934536,0.00050397945,0.0002834955,0.00045838865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011482872,0.00050180143,0.00090660196,0.00102479,0.0017489926,0.004209749,0.0013359567,0.0017805218,0.013980386],"category_scores_gemma":[0.0073713646,0.00035944936,0.0009961335,0.0014637621,0.0017061797,0.009778851,0.0017110516,0.004254904,0.0015974962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005214539,0.000694278,0.0020620914,0.00068056415,0.00006199216,0.00043102188,0.00095344544,0.023857333,0.0054303957,0.888351,0.025401188,0.05155525],"study_design_scores_gemma":[0.00007130838,0.00005733342,0.0005695516,0.000032776446,0.000020046486,0.00024232168,0.00024893176,0.04891088,0.0017150519,0.9449882,0.0031218035,0.000021862345],"about_ca_topic_score_codex":0.0007271864,"about_ca_topic_score_gemma":0.00089745014,"teacher_disagreement_score":0.013980386,"about_ca_system_score_codex":0.0018054886,"about_ca_system_score_gemma":0.001033788,"threshold_uncertainty_score":0.046769083},"labels":[],"label_agreement":null},{"id":"W2953294211","doi":"10.1002/jgt.22174","title":"Finding a subdivision of a prescribed digraph of order 4","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canada Research Chairs; Agence Nationale de la Recherche","keywords":"Digraph; Subdivision; Combinatorics; Mathematics; Mathematical proof; Vertex (graph theory); Discrete mathematics; Reduction (mathematics); Time complexity; Order (exchange); Graph","score_opus":0.032089115078952526,"score_gpt":0.3273542662692229,"score_spread":0.2952651511902704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953294211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8444136,0.0002259556,0.13956352,0.00058211095,0.000050115126,0.000151305,0.00069642824,0.00040003972,0.013916893],"genre_scores_gemma":[0.9231479,0.00010675866,0.07014188,0.000081593775,0.000014573676,0.000030970685,0.001095347,0.000033875378,0.0053471224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965584,0.000042695803,0.000027998694,0.00012280013,0.000055033703,0.00009562544],"domain_scores_gemma":[0.9986721,0.00057782466,0.00015641557,0.00027118617,0.00012057339,0.0002018385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027866894,0.00022099479,0.00059904973,0.00056268094,0.0008822924,0.00119022,0.0007409962,0.00077814306,0.003949828],"category_scores_gemma":[0.002025257,0.00031921818,0.00062934787,0.00055000425,0.0008897006,0.0017867254,0.0007923364,0.0008142351,0.00033711843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010623184,0.0004904273,0.046383798,0.00093261135,0.00018253367,0.0020119178,0.002819088,0.20050251,0.089483924,0.4402466,0.010776953,0.2051073],"study_design_scores_gemma":[0.00010259146,0.00042406673,0.01095892,0.0001851095,0.00013618512,0.0014199959,0.0021341206,0.4191115,0.035445366,0.49783894,0.03216091,0.0000822672],"about_ca_topic_score_codex":0.003988274,"about_ca_topic_score_gemma":0.005238891,"teacher_disagreement_score":0.003988274,"about_ca_system_score_codex":0.0011681486,"about_ca_system_score_gemma":0.00089619274,"threshold_uncertainty_score":0.013213456},"labels":[],"label_agreement":null},{"id":"W2953303033","doi":"10.48550/arxiv.1401.1870","title":"Homological face-width condition forcing $K_6$-minors in graphs on surfaces","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Face (sociological concept); Projective plane; Combinatorics; Mathematics; Graph; Plane (geometry); Surface (topology); Minor (academic); Geometry; Discrete mathematics; Pure mathematics; Art; Humanities; Linguistics","score_opus":0.08058807267128272,"score_gpt":0.23182592583715972,"score_spread":0.151237853165877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953303033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9186352,0.00024573467,0.050239813,0.0009350045,0.00015505744,0.000036471076,0.00023919446,0.00048849214,0.029025082],"genre_scores_gemma":[0.98280644,0.00012866907,0.010948125,0.00018456091,0.00011957255,0.00003764362,0.0003582406,0.0001627153,0.0052539273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933463,0.000105657804,0.000039252314,0.0001785648,0.00016392967,0.00017797895],"domain_scores_gemma":[0.99769694,0.0010373218,0.00024014711,0.00036497082,0.00025752478,0.0004031434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058974366,0.0005740148,0.00075416523,0.0009447352,0.0013469113,0.0020436388,0.0010826781,0.0011615299,0.006906945],"category_scores_gemma":[0.0035251381,0.00054535666,0.0011106239,0.000489095,0.0022862593,0.0029865552,0.0031169844,0.0021623159,0.0008266431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044286708,0.000087005326,0.0033512753,0.00019707323,0.000041172047,0.00073373097,0.0013223486,0.007236467,0.029590547,0.9373473,0.0036723674,0.015977843],"study_design_scores_gemma":[0.000056861776,0.00011630508,0.00223858,0.000027663289,0.00003469049,0.0006178475,0.00074435567,0.016054297,0.011800455,0.9605852,0.0076701567,0.000053540527],"about_ca_topic_score_codex":0.00093350007,"about_ca_topic_score_gemma":0.0010205572,"teacher_disagreement_score":0.006906945,"about_ca_system_score_codex":0.0009072497,"about_ca_system_score_gemma":0.00037490623,"threshold_uncertainty_score":0.023106098},"labels":[],"label_agreement":null},{"id":"W2953528653","doi":"10.3390/a12080153","title":"γ-Graphs of Trees","year":2019,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Vertex (graph theory); Graph; Dominating set; Product (mathematics); Cartesian coordinate system; Tree (set theory)","score_opus":0.014962383509411167,"score_gpt":0.2805596362697304,"score_spread":0.26559725276031926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953528653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14879833,0.0014787315,0.8055324,0.0013161363,0.00021300973,0.00042711804,0.0021648686,0.0008408036,0.03922865],"genre_scores_gemma":[0.3872148,0.0019187607,0.58776635,0.0010294592,0.00015820924,0.0004410013,0.0046489974,0.0003511127,0.016471261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988399,0.00025948285,0.000092146336,0.00043188658,0.00024232245,0.00013423871],"domain_scores_gemma":[0.9959984,0.001761916,0.0005389332,0.0005810191,0.00082730886,0.0002924678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077398284,0.0005572097,0.0005586594,0.0017014934,0.0014226042,0.0024071569,0.0009733467,0.0007358624,0.006259041],"category_scores_gemma":[0.0058825323,0.00060721824,0.0010007027,0.0019598447,0.0018367053,0.005317373,0.002030187,0.0015367469,0.0012953498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101201535,0.000035255478,0.0017737496,0.00023394334,0.000038532184,0.00022908919,0.000818914,0.00887801,0.0046592657,0.93956727,0.0056467894,0.038018063],"study_design_scores_gemma":[0.000016488662,0.000045032313,0.0009228318,0.00007645643,0.000035971985,0.0007315073,0.00044581972,0.015144622,0.003094648,0.9335249,0.045941755,0.000019974052],"about_ca_topic_score_codex":0.0014673504,"about_ca_topic_score_gemma":0.0014696032,"teacher_disagreement_score":0.006259041,"about_ca_system_score_codex":0.0008821873,"about_ca_system_score_gemma":0.0007086408,"threshold_uncertainty_score":0.020938635},"labels":[],"label_agreement":null},{"id":"W2955375576","doi":"10.48550/arxiv.1803.06216","title":"Approximating Dominating Set on Intersection Graphs of Rectangles and\\n L-frames","year":2018,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Diagonal; Combinatorics; Mathematics; Intersection (aeronautics); Approximation algorithm; Line segment; Dominating set; Logarithm; Line (geometry); Discrete mathematics; Geometry; Graph; Mathematical analysis","score_opus":0.07268630673581478,"score_gpt":0.22945216330501103,"score_spread":0.15676585656919625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955375576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38267845,0.0031585097,0.5794361,0.0027714022,0.00029519995,0.00045511627,0.0051267645,0.0039255633,0.02215289],"genre_scores_gemma":[0.5920854,0.0011405149,0.38863075,0.0006899424,0.00018898617,0.00038344393,0.008101167,0.00075710483,0.008022665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979426,0.0004919747,0.00009863255,0.00070835644,0.00035696648,0.00040135204],"domain_scores_gemma":[0.99585426,0.0024077457,0.00044986617,0.00061477016,0.00026443167,0.00040906505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00152342,0.002390806,0.0023942788,0.0014494178,0.0012865057,0.0026302026,0.0034210554,0.0013953482,0.005512256],"category_scores_gemma":[0.009061137,0.0009777271,0.0018047249,0.0032188059,0.0010523745,0.0048532677,0.0029945879,0.0020160798,0.0012100881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019537648,0.00042473408,0.004309153,0.0012017257,0.0003231464,0.0005630307,0.0012262389,0.7283586,0.01036657,0.09279167,0.021631487,0.13684995],"study_design_scores_gemma":[0.00013767538,0.00018767902,0.00080784,0.000081952036,0.000088013476,0.00031431278,0.0003872438,0.89815336,0.00458946,0.0889402,0.006278216,0.000034038785],"about_ca_topic_score_codex":0.0062607136,"about_ca_topic_score_gemma":0.007047857,"teacher_disagreement_score":0.0062607136,"about_ca_system_score_codex":0.003313911,"about_ca_system_score_gemma":0.0015680827,"threshold_uncertainty_score":0.024044216},"labels":[],"label_agreement":null},{"id":"W2955563424","doi":"10.1016/j.tcs.2019.05.031","title":"On the complexity of the k-kernel problem on cyclically k-partite digraphs","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Digraph; Combinatorics; Mathematics; Kernel (algebra); Integer (computer science); Vertex (graph theory); Discrete mathematics; Bipartite graph; Graph; Computer science","score_opus":0.025252963076736835,"score_gpt":0.27816583279390467,"score_spread":0.2529128697171678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955563424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8312812,0.0015796168,0.10779051,0.012282023,0.00028336816,0.0002873484,0.0052415244,0.0010941932,0.040160142],"genre_scores_gemma":[0.9605656,0.00090590207,0.023491913,0.00061535876,0.00047509215,0.00018683715,0.003329141,0.00045319885,0.009976934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966904,0.0009875405,0.00017031426,0.0007171415,0.0006156722,0.00081891846],"domain_scores_gemma":[0.94127995,0.05021984,0.0026154679,0.0025457577,0.0012683631,0.0020705767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020789674,0.0012152119,0.0028918474,0.0017858597,0.0025993006,0.008460234,0.0049157673,0.0037023793,0.019715343],"category_scores_gemma":[0.026654758,0.0012980298,0.0018144093,0.003501002,0.003472058,0.018367704,0.0043607587,0.0053206324,0.0014826823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002899533,0.0011759438,0.01084963,0.0017029298,0.00036352943,0.0007972913,0.0019187033,0.3183009,0.0057859183,0.5598463,0.04055957,0.055799805],"study_design_scores_gemma":[0.000244794,0.000082195525,0.0015763273,0.00006071119,0.00009267484,0.0002663206,0.0004430086,0.36659414,0.0011936311,0.62761444,0.0017723403,0.000059323596],"about_ca_topic_score_codex":0.007880896,"about_ca_topic_score_gemma":0.008788554,"teacher_disagreement_score":0.019715343,"about_ca_system_score_codex":0.0044901557,"about_ca_system_score_gemma":0.0032398384,"threshold_uncertainty_score":0.06595439},"labels":[],"label_agreement":null},{"id":"W2956368669","doi":"","title":"On the domination number of 2-dimensional torus graphs","year":2018,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Torus; Combinatorics; Geometry","score_opus":0.02505767166059,"score_gpt":0.31828497504855485,"score_spread":0.2932273033879649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956368669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8674492,0.0022730157,0.03318889,0.0032287664,0.00024731742,0.000044086548,0.0007198682,0.000213675,0.09263522],"genre_scores_gemma":[0.9858326,0.001163331,0.0039552785,0.00016828,0.00034894657,0.00008383135,0.00033157397,0.00009174345,0.008024459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991731,0.000277489,0.000032745764,0.000137145,0.0001723792,0.00020717821],"domain_scores_gemma":[0.9897078,0.0076139118,0.00092462456,0.0004150267,0.00039015448,0.00094849785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014227376,0.0008295746,0.001169888,0.004064457,0.002041383,0.003152449,0.0019264934,0.0013741885,0.009376427],"category_scores_gemma":[0.009027349,0.0005426141,0.0006151051,0.002789084,0.0028819346,0.0045268224,0.0019476848,0.0020724465,0.00067139295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005359136,0.00010323107,0.0042960825,0.00033086122,0.00007616553,0.0002847826,0.0012326578,0.0388572,0.0065597612,0.92029274,0.008903239,0.018527372],"study_design_scores_gemma":[0.00008222256,0.00005359363,0.003197687,0.00008272925,0.0000613313,0.00032608394,0.00034088187,0.11436291,0.0016236351,0.87547183,0.00434383,0.000053212425],"about_ca_topic_score_codex":0.0018066526,"about_ca_topic_score_gemma":0.0018720191,"teacher_disagreement_score":0.009376427,"about_ca_system_score_codex":0.0020994432,"about_ca_system_score_gemma":0.0007214253,"threshold_uncertainty_score":0.031367302},"labels":[],"label_agreement":null},{"id":"W2956384121","doi":"10.48550/arxiv.1807.10988","title":"Naji's characterization of circle graphs","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Characterization (materials science); Mathematics; Computer science; Materials science; Nanotechnology","score_opus":0.06077858300379991,"score_gpt":0.20919896489904224,"score_spread":0.14842038189524234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956384121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12550609,0.0012564389,0.43859053,0.008028623,0.0012258386,0.00019765004,0.0012112949,0.0011906342,0.42279288],"genre_scores_gemma":[0.8428642,0.0016313492,0.08790682,0.0030132656,0.00092171016,0.00037144174,0.0007924566,0.00047896305,0.062019825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845505,0.00025700452,0.00007025891,0.00046835013,0.000499237,0.00025021465],"domain_scores_gemma":[0.994827,0.0019750409,0.00038439696,0.00081008027,0.0014667113,0.00053676585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010103923,0.0006315133,0.00078006485,0.0020891798,0.0029949339,0.0022031195,0.0016049455,0.0014263762,0.014524375],"category_scores_gemma":[0.007604959,0.0005844251,0.0009560502,0.0021915731,0.0030745377,0.0068568676,0.0038019323,0.00345072,0.0023771906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040429164,0.000018844801,0.00050948997,0.00011772893,0.000009697281,0.00011230762,0.00065778743,0.00062709977,0.0025820965,0.97804505,0.007721051,0.009558392],"study_design_scores_gemma":[0.000019622594,0.000043886615,0.0018944611,0.00004896625,0.0000456138,0.0006668793,0.00048802732,0.0073969103,0.0046548443,0.8926561,0.09201713,0.00006757522],"about_ca_topic_score_codex":0.0023646657,"about_ca_topic_score_gemma":0.001554407,"teacher_disagreement_score":0.014524375,"about_ca_system_score_codex":0.0010582554,"about_ca_system_score_gemma":0.0007851088,"threshold_uncertainty_score":0.048588872},"labels":[],"label_agreement":null},{"id":"W2956649389","doi":"10.1145/3389390","title":"Approximate Counting CSP Seen from the Other Side","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Recursively enumerable language; Treewidth; Arity; Homomorphism; Bounded function; Constraint satisfaction problem; Class (philosophy); Time complexity; Polynomial","score_opus":0.03920015596666548,"score_gpt":0.2917818174662398,"score_spread":0.25258166149957434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956649389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08569888,0.0013740723,0.8710388,0.0105019035,0.00042975176,0.0002831447,0.0012956035,0.0026039772,0.026773967],"genre_scores_gemma":[0.7179986,0.0009105551,0.25631163,0.002434101,0.00065339194,0.00044160857,0.0018958641,0.00078532164,0.018568851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917746,0.0024314772,0.00037875722,0.0020927386,0.002508725,0.00081372785],"domain_scores_gemma":[0.979219,0.014083045,0.0009925055,0.0040505943,0.001112312,0.0005425496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031087806,0.0009480932,0.001915087,0.0007562181,0.0013539831,0.0048499987,0.0028415124,0.0026094846,0.015756302],"category_scores_gemma":[0.024637682,0.0006062282,0.0020674702,0.0022163824,0.0034093491,0.0155626815,0.0037322592,0.00683977,0.0016119351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007214529,0.00017641082,0.001126389,0.0005341782,0.000113576585,0.0002720679,0.00040643386,0.088904925,0.0053948956,0.82096666,0.012134452,0.06924853],"study_design_scores_gemma":[0.00006476268,0.00006208223,0.00022941762,0.0000348727,0.0000476198,0.00022783055,0.00013610456,0.2829731,0.0028922728,0.7057876,0.0075108698,0.00003343679],"about_ca_topic_score_codex":0.0043575615,"about_ca_topic_score_gemma":0.004402503,"teacher_disagreement_score":0.015756302,"about_ca_system_score_codex":0.0028980453,"about_ca_system_score_gemma":0.002793318,"threshold_uncertainty_score":0.052710116},"labels":[],"label_agreement":null},{"id":"W2957704882","doi":"10.1007/978-3-030-25005-8_21","title":"A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modular design; Scheme (mathematics); Computer science; Theoretical computer science; Parallel computing; Hypergraph; Programming language; Mathematics; Discrete mathematics","score_opus":0.014524078078809427,"score_gpt":0.28097084279795725,"score_spread":0.26644676471914785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957704882","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081617525,0.0003620481,0.95284885,0.00064032513,0.00028449084,0.00026620488,0.00034466444,0.0008830396,0.036208697],"genre_scores_gemma":[0.07076884,0.00081945816,0.88667166,0.00039386167,0.0003596637,0.000474863,0.001122511,0.0006435078,0.038745563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921095,0.00014807626,0.00007168261,0.0002225291,0.00024914308,0.0000975395],"domain_scores_gemma":[0.9992366,0.0002571044,0.0000341318,0.00027792272,0.00012805146,0.00006620668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011784233,0.00139212,0.0009121165,0.0016912814,0.0017105043,0.0043321233,0.0032163847,0.0014366426,0.02185592],"category_scores_gemma":[0.0022378955,0.0010625776,0.0024800473,0.0026577294,0.002196929,0.006794442,0.005221312,0.0051282467,0.0069814622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028712342,0.000044731452,0.00009805149,0.00012465057,0.000010495264,0.000053758537,0.00019946288,0.0017958449,0.002507087,0.92455596,0.0066240993,0.06395721],"study_design_scores_gemma":[0.000019032948,0.000022226044,0.00010580897,0.000030557956,0.000017463131,0.00012876134,0.000059618786,0.0073635094,0.0010754914,0.9642033,0.026957694,0.000016567745],"about_ca_topic_score_codex":0.0006725499,"about_ca_topic_score_gemma":0.0012755012,"teacher_disagreement_score":0.02185592,"about_ca_system_score_codex":0.0014817541,"about_ca_system_score_gemma":0.0009363028,"threshold_uncertainty_score":0.07311535},"labels":[],"label_agreement":null},{"id":"W2962696666","doi":"10.1002/jgt.22121","title":"Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number<sup>*</sup>","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Research Council","keywords":"Mathematics; Combinatorics; Chromatic scale; Corollary; Tree (set theory); Path (computing); Discrete mathematics; Graph; Critical graph; Computer science; Graph power","score_opus":0.027889476077178666,"score_gpt":0.3269516811109861,"score_spread":0.2990622050338074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962696666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7645404,0.0009068906,0.123745605,0.004079835,0.000530431,0.000031935553,0.0006123921,0.0005448206,0.10500772],"genre_scores_gemma":[0.9699922,0.00034371103,0.020895302,0.00041387568,0.00014183654,0.000043674372,0.0003088708,0.0002633038,0.007597297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915683,0.00012137334,0.000040172596,0.0003116238,0.00019658853,0.00017350365],"domain_scores_gemma":[0.9941169,0.0035906641,0.0005645972,0.0006193895,0.00059267547,0.0005157545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007747754,0.00031704662,0.00037415553,0.00085888425,0.0019222897,0.0025802082,0.00079536345,0.00063209987,0.0067920736],"category_scores_gemma":[0.0034120528,0.00034277284,0.0005207376,0.001009408,0.0037703845,0.004736338,0.0013288928,0.002401948,0.0006341756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028677314,0.000033780067,0.0023244158,0.00008958038,0.000024887817,0.00016336929,0.0002719937,0.0038423284,0.011797713,0.96312183,0.0054910732,0.012552242],"study_design_scores_gemma":[0.000025211684,0.000060669114,0.0035147602,0.000045380948,0.000048480146,0.00088145974,0.00034713247,0.023429282,0.008931736,0.9442396,0.018425943,0.000050239127],"about_ca_topic_score_codex":0.0017898235,"about_ca_topic_score_gemma":0.0022665262,"teacher_disagreement_score":0.0067920736,"about_ca_system_score_codex":0.0017984932,"about_ca_system_score_gemma":0.0009420845,"threshold_uncertainty_score":0.022721708},"labels":[],"label_agreement":null},{"id":"W2962698493","doi":"10.1016/j.dam.2017.06.006","title":"A coloring algorithm for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mn>4</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-free line graphs","year":2017,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Claw; Algorithm; Discrete mathematics; Graph","score_opus":0.02548238459607097,"score_gpt":0.2721571614832467,"score_spread":0.24667477688717573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962698493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010575356,0.0002061698,0.9299612,0.0013535764,0.0003586239,0.0006248404,0.0044736494,0.014385069,0.0380615],"genre_scores_gemma":[0.06460612,0.0003420792,0.8764686,0.00041621886,0.00013316888,0.0006614568,0.0091349045,0.0040397486,0.04419779],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990435,0.0001459968,0.000062500294,0.00031729977,0.00025450374,0.00017611281],"domain_scores_gemma":[0.99720985,0.0011620793,0.00012221924,0.00074638316,0.00056019565,0.00019929637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009504918,0.0019588086,0.0009928232,0.0016098522,0.002075888,0.0031647077,0.0029484592,0.0017887879,0.055515748],"category_scores_gemma":[0.004247962,0.0010467436,0.0020651675,0.0027372246,0.00086841785,0.003161433,0.0022085148,0.0027401352,0.021122884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049192907,0.0007039489,0.0012440791,0.00066410546,0.00012397417,0.00028187575,0.00050197,0.03950705,0.015165807,0.15599175,0.28295574,0.50236785],"study_design_scores_gemma":[0.00055318937,0.000239282,0.0012848796,0.00020956228,0.00014629023,0.0007309435,0.0004447257,0.35895264,0.022407725,0.43603685,0.17883535,0.00015853613],"about_ca_topic_score_codex":0.009212878,"about_ca_topic_score_gemma":0.014648381,"teacher_disagreement_score":0.055515748,"about_ca_system_score_codex":0.0029311085,"about_ca_system_score_gemma":0.0034317789,"threshold_uncertainty_score":0.18571872},"labels":[],"label_agreement":null},{"id":"W2962753143","doi":"10.48550/arxiv.math/0609756","title":"Generalization of matching extensions in graphs (II)","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Generalization; Matching (statistics); Mathematics; Computer science; Combinatorics; Statistics; Mathematical analysis","score_opus":0.048386950840380465,"score_gpt":0.3138436146869711,"score_spread":0.2654566638465906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962753143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1702533,0.0030311758,0.64379394,0.0025318088,0.0007832027,0.00028843316,0.0009116773,0.0010202494,0.17738622],"genre_scores_gemma":[0.7426201,0.0029161654,0.2154256,0.0016631027,0.00085384713,0.00021401439,0.00086611434,0.0002805172,0.03516055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993007,0.00013307872,0.000044172073,0.0003194436,0.000109065964,0.00009346298],"domain_scores_gemma":[0.9989312,0.0002772618,0.00014578937,0.00035981432,0.00016091262,0.00012500459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072945957,0.0006291319,0.000582375,0.001665721,0.0010169123,0.0015620318,0.0010814453,0.00080506917,0.0049881805],"category_scores_gemma":[0.0024584164,0.0003742017,0.0015107178,0.0016562839,0.0017364176,0.0047807936,0.0028372314,0.0024508876,0.00089882954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022256896,0.000016856025,0.00049189624,0.00008106379,0.000010626929,0.0001407107,0.00025457292,0.0027451683,0.0016184441,0.9748608,0.0018925634,0.017865075],"study_design_scores_gemma":[0.000009239234,0.000028167446,0.00039682767,0.000036119323,0.00001680379,0.00040498216,0.0000994404,0.009558324,0.00096475997,0.9534562,0.035013936,0.000015157754],"about_ca_topic_score_codex":0.0020989478,"about_ca_topic_score_gemma":0.001829016,"teacher_disagreement_score":0.0049881805,"about_ca_system_score_codex":0.0013158965,"about_ca_system_score_gemma":0.0005746758,"threshold_uncertainty_score":0.016687155},"labels":[],"label_agreement":null},{"id":"W2962756164","doi":"10.1016/j.ejc.2020.103210","title":"Distance-two colourings of Barnette graphs","year":2020,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Planar graph; 1-planar graph; Discrete mathematics; Cograph; Chordal graph; Graph","score_opus":0.022800464512898265,"score_gpt":0.256425006666158,"score_spread":0.2336245421532597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962756164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7866426,0.00067028624,0.09605084,0.0024743315,0.0006817201,0.00009471198,0.00050405524,0.0004281308,0.11245334],"genre_scores_gemma":[0.926019,0.00036138995,0.043481488,0.0006914539,0.00013727449,0.00009681715,0.000651843,0.00024162508,0.028319158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846953,0.00042079002,0.00008537576,0.00029487873,0.00040767336,0.0003217785],"domain_scores_gemma":[0.9935104,0.0035356993,0.0005758938,0.000578582,0.00072598126,0.001073296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094271475,0.00059301336,0.000801236,0.0017604629,0.002526144,0.0035341023,0.00145763,0.0020165585,0.009274232],"category_scores_gemma":[0.005933231,0.0008993419,0.00060557685,0.0014699376,0.002704742,0.0029303492,0.0027624078,0.0030511373,0.0011698026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041877056,0.00009528533,0.001257706,0.00011475927,0.000022308564,0.00031199888,0.0011065158,0.0020932308,0.007749813,0.97050774,0.0030353032,0.013286524],"study_design_scores_gemma":[0.00008234596,0.00004124044,0.0013616194,0.000053227992,0.000027708917,0.00029040675,0.0005532754,0.0071085673,0.0028002448,0.9773793,0.010266175,0.000035897523],"about_ca_topic_score_codex":0.0017127565,"about_ca_topic_score_gemma":0.0029462974,"teacher_disagreement_score":0.009274232,"about_ca_system_score_codex":0.0014743599,"about_ca_system_score_gemma":0.00057565485,"threshold_uncertainty_score":0.03102541},"labels":[],"label_agreement":null},{"id":"W2962798202","doi":"10.1016/j.ejc.2014.08.032","title":"Beyond Ohba’s Conjecture: A bound on the choice number of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-chromatic graphs with<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math>vertices","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University; McGill University","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Conjecture; Mathematics; Upper and lower bounds; Graph; Mathematical analysis","score_opus":0.01633513048850506,"score_gpt":0.2519756485367961,"score_spread":0.23564051804829106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962798202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40141833,0.005022928,0.1590401,0.04438408,0.002001342,0.00023078258,0.0027164388,0.0015119764,0.38367403],"genre_scores_gemma":[0.91565883,0.0015978602,0.026853291,0.0030340992,0.0010345837,0.00027493856,0.0016824853,0.00072969997,0.049134295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965808,0.0009118154,0.00012944889,0.0010590077,0.0006126983,0.0007062965],"domain_scores_gemma":[0.96005815,0.02976313,0.0011856813,0.004742042,0.0015128145,0.0027382404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004150625,0.0012692515,0.0022435351,0.0021051774,0.005958156,0.005537244,0.003994205,0.0041163475,0.03634649],"category_scores_gemma":[0.027409775,0.0011573298,0.0023171636,0.0027149029,0.007849733,0.018550327,0.00547562,0.007669096,0.004218914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013470156,0.00021344011,0.0053457194,0.00062250806,0.00007122889,0.00019764266,0.0008780957,0.011265519,0.0020498217,0.9137115,0.038914334,0.025383104],"study_design_scores_gemma":[0.000090681504,0.000050823877,0.000962747,0.000102396785,0.00004760476,0.00010288062,0.00025263213,0.017897243,0.0010259375,0.9703902,0.009040441,0.000036489746],"about_ca_topic_score_codex":0.003863602,"about_ca_topic_score_gemma":0.0061682435,"teacher_disagreement_score":0.03634649,"about_ca_system_score_codex":0.0033169424,"about_ca_system_score_gemma":0.002161355,"threshold_uncertainty_score":0.12159115},"labels":[],"label_agreement":null},{"id":"W2962803950","doi":"10.1016/j.disc.2018.09.025","title":"DP-3-coloring of some planar graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Sanitarium Association","keywords":"Mathematics; Combinatorics; Planar graph; Planar; List coloring; Edge coloring; Discrete mathematics; Graph coloring; Graph; Computer science; Line graph; Graph power","score_opus":0.03146660688058853,"score_gpt":0.3079936122252469,"score_spread":0.27652700534465835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962803950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70804965,0.0005656609,0.16096225,0.002767944,0.00028096352,0.00019312807,0.0030176335,0.00063788,0.12352484],"genre_scores_gemma":[0.89445084,0.0005066867,0.06560616,0.00071974326,0.0001566348,0.00018868985,0.0037508877,0.00031526637,0.034305144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941015,0.00011884755,0.000023817161,0.00015497554,0.000101420585,0.00019087546],"domain_scores_gemma":[0.9983889,0.00054525275,0.00018926222,0.00023159588,0.00029256922,0.0003524629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037673645,0.0007385172,0.0007276068,0.0010755366,0.0022042044,0.0020885277,0.0015259578,0.0009800536,0.009483142],"category_scores_gemma":[0.0019082087,0.00064091955,0.0011365094,0.0016422785,0.0013008992,0.0017198437,0.0012958032,0.0024819518,0.0009153944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040673354,0.00018521814,0.002561959,0.00036276507,0.000082876955,0.0008190852,0.00081223337,0.015472377,0.013886203,0.9220807,0.01582135,0.027508387],"study_design_scores_gemma":[0.00009462473,0.000058188016,0.0024944304,0.000031117033,0.00007631192,0.00054967694,0.0005221711,0.034012083,0.004680839,0.9412883,0.016156243,0.000035911118],"about_ca_topic_score_codex":0.005782173,"about_ca_topic_score_gemma":0.0054426943,"teacher_disagreement_score":0.009483142,"about_ca_system_score_codex":0.0018578945,"about_ca_system_score_gemma":0.0010583809,"threshold_uncertainty_score":0.031724215},"labels":[],"label_agreement":null},{"id":"W2962836387","doi":"10.20382/jocg.v4i1a8","title":"Network farthest-point diagrams","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Point (geometry); Combinatorics; Geometry","score_opus":0.012509513563585475,"score_gpt":0.22090020614609818,"score_spread":0.2083906925825127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962836387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046661448,0.00067240617,0.9325102,0.0005547431,0.00007382659,0.0001558423,0.003523175,0.0009848559,0.014863368],"genre_scores_gemma":[0.42041385,0.0015524625,0.55567837,0.00025215166,0.00010274746,0.0005370265,0.007925543,0.0004054901,0.013132421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985796,0.0002902665,0.00009217048,0.00042936287,0.00048792976,0.00012073067],"domain_scores_gemma":[0.9966397,0.0015165774,0.0004535912,0.00043690216,0.00068962324,0.0002636193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008702003,0.00065828324,0.0006225725,0.0028884576,0.000728405,0.0022069213,0.0012016721,0.0011243809,0.008474747],"category_scores_gemma":[0.008172783,0.00035077502,0.0005351056,0.0024824715,0.00090249773,0.0052929805,0.0019173083,0.001056328,0.0012534173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021112851,0.00007701603,0.003932544,0.00043898216,0.000052382813,0.00034595485,0.00060535327,0.19696787,0.0069243186,0.6763034,0.010795924,0.10334519],"study_design_scores_gemma":[0.000051519073,0.000091760376,0.0014030619,0.000119694996,0.00003853753,0.0003798831,0.00023174344,0.35607296,0.0049776295,0.55543935,0.08114259,0.000051256447],"about_ca_topic_score_codex":0.002388818,"about_ca_topic_score_gemma":0.0031099957,"teacher_disagreement_score":0.008474747,"about_ca_system_score_codex":0.0012409082,"about_ca_system_score_gemma":0.0007085699,"threshold_uncertainty_score":0.02835083},"labels":[],"label_agreement":null},{"id":"W2962878651","doi":"10.1002/jgt.22178","title":"Packing odd<i>T</i>‐joins with at most two terminals","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research Global; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Joins; Mathematics; Bipartite graph; Cardinality (data modeling); Conjecture; Eulerian path; Disjoint sets; Graph; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.02431626381934828,"score_gpt":0.3199633436365374,"score_spread":0.29564707981718913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962878651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94497794,0.00007600427,0.04854684,0.00010418237,0.00003354884,0.00003989738,0.00016191759,0.000255959,0.0058036647],"genre_scores_gemma":[0.97114146,0.00007553294,0.026008517,0.000072712784,0.000019666079,0.000027606347,0.00028588218,0.00010148047,0.0022671598],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994005,0.00007394332,0.000056817444,0.0001188208,0.00010433748,0.00024557323],"domain_scores_gemma":[0.99725574,0.0006133063,0.0006350199,0.000706855,0.00018874153,0.00060023594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045194692,0.00046184042,0.0007070724,0.00059694465,0.0013195436,0.0021184685,0.00069001125,0.0005984281,0.0050705047],"category_scores_gemma":[0.0023478812,0.0005156182,0.0005205875,0.0010273536,0.001030241,0.0030770982,0.0023409186,0.0006102572,0.0007556753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045249853,0.00093579205,0.10043535,0.0005574079,0.00026791746,0.0039770612,0.0033731929,0.16527379,0.2638505,0.2619524,0.012987782,0.18186392],"study_design_scores_gemma":[0.00015535604,0.0021602586,0.024426214,0.0001933206,0.00023180888,0.0060229013,0.0051677753,0.4077729,0.23091479,0.28109634,0.041667916,0.00019041829],"about_ca_topic_score_codex":0.00069346564,"about_ca_topic_score_gemma":0.0007294633,"teacher_disagreement_score":0.0050705047,"about_ca_system_score_codex":0.0006508171,"about_ca_system_score_gemma":0.0005524052,"threshold_uncertainty_score":0.016962528},"labels":[],"label_agreement":null},{"id":"W2962975014","doi":"","title":"The bondage number of $(n-3)$-regular graphs of order $n$","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Domination analysis; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.018970910859867244,"score_gpt":0.2758323996745476,"score_spread":0.25686148881468035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962975014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9603445,0.00031256693,0.022184227,0.00033115436,0.000035754474,0.00002418429,0.00032640292,0.00010106806,0.016340254],"genre_scores_gemma":[0.9875945,0.00022627396,0.009081029,0.000037253492,0.000022749375,0.000030061956,0.00019242083,0.000031604297,0.0027840426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972314,0.000057757312,0.000014959855,0.00007416129,0.0000727137,0.000057165864],"domain_scores_gemma":[0.99823135,0.00092752255,0.00034216378,0.00014246827,0.000110067114,0.00024649856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027466984,0.00022690487,0.00028344552,0.00083620107,0.00069092,0.0008550472,0.00040528277,0.00045176124,0.0027087876],"category_scores_gemma":[0.0022792285,0.00021544186,0.0002706463,0.0004514608,0.0010911308,0.0014727336,0.0004964574,0.0005090148,0.0002547996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001357342,0.00018632377,0.041927855,0.00042092847,0.00013149732,0.0012136193,0.0015180401,0.0683855,0.1069288,0.6933641,0.008701801,0.07586423],"study_design_scores_gemma":[0.0000864006,0.00035475564,0.027145058,0.0000655664,0.000076616874,0.0023912722,0.0006702812,0.17726508,0.03715739,0.73477685,0.019906461,0.000104238],"about_ca_topic_score_codex":0.0007080309,"about_ca_topic_score_gemma":0.0014150552,"teacher_disagreement_score":0.0027087876,"about_ca_system_score_codex":0.0006457767,"about_ca_system_score_gemma":0.00034272068,"threshold_uncertainty_score":0.009061813},"labels":[],"label_agreement":null},{"id":"W2962977310","doi":"","title":"Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Indecomposable module; Combinatorics; Cardinality (data modeling); Mathematics; Vertex (graph theory); Discrete mathematics; Interval (graph theory); Graph; Computer science","score_opus":0.013287051937384477,"score_gpt":0.2556531109342326,"score_spread":0.24236605899684813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962977310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77851766,0.0020207705,0.10084275,0.0005401695,0.00035290318,0.00023064885,0.0028699748,0.0003903984,0.11423469],"genre_scores_gemma":[0.9030707,0.0009545201,0.057813395,0.00020547351,0.00017236233,0.00029977414,0.0044530607,0.00008404868,0.03294682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920064,0.00010354608,0.000054350407,0.00026228745,0.00016490754,0.00021431422],"domain_scores_gemma":[0.99931335,0.00017535147,0.00021367977,0.000074527285,0.000075855714,0.00014717865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029889194,0.00048291392,0.00036739442,0.0008912341,0.0012118905,0.0016943249,0.00080830965,0.00053341564,0.007943407],"category_scores_gemma":[0.0011623312,0.00033509638,0.0008441254,0.0012181399,0.001183308,0.0011360504,0.0010885715,0.0015512996,0.00080035126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007604104,0.00023173852,0.003218428,0.00021742225,0.00007498049,0.0014602115,0.0015105832,0.01120141,0.010240129,0.8934369,0.006648798,0.07099905],"study_design_scores_gemma":[0.00020366092,0.00039091895,0.0067192595,0.00008878656,0.00006237854,0.0015040872,0.0005195942,0.026567942,0.005951907,0.8497807,0.108132705,0.000078000914],"about_ca_topic_score_codex":0.0023683785,"about_ca_topic_score_gemma":0.0024306134,"teacher_disagreement_score":0.007943407,"about_ca_system_score_codex":0.0011177075,"about_ca_system_score_gemma":0.00047515947,"threshold_uncertainty_score":0.02657342},"labels":[],"label_agreement":null},{"id":"W2963022083","doi":"10.1017/apr.2016.31","title":"","year":2016,"lang":"en","type":"article","venue":"RECERCAT (Consorci de Serveis Universitaris de Catalunya)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Random geometric graph; Mathematics; Euclidean geometry; Random graph; Upper and lower bounds; Graph; Euclidean distance; Geometric graph theory; Spatial network; Discrete mathematics; Random regular graph; Geometric networks; Graph theory; Line graph; Graph power; Geometry; Voltage graph; 1-planar graph; Mathematical analysis","score_opus":0.016188268506788322,"score_gpt":0.24610032284153385,"score_spread":0.22991205433474554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963022083","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29179552,0.0030020662,0.6743216,0.002672996,0.00032889718,0.00028990078,0.0038347591,0.000975486,0.022778757],"genre_scores_gemma":[0.8002758,0.0014670965,0.18331869,0.000536341,0.00019293716,0.00045058157,0.0043443874,0.00023335403,0.009180895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99698955,0.00090860017,0.000112881724,0.0012383044,0.00047471936,0.00027600865],"domain_scores_gemma":[0.99167764,0.004308269,0.0013191382,0.0016855326,0.00062014256,0.00038919348],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014861164,0.00085884094,0.00086240895,0.0016172873,0.00069515925,0.0016206423,0.0021153793,0.001481745,0.0049172537],"category_scores_gemma":[0.01498375,0.00039770754,0.000533479,0.001140458,0.00188967,0.0033219904,0.0021567189,0.0011777191,0.0016115927],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011200455,0.00019528993,0.018829983,0.0006225295,0.0002416104,0.00061015954,0.00051770976,0.10054662,0.024742655,0.7188004,0.011714385,0.122058585],"study_design_scores_gemma":[0.00008472731,0.00042337526,0.016591214,0.00023125316,0.00012733141,0.0021742017,0.00043738258,0.4165421,0.016429443,0.5095053,0.037343375,0.00011027606],"about_ca_topic_score_codex":0.0012216031,"about_ca_topic_score_gemma":0.0014648018,"teacher_disagreement_score":0.99508274,"about_ca_system_score_codex":0.0014643652,"about_ca_system_score_gemma":0.00050772005,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2963103124","doi":"","title":"A Novel Branching Strategy for Parameterized Graph Modification Problems","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Parameterized complexity; Bounded function; Combinatorics; Branching (polymer chemistry); Vertex (graph theory); Mathematics; Discrete mathematics; Computer science; Graph; Theoretical computer science","score_opus":0.11452514852917399,"score_gpt":0.35951069664494845,"score_spread":0.24498554811577444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963103124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012446598,0.0001194027,0.9830215,0.00025348185,0.000021182139,0.000112403395,0.00007301112,0.0005883381,0.003364112],"genre_scores_gemma":[0.22825772,0.0002485756,0.76602155,0.0003552795,0.000056647947,0.00039952822,0.00052288413,0.00036289258,0.0037748988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998161,0.0006269232,0.00009379572,0.0004194112,0.0005258822,0.00017298842],"domain_scores_gemma":[0.99668294,0.0020095354,0.00020433954,0.00071711076,0.00024050046,0.0001455427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015841194,0.00097427354,0.00091613084,0.0007128814,0.00071740564,0.0013939304,0.0026004952,0.0013064332,0.0045830654],"category_scores_gemma":[0.008787935,0.0004932238,0.00088227337,0.0015390781,0.0014720864,0.003796401,0.0026586915,0.0032334724,0.0011097768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029564698,0.00031576952,0.0011894298,0.00021851595,0.00005796041,0.00025654575,0.0003753158,0.22493008,0.021719584,0.4870755,0.008333725,0.255232],"study_design_scores_gemma":[0.00010079912,0.00008065215,0.00014289549,0.000019682027,0.00002198937,0.00015509932,0.00003743273,0.76327246,0.0046841432,0.22541265,0.0060509113,0.000021219254],"about_ca_topic_score_codex":0.0012372719,"about_ca_topic_score_gemma":0.0015550939,"teacher_disagreement_score":0.0045830654,"about_ca_system_score_codex":0.0011993559,"about_ca_system_score_gemma":0.0015432643,"threshold_uncertainty_score":0.015331864},"labels":[],"label_agreement":null},{"id":"W2963127852","doi":"10.1002/jgt.22157","title":"Completing orientations of partially oriented graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Danmarks Frie Forskningsfond; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.033180651212065586,"score_gpt":0.3333721953777207,"score_spread":0.30019154416565513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963127852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6159974,0.00033111015,0.36246845,0.0008193777,0.000092663526,0.0003220122,0.0015530486,0.0009028847,0.017513096],"genre_scores_gemma":[0.88770413,0.00037498976,0.10082535,0.00012542197,0.00011072398,0.000155212,0.0034815113,0.00021795936,0.0070046717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989593,0.00023524633,0.000066352884,0.0003163473,0.0002350212,0.00018771399],"domain_scores_gemma":[0.9959766,0.0017638732,0.0005918626,0.000728111,0.0004354887,0.00050399196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085930707,0.0005437225,0.0005956968,0.00055660616,0.00048663004,0.0013390809,0.0008461673,0.0005680204,0.0047152666],"category_scores_gemma":[0.004159932,0.00038704232,0.0009320688,0.00082143635,0.001234408,0.0032361506,0.0013120732,0.0017304857,0.0005766472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076961005,0.0007801571,0.005884177,0.00060473644,0.00007906058,0.00093224697,0.0016859213,0.26606098,0.019612446,0.55412805,0.012098854,0.13736378],"study_design_scores_gemma":[0.00012831972,0.00018872553,0.0018397269,0.00007203632,0.000035908906,0.00032523007,0.00091561856,0.24313323,0.012460978,0.72432303,0.016523136,0.000054082993],"about_ca_topic_score_codex":0.0028117222,"about_ca_topic_score_gemma":0.0022248756,"teacher_disagreement_score":0.0047152666,"about_ca_system_score_codex":0.0009225251,"about_ca_system_score_gemma":0.000994948,"threshold_uncertainty_score":0.01577413},"labels":[],"label_agreement":null},{"id":"W2963179392","doi":"10.23638/lmcs-13(1:1)2017","title":"Logical compactness and constraint satisfaction problems","year":2017,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compact space; Constraint satisfaction problem; Computer science; Constraint satisfaction; Constraint (computer-aided design); Constraint satisfaction dual problem; Constraint logic programming; Local consistency; Theoretical computer science; Arithmetic; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.3609906485317839,"score_gpt":0.5772651838492405,"score_spread":0.2162745353174566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963179392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15692793,0.002363414,0.7858973,0.012659883,0.00012321606,0.00023263632,0.0006294434,0.0003958708,0.040770285],"genre_scores_gemma":[0.8215473,0.0014920193,0.16759889,0.0014265605,0.00054862,0.00023537486,0.0011829461,0.00010177749,0.0058665113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909977,0.0033383197,0.0005510928,0.0012847908,0.0029586442,0.0008695531],"domain_scores_gemma":[0.92832065,0.0622123,0.0030508917,0.002265391,0.0030319341,0.0011187136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005629678,0.0008454198,0.0009107712,0.0022953486,0.0019048897,0.0041485974,0.0020617545,0.0018711719,0.007795378],"category_scores_gemma":[0.029717429,0.0007010578,0.0020642106,0.0027148435,0.006593338,0.014243773,0.0044503864,0.0053136717,0.00065465947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007771012,0.000087060274,0.0017927454,0.00031715483,0.000055598874,0.00019782662,0.0005722469,0.017378114,0.0012212906,0.95428634,0.0023337754,0.021680197],"study_design_scores_gemma":[0.000025419984,0.000030461042,0.00083474006,0.000040868304,0.000013987492,0.00011707229,0.00020268385,0.037686594,0.0009952673,0.9575762,0.0024530399,0.000023675642],"about_ca_topic_score_codex":0.0019178494,"about_ca_topic_score_gemma":0.0016062541,"teacher_disagreement_score":0.007795378,"about_ca_system_score_codex":0.002988997,"about_ca_system_score_gemma":0.0012291173,"threshold_uncertainty_score":0.029772937},"labels":[],"label_agreement":null},{"id":"W2963191201","doi":"10.1016/j.dam.2017.02.027","title":"End-vertices of LBFS of (AT-free) bigraphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02677701066082994,"score_gpt":0.30300987381633354,"score_spread":0.2762328631555036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963191201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7241265,0.00037923743,0.1832369,0.00056879764,0.00017161766,0.00012155909,0.0024062241,0.0012477464,0.08774147],"genre_scores_gemma":[0.92820907,0.00019867501,0.033897076,0.00017117648,0.00007329723,0.00012407867,0.002043061,0.00030000778,0.034983583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953747,0.000056885365,0.00002174325,0.000093915834,0.00011342303,0.00017657685],"domain_scores_gemma":[0.99800235,0.00066621124,0.00018299681,0.0002648338,0.0003306021,0.00055299484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003182255,0.00049724145,0.00070432003,0.0017688745,0.0020630173,0.0026356908,0.0011793026,0.0012902397,0.012178789],"category_scores_gemma":[0.002228411,0.0005024581,0.00064598874,0.0011536254,0.001468233,0.0025273534,0.0017730894,0.0013772157,0.0017973876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005977839,0.00016844166,0.0037132504,0.000280409,0.00004283218,0.00073107396,0.0012911897,0.011986703,0.008612476,0.93169904,0.005285322,0.035591535],"study_design_scores_gemma":[0.000045532666,0.000053988733,0.0021126966,0.000080387916,0.000040109084,0.00029300962,0.0007490063,0.022969028,0.004958206,0.956566,0.012099883,0.00003215475],"about_ca_topic_score_codex":0.0036089763,"about_ca_topic_score_gemma":0.004798602,"teacher_disagreement_score":0.012178789,"about_ca_system_score_codex":0.00090699556,"about_ca_system_score_gemma":0.0006123681,"threshold_uncertainty_score":0.0407421},"labels":[],"label_agreement":null},{"id":"W2963231024","doi":"10.1007/978-3-030-26176-4_18","title":"Imbalance, Cutwidth, and the Structure of Optimal Orderings","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Chordal graph; Interval (graph theory); Interval graph; Combinatorics; Computer science; Pathwidth; Graph; Time complexity; Mathematics; Discrete mathematics; 1-planar graph; Line graph","score_opus":0.008855433772985706,"score_gpt":0.2493822870509093,"score_spread":0.2405268532779236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963231024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6313092,0.007484055,0.23867217,0.0063749105,0.0004717956,0.00011479852,0.0027286664,0.0006690812,0.11217529],"genre_scores_gemma":[0.88476944,0.004374359,0.08722331,0.00055380125,0.00084186124,0.0001661929,0.0024948176,0.00043595614,0.019140182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991634,0.00019421444,0.000053858883,0.00017370348,0.00027355555,0.00014129968],"domain_scores_gemma":[0.9913162,0.00572729,0.0011223081,0.0008413891,0.00051497505,0.000477771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012485803,0.0006232912,0.0010208202,0.0025308921,0.0013896776,0.004860514,0.0012612706,0.0012898914,0.007008357],"category_scores_gemma":[0.010546498,0.0009775064,0.00048787455,0.0042542494,0.0018510188,0.0085039465,0.0012433082,0.0027091948,0.0007511578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036138282,0.00017164987,0.001985673,0.00021289321,0.000031865486,0.00008459847,0.00031631187,0.029885983,0.0031930206,0.8796348,0.0116417855,0.07247995],"study_design_scores_gemma":[0.000021256837,0.000023137653,0.00057850976,0.000028239776,0.000012229986,0.0000951075,0.000085502805,0.025921883,0.0005464133,0.96945894,0.0032195984,0.000009180624],"about_ca_topic_score_codex":0.00078094285,"about_ca_topic_score_gemma":0.0013216712,"teacher_disagreement_score":0.007008357,"about_ca_system_score_codex":0.0020697687,"about_ca_system_score_gemma":0.0009491267,"threshold_uncertainty_score":0.023445249},"labels":[],"label_agreement":null},{"id":"W2963269633","doi":"10.1002/jgt.22929","title":"A new graph parameter to measure linearity","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Chordal graph; Indifference graph; Discrete mathematics; Interval graph; Pathwidth; Lexicographical order; Cograph; Split graph; Vertex (graph theory); Conjecture; Maximal independent set; Graph; 1-planar graph; Line graph","score_opus":0.0419654132220377,"score_gpt":0.3163577701094336,"score_spread":0.27439235688739594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963269633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26796624,0.0014583791,0.677394,0.0026058815,0.0005711835,0.00025849105,0.0010351521,0.001958301,0.046752382],"genre_scores_gemma":[0.9176161,0.00026236824,0.077459894,0.00041009355,0.00041744576,0.0002700163,0.00034137294,0.00042892224,0.0027937866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948447,0.001860289,0.00029628148,0.0016386101,0.0009938849,0.00036619665],"domain_scores_gemma":[0.96201277,0.020819234,0.004963411,0.007188285,0.0030125044,0.0020037724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033194085,0.0009247014,0.0010630591,0.004856012,0.001371667,0.0042127785,0.002364191,0.0022028165,0.0065463595],"category_scores_gemma":[0.025735943,0.0006063597,0.00069923286,0.003402902,0.0063557606,0.0133113945,0.0033034976,0.0034957377,0.00079051737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022768373,0.00015232335,0.0069649457,0.00015005936,0.00006935219,0.00012984339,0.0007012932,0.019405292,0.01298613,0.930551,0.002363348,0.026298858],"study_design_scores_gemma":[0.00007521863,0.00037391766,0.0058482895,0.00016732316,0.0000968647,0.00059749646,0.00081140955,0.18700442,0.02188641,0.76015496,0.02269105,0.00029268663],"about_ca_topic_score_codex":0.0010996273,"about_ca_topic_score_gemma":0.00081994967,"teacher_disagreement_score":0.0065463595,"about_ca_system_score_codex":0.003297153,"about_ca_system_score_gemma":0.00088269927,"threshold_uncertainty_score":0.023922622},"labels":[],"label_agreement":null},{"id":"W2963276582","doi":"10.5539/jmr.v1n1p3","title":"Nathanson Heights and the CSS Conjecture for Cayley Graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chulalongkorn University","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Cayley graph; Directed graph; Graph; Undirected graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics","score_opus":0.06833315361679113,"score_gpt":0.3993732351629574,"score_spread":0.33104008154616626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963276582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79194564,0.0026291844,0.080359004,0.008050485,0.00049738435,0.00007767219,0.0009114068,0.00051150034,0.11501778],"genre_scores_gemma":[0.9810751,0.0007028565,0.010715759,0.0006460211,0.00030272768,0.00004953369,0.0003851266,0.00003822159,0.0060847467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994697,0.00009375206,0.000026632635,0.00011944312,0.0001324879,0.0001579054],"domain_scores_gemma":[0.996033,0.0022735181,0.00037881706,0.00060271716,0.00032128545,0.0003906693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086985005,0.00038986118,0.00040424426,0.0011633104,0.0014878135,0.0018296968,0.0006575706,0.0006391853,0.0052285613],"category_scores_gemma":[0.0044252425,0.00034887737,0.00065860205,0.0010152052,0.002329166,0.0038091885,0.0022220057,0.0015423562,0.00047430734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023099841,0.000041113424,0.0060108877,0.000110780566,0.00001985614,0.0001923781,0.00052808935,0.0067201396,0.0030659093,0.9526343,0.008299813,0.022145795],"study_design_scores_gemma":[0.0000664475,0.000062551924,0.0030771683,0.000042355834,0.000031639243,0.00023505709,0.00046015123,0.016406666,0.0040470916,0.9581153,0.017422302,0.000033177857],"about_ca_topic_score_codex":0.002866747,"about_ca_topic_score_gemma":0.0041145068,"teacher_disagreement_score":0.0052285613,"about_ca_system_score_codex":0.0016652175,"about_ca_system_score_gemma":0.0007523775,"threshold_uncertainty_score":0.017491221},"labels":[],"label_agreement":null},{"id":"W2963285256","doi":"10.1016/j.disc.2018.09.006","title":"Connected <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e220\" altimg=\"si33.gif\"><mml:mi>k</mml:mi></mml:math>-dominating graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Integer (computer science); Dominating set; Cardinality (data modeling); Discrete mathematics; Database; Computer science","score_opus":0.020859113087897004,"score_gpt":0.276190103456706,"score_spread":0.255330990368809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963285256","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021017573,0.00037591872,0.18882899,0.0029078338,0.0013170015,0.0003548458,0.2321567,0.12614502,0.445812],"genre_scores_gemma":[0.029343864,0.001178959,0.09409979,0.0020081007,0.00048441935,0.0007184434,0.3873734,0.090727955,0.39406502],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993401,0.00009420593,0.000063454456,0.00015636279,0.00025997526,0.00008590744],"domain_scores_gemma":[0.99789125,0.0005417268,0.000115411705,0.0005581534,0.00072101236,0.0001724405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006074312,0.0015131911,0.0010594926,0.0024377913,0.0013565252,0.0053598555,0.0028587175,0.0017628605,0.56047827],"category_scores_gemma":[0.0046032774,0.0011554984,0.0010861207,0.004080978,0.0006215557,0.0064688292,0.003103716,0.0021569703,0.41516647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081786064,0.000030568302,0.00018529504,0.00034164183,0.000010542334,0.000074461524,0.00013649816,0.00060498377,0.0016307721,0.048392992,0.91262203,0.035888515],"study_design_scores_gemma":[0.000037916194,0.000007251299,0.00026672886,0.00008129769,0.000007989006,0.0001076124,0.000053942433,0.0026173296,0.0032016013,0.030788625,0.96280444,0.000025274665],"about_ca_topic_score_codex":0.006583089,"about_ca_topic_score_gemma":0.008914021,"teacher_disagreement_score":0.56047827,"about_ca_system_score_codex":0.0018612833,"about_ca_system_score_gemma":0.0014553969,"threshold_uncertainty_score":0.6269244},"labels":[],"label_agreement":null},{"id":"W2963324144","doi":"10.23638/dmtcs-21-3-1","title":"Binding Number, Toughness and General Matching Extendability in Graphs","year":2019,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matching (statistics); Mathematics; Combinatorics; Toughness; Computer science; Materials science; Composite material; Statistics","score_opus":0.15719541194761466,"score_gpt":0.538923214151161,"score_spread":0.3817278022035463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963324144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7539853,0.0012901429,0.2052795,0.0025429933,0.00018317271,0.00014018672,0.0014836516,0.00077561574,0.03431952],"genre_scores_gemma":[0.956026,0.0008971192,0.032078348,0.00042360183,0.0002510435,0.00022542638,0.000953988,0.00011179611,0.009032616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979292,0.00025525113,0.0001407147,0.00074805284,0.00044962106,0.00047701562],"domain_scores_gemma":[0.98804575,0.0069847372,0.0015389872,0.0011421652,0.0004566727,0.0018317892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532172,0.0010300104,0.001222001,0.0025397614,0.0015006656,0.002630404,0.0022892132,0.0013415803,0.008321608],"category_scores_gemma":[0.008314614,0.0010397938,0.0015920147,0.0023773692,0.00450682,0.007270851,0.00386775,0.0039595463,0.0006796865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010450514,0.00036014876,0.010169295,0.000624349,0.00015790893,0.00085024897,0.0018650641,0.07251148,0.020761676,0.8393603,0.0070967935,0.04519777],"study_design_scores_gemma":[0.0000834966,0.00017434113,0.0073958375,0.000077006545,0.00007615623,0.00075369154,0.00037329743,0.06419666,0.0034968928,0.9167153,0.006559898,0.00009743615],"about_ca_topic_score_codex":0.0023463916,"about_ca_topic_score_gemma":0.0022654945,"teacher_disagreement_score":0.008321608,"about_ca_system_score_codex":0.0017668138,"about_ca_system_score_gemma":0.0008431126,"threshold_uncertainty_score":0.027838588},"labels":[],"label_agreement":null},{"id":"W2963356118","doi":"10.2298/fil1601169a","title":"On the domination polynomials of friendship graphs","year":2016,"lang":"en","type":"article","venue":"Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Limiting; Friendship graph; Voltage graph; Line graph","score_opus":0.014640895675848038,"score_gpt":0.24170945655783918,"score_spread":0.22706856088199115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963356118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8823341,0.00071057846,0.07548091,0.000608571,0.00003531199,0.000037347298,0.0003043399,0.0001158305,0.040372893],"genre_scores_gemma":[0.9910376,0.00041335385,0.004164348,0.000037860264,0.0000551749,0.000016149508,0.00012370096,0.000025180792,0.004126709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957925,0.00008999776,0.000008826147,0.000070538605,0.000104767576,0.00014665324],"domain_scores_gemma":[0.99747795,0.0016417931,0.0002490625,0.0001441195,0.0002332069,0.00025379416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005383275,0.0003223025,0.00029301393,0.0015568295,0.0009665167,0.00093586504,0.0005375376,0.00030955806,0.0033278419],"category_scores_gemma":[0.004914669,0.00018896008,0.00040424537,0.0014973903,0.0014366249,0.0014972079,0.00088046276,0.00085593003,0.0003412672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026505388,0.00007109941,0.004957881,0.00013714249,0.000022865388,0.00044525875,0.0017249903,0.03667166,0.00861744,0.89686215,0.0027750467,0.04744936],"study_design_scores_gemma":[0.00004898465,0.0000842441,0.007820535,0.000054068834,0.00002761466,0.000748467,0.00054803025,0.14263207,0.00383129,0.8329584,0.011196707,0.000049668055],"about_ca_topic_score_codex":0.0043648225,"about_ca_topic_score_gemma":0.003358351,"teacher_disagreement_score":0.0043648225,"about_ca_system_score_codex":0.0013125445,"about_ca_system_score_gemma":0.00044173398,"threshold_uncertainty_score":0.011132777},"labels":[],"label_agreement":null},{"id":"W2963436343","doi":"10.2298/aadm151109021k","title":"Protecting a graph with mobile guards","year":2016,"lang":"en","type":"article","venue":"Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Dominating set; Theoretical computer science; Discrete mathematics; Computer science; Computer security","score_opus":0.009525591607780442,"score_gpt":0.2344880124442836,"score_spread":0.22496242083650317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963436343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26005995,0.0017794266,0.7230733,0.0007902184,0.00017515126,0.00016889315,0.00063787284,0.0011909875,0.012124167],"genre_scores_gemma":[0.9227216,0.0009726155,0.07273962,0.00014402543,0.000056818273,0.00007654694,0.0004557577,0.000091405585,0.00274156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906856,0.00023290835,0.00005461646,0.00025866454,0.00015063529,0.0002346225],"domain_scores_gemma":[0.99686545,0.0013255479,0.00040096944,0.0010441391,0.00012954419,0.00023433764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006871229,0.0011081342,0.001030625,0.0006766846,0.0010862335,0.0013957961,0.0014507358,0.0010296543,0.0020820105],"category_scores_gemma":[0.0034490447,0.00043250178,0.0008764868,0.0008453111,0.0014436274,0.0033669919,0.0026924221,0.0011275981,0.00056468847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010558417,0.00022340118,0.0034182856,0.000939584,0.0002295424,0.0011238005,0.000873561,0.48330906,0.05563513,0.3004855,0.009408603,0.14329773],"study_design_scores_gemma":[0.00009221181,0.00047086176,0.0012097553,0.00012377996,0.0001438381,0.0014197191,0.0003928435,0.6631553,0.019673174,0.29794475,0.015319457,0.00005423272],"about_ca_topic_score_codex":0.0013495102,"about_ca_topic_score_gemma":0.0014142031,"teacher_disagreement_score":0.0020820105,"about_ca_system_score_codex":0.0010783632,"about_ca_system_score_gemma":0.00090066594,"threshold_uncertainty_score":0.007824123},"labels":[],"label_agreement":null},{"id":"W2963481734","doi":"10.1016/j.laa.2015.03.011","title":"On the complexity of the positive semidefinite zero forcing number","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chordal graph; Combinatorics; Positive-definite matrix; Forcing (mathematics); Zero (linguistics); Discrete mathematics; Graph; Clique problem; 1-planar graph; Mathematical analysis","score_opus":0.06431228310804556,"score_gpt":0.3106601391448648,"score_spread":0.24634785603681925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963481734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6327719,0.0022633227,0.21317612,0.017793182,0.0007181333,0.00012351602,0.0016834317,0.0004891624,0.13098127],"genre_scores_gemma":[0.9677733,0.000810383,0.015446324,0.00075204176,0.0010671959,0.00016570697,0.0006283439,0.0001585805,0.013198127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997618,0.00069142686,0.000092139264,0.00046882406,0.00078126206,0.0003482842],"domain_scores_gemma":[0.9722669,0.022773696,0.0015472805,0.0012188033,0.0009864167,0.0012068576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002562033,0.00096395,0.0020602753,0.0022561722,0.0021880704,0.006891289,0.003028572,0.0024417916,0.01283155],"category_scores_gemma":[0.018084362,0.0007745996,0.0011148417,0.0022547334,0.007444859,0.01335089,0.0037575052,0.006033491,0.0012307164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011245256,0.00004545028,0.00050445227,0.00008277968,0.000011476989,0.00007574487,0.00018300646,0.0071236733,0.00056556135,0.9847072,0.002375705,0.0042126845],"study_design_scores_gemma":[0.000015402333,0.000010978259,0.00016550715,0.000010554428,0.0000045802353,0.000039600982,0.000030268382,0.020208573,0.00017867266,0.9788477,0.00047122958,0.000016921413],"about_ca_topic_score_codex":0.0014208535,"about_ca_topic_score_gemma":0.0012898085,"teacher_disagreement_score":0.01283155,"about_ca_system_score_codex":0.003066669,"about_ca_system_score_gemma":0.0019237119,"threshold_uncertainty_score":0.042925775},"labels":[],"label_agreement":null},{"id":"W2963555739","doi":"10.1016/j.jctb.2019.07.001","title":"On Frank's conjecture on k-connected orientations","year":2020,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Graph; Orientation (vector space); Vertex connectivity; Connectivity; Strongly connected component; Discrete mathematics; Geometry","score_opus":0.016952943701112562,"score_gpt":0.2524984490910995,"score_spread":0.23554550538998692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963555739","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4788845,0.0034009488,0.0789232,0.035602707,0.0027738207,0.00020674453,0.0035441217,0.0012622435,0.39540172],"genre_scores_gemma":[0.937994,0.0020087664,0.017001558,0.0035233826,0.0013035572,0.00016689795,0.0022611301,0.000292142,0.03544852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982315,0.0002631389,0.000088674016,0.0005228101,0.00033852342,0.0005554434],"domain_scores_gemma":[0.99447435,0.003578112,0.00039670995,0.00051399245,0.00051397015,0.000522925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001702952,0.0013745303,0.0024481486,0.003153984,0.0057082777,0.0062159966,0.0025342095,0.0042803218,0.020853583],"category_scores_gemma":[0.008802888,0.001707504,0.0019017698,0.00431435,0.006817236,0.0160268,0.0054980675,0.0072832173,0.0028237042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022190489,0.00004536945,0.00065136503,0.00013472183,0.00001479543,0.000148739,0.0005839355,0.0012701644,0.00042363937,0.980732,0.008930043,0.0068432274],"study_design_scores_gemma":[0.000051363695,0.000018375345,0.0004585737,0.000049851333,0.000021415495,0.00015188198,0.00036322116,0.0022565275,0.0003386808,0.98950815,0.0067565157,0.000025291054],"about_ca_topic_score_codex":0.006407548,"about_ca_topic_score_gemma":0.005603526,"teacher_disagreement_score":0.020853583,"about_ca_system_score_codex":0.0034670297,"about_ca_system_score_gemma":0.0011716584,"threshold_uncertainty_score":0.06976217},"labels":[],"label_agreement":null},{"id":"W2963559342","doi":"10.1016/j.jctb.2018.03.004","title":"Explicit bounds for graph minors","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Combinatorics; Mathematics; Disjoint sets; Vertex (graph theory); Homeomorphism (graph theory); Graph; Discrete mathematics","score_opus":0.017899772074264998,"score_gpt":0.2954854718971994,"score_spread":0.2775856998229344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963559342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21402825,0.005579881,0.5649517,0.010301037,0.0014676912,0.00037720325,0.0027518438,0.0030596808,0.19748265],"genre_scores_gemma":[0.83617103,0.0036154562,0.09757966,0.0020325156,0.0029495554,0.00057767035,0.0035693366,0.0027815048,0.05072332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961234,0.00090258115,0.0002035699,0.00086429337,0.001100098,0.00080614106],"domain_scores_gemma":[0.96686846,0.02415818,0.0014842303,0.0033311702,0.0017971284,0.002360862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034347593,0.0040902407,0.0028779309,0.005400114,0.0030825825,0.008771095,0.0068400516,0.0034530098,0.031526595],"category_scores_gemma":[0.032254916,0.0022955812,0.0023294785,0.004807617,0.0046766857,0.023454214,0.009599169,0.010646362,0.00607114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004739078,0.0004372683,0.0017415233,0.0005826,0.00006618583,0.00029394595,0.0011332751,0.011349083,0.0047615254,0.92108583,0.020433929,0.03764098],"study_design_scores_gemma":[0.000037309335,0.00004326894,0.0005213514,0.00007878631,0.00006794351,0.00020301659,0.00011454423,0.029901667,0.001243599,0.96173394,0.0060143885,0.000040275085],"about_ca_topic_score_codex":0.0010093326,"about_ca_topic_score_gemma":0.0023490286,"teacher_disagreement_score":0.031526595,"about_ca_system_score_codex":0.0030970913,"about_ca_system_score_gemma":0.0012381284,"threshold_uncertainty_score":0.10546696},"labels":[],"label_agreement":null},{"id":"W2963579132","doi":"","title":"Cycles are determined by their domination polynomials.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph; Dominating set; Simple graph; Polynomial; Order (exchange); Discrete mathematics; Mathematical analysis","score_opus":0.011349914316980255,"score_gpt":0.257201414940366,"score_spread":0.24585150062338576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963579132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7966225,0.0012528906,0.15558402,0.00051613373,0.00010103033,0.00014935843,0.0013749109,0.00030423142,0.044094834],"genre_scores_gemma":[0.97557527,0.0006092782,0.012876763,0.00007573045,0.00010365589,0.0000660553,0.0004414019,0.00007147173,0.010180395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938536,0.000064349406,0.000021943197,0.00018725843,0.00014631734,0.00019482475],"domain_scores_gemma":[0.99789774,0.00092483964,0.00042668683,0.00017734767,0.00029908802,0.00027424953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028861855,0.000351779,0.00034415838,0.0014934608,0.0012056482,0.0017010059,0.000523744,0.00038157156,0.0036337522],"category_scores_gemma":[0.003730882,0.0003476635,0.0005084969,0.0017324736,0.0015166417,0.002002954,0.0010971678,0.0006955767,0.00042729505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044264845,0.00008318284,0.008057454,0.00024861982,0.000054888027,0.0004623391,0.00143678,0.013303189,0.020054895,0.8697608,0.0044420823,0.08165312],"study_design_scores_gemma":[0.000066867884,0.00010336285,0.0075640664,0.00006294363,0.00006063214,0.0012728376,0.00040919863,0.04390114,0.010341161,0.9087427,0.027399274,0.00007576127],"about_ca_topic_score_codex":0.0036057555,"about_ca_topic_score_gemma":0.0042608273,"teacher_disagreement_score":0.0036337522,"about_ca_system_score_codex":0.0014766447,"about_ca_system_score_gemma":0.0008143058,"threshold_uncertainty_score":0.012156069},"labels":[],"label_agreement":null},{"id":"W2963622109","doi":"10.1002/jgt.22230","title":"Star chromatic index of subcubic multigraphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Tianjin City; Simon Fraser University; National Natural Science Foundation of China","keywords":"Multigraph; Mathematics; Edge coloring; Combinatorics; Star (game theory); Graph; Conjecture; Discrete mathematics; Graph power; Line graph","score_opus":0.021040488398955014,"score_gpt":0.3052251601930699,"score_spread":0.2841846717941149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963622109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8883927,0.00034497213,0.08902398,0.00041577726,0.000043184216,0.000095449774,0.000824815,0.00019702407,0.020662088],"genre_scores_gemma":[0.9607993,0.00024706952,0.033775683,0.00012576053,0.000037063448,0.0000644681,0.00073984376,0.00007189947,0.004138875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944335,0.000069668655,0.000034575656,0.00016289287,0.00016024332,0.00012931487],"domain_scores_gemma":[0.9972241,0.0008895126,0.00037004467,0.00052595604,0.00046419978,0.000526221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003728685,0.00035845186,0.00051960663,0.0013823577,0.0013109159,0.0016390269,0.00083128584,0.00035591537,0.004918735],"category_scores_gemma":[0.0017542946,0.0003949013,0.0004920226,0.0017746245,0.0008250095,0.0022601923,0.0013059891,0.0010525153,0.00031508403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010096154,0.00032294352,0.023593212,0.00050184823,0.000120484176,0.0006633936,0.0017515755,0.07482697,0.06154895,0.74166316,0.0078106956,0.086187124],"study_design_scores_gemma":[0.0000658739,0.00019218917,0.010528446,0.00006626638,0.00008702506,0.00079884165,0.0009074067,0.24296379,0.023630887,0.70515865,0.015544604,0.000056095992],"about_ca_topic_score_codex":0.002549503,"about_ca_topic_score_gemma":0.0036522904,"teacher_disagreement_score":0.004918735,"about_ca_system_score_codex":0.0015293726,"about_ca_system_score_gemma":0.00088513206,"threshold_uncertainty_score":0.016454756},"labels":[],"label_agreement":null},{"id":"W2963622148","doi":"10.1007/s00454-022-00414-8","title":"Combinatorial Properties and Recognition of Unit Square Visibility Graphs","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Lorentz Center; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Unit square; Combinatorics; Visibility; Algorithm; Graph; Mathematics; Unit (ring theory); Square (algebra); Computer science; Geometry; Physics","score_opus":0.05925306103931311,"score_gpt":0.30829910793677706,"score_spread":0.24904604689746396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963622148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5997558,0.0006327673,0.3664831,0.0010552983,0.000114867646,0.00013885855,0.0013236892,0.0013280788,0.02916758],"genre_scores_gemma":[0.9542775,0.00017421435,0.04058401,0.00011473212,0.000045352837,0.00006401902,0.0013730623,0.00012054432,0.003246556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987205,0.00022512821,0.00009305706,0.00043709783,0.0002852596,0.00023891112],"domain_scores_gemma":[0.99546427,0.002026761,0.0008678308,0.0008644211,0.00040317967,0.00037349915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035650012,0.0004936302,0.00051685184,0.0008267798,0.0005975301,0.0029990603,0.0013867558,0.0009847793,0.0059556775],"category_scores_gemma":[0.0049619153,0.00047862288,0.00069589535,0.0015750973,0.0015856955,0.0031106537,0.0016388037,0.0013238582,0.0006693779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000720475,0.00031158762,0.013538151,0.0006082017,0.00010470885,0.0012783123,0.0010168396,0.19253477,0.04673108,0.564196,0.016827852,0.16213207],"study_design_scores_gemma":[0.00006408396,0.00015650528,0.005147332,0.00005927436,0.000045046272,0.0012083092,0.00060624216,0.3467925,0.020896446,0.6116014,0.013366164,0.000056693054],"about_ca_topic_score_codex":0.0020286061,"about_ca_topic_score_gemma":0.0015822976,"teacher_disagreement_score":0.0059556775,"about_ca_system_score_codex":0.000724755,"about_ca_system_score_gemma":0.00044230133,"threshold_uncertainty_score":0.019923687},"labels":[],"label_agreement":null},{"id":"W2963649630","doi":"10.1007/s00373-017-1807-2","title":"Analogues of Cliques for (m, n)-Colored Mixed Graphs","year":2017,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Colored; Graph; Vertex (graph theory); Discrete mathematics; Clique number","score_opus":0.03279238096370085,"score_gpt":0.3089552431641388,"score_spread":0.27616286220043795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963649630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4311965,0.00090102263,0.31800824,0.0022363372,0.00087830325,0.00032992332,0.0011672861,0.00062430283,0.24465808],"genre_scores_gemma":[0.88235015,0.00039045385,0.08841476,0.00060096034,0.00039276638,0.00028436817,0.00079270994,0.00028237567,0.026491392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848324,0.00054762914,0.00007191564,0.0004103998,0.00025295746,0.00023388606],"domain_scores_gemma":[0.9959235,0.0016913839,0.0007719557,0.0005933801,0.00029860964,0.0007211844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013097036,0.00065832277,0.0006609197,0.0014334652,0.0021410945,0.0042861337,0.0019690606,0.0015376514,0.011673558],"category_scores_gemma":[0.0054176114,0.00093253294,0.0015813141,0.0011804586,0.0024226878,0.0035002355,0.002553618,0.0029824064,0.0008266502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006614937,0.000033044056,0.00024374164,0.000042813273,0.0000091704915,0.000115906914,0.00018139913,0.00085378747,0.0014987853,0.9931108,0.0013853264,0.0024591223],"study_design_scores_gemma":[0.00006743769,0.00004086435,0.0009161831,0.000039898052,0.000028172948,0.00034593442,0.00017902702,0.013499649,0.0012640631,0.9748359,0.008754766,0.000027995591],"about_ca_topic_score_codex":0.0013170061,"about_ca_topic_score_gemma":0.0021925515,"teacher_disagreement_score":0.011673558,"about_ca_system_score_codex":0.0013229576,"about_ca_system_score_gemma":0.0005973576,"threshold_uncertainty_score":0.03905201},"labels":[],"label_agreement":null},{"id":"W2963663369","doi":"10.1137/16m108080x","title":"Planar Digraphs of Digirth Four are 2-Colorable","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Digraph; Combinatorics; Mathematics; Conjecture; Monochromatic color; Planar; Planar graph; Colored; Discrete mathematics; Computer science; Graph; Physics","score_opus":0.04470984151357586,"score_gpt":0.31633142321947133,"score_spread":0.27162158170589545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963663369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7567475,0.0012653357,0.12310495,0.0042152647,0.00038536236,0.00037322476,0.004236457,0.0015225444,0.10814932],"genre_scores_gemma":[0.944126,0.00091670756,0.032827843,0.0012421086,0.000101105674,0.00019541782,0.0033210625,0.000120498764,0.017149251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992884,0.000104521554,0.00004659654,0.0002428547,0.00010656974,0.00021112866],"domain_scores_gemma":[0.995693,0.002578196,0.00045144613,0.0004944944,0.00043157497,0.0003512977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040503033,0.0007787384,0.0008192588,0.00077127304,0.0018145355,0.0023963465,0.0011045934,0.00095546007,0.009400611],"category_scores_gemma":[0.0036466937,0.0009454033,0.0011889905,0.0010333281,0.0020089764,0.0029637008,0.0017781791,0.0022602375,0.0012421221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016452314,0.0003421279,0.00951616,0.0015142915,0.0002601789,0.001337748,0.0019244191,0.0393121,0.0316871,0.80537444,0.02375762,0.0833285],"study_design_scores_gemma":[0.00028929036,0.0001981383,0.0042994525,0.00013984287,0.00024934037,0.0011096108,0.0010245545,0.026327156,0.018537898,0.8946941,0.052992262,0.0001383136],"about_ca_topic_score_codex":0.0039143628,"about_ca_topic_score_gemma":0.00618617,"teacher_disagreement_score":0.009400611,"about_ca_system_score_codex":0.0017928503,"about_ca_system_score_gemma":0.0009558771,"threshold_uncertainty_score":0.031448185},"labels":[],"label_agreement":null},{"id":"W2963704621","doi":"","title":"Equivalence between Extendability and Factor-Criticality.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Criticality; Mathematics; Equivalence (formal languages); Pure mathematics; Factor (programming language); Nuclear physics; Physics; Computer science; Programming language","score_opus":0.0344585319924574,"score_gpt":0.33757427598177286,"score_spread":0.30311574398931546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963704621","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20341156,0.0028751546,0.21874991,0.0039334698,0.0006510642,0.00012888177,0.00095445407,0.00082971394,0.5684658],"genre_scores_gemma":[0.95600367,0.0011678895,0.013488402,0.0006814136,0.0005294041,0.00007707152,0.00066700764,0.00022217043,0.027162967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870217,0.00023300642,0.000085297084,0.00046522685,0.0002763159,0.00023795989],"domain_scores_gemma":[0.9938672,0.003249456,0.00043099257,0.0009501846,0.0009252915,0.0005768439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010827678,0.0004853836,0.00066192925,0.0021485363,0.0015891531,0.0029679085,0.0007859939,0.00095320964,0.016271828],"category_scores_gemma":[0.008263114,0.00040950597,0.00085204566,0.0013248906,0.0051863827,0.010620456,0.0031879127,0.003133474,0.0015555122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031124044,0.000015017369,0.0004631555,0.00004016875,0.000008104887,0.00008830408,0.0003117631,0.00021837697,0.0005330513,0.9901905,0.0015244755,0.006575985],"study_design_scores_gemma":[0.000012807572,0.000010480996,0.00040244163,0.000023775812,0.000011216641,0.00023636899,0.00017349802,0.00054959557,0.00062018185,0.98919207,0.008759493,0.000008059235],"about_ca_topic_score_codex":0.0014415166,"about_ca_topic_score_gemma":0.0011452651,"teacher_disagreement_score":0.016271828,"about_ca_system_score_codex":0.001220822,"about_ca_system_score_gemma":0.0005212782,"threshold_uncertainty_score":0.054434717},"labels":[],"label_agreement":null},{"id":"W2963762723","doi":"10.1016/j.comgeo.2019.04.004","title":"Approximating dominating set on intersection graphs of rectangles and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:mi mathvariant=\"sans-serif\">L</mml:mi></mml:math>-frames","year":2019,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Diagonal; Combinatorics; Intersection (aeronautics); Mathematics; Approximation algorithm; Line (geometry); Logarithm; Line segment; Dominating set; Discrete mathematics; Geometry; Graph; Mathematical analysis","score_opus":0.01817942780823386,"score_gpt":0.2655638147394427,"score_spread":0.24738438693120882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963762723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36147282,0.0015846154,0.6098288,0.0015029581,0.00016765772,0.00021464497,0.0025620486,0.0010794792,0.021586975],"genre_scores_gemma":[0.61702853,0.0010250789,0.3664624,0.00028981315,0.00015482298,0.00018252524,0.0050137606,0.0005076116,0.00933539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978072,0.0007083664,0.00009890039,0.00057878345,0.00046574645,0.0003410393],"domain_scores_gemma":[0.99116373,0.005836886,0.0006731926,0.0010271895,0.000729281,0.0005698576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00205473,0.0012883021,0.001739337,0.0025024477,0.0010282696,0.0034836875,0.002725054,0.0011057536,0.0063908277],"category_scores_gemma":[0.012678498,0.0009796479,0.0015085385,0.0039059622,0.0012648718,0.0038681687,0.0023458682,0.0016553813,0.0010137206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013722283,0.0003186629,0.008763983,0.0007977737,0.00026804744,0.00037221305,0.001041752,0.5702512,0.006320544,0.2544041,0.022396363,0.13369308],"study_design_scores_gemma":[0.0000640419,0.00010836046,0.0016386778,0.00007481333,0.00007284961,0.00025153125,0.0004195039,0.84884894,0.003351421,0.14010045,0.0050457837,0.000023678293],"about_ca_topic_score_codex":0.0067110336,"about_ca_topic_score_gemma":0.009493184,"teacher_disagreement_score":0.0067110336,"about_ca_system_score_codex":0.0027727187,"about_ca_system_score_gemma":0.0013815745,"threshold_uncertainty_score":0.02137947},"labels":[],"label_agreement":null},{"id":"W2963801174","doi":"10.23638/dmtcs-20-2-4","title":"Complexity of locally-injective homomorphisms to tournaments","year":2018,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Injective function; Homomorphism; Monomorphism; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.34966476415136444,"score_gpt":0.5757027221290926,"score_spread":0.22603795797772813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963801174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91031194,0.0005028636,0.06886377,0.0026568472,0.000069740134,0.00022938113,0.002101607,0.0010410041,0.014222883],"genre_scores_gemma":[0.9756443,0.00034958922,0.015765835,0.00023438928,0.00011969675,0.00014794593,0.0024080202,0.0001682697,0.005161977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971873,0.0007409155,0.0002106713,0.00082949956,0.00039009706,0.0006414214],"domain_scores_gemma":[0.98154724,0.013523961,0.0013943614,0.0014345302,0.00052343734,0.0015764731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001706205,0.0008939987,0.001494391,0.000743605,0.0015180511,0.007208166,0.0036288782,0.0020137853,0.014881443],"category_scores_gemma":[0.014895955,0.0008634166,0.0018913606,0.0015056187,0.0026226742,0.009629113,0.0037696804,0.0032520061,0.0009851735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039129155,0.001865533,0.02832776,0.002054628,0.0005755668,0.0014966296,0.005666495,0.2875203,0.015511352,0.5338172,0.019177247,0.10007444],"study_design_scores_gemma":[0.00048266185,0.0002454456,0.0032085637,0.000060893122,0.0001905608,0.0005983525,0.0012518574,0.25914314,0.0050350237,0.72602814,0.0036814776,0.00007391159],"about_ca_topic_score_codex":0.0036979616,"about_ca_topic_score_gemma":0.0031226687,"teacher_disagreement_score":0.014881443,"about_ca_system_score_codex":0.002847446,"about_ca_system_score_gemma":0.0018763596,"threshold_uncertainty_score":0.04978335},"labels":[],"label_agreement":null},{"id":"W2963873020","doi":"10.1007/s00493-017-3538-5","title":"Treewidth of Grid Subsets","year":2017,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Treewidth; Combinatorics; Grid; Graph; Pathwidth; Geometry","score_opus":0.029705580329058148,"score_gpt":0.31315980002095173,"score_spread":0.2834542196918936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963873020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8029748,0.0007730683,0.13705419,0.001647429,0.000067281726,0.00005084235,0.0021337692,0.00038851783,0.054910086],"genre_scores_gemma":[0.95711136,0.0006573924,0.028992094,0.00029276512,0.00008286717,0.00010132021,0.0018822729,0.00020486736,0.010675072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995776,0.00009306846,0.000028485234,0.00009586923,0.00009358013,0.00011148103],"domain_scores_gemma":[0.99777657,0.0012647989,0.00022702561,0.00027409545,0.00019743334,0.00026002884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004377851,0.00035288004,0.0007604785,0.0011458604,0.0010572225,0.003515198,0.001195355,0.0006760448,0.009726813],"category_scores_gemma":[0.0029664284,0.00054532365,0.0004353267,0.0022183964,0.0009820791,0.0042056274,0.0015482258,0.0013846542,0.00095320155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004318877,0.00008341386,0.004408574,0.00017534533,0.000038390084,0.00021754713,0.0010146527,0.00863873,0.006818578,0.93963087,0.0065588476,0.031983245],"study_design_scores_gemma":[0.00005466158,0.000029434048,0.0015763215,0.0000354153,0.000035049332,0.00028126655,0.0004432094,0.023465881,0.0024791523,0.96526384,0.0063252817,0.000010497937],"about_ca_topic_score_codex":0.0012826908,"about_ca_topic_score_gemma":0.0014529134,"teacher_disagreement_score":0.009726813,"about_ca_system_score_codex":0.0007146966,"about_ca_system_score_gemma":0.00044370396,"threshold_uncertainty_score":0.032539487},"labels":[],"label_agreement":null},{"id":"W2963899823","doi":"10.7151/dmgt.1799","title":"Domination, Eternal Domination, and Clique Covering","year":2015,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Goddard Space Flight Center","keywords":"Mathematics; Clique; Combinatorics; Domination analysis; Clique number; Graph; Vertex (graph theory)","score_opus":0.28178989398822973,"score_gpt":0.5788230662058917,"score_spread":0.297033172217662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963899823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5494438,0.0008821593,0.38494667,0.0010178838,0.000058333782,0.00009587906,0.00061018794,0.00014541013,0.06279961],"genre_scores_gemma":[0.97801447,0.0004869964,0.014151053,0.000104001505,0.00008140681,0.000070617134,0.00021024897,0.00002574041,0.0068553793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893254,0.0002873318,0.0000456198,0.00023157132,0.00024699324,0.00025598676],"domain_scores_gemma":[0.99262977,0.0042679054,0.0012072516,0.00077781314,0.0005015846,0.00061571354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010641975,0.00038935806,0.00043111216,0.0010536822,0.0012886015,0.0013218542,0.0007768998,0.00044223174,0.003874025],"category_scores_gemma":[0.0053878245,0.00024431385,0.00051830226,0.0011569754,0.0030630599,0.0032721628,0.0017655974,0.0010990577,0.00024433158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021231353,0.00005807463,0.003506451,0.00007835781,0.0000389217,0.00016944182,0.00040652018,0.029056175,0.004601167,0.941613,0.0013927176,0.018866826],"study_design_scores_gemma":[0.000038773243,0.00009676312,0.0022426145,0.000035001325,0.000031750726,0.00036654342,0.00016514868,0.10080842,0.0029898307,0.88661325,0.006583454,0.000028346694],"about_ca_topic_score_codex":0.0022609646,"about_ca_topic_score_gemma":0.0020650318,"teacher_disagreement_score":0.003874025,"about_ca_system_score_codex":0.0009814916,"about_ca_system_score_gemma":0.00058194273,"threshold_uncertainty_score":0.012959957},"labels":[],"label_agreement":null},{"id":"W2963906609","doi":"","title":"On the hypercompetition numbers of hypergraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Digraph; Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.02624788001298216,"score_gpt":0.25014753469931567,"score_spread":0.2238996546863335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963906609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3410377,0.010001283,0.44248405,0.0037958564,0.00058526563,0.00030812435,0.0022366159,0.0006403217,0.19891085],"genre_scores_gemma":[0.8486037,0.0049786693,0.12893167,0.00074363453,0.0008184787,0.0006729849,0.0014040088,0.00025042737,0.013596388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710494,0.0007485043,0.00014372966,0.00063231104,0.00085164566,0.00051884865],"domain_scores_gemma":[0.9746962,0.020255258,0.0013355558,0.0013256541,0.0011232487,0.0012640713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025928568,0.0015276356,0.0010205854,0.005315633,0.0017755141,0.0032215791,0.0019392004,0.001806289,0.009510934],"category_scores_gemma":[0.018760808,0.00094243995,0.0008562266,0.004471722,0.0050914325,0.008065592,0.002101401,0.004056599,0.0012035415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025186327,0.000077543584,0.002017303,0.00034093388,0.000048964044,0.00021246224,0.00035390203,0.02414247,0.003901852,0.9286677,0.005658718,0.034326423],"study_design_scores_gemma":[0.000052409214,0.000104192884,0.0018783906,0.00014790997,0.000046344398,0.00064424705,0.00013858147,0.06390828,0.0040051355,0.91793877,0.011066874,0.00006886282],"about_ca_topic_score_codex":0.0014139843,"about_ca_topic_score_gemma":0.001409657,"teacher_disagreement_score":0.009510934,"about_ca_system_score_codex":0.0031251365,"about_ca_system_score_gemma":0.0011888376,"threshold_uncertainty_score":0.031817257},"labels":[],"label_agreement":null},{"id":"W2963938510","doi":"","title":"Nonmedian Direct Products of Graphs with Loops.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.021286525295279517,"score_gpt":0.26126204148081067,"score_spread":0.23997551618553115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963938510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56288445,0.002102153,0.22097315,0.00090700533,0.00034934605,0.000070155715,0.0011307845,0.0007526577,0.21083027],"genre_scores_gemma":[0.8901134,0.0007178203,0.042382717,0.00025763502,0.00023419199,0.000059358594,0.00086010055,0.00022735888,0.0651474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995571,0.000082899605,0.000028641827,0.00013531564,0.00012812721,0.00006794546],"domain_scores_gemma":[0.99820423,0.00070776546,0.00037012727,0.0002453642,0.00024478577,0.00022782927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003579449,0.00040982582,0.00039702153,0.0009273412,0.001024771,0.0021137302,0.0007872206,0.0004889572,0.0131093105],"category_scores_gemma":[0.0020215174,0.00041660925,0.00041160022,0.00082177337,0.0009288365,0.0040660766,0.0016186453,0.0010173116,0.0028088267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011545178,0.00004704071,0.001274644,0.00010814189,0.000025074049,0.00038384742,0.00038621176,0.000880884,0.0035861095,0.9696035,0.003063775,0.020525262],"study_design_scores_gemma":[0.000014185949,0.00003595223,0.0007325574,0.000027530645,0.000021859374,0.000646491,0.00019566595,0.002650043,0.0026894528,0.9745507,0.01842343,0.000012114484],"about_ca_topic_score_codex":0.00032242236,"about_ca_topic_score_gemma":0.00090571877,"teacher_disagreement_score":0.0131093105,"about_ca_system_score_codex":0.00053844036,"about_ca_system_score_gemma":0.0003520788,"threshold_uncertainty_score":0.04385495},"labels":[],"label_agreement":null},{"id":"W2963996369","doi":"10.1016/j.tcs.2017.08.018","title":"Compressed cliques graphs, clique coverings and positive zero forcing","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Clique problem; Clique graph; Clique-sum; Clique; Uniqueness; Discrete mathematics; Split graph; Vertex (graph theory); Forcing (mathematics); Chordal graph; Graph; Line graph; 1-planar graph; Voltage graph; Mathematical analysis","score_opus":0.014143678941328121,"score_gpt":0.30547091327431436,"score_spread":0.29132723433298624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963996369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5405872,0.0012276114,0.34882087,0.008341766,0.00043436294,0.00012053624,0.0015470069,0.00093584607,0.097984865],"genre_scores_gemma":[0.9551351,0.0003581105,0.026161104,0.00069371506,0.00039330559,0.00012700583,0.00079590897,0.00023743341,0.016098242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869555,0.00038420036,0.000039430535,0.000316028,0.0003080443,0.00025681328],"domain_scores_gemma":[0.9900427,0.006571151,0.00088636414,0.0012341865,0.00051933073,0.00074636284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011204488,0.00051110616,0.0010819415,0.0014893387,0.0027630972,0.0026656839,0.0014477238,0.0014431147,0.013242354],"category_scores_gemma":[0.009781233,0.00067673717,0.00086040044,0.0017788681,0.0042641447,0.005123146,0.0034122472,0.002861991,0.000732406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014106618,0.000031707717,0.00039928406,0.00006581788,0.000012281004,0.00006727457,0.00022869761,0.006792284,0.0012635309,0.9811608,0.0032646614,0.006572574],"study_design_scores_gemma":[0.000028111155,0.000011230427,0.00022729607,0.00001284793,0.000007764793,0.000077886994,0.0000721843,0.016838713,0.00047342712,0.9804613,0.0017774424,0.000011906509],"about_ca_topic_score_codex":0.0017949783,"about_ca_topic_score_gemma":0.002785781,"teacher_disagreement_score":0.013242354,"about_ca_system_score_codex":0.0016131734,"about_ca_system_score_gemma":0.0011183688,"threshold_uncertainty_score":0.04430014},"labels":[],"label_agreement":null},{"id":"W2964047879","doi":"10.1002/jgt.22362","title":"Optimal-size clique transversals in chordal graphs&#13;\\n","year":2018,"lang":"en","type":"article","venue":"Warwick Research Archive Portal (University of Warwick)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Treewidth; Clique-sum; Split graph; Vertex (graph theory); Clique graph; Discrete mathematics; Clique; Block graph; Graph; Pathwidth; 1-planar graph; Line graph; Graph power","score_opus":0.027251470751161484,"score_gpt":0.2977006788881615,"score_spread":0.270449208137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964047879","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85709935,0.0010627289,0.111040026,0.0026024797,0.0002068634,0.0003073192,0.003189882,0.0005637954,0.023927467],"genre_scores_gemma":[0.9322498,0.0005764613,0.06053218,0.00031495874,0.00010774281,0.000103531085,0.001849956,0.0001694397,0.0040961443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887043,0.00025382463,0.00006144935,0.00035318066,0.0001566673,0.00030440165],"domain_scores_gemma":[0.9898302,0.005391733,0.0010932919,0.0016247645,0.00069432723,0.0013658215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011816443,0.00056281313,0.001093194,0.0006458493,0.0011883865,0.0020725688,0.0017267779,0.0010331814,0.0080259945],"category_scores_gemma":[0.008118566,0.0007896635,0.00073477766,0.00085279054,0.0011605794,0.003394163,0.0019400868,0.0012571759,0.000853841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006288535,0.0009696093,0.021425568,0.0020055126,0.0004303838,0.0014490505,0.0015029523,0.16508421,0.1566847,0.44980153,0.055965103,0.13839288],"study_design_scores_gemma":[0.00064204325,0.00069621025,0.0072932504,0.00020182057,0.00019419559,0.0019294188,0.0018999425,0.35498983,0.040346824,0.5708247,0.020877378,0.00010443587],"about_ca_topic_score_codex":0.0019005294,"about_ca_topic_score_gemma":0.0038155576,"teacher_disagreement_score":0.0080259945,"about_ca_system_score_codex":0.0011851043,"about_ca_system_score_gemma":0.0009725647,"threshold_uncertainty_score":0.026849687},"labels":[],"label_agreement":null},{"id":"W2964092672","doi":"10.37236/7280","title":"On the Stability of Independence Polynomials","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Independence (probability theory); Combinatorics; Discrete mathematics; Independence number; Polynomial; Graph; Tutte polynomial; Line graph; Voltage graph; Mathematical analysis; Statistics","score_opus":0.019542479260622428,"score_gpt":0.2822583539937257,"score_spread":0.26271587473310326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964092672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8008735,0.00035443413,0.16895874,0.0009750319,0.000036462832,0.000042163396,0.00034431322,0.0001988127,0.028216526],"genre_scores_gemma":[0.99252725,0.00015645749,0.004766716,0.000052646097,0.000056296347,0.000024338142,0.00014469361,0.000054356748,0.0022172774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914074,0.00020930117,0.000023536073,0.00020936005,0.00023916076,0.00017776835],"domain_scores_gemma":[0.98639977,0.009915909,0.0010174628,0.0007912624,0.0012119622,0.00066363165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619866,0.0003843727,0.0004487667,0.0013708547,0.0009810607,0.0012845326,0.00049606524,0.0004296602,0.0041936166],"category_scores_gemma":[0.010789482,0.00024413317,0.00048624148,0.00086440437,0.0023594687,0.00207574,0.0010889393,0.0016889708,0.0006337705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005065927,0.00012131758,0.0057702316,0.000114339746,0.000045603516,0.00043303857,0.000829432,0.06489951,0.030371604,0.86262435,0.0026970045,0.031586885],"study_design_scores_gemma":[0.00005246612,0.000085942534,0.0028643222,0.000017349555,0.000020760202,0.00020751308,0.00020315078,0.1906318,0.009319752,0.7948053,0.0017512749,0.000040349583],"about_ca_topic_score_codex":0.0014002763,"about_ca_topic_score_gemma":0.0009330782,"teacher_disagreement_score":0.0041936166,"about_ca_system_score_codex":0.0009919797,"about_ca_system_score_gemma":0.0004723969,"threshold_uncertainty_score":0.014029026},"labels":[],"label_agreement":null},{"id":"W2964198119","doi":"","title":"Some results on incidence coloring, star arboricity and domination number","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Arboricity; Mathematics; Combinatorics; Chromatic scale; Cartesian product; Upper and lower bounds; Incidence (geometry); Graph; Star (game theory); Discrete mathematics; Planar graph; Geometry","score_opus":0.02777843236157208,"score_gpt":0.3201904935998652,"score_spread":0.2924120612382931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964198119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36750102,0.004318223,0.4541664,0.001416427,0.00039336525,0.0001427792,0.0014513924,0.00059375307,0.17001668],"genre_scores_gemma":[0.93552566,0.0026816833,0.053118702,0.00022481997,0.00036524367,0.00013103994,0.00079856627,0.00016016306,0.006994047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892586,0.00011941081,0.00007774034,0.000275481,0.00031307255,0.00028841788],"domain_scores_gemma":[0.99171185,0.0059116073,0.0005990399,0.000553164,0.0007878051,0.00043653735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010879065,0.0009222848,0.00063774775,0.0040957355,0.0011754094,0.00161068,0.0011653178,0.0004910242,0.005743901],"category_scores_gemma":[0.0057637873,0.00037659158,0.0012089555,0.0027681158,0.0026268235,0.0034187215,0.0011902411,0.0029505615,0.00052245584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037624026,0.00022522152,0.010485558,0.00076090446,0.00009912663,0.00042771298,0.0010195941,0.04508614,0.03892805,0.81633425,0.0051238234,0.08113351],"study_design_scores_gemma":[0.000046864574,0.0002245198,0.013356671,0.0001432682,0.00020363781,0.0006924342,0.00039403024,0.084147155,0.04434204,0.8320135,0.024282424,0.00015343429],"about_ca_topic_score_codex":0.002635607,"about_ca_topic_score_gemma":0.0034650876,"teacher_disagreement_score":0.005743901,"about_ca_system_score_codex":0.0022480665,"about_ca_system_score_gemma":0.0008493468,"threshold_uncertainty_score":0.019215226},"labels":[],"label_agreement":null},{"id":"W2964203300","doi":"10.2140/involve.2019.12.1423","title":"Total Roman domination edge-critical graphs","year":2019,"lang":"en","type":"article","venue":"Involve a Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Dominating set; Graph; Domination analysis; Minimum weight; Induced subgraph","score_opus":0.022744303336145095,"score_gpt":0.30568937959170345,"score_spread":0.28294507625555837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964203300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8143234,0.0006569921,0.114683785,0.00045227347,0.00005132435,0.000105233834,0.0007121296,0.00026664877,0.068748124],"genre_scores_gemma":[0.9755484,0.00038397498,0.013799602,0.00011982362,0.000046985584,0.000060566344,0.00051614613,0.000050136714,0.009474446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996309,0.000054098127,0.0000192985,0.00009939603,0.00010306987,0.00009318845],"domain_scores_gemma":[0.99797505,0.0007783953,0.00029780332,0.0001585264,0.00039774174,0.0003925954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041648457,0.00059006474,0.00044813848,0.0021252048,0.0011686584,0.0013865437,0.00076576136,0.00039639868,0.0034184568],"category_scores_gemma":[0.0022646529,0.00033802888,0.00038397,0.0011481473,0.0015775919,0.0018439586,0.0010798414,0.00063676084,0.00031217505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015810099,0.000037803442,0.0034077608,0.00019399148,0.000046270503,0.0003387569,0.00061123894,0.013101696,0.013114066,0.9449182,0.002521553,0.021550566],"study_design_scores_gemma":[0.000049118215,0.00006138905,0.0032704673,0.000052804113,0.00006501927,0.00080230023,0.00040804187,0.050823092,0.009252976,0.91923815,0.015935268,0.00004152024],"about_ca_topic_score_codex":0.0010202563,"about_ca_topic_score_gemma":0.0014414315,"teacher_disagreement_score":0.0034184568,"about_ca_system_score_codex":0.0010244758,"about_ca_system_score_gemma":0.000442221,"threshold_uncertainty_score":0.011435866},"labels":[],"label_agreement":null},{"id":"W2964239655","doi":"","title":"Constructing regular graphs with smallest defining number.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Cardinality (data modeling); Graph; Chromatic scale; Brooks' theorem; Discrete mathematics; Chordal graph; 1-planar graph; Computer science","score_opus":0.011710156329296069,"score_gpt":0.2598272596101379,"score_spread":0.24811710328084186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964239655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27439713,0.0003829576,0.69082266,0.00045516045,0.00011607194,0.0002509771,0.00056505675,0.0015676946,0.03144237],"genre_scores_gemma":[0.43792456,0.00031881317,0.5518971,0.00016145468,0.00003021223,0.00017341062,0.0013232352,0.00046258757,0.0077085504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999255,0.00022147798,0.00003460602,0.00023683677,0.00012258139,0.0001293719],"domain_scores_gemma":[0.997692,0.0008560711,0.00024154196,0.00080047076,0.00022713716,0.000182784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007352715,0.0005939326,0.00053999765,0.0009139529,0.0011251025,0.0009142673,0.0009639863,0.0004765315,0.0029103542],"category_scores_gemma":[0.0034185688,0.00063096103,0.00094550557,0.000708256,0.0011793093,0.0018232655,0.0019098024,0.0010538448,0.0008038411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047014534,0.00032240184,0.0077017983,0.0006311073,0.00007964488,0.0006283639,0.0015999582,0.036678452,0.065058775,0.68013406,0.010883326,0.19581202],"study_design_scores_gemma":[0.00014298798,0.00025134694,0.0035576168,0.00015321262,0.00014549535,0.0021201402,0.0009075925,0.1689105,0.07929094,0.6732526,0.0711288,0.00013875257],"about_ca_topic_score_codex":0.0009435041,"about_ca_topic_score_gemma":0.002095141,"teacher_disagreement_score":0.0029103542,"about_ca_system_score_codex":0.0008948978,"about_ca_system_score_gemma":0.000853998,"threshold_uncertainty_score":0.009736061},"labels":[],"label_agreement":null},{"id":"W2964291259","doi":"","title":"More on total monochromatic connection of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Monochromatic color; Graph; Connectivity; Path graph; Discrete mathematics; Complete graph; Graph power; Line graph; Physics","score_opus":0.016327045608882398,"score_gpt":0.2884815805784785,"score_spread":0.27215453496959613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964291259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09469377,0.04060519,0.54796654,0.009862498,0.0036401225,0.00019838073,0.002573324,0.001582025,0.29887825],"genre_scores_gemma":[0.72212785,0.021395331,0.1552882,0.011870387,0.004680068,0.00029442037,0.0024885149,0.0016843161,0.08017085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986407,0.0002969653,0.000036211986,0.00048125704,0.00029443327,0.0002504735],"domain_scores_gemma":[0.99771667,0.0011748328,0.0002543102,0.00043609602,0.000250912,0.00016720466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012300542,0.0019347271,0.0009022549,0.002652444,0.0014441567,0.0017854117,0.0013083458,0.0016459988,0.016743274],"category_scores_gemma":[0.004162665,0.0005979291,0.0016975591,0.0048588077,0.0020660108,0.007129221,0.0012930761,0.0033259538,0.0019370229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008183823,0.000093226736,0.0016683317,0.00035765386,0.000062416606,0.00025058864,0.0005300137,0.010903371,0.004161891,0.92280984,0.025727404,0.03335347],"study_design_scores_gemma":[0.000022350456,0.00014087406,0.0023114264,0.000113316775,0.000053485826,0.00070650293,0.00018369395,0.024764204,0.0020168917,0.8627745,0.10683798,0.00007482878],"about_ca_topic_score_codex":0.0037863674,"about_ca_topic_score_gemma":0.0044975406,"teacher_disagreement_score":0.016743274,"about_ca_system_score_codex":0.0022358522,"about_ca_system_score_gemma":0.00047879358,"threshold_uncertainty_score":0.056011856},"labels":[],"label_agreement":null},{"id":"W2964757429","doi":"10.1137/1.9781611976465.45","title":"A Fast Minimum Degree Algorithm and Matching Lower Bound","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Heuristics; Combinatorics; Time complexity; Mathematics; Running time; Binary logarithm; Simple (philosophy); Reduction (mathematics); Algorithm; Graph; Upper and lower bounds; Discrete mathematics; Mathematical optimization","score_opus":0.07690993821574797,"score_gpt":0.2769575518587669,"score_spread":0.20004761364301893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964757429","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012371402,0.0014584792,0.94674057,0.001349426,0.00026407646,0.00016517665,0.00046677946,0.0018708117,0.035313297],"genre_scores_gemma":[0.1482355,0.0015609481,0.81750727,0.0008776688,0.0004208467,0.00035125017,0.0014455635,0.0012288919,0.02837208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711466,0.00045155964,0.00012428263,0.00077861326,0.0011013272,0.0004295128],"domain_scores_gemma":[0.9957147,0.0023408122,0.00024126748,0.0010009563,0.00053325313,0.00016886306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014602023,0.0016083821,0.0011948536,0.0016765448,0.0014649824,0.0034707433,0.0029970803,0.0020451585,0.01618937],"category_scores_gemma":[0.009411371,0.00084045157,0.0015594177,0.0033750262,0.0012369722,0.0069788382,0.0029134662,0.0035322206,0.0068526254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042566613,0.00033251572,0.0009452101,0.0005700457,0.00007764894,0.00015461963,0.00017464897,0.13623202,0.012746137,0.42956236,0.041557115,0.37722203],"study_design_scores_gemma":[0.000095857766,0.0001474381,0.00046430287,0.00009453647,0.00004978863,0.00040682947,0.000056096113,0.50378704,0.009071055,0.4430555,0.04271667,0.000054801767],"about_ca_topic_score_codex":0.0020473348,"about_ca_topic_score_gemma":0.0025486434,"teacher_disagreement_score":0.01618937,"about_ca_system_score_codex":0.0027764721,"about_ca_system_score_gemma":0.0026279532,"threshold_uncertainty_score":0.054158807},"labels":[],"label_agreement":null},{"id":"W2966560041","doi":"10.1007/978-3-030-25027-0_17","title":"On the Tractability of Covering a Graph with 2-Clubs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Treewidth; Bipartite graph; Combinatorics; Planar graph; Vertex cover; Computer science; Graph; Discrete mathematics; Pathwidth; Bounded function; Mathematics; Line graph","score_opus":0.01847064711104523,"score_gpt":0.2587484430426983,"score_spread":0.24027779593165305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966560041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43693507,0.0024702488,0.35112146,0.0072629345,0.00031540878,0.00037730037,0.0038636585,0.0016614046,0.19599251],"genre_scores_gemma":[0.87492204,0.0029696492,0.078285985,0.0009892734,0.000674612,0.0007835553,0.0042361305,0.0013000858,0.035838746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700254,0.0010564377,0.00014166125,0.00068265555,0.000619832,0.0004969118],"domain_scores_gemma":[0.9657966,0.028584523,0.0014868738,0.0022627104,0.00075404363,0.001115218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002183079,0.0015601618,0.002739175,0.002685923,0.0031933573,0.005929658,0.0038346832,0.0036999348,0.021571249],"category_scores_gemma":[0.02049301,0.0017457437,0.0036670484,0.00508437,0.004505712,0.012270536,0.0047519878,0.005783637,0.0019182413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006367827,0.00022809522,0.0020726586,0.00075758074,0.0001578382,0.0004311945,0.0009900109,0.14196032,0.003494916,0.8073699,0.013032033,0.028868718],"study_design_scores_gemma":[0.000056037275,0.00006420039,0.0005469292,0.00008644249,0.000056493376,0.00026220584,0.00011964143,0.11586108,0.00076331804,0.87864256,0.003514345,0.00002682546],"about_ca_topic_score_codex":0.005401136,"about_ca_topic_score_gemma":0.004962024,"teacher_disagreement_score":0.021571249,"about_ca_system_score_codex":0.0036205982,"about_ca_system_score_gemma":0.0018724959,"threshold_uncertainty_score":0.072163045},"labels":[],"label_agreement":null},{"id":"W2967773100","doi":"10.1016/j.ic.2019.104437","title":"Constraint Satisfaction Problems over semilattice block Mal'tsev algebras","year":2019,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semilattice; Constraint satisfaction problem; Mathematics; Conjecture; Mathematical proof; Block (permutation group theory); Class (philosophy); Quotient; Universal algebra; Algebraic structure; Algebra over a field; Discrete mathematics; Combinatorics; Computer science; Pure mathematics; Artificial intelligence","score_opus":0.011934858479193766,"score_gpt":0.26601027037520286,"score_spread":0.2540754118960091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967773100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2380049,0.001202015,0.7171957,0.0031262469,0.00019446298,0.00021854391,0.0016455117,0.00046707923,0.037945542],"genre_scores_gemma":[0.83007,0.00092903373,0.14692199,0.00039811296,0.00027619486,0.0002716658,0.0020323743,0.00023075799,0.018869827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775225,0.0008578506,0.0001744156,0.00027463667,0.00065143034,0.00028941402],"domain_scores_gemma":[0.99416167,0.004131043,0.00038438707,0.00034615098,0.00061786285,0.00035893725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002311666,0.0005954159,0.0013905077,0.0010985459,0.0017230797,0.0042337477,0.0018370452,0.0013489845,0.00915926],"category_scores_gemma":[0.0075022327,0.0007399057,0.0013436441,0.0031259048,0.0020511847,0.006930954,0.0019593514,0.002508665,0.00075886736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014619819,0.000060912396,0.00032929122,0.00015960516,0.000036990397,0.00009913286,0.00023128306,0.027029805,0.0012380412,0.95579505,0.0023337218,0.012539848],"study_design_scores_gemma":[0.000035583227,0.000016583885,0.000087727916,0.000013280867,0.000010380207,0.00004102187,0.00014420185,0.060185775,0.00076450285,0.9368785,0.001809045,0.00001351485],"about_ca_topic_score_codex":0.0053676656,"about_ca_topic_score_gemma":0.006038168,"teacher_disagreement_score":0.00915926,"about_ca_system_score_codex":0.0022914067,"about_ca_system_score_gemma":0.0020230734,"threshold_uncertainty_score":0.03064078},"labels":[],"label_agreement":null},{"id":"W2967821251","doi":"10.1016/j.tcs.2019.08.017","title":"Perfect Roman domination in graphs","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Science and Engineering Research Board","keywords":"Combinatorics; Mathematics; Chordal graph; Interval graph; Bipartite graph; Vertex (graph theory); Minimum weight; Discrete mathematics; Dominating set; Strong perfect graph theorem; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.007997550992975874,"score_gpt":0.27476650948472203,"score_spread":0.26676895849174614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967821251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64803135,0.00095715467,0.06554311,0.002735148,0.00021291699,0.00008530567,0.00047892434,0.0003521785,0.28160393],"genre_scores_gemma":[0.9761553,0.00032677475,0.0049979617,0.00022766371,0.00010567575,0.000041169587,0.00019541274,0.00006551721,0.017884657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979842,0.00076065504,0.00006505821,0.00029371932,0.0004235993,0.00047273762],"domain_scores_gemma":[0.99450123,0.0030782612,0.00064088893,0.0005568458,0.0005162967,0.00070640666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015233257,0.00045138935,0.0009258245,0.0021986386,0.003150885,0.0046086246,0.0010695114,0.0011038292,0.009441176],"category_scores_gemma":[0.008377557,0.00061265967,0.00052989525,0.00232281,0.00375551,0.004542018,0.0023170754,0.0018392692,0.0010245182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071964045,0.000015308986,0.00043473838,0.000035228622,0.0000070442793,0.000066938424,0.00032518336,0.0009962508,0.00039416444,0.9913856,0.0015926473,0.0046749855],"study_design_scores_gemma":[0.000028986147,0.000011622363,0.00035168882,0.000015256401,0.000009297916,0.00013078724,0.0001310547,0.0043466915,0.00047237118,0.9917259,0.0027667389,0.0000096863],"about_ca_topic_score_codex":0.0013429711,"about_ca_topic_score_gemma":0.0014372434,"teacher_disagreement_score":0.009441176,"about_ca_system_score_codex":0.0012592287,"about_ca_system_score_gemma":0.0008773283,"threshold_uncertainty_score":0.031583846},"labels":[],"label_agreement":null},{"id":"W2970565780","doi":"10.1016/j.jctb.2019.08.001","title":"A local epsilon version of Reed's Conjecture","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Conjecture; Clique number; Degree (music); Perfect graph; Graph; Vertex (graph theory); Upper and lower bounds; Chromatic scale","score_opus":0.006527394455921615,"score_gpt":0.24898183700530913,"score_spread":0.2424544425493875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970565780","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4301507,0.0012364635,0.076654054,0.01854169,0.0022156404,0.00008281854,0.0009937821,0.0009305724,0.46919432],"genre_scores_gemma":[0.94514406,0.00054545206,0.007896311,0.0025322458,0.0012535668,0.00009044465,0.00058695814,0.00019549705,0.041755497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986524,0.00027984908,0.0000587591,0.000418155,0.0002923859,0.00029845056],"domain_scores_gemma":[0.99652964,0.0018551149,0.0002674502,0.000633591,0.0003911473,0.0003230964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00145436,0.0012239354,0.0019078056,0.0014140058,0.0022582693,0.003386893,0.0021134636,0.0024444598,0.023727864],"category_scores_gemma":[0.0056441934,0.00057687535,0.0013908248,0.0012999381,0.004076498,0.0078096604,0.0038069598,0.0050127283,0.0033268977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021016524,0.000053091593,0.00046217244,0.000122007,0.000022270679,0.00024401599,0.0002309669,0.001808326,0.0010314325,0.9817837,0.007280302,0.0067514908],"study_design_scores_gemma":[0.000038249364,0.00001901229,0.00018178794,0.000015336083,0.0000110178125,0.00010831414,0.000055949225,0.0023558035,0.00031148084,0.9943733,0.00251568,0.000014087482],"about_ca_topic_score_codex":0.00092561595,"about_ca_topic_score_gemma":0.00073501153,"teacher_disagreement_score":0.023727864,"about_ca_system_score_codex":0.0015797587,"about_ca_system_score_gemma":0.0006994415,"threshold_uncertainty_score":0.07937759},"labels":[],"label_agreement":null},{"id":"W2970633507","doi":"10.4230/lipics.swat.2020.12","title":"A Simple Algorithm for Minimum Cuts in Near-Linear Time","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minimum cut; Combinatorics; Simple (philosophy); Subroutine; Vertex (graph theory); Time complexity; Undirected graph; Minimum spanning tree; Spanning tree; Mathematics; Running time; Algorithm; Matching (statistics); Graph; Enhanced Data Rates for GSM Evolution; Computer science","score_opus":0.021239953373996097,"score_gpt":0.30963520775811404,"score_spread":0.28839525438411795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970633507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002786212,0.00025833858,0.98554915,0.0003178546,0.00013465603,0.00021160078,0.00028589583,0.0053178295,0.005138436],"genre_scores_gemma":[0.024195384,0.0001727587,0.9682009,0.00023954266,0.00008589652,0.0004189028,0.0010735136,0.0009723504,0.0046407823],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997251,0.00037936677,0.00021084916,0.0007718709,0.0010834119,0.00030356576],"domain_scores_gemma":[0.9971739,0.001122636,0.00017301044,0.00088488334,0.00048212928,0.00016343161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011864303,0.0027828973,0.0014308841,0.0020436193,0.0010557349,0.0020562205,0.0037768753,0.0027293868,0.03218807],"category_scores_gemma":[0.007704468,0.0014766369,0.0019091443,0.0032175544,0.0010613297,0.0059205247,0.0042070835,0.004453353,0.013384523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004591212,0.00038621805,0.00049261237,0.0007513462,0.00015237152,0.00026105173,0.00025357655,0.031951647,0.024982933,0.074713595,0.048935413,0.81666017],"study_design_scores_gemma":[0.0008151288,0.00043801215,0.00078085007,0.00015549181,0.00015572258,0.0015125759,0.00016663724,0.38294312,0.02374675,0.5020834,0.08701626,0.00018607023],"about_ca_topic_score_codex":0.0012695277,"about_ca_topic_score_gemma":0.0020950225,"teacher_disagreement_score":0.03218807,"about_ca_system_score_codex":0.0011446538,"about_ca_system_score_gemma":0.0014678157,"threshold_uncertainty_score":0.107679784},"labels":[],"label_agreement":null},{"id":"W2971946515","doi":"10.20382/jocg.v6i1a1","title":"On a Conjecture of Lovász on Circle-Representations of Simple 4-Regular Planar Graphs","year":2012,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund","keywords":"Combinatorics; Planar graph; Mathematics; Conjecture; Simple (philosophy); Discrete mathematics; Realization (probability); Intersection (aeronautics); Graph","score_opus":0.018798535108596904,"score_gpt":0.2717825177839632,"score_spread":0.25298398267536626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971946515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82372135,0.0012997899,0.10891415,0.013595439,0.0002542501,0.0001120826,0.001253078,0.0009579243,0.049891915],"genre_scores_gemma":[0.9771788,0.00058049697,0.016824404,0.00068976235,0.00019546972,0.000086581975,0.0007303665,0.000078885605,0.0036352098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762076,0.0004865166,0.00014820368,0.0008342792,0.00038898544,0.0005211886],"domain_scores_gemma":[0.98748404,0.007836817,0.0010959258,0.0019432753,0.0007153111,0.00092456094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017558092,0.0007358277,0.0013867016,0.0011352752,0.0027647847,0.004000753,0.002025026,0.002809294,0.009350071],"category_scores_gemma":[0.015426842,0.000899228,0.0011771881,0.001928407,0.0065435446,0.00792038,0.0038682865,0.0032531328,0.0013046253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009514394,0.0001306797,0.0039895982,0.00025258333,0.00003680637,0.00035380546,0.001597393,0.022700658,0.005441183,0.93040204,0.013757164,0.020386772],"study_design_scores_gemma":[0.00018975911,0.00012429501,0.0016712432,0.000059406146,0.000043066,0.00037265415,0.0007692306,0.031982943,0.0041494826,0.94713914,0.013410792,0.00008797327],"about_ca_topic_score_codex":0.003294327,"about_ca_topic_score_gemma":0.0020352858,"teacher_disagreement_score":0.009350071,"about_ca_system_score_codex":0.0022665316,"about_ca_system_score_gemma":0.0008418936,"threshold_uncertainty_score":0.031279087},"labels":[],"label_agreement":null},{"id":"W2972155844","doi":"10.1109/focs.2019.00056","title":"Planar Graphs have Bounded Queue-Number","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Treewidth; Combinatorics; 1-planar graph; Mathematics; Planar graph; Discrete mathematics; Graph minor; Pathwidth; Book embedding; Bounded function; Partial k-tree; Line graph; Graph; Graph power","score_opus":0.017161195111059804,"score_gpt":0.29364552239270053,"score_spread":0.27648432728164074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972155844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4062499,0.0008826999,0.5533722,0.0016328237,0.00012917753,0.0001459594,0.00091785745,0.0010032413,0.03566613],"genre_scores_gemma":[0.9225889,0.0007337887,0.06474301,0.00032068015,0.00009334176,0.0001408114,0.00058473065,0.00026807454,0.010526663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988931,0.00013306655,0.000050891915,0.0003305651,0.0003160043,0.00027646127],"domain_scores_gemma":[0.99378914,0.0026470816,0.0011648408,0.00091891474,0.00089708733,0.00058296474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065488036,0.0007959028,0.00075515045,0.0009812036,0.0016475102,0.0030726504,0.0016296671,0.0008146181,0.0066587776],"category_scores_gemma":[0.0061688395,0.00054592744,0.0010695736,0.0012647695,0.002144461,0.007058085,0.0032145616,0.0020808943,0.00075687736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032617777,0.000079348254,0.003534761,0.00023282904,0.00004800009,0.00018729974,0.000634606,0.026286777,0.011704065,0.9281089,0.0027575912,0.026099775],"study_design_scores_gemma":[0.000052075127,0.00018533647,0.0017918677,0.000036853195,0.000086118474,0.00034318722,0.00029534523,0.06927644,0.008749326,0.90310127,0.01603211,0.00004995166],"about_ca_topic_score_codex":0.0030321563,"about_ca_topic_score_gemma":0.003394018,"teacher_disagreement_score":0.0066587776,"about_ca_system_score_codex":0.0023176705,"about_ca_system_score_gemma":0.0010822868,"threshold_uncertainty_score":0.022275805},"labels":[],"label_agreement":null},{"id":"W2972279619","doi":"10.48550/arxiv.1909.03597","title":"Strongly chordal digraphs and $\\Gamma$-free matrices.","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Bipartite graph; Mathematics; Indifference graph; Discrete mathematics; Time complexity; Treewidth; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.04969575684285609,"score_gpt":0.203784953386401,"score_spread":0.15408919654354492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972279619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16053766,0.00064475165,0.7792897,0.0012183574,0.00022992835,0.0003445602,0.0019110431,0.001037242,0.05478679],"genre_scores_gemma":[0.645561,0.0005546345,0.32544217,0.0004984273,0.000103430444,0.0001866564,0.0028810457,0.00015625561,0.02461644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995584,0.00007501038,0.00003094683,0.00017456945,0.000090208734,0.000070852664],"domain_scores_gemma":[0.9990175,0.00039601457,0.0001387886,0.00020765782,0.00013232228,0.00010782418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002259194,0.00048124563,0.0002475605,0.00054841966,0.00065757567,0.0012687837,0.00078813406,0.00049517094,0.006471652],"category_scores_gemma":[0.0019197928,0.00029758626,0.00046896597,0.0007985785,0.000952047,0.002232282,0.0013570951,0.0011289803,0.0009904677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001085628,0.00010468418,0.0015521293,0.00023890707,0.000026051468,0.00024580746,0.0005754112,0.011442397,0.01197227,0.8787268,0.008089957,0.08691697],"study_design_scores_gemma":[0.00003125049,0.00006768497,0.00092682487,0.00003781295,0.000018799863,0.00057462254,0.00023345223,0.0548782,0.0086519355,0.8990076,0.035541173,0.000030495788],"about_ca_topic_score_codex":0.0017288679,"about_ca_topic_score_gemma":0.0032013752,"teacher_disagreement_score":0.006471652,"about_ca_system_score_codex":0.0009777006,"about_ca_system_score_gemma":0.00059661246,"threshold_uncertainty_score":0.021649897},"labels":[],"label_agreement":null},{"id":"W2972297693","doi":"10.37236/8992","title":"The Smallest Matroids with no Large Independent Flat","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Combinatorics; Mathematics; Rank (graph theory); Element (criminal law); Simple (philosophy); Pairwise comparison; Binary number; Discrete mathematics; Statistics; Arithmetic","score_opus":0.008361064287272681,"score_gpt":0.25411332881074344,"score_spread":0.24575226452347076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972297693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8818094,0.0010343888,0.05735079,0.0010142305,0.00008119176,0.00008889406,0.0020594776,0.00046198233,0.05609968],"genre_scores_gemma":[0.9620155,0.0002759467,0.024856636,0.0001281839,0.00010712607,0.000079495534,0.0015009051,0.0000714725,0.010964763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993093,0.0001179516,0.000045684905,0.00022731994,0.00017299115,0.00012688206],"domain_scores_gemma":[0.99832267,0.00043802158,0.00040043605,0.00026929195,0.00016692882,0.00040261488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037077747,0.0006266575,0.0005660979,0.0010181487,0.0013763976,0.002328273,0.0010143617,0.0006076536,0.0051067495],"category_scores_gemma":[0.002205961,0.0006260826,0.00066271384,0.00089301035,0.0012265935,0.002362736,0.0018087038,0.0012088583,0.00094288186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009914619,0.00014559923,0.009487343,0.00082879484,0.00018334044,0.0013407494,0.0012810564,0.012673404,0.051324666,0.8556189,0.010878138,0.055246614],"study_design_scores_gemma":[0.00019792927,0.00050777284,0.020835508,0.00014916553,0.00026968354,0.006298755,0.0011701266,0.039880835,0.04639689,0.8251378,0.058991753,0.00016386957],"about_ca_topic_score_codex":0.00080363324,"about_ca_topic_score_gemma":0.0013354969,"teacher_disagreement_score":0.0051067495,"about_ca_system_score_codex":0.00095535134,"about_ca_system_score_gemma":0.00041325483,"threshold_uncertainty_score":0.017083764},"labels":[],"label_agreement":null},{"id":"W2973098730","doi":"10.4230/lipics.mfcs.2020.20","title":"Homomorphisms of signed graphs: An update","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Grantová Agentura, Univerzita Karlova; European Commission; Univerzita Karlova v Praze","keywords":"Signed graph; Combinatorics; Homomorphism; Graph homomorphism; Mathematics; Discrete mathematics; Adjacency list; Graph; Line graph; Graph power","score_opus":0.024735935971948956,"score_gpt":0.2980308278716488,"score_spread":0.27329489189969985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973098730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02543602,0.004315428,0.88232017,0.004319855,0.004414254,0.00020272651,0.0020196785,0.0023148044,0.074657045],"genre_scores_gemma":[0.3010892,0.0061629526,0.626123,0.0020132305,0.004249156,0.00026838476,0.0029100904,0.0013023103,0.055881687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983753,0.0003189707,0.00012459485,0.0006056086,0.00046879932,0.0001066789],"domain_scores_gemma":[0.9961767,0.001279571,0.0001411425,0.0015781106,0.00067888614,0.0001454682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015088544,0.0007271279,0.00067204854,0.0020436826,0.0013303314,0.003299454,0.0019243631,0.0009981756,0.0155325765],"category_scores_gemma":[0.009950192,0.0007541846,0.0013084406,0.0024210152,0.0019854777,0.011449174,0.0031056495,0.0034891262,0.0042631226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010004366,0.00009961789,0.00058721314,0.00019817206,0.00003098091,0.00014384376,0.00030716797,0.0037672948,0.0024978665,0.7482457,0.024030507,0.21999153],"study_design_scores_gemma":[0.00002976482,0.00007998028,0.0006906073,0.0000851825,0.00005526352,0.0006060808,0.00016896949,0.029279381,0.004832706,0.77916086,0.18495038,0.000060863716],"about_ca_topic_score_codex":0.0019135298,"about_ca_topic_score_gemma":0.0022629544,"teacher_disagreement_score":0.0155325765,"about_ca_system_score_codex":0.0018993121,"about_ca_system_score_gemma":0.0010715143,"threshold_uncertainty_score":0.05196166},"labels":[],"label_agreement":null},{"id":"W2978207776","doi":"10.1016/j.entcs.2019.08.033","title":"On Coloring a Class of Claw-free Graphs","year":2019,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cograph; Chordal graph; Split graph; Graph coloring; 1-planar graph; Discrete mathematics; Line graph; Pathwidth; Vertex (graph theory); Edge coloring; Indifference graph; Graph; Graph power","score_opus":0.007934784732203454,"score_gpt":0.27098712578760303,"score_spread":0.2630523410553996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978207776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5352656,0.0023284748,0.40989062,0.003153426,0.0002709814,0.0005208557,0.0018950109,0.0023466186,0.044328388],"genre_scores_gemma":[0.8038786,0.0015551033,0.16897213,0.0011366121,0.000377299,0.0004655339,0.0038364928,0.0006804153,0.019097857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988913,0.00015124533,0.000046327896,0.0003785575,0.0002040721,0.00032849977],"domain_scores_gemma":[0.996869,0.0016537228,0.00034843353,0.00051561475,0.0002144386,0.0003988251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064104574,0.0009870558,0.0008218682,0.0020557109,0.002437842,0.0031523649,0.0015589183,0.0012045486,0.0076694884],"category_scores_gemma":[0.00414496,0.0006636623,0.0009895264,0.0024981424,0.0017623075,0.0043694107,0.0019342538,0.0020469704,0.0008788665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010326009,0.00061371044,0.007574693,0.00062543154,0.00012436998,0.00076938927,0.0014383037,0.10855266,0.022043174,0.6311655,0.031638097,0.19442204],"study_design_scores_gemma":[0.0002219016,0.00018805749,0.0028158727,0.00010913784,0.000056967798,0.00089973625,0.00049539586,0.25344586,0.009109531,0.70342237,0.02916216,0.00007293397],"about_ca_topic_score_codex":0.0047163186,"about_ca_topic_score_gemma":0.0046473616,"teacher_disagreement_score":0.0076694884,"about_ca_system_score_codex":0.0027185536,"about_ca_system_score_gemma":0.0013581675,"threshold_uncertainty_score":0.025656939},"labels":[],"label_agreement":null},{"id":"W2978231573","doi":"10.1017/9781316105450.008","title":"Mutualism, Parasitism and Bipartite Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Bipartite graph; Mutualism (biology); Parasitism; Computer science; Combinatorics; Mathematics; Theoretical computer science; Biology; Graph; Ecology","score_opus":0.03334736885314788,"score_gpt":0.2484087533612401,"score_spread":0.21506138450809223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978231573","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032005116,0.06710409,0.09877204,0.009278263,0.0012170312,0.000055076922,0.0003184926,0.00046081733,0.7907891],"genre_scores_gemma":[0.60425967,0.064739056,0.045125365,0.0025380808,0.0018729802,0.00024180734,0.00069989095,0.00029794505,0.28022513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997588,0.00009471339,0.000005947359,0.000038889728,0.000070907096,0.000030702344],"domain_scores_gemma":[0.9995396,0.00031638256,0.000031664833,0.00005067661,0.000027968352,0.000033619875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034639623,0.0003917218,0.00043918536,0.0008724951,0.0007302594,0.0013638351,0.00047554617,0.0008118702,0.011590269],"category_scores_gemma":[0.001292373,0.00024441778,0.00036357588,0.0016756107,0.0020813043,0.0023407883,0.0009206499,0.0011637682,0.0018421385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000782806,0.000006917171,0.00009947717,0.00016741455,0.000011881544,0.00004190508,0.00018069524,0.002121719,0.00039535694,0.94713545,0.018202282,0.031629167],"study_design_scores_gemma":[0.0000023644652,0.000006260375,0.0002514614,0.00005846956,0.0000048581196,0.00011217514,0.000052988442,0.0016885508,0.000092354894,0.945171,0.052554116,0.0000052784044],"about_ca_topic_score_codex":0.0012173454,"about_ca_topic_score_gemma":0.0016865389,"teacher_disagreement_score":0.011590269,"about_ca_system_score_codex":0.0012099255,"about_ca_system_score_gemma":0.00046082414,"threshold_uncertainty_score":0.0387733},"labels":[],"label_agreement":null},{"id":"W2978598014","doi":"10.1002/jgt.22499","title":"The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"FP7 Ideas: European Research Council; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Split graph; Chordal graph; Induced path; Discrete mathematics; Cograph; Induced subgraph; Independent set; Indifference graph; Pathwidth; Block graph; Perfect graph; Modular decomposition; 1-planar graph; Graph; Longest path problem; Line graph; Vertex (graph theory)","score_opus":0.010213124396099182,"score_gpt":0.2832368930464169,"score_spread":0.27302376865031774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978598014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42547488,0.0004485003,0.556089,0.0016405381,0.00006341529,0.00017947447,0.0012444082,0.0012511767,0.013608655],"genre_scores_gemma":[0.7963875,0.00027378518,0.19180515,0.0003774915,0.000096172,0.00022067275,0.0028772783,0.00037524028,0.0075867414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990558,0.0001778258,0.000041981963,0.000304385,0.00018934748,0.00023058942],"domain_scores_gemma":[0.9941869,0.0035851768,0.000518708,0.00064514385,0.00044422323,0.000619856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011197728,0.0008283368,0.0006509961,0.0019922054,0.0012832694,0.002442054,0.0018022629,0.0010521449,0.0051005366],"category_scores_gemma":[0.0047751293,0.0006029969,0.0010750106,0.0017295575,0.0015530458,0.00317127,0.0016610617,0.0018968658,0.0005431579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009951593,0.00055392995,0.0071514524,0.00041479172,0.0001425807,0.00037644088,0.00065622665,0.14674674,0.018551353,0.6581945,0.022470158,0.14374673],"study_design_scores_gemma":[0.00010463902,0.000057841964,0.0011199021,0.0000376578,0.000027839771,0.00019740478,0.00010548768,0.3001732,0.0054693813,0.6885839,0.0040918794,0.000030815994],"about_ca_topic_score_codex":0.0044408008,"about_ca_topic_score_gemma":0.0031897922,"teacher_disagreement_score":0.0051005366,"about_ca_system_score_codex":0.0020130905,"about_ca_system_score_gemma":0.0013262344,"threshold_uncertainty_score":0.017063022},"labels":[],"label_agreement":null},{"id":"W2979763194","doi":"10.48550/arxiv.1910.05478","title":"Transversal polynomial of r-fold covers","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Transversal (combinatorics); Vertex (graph theory); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.0657120579449282,"score_gpt":0.20741107247876622,"score_spread":0.14169901453383804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979763194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9113789,0.00023216322,0.072326675,0.00042473178,0.000029462384,0.00003689365,0.00026701236,0.00020652785,0.015097636],"genre_scores_gemma":[0.9881937,0.00013159192,0.0064581656,0.00005705497,0.000043858683,0.000028696648,0.0002559749,0.00007438334,0.004756744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990941,0.00010614487,0.000032576383,0.0002278576,0.0002710525,0.0002681763],"domain_scores_gemma":[0.9971878,0.0014256738,0.00039827861,0.00037350733,0.00026515598,0.0003496162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000741819,0.00044401537,0.0006686456,0.0012409502,0.0007705531,0.0017116234,0.0009106459,0.0005886076,0.0060310606],"category_scores_gemma":[0.004080581,0.0003243768,0.0009860783,0.0007444268,0.0019546053,0.0031471727,0.0019473037,0.0017073262,0.000645748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006103472,0.00015872827,0.011044221,0.00024822424,0.00005306094,0.0006127687,0.0014622894,0.033981275,0.029117584,0.8801268,0.0025021678,0.040082622],"study_design_scores_gemma":[0.00008506825,0.0002719667,0.007949487,0.000053378935,0.000077793244,0.00101683,0.00048332688,0.20415851,0.021598654,0.75608486,0.008147357,0.000072783],"about_ca_topic_score_codex":0.002047284,"about_ca_topic_score_gemma":0.001858579,"teacher_disagreement_score":0.0060310606,"about_ca_system_score_codex":0.0017664235,"about_ca_system_score_gemma":0.00058933435,"threshold_uncertainty_score":0.020175934},"labels":[],"label_agreement":null},{"id":"W2980714832","doi":"10.5614/ejgta.2019.7.2.10","title":"Exponent-critical primitive graphs and the Kronecker product","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Exponent; Mathematics; Combinatorics; Critical exponent; Kronecker product; Kronecker delta; Graph; Discrete mathematics; Product (mathematics); Physics; Geometry","score_opus":0.00595558774374082,"score_gpt":0.267807855989703,"score_spread":0.2618522682459622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980714832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.810492,0.00048820398,0.16163488,0.00048712105,0.00009226512,0.00005270878,0.00019518597,0.0001514331,0.0264061],"genre_scores_gemma":[0.9807433,0.0002166279,0.015979066,0.00007377123,0.00007615618,0.000025038431,0.00009482843,0.0000344722,0.002756862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953485,0.00011209064,0.00003551905,0.00012825908,0.0001022678,0.00008705634],"domain_scores_gemma":[0.9955446,0.002210898,0.00066032493,0.00042754444,0.00059371465,0.0005629074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008455052,0.00033114286,0.00037291078,0.0013712295,0.0006875556,0.001349334,0.00042819456,0.0004937483,0.0026285844],"category_scores_gemma":[0.0047005913,0.0003373012,0.0003605304,0.0005701407,0.002342721,0.0031018357,0.0012325646,0.0012161158,0.0003329631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007498735,0.000022727721,0.0011800858,0.000038900293,0.000006866238,0.0003637271,0.0002820864,0.0024864664,0.0047064065,0.9864662,0.0004476933,0.003923876],"study_design_scores_gemma":[0.000019618248,0.000061274746,0.00077724137,0.000021579704,0.000011556359,0.00045097925,0.00015016229,0.014304106,0.0029167715,0.9788643,0.0024028465,0.000019519692],"about_ca_topic_score_codex":0.0003009338,"about_ca_topic_score_gemma":0.00035657067,"teacher_disagreement_score":0.0026285844,"about_ca_system_score_codex":0.000494956,"about_ca_system_score_gemma":0.0003421667,"threshold_uncertainty_score":0.008793533},"labels":[],"label_agreement":null},{"id":"W2981501323","doi":"10.1002/net.21916","title":"A strong formulation for the graph partition problem","year":2019,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Mathematics; Graph; Partition (number theory); Graph partition; Polynomial; Arc (geometry); Combinatorics; Discrete mathematics; Applied mathematics; Mathematical analysis","score_opus":0.021722439373429485,"score_gpt":0.28571800753224563,"score_spread":0.26399556815881614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981501323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01657872,0.00020863258,0.96912307,0.0010377967,0.000103978644,0.00016943764,0.0003613749,0.00018273148,0.012234259],"genre_scores_gemma":[0.36325932,0.0007307023,0.6160591,0.000931263,0.0004440619,0.00062970055,0.0013681664,0.00028726694,0.016290348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758434,0.000975624,0.00010703005,0.00048671674,0.0005619811,0.00028420967],"domain_scores_gemma":[0.9960873,0.0024132775,0.0002736862,0.0005646496,0.00048332015,0.00017780269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022142807,0.0012316885,0.00084711035,0.0007066359,0.00072701945,0.0021984305,0.0023772607,0.0012558427,0.012686451],"category_scores_gemma":[0.005790084,0.0007352652,0.0011074229,0.0011542696,0.0016019302,0.00550461,0.0029807945,0.0048044715,0.0011463113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023563461,0.00018943111,0.00029222463,0.00032524473,0.00004943057,0.00020709402,0.00019838658,0.20645435,0.0052832,0.7174488,0.012044235,0.057271976],"study_design_scores_gemma":[0.00010463818,0.00015134303,0.00023938903,0.000057496938,0.00003659293,0.00017299567,0.0001425482,0.5620131,0.00239408,0.41852725,0.016137512,0.000023144687],"about_ca_topic_score_codex":0.0016847661,"about_ca_topic_score_gemma":0.0027425352,"teacher_disagreement_score":0.012686451,"about_ca_system_score_codex":0.0016310316,"about_ca_system_score_gemma":0.0015890473,"threshold_uncertainty_score":0.042440414},"labels":[],"label_agreement":null},{"id":"W2981502292","doi":"","title":"Clustered colouring in minor-closed classes","year":2019,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Monochromatic color; Friendship graph; Graph; Minor (academic); Chromatic scale; Windmill graph; Discrete mathematics; Petersen graph; Graph power; Line graph; Botany","score_opus":0.02853874918420808,"score_gpt":0.2674424312945282,"score_spread":0.23890368211032015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981502292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59382224,0.0006985323,0.33727393,0.001665401,0.0003233368,0.00022931215,0.0013055413,0.001393785,0.06328786],"genre_scores_gemma":[0.8828148,0.00028848706,0.08368103,0.00040368256,0.00022291213,0.00014020118,0.001449294,0.000664608,0.03033506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983199,0.0003367845,0.000075785654,0.0006097629,0.00034902018,0.00030865087],"domain_scores_gemma":[0.9907541,0.004149446,0.0009279788,0.0015079492,0.0013317012,0.001328931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009118506,0.00046679468,0.0014383196,0.0022251096,0.002222324,0.004065426,0.0022133833,0.0016984271,0.015905982],"category_scores_gemma":[0.007743184,0.0008385869,0.0011577207,0.0021832741,0.0029777256,0.0037715791,0.002503806,0.0022656496,0.0016076986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033394847,0.00010967468,0.002220561,0.00018508088,0.00003439639,0.00018247841,0.0010442601,0.007454156,0.004908067,0.9414799,0.008861409,0.03318601],"study_design_scores_gemma":[0.000044885717,0.000033644177,0.0010633982,0.000029212844,0.00002057773,0.00021142773,0.00020605784,0.02159376,0.001152316,0.96782815,0.007799515,0.000016940523],"about_ca_topic_score_codex":0.002910416,"about_ca_topic_score_gemma":0.0035625058,"teacher_disagreement_score":0.015905982,"about_ca_system_score_codex":0.0023367184,"about_ca_system_score_gemma":0.0008234356,"threshold_uncertainty_score":0.053210795},"labels":[],"label_agreement":null},{"id":"W2981554314","doi":"10.19086/aic.10256","title":"The Structure of Binary Matroids with no Induced Claw or Fano Plane Restriction","year":2019,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Graphic matroid; Conjecture; Discrete mathematics; Binary tree; Vector space; Natural number; Integer (computer science); Computer science","score_opus":0.009253713542886184,"score_gpt":0.2763743689459909,"score_spread":0.2671206554031047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981554314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88570297,0.00091137754,0.059888873,0.0014003207,0.00007835884,0.00006858844,0.0011037487,0.000359163,0.050486624],"genre_scores_gemma":[0.974858,0.0003728895,0.011903231,0.00030883687,0.00015060582,0.00008222493,0.0013171241,0.00006452099,0.010942506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940085,0.00008777975,0.000031023475,0.000186083,0.00017203872,0.00012228749],"domain_scores_gemma":[0.99863464,0.00036476293,0.00035860797,0.00021865914,0.00016236512,0.00026096206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000325909,0.00031791406,0.0004732368,0.0011822128,0.0009425513,0.0023874808,0.00082640495,0.0006995428,0.0045525255],"category_scores_gemma":[0.0022069518,0.000506984,0.000433616,0.0011608453,0.0014353783,0.0030826675,0.0010750075,0.0010892007,0.00063282775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018352676,0.00008053102,0.0020461157,0.000106107305,0.000019696432,0.00025880634,0.00061824825,0.0046054577,0.005533217,0.96654207,0.0026221005,0.017384136],"study_design_scores_gemma":[0.00010526283,0.00010379666,0.0047196904,0.00005506567,0.00003433908,0.0008515738,0.0003275791,0.034141194,0.004323867,0.9385068,0.016784515,0.00004630595],"about_ca_topic_score_codex":0.0019285547,"about_ca_topic_score_gemma":0.0012972208,"teacher_disagreement_score":0.0045525255,"about_ca_system_score_codex":0.001016182,"about_ca_system_score_gemma":0.00033380854,"threshold_uncertainty_score":0.015229702},"labels":[],"label_agreement":null},{"id":"W2982592349","doi":"","title":"Guarding isometric subgraphs and Lazy Cops and Robbers","year":2019,"lang":"en","type":"article","venue":"Acta Mathematica Universitatis Comenianae","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Isometric exercise; Computer science; Computer security; Mathematics; Medicine; Physical therapy","score_opus":0.00905875634261839,"score_gpt":0.22721290579544057,"score_spread":0.2181541494528222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982592349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5959883,0.0010674784,0.29787236,0.0020929244,0.00027437948,0.00011957888,0.0004897285,0.00089498755,0.10120034],"genre_scores_gemma":[0.91614926,0.00043870875,0.044704378,0.0003257535,0.00019931019,0.00012212798,0.00044532362,0.00041724215,0.037197866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990081,0.00023950993,0.000044133794,0.00025570675,0.00021372354,0.00023878446],"domain_scores_gemma":[0.99791664,0.0010057748,0.0002497904,0.00038114865,0.00015827767,0.00028825895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008550924,0.0006525198,0.0012090085,0.0016972368,0.002051832,0.001916025,0.001575518,0.0013344467,0.013165753],"category_scores_gemma":[0.0053558685,0.0008138601,0.0012235064,0.0013799407,0.002510354,0.004283662,0.003726813,0.0024416267,0.0011469175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067758665,0.000034846256,0.00035375822,0.000083316765,0.000020264017,0.00017726388,0.0003658007,0.003168443,0.00075748836,0.98331577,0.0023963419,0.009258956],"study_design_scores_gemma":[0.000018406046,0.00001571949,0.00026095018,0.0000149757725,0.000018765493,0.00013851495,0.00012454943,0.009449401,0.00057354104,0.9866063,0.0027681151,0.000010777165],"about_ca_topic_score_codex":0.0014036375,"about_ca_topic_score_gemma":0.0016163797,"teacher_disagreement_score":0.013165753,"about_ca_system_score_codex":0.00085400086,"about_ca_system_score_gemma":0.0004953053,"threshold_uncertainty_score":0.04404378},"labels":[],"label_agreement":null},{"id":"W2983894478","doi":"10.1002/jgt.22705","title":"Edge‐maximal graphs on orientable and some nonorientable surfaces","year":2021,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Klein bottle; Combinatorics; Mathematics; Torus; Graph; Triangulation; Surface (topology); Projective plane; Discrete mathematics; Geometry","score_opus":0.019268193896181503,"score_gpt":0.2821031157012648,"score_spread":0.2628349218050833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983894478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97528875,0.0002532018,0.013457064,0.0003418233,0.000019751176,0.0000103916045,0.00008576215,0.00005702452,0.01048616],"genre_scores_gemma":[0.9932595,0.00018868262,0.0045071165,0.00004709128,0.000018734154,0.000010514061,0.00016005393,0.000034213528,0.0017740609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997619,0.000059603095,0.000009528495,0.00005823955,0.0000584102,0.000052339543],"domain_scores_gemma":[0.99886036,0.0005024712,0.0002187576,0.000095357,0.00010557353,0.00021749057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003703873,0.00044060985,0.00035500363,0.0011110716,0.0010171216,0.0014268626,0.0005848266,0.00076001236,0.002097097],"category_scores_gemma":[0.001922867,0.00034029648,0.0003348342,0.00067883387,0.0017203351,0.0016224417,0.00089803606,0.0007270582,0.00009868722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106443054,0.00006949281,0.0046280916,0.00014987176,0.000030814936,0.0010725089,0.0009811032,0.016536487,0.011994532,0.9542388,0.0017687525,0.00842313],"study_design_scores_gemma":[0.000050540693,0.000120429315,0.012152577,0.00011889185,0.000082559294,0.0013757435,0.0034838277,0.06423418,0.009039274,0.8984517,0.010842698,0.000047697245],"about_ca_topic_score_codex":0.0010392551,"about_ca_topic_score_gemma":0.0015656352,"teacher_disagreement_score":0.002097097,"about_ca_system_score_codex":0.00078651274,"about_ca_system_score_gemma":0.00028535846,"threshold_uncertainty_score":0.0070155263},"labels":[],"label_agreement":null},{"id":"W2985832939","doi":"10.1002/jgt.22736","title":"Matchings in 1‐planar graphs with large minimum degree","year":2021,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Degree (music); Mathematics; Planar graph; Planar; Matching (statistics); 1-planar graph; Discrete mathematics; Graph; Chordal graph; Computer science; Physics; Statistics","score_opus":0.02410745607518017,"score_gpt":0.28479148291433015,"score_spread":0.26068402683915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985832939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84144175,0.0016414468,0.13216735,0.0023962646,0.0000707299,0.00014234464,0.00068755785,0.00048543434,0.020967098],"genre_scores_gemma":[0.95239687,0.00096181495,0.042235374,0.0003446401,0.00007163082,0.000090503476,0.0003852071,0.00008973822,0.0034242559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894506,0.00020421002,0.000058413483,0.00033331363,0.00023595568,0.0002230824],"domain_scores_gemma":[0.992939,0.0043107257,0.0015115167,0.0004178774,0.0003913312,0.00042947123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090613693,0.0006106092,0.0009404522,0.0018294341,0.0011823716,0.0016353879,0.0015697873,0.0015491608,0.006342292],"category_scores_gemma":[0.008257782,0.0007765242,0.0006251885,0.0021862295,0.0012650063,0.004250363,0.0021781318,0.001145191,0.00063109514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012493083,0.0004016196,0.012925046,0.001275781,0.00025440223,0.0015419516,0.001219331,0.24316975,0.061854083,0.5865275,0.008970058,0.08061115],"study_design_scores_gemma":[0.0001860297,0.00021387784,0.0051258137,0.00011198668,0.00014548846,0.0011985321,0.0005921864,0.20926923,0.01870954,0.75325125,0.011117281,0.00007887713],"about_ca_topic_score_codex":0.0013890842,"about_ca_topic_score_gemma":0.0019484626,"teacher_disagreement_score":0.006342292,"about_ca_system_score_codex":0.0011399363,"about_ca_system_score_gemma":0.0004746547,"threshold_uncertainty_score":0.021217108},"labels":[],"label_agreement":null},{"id":"W2988018498","doi":"10.1016/j.dam.2019.10.002","title":"A class of spectral bounds for Max <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e5114\" altimg=\"si111.svg\"><mml:mi>k</mml:mi></mml:math>-Cut","year":2019,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Adjacency matrix; Eigenvalues and eigenvectors; Class (philosophy); Combinatorics; Enhanced Data Rates for GSM Evolution; Adjacency list; Simple (philosophy); Mathematics; Matrix (chemical analysis); Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Graph; Physics","score_opus":0.020254356451401678,"score_gpt":0.27078287879754376,"score_spread":0.2505285223461421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988018498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027860213,0.004692354,0.80976546,0.004736586,0.0008896658,0.00019197867,0.0023699005,0.0017887692,0.14770511],"genre_scores_gemma":[0.6313563,0.0069929464,0.2776285,0.0058173737,0.004176675,0.0018493722,0.0062220255,0.003581088,0.062375735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476504,0.0011485144,0.00019973174,0.001480059,0.0016784784,0.00072822947],"domain_scores_gemma":[0.9626253,0.028765002,0.0014802782,0.002745947,0.0029100035,0.0014732884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060794293,0.0029424909,0.0019208275,0.006044883,0.0025196297,0.007900461,0.005425394,0.0034698958,0.030350748],"category_scores_gemma":[0.039380115,0.0010846484,0.0023181315,0.004889573,0.003479391,0.011670878,0.0052150544,0.008865575,0.0062198625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020369576,0.00011892828,0.00083521946,0.0004077289,0.0000664783,0.00007213998,0.00019951489,0.010428611,0.0013949688,0.9093313,0.02907201,0.047869436],"study_design_scores_gemma":[0.000030577867,0.00008637432,0.0006937755,0.00023419176,0.00005908648,0.0002484374,0.000115968054,0.06714678,0.0016144583,0.9133656,0.016362417,0.000042371943],"about_ca_topic_score_codex":0.001650457,"about_ca_topic_score_gemma":0.0017724734,"teacher_disagreement_score":0.030350748,"about_ca_system_score_codex":0.0041661095,"about_ca_system_score_gemma":0.0023365794,"threshold_uncertainty_score":0.10153335},"labels":[],"label_agreement":null},{"id":"W2989790471","doi":"10.1145/3470867","title":"The Complexity of Promise SAT on Non-Boolean Domains","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Unary operation; Constraint satisfaction problem; Cover (algebra); Algebraic number; Constraint satisfaction; Fragment (logic); Theory of computation; Benchmark (surveying)","score_opus":0.04378162892982987,"score_gpt":0.31766652297091275,"score_spread":0.27388489404108285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989790471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6067284,0.0041764416,0.29110706,0.032464553,0.00024781816,0.00021617445,0.006648987,0.0009475845,0.057463042],"genre_scores_gemma":[0.9462223,0.0019490519,0.03956033,0.0006832537,0.00047995648,0.00023435062,0.0027325235,0.00020809234,0.007930128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675804,0.0009094524,0.00015568997,0.0006171614,0.0009420492,0.0006177108],"domain_scores_gemma":[0.9783719,0.018609807,0.0009007876,0.0011248249,0.0004830461,0.0005096204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020068495,0.0006874652,0.0013717081,0.00085997954,0.0012357497,0.005960122,0.0027804927,0.0021800708,0.008784687],"category_scores_gemma":[0.014001244,0.00076076307,0.0018990202,0.0023291546,0.0027420812,0.012578243,0.0028823044,0.0052752853,0.00080884126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008772913,0.00027998936,0.00478703,0.0010971371,0.0001840736,0.00043342533,0.00081020384,0.17012836,0.0042573237,0.761109,0.014424299,0.041611806],"study_design_scores_gemma":[0.00010984246,0.0000455209,0.0018244422,0.000051494353,0.00004601516,0.00022353155,0.00022043928,0.2429675,0.0015634641,0.74913996,0.0037756513,0.000032101954],"about_ca_topic_score_codex":0.0037826535,"about_ca_topic_score_gemma":0.0029840968,"teacher_disagreement_score":0.008784687,"about_ca_system_score_codex":0.0031861644,"about_ca_system_score_gemma":0.0017242776,"threshold_uncertainty_score":0.029387712},"labels":[],"label_agreement":null},{"id":"W2990687474","doi":"10.1016/j.dam.2019.11.005","title":"Complexity of correspondence <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e421\" altimg=\"si177.svg\"><mml:mi>H</mml:mi></mml:math>-colourings","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Scalable Vector Graphics; Combinatorics; Algorithm; Discrete mathematics; Computer science; World Wide Web","score_opus":0.02671753300352836,"score_gpt":0.27295696963847255,"score_spread":0.2462394366349442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990687474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25941178,0.0015460186,0.48277974,0.01905266,0.00076508074,0.00045488682,0.013542722,0.0021305636,0.22031648],"genre_scores_gemma":[0.8317277,0.0012684471,0.09179776,0.0015054343,0.0009271476,0.00048218018,0.01000392,0.0011384973,0.06114897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99447787,0.0012727627,0.0004618208,0.0014465364,0.0017639193,0.0005769711],"domain_scores_gemma":[0.97202,0.019293733,0.0017278077,0.0033833107,0.002380712,0.0011944292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018365724,0.00071432546,0.0014522695,0.002649461,0.0035226033,0.011560444,0.0025204674,0.0024422458,0.044242986],"category_scores_gemma":[0.020275103,0.00084447494,0.0025690629,0.0039538615,0.0029377746,0.015770225,0.00498589,0.0038023242,0.0057710134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001917607,0.000080039514,0.0020072318,0.0003281665,0.000067488145,0.00026117632,0.000538231,0.009180209,0.0010624897,0.9369928,0.027114423,0.022175914],"study_design_scores_gemma":[0.000025558265,0.000013340796,0.0004353493,0.000023929098,0.000021424228,0.00022102652,0.00011175865,0.016976174,0.00086249487,0.9734072,0.007878449,0.000023276325],"about_ca_topic_score_codex":0.003737529,"about_ca_topic_score_gemma":0.0031470545,"teacher_disagreement_score":0.044242986,"about_ca_system_score_codex":0.0041541266,"about_ca_system_score_gemma":0.002150679,"threshold_uncertainty_score":0.14800751},"labels":[],"label_agreement":null},{"id":"W2990814010","doi":"10.4230/lipics.isaac.2019.46","title":"A 21/16-Approximation for the Minimum 3-Path Partition Problem","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Approximation algorithm; Combinatorics; Partition (number theory); Partition problem; Mathematics; Graph partition; Greedy algorithm; Discrete mathematics; Graph; Algorithm","score_opus":0.017539987755028318,"score_gpt":0.27483009011971604,"score_spread":0.25729010236468774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990814010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124406084,0.0029624514,0.82974315,0.0049404763,0.00051499705,0.00067938777,0.002302,0.0045578214,0.029893676],"genre_scores_gemma":[0.38295105,0.0014679001,0.59616375,0.0014772038,0.0003563232,0.00084406993,0.004811336,0.001432992,0.010495422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974256,0.0005009015,0.00011958494,0.00074467243,0.0006501141,0.00055897987],"domain_scores_gemma":[0.996473,0.0018266614,0.0003380679,0.00082063396,0.00024144248,0.00030014006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002040576,0.0028028523,0.0021164354,0.0012640487,0.0017195761,0.0033338002,0.003648435,0.0028787723,0.011160504],"category_scores_gemma":[0.01009529,0.0010658111,0.0025723162,0.0030458476,0.0015787302,0.0077479375,0.004435871,0.0049321894,0.003530811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033098343,0.0017095476,0.0038811713,0.0017548281,0.00037191238,0.0005771399,0.0009477215,0.3921585,0.021318054,0.12922256,0.08295203,0.36179674],"study_design_scores_gemma":[0.0003839076,0.00040548027,0.0009475661,0.00014018557,0.00014580261,0.00078086805,0.00026902786,0.7731145,0.0056918366,0.20539264,0.012668976,0.000059169815],"about_ca_topic_score_codex":0.0030103992,"about_ca_topic_score_gemma":0.003930849,"teacher_disagreement_score":0.011160504,"about_ca_system_score_codex":0.0034384339,"about_ca_system_score_gemma":0.0039916392,"threshold_uncertainty_score":0.037335575},"labels":[],"label_agreement":null},{"id":"W2990922105","doi":"10.1016/j.dam.2019.11.011","title":"On the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e20\" altimg=\"si30.svg\"> <mml:msub> <mml:mrow> <mml:mi>P</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>3</mml:mn> </mml:mrow> </mml:msub> </mml:math> -hull number of Hamming graphs","year":2019,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre National de la Recherche Scientifique; Javna Agencija za Raziskovalno Dejavnost RS; Consejo Nacional de Investigaciones Científicas y Técnicas; Providence Health Care","keywords":"Convex hull; Cartesian product; Combinatorics; Mathematics; Vertex (graph theory); Cardinality (data modeling); Graph; Regular polygon; Discrete mathematics; Computer science; Geometry; Database","score_opus":0.01917206347645122,"score_gpt":0.2609959298693984,"score_spread":0.24182386639294717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990922105","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002140127,0.0005082081,0.05794683,0.005607678,0.0032967834,0.00035372542,0.137315,0.04608259,0.74674916],"genre_scores_gemma":[0.019302042,0.0017023209,0.03956797,0.0025167044,0.0013835579,0.00046974127,0.14254598,0.047791783,0.74471986],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925524,0.00010322183,0.00005135578,0.000115507864,0.00039827966,0.00007631699],"domain_scores_gemma":[0.9980805,0.0007028891,0.00009993842,0.00033658752,0.0006117319,0.00016844412],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066211063,0.0012215902,0.0011651303,0.0032533957,0.0010090057,0.004072831,0.002194993,0.0011741152,0.7181351],"category_scores_gemma":[0.004524442,0.0007340057,0.001071372,0.0053191665,0.00062356243,0.0036767004,0.0022497291,0.0019806628,0.5286246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004787977,0.000027732762,0.00009469848,0.00013592553,0.000004858687,0.000035965608,0.000056255303,0.00024812412,0.00074608624,0.013820741,0.95607674,0.028704895],"study_design_scores_gemma":[0.00004587431,0.000019540455,0.0010662653,0.00009499243,0.000006238522,0.00010813686,0.00007166002,0.0017759281,0.0020152642,0.024698956,0.97006524,0.00003193162],"about_ca_topic_score_codex":0.009266398,"about_ca_topic_score_gemma":0.012351878,"teacher_disagreement_score":0.7181351,"about_ca_system_score_codex":0.002297692,"about_ca_system_score_gemma":0.0010110394,"threshold_uncertainty_score":0.40204602},"labels":[],"label_agreement":null},{"id":"W2991049057","doi":"10.1007/978-3-030-45771-6_1","title":"Idealness of k-wise Intersecting Families","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; European Research Council; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Australian Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Element (criminal law); Ideal (ethics); Matroid; Integer (computer science); Discrete mathematics; Class (philosophy); Field (mathematics); Pure mathematics; Computer science; Law","score_opus":0.0318072301925753,"score_gpt":0.3155950046054573,"score_spread":0.283787774412882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991049057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8556936,0.00038266293,0.093055144,0.0005981864,0.00006569795,0.00004393698,0.001015499,0.00042123286,0.048724078],"genre_scores_gemma":[0.97903204,0.00016859076,0.01427756,0.00011599246,0.000077348435,0.0000507307,0.0011610042,0.000076137716,0.00504054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967146,0.00039006834,0.0003029656,0.0010839071,0.0006864584,0.000822102],"domain_scores_gemma":[0.99110353,0.003093104,0.001432347,0.0010940147,0.0014736102,0.0018035257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019193334,0.0005099893,0.00097623316,0.0026114562,0.0034021598,0.0043975967,0.0012300401,0.0008842107,0.009066507],"category_scores_gemma":[0.0066288747,0.0010180208,0.0010297181,0.0017921892,0.004753618,0.007052086,0.0029227077,0.0016083071,0.0009902786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062011345,0.00013937373,0.025783665,0.00016515894,0.000069188194,0.0008806163,0.0029480625,0.0070645385,0.0131632,0.9298578,0.002931119,0.016377252],"study_design_scores_gemma":[0.000055756278,0.00015177332,0.011225793,0.00011366321,0.00008354322,0.003511419,0.0030176,0.018039688,0.017096123,0.92888385,0.017704623,0.000116154326],"about_ca_topic_score_codex":0.0014268626,"about_ca_topic_score_gemma":0.00084409973,"teacher_disagreement_score":0.009066507,"about_ca_system_score_codex":0.0017128525,"about_ca_system_score_gemma":0.0007832797,"threshold_uncertainty_score":0.03033042},"labels":[],"label_agreement":null},{"id":"W2991601398","doi":"10.5539/jmr.v11n6p84","title":"Perception of Polynomial for Weighted Directed Graph","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Directed graph; Graph; Combinatorics; Discrete mathematics; Contraction (grammar)","score_opus":0.06359058688912131,"score_gpt":0.38972845831169595,"score_spread":0.32613787142257467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991601398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052586623,0.0006780516,0.9139585,0.0015068173,0.00024255262,0.00007718262,0.00022954415,0.0005337,0.030187057],"genre_scores_gemma":[0.7544321,0.001259362,0.23068945,0.00033006913,0.00024362699,0.00015396987,0.000324509,0.00026302144,0.012303831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984363,0.00035668217,0.000063320455,0.00059829146,0.00039005856,0.00015534647],"domain_scores_gemma":[0.99787366,0.0006241309,0.00026949524,0.00038853043,0.00054769474,0.00029647755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081626856,0.0004850668,0.00037272775,0.0012550899,0.0013362647,0.0025476424,0.0010408588,0.00092785957,0.00561315],"category_scores_gemma":[0.005186002,0.00028560532,0.0007786375,0.0011044213,0.0021840471,0.007594825,0.0021905724,0.0016406992,0.00059624214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006968611,0.000025225883,0.0007194692,0.00014442742,0.000012275252,0.00023032863,0.0011489303,0.0037396064,0.008187413,0.9516248,0.0016188453,0.032479007],"study_design_scores_gemma":[0.000019511484,0.00011577377,0.0013549107,0.00006228913,0.00003827595,0.0008828704,0.0012886745,0.062636845,0.0048486684,0.8920279,0.036669012,0.000055272543],"about_ca_topic_score_codex":0.002378618,"about_ca_topic_score_gemma":0.0015959941,"teacher_disagreement_score":0.00561315,"about_ca_system_score_codex":0.0015840017,"about_ca_system_score_gemma":0.000722772,"threshold_uncertainty_score":0.018777847},"labels":[],"label_agreement":null},{"id":"W2991631715","doi":"10.1016/j.tcs.2022.01.005","title":"The weighted k-center problem in trees for fixed k","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Center (category theory); Combinatorics; Mathematics; Computer science; Discrete mathematics; Crystallography; Chemistry","score_opus":0.014145522927294412,"score_gpt":0.28492772715649867,"score_spread":0.27078220422920424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991631715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5265925,0.0029301876,0.41218475,0.011262809,0.0004675082,0.00037489302,0.0042308713,0.0015420754,0.04041441],"genre_scores_gemma":[0.79061484,0.0019122605,0.17813194,0.0011913524,0.0006120334,0.00042537376,0.0031935314,0.0012291437,0.022689441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978574,0.00046188966,0.00011090162,0.0006928593,0.00025320548,0.00062378263],"domain_scores_gemma":[0.9842568,0.0100993775,0.0012833962,0.0016138643,0.0011686804,0.0015779781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002231939,0.0011367016,0.0035839123,0.0017649948,0.0038728644,0.0063419286,0.0061284797,0.0052453936,0.016486954],"category_scores_gemma":[0.019001959,0.0012637773,0.0014802339,0.0038619745,0.0032718596,0.014329034,0.004162819,0.0051912027,0.002099581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024059042,0.00066710514,0.0023022231,0.0015404484,0.00020931104,0.00038718188,0.001192668,0.113721,0.008631308,0.7492141,0.045265127,0.074463665],"study_design_scores_gemma":[0.00021235751,0.00007135575,0.00058448606,0.00009168222,0.00006717101,0.00027183382,0.00049117755,0.12814245,0.0030934121,0.8621147,0.004813153,0.00004624726],"about_ca_topic_score_codex":0.005150758,"about_ca_topic_score_gemma":0.0054238816,"teacher_disagreement_score":0.016486954,"about_ca_system_score_codex":0.0033630705,"about_ca_system_score_gemma":0.0024510534,"threshold_uncertainty_score":0.055154324},"labels":[],"label_agreement":null},{"id":"W2995137628","doi":"10.1137/19m1240964","title":"A Structured Condition Number for Kemeny's Constant","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Mathematics; Markov chain; Constant (computer programming); Combinatorics; Discrete mathematics; Upper and lower bounds; Expected value; Perturbation (astronomy); Markov process; Applied mathematics; Statistics; Mathematical analysis; Computer science","score_opus":0.009487592498764835,"score_gpt":0.33369245791553903,"score_spread":0.3242048654167742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995137628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22063565,0.0010765921,0.74172556,0.0023484444,0.00031772433,0.00022381876,0.0006630825,0.00080107345,0.032208133],"genre_scores_gemma":[0.9171785,0.00050896534,0.07660123,0.00044133645,0.0002335417,0.00036063418,0.00026840164,0.00027331847,0.004133954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783415,0.00052914943,0.00010245662,0.0005923006,0.00068485,0.00025723668],"domain_scores_gemma":[0.9646984,0.02606641,0.002802812,0.0029659206,0.0020002876,0.0014661684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052616536,0.00079149567,0.00074999296,0.0019763778,0.0012808876,0.0017626523,0.0017493922,0.0016456735,0.010015981],"category_scores_gemma":[0.050837137,0.00042083728,0.0008277028,0.00096283667,0.0050465446,0.006352587,0.002144254,0.0039052854,0.00087842735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014232888,0.000044402084,0.0013256627,0.000112067784,0.000022877277,0.00013149041,0.00020726987,0.05021383,0.008818816,0.92774487,0.001948966,0.00928748],"study_design_scores_gemma":[0.000035401525,0.00008832906,0.0010474646,0.00006462926,0.000014623085,0.00013537389,0.00006817252,0.31343305,0.0070542893,0.6761196,0.001851514,0.00008745915],"about_ca_topic_score_codex":0.0010840611,"about_ca_topic_score_gemma":0.00083240855,"teacher_disagreement_score":0.010015981,"about_ca_system_score_codex":0.0027154994,"about_ca_system_score_gemma":0.0018670887,"threshold_uncertainty_score":0.03350681},"labels":[],"label_agreement":null},{"id":"W2995405989","doi":"10.26493/1855-3974.1813.7ae","title":"Reconfiguring vertex colourings of 2-trees","year":2019,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.02250036835189753,"score_gpt":0.266323145948113,"score_spread":0.24382277759621548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995405989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7678424,0.0005129321,0.18644871,0.00033290437,0.0003217162,0.0001597527,0.0005106157,0.001399063,0.04247186],"genre_scores_gemma":[0.86938137,0.00032195542,0.11657444,0.00022767199,0.00007383501,0.0001107482,0.0005219328,0.00027917497,0.01250882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995492,0.00008810732,0.000021091055,0.000094386814,0.000094032366,0.00015313699],"domain_scores_gemma":[0.99856514,0.0005109598,0.00018054899,0.0003683248,0.00014610095,0.00022900559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026264216,0.00029084773,0.0003348262,0.00077767606,0.00086572114,0.0011508074,0.0006445333,0.0005512691,0.003824393],"category_scores_gemma":[0.0020783907,0.00032654844,0.00040514584,0.0007214487,0.00096466194,0.001456208,0.001311426,0.00070708455,0.0008538646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060883857,0.0002866783,0.006741517,0.00030228338,0.00007605044,0.0014169617,0.0019790644,0.10647926,0.11818103,0.59429014,0.009576996,0.16006121],"study_design_scores_gemma":[0.00013146168,0.00033063555,0.004480388,0.00008659092,0.00004932334,0.00094722665,0.0005736789,0.22662237,0.031375736,0.67240256,0.06290713,0.000092863855],"about_ca_topic_score_codex":0.0018171828,"about_ca_topic_score_gemma":0.0034908094,"teacher_disagreement_score":0.003824393,"about_ca_system_score_codex":0.0008237895,"about_ca_system_score_gemma":0.0004665636,"threshold_uncertainty_score":0.012793839},"labels":[],"label_agreement":null},{"id":"W2996084168","doi":"10.1002/jgt.22530","title":"Graph homomorphism reconfiguration and frozen H‐colorings","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Science and Technology; National Research Foundation of Korea; Kyungpook National University","keywords":"Combinatorics; Mathematics; Graph coloring; Homomorphism; Discrete mathematics; Edge coloring; Vertex (graph theory); Nondeterministic algorithm; Graph; Fractional coloring; Graph power; Line graph","score_opus":0.012260161328930238,"score_gpt":0.2509191087115379,"score_spread":0.23865894738260765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996084168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5895427,0.00026191736,0.39521745,0.002063797,0.00011317268,0.0002753433,0.0006562992,0.0009111798,0.010958083],"genre_scores_gemma":[0.9508264,0.00008768364,0.044966236,0.0002592328,0.00004114795,0.00009226663,0.0004457702,0.00005364939,0.0032275966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985417,0.00041989042,0.000074829106,0.0004772704,0.0001719023,0.00031440062],"domain_scores_gemma":[0.9928451,0.0046152007,0.00066050113,0.0011324283,0.00029725116,0.00044954746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012595796,0.00036612523,0.00047623776,0.0003502576,0.0009601979,0.001506373,0.0012146074,0.0008486656,0.0032628665],"category_scores_gemma":[0.0046727653,0.00037690692,0.00078980235,0.0005402744,0.0025115397,0.0035307424,0.0014209341,0.0020769255,0.00024333144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014671957,0.00071359554,0.009107129,0.0005200059,0.00014200795,0.001381481,0.00162357,0.34781608,0.029431092,0.48475245,0.009175926,0.11386949],"study_design_scores_gemma":[0.0001570242,0.00025562104,0.002253169,0.00004768787,0.00004987871,0.00042269606,0.00084749697,0.39521486,0.0183946,0.57482916,0.007463182,0.00006479356],"about_ca_topic_score_codex":0.003334396,"about_ca_topic_score_gemma":0.0022356203,"teacher_disagreement_score":0.003334396,"about_ca_system_score_codex":0.0017684241,"about_ca_system_score_gemma":0.0011315293,"threshold_uncertainty_score":0.012830853},"labels":[],"label_agreement":null},{"id":"W2996115425","doi":"10.1016/j.comgeo.2023.102020","title":"Colouring bottomless rectangles and arborescences","year":2023,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Corollary; Vertex (graph theory); Monochromatic color; Point (geometry); Order (exchange); Line (geometry); Plane (geometry); Discrete mathematics; Geometry; Graph; Optics; Physics","score_opus":0.024630486044784995,"score_gpt":0.3022855409761604,"score_spread":0.2776550549313754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996115425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.297588,0.00069640815,0.6118328,0.0009076965,0.00033535814,0.000087753055,0.0004962828,0.001277124,0.086778514],"genre_scores_gemma":[0.6927177,0.00077349454,0.27244744,0.00042949177,0.00015189995,0.00011553382,0.00095487817,0.00089320325,0.031516485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.00014815552,0.000032619588,0.00018718203,0.000109790315,0.00012336407],"domain_scores_gemma":[0.9978483,0.00089171,0.0002274101,0.0005011092,0.00025040962,0.0002811374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000476376,0.00066979206,0.00061846315,0.0010090143,0.0010397795,0.0023445962,0.0013567067,0.0010244098,0.0125015965],"category_scores_gemma":[0.0031615233,0.0007555053,0.00074880576,0.0013336812,0.0015967822,0.0029125302,0.0022630997,0.0021224653,0.0018058367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020217196,0.000039880702,0.00072515686,0.00015309968,0.000017149989,0.0002828986,0.00039538075,0.010612448,0.014605651,0.92242795,0.0051402226,0.045397915],"study_design_scores_gemma":[0.0000514621,0.00006440811,0.0007747891,0.000076383665,0.000032567434,0.00051008887,0.0002632874,0.041198574,0.008822914,0.92401963,0.024155306,0.000030541334],"about_ca_topic_score_codex":0.0009683878,"about_ca_topic_score_gemma":0.001338558,"teacher_disagreement_score":0.0125015965,"about_ca_system_score_codex":0.0005786187,"about_ca_system_score_gemma":0.00022679672,"threshold_uncertainty_score":0.041822016},"labels":[],"label_agreement":null},{"id":"W2996952245","doi":"10.61091/jcmcc124-48","title":"Generalized domination structure in cubic graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cubic graph; Combinatorics; Graph; Line graph","score_opus":0.011518185236568031,"score_gpt":0.28901297877206544,"score_spread":0.2774947935354974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996952245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6557065,0.001213356,0.28049317,0.0026946103,0.00010591485,0.00026780157,0.0023635435,0.0009344827,0.056220546],"genre_scores_gemma":[0.9339326,0.000498145,0.054163687,0.00032658744,0.00008494003,0.00015264658,0.0013557835,0.00010659518,0.009379022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920756,0.00014739526,0.000029688277,0.00018615437,0.00025677396,0.0001724726],"domain_scores_gemma":[0.99767035,0.0012078921,0.0002803944,0.00031535933,0.00031815114,0.00020775195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047635534,0.00035266095,0.00067364494,0.00080270413,0.0011541602,0.0016514434,0.00097511726,0.0006020893,0.0039920732],"category_scores_gemma":[0.0031339,0.00034160103,0.0005241508,0.001835314,0.0011396338,0.001730892,0.0015543803,0.0010495876,0.00033350792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043144615,0.00013169537,0.0025446794,0.00067422213,0.00006377799,0.0008473988,0.0010732004,0.14634643,0.013161252,0.7482975,0.014546004,0.07188241],"study_design_scores_gemma":[0.0000753605,0.000037062,0.0009137772,0.00002820658,0.000015800877,0.00025292186,0.00013374009,0.20306768,0.0018169304,0.78486013,0.008774805,0.000023605695],"about_ca_topic_score_codex":0.007004671,"about_ca_topic_score_gemma":0.0058478117,"teacher_disagreement_score":0.007004671,"about_ca_system_score_codex":0.0025269133,"about_ca_system_score_gemma":0.0013236243,"threshold_uncertainty_score":0.01833409},"labels":[],"label_agreement":null},{"id":"W2998876001","doi":"10.37236/7879","title":"Maximum Number of Colourings: 5-Chromatic Case","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Conjecture; Chromatic scale; Graph; Discrete mathematics","score_opus":0.00709010829855287,"score_gpt":0.27021139719077947,"score_spread":0.2631212888922266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998876001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84114957,0.0015979918,0.04887676,0.00703048,0.00019727624,0.00010566447,0.0010892095,0.00046184752,0.09949121],"genre_scores_gemma":[0.981632,0.0003376349,0.012364266,0.00031212738,0.00007732815,0.000037250367,0.00036068814,0.000043776035,0.004834879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982943,0.00024500172,0.00008427936,0.0004663372,0.00025341444,0.00065672246],"domain_scores_gemma":[0.9958397,0.0023233204,0.0004961607,0.00046955442,0.00026501805,0.0006063166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013011836,0.0005266274,0.0006483377,0.0013876661,0.002770867,0.0033476956,0.0024039655,0.0022451505,0.011325387],"category_scores_gemma":[0.004732107,0.00063858466,0.0011441355,0.0016376738,0.0035581903,0.0043593366,0.0026876251,0.0022158667,0.000836478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015400958,0.000203092,0.01345726,0.00059642945,0.00013651034,0.0015810796,0.0012462909,0.02845934,0.01643853,0.88929003,0.016497102,0.030554289],"study_design_scores_gemma":[0.00038427723,0.0002508065,0.008019049,0.00013031116,0.000181898,0.0021860613,0.0008185032,0.11402603,0.012364623,0.8359186,0.025610654,0.00010908047],"about_ca_topic_score_codex":0.003602648,"about_ca_topic_score_gemma":0.0055319164,"teacher_disagreement_score":0.011325387,"about_ca_system_score_codex":0.0022318412,"about_ca_system_score_gemma":0.00093137287,"threshold_uncertainty_score":0.037887216},"labels":[],"label_agreement":null},{"id":"W2998968188","doi":"","title":"Maximum linear arrangement of directed graphs","year":2019,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.014556788667066186,"score_gpt":0.2466469829840335,"score_spread":0.2320901943169673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998968188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13007222,0.0028828408,0.7850745,0.0020584953,0.0002421215,0.00012366641,0.0011167871,0.000696633,0.07773274],"genre_scores_gemma":[0.6297308,0.0037024443,0.33764264,0.00041166838,0.00029225895,0.00021663896,0.0022099998,0.00024937277,0.025544131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991658,0.00023075273,0.00004441845,0.00027303386,0.00015972134,0.00012629047],"domain_scores_gemma":[0.9981772,0.0010021339,0.00025469126,0.00022493492,0.00017139978,0.00016977813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048987346,0.00051474315,0.00042403492,0.0008345736,0.00075233664,0.0017625793,0.0010230015,0.00057623896,0.005193126],"category_scores_gemma":[0.0032374847,0.00051009184,0.00037739426,0.002216761,0.0008118345,0.003216654,0.0010410456,0.0012614664,0.0010609602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106324165,0.000100170575,0.001861853,0.00041013266,0.000035396748,0.00024406225,0.00028801395,0.07487817,0.0060421745,0.77807283,0.012977491,0.124983445],"study_design_scores_gemma":[0.0000506937,0.00011251191,0.001197341,0.00009471299,0.000034795616,0.0007221452,0.0004106556,0.16485171,0.0054749125,0.76396084,0.06306198,0.00002776896],"about_ca_topic_score_codex":0.0010641889,"about_ca_topic_score_gemma":0.0016039861,"teacher_disagreement_score":0.005193126,"about_ca_system_score_codex":0.0012118246,"about_ca_system_score_gemma":0.00053608423,"threshold_uncertainty_score":0.017372727},"labels":[],"label_agreement":null},{"id":"W2999048296","doi":"10.37236/9286","title":"Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Embedding; Vertex (graph theory); Graph; Multiple edges; Discrete mathematics; Computer science","score_opus":0.015869783863050754,"score_gpt":0.26760887986465953,"score_spread":0.25173909600160876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999048296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9280573,0.00033492665,0.047364827,0.0006680275,0.000034808116,0.00003766139,0.0005346045,0.0002622719,0.022705473],"genre_scores_gemma":[0.98373705,0.00017712888,0.012310598,0.000080443555,0.00004270251,0.000059996575,0.0005361658,0.00007825103,0.0029776765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951756,0.000085429514,0.000018599285,0.0001397058,0.00011810091,0.00012061242],"domain_scores_gemma":[0.99703634,0.0015804337,0.00044026764,0.0002443982,0.00019713603,0.0005014347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030035822,0.00042993223,0.00054595585,0.0008252583,0.00085586926,0.0011600046,0.0011363747,0.0006081536,0.006095886],"category_scores_gemma":[0.0029833964,0.00043860928,0.00051236706,0.000555427,0.0014803946,0.002277375,0.001580395,0.0007631265,0.00043103984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078922993,0.00021756376,0.012582228,0.00069567247,0.00011176637,0.0011033869,0.0019080003,0.057867635,0.06056372,0.8182152,0.007880532,0.038065],"study_design_scores_gemma":[0.00012148469,0.00018592627,0.008470705,0.000069190195,0.000090553964,0.00082544074,0.0010921034,0.08841646,0.018754851,0.87222725,0.009695147,0.000050831495],"about_ca_topic_score_codex":0.0011864145,"about_ca_topic_score_gemma":0.0015237565,"teacher_disagreement_score":0.006095886,"about_ca_system_score_codex":0.00080433115,"about_ca_system_score_gemma":0.000378344,"threshold_uncertainty_score":0.020392776},"labels":[],"label_agreement":null},{"id":"W2999464824","doi":"10.37236/742","title":"Maximal Nontraceable Graphs with Toughness less than One","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of South Africa; National Research Foundation","keywords":"Combinatorics; Mathematics; Hamiltonian path; Vertex (graph theory); Graph; Pancyclic graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.019663318482678476,"score_gpt":0.24054955255475927,"score_spread":0.2208862340720808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999464824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8983892,0.00044761528,0.07374314,0.0010928608,0.00012712633,0.0001412343,0.0013435971,0.00037171124,0.024343463],"genre_scores_gemma":[0.96029073,0.00031039765,0.029070126,0.0002590797,0.00010399825,0.00018565456,0.0018837065,0.00010459943,0.007791833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898654,0.0001321937,0.00006338544,0.0003432402,0.00020983102,0.00026477987],"domain_scores_gemma":[0.9927982,0.0030541,0.0016060445,0.00075386075,0.0005312106,0.0012566515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005634965,0.0008372236,0.0008461967,0.001743782,0.0021014172,0.0018678796,0.0019527226,0.00083988596,0.008616672],"category_scores_gemma":[0.0046729115,0.0008563526,0.0009708108,0.0014541689,0.0028992402,0.004230117,0.0023542058,0.0018153352,0.00053029315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093681674,0.00028944112,0.010787024,0.00097403204,0.00021590511,0.0025256593,0.0023680339,0.03372894,0.03346571,0.8701248,0.010170815,0.034412842],"study_design_scores_gemma":[0.000115481766,0.00022958232,0.00933024,0.00011154983,0.00014781799,0.0026312722,0.0012755451,0.06583188,0.009810991,0.8958258,0.014579481,0.00011030188],"about_ca_topic_score_codex":0.0013705702,"about_ca_topic_score_gemma":0.002249467,"teacher_disagreement_score":0.008616672,"about_ca_system_score_codex":0.0009385523,"about_ca_system_score_gemma":0.00067648274,"threshold_uncertainty_score":0.0288257},"labels":[],"label_agreement":null},{"id":"W2999689452","doi":"10.1016/j.tcs.2019.12.007","title":"Corrigendum to “The orthogonal colouring game” [Theor. Comput. Sci. 795 (2019) 312–325]","year":2020,"lang":"en","type":"erratum","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Involution (esoterism); Upper and lower bounds; Isomorphism (crystallography); Discrete mathematics; Mathematical analysis","score_opus":0.02459413783598354,"score_gpt":0.28905575378499726,"score_spread":0.26446161594901374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999689452","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001926837,0.0039804,0.00216482,0.09155408,0.8578958,0.00006275295,0.0021341557,0.00065784133,0.041357394],"genre_scores_gemma":[0.009714102,0.010989617,0.004779069,0.076643504,0.20018475,0.000306422,0.0041312645,0.0015027229,0.6917485],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967008,0.00064127083,0.00031883075,0.00069527427,0.0013235941,0.00032018148],"domain_scores_gemma":[0.98897153,0.0030186642,0.0004392736,0.000857459,0.006086592,0.000626491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022789033,0.001930236,0.0019096715,0.002893132,0.0040251613,0.0040539047,0.003454899,0.0052339635,0.22490147],"category_scores_gemma":[0.025119096,0.00085563934,0.0018398287,0.0023974755,0.0022440858,0.0040689646,0.0026449854,0.0055608572,0.11511709],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011699735,0.0000034482885,0.000016538197,0.00005022412,0.0000038949293,0.000034091045,0.000007984531,0.000025385829,0.000018873261,0.0022909571,0.99474806,0.0027888855],"study_design_scores_gemma":[0.000017450237,0.000013984186,0.00031152213,0.00014294374,0.000014621351,0.00011440189,0.000031582025,0.00022217692,0.00014879483,0.007460243,0.9914881,0.000034241908],"about_ca_topic_score_codex":0.017562957,"about_ca_topic_score_gemma":0.025089445,"teacher_disagreement_score":0.22490147,"about_ca_system_score_codex":0.005664419,"about_ca_system_score_gemma":0.0028642444,"threshold_uncertainty_score":0.75237036},"labels":[],"label_agreement":null},{"id":"W3000454462","doi":"10.37236/284","title":"The Planarity Theorems of MacLane and Whitney for Graph-like Continua","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Planarity testing; Disjoint sets; Combinatorics; Compactification (mathematics); Discrete mathematics; Graph; Pure mathematics","score_opus":0.006040515383384084,"score_gpt":0.2553896335600363,"score_spread":0.24934911817665223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000454462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115466416,0.009116141,0.6173172,0.007518235,0.0009912134,0.0001617464,0.0008451588,0.0007510416,0.24783282],"genre_scores_gemma":[0.81887215,0.009801774,0.112736106,0.0019298185,0.0015643551,0.0004124995,0.0009284121,0.00053072727,0.053224206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999181,0.00013119112,0.000042464773,0.00023435414,0.00028102042,0.00012991582],"domain_scores_gemma":[0.9968958,0.0012957773,0.0003363987,0.00046430324,0.00067446934,0.00033324456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013124283,0.0009254624,0.0007913566,0.0035992346,0.0019515295,0.002808291,0.0012580539,0.0013457092,0.006677791],"category_scores_gemma":[0.007304503,0.0005840637,0.0018007827,0.0022864193,0.0056096935,0.011032518,0.0055472045,0.004603765,0.001181758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000089711575,0.0000035393896,0.000085230335,0.00004772338,0.0000051443776,0.00004660618,0.00020627012,0.0006061792,0.00036824282,0.9916943,0.0011443037,0.005783502],"study_design_scores_gemma":[0.000006495502,0.00001183821,0.00020987252,0.000020669768,0.000009316674,0.00013429164,0.00012117647,0.0015606958,0.0006640701,0.9854247,0.011821796,0.000015132683],"about_ca_topic_score_codex":0.0014109596,"about_ca_topic_score_gemma":0.0010365058,"teacher_disagreement_score":0.006677791,"about_ca_system_score_codex":0.0013547945,"about_ca_system_score_gemma":0.000728804,"threshold_uncertainty_score":0.022339404},"labels":[],"label_agreement":null},{"id":"W3000817392","doi":"10.1007/978-3-030-39219-2_5","title":"Approximating Modular Decomposition Is Hard","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Modular design; Computer science; Modular decomposition; Decomposition; Algebraic number; Graph; Time complexity; Data structure; Neighbourhood (mathematics); Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Line graph; Pathwidth","score_opus":0.02567637745108079,"score_gpt":0.2885644326627407,"score_spread":0.26288805521165987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000817392","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25311232,0.0037823408,0.3336505,0.015273508,0.002030067,0.00024943874,0.002663248,0.0025616563,0.38667694],"genre_scores_gemma":[0.7407411,0.0036102964,0.085461855,0.003146621,0.0018971822,0.00040123245,0.0043753637,0.0017217677,0.15864457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986975,0.00023716154,0.000055609948,0.00033249645,0.00043423902,0.00024296006],"domain_scores_gemma":[0.99596196,0.0022077935,0.0002494005,0.00089565985,0.00034530365,0.00033985233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009352936,0.0020021126,0.0021522339,0.0013387264,0.0016711497,0.0048022172,0.0020590934,0.0017379922,0.024091842],"category_scores_gemma":[0.0069526625,0.0011474928,0.0014625019,0.002903688,0.00219186,0.008430207,0.004697369,0.0076680877,0.0061145606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006592943,0.00024482826,0.0013525957,0.00075216196,0.00011345252,0.0002591055,0.00047813306,0.014956655,0.0060600927,0.7502289,0.089817174,0.13507761],"study_design_scores_gemma":[0.00003891942,0.00003375469,0.00034410038,0.000036584785,0.00003463685,0.0001831975,0.00010309165,0.019007046,0.0011530444,0.96789706,0.011155542,0.000012856596],"about_ca_topic_score_codex":0.0006764241,"about_ca_topic_score_gemma":0.0011120627,"teacher_disagreement_score":0.024091842,"about_ca_system_score_codex":0.0017853753,"about_ca_system_score_gemma":0.00073027227,"threshold_uncertainty_score":0.080595255},"labels":[],"label_agreement":null},{"id":"W3002002006","doi":"10.1007/978-3-030-39881-1_27","title":"Parameterized Algorithms for the Happy Set Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Parameterized complexity; Combinatorics; Undirected graph; Vertex (graph theory); Mathematics; Graph; Vertex cover; Discrete mathematics; Clique; Set (abstract data type); Integer (computer science); Computer science; Algorithm","score_opus":0.051121854598218316,"score_gpt":0.31060824585989527,"score_spread":0.25948639126167694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002002006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01742235,0.0010549312,0.921515,0.0020796524,0.00033327585,0.0003990654,0.0016154768,0.0025867873,0.052993435],"genre_scores_gemma":[0.13444209,0.00178344,0.81852657,0.00077552156,0.00052526436,0.0013383132,0.006515464,0.0024856103,0.03360776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973757,0.00064811396,0.00014676656,0.0007354372,0.0006913611,0.000402674],"domain_scores_gemma":[0.9943704,0.0033488048,0.00024705246,0.0014439103,0.00031625107,0.0002735659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020967748,0.002133174,0.0024222247,0.0014660207,0.0027414176,0.0062621203,0.007496043,0.0030145266,0.039044127],"category_scores_gemma":[0.009954204,0.0016189866,0.0033230707,0.004525982,0.0020981668,0.014135957,0.0062768734,0.008598934,0.008026792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042261963,0.00054947316,0.00039898124,0.0005939873,0.00009868757,0.00006899194,0.00036005478,0.03971188,0.0025705907,0.6081404,0.0725471,0.27453724],"study_design_scores_gemma":[0.0001899492,0.000057183628,0.00022906742,0.00007355209,0.00005482408,0.00012503067,0.00015741817,0.118267916,0.0013736307,0.85900956,0.020428305,0.00003355819],"about_ca_topic_score_codex":0.0021967022,"about_ca_topic_score_gemma":0.0031568094,"teacher_disagreement_score":0.039044127,"about_ca_system_score_codex":0.0038129252,"about_ca_system_score_gemma":0.003097966,"threshold_uncertainty_score":0.13061559},"labels":[],"label_agreement":null},{"id":"W3002049452","doi":"10.37236/8594","title":"On essentially 4-edge-connected cubic bricks","year":2018,"lang":"","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universidade Federal de Mato Grosso do Sul; University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Fundação de Amparo à Pesquisa do Estado de São Paulo; Universität Wien; Massey University","keywords":"Combinatorics; Mathematics; Bipartite graph; Cubic graph; Conjecture; Invariant (physics); Graph; Complete bipartite graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.04156593562185266,"score_gpt":0.3132276082930295,"score_spread":0.2716616726711768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002049452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70504344,0.0011491288,0.06710699,0.0006675792,0.00015972684,0.00013444167,0.0012882192,0.00035512642,0.22409546],"genre_scores_gemma":[0.9315819,0.0009789133,0.02571485,0.0003099293,0.00009178266,0.00009433795,0.0015757817,0.0001472676,0.039505325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965537,0.000054913515,0.000008561973,0.000068838366,0.000097035634,0.000115312694],"domain_scores_gemma":[0.99963164,0.00012093846,0.000066699824,0.00006576758,0.000056091838,0.000058749498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015240838,0.000493001,0.0004456942,0.0012768813,0.0016429918,0.0010911875,0.0008924484,0.0007672438,0.014374604],"category_scores_gemma":[0.0009823861,0.0006395814,0.0005853717,0.0012462189,0.0014874048,0.0017288177,0.001697728,0.0013698811,0.0017023109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002770083,0.00005329938,0.0013822825,0.0002525089,0.000031340798,0.0005011497,0.0005670947,0.03093396,0.0064049843,0.9282123,0.007467899,0.02391623],"study_design_scores_gemma":[0.00012139121,0.00010022672,0.004892404,0.00014456728,0.000054467488,0.0005604167,0.0005766332,0.06947288,0.0038624562,0.8740365,0.04611343,0.00006462403],"about_ca_topic_score_codex":0.01475907,"about_ca_topic_score_gemma":0.017696898,"teacher_disagreement_score":0.01475907,"about_ca_system_score_codex":0.0013295846,"about_ca_system_score_gemma":0.0004625068,"threshold_uncertainty_score":0.048087895},"labels":[],"label_agreement":null},{"id":"W3003210829","doi":"10.1016/j.amc.2020.125032","title":"On the vertex partition of planar graphs into forests with bounded degree","year":2020,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Frequency partition of a graph; Combinatorics; Partition (number theory); Mathematics; Bounded function; Planar graph; Vertex (graph theory); Discrete mathematics; Degree (music); Graph; Graph power; Line graph; Physics; Mathematical analysis","score_opus":0.0406424360618284,"score_gpt":0.2698146439078508,"score_spread":0.2291722078460224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003210829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68136,0.004404662,0.2597004,0.005584916,0.000300424,0.000097360076,0.0008931567,0.00037049328,0.04728865],"genre_scores_gemma":[0.93225926,0.002839791,0.046661656,0.0010785828,0.000626847,0.00012861556,0.0013695919,0.00039725416,0.014638477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916756,0.00030332393,0.000026247078,0.00015012917,0.00015258181,0.00020017938],"domain_scores_gemma":[0.99046993,0.0075950245,0.0005564805,0.00050148007,0.0003779853,0.00049906666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001350459,0.0009295138,0.0013574609,0.0020885824,0.0016378757,0.0036053017,0.00212255,0.0014990489,0.007397053],"category_scores_gemma":[0.009918234,0.00083632144,0.00091865653,0.0022296857,0.003621916,0.006673371,0.0023945302,0.0026058534,0.0007395328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077879895,0.00013423478,0.0023915088,0.0003252757,0.000068433365,0.0002025366,0.00095095165,0.075543344,0.005587396,0.86772966,0.011054692,0.03523317],"study_design_scores_gemma":[0.000051025076,0.000042624994,0.00095790386,0.000050096747,0.00003329022,0.000088148125,0.0002684893,0.10531157,0.0006852499,0.89055294,0.0019383305,0.000020342473],"about_ca_topic_score_codex":0.0040481063,"about_ca_topic_score_gemma":0.0046826093,"teacher_disagreement_score":0.007397053,"about_ca_system_score_codex":0.001896902,"about_ca_system_score_gemma":0.000707007,"threshold_uncertainty_score":0.024745643},"labels":[],"label_agreement":null},{"id":"W3003586411","doi":"10.1016/j.jctb.2023.12.006","title":"Excluded minors for the Klein bottle II. Cascades","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Klein bottle; Genus; Embedding; Combinatorics; Euler's formula; Euler characteristic; Mathematics; Surface (topology); Discrete mathematics; Computer science; Biology; Geometry; Zoology; Mathematical analysis; Artificial intelligence","score_opus":0.019614385251058644,"score_gpt":0.3024421195788242,"score_spread":0.2828277343277656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003586411","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.616617,0.0013874655,0.0678082,0.0035504112,0.00077671674,0.00025623295,0.00077428063,0.0005306274,0.30829895],"genre_scores_gemma":[0.91441655,0.00055411935,0.013427957,0.0006016434,0.00047451965,0.00018849825,0.00055599556,0.00020839577,0.06957229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994814,0.00009338943,0.000033589076,0.00009738592,0.00017377237,0.00012056458],"domain_scores_gemma":[0.9988795,0.0003529995,0.00016329014,0.000119031654,0.00016796772,0.00031722285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004701781,0.0007058854,0.0007479934,0.001488736,0.0030654357,0.004107506,0.001054801,0.0016419753,0.011794443],"category_scores_gemma":[0.0026797047,0.0005850468,0.0011326433,0.0005342,0.0017298607,0.003468882,0.0024581861,0.002206957,0.0020349885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006568047,0.000025897716,0.00022039482,0.000034869165,0.0000066875214,0.00019023281,0.00024277996,0.00040124616,0.0020751096,0.9911642,0.0029934514,0.0025794501],"study_design_scores_gemma":[0.00003997475,0.000023795012,0.00036748024,0.000016915807,0.00001413479,0.00039811103,0.00014639333,0.0049170167,0.001071153,0.98649895,0.0064858515,0.000020319456],"about_ca_topic_score_codex":0.0016259575,"about_ca_topic_score_gemma":0.0016081946,"teacher_disagreement_score":0.011794443,"about_ca_system_score_codex":0.0013377685,"about_ca_system_score_gemma":0.0006987955,"threshold_uncertainty_score":0.039456367},"labels":[],"label_agreement":null},{"id":"W3003878869","doi":"10.1016/j.jctb.2023.10.002","title":"Excluded minors for the Klein bottle I. Low connectivity case","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Klein bottle; Combinatorics; Embedding; Mathematics; Robertson–Seymour theorem; Vertex (graph theory); Genus; Euler characteristic; Euler's formula; Discrete mathematics; Graph; 1-planar graph; Computer science; Chordal graph; Artificial intelligence; Geometry; Torus; Biology; Mathematical analysis","score_opus":0.025210782009681694,"score_gpt":0.30544620852283433,"score_spread":0.28023542651315264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003878869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77541745,0.0018999719,0.06663311,0.0039246464,0.0005567928,0.000105923915,0.00048314274,0.00035936903,0.15061964],"genre_scores_gemma":[0.97311413,0.0004222691,0.008002331,0.0003860194,0.00037692557,0.00008706664,0.0002762595,0.00007871413,0.017256228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994584,0.00013046373,0.00003695443,0.00009739186,0.0001590319,0.000117749114],"domain_scores_gemma":[0.9980274,0.0008227175,0.00031182208,0.00015049237,0.00019699767,0.00049050135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055633776,0.000672654,0.00071041373,0.002114202,0.0024891922,0.00408741,0.0012317173,0.0017707986,0.007254799],"category_scores_gemma":[0.003392144,0.0005861947,0.0010137863,0.0007945593,0.0025800439,0.0032833638,0.0025166604,0.0022605783,0.001055581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066467044,0.000030149906,0.0004655491,0.000051834635,0.000009604633,0.00030817167,0.00027291695,0.00067160773,0.0020259833,0.99102235,0.0023228833,0.0027524352],"study_design_scores_gemma":[0.00002606592,0.000021823926,0.00040584253,0.000013309868,0.00001092016,0.00037040535,0.00013822193,0.0053963815,0.0006175157,0.9905996,0.0023813108,0.000018647917],"about_ca_topic_score_codex":0.001529559,"about_ca_topic_score_gemma":0.0014413086,"teacher_disagreement_score":0.007254799,"about_ca_system_score_codex":0.0010958727,"about_ca_system_score_gemma":0.0005857604,"threshold_uncertainty_score":0.02426976},"labels":[],"label_agreement":null},{"id":"W3004859185","doi":"","title":"Minimal Tetrahedralizations of a Class of Polyhedra.","year":2000,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Regina","funders":"","keywords":"Polyhedron; Tetrahedron; Combinatorics; Class (philosophy); Euclidean space; Mathematics; Graph; Simple (philosophy); Computer science; Artificial intelligence; Geometry","score_opus":0.018836993820149462,"score_gpt":0.29725188787131623,"score_spread":0.27841489405116676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004859185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.290222,0.00038841218,0.6664695,0.00041034014,0.0001712444,0.00021268564,0.0011552484,0.0007419311,0.040228568],"genre_scores_gemma":[0.73704505,0.0003973915,0.24825215,0.00021289689,0.00012184552,0.00027286363,0.0037916852,0.00041193204,0.009494214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957234,0.000054976863,0.000020348445,0.00013643326,0.0001434218,0.00007246413],"domain_scores_gemma":[0.9992706,0.00015305095,0.00014494444,0.00023469121,0.0001069879,0.00008970841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017071384,0.00034862402,0.0004010706,0.0006467775,0.0008600004,0.0008475686,0.00092411216,0.0004539707,0.0076652328],"category_scores_gemma":[0.0011886876,0.00035878687,0.0007971598,0.0007156739,0.0011026647,0.0015751641,0.0009095338,0.0012159535,0.00087928656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024862454,0.00008912401,0.0020770815,0.00024561386,0.000058721995,0.0003610996,0.0003956029,0.032727923,0.039668154,0.81542677,0.010437754,0.09826348],"study_design_scores_gemma":[0.00004807795,0.00016559336,0.0022159792,0.00005350782,0.000034763623,0.0008173006,0.00052437943,0.09126181,0.015936805,0.8446044,0.044290293,0.00004718906],"about_ca_topic_score_codex":0.0008070451,"about_ca_topic_score_gemma":0.0011954858,"teacher_disagreement_score":0.0076652328,"about_ca_system_score_codex":0.000531322,"about_ca_system_score_gemma":0.00036359302,"threshold_uncertainty_score":0.025642812},"labels":[],"label_agreement":null},{"id":"W3006001508","doi":"10.1142/s179383092150049x","title":"Semi-dynamic algorithms for strongly chordal graphs","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Chordal graph; Interval graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Dynamic problem; Shortest path problem; Mathematics; Pathwidth; Graph; Computer science; Treewidth; Algorithm; Discrete mathematics; Line graph; 1-planar graph","score_opus":0.03345199863854946,"score_gpt":0.33286946492678504,"score_spread":0.29941746628823557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006001508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02284162,0.00063179753,0.96635777,0.0007112181,0.00009878449,0.00023524999,0.00038771372,0.0015221894,0.0072136144],"genre_scores_gemma":[0.40219888,0.0009543078,0.58622473,0.0006156438,0.00019302023,0.00043587515,0.0017349537,0.00046287317,0.0071797594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996865,0.00064247136,0.00026726225,0.0007993874,0.001093026,0.00033289057],"domain_scores_gemma":[0.98823524,0.0058633666,0.00074199383,0.0035046753,0.0012519148,0.00040286046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016458451,0.00074400165,0.00092754455,0.0011136481,0.0011074339,0.0026809794,0.0030185822,0.0012037285,0.005214261],"category_scores_gemma":[0.014748605,0.00049625203,0.00096619636,0.0018054019,0.0014415735,0.0072224448,0.0046258983,0.0022693651,0.0014134605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000576371,0.00031855752,0.0016065121,0.000657442,0.00009404404,0.00019496695,0.00048916833,0.13340084,0.015829068,0.51441646,0.016088836,0.31632778],"study_design_scores_gemma":[0.00009399191,0.00011249133,0.0002971481,0.00003524058,0.00002835584,0.00033211603,0.0001534596,0.35288814,0.006026116,0.6252143,0.014783412,0.000035346875],"about_ca_topic_score_codex":0.0014913292,"about_ca_topic_score_gemma":0.0021274611,"teacher_disagreement_score":0.005214261,"about_ca_system_score_codex":0.0017890732,"about_ca_system_score_gemma":0.001994294,"threshold_uncertainty_score":0.017443478},"labels":[],"label_agreement":null},{"id":"W3007271564","doi":"10.1017/s0963548321000213","title":"Clustered 3-colouring graphs of bounded degree","year":2021,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Wilfrid Laurier University; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Bounded function; Planar graph; Degree (music); Vertex (graph theory); 1-planar graph; Discrete mathematics; Cluster analysis; Graph; Chordal graph; Statistics; Physics","score_opus":0.0581101267166381,"score_gpt":0.2964187187545243,"score_spread":0.2383085920378862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007271564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87062216,0.0004748793,0.114403844,0.00067402166,0.00004436578,0.00007354705,0.000731555,0.00049618306,0.012479526],"genre_scores_gemma":[0.96719414,0.00019341859,0.027900344,0.00014493072,0.000018131472,0.000037069945,0.00049036415,0.000083639985,0.0039380006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992415,0.0001111117,0.00003274691,0.00023752254,0.00019572816,0.00018138826],"domain_scores_gemma":[0.9959565,0.0016326511,0.0006795158,0.00071899773,0.0005830878,0.00042926066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033537907,0.0005031885,0.0006730892,0.0010503613,0.0009658975,0.0014600153,0.0015305089,0.0009234111,0.0048288414],"category_scores_gemma":[0.0029558784,0.0007175533,0.00060531835,0.0012878408,0.001402051,0.0017663151,0.0018302648,0.0011191815,0.0005335263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011271408,0.0002368937,0.012061741,0.0007164016,0.00020769413,0.0012469601,0.0014036178,0.2453171,0.18616,0.48981878,0.0084558865,0.053247783],"study_design_scores_gemma":[0.00014901567,0.0002604065,0.01276676,0.00012436984,0.0001574212,0.0014386926,0.00067156483,0.34515643,0.06695306,0.55410504,0.01807105,0.00014630344],"about_ca_topic_score_codex":0.0042678127,"about_ca_topic_score_gemma":0.0053210915,"teacher_disagreement_score":0.0048288414,"about_ca_system_score_codex":0.0020461192,"about_ca_system_score_gemma":0.000553945,"threshold_uncertainty_score":0.01615411},"labels":[],"label_agreement":null},{"id":"W3007681597","doi":"10.19086/aic.12043","title":"A rainbow version of Mantel's Theorem","year":2020,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Commission; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; United States-Israel Binational Science Foundation; Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Multiple edges; Simple graph; Rainbow; Discrete mathematics; Physics","score_opus":0.015320966051770737,"score_gpt":0.287461488534128,"score_spread":0.27214052248235726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007681597","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051871054,0.003939772,0.42585135,0.01005772,0.0031306392,0.00016197511,0.0020285342,0.0024116873,0.5005473],"genre_scores_gemma":[0.6827406,0.003972727,0.13616008,0.010314901,0.0030747403,0.00030337553,0.0014541862,0.0014740649,0.16050534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971968,0.00036047364,0.000109945286,0.001135839,0.00070715835,0.00048975047],"domain_scores_gemma":[0.99645185,0.0014272728,0.00024165642,0.00081595185,0.0007325702,0.00033079408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019603204,0.000890839,0.001265531,0.0017871802,0.0032193214,0.0029285762,0.0024952414,0.0017771823,0.02639695],"category_scores_gemma":[0.0073166112,0.0007946191,0.0024851297,0.0018144845,0.0042241197,0.010459715,0.004550486,0.004975629,0.005929279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035646386,0.000015037424,0.00019080838,0.00008072503,0.00001786205,0.00009365965,0.00017386297,0.0007865943,0.00060481887,0.97753644,0.010157782,0.010306778],"study_design_scores_gemma":[0.000023575678,0.000021794895,0.00021671997,0.000024304294,0.000017511004,0.00017793913,0.000040231753,0.0025984223,0.00045548615,0.97191983,0.024483029,0.000021103675],"about_ca_topic_score_codex":0.003726057,"about_ca_topic_score_gemma":0.003071009,"teacher_disagreement_score":0.02639695,"about_ca_system_score_codex":0.0025212443,"about_ca_system_score_gemma":0.0013333204,"threshold_uncertainty_score":0.088306606},"labels":[],"label_agreement":null},{"id":"W3009569366","doi":"10.1007/978-3-030-83823-2_45","title":"Building a Larger Class of Graphs for Efficient Reconfiguration of Vertex Colouring","year":2021,"lang":"en","type":"book-chapter","venue":"Trends in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Chordal graph; Combinatorics; Bipartite graph; Mistake; Mathematics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.05015080039206227,"score_gpt":0.32728623567235404,"score_spread":0.2771354352802918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009569366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026475135,0.0005251051,0.9212776,0.00048200414,0.00035307987,0.00021882517,0.00041154554,0.004260238,0.04599653],"genre_scores_gemma":[0.19679372,0.0010772755,0.76718384,0.00049690966,0.00024122243,0.00041528256,0.001398221,0.0029195228,0.029474026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993456,0.00010274048,0.00003169255,0.00024687775,0.00013790427,0.00013509877],"domain_scores_gemma":[0.9986565,0.0003563144,0.00007402298,0.00070115743,0.00010764058,0.00010430674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005241542,0.0011737121,0.0010257586,0.0010518889,0.0011023895,0.002159549,0.00215869,0.0010784705,0.025453955],"category_scores_gemma":[0.0014677297,0.0007033639,0.0017443922,0.0016278148,0.0012144009,0.004152817,0.0021893492,0.0028541961,0.0053659347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017633908,0.0003316416,0.00049721793,0.00076330255,0.00008139712,0.00029353978,0.00035276747,0.080935165,0.05322964,0.49747533,0.030036202,0.33582747],"study_design_scores_gemma":[0.00007597042,0.00015413566,0.0006023788,0.000113118556,0.00008220662,0.00049692416,0.00019966584,0.17569003,0.02247124,0.65454274,0.14550391,0.00006767132],"about_ca_topic_score_codex":0.0011250054,"about_ca_topic_score_gemma":0.002174996,"teacher_disagreement_score":0.025453955,"about_ca_system_score_codex":0.0011452379,"about_ca_system_score_gemma":0.0007322078,"threshold_uncertainty_score":0.08515197},"labels":[],"label_agreement":null},{"id":"W3009875838","doi":"10.1016/j.tcs.2021.05.014","title":"The game of Cops and Eternal Robbers","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Geology","score_opus":0.014841140689940763,"score_gpt":0.295436918663482,"score_spread":0.28059577797354124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009875838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43914977,0.00080040644,0.2743174,0.008528524,0.00041815074,0.00029331574,0.0008933735,0.00034142955,0.27525762],"genre_scores_gemma":[0.93722147,0.00027306224,0.021074835,0.00029723794,0.00010139308,0.0001218949,0.00023840842,0.00007611711,0.04059562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746275,0.0012909651,0.00010154231,0.0003180103,0.00035562858,0.0004710882],"domain_scores_gemma":[0.9956436,0.0027473364,0.00023543033,0.00047803964,0.00022084637,0.00067470095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017985795,0.00087703567,0.0011827191,0.0006859652,0.0024349634,0.004734077,0.0022610454,0.0032587857,0.019083077],"category_scores_gemma":[0.010180434,0.0007531515,0.0009127824,0.0008364716,0.0034326643,0.008119038,0.0030209667,0.0028389222,0.0012604557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031858662,0.000052023464,0.00032248718,0.00006507462,0.000027647957,0.00014565706,0.00032830244,0.016599173,0.00057270227,0.9710769,0.00466978,0.0058217505],"study_design_scores_gemma":[0.00006383541,0.000035582623,0.00022614811,0.00002443094,0.000015906888,0.00010274358,0.0002780741,0.07955038,0.0003652093,0.912121,0.0071961735,0.000020586436],"about_ca_topic_score_codex":0.0049764393,"about_ca_topic_score_gemma":0.0038355778,"teacher_disagreement_score":0.019083077,"about_ca_system_score_codex":0.0016170655,"about_ca_system_score_gemma":0.0012180065,"threshold_uncertainty_score":0.06383926},"labels":[],"label_agreement":null},{"id":"W3010722852","doi":"10.37236/9448","title":"Cooperative Conditions for the Existence of Rainbow Matchings","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Basic Science; Israel Science Foundation; National Research Foundation of Korea; National Research Foundation; Ministry of Science and ICT, South Korea; European Commission","keywords":"Rainbow; Combinatorics; Mathematics; Bipartite graph; Matching (statistics); Simple (philosophy); Graph; Discrete mathematics; Physics","score_opus":0.015961273720455953,"score_gpt":0.29370876417904584,"score_spread":0.2777474904585899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010722852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6661313,0.00036068846,0.22102515,0.003287252,0.0002511771,0.0004879005,0.0015498261,0.0008100201,0.106096774],"genre_scores_gemma":[0.962946,0.0002934653,0.022707654,0.0005383193,0.00014311391,0.0005936026,0.0009610041,0.00012486307,0.011691901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961908,0.00052826735,0.00033179193,0.0009967803,0.0007314625,0.0012208777],"domain_scores_gemma":[0.9687255,0.01613794,0.0029985306,0.0028913764,0.0034453159,0.0058013285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038627451,0.0008066526,0.0016595853,0.0024567216,0.0025620721,0.003446628,0.0033126022,0.0033540288,0.012629128],"category_scores_gemma":[0.026691774,0.0012450372,0.0014547269,0.001390795,0.0040886053,0.0064239833,0.0068265437,0.0024031491,0.0023735205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008040795,0.00028606344,0.0049922457,0.00033145386,0.00009238033,0.0011487401,0.0015719513,0.014854462,0.02006975,0.94068897,0.006468454,0.008691503],"study_design_scores_gemma":[0.0005879974,0.00035191615,0.0025515999,0.00011757127,0.00015161838,0.0009952793,0.0012097454,0.12403051,0.009464554,0.8503303,0.010053086,0.00015575706],"about_ca_topic_score_codex":0.0022313283,"about_ca_topic_score_gemma":0.0020734782,"teacher_disagreement_score":0.012629128,"about_ca_system_score_codex":0.0016844141,"about_ca_system_score_gemma":0.0022410196,"threshold_uncertainty_score":0.042248607},"labels":[],"label_agreement":null},{"id":"W3011591568","doi":"10.48550/arxiv.2003.05956","title":"Reconfiguration of Colourings and Dominating Sets in Graphs: a Survey","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Control reconfiguration; Graph; Dominating set; Discrete mathematics; Computer science","score_opus":0.11901032930840853,"score_gpt":0.23529406353023383,"score_spread":0.1162837342218253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011591568","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022855474,0.63631546,0.25988573,0.0025058484,0.0020231155,0.00021535796,0.0011874809,0.0009862746,0.07402526],"genre_scores_gemma":[0.2105221,0.6456717,0.11732271,0.002387359,0.005442464,0.00042327482,0.0032866285,0.00072574633,0.014217963],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972377,0.0004931914,0.00026996635,0.00092082,0.0007852458,0.00029305715],"domain_scores_gemma":[0.995786,0.0028341177,0.0002633533,0.0005644158,0.0003751403,0.00017697255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016966534,0.0025550213,0.0023038106,0.004988566,0.0012979971,0.0046505453,0.0028552604,0.002047856,0.0039182147],"category_scores_gemma":[0.005445196,0.0016254637,0.0027857756,0.01281535,0.0033060247,0.007853098,0.0024100305,0.0026872784,0.0019609083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001692697,0.00023975826,0.0026669865,0.010460128,0.00032187093,0.00047572068,0.0011450691,0.034014303,0.0037196195,0.38811648,0.0227899,0.535881],"study_design_scores_gemma":[0.000052578263,0.00032683616,0.003155361,0.002235609,0.00029839363,0.0036103292,0.0006389153,0.027515555,0.003324044,0.5385759,0.4200907,0.00017572766],"about_ca_topic_score_codex":0.0028980966,"about_ca_topic_score_gemma":0.001972057,"teacher_disagreement_score":0.004988566,"about_ca_system_score_codex":0.0035150792,"about_ca_system_score_gemma":0.0016325782,"threshold_uncertainty_score":0.025503814},"labels":[],"label_agreement":null},{"id":"W3013871422","doi":"10.4230/dagrep.9.9.135","title":"Comparative Theory for Graph Polynomials (Dagstuhl Seminar 19401)","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Birkbeck, University of London; Royal Holloway, University of London; National Research University Higher School of Economics; Universität des Saarlandes; Centre National de la Recherche Scientifique; University of Waterloo; Université de Bordeaux; Universiteit van Amsterdam; Monash University; Louisiana State University; Deakin University; U.S. Naval Academy; Durham University; Universiteit Leiden; University of North Texas; University of North Florida; Queen Mary University of London; Seoul National University; University of South Florida; York University; Aix-Marseille Université; Université de Montpellier; Univerzita Karlova v Praze","keywords":"Mathematics; Graph; Computer science; Discrete mathematics","score_opus":0.04844326896163092,"score_gpt":0.32058332757919805,"score_spread":0.2721400586175671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013871422","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030361442,0.1279434,0.19286318,0.11112825,0.009113455,0.00009376616,0.0018990937,0.0006233453,0.5259741],"genre_scores_gemma":[0.73756754,0.038865194,0.09319208,0.011608091,0.007145709,0.00052837917,0.0016801403,0.00053602905,0.108876795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981047,0.0009674916,0.000059173195,0.00027920894,0.00039796,0.0001915015],"domain_scores_gemma":[0.99868876,0.00084989576,0.000097356875,0.00009629441,0.00017586583,0.00009183291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003311014,0.00066439476,0.0006468241,0.0028474568,0.0021534243,0.003505492,0.000738556,0.0015546823,0.013211024],"category_scores_gemma":[0.004365917,0.00033273874,0.0010431813,0.0027687754,0.0038608082,0.0047083097,0.0021461116,0.0033377113,0.0024817572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012338149,0.000006111847,0.000052164574,0.000037808746,0.000005956242,0.000022272363,0.00014153321,0.0003034137,0.00011943038,0.97040415,0.01844107,0.010453706],"study_design_scores_gemma":[0.000009730558,0.000014832066,0.00033995198,0.00006931304,0.0000072014204,0.00005260285,0.00005677141,0.00051277055,0.00015216945,0.8967158,0.10205813,0.000010661489],"about_ca_topic_score_codex":0.0023667486,"about_ca_topic_score_gemma":0.0020404719,"teacher_disagreement_score":0.013211024,"about_ca_system_score_codex":0.0073233573,"about_ca_system_score_gemma":0.0012571813,"threshold_uncertainty_score":0.05313492},"labels":[],"label_agreement":null},{"id":"W3014386945","doi":"10.1007/978-3-662-66491-9_4","title":"Generating Weakly Chordal Graphs from Arbitrary Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University; University of Windsor","funders":"","keywords":"Chordal graph; Combinatorics; Treewidth; Interval graph; Split graph; Mathematics; Pathwidth; Indifference graph; Outerplanar graph; Discrete mathematics; Graph; Computer science; 1-planar graph; Line graph","score_opus":0.019875321825239625,"score_gpt":0.2652933343195548,"score_spread":0.2454180124943152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014386945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1844794,0.00035713526,0.73644376,0.00072480354,0.00022132671,0.0003397703,0.0008887972,0.0015639929,0.074980974],"genre_scores_gemma":[0.738562,0.00043628603,0.21836977,0.0002304633,0.0001428033,0.00037534998,0.0025231224,0.001384082,0.037976082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995408,0.00012484741,0.00002273237,0.000082690756,0.0001656926,0.00006324051],"domain_scores_gemma":[0.9978771,0.0013298487,0.00007570236,0.0004127231,0.00019995954,0.00010472152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004228002,0.00055014057,0.0006525531,0.0006325072,0.0007104117,0.0013252931,0.0014157845,0.0006183332,0.00703641],"category_scores_gemma":[0.0035984924,0.00052273954,0.0008482085,0.0009030642,0.0009126024,0.001851335,0.0031734821,0.0015975785,0.0016210374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022486348,0.00010805585,0.0008309851,0.000449159,0.000026806882,0.0002672554,0.0010343982,0.02467856,0.023880983,0.8096824,0.009775052,0.1290415],"study_design_scores_gemma":[0.000032817887,0.00003687074,0.00020920114,0.000029476962,0.00001698538,0.00012173037,0.00014645657,0.06177245,0.007487225,0.9217393,0.008396081,0.000011313018],"about_ca_topic_score_codex":0.0003732188,"about_ca_topic_score_gemma":0.0008389381,"teacher_disagreement_score":0.00703641,"about_ca_system_score_codex":0.0008185,"about_ca_system_score_gemma":0.00040645103,"threshold_uncertainty_score":0.023539186},"labels":[],"label_agreement":null},{"id":"W3014452398","doi":"10.1016/j.jctb.2023.03.004","title":"Graph product structure for non-minor-closed classes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Treewidth; 1-planar graph; Mathematics; Planar graph; Pathwidth; Discrete mathematics; Indifference graph; Partial k-tree; Graph product; Adjacency list; Clique-sum; Chordal graph; Graph; Line graph","score_opus":0.015486756748058885,"score_gpt":0.2911500817685745,"score_spread":0.2756633250205156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014452398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7565875,0.00041214202,0.14743012,0.0015820608,0.00021209831,0.00014628345,0.0011212892,0.00051073666,0.09199772],"genre_scores_gemma":[0.9583568,0.0002648981,0.020078683,0.00025252823,0.00022173034,0.00011175724,0.0012807491,0.00026301818,0.019169707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990422,0.00014790872,0.000046319303,0.00036275812,0.00022258173,0.00017821454],"domain_scores_gemma":[0.996318,0.0015036283,0.00043559764,0.00038807737,0.00051067764,0.00084394985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088399334,0.00066177157,0.0011070848,0.0025555587,0.003103393,0.0054018586,0.0020956644,0.0013371031,0.017402487],"category_scores_gemma":[0.0030675188,0.00073534297,0.0010464919,0.0020846229,0.0029818509,0.007212065,0.002347802,0.0025950207,0.0015866167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006322048,0.00006672449,0.00082683883,0.000033862147,0.000008246123,0.00007663743,0.000489621,0.00036725707,0.0008694662,0.99135935,0.0016019061,0.004236973],"study_design_scores_gemma":[0.000025992498,0.000024904512,0.00079989457,0.000013986695,0.00001913387,0.00016858093,0.00019552557,0.004476016,0.00055028615,0.99044484,0.0032686763,0.000012180451],"about_ca_topic_score_codex":0.0011579738,"about_ca_topic_score_gemma":0.0012498469,"teacher_disagreement_score":0.017402487,"about_ca_system_score_codex":0.0014470987,"about_ca_system_score_gemma":0.0005907349,"threshold_uncertainty_score":0.058217168},"labels":[],"label_agreement":null},{"id":"W3015825817","doi":"10.1016/j.jcta.2020.105253","title":"Lower bounds for graph bootstrap percolation via properties of polynomials","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Hypercube; Simple (philosophy); Mathematics; Combinatorics; Torus; Graph; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.036241503016032364,"score_gpt":0.2793446789304078,"score_spread":0.24310317591437547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015825817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21947338,0.015309491,0.5604405,0.021768246,0.0013869611,0.00046047906,0.0030098052,0.0024680824,0.1756831],"genre_scores_gemma":[0.89849,0.0073846434,0.066996664,0.003268947,0.003932332,0.00065578107,0.002000354,0.0014927934,0.01577842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942259,0.0018100534,0.00015485889,0.0009692551,0.001380395,0.0014594999],"domain_scores_gemma":[0.90355563,0.08081543,0.0034456325,0.004092809,0.0032001869,0.004890259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072909025,0.0034912974,0.0042980104,0.009035526,0.00457178,0.00855846,0.007343577,0.0047309888,0.016171774],"category_scores_gemma":[0.061937712,0.0020706996,0.0030390413,0.006784034,0.009044569,0.015868317,0.008852278,0.013026239,0.0027387908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050402473,0.00039136116,0.0022972254,0.00082448224,0.00014431051,0.00023761489,0.0008025723,0.031450734,0.0039745863,0.9159754,0.021697313,0.021700427],"study_design_scores_gemma":[0.00006499283,0.00007099464,0.0008456103,0.00015954857,0.00010858509,0.00019325381,0.00016261099,0.13343798,0.001078568,0.86020446,0.0036076584,0.000065739325],"about_ca_topic_score_codex":0.002218011,"about_ca_topic_score_gemma":0.0034007244,"teacher_disagreement_score":0.016171774,"about_ca_system_score_codex":0.0053505544,"about_ca_system_score_gemma":0.0022101325,"threshold_uncertainty_score":0.054099977},"labels":[],"label_agreement":null},{"id":"W3016468461","doi":"10.1016/j.disc.2021.112309","title":"Reflexive coloring complexes for 3-edge-colorings of cubic graphs","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canada Excellence Research Chairs, Government of Canada","keywords":"Combinatorics; Graph coloring; Edge coloring; Mathematics; Cubic graph; Complete coloring; Discrete mathematics; Graph; 1-planar graph; Line graph; Graph power; Voltage graph","score_opus":0.07047065590626489,"score_gpt":0.3604143091718357,"score_spread":0.2899436532655708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016468461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6583999,0.00087261276,0.17618416,0.0016322327,0.0006702889,0.00021098912,0.0008057022,0.00076410675,0.16045997],"genre_scores_gemma":[0.92766017,0.00046236507,0.032825585,0.00046042327,0.00019247261,0.00016286685,0.0005511722,0.00044265384,0.037242398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986457,0.00028175063,0.00009134211,0.00028675632,0.00038811346,0.00030632285],"domain_scores_gemma":[0.99623626,0.0015667995,0.00054333307,0.000378894,0.00050318526,0.00077149586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089401327,0.0008683355,0.0007928262,0.002176025,0.0023497238,0.0057107867,0.0019301348,0.0013272106,0.015471715],"category_scores_gemma":[0.003366419,0.0010307609,0.0011715156,0.0014954958,0.002417841,0.0033091372,0.0025554614,0.0033179973,0.0016249972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000701292,0.00004870112,0.00032730124,0.000047670645,0.000010325883,0.00014995322,0.00065123074,0.0013437086,0.0024243356,0.987176,0.0020105848,0.005740042],"study_design_scores_gemma":[0.000050260263,0.000026385313,0.0005274381,0.000026785565,0.000015170838,0.00022830743,0.00038028762,0.010039498,0.0025020787,0.9770891,0.009081162,0.00003355865],"about_ca_topic_score_codex":0.0038813483,"about_ca_topic_score_gemma":0.0041002505,"teacher_disagreement_score":0.015471715,"about_ca_system_score_codex":0.002773254,"about_ca_system_score_gemma":0.0009309496,"threshold_uncertainty_score":0.05175811},"labels":[],"label_agreement":null},{"id":"W3017097095","doi":"10.1016/j.dam.2020.04.001","title":"Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Graph; Property (philosophy); Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.020516455690896142,"score_gpt":0.24476587544284775,"score_spread":0.22424941975195162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017097095","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049414877,0.104887284,0.03012042,0.14077125,0.2373978,0.0007302757,0.022505192,0.0018483051,0.456798],"genre_scores_gemma":[0.010421656,0.0274137,0.0064824084,0.003159266,0.01368627,0.0001229131,0.0061915745,0.000743829,0.9317784],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925464,0.00004650405,0.000028705506,0.00013564661,0.00039186658,0.00014256877],"domain_scores_gemma":[0.9976439,0.00016128592,0.00003833201,0.00011489008,0.0015310879,0.00051053375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011592348,0.0016639782,0.0013928933,0.0024082186,0.003705552,0.005036527,0.0019102014,0.0017391938,0.20826882],"category_scores_gemma":[0.0022041458,0.0006400278,0.00096136174,0.004258894,0.0011677798,0.0030085808,0.0013682806,0.003004817,0.046590567],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023204935,0.0000075517387,0.00007551491,0.000099692894,0.000003653322,0.000015987885,0.000031793825,0.00019110073,0.00017365669,0.0036740503,0.9794255,0.016278384],"study_design_scores_gemma":[0.000012388845,0.00001258789,0.0007479111,0.00018335762,0.000014322205,0.000033289296,0.00016957647,0.00041572258,0.0002685246,0.004449179,0.99367493,0.000018212473],"about_ca_topic_score_codex":0.57267696,"about_ca_topic_score_gemma":0.8432338,"teacher_disagreement_score":0.57267696,"about_ca_system_score_codex":0.023111064,"about_ca_system_score_gemma":0.019755892,"threshold_uncertainty_score":0.8596793},"labels":[],"label_agreement":null},{"id":"W3018965338","doi":"10.1016/j.dam.2021.09.021","title":"Flexibility of planar graphs—Sharpening the tools to get lists of size four","year":2021,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; List coloring; Vertex (graph theory); Mathematics; Graph; Mathematical proof; Discrete mathematics; Computer science; Graph power; Line graph; Geometry","score_opus":0.06250255365461961,"score_gpt":0.32508935840767045,"score_spread":0.26258680475305085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018965338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21085055,0.0026518665,0.7216163,0.0048985644,0.00036347378,0.00021869993,0.0013216402,0.0023022222,0.055776633],"genre_scores_gemma":[0.77998525,0.0022224435,0.20075433,0.0017409779,0.0005145026,0.00030579147,0.0009913963,0.0009788297,0.012506461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981199,0.00038599828,0.00010304174,0.00052977947,0.0005270404,0.00033428374],"domain_scores_gemma":[0.985871,0.008118149,0.0013975563,0.0032019974,0.00071129337,0.0006999737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013118796,0.0012561267,0.0009208802,0.0021943913,0.0014255362,0.0022770262,0.0026625493,0.0013484907,0.008243938],"category_scores_gemma":[0.013186549,0.0010130005,0.0028596774,0.002525511,0.0036679667,0.0085128,0.0061785067,0.0054989043,0.001357881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030876396,0.000114319126,0.0029402256,0.00043269675,0.00007451015,0.0005571823,0.0010534269,0.06833246,0.00947041,0.83021796,0.008273665,0.07822438],"study_design_scores_gemma":[0.000048250145,0.00014185415,0.001029787,0.000103123566,0.000071026676,0.00066997285,0.00027397738,0.07178474,0.004658066,0.8938964,0.02723105,0.00009183641],"about_ca_topic_score_codex":0.002111443,"about_ca_topic_score_gemma":0.0016872399,"teacher_disagreement_score":0.008243938,"about_ca_system_score_codex":0.0017029746,"about_ca_system_score_gemma":0.00075866893,"threshold_uncertainty_score":0.027578771},"labels":[],"label_agreement":null},{"id":"W3020957989","doi":"10.1145/3357713.3384316","title":"Catalytic approaches to the tree evaluation problem","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Branching (polymer chemistry); Mathematics; Combinatorics; Binary decision diagram; Tree (set theory); Binary number; Algorithm; Binary tree; Parameterized complexity; Discrete mathematics; Chemistry; Arithmetic","score_opus":0.27328486343272657,"score_gpt":0.32320736811164585,"score_spread":0.04992250467891929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020957989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0175985,0.0012977223,0.94446224,0.0022171105,0.00024720034,0.0001526473,0.0001967542,0.00067146943,0.033156317],"genre_scores_gemma":[0.33388606,0.002350684,0.62716186,0.0021117462,0.00053858024,0.0009549532,0.0009215392,0.001229963,0.030844573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963515,0.0012808756,0.00019216092,0.00073209684,0.0010226502,0.00042071872],"domain_scores_gemma":[0.9921778,0.005282228,0.00030360778,0.0013520053,0.00060413196,0.00028026692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032965404,0.0010103211,0.001274764,0.0012613294,0.0018587135,0.0041428804,0.0038774642,0.0028573696,0.013163895],"category_scores_gemma":[0.016448608,0.0010120884,0.0022800497,0.0018553088,0.0042241737,0.006929425,0.0048249983,0.0071216514,0.0025224977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005613039,0.000047884067,0.00013602462,0.00012441889,0.000013524224,0.000034080243,0.00012778708,0.014009426,0.00076132774,0.9658378,0.0021675008,0.016684143],"study_design_scores_gemma":[0.000036924746,0.000020053994,0.000032318298,0.00002832801,0.000012364337,0.000031623014,0.000027326463,0.061380707,0.0010285721,0.92987686,0.0075127115,0.000012288725],"about_ca_topic_score_codex":0.0015054666,"about_ca_topic_score_gemma":0.0015665174,"teacher_disagreement_score":0.013163895,"about_ca_system_score_codex":0.0026981605,"about_ca_system_score_gemma":0.0021407674,"threshold_uncertainty_score":0.04403764},"labels":[],"label_agreement":null},{"id":"W3021119914","doi":"10.1007/s10107-020-01587-x","title":"Idealness of <i>k</i>-wise intersecting families.","year":2022,"lang":"en","type":"article","venue":"PubMed","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; European Research Council; Institute for Basic Science; Australian Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Conjecture; Element (criminal law); Ideal (ethics); Integer (computer science); Matroid; Discrete mathematics; Field (mathematics); Binary number; Pure mathematics; Arithmetic; Computer science; Law","score_opus":0.026415396896748242,"score_gpt":0.24974928427572118,"score_spread":0.22333388737897295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021119914","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.510778,0.0021361199,0.15382424,0.0026335558,0.0006779077,0.00014704872,0.0040963935,0.00086635916,0.32484043],"genre_scores_gemma":[0.95368063,0.00087045395,0.020905234,0.00040612262,0.0002674347,0.000089809575,0.0032183172,0.00022144297,0.020340499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988513,0.00021164522,0.00009535886,0.0003251551,0.00021498367,0.00030155617],"domain_scores_gemma":[0.9963534,0.0012894099,0.0005465934,0.0004158787,0.00081237,0.0005823383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011844226,0.00042175458,0.00062269473,0.0026218125,0.0027697603,0.0027686819,0.0009571507,0.00065436977,0.017904505],"category_scores_gemma":[0.004225243,0.00049494376,0.00090790435,0.0012644966,0.0026615253,0.0040345006,0.0020120535,0.0017228567,0.0027700723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025788465,0.000044491655,0.0023207802,0.0001835126,0.000033115866,0.00026763818,0.0006930863,0.0009847671,0.0031724286,0.9732072,0.0070393034,0.01179588],"study_design_scores_gemma":[0.000039751005,0.000059684247,0.0021971199,0.00009391979,0.000039645867,0.0014078884,0.000958804,0.003405396,0.00390994,0.9681672,0.01968267,0.000038075934],"about_ca_topic_score_codex":0.0011858727,"about_ca_topic_score_gemma":0.0008523006,"teacher_disagreement_score":0.017904505,"about_ca_system_score_codex":0.0011651419,"about_ca_system_score_gemma":0.0006418906,"threshold_uncertainty_score":0.05989647},"labels":[],"label_agreement":null},{"id":"W3021331763","doi":"10.1137/20m1343099","title":"The Structure of $I_4$-Free and Triangle-Free Binary Matroids","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Ontario Research Foundation","keywords":"Matroid; Mathematics; Combinatorics; Graphic matroid; Rank (graph theory); Simple (philosophy); Binary number; Discrete mathematics","score_opus":0.015763332282154097,"score_gpt":0.27661869244182685,"score_spread":0.26085536015967276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021331763","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9151294,0.00042521744,0.049682718,0.0005426025,0.00004444439,0.000047538302,0.000956616,0.00018074462,0.03299076],"genre_scores_gemma":[0.9737342,0.0002079194,0.01541306,0.00011983737,0.00007028219,0.000060129998,0.0012528386,0.00005410928,0.009087688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995596,0.000044784734,0.000029115477,0.0001053001,0.00014233345,0.00011887031],"domain_scores_gemma":[0.9988072,0.0002330318,0.00032389845,0.00013822711,0.00019559907,0.00030200992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024675482,0.00033970978,0.00038090226,0.0017659612,0.0010262913,0.002128344,0.0008793017,0.0005403808,0.005976244],"category_scores_gemma":[0.0011477759,0.0005433907,0.0004106009,0.001131718,0.0011993565,0.0021459737,0.0011555667,0.00086865865,0.00067470473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027558694,0.00009743974,0.0051280535,0.0001993175,0.000030275054,0.00044645873,0.0011568172,0.007106959,0.02153214,0.93108195,0.0040314705,0.028913565],"study_design_scores_gemma":[0.0000930054,0.00013131971,0.011081809,0.00007436899,0.000057124154,0.0017039538,0.0008478428,0.04084396,0.015889142,0.9107181,0.018487679,0.000071633134],"about_ca_topic_score_codex":0.0012730635,"about_ca_topic_score_gemma":0.0010891587,"teacher_disagreement_score":0.005976244,"about_ca_system_score_codex":0.00091346493,"about_ca_system_score_gemma":0.00027984363,"threshold_uncertainty_score":0.01999247},"labels":[],"label_agreement":null},{"id":"W3022128000","doi":"10.1093/qmath/haab020","title":"Defining Bicircular Matroids in Monadic Logic","year":2021,"lang":"en","type":"preprint","venue":"The Quarterly Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Douglas College","funders":"Royal Society Te Apārangi","keywords":"Matroid; Class (philosophy); Conjecture; Graphic matroid; Frame (networking); Minor (academic); Computer science; Sentence; Order (exchange); Mathematics; Combinatorics; Discrete mathematics; Philosophy; Natural language processing; Artificial intelligence; Economics; Humanities","score_opus":0.02945989302064086,"score_gpt":0.3064348639715244,"score_spread":0.2769749709508836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022128000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63255155,0.0017954315,0.27566785,0.0042340313,0.00031559626,0.00018131036,0.0017702589,0.00074217026,0.08274178],"genre_scores_gemma":[0.97072124,0.00022491235,0.022237368,0.00039528497,0.00013473259,0.00005630471,0.0004873954,0.000047533027,0.005695261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859864,0.0003397722,0.00009354743,0.00031955878,0.00031213154,0.0003363556],"domain_scores_gemma":[0.99852943,0.00048385037,0.00023418547,0.00012426113,0.00037377505,0.00025456015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012460622,0.00050289195,0.00063290884,0.0016762336,0.001893361,0.0041376916,0.0010272025,0.0009569853,0.0041686585],"category_scores_gemma":[0.0020417871,0.00041166894,0.0007348862,0.0016037975,0.0022370035,0.005045508,0.0014002783,0.0017360217,0.0003829665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007058354,0.000026649373,0.00045072986,0.00006224564,0.000007740159,0.000131512,0.00036814823,0.0008421686,0.0020949773,0.99066216,0.0010391737,0.0042438693],"study_design_scores_gemma":[0.000037306087,0.00007274002,0.0009117483,0.000042556927,0.000028813123,0.00032159904,0.0007135334,0.014856216,0.0030554982,0.96662915,0.013289059,0.00004174041],"about_ca_topic_score_codex":0.0068309843,"about_ca_topic_score_gemma":0.008566855,"teacher_disagreement_score":0.0068309843,"about_ca_system_score_codex":0.003181682,"about_ca_system_score_gemma":0.0007541121,"threshold_uncertainty_score":0.02308482},"labels":[],"label_agreement":null},{"id":"W30224642","doi":"10.1038/s41598-018-32298-1","title":"On Graphs Whose Acyclic Graphoidal Covering Number Is One Less Than Its Cyclomatic Number.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Combinatorics; Discrete mathematics; Computer science; Programming language; Software","score_opus":0.02159831771197511,"score_gpt":0.28798031761858794,"score_spread":0.2663819999066128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30224642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8082418,0.0021201312,0.1465651,0.0018006624,0.00018895333,0.00013222783,0.0034645477,0.00052011345,0.036966525],"genre_scores_gemma":[0.949381,0.0020221102,0.03441243,0.00035419298,0.00023837268,0.0001605008,0.003180713,0.00012476865,0.010125975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994716,0.00014358894,0.000031060783,0.00018136376,0.00008020614,0.000092136135],"domain_scores_gemma":[0.99598664,0.0021300644,0.0009908233,0.0003817804,0.00020283062,0.00030785226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036253306,0.00048368075,0.00040753777,0.0022365958,0.0010724907,0.0016770422,0.0005016754,0.0007592855,0.004841564],"category_scores_gemma":[0.002887326,0.00030678633,0.00049884676,0.001936421,0.0012051184,0.0023555793,0.0006216594,0.0005707491,0.0006470806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034920938,0.000095334246,0.008778684,0.00061782333,0.00014494418,0.0010787898,0.00087492337,0.025685558,0.016385306,0.87733114,0.0074121063,0.061246045],"study_design_scores_gemma":[0.000035215067,0.000075116805,0.006708126,0.00013727206,0.00008385153,0.0016812824,0.0003477469,0.058562264,0.0040921452,0.8991627,0.029078625,0.00003571815],"about_ca_topic_score_codex":0.0011575271,"about_ca_topic_score_gemma":0.0021723392,"teacher_disagreement_score":0.004841564,"about_ca_system_score_codex":0.001184839,"about_ca_system_score_gemma":0.00032523207,"threshold_uncertainty_score":0.016196668},"labels":[],"label_agreement":null},{"id":"W3022534016","doi":"","title":"On Pitfalls in Computing the Geodetic Number of a Graph","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Geodetic datum; Combinatorics; Mathematics; Graph; Shortest path problem; Geodesic; Discrete mathematics; Connectivity; Geodesy; Geography","score_opus":0.01666711046111486,"score_gpt":0.31680160010200253,"score_spread":0.3001344896408877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022534016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21196172,0.0073146964,0.74413323,0.009104302,0.00080386683,0.0002861504,0.0019864575,0.0062727937,0.01813677],"genre_scores_gemma":[0.46001267,0.002133403,0.5261841,0.00083018927,0.0005240936,0.00019545239,0.0022949525,0.00087630365,0.0069488753],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938175,0.0021576618,0.0004752509,0.0010730884,0.0020252974,0.0004512021],"domain_scores_gemma":[0.9702094,0.021065777,0.0010753467,0.004962263,0.002034476,0.00065275125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052695656,0.00112828,0.002052659,0.005159623,0.0026008983,0.004108602,0.0029285122,0.0021601368,0.006132812],"category_scores_gemma":[0.045661252,0.00091589434,0.0010161739,0.008096265,0.0030517683,0.009888946,0.0044199857,0.0022654114,0.0023942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015015908,0.00018694061,0.015039358,0.0005493717,0.00015666973,0.0003719815,0.0010614194,0.22586593,0.0045772074,0.13015348,0.034224436,0.5863116],"study_design_scores_gemma":[0.00014532643,0.0001706373,0.0031523216,0.00012609524,0.00005995934,0.0005348441,0.0006364276,0.7354834,0.0052559813,0.23936659,0.014992584,0.00007582354],"about_ca_topic_score_codex":0.024283655,"about_ca_topic_score_gemma":0.041372094,"teacher_disagreement_score":0.024283655,"about_ca_system_score_codex":0.0027228415,"about_ca_system_score_gemma":0.0031043387,"threshold_uncertainty_score":0.04828459},"labels":[],"label_agreement":null},{"id":"W3022937793","doi":"10.2140/involve.2023.16.249","title":"Pairs of disjoint matchings and related classes of graphs","year":2023,"lang":"en","type":"article","venue":"Involve a Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Graph; Matching (statistics); Induced subgraph; Discrete mathematics","score_opus":0.03364547344454044,"score_gpt":0.2960918141248234,"score_spread":0.26244634068028294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022937793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7467366,0.002444023,0.1594708,0.0031421336,0.0001766973,0.0002856426,0.001550522,0.0007576561,0.08543591],"genre_scores_gemma":[0.95545083,0.0012210363,0.034200404,0.00040426955,0.00032645045,0.00020663848,0.0012155727,0.00016754358,0.006807284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974195,0.00078849326,0.00011320385,0.0007705758,0.000480862,0.0004274653],"domain_scores_gemma":[0.99395317,0.0035387513,0.0011815315,0.00053838023,0.00022141433,0.00056661235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015856216,0.0010939577,0.0009831701,0.0032097416,0.0013452941,0.003093457,0.0025527098,0.001906514,0.007828812],"category_scores_gemma":[0.010556125,0.00064195273,0.0013193625,0.00241781,0.0021607205,0.0069134566,0.0025845303,0.0018780804,0.0008503914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045538018,0.00016224125,0.0035231716,0.00026488176,0.0000797957,0.00025057822,0.0004477664,0.020701522,0.0036652924,0.93143874,0.005488645,0.03352199],"study_design_scores_gemma":[0.00015676292,0.00021149994,0.0028726666,0.00008198627,0.00009801174,0.001076947,0.0004801369,0.10310985,0.00429172,0.8723401,0.015223603,0.000056733606],"about_ca_topic_score_codex":0.00097318203,"about_ca_topic_score_gemma":0.0005381359,"teacher_disagreement_score":0.007828812,"about_ca_system_score_codex":0.0021360952,"about_ca_system_score_gemma":0.0005133636,"threshold_uncertainty_score":0.026189923},"labels":[],"label_agreement":null},{"id":"W3023069363","doi":"10.55016/ojs/cdm.v19i3.75096","title":"note on total co-independent domination in trees","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Junta de Andalucía","keywords":"Mathematics; Combinatorics","score_opus":0.015496870354148162,"score_gpt":0.3529796377747737,"score_spread":0.33748276742062555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023069363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2903432,0.01581081,0.5399784,0.0070781154,0.00071010937,0.0001593164,0.0012043983,0.00047608334,0.1442396],"genre_scores_gemma":[0.93747216,0.0063966997,0.04340462,0.0012511171,0.0010772988,0.00017535391,0.0005805708,0.00016963125,0.009472539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813324,0.00040471603,0.00007138248,0.00040333124,0.0005816035,0.00040576723],"domain_scores_gemma":[0.9831513,0.013057371,0.0008576027,0.0009348366,0.0011779808,0.00082092057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019730558,0.00068135775,0.001008987,0.0022194542,0.0020966837,0.0021369867,0.0012339401,0.0008373971,0.002994823],"category_scores_gemma":[0.01036419,0.00042381018,0.00087633566,0.0036441132,0.0025184338,0.0035441704,0.0024527572,0.0026341432,0.00042083068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025010193,0.000081118815,0.005266866,0.0003616129,0.000114037495,0.0005094023,0.000827327,0.05803076,0.0073263743,0.87900954,0.013164748,0.035058137],"study_design_scores_gemma":[0.000046820944,0.00014397595,0.003694838,0.00012775675,0.00011310139,0.0016032627,0.00028002117,0.1592033,0.0038015184,0.7951822,0.035743635,0.00005956212],"about_ca_topic_score_codex":0.0029290942,"about_ca_topic_score_gemma":0.0029281098,"teacher_disagreement_score":0.002994823,"about_ca_system_score_codex":0.002094579,"about_ca_system_score_gemma":0.00076454005,"threshold_uncertainty_score":0.015197337},"labels":[],"label_agreement":null},{"id":"W3025859122","doi":"10.48550/arxiv.2005.05547","title":"List homomorphism problems for signed trees","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"","keywords":"Homomorphism; Signed graph; Combinatorics; Computer science; Mathematics; Discrete mathematics; Graph","score_opus":0.13146786052517617,"score_gpt":0.2234620014538894,"score_spread":0.09199414092871322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025859122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25607792,0.0010354625,0.709433,0.0036085555,0.00025162112,0.0002670494,0.0010242412,0.0008480939,0.027453948],"genre_scores_gemma":[0.8124647,0.0012808847,0.16557428,0.000737184,0.0005392006,0.0002988454,0.0023767517,0.00040228735,0.016325848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997809,0.0006551661,0.0001317987,0.00059853,0.00046166778,0.0003438813],"domain_scores_gemma":[0.9885795,0.008479162,0.00081982487,0.0010348744,0.0005766324,0.0005099757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015675557,0.0006960204,0.0007608221,0.0012951382,0.001455851,0.0039570024,0.001844596,0.0020574206,0.010949214],"category_scores_gemma":[0.013707253,0.00043907628,0.0016909392,0.0019306072,0.0019754667,0.013899915,0.0027863784,0.004165366,0.0012552358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015342873,0.00021189911,0.0012934746,0.0004045645,0.00003817177,0.00025998696,0.0007771962,0.02703286,0.0031341221,0.91954386,0.0051605813,0.041989777],"study_design_scores_gemma":[0.000020422627,0.000034736415,0.00021267192,0.000022458229,0.000015757789,0.0001755023,0.00021075002,0.040701494,0.0017847281,0.9533937,0.0034061857,0.000021624619],"about_ca_topic_score_codex":0.0009956382,"about_ca_topic_score_gemma":0.00091783935,"teacher_disagreement_score":0.010949214,"about_ca_system_score_codex":0.0021632668,"about_ca_system_score_gemma":0.0011724533,"threshold_uncertainty_score":0.036628783},"labels":[],"label_agreement":null},{"id":"W3026418435","doi":"10.1002/jgt.22579","title":"Generating simple near-bipartite bricks","year":2017,"lang":"","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Apoio ao Desenvolvimento do Ensino, Ciência e Tecnologia do Estado de Mato Grosso do Sul; University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Bipartite graph; Combinatorics; Mathematics; Brick; Complete bipartite graph; Matching (statistics); Vertex (graph theory); Simple (philosophy); Class (philosophy); Discrete mathematics; Graph; Computer science","score_opus":0.08692357924479878,"score_gpt":0.35217860214297997,"score_spread":0.2652550228981812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026418435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38246697,0.0002780803,0.56422305,0.00042922387,0.00012758907,0.0003350858,0.00044494693,0.00064318284,0.051051855],"genre_scores_gemma":[0.8288546,0.00018829868,0.15391433,0.00019990742,0.000029852477,0.0002913197,0.0008007133,0.0001852866,0.015535602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995363,0.00011002051,0.000016937936,0.00009028592,0.00016865249,0.00007792379],"domain_scores_gemma":[0.99915445,0.0003120406,0.0000900542,0.00022227113,0.00014245919,0.000078770056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048350124,0.00031501078,0.0002779692,0.00066416146,0.00058456685,0.0005304999,0.0007405141,0.0005679877,0.006424038],"category_scores_gemma":[0.0023230265,0.00039995037,0.00053585076,0.00043087243,0.0007529552,0.0009442236,0.0022561892,0.00070680055,0.0011021806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016704427,0.00013530394,0.0033095372,0.00031173357,0.000041372077,0.0006995331,0.0010184939,0.026029548,0.054472134,0.8251191,0.006713481,0.08198264],"study_design_scores_gemma":[0.0001649469,0.00037729295,0.0030725833,0.0001748455,0.000071931914,0.001669379,0.00080150826,0.2043967,0.059744325,0.6748673,0.05457664,0.00008264474],"about_ca_topic_score_codex":0.00028778793,"about_ca_topic_score_gemma":0.0007231895,"teacher_disagreement_score":0.006424038,"about_ca_system_score_codex":0.00034277773,"about_ca_system_score_gemma":0.00026896733,"threshold_uncertainty_score":0.021490574},"labels":[],"label_agreement":null},{"id":"W3027490412","doi":"10.1016/j.tcs.2020.05.010","title":"Local search is a PTAS for feedback vertex set in minor-free graphs","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Vertex (graph theory); Minor (academic); Robertson–Seymour theorem; Local search (optimization); Mathematics; Feedback vertex set; Set (abstract data type); Combinatorics; Discrete mathematics; Mathematical optimization; Computer science; Graph; 1-planar graph; Chordal graph","score_opus":0.03530793057521974,"score_gpt":0.30885142335840005,"score_spread":0.2735434927831803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027490412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13484159,0.0005604257,0.8463516,0.0015438509,0.00018118734,0.0005216859,0.0010289925,0.0032233251,0.011747357],"genre_scores_gemma":[0.8029515,0.00033949706,0.18072943,0.00053932343,0.0001428222,0.0005382672,0.0009911547,0.00047712645,0.013290915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794513,0.0005966875,0.00010704324,0.0006201125,0.00039706693,0.0003338786],"domain_scores_gemma":[0.99198496,0.004365374,0.0005681493,0.0015914089,0.00077285885,0.000717181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016672178,0.0011611466,0.0028546536,0.0015493982,0.0024466314,0.0021184403,0.00400204,0.0023953312,0.008260837],"category_scores_gemma":[0.012599273,0.0007731956,0.0017957585,0.002253396,0.0017765437,0.004955013,0.003402774,0.0027503096,0.0013915123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002437698,0.0008302955,0.002958122,0.0013102775,0.00031404622,0.00044514114,0.0008684104,0.34968713,0.01943117,0.36869717,0.034607813,0.21841276],"study_design_scores_gemma":[0.00013236258,0.00025000138,0.00028114606,0.000043778615,0.000100189325,0.00022033654,0.0001132277,0.7595786,0.0031002683,0.2335206,0.002625958,0.000033512333],"about_ca_topic_score_codex":0.0042124926,"about_ca_topic_score_gemma":0.0056072124,"teacher_disagreement_score":0.008260837,"about_ca_system_score_codex":0.0020136903,"about_ca_system_score_gemma":0.0035009456,"threshold_uncertainty_score":0.027635276},"labels":[],"label_agreement":null},{"id":"W3028209208","doi":"10.1007/s10107-020-01513-1","title":"Maximum edge-disjoint paths in planar graphs with congestion 2","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Cegep Edouard Montpetit","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Constant (computer programming); Discrete mathematics; Omega; Planar graph; Planar; Enhanced Data Rates for GSM Evolution; Path (computing); Graph; Computer science","score_opus":0.033529464418315336,"score_gpt":0.27690856794063273,"score_spread":0.2433791035223174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028209208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44703943,0.0013382995,0.51561254,0.0027488605,0.00010611388,0.0003533593,0.001347892,0.0005993128,0.03085427],"genre_scores_gemma":[0.815589,0.0014761316,0.16699104,0.00034011662,0.00014743132,0.00044460705,0.0009062254,0.00024279908,0.013862618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987459,0.00040178577,0.000067990746,0.00029023207,0.0002424018,0.00025164176],"domain_scores_gemma":[0.98985183,0.007875545,0.00094578904,0.0003080676,0.00043128178,0.00058747863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015264722,0.0011200086,0.001537253,0.0024997126,0.001913385,0.0032531284,0.002600484,0.0018638222,0.008134029],"category_scores_gemma":[0.016905425,0.0015287473,0.0009984128,0.0037668217,0.0020598343,0.0070426925,0.0034813958,0.002304452,0.00048536746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005645648,0.00019374849,0.0021310009,0.0008647959,0.00012279364,0.00030742373,0.0008531234,0.15773317,0.0039181816,0.7860691,0.0065317666,0.040710293],"study_design_scores_gemma":[0.000094691604,0.00007528981,0.00070532394,0.00007396558,0.000081302256,0.00022509991,0.00027621686,0.17519273,0.001754311,0.8182647,0.0032288248,0.000027488742],"about_ca_topic_score_codex":0.002035306,"about_ca_topic_score_gemma":0.0028375997,"teacher_disagreement_score":0.008134029,"about_ca_system_score_codex":0.0020656295,"about_ca_system_score_gemma":0.0012523303,"threshold_uncertainty_score":0.02721107},"labels":[],"label_agreement":null},{"id":"W3033173111","doi":"10.1016/j.dam.2023.02.017","title":"A note on the connected game coloring number","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; List coloring; Degeneracy (biology); Fractional coloring; Complete coloring; Discrete mathematics; Graph coloring; Graph; Game tree; Edge coloring; Greedy coloring; Bounded function; Graph power; Sequential game; Game theory; Line graph; Mathematical economics","score_opus":0.03692038711881336,"score_gpt":0.3151873344760995,"score_spread":0.27826694735728613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033173111","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042605028,0.009964438,0.39664587,0.049601514,0.030395161,0.00014603352,0.0006724676,0.000816876,0.46915266],"genre_scores_gemma":[0.61325127,0.013786238,0.21112275,0.023218723,0.021202676,0.0007518846,0.00079236156,0.0012406262,0.11463355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986135,0.00046656016,0.00004785266,0.00036742975,0.00038366282,0.000120975885],"domain_scores_gemma":[0.9931791,0.005223256,0.00018272392,0.0004900828,0.0004979932,0.00042693102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014648241,0.0010756089,0.0012117791,0.0019742495,0.0030360695,0.0030261327,0.00287355,0.0025453677,0.012196511],"category_scores_gemma":[0.010645347,0.0004923912,0.0010571174,0.0032575224,0.0061349887,0.0074824537,0.003093347,0.009145241,0.0020608676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034591143,0.000013764209,0.00008869607,0.00006219996,0.0000058737255,0.000043983553,0.00007524444,0.0014160987,0.00032906633,0.97706956,0.012880655,0.00798023],"study_design_scores_gemma":[0.000009952301,0.000010839002,0.00007751263,0.000022040636,0.000007763088,0.000039785864,0.00002255873,0.0030945898,0.00017488444,0.97590226,0.020626454,0.000011381037],"about_ca_topic_score_codex":0.0034809986,"about_ca_topic_score_gemma":0.0030479755,"teacher_disagreement_score":0.012196511,"about_ca_system_score_codex":0.002330639,"about_ca_system_score_gemma":0.0014805031,"threshold_uncertainty_score":0.040801406},"labels":[],"label_agreement":null},{"id":"W3034049481","doi":"10.1002/jgt.23000","title":"Clique‐width: Harnessing the power of atoms","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Grantová Agentura České Republiky; Leverhulme Trust; Univerzita Karlova v Praze","keywords":"Combinatorics; Mathematics; Split graph; Induced subgraph; Bounded function; Discrete mathematics; Clique graph; Block graph; Graph; Cograph; Chordal graph; Line graph; Graph power; 1-planar graph","score_opus":0.024456856401062845,"score_gpt":0.3125402169419337,"score_spread":0.28808336054087086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034049481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35999414,0.0011325858,0.61523426,0.0026733996,0.00013611036,0.0001399454,0.0004699188,0.0010783396,0.019141369],"genre_scores_gemma":[0.9221533,0.0003242022,0.07435153,0.0002846438,0.00012518399,0.000097548254,0.0002591353,0.00028704022,0.002117479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777067,0.0007526289,0.00007605492,0.00052519876,0.00057183404,0.0003036443],"domain_scores_gemma":[0.9815885,0.013065222,0.0008990341,0.0030393186,0.0006883562,0.0007195168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002306109,0.00055690494,0.0007704745,0.0012747293,0.0011658975,0.0021252432,0.0024299184,0.0009257698,0.0046348497],"category_scores_gemma":[0.01452101,0.0007161891,0.00088773645,0.001182941,0.003574773,0.006852401,0.003953636,0.002532383,0.00039331638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056750997,0.00018536214,0.0045538894,0.00033668973,0.00011446226,0.00022267077,0.0006811237,0.08493803,0.02459407,0.82464856,0.005016361,0.054141305],"study_design_scores_gemma":[0.000045490706,0.00007796735,0.000619678,0.00003985587,0.00003750863,0.00012307313,0.000115722956,0.26583928,0.006876161,0.72158384,0.0046135797,0.000027914299],"about_ca_topic_score_codex":0.0017668103,"about_ca_topic_score_gemma":0.0020887444,"teacher_disagreement_score":0.0046348497,"about_ca_system_score_codex":0.0011251636,"about_ca_system_score_gemma":0.0009175189,"threshold_uncertainty_score":0.015505135},"labels":[],"label_agreement":null},{"id":"W3034503485","doi":"10.1016/j.dam.2020.05.005","title":"A short note on the existence of infinite sequences of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e92\" altimg=\"si14.svg\"><mml:mi>γ</mml:mi></mml:math>-graphs of graphs","year":2020,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Sequence (biology)","score_opus":0.03701922180791595,"score_gpt":0.2808667488443835,"score_spread":0.24384752703646756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034503485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025822414,0.031968422,0.45749834,0.06393802,0.038639117,0.0001306133,0.0018391768,0.001502326,0.3786616],"genre_scores_gemma":[0.41980848,0.03476352,0.2783339,0.029983228,0.041557282,0.0004875102,0.0037000119,0.0027863125,0.18857978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811125,0.0005382621,0.00019103616,0.0006148545,0.00040647056,0.00013806061],"domain_scores_gemma":[0.97967553,0.01614617,0.00055159244,0.0016115381,0.0013981145,0.000617012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025225026,0.0012484085,0.0009702316,0.0019950096,0.0037911371,0.003746186,0.0019289146,0.0022673737,0.012185233],"category_scores_gemma":[0.014420712,0.00074570096,0.0017177353,0.0020170126,0.0044825464,0.01045519,0.003435184,0.008722139,0.0034520223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012975019,0.000030775784,0.0005211792,0.00049558555,0.000040691506,0.00097518513,0.00082327606,0.0008699754,0.0028339238,0.899081,0.06558185,0.028616818],"study_design_scores_gemma":[0.00001005671,0.00004908975,0.00059578504,0.00012899158,0.000038097307,0.0009856499,0.00014343276,0.0019500771,0.0017648429,0.8586959,0.13558558,0.000052496627],"about_ca_topic_score_codex":0.0011373374,"about_ca_topic_score_gemma":0.0013822491,"teacher_disagreement_score":0.012185233,"about_ca_system_score_codex":0.0015698053,"about_ca_system_score_gemma":0.00069469534,"threshold_uncertainty_score":0.040763736},"labels":[],"label_agreement":null},{"id":"W3035268094","doi":"10.55016/ojs/cdm.v18i1.71282","title":"Confining the robber on cographs","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Sociology; Computer science","score_opus":0.027986143969503535,"score_gpt":0.34651970039259955,"score_spread":0.318533556423096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035268094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68297595,0.00029094703,0.2917491,0.0009994736,0.000055178723,0.0002512034,0.00031977662,0.0006797259,0.02267854],"genre_scores_gemma":[0.91920847,0.00018789046,0.07040036,0.00029916197,0.00003151196,0.00031430807,0.0003670054,0.00016106166,0.009030228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727696,0.0007011845,0.00016133643,0.00064628007,0.00039906614,0.00081520004],"domain_scores_gemma":[0.9902006,0.004786073,0.0014028647,0.001611859,0.0005254094,0.0014732085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001502948,0.0011366501,0.0013974899,0.0009558903,0.0023994048,0.0020994563,0.0020055596,0.0013571137,0.008785393],"category_scores_gemma":[0.0098488005,0.00076080183,0.0010873284,0.00092625595,0.0046092463,0.007217161,0.0035642802,0.00169187,0.00064960535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007436057,0.0003075577,0.0037194437,0.00058594276,0.000095218114,0.00074763934,0.002952188,0.06367261,0.018638335,0.8566621,0.0045757093,0.047299746],"study_design_scores_gemma":[0.00012539336,0.0005736972,0.0039052651,0.0001500968,0.00009493139,0.0009147219,0.0021646244,0.21502075,0.016941348,0.7398062,0.020158175,0.00014491055],"about_ca_topic_score_codex":0.003855834,"about_ca_topic_score_gemma":0.0049949917,"teacher_disagreement_score":0.008785393,"about_ca_system_score_codex":0.0020027328,"about_ca_system_score_gemma":0.0011843956,"threshold_uncertainty_score":0.029390097},"labels":[],"label_agreement":null},{"id":"W3036465104","doi":"10.48550/arxiv.2006.11713","title":"Graphs of relational structures: restricted types","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semilattice; Mathematics; Bounded function; Algebraic structure; Constraint satisfaction problem; Discrete mathematics; Affine transformation; Type (biology); Combinatorics; Pure mathematics","score_opus":0.10009595993754256,"score_gpt":0.22177759011177114,"score_spread":0.12168163017422859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036465104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061477117,0.00043172526,0.923168,0.0014856877,0.00006110723,0.00013458838,0.0005307567,0.00046663536,0.012244401],"genre_scores_gemma":[0.61159134,0.0009062119,0.37689045,0.00054864475,0.00018141235,0.00038943544,0.0010825269,0.00028150613,0.0081284195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961482,0.0013819968,0.0002931225,0.0009199075,0.000978764,0.00027808634],"domain_scores_gemma":[0.9926374,0.003730606,0.0007757856,0.0019567204,0.00062250166,0.0002768854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022736185,0.00046445229,0.0007815913,0.0010811486,0.0012386775,0.0041471045,0.0017204661,0.0009397544,0.004548797],"category_scores_gemma":[0.007883756,0.0008063383,0.0017340669,0.002319998,0.0039692544,0.013117777,0.0031677024,0.0036607857,0.0005902655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050495437,0.000015456579,0.00031932094,0.0000780329,0.00001661879,0.00007222151,0.00023097044,0.008006381,0.0011283907,0.97997737,0.00052469235,0.009580149],"study_design_scores_gemma":[0.000019786912,0.000011403551,0.00013616573,0.000013041323,0.000020291529,0.00009238264,0.00010404367,0.021759193,0.0015059732,0.9702102,0.0061138757,0.000013569652],"about_ca_topic_score_codex":0.0027381175,"about_ca_topic_score_gemma":0.0031434335,"teacher_disagreement_score":0.004548797,"about_ca_system_score_codex":0.0016386088,"about_ca_system_score_gemma":0.0013583079,"threshold_uncertainty_score":0.015217185},"labels":[],"label_agreement":null},{"id":"W3036472213","doi":"10.48550/arxiv.2006.12929","title":"Approximation algorithms for general cluster routing problem","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Vertex (graph theory); Triangle inequality; Combinatorics; Approximation algorithm; Undirected graph; Graph; Routing (electronic design automation); Mathematics; Weight function; Cluster (spacecraft); Graph algorithms; Computer science; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Artificial intelligence","score_opus":0.11950083996847681,"score_gpt":0.24259059314852227,"score_spread":0.12308975318004546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036472213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0854151,0.0042710137,0.8824296,0.0033169398,0.00030436367,0.00032247652,0.0012117475,0.0021575198,0.020571144],"genre_scores_gemma":[0.5674441,0.0027265002,0.41269633,0.0008725886,0.00036775225,0.00048932293,0.0031989242,0.0006487658,0.011555636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794406,0.00049846235,0.000078649726,0.0006859582,0.00036010824,0.00043272087],"domain_scores_gemma":[0.9963068,0.002000966,0.00037381973,0.00072841934,0.00035340496,0.00023668047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022496188,0.0016625158,0.0017009451,0.0014869933,0.0013594863,0.0027833607,0.004752321,0.0024627761,0.0068666814],"category_scores_gemma":[0.009556258,0.0006563801,0.0013589284,0.0042010527,0.0012575687,0.0052219783,0.0021571233,0.0027214407,0.0011811779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007614999,0.00030822222,0.0022382122,0.00055193127,0.00017562928,0.00014083089,0.00030951624,0.74505836,0.0019011698,0.100621775,0.031870913,0.11606194],"study_design_scores_gemma":[0.00008017324,0.000052738138,0.00028013033,0.000022541382,0.000042191794,0.000092001595,0.00008318955,0.9290686,0.00052809605,0.06610673,0.0036314072,0.000012102087],"about_ca_topic_score_codex":0.008649827,"about_ca_topic_score_gemma":0.008352192,"teacher_disagreement_score":0.008649827,"about_ca_system_score_codex":0.003940433,"about_ca_system_score_gemma":0.0028760894,"threshold_uncertainty_score":0.028589964},"labels":[],"label_agreement":null},{"id":"W3036487380","doi":"10.1145/3470869","title":"On the Parameterized Approximability of Contraction to Classes of Chordal Graphs","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Department of Science and Technology, Ministry of Science and Technology, India; European Commission","keywords":"Parameterized complexity; Combinatorics; Chordal graph; Mathematics; Bounded function; Contraction (grammar); Treewidth; Time complexity; Discrete mathematics; Graph; Pathwidth; Line graph; Mathematical analysis","score_opus":0.0400114360570754,"score_gpt":0.3237282170312386,"score_spread":0.2837167809741632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036487380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6270781,0.0007939541,0.35695404,0.0025797177,0.00008054483,0.00021759738,0.00088366837,0.0022546,0.009157738],"genre_scores_gemma":[0.9098533,0.00057434663,0.08268131,0.0003867901,0.00016267101,0.00022221982,0.001565924,0.00055697025,0.00399651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965643,0.0006129476,0.00019583345,0.001137281,0.000718543,0.00077117904],"domain_scores_gemma":[0.97837216,0.014413672,0.0014428194,0.0040499656,0.0007033457,0.0010179053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024643068,0.0013012599,0.0017390953,0.0010828892,0.0014879666,0.003663717,0.003806175,0.0018102049,0.0051878793],"category_scores_gemma":[0.024433544,0.00075610244,0.0024670828,0.0018132369,0.0027929102,0.011490739,0.0038118185,0.00487847,0.00061575026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026805473,0.0010441487,0.019372934,0.0008071503,0.0003134617,0.00043332757,0.0029645967,0.5326599,0.02065299,0.28767213,0.010624576,0.12077419],"study_design_scores_gemma":[0.00012719225,0.00015778797,0.0013655528,0.000035676116,0.00007902964,0.00022694656,0.00026618392,0.78973603,0.0041524456,0.20168355,0.002134467,0.0000351461],"about_ca_topic_score_codex":0.0057948404,"about_ca_topic_score_gemma":0.004619527,"teacher_disagreement_score":0.0057948404,"about_ca_system_score_codex":0.004322968,"about_ca_system_score_gemma":0.0023877136,"threshold_uncertainty_score":0.031365395},"labels":[],"label_agreement":null},{"id":"W3037156551","doi":"","title":"Rayleigh Matroids","year":2003,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Graphic matroid; Combinatorics; Matroid partitioning; Binary number; Minor (academic); Mathematics; Class (philosophy); Property (philosophy); Discrete mathematics; Computer science; Arithmetic","score_opus":0.059385771858763904,"score_gpt":0.1953893082144644,"score_spread":0.1360035363557005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037156551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3497857,0.0021390899,0.49458164,0.0019429252,0.00025326593,0.00019880399,0.0013484833,0.00084086997,0.14890921],"genre_scores_gemma":[0.909232,0.0012289208,0.053219453,0.00042503042,0.00037734478,0.00014882667,0.00069381297,0.000104797255,0.034569874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994748,0.0000791099,0.00003106746,0.00014373587,0.0001666359,0.000104517334],"domain_scores_gemma":[0.999203,0.00019981054,0.00019332753,0.000111443616,0.00018605715,0.00010639583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002724142,0.00053648144,0.00038163774,0.0007673523,0.0007134869,0.0015597593,0.0006958628,0.0005635631,0.006697437],"category_scores_gemma":[0.0011828543,0.0002830712,0.00050560525,0.0005683082,0.0010812995,0.0025348219,0.0012762411,0.0009281797,0.0011482916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007395745,0.000024848501,0.0009845113,0.000111186666,0.000020463654,0.00022800974,0.00026906727,0.010387948,0.011627791,0.94674087,0.0034371263,0.026094196],"study_design_scores_gemma":[0.000035718716,0.00015195743,0.0021217456,0.00005606924,0.00003374197,0.0016553217,0.00047671743,0.09253107,0.011303093,0.82035124,0.07123914,0.00004424175],"about_ca_topic_score_codex":0.0007932312,"about_ca_topic_score_gemma":0.0008499536,"teacher_disagreement_score":0.006697437,"about_ca_system_score_codex":0.0006440796,"about_ca_system_score_gemma":0.0002576667,"threshold_uncertainty_score":0.022405207},"labels":[],"label_agreement":null},{"id":"W3037312983","doi":"10.1002/jgt.22849","title":"Flexible list colorings in graphs with special degeneracy conditions","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; European Commission; Univerzita Karlova v Praze","keywords":"Degeneracy (biology); Combinatorics; Treewidth; Mathematics; List coloring; Planar graph; Graph; Discrete mathematics; 1-planar graph; Chordal graph; Degree (music); Indifference graph; Pathwidth; Graph power; Line graph","score_opus":0.015585480340653685,"score_gpt":0.27887344906230044,"score_spread":0.2632879687216467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037312983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8202022,0.00042539064,0.15706326,0.0013086988,0.000057081423,0.000105409374,0.0010538319,0.00057055004,0.019213479],"genre_scores_gemma":[0.97181183,0.00014634508,0.024823181,0.00024111939,0.000041937325,0.00007673716,0.0006366851,0.00012478212,0.0020972833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975325,0.0005429883,0.0002263635,0.00070842134,0.0005451665,0.00044445196],"domain_scores_gemma":[0.98724014,0.006584877,0.0016908154,0.0025853259,0.00066792703,0.0012309892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014844503,0.000513219,0.0009176767,0.0012401238,0.0016761683,0.0018374614,0.0014216793,0.0010517807,0.006190232],"category_scores_gemma":[0.011173346,0.0007433107,0.0009157381,0.0014944259,0.0026681633,0.005664134,0.002964142,0.0024616367,0.0005009307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016386497,0.00030294908,0.014015515,0.0004964924,0.00010401806,0.0014661717,0.0022334263,0.09875208,0.033244886,0.7893531,0.0050028735,0.053389918],"study_design_scores_gemma":[0.00011021228,0.00012162018,0.0028870718,0.00006711548,0.000044945125,0.0010302155,0.0005116866,0.107772715,0.008911242,0.8724741,0.006009051,0.00006002067],"about_ca_topic_score_codex":0.0011081124,"about_ca_topic_score_gemma":0.0010215952,"teacher_disagreement_score":0.006190232,"about_ca_system_score_codex":0.0017696704,"about_ca_system_score_gemma":0.0005725365,"threshold_uncertainty_score":0.020708442},"labels":[],"label_agreement":null},{"id":"W3039600647","doi":"10.48550/arxiv.2007.00688","title":"Typical structure of hereditary graph families. II. Exotic examples","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chordal graph; Cograph; Indifference graph; Split graph; Induced subgraph; Bipartite graph; Discrete mathematics; Conjecture; Pathwidth; Rothschild; 1-planar graph; Graph; Line graph; Vertex (graph theory)","score_opus":0.09766176624833148,"score_gpt":0.21185343449372313,"score_spread":0.11419166824539165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039600647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7864064,0.0024286096,0.11844401,0.0023079657,0.000096300966,0.00007854521,0.0008748336,0.00054702477,0.0888163],"genre_scores_gemma":[0.9767174,0.00058040995,0.018182896,0.00018904964,0.00007862091,0.00006857962,0.00036614115,0.00004510817,0.003771746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995278,0.00011981229,0.000020553587,0.00011127017,0.0001410228,0.000079556936],"domain_scores_gemma":[0.99841964,0.0007543649,0.00022873215,0.00023918698,0.00013980102,0.00021823756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005185021,0.00028428016,0.0003571931,0.0015334024,0.0014619456,0.0012602139,0.00070607715,0.0008459488,0.0034811327],"category_scores_gemma":[0.0023562047,0.00038225693,0.0005059051,0.0010528328,0.0022986599,0.0030191564,0.0012236964,0.0010313435,0.00024111943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031857948,0.000017629607,0.0016499717,0.00008027341,0.000011182563,0.00022943676,0.00044637333,0.0028266292,0.0013793323,0.9860616,0.002063132,0.0052025774],"study_design_scores_gemma":[0.000019278565,0.000026177548,0.00192169,0.000034739067,0.000016373477,0.0010359851,0.0003866487,0.018029757,0.0013861802,0.9657172,0.011405323,0.000020669866],"about_ca_topic_score_codex":0.0008040917,"about_ca_topic_score_gemma":0.00077473326,"teacher_disagreement_score":0.0034811327,"about_ca_system_score_codex":0.0012793891,"about_ca_system_score_gemma":0.00023071736,"threshold_uncertainty_score":0.011645496},"labels":[],"label_agreement":null},{"id":"W3042919926","doi":"10.46298/dmtcs.6700","title":"Further results on Hendry's Conjecture","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Dawson College; Université de Montréal; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal; Sharif University of Technology","keywords":"Conjecture; Mathematics; Chordal graph; Combinatorics; Intersection (aeronautics); Collatz conjecture; Graph; Hamiltonian (control theory); Hamiltonian path; Point (geometry); Interval graph; Discrete mathematics; Geometry; 1-planar graph; Mathematical optimization","score_opus":0.017748012630023367,"score_gpt":0.2910877435517327,"score_spread":0.2733397309217094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042919926","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33699465,0.007001272,0.26162007,0.05153769,0.0017422404,0.00032590912,0.0018929164,0.0014790258,0.33740625],"genre_scores_gemma":[0.9364014,0.0024150475,0.02920369,0.005730516,0.0011215761,0.00012425098,0.0017637215,0.00020872457,0.023031048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666613,0.0006030833,0.0001328331,0.0011077393,0.00087706564,0.0006130921],"domain_scores_gemma":[0.98577154,0.008289873,0.0007582129,0.0027725801,0.0016602149,0.0007476655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022750434,0.0008114441,0.0014348713,0.0016945628,0.0025308246,0.002509595,0.0022617597,0.0020245702,0.011885513],"category_scores_gemma":[0.020586157,0.00054570375,0.001180891,0.0023321884,0.004082537,0.01111516,0.004864113,0.0054897377,0.0015222961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033765522,0.00012976259,0.0048407996,0.00035081405,0.000071466515,0.0007325094,0.0013360371,0.008385381,0.0033165314,0.9048288,0.031482395,0.044187855],"study_design_scores_gemma":[0.000072343384,0.00007603229,0.00200985,0.00009832612,0.00006922027,0.00054690125,0.00068110914,0.027072772,0.0032727337,0.9163064,0.049743447,0.000050877166],"about_ca_topic_score_codex":0.0049341233,"about_ca_topic_score_gemma":0.0025048757,"teacher_disagreement_score":0.011885513,"about_ca_system_score_codex":0.0018800023,"about_ca_system_score_gemma":0.00084708055,"threshold_uncertainty_score":0.039761066},"labels":[],"label_agreement":null},{"id":"W3043877875","doi":"10.1016/j.dam.2020.07.010","title":"2-limited broadcast domination in subcubic graphs","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Johannesburg","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Domination analysis; Graph; Induced subgraph; Connectivity; Discrete mathematics","score_opus":0.02702497115867646,"score_gpt":0.2769321981802712,"score_spread":0.24990722702159474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043877875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7878892,0.0007978697,0.12420733,0.001648322,0.00010767893,0.00025368738,0.0013762818,0.000565013,0.08315471],"genre_scores_gemma":[0.9594361,0.00052916206,0.017709684,0.00052058423,0.00012141867,0.00021868285,0.0009460009,0.00017354461,0.020344697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989526,0.0002685857,0.00004772082,0.00019752528,0.00024537518,0.0002880268],"domain_scores_gemma":[0.9917229,0.0050610523,0.0007741246,0.00075981405,0.0007481302,0.0009339667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008430756,0.00065871625,0.0013160293,0.0017060726,0.0020969373,0.0028564013,0.0019092053,0.0011568998,0.00851381],"category_scores_gemma":[0.006073923,0.0007539744,0.0006675941,0.0019266686,0.001374173,0.0029081812,0.002207647,0.0018916442,0.00092560047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009845935,0.00021707297,0.0037956801,0.00052932586,0.000110681765,0.0010796987,0.0016300421,0.02953157,0.013871508,0.9044877,0.012434304,0.031327743],"study_design_scores_gemma":[0.00017169828,0.00006892165,0.0015876885,0.0000854285,0.00008491409,0.0007936281,0.00070570654,0.120110795,0.005370845,0.8648128,0.00617029,0.000037245816],"about_ca_topic_score_codex":0.0027202156,"about_ca_topic_score_gemma":0.0040215594,"teacher_disagreement_score":0.00851381,"about_ca_system_score_codex":0.0014362555,"about_ca_system_score_gemma":0.001098492,"threshold_uncertainty_score":0.028481543},"labels":[],"label_agreement":null},{"id":"W3044049558","doi":"10.37236/9785","title":"Chromatic Polynomials of 2-Edge-Coloured Graphs","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mount Saint Vincent University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic polynomial; Combinatorics; Mathematics; Chromatic scale; Vertex (graph theory); Friendship graph; Windmill graph; Discrete mathematics; Homomorphism; 1-planar graph; Graph; Chordal graph; Line graph; Voltage graph","score_opus":0.013926403745023656,"score_gpt":0.2787152718307317,"score_spread":0.26478886808570806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044049558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84664625,0.0002669735,0.12851678,0.00032581168,0.00008972434,0.00006021435,0.00041932674,0.00027999535,0.023395048],"genre_scores_gemma":[0.98231953,0.00014656447,0.010968555,0.000051925086,0.00004138822,0.00002918528,0.00017289404,0.00009957354,0.0061704037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952173,0.00007284146,0.0000117200925,0.000099075434,0.00012299391,0.00017173872],"domain_scores_gemma":[0.99852604,0.0006804162,0.00023287401,0.00016083692,0.00022487839,0.00017501108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004240753,0.0003246772,0.0002785356,0.0013397742,0.00060030434,0.0015720587,0.0007016172,0.00044175715,0.004094271],"category_scores_gemma":[0.0028685264,0.00022934309,0.00041989717,0.0010075412,0.0016645303,0.0015444241,0.0010023729,0.0011230947,0.00048387353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018910877,0.000059815353,0.0036599943,0.000115026276,0.000020560703,0.00026019005,0.0010558696,0.037496623,0.029566966,0.90271914,0.002526304,0.022330299],"study_design_scores_gemma":[0.000046648955,0.0000816037,0.008620586,0.0000374743,0.000018818211,0.000480453,0.00033011337,0.13300347,0.013592092,0.83489436,0.00878795,0.00010637112],"about_ca_topic_score_codex":0.0025720862,"about_ca_topic_score_gemma":0.0032510245,"teacher_disagreement_score":0.004094271,"about_ca_system_score_codex":0.0013735383,"about_ca_system_score_gemma":0.000533143,"threshold_uncertainty_score":0.01369673},"labels":[],"label_agreement":null},{"id":"W3046024813","doi":"10.1016/j.jctb.2023.10.010","title":"Edge-colouring graphs with local list sizes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Generalization; Hypergraph; Edge coloring; Chromatic scale; Degree (music); Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.012261408479186386,"score_gpt":0.26337507367268187,"score_spread":0.2511136651934955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046024813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59337026,0.00055395067,0.33289298,0.0025574754,0.00017954608,0.0002006507,0.0015450831,0.0034179145,0.06528216],"genre_scores_gemma":[0.9093125,0.00035591258,0.0644377,0.0005743442,0.00021234326,0.00029865684,0.0008531769,0.00084381993,0.023111535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767286,0.0006596343,0.00014181047,0.00059413415,0.00044777873,0.00048385456],"domain_scores_gemma":[0.96705705,0.02122974,0.0025217517,0.0049592205,0.0018493119,0.0023827902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020125436,0.0011577912,0.001675392,0.002296089,0.0026689896,0.005422398,0.004258136,0.0024793586,0.017634854],"category_scores_gemma":[0.016168347,0.0014728913,0.0012388363,0.0035705378,0.0036925634,0.009353473,0.004113905,0.003531378,0.0022006365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063911814,0.0002760914,0.0030792113,0.0003351453,0.000075593,0.0005010452,0.0008230516,0.033441376,0.010684153,0.91525495,0.008520823,0.026369577],"study_design_scores_gemma":[0.00009982594,0.00006396828,0.000786001,0.00004475384,0.00008456296,0.0003611154,0.00021896572,0.04794186,0.0040400987,0.94377947,0.0025292914,0.000050073333],"about_ca_topic_score_codex":0.001366505,"about_ca_topic_score_gemma":0.0027469362,"teacher_disagreement_score":0.017634854,"about_ca_system_score_codex":0.0021361082,"about_ca_system_score_gemma":0.0013619277,"threshold_uncertainty_score":0.058994412},"labels":[],"label_agreement":null},{"id":"W3047829504","doi":"10.1007/978-3-030-57602-8_37","title":"Computing the One-Visibility Copnumber of Trees","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Visibility; Computer science; Tree (set theory); Algorithm; Mathematics; Combinatorics; Geography; Meteorology","score_opus":0.03476839228761736,"score_gpt":0.29968621143235363,"score_spread":0.2649178191447363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047829504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6497097,0.0011804196,0.27827367,0.001552388,0.00035314984,0.00008550263,0.0028376768,0.0019979922,0.06400943],"genre_scores_gemma":[0.8560719,0.0005066824,0.12702104,0.00015596447,0.00023762383,0.0000729602,0.003068456,0.0007795562,0.01208591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990938,0.000117721764,0.000048191065,0.0002938253,0.00027097279,0.00017549997],"domain_scores_gemma":[0.99512947,0.002995775,0.00039088653,0.00072044105,0.00034958767,0.00041389882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078577525,0.000769935,0.0011686996,0.002211946,0.001187436,0.0040395255,0.0020543495,0.0011417874,0.012971571],"category_scores_gemma":[0.009419928,0.00063145976,0.0006633204,0.0024854275,0.0019280841,0.007978841,0.0020598911,0.0021924004,0.002068474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009992706,0.00031377395,0.0139968535,0.00077527744,0.00010450125,0.00047396077,0.0009273252,0.094010904,0.0139193805,0.60491765,0.031548228,0.23801287],"study_design_scores_gemma":[0.00006505357,0.00008366853,0.0027418188,0.00007965834,0.000038134604,0.00032285237,0.00022695234,0.2062416,0.005206927,0.7761356,0.008813844,0.000043992983],"about_ca_topic_score_codex":0.0019209418,"about_ca_topic_score_gemma":0.0036744794,"teacher_disagreement_score":0.012971571,"about_ca_system_score_codex":0.0014269896,"about_ca_system_score_gemma":0.0007626485,"threshold_uncertainty_score":0.043394268},"labels":[],"label_agreement":null},{"id":"W3048005910","doi":"10.48550/arxiv.2008.03579","title":"(k; l)-Colourings and Ferrers Diagram Representations of Cographs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Lambda; Partition (number theory); Vertex (graph theory); Graph; Discrete mathematics; Physics","score_opus":0.09360776056746983,"score_gpt":0.23903608853845104,"score_spread":0.1454283279709812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048005910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3302383,0.00046187433,0.5683209,0.001540828,0.00043902712,0.00025387455,0.0015585383,0.0032454103,0.093941234],"genre_scores_gemma":[0.81676716,0.00023477092,0.15895487,0.00041500924,0.000088423796,0.00018165894,0.001292935,0.00032854322,0.021736583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957687,0.00007152937,0.000023427097,0.00014971003,0.00006921238,0.00010920363],"domain_scores_gemma":[0.9991327,0.00033659898,0.00013430418,0.00017256828,0.00011584747,0.00010792447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032114433,0.0003766131,0.00030272422,0.00076736877,0.0009921612,0.0018550847,0.0007597538,0.0011291573,0.011779674],"category_scores_gemma":[0.001969507,0.00027949165,0.000568648,0.0006706831,0.001239783,0.0030942687,0.0012842341,0.0010472175,0.0012919785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093201554,0.000052456937,0.00055127515,0.00008594748,0.000008390469,0.0002259326,0.0007362111,0.00637439,0.0045296242,0.9472546,0.0042957705,0.03579219],"study_design_scores_gemma":[0.000038693437,0.000031297957,0.0003598855,0.00003457661,0.000015278943,0.00018212333,0.00025302157,0.024981875,0.0031903815,0.9454728,0.025416432,0.000023581404],"about_ca_topic_score_codex":0.0028431816,"about_ca_topic_score_gemma":0.0031399734,"teacher_disagreement_score":0.011779674,"about_ca_system_score_codex":0.0013157806,"about_ca_system_score_gemma":0.00066414976,"threshold_uncertainty_score":0.039406896},"labels":[],"label_agreement":null},{"id":"W3048214410","doi":"10.1016/j.akcej.2019.12.016","title":"The <i>k</i>-conversion number of regular graphs","year":2020,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Maximal independent set; Vertex (graph theory); Dominating set; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Graph; Chordal graph; 1-planar graph; Computer science","score_opus":0.013337443425529777,"score_gpt":0.275077607849234,"score_spread":0.26174016442370424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048214410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81966215,0.00079696876,0.101853736,0.0013330533,0.00006728147,0.00016051019,0.0010260287,0.00096250337,0.0741377],"genre_scores_gemma":[0.9676762,0.00034439235,0.02556265,0.00015764106,0.000039198974,0.00013367015,0.0005730074,0.000112311056,0.0054010046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897504,0.00015760867,0.000063851214,0.00028571705,0.00026137187,0.0002564612],"domain_scores_gemma":[0.9940942,0.0032509963,0.00061462395,0.001011218,0.0003423306,0.00068673515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007771645,0.0004743367,0.0005350765,0.0011547618,0.0010960251,0.0022441477,0.0015017486,0.00071340497,0.00490636],"category_scores_gemma":[0.0056155827,0.00050036045,0.0005157465,0.0010258729,0.002036863,0.002563486,0.0012642985,0.0017328637,0.00048628438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085203385,0.0003098804,0.012096355,0.0005503539,0.00007879107,0.0005055979,0.0010269842,0.10193643,0.0386035,0.7583439,0.010240497,0.07545571],"study_design_scores_gemma":[0.00012539471,0.00026368457,0.01005595,0.00015577834,0.000093406896,0.0014427147,0.00043130157,0.2940868,0.044428572,0.6290331,0.019776138,0.000107155385],"about_ca_topic_score_codex":0.001235123,"about_ca_topic_score_gemma":0.0013004787,"teacher_disagreement_score":0.00490636,"about_ca_system_score_codex":0.0019110644,"about_ca_system_score_gemma":0.0008216195,"threshold_uncertainty_score":0.01641339},"labels":[],"label_agreement":null},{"id":"W3048336591","doi":"10.48550/arxiv.2008.03568","title":"Chordality of locally semicomplete and weakly quasi-transitive digraphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Transitive relation; Chordal graph; Mathematics; Combinatorics; Strongly connected component; Class (philosophy); Discrete mathematics; Directed graph; Graph; Computer science; Artificial intelligence","score_opus":0.08189300030275225,"score_gpt":0.2186261948534977,"score_spread":0.13673319455074545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048336591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67642486,0.0005663176,0.28531674,0.00029683037,0.000072828385,0.00016078213,0.0012919868,0.00043607154,0.03543365],"genre_scores_gemma":[0.96821713,0.00029909224,0.024171803,0.000076016506,0.000027916974,0.00008268325,0.00076442416,0.000033721186,0.006327217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961394,0.00005359463,0.00004562324,0.00014814331,0.000074996526,0.000063717234],"domain_scores_gemma":[0.99836785,0.0007348879,0.0002001426,0.00026509733,0.0002692407,0.00016283014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024345466,0.00021010895,0.00028743476,0.00078485033,0.0007434853,0.0012661495,0.00042850038,0.00027223246,0.0027856075],"category_scores_gemma":[0.001881131,0.0002343328,0.00043897337,0.0006829857,0.0011171704,0.0014643597,0.000788169,0.0005798214,0.00038076396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010957667,0.000052944826,0.0049479986,0.00019505597,0.000030339588,0.00076679344,0.0012169081,0.0055998005,0.017239764,0.92613393,0.0011473779,0.042559616],"study_design_scores_gemma":[0.000055183064,0.00015258022,0.005522123,0.0000649427,0.00007534276,0.0010238073,0.0005941251,0.038861763,0.012353938,0.9147515,0.026494794,0.000049879327],"about_ca_topic_score_codex":0.0023932448,"about_ca_topic_score_gemma":0.0025724226,"teacher_disagreement_score":0.0027856075,"about_ca_system_score_codex":0.00079798704,"about_ca_system_score_gemma":0.00045003646,"threshold_uncertainty_score":0.009318709},"labels":[],"label_agreement":null},{"id":"W3048509133","doi":"10.1007/978-3-030-92931-2_7","title":"A Short Proof of the Non-biplanarity of $$K_9$$","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Simplicity; Graph; Combinatorics; Battle; Mathematics; Philosophy; Geography; Epistemology","score_opus":0.022983876769389528,"score_gpt":0.30482644945765736,"score_spread":0.28184257268826785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048509133","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017662302,0.035317,0.35940358,0.03810938,0.055568658,0.00045959032,0.0058830976,0.0025384994,0.48505792],"genre_scores_gemma":[0.43062177,0.03338481,0.28265426,0.019230671,0.019828316,0.0012204957,0.0077454825,0.0019145012,0.20339969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922097,0.0001264459,0.000055588924,0.0001708537,0.00030432618,0.00012172948],"domain_scores_gemma":[0.99854904,0.0006611007,0.00010352159,0.00012998392,0.00041483852,0.00014146918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007772871,0.0016961568,0.00081902865,0.0010867371,0.0026237883,0.0017078349,0.00110357,0.00112488,0.042511817],"category_scores_gemma":[0.0023596585,0.0007250617,0.0015624401,0.0014682756,0.0025093297,0.002369776,0.004018833,0.0033460795,0.01412272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001818554,0.00014311125,0.000450706,0.0017105901,0.000112697024,0.0016919611,0.00043500404,0.0017948427,0.020056482,0.6127168,0.24839191,0.112314105],"study_design_scores_gemma":[0.00003247461,0.00015708437,0.0021692791,0.0002607329,0.00006115982,0.001196797,0.00015369347,0.0012648926,0.0076220105,0.47795656,0.50901634,0.0001089348],"about_ca_topic_score_codex":0.001612526,"about_ca_topic_score_gemma":0.001740219,"teacher_disagreement_score":0.042511817,"about_ca_system_score_codex":0.0010355534,"about_ca_system_score_gemma":0.0008042786,"threshold_uncertainty_score":0.1422162},"labels":[],"label_agreement":null},{"id":"W3048740887","doi":"10.48550/arxiv.2008.05069","title":"Vertex-minor-closed classes are $\\chi$-bounded","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minor (academic); Bounded function; Vertex (graph theory); Combinatorics; Mathematics; Discrete mathematics; Computer science; Graph; Humanities; Art; Mathematical analysis","score_opus":0.12523467681475106,"score_gpt":0.22633180401776462,"score_spread":0.10109712720301356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048740887","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7375288,0.0006903065,0.17482755,0.0042583807,0.00026113508,0.00008762965,0.0012935954,0.0009720563,0.08008058],"genre_scores_gemma":[0.97612005,0.00024571945,0.012210306,0.00043543702,0.00018434644,0.00011238843,0.0006694735,0.0002755488,0.009746674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978436,0.00025690984,0.000063993844,0.0007857308,0.0005058664,0.0005438279],"domain_scores_gemma":[0.98347986,0.010326437,0.0009525637,0.0015027706,0.0016735162,0.0020648707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016714344,0.00082139764,0.0014967097,0.002084223,0.00352186,0.0048595914,0.002827895,0.0012579352,0.008438582],"category_scores_gemma":[0.013188262,0.0009550524,0.0014720858,0.0014932518,0.0055805524,0.009864278,0.003703579,0.004294979,0.00088958786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029099776,0.00007400848,0.004760576,0.00014764273,0.00003953878,0.000172867,0.0010666642,0.00432483,0.0035853144,0.9708511,0.00502556,0.009660893],"study_design_scores_gemma":[0.000048273214,0.000045061453,0.0024207898,0.0000378619,0.000041502466,0.0003813963,0.0004604545,0.026122587,0.00302277,0.95943916,0.007940497,0.000039517494],"about_ca_topic_score_codex":0.005133405,"about_ca_topic_score_gemma":0.004292064,"teacher_disagreement_score":0.008438582,"about_ca_system_score_codex":0.0032857114,"about_ca_system_score_gemma":0.0010106657,"threshold_uncertainty_score":0.028229892},"labels":[],"label_agreement":null},{"id":"W3049700057","doi":"10.1002/net.21977","title":"Network reliability: Heading out on the highway","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variety (cybernetics); Reliability (semiconductor); Computer science; Graph theory; Probabilistic logic; Network analysis; Commutative property; Theoretical computer science; Enumeration; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence; Engineering","score_opus":0.04651461942591406,"score_gpt":0.28036012648991504,"score_spread":0.23384550706400098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049700057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48247603,0.021713847,0.2534823,0.061818276,0.0010651076,0.0000807955,0.0011682118,0.0006423455,0.17755318],"genre_scores_gemma":[0.9823893,0.0046541593,0.006137848,0.00054785056,0.00038298673,0.000026130057,0.00011053411,0.00007390272,0.0056773606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989298,0.00046171978,0.000026119991,0.00016976555,0.00025426416,0.00015836663],"domain_scores_gemma":[0.99233717,0.0034391358,0.001055049,0.00065797655,0.0019023855,0.000608235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020436058,0.00023386051,0.00035963103,0.001221186,0.0010906511,0.0030224777,0.000662832,0.0011466143,0.0053674416],"category_scores_gemma":[0.01095145,0.00021849856,0.00025968906,0.0013894883,0.0025686743,0.00651332,0.0013952106,0.001290745,0.0006180082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009818808,0.000013864504,0.006265193,0.00014961117,0.000023851899,0.00019158714,0.001103203,0.02637191,0.0006041723,0.90361047,0.012934717,0.048633195],"study_design_scores_gemma":[0.000008372861,0.00006388124,0.004425032,0.00019321876,0.000021426513,0.00027056955,0.0024347082,0.029241338,0.00054632267,0.91575253,0.047012188,0.000030356248],"about_ca_topic_score_codex":0.003720079,"about_ca_topic_score_gemma":0.003189868,"teacher_disagreement_score":0.0053674416,"about_ca_system_score_codex":0.0013655176,"about_ca_system_score_gemma":0.00088870333,"threshold_uncertainty_score":0.01795584},"labels":[],"label_agreement":null},{"id":"W3052291153","doi":"10.1214/21-aop1532","title":"Universality of cutoff for graphs with an added random matching","year":2022,"lang":"en","type":"article","venue":"The Annals of Probability","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Randomness; Cutoff; Random walk; Random graph; Random regular graph; Universality (dynamical systems); Discrete mathematics; Bounded function; Simple random sample; Graph; Line graph; Statistics; Pathwidth; Mathematical analysis","score_opus":0.09876534836839923,"score_gpt":0.35101235035007594,"score_spread":0.2522470019816767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3052291153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.685749,0.0007291045,0.2981401,0.0008129525,0.000111195026,0.00011037401,0.00047304784,0.0018268604,0.012047325],"genre_scores_gemma":[0.9822963,0.000211617,0.01531873,0.00022726694,0.00010706436,0.00009152793,0.00021065994,0.0001689652,0.0013678274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689734,0.00068641343,0.0001546698,0.0010591593,0.0005667879,0.00063566345],"domain_scores_gemma":[0.977805,0.010936356,0.0026635125,0.004078228,0.001371132,0.003145717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002817106,0.0008006678,0.0021134939,0.0030773762,0.0016804833,0.002550545,0.0023524708,0.0017027078,0.0025766017],"category_scores_gemma":[0.016810803,0.00075543043,0.0020544424,0.0012174654,0.0044810507,0.005079242,0.0038084395,0.0036711448,0.00028563937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021853678,0.00016517463,0.0064072865,0.00022788295,0.000106906045,0.0009840432,0.0008522314,0.02730754,0.013136126,0.9415588,0.0017472934,0.0072881486],"study_design_scores_gemma":[0.00006414382,0.00012901217,0.0031304434,0.00006424544,0.00007302234,0.00089056697,0.00016019346,0.25566638,0.003966922,0.7339511,0.0018211453,0.00008275849],"about_ca_topic_score_codex":0.001312009,"about_ca_topic_score_gemma":0.0007914361,"teacher_disagreement_score":0.0030773762,"about_ca_system_score_codex":0.0020538785,"about_ca_system_score_gemma":0.0007749599,"threshold_uncertainty_score":0.014901936},"labels":[],"label_agreement":null},{"id":"W3065743396","doi":"","title":"Matchings, hypergraphs, association schemes, and semidefinite optimization.","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"","keywords":"Semidefinite programming; Mathematics; Association scheme; Regular polygon; Combinatorics; Context (archaeology); Polyhedron; Hierarchy; Commutative property; Discrete mathematics; Mathematical optimization","score_opus":0.05756878891317799,"score_gpt":0.19849247382762275,"score_spread":0.14092368491444476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3065743396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12733875,0.0006178937,0.85578394,0.0007233347,0.00006402639,0.00008495119,0.00023112223,0.00033503817,0.014820861],"genre_scores_gemma":[0.7584451,0.0005226926,0.23384972,0.0002111617,0.00008088501,0.00014863544,0.00039394936,0.00018013641,0.0061676777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833614,0.0007249986,0.000055224595,0.00031250066,0.00042056252,0.0001506199],"domain_scores_gemma":[0.99003625,0.006097208,0.001263795,0.0016810184,0.00033529958,0.0005864038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038564058,0.0009398145,0.000719677,0.0009779345,0.00085100956,0.0018898544,0.0017702947,0.0010810447,0.0059188884],"category_scores_gemma":[0.01272992,0.00054110336,0.00070848176,0.0018168913,0.0031317424,0.0052535483,0.002338154,0.0030270952,0.0006251682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016008932,0.00012899704,0.001057403,0.00014198813,0.00004680365,0.000045114677,0.00016772865,0.21277706,0.0030969759,0.75398195,0.0018371992,0.026558643],"study_design_scores_gemma":[0.000016826261,0.000055469533,0.00026380538,0.000021231637,0.000009370747,0.000031584645,0.00004573163,0.5483371,0.0017136831,0.4478915,0.0015998743,0.000013775379],"about_ca_topic_score_codex":0.0011032899,"about_ca_topic_score_gemma":0.0015094753,"teacher_disagreement_score":0.0059188884,"about_ca_system_score_codex":0.0017099376,"about_ca_system_score_gemma":0.0009538838,"threshold_uncertainty_score":0.020394862},"labels":[],"label_agreement":null},{"id":"W30750922","doi":"","title":"King's Total Domination Number on the Square of Side n","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Domination analysis; Vertex (graph theory); Combinatorics; Mathematics; Graph; Square (algebra); Connectivity; Discrete mathematics; Geometry","score_opus":0.013299274648357817,"score_gpt":0.2736437662253444,"score_spread":0.2603444915769866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30750922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30850762,0.006334677,0.39095697,0.0055182446,0.00069195614,0.00030442255,0.005141007,0.00128453,0.28126058],"genre_scores_gemma":[0.87954134,0.0041311975,0.06898491,0.0011835955,0.00042546072,0.0003229655,0.0016950407,0.00030780118,0.04340762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855345,0.00019749175,0.000074697804,0.0003869329,0.00039806296,0.0003892522],"domain_scores_gemma":[0.994896,0.0030741675,0.0003566564,0.00070453977,0.0005185566,0.00045015223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001139325,0.000962295,0.0010942661,0.0013497773,0.0012515093,0.0023948494,0.0016836053,0.00065433764,0.009677854],"category_scores_gemma":[0.0050072544,0.0004118893,0.00083640555,0.002075087,0.001948928,0.0041966466,0.0026518106,0.0016387056,0.0013705206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007681833,0.00012240073,0.0064735077,0.0013058139,0.00021828448,0.0006065864,0.0012150862,0.0820822,0.024638614,0.69243145,0.0707244,0.11941348],"study_design_scores_gemma":[0.00012762789,0.00021761829,0.0060261195,0.00021023024,0.00027443524,0.0013574146,0.00040472575,0.21378382,0.018573925,0.6360571,0.12282602,0.00014093169],"about_ca_topic_score_codex":0.004314053,"about_ca_topic_score_gemma":0.007617157,"teacher_disagreement_score":0.009677854,"about_ca_system_score_codex":0.0020691403,"about_ca_system_score_gemma":0.0010788414,"threshold_uncertainty_score":0.032375634},"labels":[],"label_agreement":null},{"id":"W3079396048","doi":"","title":"Distance-Two Coloring of Barnette Graphs.","year":2018,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.03704036719867936,"score_gpt":0.3021818451341628,"score_spread":0.2651414779354834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3079396048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33896524,0.0016334071,0.37136137,0.0046897037,0.0014987449,0.00029146217,0.002235901,0.0010078299,0.27831647],"genre_scores_gemma":[0.77972585,0.00081970444,0.15005189,0.0011902966,0.0002480344,0.00022645039,0.0027376898,0.00041697262,0.06458321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887794,0.0003553254,0.000051406492,0.00022937178,0.00025323467,0.00023266945],"domain_scores_gemma":[0.9954751,0.0020640288,0.0003476181,0.0005304576,0.0007851837,0.0007975903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076110853,0.00057514646,0.00066370843,0.001484304,0.0026745535,0.0026582617,0.0014576453,0.0013325645,0.013147663],"category_scores_gemma":[0.006394744,0.0006427443,0.00062760303,0.0015226491,0.0018633566,0.0032883813,0.002510417,0.0026012894,0.0025384813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029345305,0.00010694762,0.0009584762,0.00017927086,0.000028713277,0.00019809594,0.0004996112,0.0042535006,0.0034540226,0.9539065,0.012976398,0.023145095],"study_design_scores_gemma":[0.00008323621,0.0000417848,0.0009983545,0.000067225956,0.000031636377,0.00034977475,0.00048463038,0.019523228,0.0022568216,0.9540423,0.022087285,0.000033734832],"about_ca_topic_score_codex":0.003538816,"about_ca_topic_score_gemma":0.0054854234,"teacher_disagreement_score":0.013147663,"about_ca_system_score_codex":0.0015244016,"about_ca_system_score_gemma":0.00097241614,"threshold_uncertainty_score":0.04398328},"labels":[],"label_agreement":null},{"id":"W3081802541","doi":"10.46298/dmtcs.6773","title":"On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Convexity; Chromatic scale; Planar graph; Reflexivity; Graph; Indifference graph; Graph homomorphism","score_opus":0.018729579448650727,"score_gpt":0.29148177294934074,"score_spread":0.27275219350069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081802541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90336424,0.00019007141,0.08831926,0.00030298135,0.00002776581,0.00004565417,0.00016144032,0.00014424323,0.007444276],"genre_scores_gemma":[0.97666365,0.00023234799,0.021013707,0.000072453186,0.000037515376,0.000041908377,0.00025605975,0.00006930794,0.001613054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917537,0.00016982833,0.000043104716,0.00027197102,0.0001309636,0.00020867262],"domain_scores_gemma":[0.9903846,0.0058819302,0.0014915055,0.0008893341,0.0004364269,0.00091622793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008732608,0.00056349055,0.00060930237,0.0008448364,0.0012468571,0.002471618,0.0011896171,0.000695197,0.0023870186],"category_scores_gemma":[0.005051567,0.0005861645,0.0008424681,0.00082433526,0.0036972906,0.005321087,0.0015413138,0.0017342394,0.00029020346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071655016,0.00035110908,0.032757357,0.00046689124,0.00011874385,0.0014174656,0.0023247108,0.050505687,0.034100216,0.8355264,0.0020301575,0.0396848],"study_design_scores_gemma":[0.000080681275,0.0002847341,0.013135182,0.00007363417,0.00015056925,0.0020426551,0.0018548307,0.14021188,0.025500502,0.8109113,0.0056264508,0.00012759077],"about_ca_topic_score_codex":0.0013820023,"about_ca_topic_score_gemma":0.0014122005,"teacher_disagreement_score":0.002471618,"about_ca_system_score_codex":0.0010556374,"about_ca_system_score_gemma":0.0007296615,"threshold_uncertainty_score":0.0079853535},"labels":[],"label_agreement":null},{"id":"W3081802581","doi":"10.48550/arxiv.2006.10364","title":"On the Parameterized Approximability of Contraction to Classes of\\n Chordal Graphs","year":2020,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Parameterized complexity; Combinatorics; Mathematics; Contraction (grammar); Discrete mathematics; Time complexity; Treewidth; Interval graph; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.09589895400895976,"score_gpt":0.2187945524125631,"score_spread":0.12289559840360334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081802581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65417016,0.0020294583,0.29423776,0.012221044,0.00026380797,0.00049849594,0.003638023,0.0037349456,0.029206293],"genre_scores_gemma":[0.8759995,0.0013334866,0.10381086,0.0015032345,0.00046534959,0.00045957335,0.006587088,0.0011728088,0.008668156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958139,0.0009487058,0.00021708544,0.0013956521,0.0006599875,0.00096455414],"domain_scores_gemma":[0.9692322,0.02300991,0.0015961741,0.0040331804,0.0007047185,0.0014237966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00384432,0.0022253965,0.0023073491,0.0012703865,0.0023478812,0.005780882,0.005992213,0.0031869127,0.010665992],"category_scores_gemma":[0.028266871,0.0010371775,0.0033808402,0.0025828923,0.0038635782,0.016635442,0.0047204294,0.0068137827,0.0011950299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044019283,0.0016234943,0.020607928,0.0014208973,0.00044512431,0.00048802327,0.0025573324,0.5195232,0.011653029,0.27804118,0.0394221,0.119815744],"study_design_scores_gemma":[0.00032312953,0.00020225038,0.001626132,0.000086973116,0.00013698447,0.0002777815,0.00054071326,0.7521494,0.0035825109,0.2363109,0.0047086617,0.000054613192],"about_ca_topic_score_codex":0.009858109,"about_ca_topic_score_gemma":0.012373845,"teacher_disagreement_score":0.010665992,"about_ca_system_score_codex":0.006780006,"about_ca_system_score_gemma":0.005097794,"threshold_uncertainty_score":0.049192667},"labels":[],"label_agreement":null},{"id":"W3081847610","doi":"10.1002/jgt.22827","title":"Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Greedy coloring; Treewidth; Edge coloring; Discrete mathematics; Graph; Complete coloring; Planar graph; List coloring; Graph power; Pathwidth; Line graph","score_opus":0.014007296998877249,"score_gpt":0.24655203865994169,"score_spread":0.23254474166106442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081847610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33645338,0.0010600646,0.6331859,0.0010490613,0.00014211291,0.00017582826,0.0005981143,0.00093752315,0.026397983],"genre_scores_gemma":[0.803402,0.0009640036,0.19099765,0.00038816532,0.000087441455,0.00014302421,0.0004146814,0.00022333812,0.003379603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985801,0.00033272794,0.000095129355,0.00037314932,0.00029681536,0.00032221092],"domain_scores_gemma":[0.99145997,0.004358458,0.0009503633,0.0018251281,0.00077492156,0.00063112285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014071206,0.0005502525,0.0005471829,0.0009331146,0.0009789617,0.0013825308,0.001220855,0.00056401663,0.0043918006],"category_scores_gemma":[0.007580799,0.0006161865,0.0007658748,0.0013532863,0.0017372114,0.0029726771,0.0016221954,0.0013058952,0.00045774333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011166875,0.0003533148,0.012528351,0.0009335667,0.00012696402,0.0005137411,0.0009253763,0.11885312,0.072038956,0.68401825,0.010082539,0.098509125],"study_design_scores_gemma":[0.00016511527,0.00028899396,0.0037063863,0.00013680132,0.00017351491,0.0010766775,0.00039564882,0.33344087,0.0399754,0.60137194,0.019172037,0.000096630865],"about_ca_topic_score_codex":0.002555065,"about_ca_topic_score_gemma":0.004723054,"teacher_disagreement_score":0.0043918006,"about_ca_system_score_codex":0.0012041264,"about_ca_system_score_gemma":0.0010194941,"threshold_uncertainty_score":0.0146920085},"labels":[],"label_agreement":null},{"id":"W3081951976","doi":"10.26493/2590-9770.1382.2ad","title":"On generalised Petersen graphs of girth 7 that have cop number 4","year":2021,"lang":"en","type":"preprint","venue":"The Art of Discrete and Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Churchill Northern Studies Centre","funders":"","keywords":"Combinatorics; Preprint; Petersen graph; Mathematics; Odd graph; Girth (graph theory); Graph; Discrete mathematics; Computer science; Chordal graph; 1-planar graph; Line graph; Graph power","score_opus":0.03302042111927762,"score_gpt":0.2909532030587902,"score_spread":0.2579327819395126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081951976","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70007443,0.0024920222,0.13468865,0.0019630024,0.00040055503,0.000120486955,0.00050288,0.00032482948,0.15943319],"genre_scores_gemma":[0.9593582,0.0019932692,0.023282496,0.000621285,0.00027164485,0.00008845753,0.0005854472,0.00019211741,0.013607117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991211,0.00022374243,0.000025117119,0.00019637351,0.00022435116,0.00020920405],"domain_scores_gemma":[0.99738187,0.0013719448,0.00049792096,0.00034705998,0.00017667846,0.00022445455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048153196,0.0008968602,0.00064900325,0.0017757161,0.0023217162,0.0015447064,0.00081155734,0.0012554222,0.0063314624],"category_scores_gemma":[0.0039805626,0.00056379195,0.00083946314,0.0013750873,0.0035554087,0.003638197,0.0032350295,0.00237658,0.0012820972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000719302,0.000026352871,0.0014005319,0.00017208159,0.000025806023,0.0009798234,0.0011604662,0.007171499,0.0029864027,0.96922463,0.003876728,0.012903843],"study_design_scores_gemma":[0.000013509225,0.000024131466,0.0010059935,0.00007189494,0.000022626627,0.0007248746,0.00035802473,0.009322196,0.001527556,0.9751312,0.011767049,0.000030922158],"about_ca_topic_score_codex":0.0011630446,"about_ca_topic_score_gemma":0.0014966413,"teacher_disagreement_score":0.0063314624,"about_ca_system_score_codex":0.00096384535,"about_ca_system_score_gemma":0.00042756787,"threshold_uncertainty_score":0.021180868},"labels":[],"label_agreement":null},{"id":"W3082032630","doi":"","title":"Pure pairs. I. Trees and linear anticomplete pairs","year":2020,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Laboratory; Army Research Office; Air Force Office of Scientific Research; Leverhulme Trust; Office of Naval Research; Princeton University; National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Induced subgraph; Disjoint sets; Graph; Vertex (graph theory); Graph factorization; Existential quantification; Bound graph; Discrete mathematics; Graph power; Line graph","score_opus":0.04194121276914904,"score_gpt":0.26384201151043835,"score_spread":0.22190079874128932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082032630","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11115108,0.0989622,0.22636884,0.016347004,0.0077406135,0.00019365121,0.0019069731,0.0009071729,0.5364225],"genre_scores_gemma":[0.8479924,0.020602146,0.037198663,0.0033377113,0.006959819,0.00040214128,0.0012977758,0.00047276352,0.08173663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988527,0.00035753948,0.00008358015,0.0002585645,0.00026760547,0.00018004],"domain_scores_gemma":[0.9980867,0.0011100927,0.00029392997,0.00016558715,0.00018728085,0.00015649661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010520607,0.0011540133,0.0016910334,0.0034277255,0.0033530993,0.006213417,0.0014388573,0.0026397228,0.012104006],"category_scores_gemma":[0.0029355602,0.0010613716,0.0012560543,0.0061516506,0.007049305,0.007830324,0.002582509,0.003645211,0.0037581818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016066171,0.000012251639,0.00008183639,0.000095546035,0.0000041339017,0.000039661034,0.0001852648,0.00018367026,0.00018877962,0.98775697,0.0034069812,0.008028836],"study_design_scores_gemma":[0.000004650278,0.0000088267725,0.00007020629,0.000024055724,0.0000058956875,0.00011691472,0.000059194994,0.0005129566,0.00013103808,0.99382126,0.0052375738,0.00000737032],"about_ca_topic_score_codex":0.0008249843,"about_ca_topic_score_gemma":0.00069877924,"teacher_disagreement_score":0.012104006,"about_ca_system_score_codex":0.0018532975,"about_ca_system_score_gemma":0.0007988822,"threshold_uncertainty_score":0.04049194},"labels":[],"label_agreement":null},{"id":"W3082111916","doi":"10.1007/s10878-020-00630-z","title":"Incremental optimization of independent sets under the reconfiguration framework","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Mathematics; Combinatorics; Treewidth; Chordal graph; Pathwidth; Independent set; Vertex cover; Maximal independent set; Discrete mathematics; Bounded function; Degeneracy (biology); Vertex (graph theory); Dominating set; Planar graph; Clique-sum; Upper and lower bounds; Time complexity; Graph; 1-planar graph; Line graph","score_opus":0.02336265583839775,"score_gpt":0.288456861819923,"score_spread":0.2650942059815253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082111916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062244672,0.0004871802,0.9082784,0.00063076505,0.00013281855,0.00014278993,0.00036329156,0.000633103,0.027087007],"genre_scores_gemma":[0.7278373,0.0006923285,0.25594813,0.00025957887,0.00023826408,0.00035484013,0.0008676906,0.00046690716,0.01333496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931526,0.00025782274,0.000018179693,0.00012144863,0.00015193563,0.00013537273],"domain_scores_gemma":[0.9981609,0.0012455822,0.00011118458,0.00020539177,0.00014538076,0.00013161717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011182635,0.0012942897,0.0015860549,0.00088168465,0.00051084044,0.001466184,0.0025053835,0.0012074204,0.008269575],"category_scores_gemma":[0.0043100584,0.00065721694,0.0011680824,0.0014410492,0.0008564134,0.002313204,0.001706265,0.002045177,0.000841151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020768629,0.00017252692,0.00035218525,0.00019946345,0.00007607532,0.00015491075,0.000056478057,0.7798539,0.002192566,0.12891097,0.0072947377,0.08052855],"study_design_scores_gemma":[0.00002664307,0.00005514069,0.0001559886,0.000011924817,0.000021792006,0.000037856098,0.000018325105,0.91087383,0.00064787443,0.08689417,0.0012464643,0.000009965059],"about_ca_topic_score_codex":0.0016072937,"about_ca_topic_score_gemma":0.0019782647,"teacher_disagreement_score":0.008269575,"about_ca_system_score_codex":0.0010659025,"about_ca_system_score_gemma":0.0012074675,"threshold_uncertainty_score":0.027664483},"labels":[],"label_agreement":null},{"id":"W3086607644","doi":"10.1007/s00373-022-02564-1","title":"On Weak Flexibility in Planar Graphs","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation of Sri Lanka; European Commission; National Science Foundation; Iowa State University; H2020 European Research Council; Simon Fraser University","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Planar graph; Graph; List coloring; Discrete mathematics; Graph power; Line graph","score_opus":0.021900158038334727,"score_gpt":0.2719491916626957,"score_spread":0.250049033624361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086607644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5539188,0.003026251,0.32753614,0.0058639534,0.00041627642,0.00022052407,0.0014383268,0.0014484297,0.10613136],"genre_scores_gemma":[0.9642081,0.0009957867,0.021973701,0.00095314503,0.00048769318,0.00016078373,0.00068704074,0.0002509992,0.010282781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967063,0.00087094697,0.00015432459,0.00090276793,0.0006762864,0.0006893064],"domain_scores_gemma":[0.98659664,0.008104728,0.0013798319,0.0019927556,0.0006734792,0.001252599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018038274,0.0011875418,0.0011295737,0.0027831,0.0021965601,0.0025748315,0.002076557,0.0013551784,0.01096042],"category_scores_gemma":[0.014086337,0.0008453111,0.0018837515,0.0023776926,0.0048107933,0.008624554,0.0070283655,0.003506118,0.0011900748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040311672,0.00005222878,0.0019630739,0.00028313455,0.00006429061,0.00048297644,0.00091905385,0.028085653,0.0040758313,0.9361968,0.004228511,0.023245301],"study_design_scores_gemma":[0.000053261076,0.00010155902,0.00092952105,0.000073217016,0.00005293784,0.00037028876,0.00030167834,0.033949655,0.0015098843,0.9503167,0.012284648,0.00005664337],"about_ca_topic_score_codex":0.001627271,"about_ca_topic_score_gemma":0.0010020102,"teacher_disagreement_score":0.01096042,"about_ca_system_score_codex":0.0017590625,"about_ca_system_score_gemma":0.00057287625,"threshold_uncertainty_score":0.036666274},"labels":[],"label_agreement":null},{"id":"W3088461072","doi":"10.48550/arxiv.2009.12189","title":"Fractional vertex-arboricity of planar graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arboricity; Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Outerplanar graph; Degeneracy (biology); Graph; Discrete mathematics; Pathwidth; Line graph; Biology","score_opus":0.09228926834201523,"score_gpt":0.22167512805600031,"score_spread":0.12938585971398509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088461072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8255943,0.0017469947,0.13317034,0.0010113304,0.00004718912,0.00004060062,0.0005182699,0.00026725433,0.03760372],"genre_scores_gemma":[0.9837351,0.0009154935,0.013420331,0.000072875395,0.00006507475,0.000019480784,0.00032512128,0.00003169114,0.0014148913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965715,0.00006728144,0.0000136535755,0.00008690837,0.00010789661,0.00006704847],"domain_scores_gemma":[0.9971631,0.0018069148,0.0003980121,0.00028282183,0.00020047977,0.00014864771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030712198,0.00028621536,0.00037623706,0.0013318723,0.0007003212,0.001028373,0.00063302135,0.00042254713,0.0021873824],"category_scores_gemma":[0.0036964372,0.00026001755,0.00046924545,0.001249854,0.001147606,0.0018865365,0.000831934,0.0009775781,0.0001598063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019422188,0.00007233937,0.010438359,0.00033538535,0.00004082959,0.00064423255,0.0006312706,0.077622905,0.01763976,0.83589274,0.0025540127,0.053933993],"study_design_scores_gemma":[0.000023064285,0.000069985486,0.0042355517,0.000055884306,0.00003584275,0.00082190963,0.00028850752,0.08860644,0.007674693,0.8873105,0.010855397,0.000022231403],"about_ca_topic_score_codex":0.0012112729,"about_ca_topic_score_gemma":0.0013376443,"teacher_disagreement_score":0.0021873824,"about_ca_system_score_codex":0.00081324414,"about_ca_system_score_gemma":0.00029596614,"threshold_uncertainty_score":0.0073174834},"labels":[],"label_agreement":null},{"id":"W3088613651","doi":"10.55016/ojs/cdm.v16i1.71194","title":"A survey of graph burning","year":2021,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Conjecture; Combinatorics; Computer science; Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.04110074314837459,"score_gpt":0.35548392388664524,"score_spread":0.31438318073827065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088613651","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016614996,0.6366781,0.15624285,0.020150263,0.004391997,0.00016182993,0.0016043105,0.0008494498,0.16330627],"genre_scores_gemma":[0.15771888,0.69762075,0.08544426,0.0087595405,0.0112121,0.0002775495,0.0036239955,0.0010154421,0.03432748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979513,0.00045614256,0.00010476107,0.00070643926,0.0006077764,0.0001735583],"domain_scores_gemma":[0.9940017,0.004308127,0.00021330285,0.0006460046,0.0005958279,0.00023510844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019587958,0.0013779149,0.0019118049,0.003936097,0.0020863584,0.0045888247,0.002787998,0.0027175003,0.012614017],"category_scores_gemma":[0.008666345,0.0012399364,0.0015761354,0.008021759,0.0033771726,0.012392775,0.0026693833,0.004744254,0.003962788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009099103,0.0001196188,0.0013947746,0.0032933122,0.00006455764,0.000121134486,0.00029853766,0.011894502,0.000707123,0.7137271,0.051969886,0.21631841],"study_design_scores_gemma":[0.00002096648,0.00006157057,0.0010075718,0.001195465,0.000041201885,0.0006188709,0.00018677866,0.0148530565,0.00062273926,0.6331493,0.34818828,0.00005418515],"about_ca_topic_score_codex":0.003719982,"about_ca_topic_score_gemma":0.0025658244,"teacher_disagreement_score":0.012614017,"about_ca_system_score_codex":0.0040331655,"about_ca_system_score_gemma":0.002214914,"threshold_uncertainty_score":0.042198062},"labels":[],"label_agreement":null},{"id":"W3089292598","doi":"10.37236/10055","title":"Planar Lattice Subsets with Minimal Vertex Boundary","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Azrieli Foundation; Israel Science Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Discrete mathematics; Planar graph; Graph","score_opus":0.012933440177614941,"score_gpt":0.2646560003340228,"score_spread":0.25172256015640787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089292598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9312056,0.0001785831,0.050192516,0.00019473583,0.000012736039,0.000029897217,0.00047677325,0.00015082872,0.017558305],"genre_scores_gemma":[0.9759278,0.000076711236,0.021407213,0.000025954332,0.000013852108,0.00004360807,0.0005406823,0.000034483142,0.0019296637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969757,0.000038909675,0.000023072225,0.00008429156,0.000096889176,0.000059200123],"domain_scores_gemma":[0.9994863,0.00015969152,0.00013489943,0.00007920449,0.000060723967,0.00007906759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013351075,0.00021959172,0.0004184463,0.0008978383,0.0009080514,0.0014831737,0.00052536646,0.00030527439,0.0024414745],"category_scores_gemma":[0.0011627764,0.0002758253,0.000328919,0.0006172318,0.0011104721,0.0011440483,0.0009956895,0.0004481594,0.00026103196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005087872,0.00010229082,0.01017852,0.00018862201,0.00004324703,0.00053333485,0.0006675405,0.021782303,0.0523372,0.8734876,0.0019684858,0.038202174],"study_design_scores_gemma":[0.00013204168,0.00018037857,0.008496,0.000056871384,0.00007103251,0.0016229992,0.0013683789,0.082431704,0.04683747,0.843278,0.01545688,0.00006830485],"about_ca_topic_score_codex":0.00079915853,"about_ca_topic_score_gemma":0.0008190064,"teacher_disagreement_score":0.0024414745,"about_ca_system_score_codex":0.00053682283,"about_ca_system_score_gemma":0.00029871447,"threshold_uncertainty_score":0.008167505},"labels":[],"label_agreement":null},{"id":"W3092025494","doi":"10.1112/jlms.12781","title":"Sparse universal graphs for planarity","year":2023,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Planarity testing; Planar graph; Wheel graph; Vertex (graph theory); Hypercube graph; Discrete mathematics; Graph; Book embedding; Graph power; Line graph; Pathwidth","score_opus":0.03894361354742376,"score_gpt":0.30649944476187585,"score_spread":0.2675558312144521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092025494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47614786,0.0018973972,0.37072608,0.0047576674,0.00027857107,0.00016454433,0.00086453307,0.0012171617,0.14394616],"genre_scores_gemma":[0.96916384,0.00061880413,0.022907846,0.00046850787,0.00015556585,0.00007136874,0.0003468121,0.00009271809,0.006174542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995315,0.000093139104,0.000015913554,0.00013219104,0.00011890065,0.00010834558],"domain_scores_gemma":[0.99817383,0.0008157554,0.0002676813,0.00031462844,0.00020063666,0.00022747931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031650934,0.000444251,0.0005370621,0.0011639999,0.00095429784,0.0011434571,0.00068346295,0.00059386686,0.010026796],"category_scores_gemma":[0.0038843993,0.00033572776,0.00055917556,0.0009886067,0.0018659676,0.0025594728,0.0032215808,0.001699481,0.0005389985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000369389,0.000016494942,0.00040641963,0.00008039511,0.000009949284,0.00009968722,0.00018013926,0.006537869,0.0019450646,0.97271335,0.0028826848,0.015090999],"study_design_scores_gemma":[0.00001663575,0.000024683353,0.00041706325,0.000030006522,0.000018339002,0.00018519085,0.00013242454,0.0233287,0.0017123867,0.96365464,0.010468558,0.000011275413],"about_ca_topic_score_codex":0.0010871622,"about_ca_topic_score_gemma":0.001175317,"teacher_disagreement_score":0.010026796,"about_ca_system_score_codex":0.0009768277,"about_ca_system_score_gemma":0.00034048114,"threshold_uncertainty_score":0.03354293},"labels":[],"label_agreement":null},{"id":"W3093489371","doi":"10.1016/j.jctb.2020.10.001","title":"Dismantlability, connectedness, and mixing in relational structures","year":2021,"lang":"en","type":"article","venue":"Repositori digital de la UPF (Universitat Pompeu Fabra)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Social connectedness; Constraint satisfaction problem; Mixing (physics); Uniqueness; Mathematics; Partition (number theory); Theoretical computer science; Computer science; Discrete mathematics; Combinatorics; Probabilistic logic","score_opus":0.008532611873337289,"score_gpt":0.24120353527116375,"score_spread":0.23267092339782647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093489371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71619445,0.000566689,0.26233307,0.0015040106,0.00003638722,0.00008215892,0.00037806208,0.00044283117,0.018462364],"genre_scores_gemma":[0.96924275,0.0002572592,0.025113126,0.00008738541,0.000063518186,0.00008248023,0.0004356969,0.000118773336,0.0045989696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962603,0.0013276781,0.00031803764,0.0011738695,0.0005937359,0.00032641788],"domain_scores_gemma":[0.9675056,0.022725422,0.0033305753,0.0037042834,0.0012219502,0.0015122298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032191714,0.0006700506,0.0009883685,0.003976957,0.003307579,0.0062278965,0.0014434493,0.0019134498,0.008219017],"category_scores_gemma":[0.023279129,0.0009725856,0.0012449666,0.0033818653,0.006296009,0.014607357,0.00386958,0.0029930763,0.00054452586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003057441,0.00008458994,0.002698747,0.00008371502,0.0000360711,0.00020544196,0.0030011628,0.003486779,0.0030320368,0.96412224,0.00040017752,0.022543212],"study_design_scores_gemma":[0.000029530487,0.00006984399,0.0012296458,0.00003506839,0.000056557878,0.00019614944,0.0006438323,0.0170451,0.0027284345,0.9763217,0.0016143263,0.000029839315],"about_ca_topic_score_codex":0.0022050028,"about_ca_topic_score_gemma":0.001877412,"teacher_disagreement_score":0.008219017,"about_ca_system_score_codex":0.001804298,"about_ca_system_score_gemma":0.00067419565,"threshold_uncertainty_score":0.027495325},"labels":[],"label_agreement":null},{"id":"W3094347955","doi":"10.1002/jgt.22633","title":"Good orientations of unions of edge‐disjoint spanning trees","year":2020,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Centre National de la Recherche Scientifique; Danmarks Frie Forskningsfond; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Disjoint sets; Spanning tree; Enhanced Data Rates for GSM Evolution; Minimum degree spanning tree; Computer science","score_opus":0.03150365119484021,"score_gpt":0.30037943294383507,"score_spread":0.26887578174899485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094347955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90049344,0.00019994061,0.08126292,0.00014100135,0.000043726443,0.000047649606,0.00022529032,0.00021271533,0.01737332],"genre_scores_gemma":[0.9680958,0.000105356514,0.028431738,0.000065570115,0.000030297391,0.000030238882,0.00034647717,0.00006427405,0.0028302006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930036,0.00013965665,0.000049555874,0.00014667022,0.00018181928,0.00018198755],"domain_scores_gemma":[0.99802446,0.00063451414,0.0004894388,0.00025634473,0.0001954633,0.00039980427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037264056,0.00026787457,0.0004550031,0.0008255702,0.0009043403,0.0015059478,0.00043657882,0.0005595445,0.0047062566],"category_scores_gemma":[0.001967048,0.0006222074,0.00046220535,0.0007677997,0.0013092185,0.0015849121,0.0012713548,0.00069018616,0.00037280167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050670037,0.0001160533,0.0101615945,0.00016030605,0.000053347594,0.0010721952,0.0010301457,0.02714284,0.029620962,0.89669055,0.0025006877,0.030944709],"study_design_scores_gemma":[0.000107254804,0.00026262985,0.00919573,0.00007744881,0.00007498117,0.0016857617,0.0013767253,0.09078972,0.023493897,0.8540212,0.018850246,0.00006444749],"about_ca_topic_score_codex":0.00069520395,"about_ca_topic_score_gemma":0.0011905523,"teacher_disagreement_score":0.0047062566,"about_ca_system_score_codex":0.000698253,"about_ca_system_score_gemma":0.00028747175,"threshold_uncertainty_score":0.01574403},"labels":[],"label_agreement":null},{"id":"W3094398332","doi":"10.1007/978-3-030-51117-3_13","title":"Eternal and Secure Domination in Graphs","year":2020,"lang":"en","type":"book-chapter","venue":"Developments in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Dominating set; Sequence (biology); Computer science; Graph; Computer security; Combinatorics; Set (abstract data type); Mathematics; Theoretical computer science; Discrete mathematics; Vertex (graph theory); Programming language","score_opus":0.027297770491220338,"score_gpt":0.27646707256717135,"score_spread":0.249169302075951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094398332","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040590383,0.0060484568,0.17118277,0.004798427,0.0009972457,0.00006621437,0.0002607893,0.0003185093,0.7757372],"genre_scores_gemma":[0.61308974,0.0075439983,0.028413163,0.0012124435,0.0012332087,0.00016020396,0.00032081868,0.00029542382,0.347731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994211,0.00016075006,0.000022228794,0.00008952593,0.00022736033,0.000079036574],"domain_scores_gemma":[0.9988863,0.0006636382,0.000059112997,0.00023500963,0.00010372894,0.00005230418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006533991,0.00055142905,0.00041683353,0.00089821615,0.0013874975,0.0026518877,0.00085495313,0.00077214517,0.012655157],"category_scores_gemma":[0.0021292446,0.0003331339,0.00044063042,0.0015249816,0.0036290176,0.0065595745,0.0016642333,0.0033218816,0.0017922156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009160989,0.0000056583704,0.000019119378,0.000017516204,0.0000015529592,0.000008141597,0.000074695934,0.00049922586,0.00019277155,0.98927283,0.002127936,0.0077713584],"study_design_scores_gemma":[0.000004717063,0.000004439087,0.000041006424,0.000013586858,0.00000226469,0.000036846537,0.000029885885,0.0011953169,0.0002573703,0.97407407,0.024337113,0.0000035327553],"about_ca_topic_score_codex":0.0008351858,"about_ca_topic_score_gemma":0.0009925639,"teacher_disagreement_score":0.012655157,"about_ca_system_score_codex":0.0015863132,"about_ca_system_score_gemma":0.0005427734,"threshold_uncertainty_score":0.04233575},"labels":[],"label_agreement":null},{"id":"W3096569464","doi":"10.1002/jgt.22939","title":"Strong 3‐Flow Conjecture for projective planar graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Planar graph; Conjecture; Discrete mathematics; Graph","score_opus":0.028590567937119078,"score_gpt":0.31561184669941855,"score_spread":0.2870212787622995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096569464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5665841,0.001400042,0.3279877,0.009581617,0.00050483964,0.00018245218,0.0016690599,0.0011571498,0.09093314],"genre_scores_gemma":[0.9753947,0.00052313745,0.015239501,0.001005774,0.0002336017,0.00011577011,0.0008383737,0.000070432674,0.006578786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991272,0.00021019788,0.000037868373,0.00021062024,0.00019509511,0.00021905197],"domain_scores_gemma":[0.9967098,0.0017285771,0.0003325361,0.00033890986,0.0005373703,0.0003527521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013393448,0.0006515699,0.00048500992,0.0013395024,0.0015025809,0.0017820275,0.0009139381,0.001114933,0.010293401],"category_scores_gemma":[0.0054302285,0.00050312525,0.0011472999,0.0009879081,0.0027761857,0.0043691327,0.002673788,0.0019425757,0.00071885996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013472029,0.00004703373,0.0025938577,0.00013549415,0.0000308924,0.00025560276,0.00036938454,0.012499056,0.0033759265,0.9604294,0.007880132,0.012248584],"study_design_scores_gemma":[0.000046170837,0.000050870814,0.0014006617,0.00004864888,0.000026156773,0.00023310122,0.00024089709,0.02386796,0.0029201426,0.9590728,0.012062046,0.000030412204],"about_ca_topic_score_codex":0.00235743,"about_ca_topic_score_gemma":0.0015069233,"teacher_disagreement_score":0.010293401,"about_ca_system_score_codex":0.0012611035,"about_ca_system_score_gemma":0.00066509127,"threshold_uncertainty_score":0.034434855},"labels":[],"label_agreement":null},{"id":"W3098440765","doi":"10.1145/3690821","title":"Efficient polynomial-time approximation scheme for the genus of dense graphs","year":2024,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Genus; Scheme (mathematics); Mathematics; Polynomial-time approximation scheme; Polynomial; Time complexity; Computer science; Combinatorics; Biology; Zoology; Mathematical analysis","score_opus":0.023569144577436082,"score_gpt":0.29851744322742635,"score_spread":0.27494829864999026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098440765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20448841,0.0010448534,0.7670898,0.0018400849,0.00015368598,0.0003799878,0.0018772668,0.012730601,0.010395281],"genre_scores_gemma":[0.6037959,0.00038486344,0.38575625,0.00034959434,0.00009940678,0.00035525986,0.0034033305,0.00082769734,0.005027739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754626,0.00031763347,0.00014285589,0.0006664221,0.0007400104,0.0005868749],"domain_scores_gemma":[0.9948139,0.0018748358,0.0004196036,0.0022347937,0.00037802718,0.00027878856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015585611,0.0014883192,0.0015731765,0.0009949157,0.0013170865,0.0034600038,0.0040222737,0.0014620794,0.0057543125],"category_scores_gemma":[0.008584308,0.00063011615,0.0016875393,0.0019856328,0.0013356406,0.0063796253,0.0035011955,0.0030938867,0.0019551802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036343257,0.0006556169,0.008825307,0.0009734533,0.00022191959,0.00028327137,0.001315345,0.4539233,0.042924672,0.1553702,0.025084201,0.30678836],"study_design_scores_gemma":[0.00022915132,0.00013618846,0.0007629401,0.00004859053,0.000075644384,0.00014559785,0.0001517524,0.8860932,0.010038362,0.09721636,0.005062195,0.000040013685],"about_ca_topic_score_codex":0.005575371,"about_ca_topic_score_gemma":0.008349487,"teacher_disagreement_score":0.0057543125,"about_ca_system_score_codex":0.005128573,"about_ca_system_score_gemma":0.003566013,"threshold_uncertainty_score":0.037210584},"labels":[],"label_agreement":null},{"id":"W3099168587","doi":"10.1145/3519935.3520063","title":"On the complexity of CSP-based ideal membership problems","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ideal (ethics); Variety (cybernetics); Mathematics; Polynomial; Computer science; Task (project management); Combinatorial algorithms; Algebra over a field; Discrete mathematics; Algorithm; Pure mathematics; Artificial intelligence","score_opus":0.16474698805970076,"score_gpt":0.34221846811909284,"score_spread":0.1774714800593921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099168587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19023798,0.005177089,0.7130879,0.028583122,0.00060084363,0.00090876734,0.004909038,0.0022456776,0.054249585],"genre_scores_gemma":[0.7447367,0.0033619807,0.22942401,0.0020152407,0.0013622926,0.00087879586,0.0055938107,0.0008022814,0.011824809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9855177,0.005603076,0.0009068935,0.0023070034,0.0041678967,0.0014974708],"domain_scores_gemma":[0.9044681,0.0844299,0.002979594,0.0041693486,0.002453654,0.001499323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076689543,0.0014309488,0.0028063997,0.00185266,0.003102977,0.008833696,0.004290615,0.0034310252,0.016565554],"category_scores_gemma":[0.05027404,0.001187068,0.0028240182,0.004249594,0.0046721953,0.019777568,0.0069805738,0.00870166,0.0014986278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007806514,0.0004743484,0.0031542203,0.001437131,0.0002493116,0.0005454432,0.0010604123,0.2031797,0.0016745885,0.6954587,0.01816759,0.073817894],"study_design_scores_gemma":[0.00008358355,0.000029841936,0.00028074707,0.000054675613,0.000040957013,0.00017109292,0.00020975743,0.20603392,0.00054834964,0.789639,0.0028810075,0.000027095237],"about_ca_topic_score_codex":0.0042314287,"about_ca_topic_score_gemma":0.0039010749,"teacher_disagreement_score":0.016565554,"about_ca_system_score_codex":0.0051191757,"about_ca_system_score_gemma":0.0045008273,"threshold_uncertainty_score":0.0554173},"labels":[],"label_agreement":null},{"id":"W3100051117","doi":"","title":"Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)","year":2022,"lang":"en","type":"preprint","venue":"tub.dok (Hamburg University of Technology)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Mathematics; Constraint satisfaction problem; Bounded function; Combinatorics; Complexity of constraint satisfaction; Discrete mathematics; Algebraic number; Local consistency","score_opus":0.016055232548989027,"score_gpt":0.2580699319846549,"score_spread":0.24201469943566586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100051117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53865606,0.0020427788,0.3451313,0.032778814,0.00038131388,0.00009328297,0.0011669522,0.00052805076,0.07922154],"genre_scores_gemma":[0.9719909,0.00047044532,0.020701263,0.0009536212,0.00029905833,0.00007491933,0.00064014737,0.00008278021,0.004786786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997291,0.0007827441,0.00011751137,0.0009250375,0.00054056366,0.00034315092],"domain_scores_gemma":[0.98539436,0.011421664,0.0007335657,0.0013258765,0.0005343848,0.00059012225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022122166,0.00033404763,0.0007912529,0.0007566967,0.0019829008,0.004981719,0.0014070664,0.002068157,0.006044562],"category_scores_gemma":[0.0128563745,0.00043772292,0.0012825876,0.0013952665,0.0058910185,0.013768928,0.0030574854,0.0063325837,0.00069342635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089191155,0.00007264957,0.0015347665,0.000111294445,0.000017287244,0.00016019538,0.00041604118,0.0055440636,0.0011579255,0.9804529,0.0021439781,0.008299615],"study_design_scores_gemma":[0.000016793118,0.000016644712,0.00046096335,0.000019006027,0.000008605779,0.00011193454,0.00017375343,0.009312911,0.0006905077,0.9868031,0.0023755692,0.000010168364],"about_ca_topic_score_codex":0.0010462352,"about_ca_topic_score_gemma":0.00086822006,"teacher_disagreement_score":0.006044562,"about_ca_system_score_codex":0.0020664148,"about_ca_system_score_gemma":0.0010862128,"threshold_uncertainty_score":0.020221114},"labels":[],"label_agreement":null},{"id":"W3100883497","doi":"","title":"CATERPILLAR DUALITIES AND REGULAR LANGUAGES","year":2013,"lang":"en","type":"article","venue":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Dual polyhedron; Mathematics; Combinatorics; Dual (grammatical number); Discrete mathematics; Datalog; Constraint (computer-aided design); Caterpillar; Programming language; Computer science; Linguistics","score_opus":0.014476143709301883,"score_gpt":0.24940266103330855,"score_spread":0.23492651732400666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100883497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6525938,0.00047039156,0.3155037,0.0010591131,0.00010833584,0.00011859201,0.0006654716,0.00071698177,0.028763724],"genre_scores_gemma":[0.94968206,0.00011478424,0.043506525,0.00022796201,0.000045838726,0.00008763626,0.0004094388,0.00013393759,0.005791791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754626,0.00039132457,0.00017644017,0.00074374676,0.0006130761,0.0005289913],"domain_scores_gemma":[0.996357,0.0016863657,0.0004502588,0.00044803508,0.00055647525,0.0005018459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264154,0.00039527644,0.00069437496,0.0013564909,0.001723956,0.003141496,0.0012683651,0.00093852234,0.0049389433],"category_scores_gemma":[0.004281324,0.0007885924,0.0014434445,0.0009868029,0.0036020281,0.004823574,0.003360361,0.0028243528,0.0005919698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004527747,0.00016222226,0.003728377,0.00021208294,0.00004633919,0.0007983858,0.0010199641,0.006100317,0.012928104,0.9583053,0.0014276832,0.014818384],"study_design_scores_gemma":[0.000078190424,0.00012292613,0.0014946,0.00009084965,0.00007061545,0.0013962374,0.0007839217,0.035750434,0.014050446,0.93464154,0.011446477,0.00007372892],"about_ca_topic_score_codex":0.00092220475,"about_ca_topic_score_gemma":0.00085491483,"teacher_disagreement_score":0.0049389433,"about_ca_system_score_codex":0.0015008843,"about_ca_system_score_gemma":0.0007041684,"threshold_uncertainty_score":0.016522348},"labels":[],"label_agreement":null},{"id":"W3101417881","doi":"10.1007/978-3-030-38919-2_10","title":"Burning Two Worlds","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.02539464190771653,"score_gpt":0.29514440310651924,"score_spread":0.26974976119880273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101417881","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031361475,0.0022593024,0.0120844245,0.009763678,0.0017970658,0.00002158909,0.000077486,0.00012015606,0.97074014],"genre_scores_gemma":[0.18324566,0.0031560534,0.009303568,0.0059519387,0.00089838344,0.00015449236,0.00025524714,0.0006435771,0.79639107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903154,0.00032262263,0.000020939697,0.00020211072,0.00023524875,0.00018758044],"domain_scores_gemma":[0.9991517,0.00025597875,0.00003541224,0.0002676177,0.00010553908,0.00018382694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011242727,0.00078244123,0.00069422374,0.0012379144,0.0059170625,0.0067353523,0.0014544035,0.0028722985,0.09839005],"category_scores_gemma":[0.0037841592,0.00049350265,0.00062828534,0.0009196597,0.011326167,0.014436918,0.007214561,0.007172408,0.019531129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012655819,0.0000069869275,0.000018679346,0.000015949294,0.0000021344028,0.00002027324,0.00058134354,0.000050038074,0.000062992855,0.9722234,0.018627295,0.008378283],"study_design_scores_gemma":[0.000006177429,0.000007483391,0.000027709037,0.00008146453,0.0000030576468,0.00006391859,0.000882839,0.00015498327,0.000110666195,0.7448196,0.25383574,0.000006397619],"about_ca_topic_score_codex":0.0011561298,"about_ca_topic_score_gemma":0.0021114051,"teacher_disagreement_score":0.09839005,"about_ca_system_score_codex":0.0020126107,"about_ca_system_score_gemma":0.001238763,"threshold_uncertainty_score":0.32914746},"labels":[],"label_agreement":null},{"id":"W3102629258","doi":"","title":"On the stretch factor of randomly embedded random graphs","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Upper and lower bounds; Cardinality (data modeling); Random regular graph; Graph; Euclidean geometry; Random graph; Unit square; Discrete mathematics; Euclidean distance; Chordal graph; 1-planar graph; Geometry; Computer science; Mathematical analysis","score_opus":0.023443965262916793,"score_gpt":0.283113615424143,"score_spread":0.2596696501612262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102629258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55735934,0.00549363,0.41225666,0.004245391,0.00026201707,0.00014083173,0.0006460897,0.0009906053,0.01860542],"genre_scores_gemma":[0.967993,0.0022525908,0.02538292,0.00044548095,0.00030105174,0.00014953726,0.00027311707,0.0003727355,0.0028295412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978084,0.00094713963,0.00008017874,0.0004482203,0.00041889277,0.00029719077],"domain_scores_gemma":[0.9372348,0.049095526,0.004214762,0.00562392,0.0017586068,0.0020723862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052867224,0.0013438379,0.0016891018,0.0027881411,0.001298016,0.0017790105,0.0023198305,0.001977967,0.0036267822],"category_scores_gemma":[0.06353734,0.0008884036,0.0007738778,0.0015508633,0.004803156,0.0088377595,0.0028809467,0.00249654,0.0006411142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019765305,0.00018145247,0.00860826,0.0005995478,0.00019793306,0.000858851,0.00096403854,0.36415285,0.017771844,0.5549162,0.0070645036,0.042707924],"study_design_scores_gemma":[0.0001264779,0.00024594445,0.002741624,0.00013273796,0.000069001464,0.00055838685,0.00016919836,0.57694256,0.0038020907,0.41221783,0.0028924174,0.00010177314],"about_ca_topic_score_codex":0.0021875363,"about_ca_topic_score_gemma":0.0011030781,"teacher_disagreement_score":0.0052867224,"about_ca_system_score_codex":0.0023277767,"about_ca_system_score_gemma":0.0005806034,"threshold_uncertainty_score":0.027959228},"labels":[],"label_agreement":null},{"id":"W3105851171","doi":"","title":"5-List-Coloring Planar Graphs with Distant Precolored Vertices","year":2017,"lang":"en","type":"article","venue":"Iowa State University Digital Repository (Iowa State University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Planar graph; Graph; List coloring; Colored; Discrete mathematics; Graph power; Line graph","score_opus":0.012278873435854458,"score_gpt":0.20413255774611988,"score_spread":0.19185368431026542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105851171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84206986,0.00068822963,0.13144062,0.0023934224,0.000121488374,0.00011065863,0.0011110356,0.0012747819,0.020789975],"genre_scores_gemma":[0.9390083,0.00044368824,0.05379332,0.0005409424,0.0000673015,0.00009108108,0.0012423043,0.00022867905,0.004584452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994086,0.00010613363,0.000021814632,0.00015836669,0.00009479967,0.00021028092],"domain_scores_gemma":[0.994138,0.002948359,0.0010273805,0.0009726741,0.00041984252,0.0004937188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005440009,0.00070028123,0.0005566963,0.000627915,0.0013209525,0.0015181965,0.0017148514,0.0007418798,0.007475276],"category_scores_gemma":[0.0036551235,0.0005756604,0.0007972232,0.00080682215,0.0014365633,0.003596086,0.0017990068,0.0013755431,0.0007557653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039195972,0.0004894791,0.028048053,0.0016504474,0.00033952357,0.0014187376,0.0016514645,0.2584328,0.13491787,0.42384273,0.026375923,0.11891332],"study_design_scores_gemma":[0.000485459,0.0008231587,0.008529416,0.0001867172,0.00043396698,0.0016917437,0.0015413517,0.27283627,0.10897506,0.56900537,0.03532484,0.00016658315],"about_ca_topic_score_codex":0.0024377077,"about_ca_topic_score_gemma":0.004690632,"teacher_disagreement_score":0.007475276,"about_ca_system_score_codex":0.0015483549,"about_ca_system_score_gemma":0.00089149614,"threshold_uncertainty_score":0.025007308},"labels":[],"label_agreement":null},{"id":"W3107865975","doi":"10.1002/jgt.22904","title":"A density bound for triangle‐free 4‐critical graphs","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Klein bottle; Mathematics; Combinatorics; Planar graph; Vertex (graph theory); Disjoint sets; Torus; Chordal graph; Projective plane; Discrete mathematics; Graph","score_opus":0.027147221033866072,"score_gpt":0.31440465452162353,"score_spread":0.28725743348775745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107865975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65580624,0.0019273735,0.23456106,0.0028517714,0.00020030898,0.00016405858,0.0007234964,0.0006722727,0.10309347],"genre_scores_gemma":[0.9836137,0.000462253,0.011223663,0.00033818942,0.0000821843,0.00007263884,0.00030497598,0.000108926775,0.003793416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923337,0.00010906059,0.000017922746,0.00012858484,0.00029671824,0.00021444882],"domain_scores_gemma":[0.9928296,0.004702832,0.00041820714,0.00046310847,0.00074396766,0.00084226637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006892367,0.0006587747,0.0006553106,0.0019055116,0.0014329391,0.0014623104,0.0017332623,0.0011608668,0.013327405],"category_scores_gemma":[0.007997443,0.0006146403,0.0005266159,0.0009827282,0.0020504654,0.0029624188,0.0024191698,0.0016376948,0.00091933116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032201596,0.00012715407,0.0066856765,0.0003637684,0.00005910129,0.00069571135,0.00097273657,0.03411756,0.020081317,0.9054093,0.010468045,0.020697625],"study_design_scores_gemma":[0.000058662445,0.00011871043,0.003662234,0.00013399696,0.00006265618,0.0010065436,0.0005275559,0.2071103,0.012216094,0.76145,0.013596863,0.000056384844],"about_ca_topic_score_codex":0.0027892457,"about_ca_topic_score_gemma":0.0021742159,"teacher_disagreement_score":0.013327405,"about_ca_system_score_codex":0.0015902157,"about_ca_system_score_gemma":0.00049645576,"threshold_uncertainty_score":0.044584572},"labels":[],"label_agreement":null},{"id":"W3108105039","doi":"10.37236/10585","title":"Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids","year":2022,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Probabilistic logic; Zero (linguistics); Forcing (mathematics); Combinatorics; Mathematics; Graph; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.016887275113576482,"score_gpt":0.2793944889790109,"score_spread":0.26250721386543446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108105039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12351933,0.0025972226,0.8243055,0.0035345375,0.00034884334,0.00017905426,0.0010607112,0.001675237,0.04277959],"genre_scores_gemma":[0.8676353,0.00220034,0.1096096,0.0010261311,0.00046105753,0.00062038284,0.001068139,0.0013610898,0.01601792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996236,0.0010804405,0.0001567888,0.00070024794,0.00089536817,0.0009311936],"domain_scores_gemma":[0.9172254,0.06853869,0.0035308942,0.0056171566,0.0024438761,0.0026439726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059769778,0.0019988678,0.0024407138,0.002092477,0.0026442572,0.0045082066,0.0044414965,0.0022166902,0.012884933],"category_scores_gemma":[0.05342409,0.0015750419,0.0019048223,0.0021101718,0.0055823494,0.0108543085,0.0066523496,0.005455294,0.0015695789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043005068,0.000083478684,0.0011560818,0.00033164243,0.000075772194,0.00019742404,0.00039003495,0.24453302,0.003508288,0.7316125,0.0067844717,0.010897214],"study_design_scores_gemma":[0.000046767676,0.000055065393,0.0002696166,0.000072590796,0.000035514633,0.0000954128,0.000078741046,0.34547976,0.0012855704,0.65007955,0.0024621321,0.000039225506],"about_ca_topic_score_codex":0.0036992517,"about_ca_topic_score_gemma":0.0038137457,"teacher_disagreement_score":0.012884933,"about_ca_system_score_codex":0.004197374,"about_ca_system_score_gemma":0.0025093153,"threshold_uncertainty_score":0.04310441},"labels":[],"label_agreement":null},{"id":"W3108309801","doi":"","title":"Stability for UMAP","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Metric space; Metric (unit); Iterated function; Mathematics; Neighbourhood (mathematics); Combinatorics; Path (computing); Set (abstract data type); Stability (learning theory); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.19324992373138244,"score_gpt":0.24024718119055,"score_spread":0.04699725745916755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108309801","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51062685,0.0011201325,0.38095036,0.0010446879,0.00023449818,0.000099558936,0.00020244707,0.00058145256,0.105140045],"genre_scores_gemma":[0.9617291,0.00021406288,0.020169122,0.00014283099,0.000092482565,0.00008695368,0.00015586658,0.00013338232,0.017276142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928975,0.000107585234,0.00003073187,0.00024142103,0.00022719172,0.000103258084],"domain_scores_gemma":[0.9992022,0.00020499008,0.00009499446,0.00017419264,0.00019806251,0.00012544711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060050975,0.00030235358,0.00032453422,0.0011192311,0.002043041,0.0015625665,0.0005847274,0.0007115263,0.0066482383],"category_scores_gemma":[0.002413905,0.00026853124,0.00063349085,0.00040585166,0.002076065,0.0026455955,0.0034963475,0.0013935653,0.00082934456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016690621,0.0000057483767,0.00054967863,0.000033791177,0.000006449417,0.000102305065,0.00045631078,0.0011789708,0.0039073643,0.98645335,0.0003823532,0.0069069755],"study_design_scores_gemma":[0.0000078264065,0.000060182887,0.0009985355,0.000026748256,0.000011692437,0.0004538106,0.0004634188,0.020089515,0.0067895143,0.9548494,0.016227685,0.00002168285],"about_ca_topic_score_codex":0.0007937174,"about_ca_topic_score_gemma":0.0004473822,"teacher_disagreement_score":0.0066482383,"about_ca_system_score_codex":0.0010344657,"about_ca_system_score_gemma":0.0003586077,"threshold_uncertainty_score":0.02224058},"labels":[],"label_agreement":null},{"id":"W3109000230","doi":"10.1007/s10114-020-9488-9","title":"An Improved Upper Bound on the Linear 2-arboricity of 1-planar Graphs","year":2020,"lang":"en","type":"article","venue":"Acta Mathematica Sinica English Series","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Arboricity; Combinatorics; Planar graph; Mathematics; Graph; Disjoint sets; Planar; Upper and lower bounds; Computer science; Mathematical analysis","score_opus":0.02933394371888223,"score_gpt":0.28286217039348727,"score_spread":0.25352822667460506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109000230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21754807,0.015967334,0.4363042,0.013011327,0.0019292353,0.0004083708,0.008226718,0.0051166,0.30148822],"genre_scores_gemma":[0.7808295,0.011464726,0.14175981,0.0041764504,0.0036948654,0.0009190421,0.0074533843,0.0022854765,0.04741681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967535,0.00062095234,0.00012242935,0.00068310887,0.0010443778,0.00077564287],"domain_scores_gemma":[0.98054105,0.015051199,0.0005475123,0.0017762153,0.0009966007,0.001087418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025401614,0.0035712726,0.002919913,0.0054394426,0.0020890734,0.005865091,0.0068676765,0.002995861,0.030164398],"category_scores_gemma":[0.015396539,0.001824078,0.002893297,0.0060577574,0.0033477638,0.0122854365,0.00722282,0.010201117,0.0068906136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022595976,0.00097169855,0.006057271,0.003234066,0.00044505126,0.0013559079,0.0014565786,0.12183836,0.04224174,0.6155327,0.069036156,0.13557084],"study_design_scores_gemma":[0.00017335734,0.00031873374,0.0035743415,0.00033359823,0.0004191303,0.0007348225,0.00025406084,0.22095361,0.011621015,0.7332269,0.028213507,0.00017681056],"about_ca_topic_score_codex":0.002332649,"about_ca_topic_score_gemma":0.0038048956,"teacher_disagreement_score":0.030164398,"about_ca_system_score_codex":0.0034855637,"about_ca_system_score_gemma":0.0013001745,"threshold_uncertainty_score":0.10090995},"labels":[],"label_agreement":null},{"id":"W3111722804","doi":"10.1017/s0963548322000165","title":"Clustered colouring of graph classes with bounded treedepth or pathwidth","year":2022,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Bounded function; Friendship graph; Graph; Discrete mathematics; Class (philosophy); Upper and lower bounds; Pathwidth; Integer (computer science); Graph power; Computer science; Line graph","score_opus":0.03701321584223581,"score_gpt":0.2773013662615847,"score_spread":0.24028815041934887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111722804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8698038,0.00027222285,0.11811701,0.0003166749,0.000032682492,0.00007175623,0.0005820687,0.00034212324,0.010461631],"genre_scores_gemma":[0.9665346,0.00010306677,0.029756341,0.00007982122,0.00003485312,0.000049288457,0.00045328905,0.00012456792,0.0028642684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994393,0.000056084416,0.0000213801,0.00021585496,0.00012017232,0.00014720576],"domain_scores_gemma":[0.99680066,0.0013597304,0.00041014218,0.00058706413,0.00035083026,0.0004915069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046478197,0.00040379938,0.00051677943,0.0010813896,0.0012262716,0.0018487277,0.0015355451,0.00062462746,0.005024367],"category_scores_gemma":[0.0027935423,0.00035997457,0.00068590435,0.0009295842,0.0013673037,0.0025741889,0.0013423957,0.001022884,0.00026954492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017398616,0.00031151608,0.013842456,0.00044783897,0.00012851325,0.00030662067,0.0012268266,0.10352365,0.14278091,0.6609659,0.0070452173,0.0676807],"study_design_scores_gemma":[0.00016431669,0.00032734475,0.011983077,0.00008474414,0.00010355222,0.00073438796,0.00050001213,0.35508817,0.04553106,0.570422,0.014975675,0.0000856843],"about_ca_topic_score_codex":0.0033475712,"about_ca_topic_score_gemma":0.004354188,"teacher_disagreement_score":0.005024367,"about_ca_system_score_codex":0.002367073,"about_ca_system_score_gemma":0.00057406595,"threshold_uncertainty_score":0.017174423},"labels":[],"label_agreement":null},{"id":"W3114660220","doi":"10.4230/lipics.icalp.2016.27","title":"The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems","year":2016,"lang":"en","type":"article","venue":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Hungarian Scientific Research Fund; Grantová Agentura České Republiky","keywords":"Steiner tree problem; Combinatorics; Parameterized complexity; Mathematics; Bounded function; Discrete mathematics; Path (computing); Directed graph; Computer science","score_opus":0.0437889203206143,"score_gpt":0.29414249494610195,"score_spread":0.25035357462548763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114660220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48593017,0.008869118,0.38374716,0.029417586,0.00037275287,0.00067903806,0.017024394,0.0028612406,0.07109844],"genre_scores_gemma":[0.87697655,0.0047264234,0.091230586,0.0023985745,0.0005541359,0.0010236963,0.010189514,0.00094226305,0.01195825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957539,0.0012580791,0.000188622,0.0011951621,0.0008344232,0.00076990103],"domain_scores_gemma":[0.97914326,0.016100653,0.0012716941,0.0018534228,0.00078216597,0.0008488671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028246737,0.0020956914,0.0030210442,0.0015315149,0.001851922,0.0068191895,0.004538604,0.003933516,0.010431246],"category_scores_gemma":[0.024549518,0.0012036918,0.0021741302,0.0033638137,0.0024218168,0.011508345,0.0029849794,0.005071792,0.001300805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009868369,0.0005307956,0.005408418,0.0014968103,0.0003385552,0.0006614183,0.000706231,0.56989884,0.0042626658,0.29169706,0.054812536,0.06919991],"study_design_scores_gemma":[0.00019325278,0.00007666525,0.001091809,0.00010523934,0.00008136649,0.00038604983,0.00024318747,0.5606726,0.000987153,0.42776313,0.008352056,0.000047396697],"about_ca_topic_score_codex":0.0049397685,"about_ca_topic_score_gemma":0.0039688773,"teacher_disagreement_score":0.010431246,"about_ca_system_score_codex":0.005982587,"about_ca_system_score_gemma":0.0025854069,"threshold_uncertainty_score":0.043406963},"labels":[],"label_agreement":null},{"id":"W3114956369","doi":"10.55016/ojs/cdm.v16i3.72075","title":"On the real roots of domination polynomials","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Dominating set; Closure (psychology); Cardinality (data modeling); Graph; Domination analysis; Order (exchange); Discrete mathematics","score_opus":0.019161338421442364,"score_gpt":0.3299928174266208,"score_spread":0.31083147900517843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114956369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6140949,0.005127188,0.29038864,0.0035734964,0.00037763355,0.00006973779,0.00069761404,0.00026762168,0.08540315],"genre_scores_gemma":[0.9722725,0.0019368472,0.0154537875,0.00021257147,0.0006066604,0.000052799456,0.000286017,0.000087699875,0.0090911845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998725,0.00025338525,0.000043467997,0.00033818663,0.00032719082,0.00031279773],"domain_scores_gemma":[0.9918508,0.0056960885,0.0008361301,0.00038425613,0.00063294603,0.0005997258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015351701,0.00070326874,0.0010354937,0.002343489,0.0011518202,0.0026489154,0.0008594139,0.00051494926,0.0033568174],"category_scores_gemma":[0.010920627,0.00033842164,0.0006616338,0.0016388694,0.0051377146,0.005245926,0.0028264204,0.00377699,0.0006404714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012878046,0.000038189755,0.0006158391,0.00008897151,0.000011226514,0.00017847522,0.0005226087,0.004318273,0.0020286131,0.9772915,0.0011583021,0.013619192],"study_design_scores_gemma":[0.000036644225,0.000044752738,0.0005429577,0.00003156526,0.000009741529,0.0002496057,0.000184204,0.01921771,0.0008055635,0.97426695,0.004582348,0.00002804521],"about_ca_topic_score_codex":0.0017652829,"about_ca_topic_score_gemma":0.0008809209,"teacher_disagreement_score":0.0033568174,"about_ca_system_score_codex":0.0016625719,"about_ca_system_score_gemma":0.0007256178,"threshold_uncertainty_score":0.012062848},"labels":[],"label_agreement":null},{"id":"W3115154750","doi":"10.48550/arxiv.1907.12119","title":"A Fast Minimum Degree Algorithm and Matching Lower Bound","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Heuristics; Time complexity; Combinatorics; Algorithm; Mathematics; Running time; Binary logarithm; Reduction (mathematics); Graph; Simple (philosophy); Upper and lower bounds; Combinatorial algorithms; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.047551259976895,"score_gpt":0.20329682537760113,"score_spread":0.15574556540070614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115154750","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019712413,0.00087213743,0.9466928,0.0020480205,0.0002174041,0.00022812083,0.00058476004,0.0026597066,0.026984587],"genre_scores_gemma":[0.24212618,0.0010317425,0.7310718,0.0013695306,0.00040531633,0.00046736072,0.0018992565,0.0012893437,0.02033947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946209,0.00090252806,0.0002387091,0.0015330492,0.0017457762,0.00095900364],"domain_scores_gemma":[0.9929703,0.0037124811,0.00044208436,0.0017118488,0.000811877,0.0003513844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021370691,0.001779063,0.0015257202,0.0020652371,0.0019018431,0.0038508482,0.0037407922,0.002478354,0.016383188],"category_scores_gemma":[0.015464511,0.0009467013,0.0020811944,0.0032996645,0.0016316529,0.009154558,0.0044839443,0.003942035,0.006087075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007193767,0.0005696228,0.001840537,0.00067269325,0.00012616253,0.0002266635,0.00029142722,0.19873746,0.015027569,0.43394238,0.03782961,0.31001645],"study_design_scores_gemma":[0.00013817624,0.00017781377,0.00042822337,0.000077597935,0.000060459963,0.00030792895,0.00006823176,0.601866,0.007459465,0.3706207,0.018737365,0.000057902296],"about_ca_topic_score_codex":0.003047363,"about_ca_topic_score_gemma":0.0044237846,"teacher_disagreement_score":0.016383188,"about_ca_system_score_codex":0.003146401,"about_ca_system_score_gemma":0.0035146968,"threshold_uncertainty_score":0.054807246},"labels":[],"label_agreement":null},{"id":"W3115176827","doi":"10.4230/lipics.isaac.2020.31","title":"Flexible List Colorings in Graphs with Special Degeneracy Conditions","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Combinatorics; Degeneracy (biology); Treewidth; Mathematics; List coloring; Graph; Degree (music); Discrete mathematics; Pathwidth; Physics; Line graph; Graph power","score_opus":0.03325270291963795,"score_gpt":0.3085065180223265,"score_spread":0.27525381510268854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115176827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77248174,0.00081014726,0.20107652,0.0017282178,0.00008437839,0.00011593093,0.0014951922,0.0009462598,0.021261608],"genre_scores_gemma":[0.954546,0.00033861233,0.040292434,0.00042872035,0.0000879165,0.00011319285,0.0011151707,0.00020750571,0.002870335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734664,0.00056243717,0.00024908027,0.0008648787,0.0005130901,0.00046384212],"domain_scores_gemma":[0.9874068,0.00643347,0.0016720014,0.0027780135,0.0005149869,0.0011947535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001515002,0.00061486126,0.00091060903,0.001206175,0.0015974628,0.0024873212,0.0014742104,0.0012885365,0.004195607],"category_scores_gemma":[0.011621645,0.0008575243,0.0011774006,0.0016259452,0.0031124847,0.005576249,0.0030481594,0.003305833,0.00051712873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001017054,0.00020571945,0.011552462,0.0004574648,0.000083060164,0.0014911601,0.0021361655,0.07876761,0.022861646,0.83419156,0.004325434,0.04291056],"study_design_scores_gemma":[0.000076847784,0.00007404256,0.0019529042,0.000054185988,0.000032962078,0.00077197433,0.0003475578,0.067038484,0.0041579055,0.9217279,0.0037141908,0.00005103237],"about_ca_topic_score_codex":0.0011456797,"about_ca_topic_score_gemma":0.0012407753,"teacher_disagreement_score":0.004195607,"about_ca_system_score_codex":0.0017918871,"about_ca_system_score_gemma":0.0007214325,"threshold_uncertainty_score":0.014035702},"labels":[],"label_agreement":null},{"id":"W3115384833","doi":"10.55016/ojs/cdm.v15i1.62630","title":"Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Upper and lower bounds; Domination analysis; Type (biology); Discrete mathematics","score_opus":0.0494903473845529,"score_gpt":0.33917181318300416,"score_spread":0.2896814657984513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115384833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27354178,0.011090509,0.6283466,0.003125662,0.000554309,0.0002160585,0.0013297119,0.00028536617,0.08150991],"genre_scores_gemma":[0.880851,0.004089982,0.10110839,0.0006943165,0.00075231335,0.0004565958,0.0005575203,0.000121010424,0.011368843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716777,0.0008878187,0.00017782707,0.00054284313,0.00078770623,0.00043598167],"domain_scores_gemma":[0.97574234,0.01944464,0.001719403,0.0010356281,0.0009553232,0.001102678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004727604,0.0018128209,0.002115636,0.0061014644,0.0019589113,0.0035293,0.004398198,0.0023647938,0.006671165],"category_scores_gemma":[0.02576993,0.0014417671,0.001998537,0.005169187,0.0040859696,0.009984376,0.003644447,0.004689991,0.00072916516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019752543,0.00008682094,0.0028004905,0.00036035076,0.000105688436,0.00025940445,0.00050100946,0.068288825,0.0027575684,0.8990576,0.003913446,0.021671306],"study_design_scores_gemma":[0.000026381473,0.00007957851,0.0019558903,0.00013188548,0.00005562054,0.00032771914,0.00018959767,0.18839365,0.0017016972,0.80274904,0.004314706,0.000074171854],"about_ca_topic_score_codex":0.0019477895,"about_ca_topic_score_gemma":0.0027338397,"teacher_disagreement_score":0.006671165,"about_ca_system_score_codex":0.0029761586,"about_ca_system_score_gemma":0.00080938905,"threshold_uncertainty_score":0.025002241},"labels":[],"label_agreement":null},{"id":"W3117062007","doi":"10.1145/3474057","title":"Algorithms for Weighted Independent Transversals and Strong Colouring","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Chromatic scale; Mathematical proof; Partition (number theory); Mathematics; Graph partition; Combinatorics; Discrete mathematics; Graph; Computer science; Algorithm","score_opus":0.04069205520459028,"score_gpt":0.31724421791541285,"score_spread":0.27655216271082256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117062007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041066088,0.00019245718,0.9505687,0.00054263946,0.000068546455,0.00020396347,0.0003104939,0.0022214146,0.0048257327],"genre_scores_gemma":[0.26634374,0.00026650538,0.723846,0.00023887631,0.00007642041,0.0003775773,0.0012584628,0.0007544654,0.0068379454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715304,0.00064687675,0.00020538602,0.0010359098,0.00045719318,0.0005015169],"domain_scores_gemma":[0.99141324,0.003968234,0.0005134096,0.0030929495,0.0006100005,0.00040229212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027712185,0.0015561441,0.0011809422,0.001632565,0.0014810227,0.0029007543,0.0043297173,0.0020703136,0.009493538],"category_scores_gemma":[0.011830271,0.0011015875,0.0023125438,0.002590033,0.0028163802,0.00843234,0.0061231786,0.003146974,0.0016823083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075536064,0.00036176987,0.0027192244,0.00057846785,0.00018778222,0.0001696521,0.0009308354,0.19735105,0.014294471,0.5269229,0.01101057,0.2447179],"study_design_scores_gemma":[0.00016107141,0.000073887684,0.00029898586,0.00003452079,0.000066498054,0.00011145371,0.00013601616,0.49172223,0.0054594357,0.49653092,0.0053643514,0.000040641],"about_ca_topic_score_codex":0.0041838884,"about_ca_topic_score_gemma":0.008460779,"teacher_disagreement_score":0.009493538,"about_ca_system_score_codex":0.0032102999,"about_ca_system_score_gemma":0.0026850393,"threshold_uncertainty_score":0.031759024},"labels":[],"label_agreement":null},{"id":"W3117130829","doi":"10.1007/s00373-022-02487-x","title":"On the Unimodality of Domination Polynomials","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unimodality; Mathematics; Combinatorics; Multipartite; Domination analysis; Graph; Polynomial; Cardinality (data modeling); Discrete mathematics; Vertex (graph theory)","score_opus":0.017295990982832958,"score_gpt":0.2514579524417743,"score_spread":0.23416196145894136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117130829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5856719,0.004204774,0.2330974,0.008174653,0.0003441641,0.00005353815,0.00074608764,0.0003287719,0.1673787],"genre_scores_gemma":[0.9725945,0.0017630775,0.010164565,0.00059970794,0.0006672047,0.000042911295,0.0002640477,0.00011626417,0.013787627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998665,0.00041511428,0.000045149372,0.0002891083,0.00029605944,0.0002895716],"domain_scores_gemma":[0.9809498,0.015232788,0.0009328388,0.00082735706,0.0011097048,0.0009474349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002223957,0.00060092774,0.0011156533,0.0030913462,0.0019489374,0.00361478,0.0016349287,0.0010462666,0.009929216],"category_scores_gemma":[0.015552334,0.0006904642,0.00066678366,0.003431888,0.0053202915,0.007426035,0.0026879343,0.0048392606,0.0008157778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070672424,0.0000399503,0.0005942207,0.000060352442,0.000009831026,0.000061077546,0.00035101964,0.002275016,0.0007969738,0.98232263,0.0018075698,0.011610673],"study_design_scores_gemma":[0.00000780817,0.000007213186,0.00027405075,0.000011921125,0.0000057293732,0.000054752207,0.000064868116,0.0057666544,0.00019492485,0.99270624,0.00089629524,0.000009582732],"about_ca_topic_score_codex":0.002452854,"about_ca_topic_score_gemma":0.0021915731,"teacher_disagreement_score":0.009929216,"about_ca_system_score_codex":0.0020650052,"about_ca_system_score_gemma":0.000867246,"threshold_uncertainty_score":0.033216536},"labels":[],"label_agreement":null},{"id":"W3119325883","doi":"10.4310/joc.2021.v12.n1.a4","title":"Zero-forcing in random regular graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Mathematics; Zero (linguistics); Forcing (mathematics); Combinatorics; Random graph; Discrete mathematics; Graph; Mathematical analysis","score_opus":0.015088871495038923,"score_gpt":0.2742597223041571,"score_spread":0.2591708508091182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119325883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2493398,0.0004732877,0.73816997,0.00064007344,0.000072508345,0.00012392082,0.00023198532,0.00065400125,0.010294439],"genre_scores_gemma":[0.90669227,0.00042492826,0.08553128,0.00020869983,0.0000744233,0.00021542655,0.00020694482,0.00020942876,0.0064365054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893874,0.00035693284,0.000042424734,0.00025551202,0.00020702218,0.00019942079],"domain_scores_gemma":[0.9866992,0.010238543,0.0008583638,0.0010237689,0.00053574983,0.00064422336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017366913,0.00054816384,0.00082579005,0.0017431132,0.0010766468,0.0014574697,0.0018276871,0.0009512745,0.00309015],"category_scores_gemma":[0.012543349,0.00059811556,0.0010277843,0.00070394226,0.0036841456,0.0024227593,0.0018748188,0.0014400491,0.0004943739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012728591,0.00004333238,0.0012084501,0.00011843301,0.000030929565,0.00025318173,0.00025289308,0.12076961,0.0039056332,0.8626868,0.001375829,0.009227599],"study_design_scores_gemma":[0.000032442844,0.000035920373,0.00034323268,0.000029656716,0.000015663549,0.00011218809,0.000050933173,0.45981747,0.0018894514,0.5364022,0.001245209,0.000025607633],"about_ca_topic_score_codex":0.0016810106,"about_ca_topic_score_gemma":0.0019177144,"teacher_disagreement_score":0.00309015,"about_ca_system_score_codex":0.0014457329,"about_ca_system_score_gemma":0.0009144694,"threshold_uncertainty_score":0.010489523},"labels":[],"label_agreement":null},{"id":"W3122003030","doi":"","title":"On the Equivalence between some Local and Global Chinese Postman and Traveling Salesman Graphs","year":2000,"lang":"en","type":"preprint","venue":"Data Archiving and Networked Services (DANS)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Travelling salesman problem; Combinatorics; Mathematics; Vertex (graph theory); Equivalence (formal languages); Graph; Undirected graph; Discrete mathematics; Mathematical optimization","score_opus":0.025924298784476368,"score_gpt":0.29539410305197644,"score_spread":0.26946980426750006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122003030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58257884,0.0008638532,0.3194322,0.0016697823,0.00009356327,0.00013310126,0.0005744606,0.00019076442,0.0944635],"genre_scores_gemma":[0.9589192,0.00074354466,0.029530859,0.0003765676,0.00011227366,0.00012025635,0.00047764945,0.00008699274,0.00963265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994074,0.00015080672,0.00002911535,0.00020780308,0.00011097384,0.000094050694],"domain_scores_gemma":[0.99776626,0.0011909846,0.00034223308,0.00019525923,0.00028466326,0.0002206523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007701533,0.00049066584,0.00041382114,0.0008758086,0.0010547397,0.0014552985,0.0006876519,0.000740531,0.00591957],"category_scores_gemma":[0.0038119727,0.00023337491,0.00044792495,0.0010879486,0.0019213193,0.0048354366,0.0012126588,0.0013010956,0.00035883547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005389356,0.000028720544,0.0007747909,0.000054736727,0.000013382787,0.0001715822,0.0005385836,0.005566301,0.0016129905,0.97390985,0.001138086,0.016137127],"study_design_scores_gemma":[0.000020335548,0.000055016368,0.0013031095,0.000024196019,0.000027498281,0.00025377062,0.00034564052,0.03450177,0.0011490862,0.95708084,0.005223236,0.000015556887],"about_ca_topic_score_codex":0.0021215826,"about_ca_topic_score_gemma":0.0016346922,"teacher_disagreement_score":0.00591957,"about_ca_system_score_codex":0.0010061638,"about_ca_system_score_gemma":0.00045074357,"threshold_uncertainty_score":0.019802928},"labels":[],"label_agreement":null},{"id":"W312445613","doi":"10.1016/j.dam.2005.05.004","title":"The resolution complexity of random graph k-colorability","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Mathematical proof; Upper and lower bounds; Discrete mathematics; Random graph; Graph; Exponential function","score_opus":0.03941499046506563,"score_gpt":0.3009212942072034,"score_spread":0.2615063037421378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W312445613","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.606996,0.0036479475,0.29400852,0.025991369,0.0004190553,0.0002091508,0.0031546322,0.0011401983,0.0644332],"genre_scores_gemma":[0.9752789,0.0011889029,0.014886494,0.0007400453,0.0005387575,0.00017463962,0.0008791038,0.00027309466,0.0060400506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99378586,0.002433519,0.00023606651,0.0011730356,0.0013962963,0.0009751772],"domain_scores_gemma":[0.921007,0.06341964,0.0036907245,0.0066374973,0.0021620186,0.0030831483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044310275,0.0010790665,0.0032911208,0.0024938234,0.0028467556,0.009442759,0.0068015116,0.0046509164,0.0166645],"category_scores_gemma":[0.048693113,0.0014933172,0.0019712518,0.00415608,0.007633619,0.022191765,0.0048805955,0.008049592,0.001260254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031654813,0.00007849827,0.0011958106,0.00021613836,0.000065523294,0.00010997865,0.00035517596,0.039279994,0.0009708132,0.9421519,0.005908824,0.00935082],"study_design_scores_gemma":[0.000058144025,0.000016449461,0.0003846945,0.000019723546,0.000025930265,0.000082196886,0.00007795772,0.07566284,0.0003511081,0.92258745,0.0007037652,0.000029643046],"about_ca_topic_score_codex":0.0034689724,"about_ca_topic_score_gemma":0.0019497445,"teacher_disagreement_score":0.0166645,"about_ca_system_score_codex":0.005095364,"about_ca_system_score_gemma":0.0025419535,"threshold_uncertainty_score":0.055748343},"labels":[],"label_agreement":null},{"id":"W3124632410","doi":"10.1016/j.jctb.2021.01.005","title":"Obstructions for bounded shrub-depth and rank-depth","year":2021,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institute for Basic Science; National Research Foundation of Korea; Ministry of Education","keywords":"Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Path (computing); Graph; Rank (graph theory); Planar graph; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.05923293731809692,"score_gpt":0.32990333426136076,"score_spread":0.27067039694326384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124632410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6673507,0.0013656832,0.23016334,0.0034376483,0.0002691106,0.00015439786,0.0019848791,0.0014794945,0.093794644],"genre_scores_gemma":[0.97245085,0.0005145466,0.017869879,0.0005139326,0.0002307757,0.0001013471,0.00071556494,0.000309086,0.007293989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982179,0.00024734766,0.000089852314,0.00047901497,0.00042650287,0.00053942966],"domain_scores_gemma":[0.987815,0.006452041,0.0012642606,0.0016838323,0.0008018251,0.0019830973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010260043,0.00069716753,0.0009898753,0.0017801821,0.0018997046,0.0031430644,0.0013753087,0.0014541424,0.012986434],"category_scores_gemma":[0.008664141,0.00065134617,0.0015007256,0.0011468257,0.0040632295,0.009347417,0.005607071,0.004038964,0.0011756293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015312643,0.000058927384,0.00223909,0.00015902688,0.000020570413,0.00026830606,0.00067919027,0.0031877283,0.0037966243,0.97873527,0.0031953424,0.007506746],"study_design_scores_gemma":[0.000045031265,0.00006303423,0.0016971519,0.000035820423,0.000032601863,0.00048975163,0.00028476142,0.012425573,0.0018615479,0.97605985,0.0069558015,0.000049032158],"about_ca_topic_score_codex":0.0013782483,"about_ca_topic_score_gemma":0.001427646,"teacher_disagreement_score":0.012986434,"about_ca_system_score_codex":0.0012589289,"about_ca_system_score_gemma":0.00075239857,"threshold_uncertainty_score":0.04344392},"labels":[],"label_agreement":null},{"id":"W3125582982","doi":"","title":"Conflict Resolution in the Scheduling of Television Commercials","year":2009,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"","keywords":"Weighting; Combinatorics; Scheduling (production processes); Partition (number theory); Mathematics; Upper and lower bounds; Extension (predicate logic); Generalization; Computer science; Algorithm; Mathematical optimization","score_opus":0.025765488557012415,"score_gpt":0.3239979941457003,"score_spread":0.29823250558868786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125582982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16417566,0.00054992194,0.823676,0.000562978,0.00007304292,0.00018903296,0.00020068142,0.00042936212,0.010143355],"genre_scores_gemma":[0.8083842,0.00022712354,0.1868367,0.00013323044,0.00004254716,0.0001979107,0.00024110654,0.00017465475,0.0037624752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986286,0.00059254665,0.000050168477,0.00027271747,0.00020996177,0.00024597402],"domain_scores_gemma":[0.99779654,0.0013735004,0.00022520196,0.00019423732,0.00018581474,0.00022477284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014634236,0.0007016774,0.0009080898,0.000534408,0.00079675764,0.0013955303,0.0027150554,0.0009127029,0.005279811],"category_scores_gemma":[0.0037851376,0.00079140597,0.0006226731,0.0017028514,0.0009082084,0.0018272115,0.0010778337,0.0016820977,0.00045804167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044474285,0.00017911561,0.0009138167,0.0001743388,0.000065597385,0.00025320996,0.00028121658,0.9209415,0.0047874134,0.031405818,0.002227263,0.038325965],"study_design_scores_gemma":[0.000041066593,0.00006529293,0.00022696707,0.0000073336046,0.000014387025,0.00007188527,0.000059845002,0.9845974,0.0013671591,0.012112255,0.0014265573,0.000009896123],"about_ca_topic_score_codex":0.0033256349,"about_ca_topic_score_gemma":0.0028361536,"teacher_disagreement_score":0.005279811,"about_ca_system_score_codex":0.0012612381,"about_ca_system_score_gemma":0.00096556224,"threshold_uncertainty_score":0.017662704},"labels":[],"label_agreement":null},{"id":"W3128824031","doi":"10.1007/s40065-021-00311-7","title":"The complexity of frugal colouring","year":2021,"lang":"en","type":"article","venue":"Arabian Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Combinatorics; Neighbourhood (mathematics); Mathematics; Vertex (graph theory); Discrete mathematics","score_opus":0.07437948393906975,"score_gpt":0.3162392872467088,"score_spread":0.24185980330763907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128824031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9096474,0.0003599698,0.06346348,0.007061147,0.00007614476,0.0003010168,0.0029299227,0.0015457979,0.014615251],"genre_scores_gemma":[0.9624396,0.00016935695,0.029741801,0.00043089507,0.00007850228,0.00016742284,0.003188887,0.00016729803,0.0036163593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99376774,0.0012715044,0.00032932527,0.0013585245,0.0017131369,0.0015597938],"domain_scores_gemma":[0.9692551,0.021892382,0.0024759562,0.0030666825,0.0018196119,0.0014903068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019805054,0.0005942061,0.0013684083,0.0013666846,0.0025621988,0.005673514,0.0027327598,0.0027475685,0.011941812],"category_scores_gemma":[0.022124283,0.0009829444,0.0020650916,0.0014987048,0.0032111956,0.008021732,0.0033853129,0.002863069,0.0011127891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041849427,0.0011194388,0.03555317,0.0018131546,0.00034154402,0.0017214136,0.004679019,0.27737907,0.056344397,0.42504248,0.040849064,0.15097223],"study_design_scores_gemma":[0.0002582218,0.00019136094,0.0053913128,0.00008893999,0.00011247143,0.00051518035,0.00081370614,0.43535846,0.011801579,0.5372864,0.008090838,0.000091504495],"about_ca_topic_score_codex":0.008140055,"about_ca_topic_score_gemma":0.005285288,"teacher_disagreement_score":0.011941812,"about_ca_system_score_codex":0.00484955,"about_ca_system_score_gemma":0.0026081472,"threshold_uncertainty_score":0.039949358},"labels":[],"label_agreement":null},{"id":"W3129089473","doi":"10.46298/dmtcs.7158","title":"Domination in Kn\\\"odel Graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Dominating set; Graph; Upper and lower bounds; Discrete mathematics; Domination analysis; Vertex (graph theory)","score_opus":0.016350692049110136,"score_gpt":0.29461141545501224,"score_spread":0.2782607234059021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129089473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8049506,0.001225705,0.14979653,0.0018334665,0.000059435224,0.00010377349,0.0008978968,0.0005419642,0.040590685],"genre_scores_gemma":[0.9713378,0.0006374712,0.019306405,0.00017944726,0.000033582874,0.00006661056,0.00050351134,0.00005592453,0.007879383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944514,0.00008428572,0.000023865423,0.00019730198,0.0001135095,0.00013586087],"domain_scores_gemma":[0.99764097,0.0017534825,0.00019874581,0.0001371399,0.00011615117,0.00015349744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050869933,0.00032904852,0.0004429663,0.0007595671,0.0010245362,0.0017446663,0.00084993534,0.00043073852,0.0020891489],"category_scores_gemma":[0.0029870223,0.00029697182,0.00031480452,0.0005879357,0.0015789948,0.0023258873,0.0014079034,0.0009796624,0.00023818399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010018894,0.000121558856,0.009125479,0.0009807287,0.00008564135,0.00091558316,0.0020450533,0.1357069,0.06357385,0.686405,0.011473292,0.08856492],"study_design_scores_gemma":[0.00010434727,0.000089653826,0.0044404767,0.00009039732,0.00005022931,0.0008999051,0.00044840507,0.27687347,0.023090161,0.6673611,0.026495991,0.000055899647],"about_ca_topic_score_codex":0.0021268255,"about_ca_topic_score_gemma":0.0034076774,"teacher_disagreement_score":0.0021268255,"about_ca_system_score_codex":0.0020161949,"about_ca_system_score_gemma":0.00058955315,"threshold_uncertainty_score":0.014628649},"labels":[],"label_agreement":null},{"id":"W31298921","doi":"10.1164/rccm.201906-1275ed","title":"Braodcast Chromatic Numbers of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.019290742424289572,"score_gpt":0.2675628570168777,"score_spread":0.24827211459258813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31298921","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3513069,0.0019432423,0.10564218,0.0027715468,0.001085681,0.00015286022,0.004495137,0.0010942592,0.53150815],"genre_scores_gemma":[0.8916117,0.0010467733,0.023196831,0.00037139287,0.00020916047,0.00014728915,0.0019305674,0.00032463943,0.08116159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944144,0.000092400325,0.00002084611,0.00013720593,0.00016562319,0.0001424815],"domain_scores_gemma":[0.99782467,0.0008863319,0.00022030357,0.00037407875,0.00035254908,0.00034210135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005399504,0.0004031432,0.00039119413,0.0026953982,0.0016957863,0.0038403836,0.0009991889,0.0008459408,0.03241947],"category_scores_gemma":[0.0038615398,0.00032683404,0.00023716221,0.00182365,0.0016507171,0.004229306,0.0012478759,0.0017734161,0.003910072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014218695,0.000028772927,0.00093529694,0.000069182606,0.0000075482617,0.000032725868,0.00016577823,0.0017645679,0.002170762,0.966822,0.009692138,0.018168965],"study_design_scores_gemma":[0.00003404797,0.000028364382,0.0016286849,0.000056012937,0.000012845728,0.000136323,0.0002811898,0.011090982,0.0032524858,0.9416687,0.041784406,0.000025964482],"about_ca_topic_score_codex":0.0022954992,"about_ca_topic_score_gemma":0.004971665,"teacher_disagreement_score":0.03241947,"about_ca_system_score_codex":0.0018686125,"about_ca_system_score_gemma":0.0007942436,"threshold_uncertainty_score":0.10845393},"labels":[],"label_agreement":null},{"id":"W3130492185","doi":"10.1142/s1793830921500890","title":"Star chromatic number of some graphs","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Iran National Science Foundation","keywords":"Mathematics; Combinatorics; Star (game theory); Cartesian product; Chromatic scale; Vertex (graph theory); Graph; Brooks' theorem; Edge coloring; Star product; Discrete mathematics; 1-planar graph; Chordal graph; Graph power; Line graph","score_opus":0.017198585531656225,"score_gpt":0.30707402447920484,"score_spread":0.28987543894754864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130492185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80358326,0.0006178664,0.07910588,0.0017697975,0.00025208277,0.000096354954,0.0010132728,0.0004308116,0.11313074],"genre_scores_gemma":[0.9683717,0.0004606819,0.018295124,0.00022617902,0.00010554385,0.00006238755,0.0005489364,0.000101598926,0.011827889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996506,0.00005865287,0.000013936193,0.00009521154,0.00010411803,0.000077488716],"domain_scores_gemma":[0.999,0.00041490878,0.00011282342,0.00009809358,0.00022443674,0.00014979181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031539027,0.00026930092,0.00024431618,0.0011569617,0.0010738806,0.0012500457,0.00039288582,0.00039539384,0.0067895427],"category_scores_gemma":[0.001281203,0.00021677792,0.00032910216,0.0012162484,0.0012330484,0.0013309023,0.00048270568,0.00070146547,0.0004221522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026567324,0.00006959218,0.0037853795,0.00018513898,0.000028928449,0.00025819475,0.00047527402,0.01181234,0.015477665,0.9434088,0.008294058,0.015938966],"study_design_scores_gemma":[0.0000674112,0.000104053746,0.004375096,0.00003521565,0.0000489533,0.0004714148,0.00033713283,0.09958919,0.013064358,0.8518748,0.029980104,0.00005228744],"about_ca_topic_score_codex":0.0024569961,"about_ca_topic_score_gemma":0.002580093,"teacher_disagreement_score":0.0067895427,"about_ca_system_score_codex":0.0015345366,"about_ca_system_score_gemma":0.00095907954,"threshold_uncertainty_score":0.022713244},"labels":[],"label_agreement":null},{"id":"W3132307481","doi":"10.1016/j.jctb.2021.02.001","title":"Connectivity and choosability of graphs with no K minor","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Minor (academic); Mathematics; Graph; Conjecture; Graph minor; Upper and lower bounds; Discrete mathematics; Graph power; Line graph","score_opus":0.00907079580733079,"score_gpt":0.2509396275268328,"score_spread":0.24186883171950202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132307481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9609342,0.00021274916,0.017522814,0.00062006956,0.000036397952,0.000046276906,0.00056923006,0.00015567333,0.019902568],"genre_scores_gemma":[0.99051195,0.00020786117,0.0045512835,0.00013136824,0.000067693676,0.00005294672,0.00078954856,0.000090331734,0.0035971443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994106,0.00011428296,0.000045100085,0.00021082874,0.00009719894,0.00012189258],"domain_scores_gemma":[0.9910357,0.0059969663,0.0012989506,0.0006024498,0.00030602294,0.0007599181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045232233,0.00059703365,0.0008758975,0.0011023028,0.001477412,0.0033077833,0.0015171625,0.0012328129,0.009266127],"category_scores_gemma":[0.0059892284,0.0010430635,0.0009353863,0.0011534387,0.0021524152,0.0033040612,0.0015250585,0.0014927818,0.0006658308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003038263,0.0006157158,0.035815146,0.00071489334,0.00020098791,0.0029201836,0.0044069206,0.02503809,0.05503292,0.8300722,0.009379779,0.03276483],"study_design_scores_gemma":[0.00055575615,0.0003379398,0.027070537,0.00010485368,0.00025798616,0.0031900727,0.001772441,0.056121085,0.011646078,0.8941225,0.0046980176,0.00012266719],"about_ca_topic_score_codex":0.0017666547,"about_ca_topic_score_gemma":0.0019795094,"teacher_disagreement_score":0.009266127,"about_ca_system_score_codex":0.00066156726,"about_ca_system_score_gemma":0.00052957033,"threshold_uncertainty_score":0.03099835},"labels":[],"label_agreement":null},{"id":"W3135193972","doi":"10.1016/j.disc.2021.112362","title":"Chordality of locally semicomplete and weakly quasi-transitive digraphs","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Transitive relation; Digraph; Mathematics; Combinatorics; Strongly connected component; Discrete mathematics; Graph","score_opus":0.020454960617849585,"score_gpt":0.28865346542544035,"score_spread":0.2681985048075908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135193972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84164613,0.0004205241,0.09949127,0.00076395547,0.00011391933,0.000106142674,0.0013274981,0.00028527377,0.055845283],"genre_scores_gemma":[0.97642994,0.00032460337,0.00951897,0.00013597844,0.00009301799,0.00008466347,0.0009182179,0.00009458368,0.012400015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988518,0.00020847975,0.000098756485,0.00031809867,0.00025190637,0.00027101542],"domain_scores_gemma":[0.99326587,0.00354483,0.0007149303,0.0005795101,0.00066398346,0.0012308016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009550087,0.00061402173,0.0016490285,0.0026257157,0.003176176,0.00561187,0.0019333151,0.0010529571,0.008101792],"category_scores_gemma":[0.004230386,0.00089509826,0.0013302604,0.0024328157,0.0038568748,0.0056606038,0.003344685,0.0024050807,0.00070730224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117559626,0.000034853012,0.00071760645,0.000054457527,0.000020720387,0.00021979373,0.00068761664,0.0011110251,0.0014015285,0.9925114,0.00039269275,0.0027306427],"study_design_scores_gemma":[0.000051946758,0.000033117634,0.0006490714,0.000018758758,0.00002657833,0.0001532919,0.00035461166,0.0052952883,0.0008574392,0.99115914,0.0013816715,0.000019129508],"about_ca_topic_score_codex":0.0030085493,"about_ca_topic_score_gemma":0.0036430277,"teacher_disagreement_score":0.008101792,"about_ca_system_score_codex":0.0022118716,"about_ca_system_score_gemma":0.0009752528,"threshold_uncertainty_score":0.027103186},"labels":[],"label_agreement":null},{"id":"W3136082331","doi":"10.55016/ojs/cdm.v15i2.62672","title":"Equality Perfect Graphs and Digraphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Vertex (graph theory); Graph; Chromatic scale; Alice and Bob; Discrete mathematics; Alice (programming language); Computer science","score_opus":0.030712067699897636,"score_gpt":0.3319881593684025,"score_spread":0.30127609166850483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136082331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3364505,0.0034995233,0.42951182,0.0027075848,0.00043624543,0.00026073807,0.0021599166,0.00061733514,0.22435637],"genre_scores_gemma":[0.94184697,0.0012914505,0.034964062,0.0005935453,0.0001476763,0.0001469099,0.0009346741,0.000051255003,0.020023504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895155,0.0002727986,0.000054086682,0.00029529072,0.00021157421,0.0002146496],"domain_scores_gemma":[0.99821293,0.0009716902,0.00023350786,0.00017658468,0.0001633182,0.00024209205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006157415,0.0006482144,0.0005301249,0.0015117876,0.001520486,0.002311478,0.0007885893,0.00079318474,0.0070088417],"category_scores_gemma":[0.0031582278,0.000396336,0.00034969236,0.0018764033,0.0033029749,0.003288491,0.0017435811,0.001130716,0.0005322838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018909031,0.000011231912,0.00023732457,0.000036243848,0.000003884304,0.000044183427,0.00012053525,0.0019991854,0.00023216281,0.9902082,0.0010135035,0.006074756],"study_design_scores_gemma":[0.000018375165,0.00001624172,0.0004153239,0.000018928358,0.000008603795,0.000119181335,0.00009049388,0.0074589597,0.00026884399,0.9804863,0.011087226,0.000011533964],"about_ca_topic_score_codex":0.0046341987,"about_ca_topic_score_gemma":0.005166616,"teacher_disagreement_score":0.0070088417,"about_ca_system_score_codex":0.0024897486,"about_ca_system_score_gemma":0.000799509,"threshold_uncertainty_score":0.023446918},"labels":[],"label_agreement":null},{"id":"W3140032042","doi":"10.55016/ojs/cdm.v20i1.73743","title":"Saved by the rook: a case of matchings and Hamiltonian cycles","year":2025,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Combinatorics; Cartesian product; Hamiltonian path; Graph; Vertex (graph theory); Mathematics; Complete graph; Hamiltonian (control theory); Complement graph; Discrete mathematics; Line graph; Graph power","score_opus":0.015544680755604775,"score_gpt":0.3371160409681031,"score_spread":0.3215713602124983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140032042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76390994,0.0013062838,0.13967904,0.0058736904,0.00016538244,0.00020020289,0.0006003284,0.00034997414,0.087915175],"genre_scores_gemma":[0.9590919,0.00040563953,0.030609984,0.00038450293,0.000078414625,0.00008318553,0.00019320234,0.00006401272,0.009089184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981292,0.000505298,0.00008877441,0.00049331936,0.00027050366,0.00051300525],"domain_scores_gemma":[0.996557,0.0017840412,0.00057321746,0.00042379825,0.0001489378,0.0005130297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011166682,0.00048779554,0.0008414981,0.0011355577,0.0023447245,0.0029002787,0.0015265063,0.004712544,0.0072984505],"category_scores_gemma":[0.009081866,0.00088028575,0.0008791911,0.0028402614,0.003759669,0.007324508,0.00239393,0.0017645916,0.0006529665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027279093,0.00014939229,0.0018712276,0.00013859723,0.00004453643,0.0040520197,0.0010636575,0.01841276,0.0014416904,0.9502712,0.004446686,0.017835408],"study_design_scores_gemma":[0.00013679142,0.00007336161,0.0006427462,0.000041239036,0.000042152948,0.002082141,0.0010954966,0.06660733,0.0011037197,0.91868436,0.009445464,0.000045219454],"about_ca_topic_score_codex":0.003167394,"about_ca_topic_score_gemma":0.003342864,"teacher_disagreement_score":0.0072984505,"about_ca_system_score_codex":0.001237368,"about_ca_system_score_gemma":0.0007716998,"threshold_uncertainty_score":0.024415731},"labels":[],"label_agreement":null},{"id":"W3140312363","doi":"10.1007/s00285-021-01601-6","title":"Corrigendum to “Best match graphs”","year":2021,"lang":"en","type":"erratum","venue":"Journal of Mathematical Biology","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Universität Leipzig","keywords":"Lemma (botany); Precondition; Mathematics; Discrete mathematics; Combinatorics; Algorithm; Computer science; Biology","score_opus":0.0515386356139553,"score_gpt":0.3448042626324283,"score_spread":0.29326562701847303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140312363","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015371415,0.0010923427,0.007006327,0.041490335,0.9325833,0.00004545654,0.002475412,0.0018792625,0.013273957],"genre_scores_gemma":[0.017706284,0.006370725,0.023925822,0.09872441,0.37769127,0.00043481853,0.0134986695,0.011008223,0.4506398],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99396884,0.0012884309,0.00068356266,0.0012281515,0.002437842,0.00039319493],"domain_scores_gemma":[0.9640021,0.009766405,0.0014759006,0.004352541,0.018996507,0.0014066244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034033547,0.00211021,0.0019211584,0.004031103,0.003250663,0.0047573466,0.003228322,0.0039050425,0.18458234],"category_scores_gemma":[0.06279976,0.0011838913,0.0019829888,0.0029913692,0.0024284336,0.004047212,0.003035928,0.0065052244,0.13056944],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011331524,0.0000038288545,0.000015473785,0.000052770338,0.0000047577164,0.000029937897,0.000009960003,0.000040944968,0.00003619185,0.0018794502,0.99397993,0.003935398],"study_design_scores_gemma":[0.000011548157,0.000010099953,0.00016426403,0.00009122272,0.00001446426,0.00016436588,0.00002092721,0.00028762885,0.00027789077,0.0043487423,0.9945879,0.000021011501],"about_ca_topic_score_codex":0.0082590785,"about_ca_topic_score_gemma":0.009422888,"teacher_disagreement_score":0.18458234,"about_ca_system_score_codex":0.0048991484,"about_ca_system_score_gemma":0.0029100731,"threshold_uncertainty_score":0.61748946},"labels":[],"label_agreement":null},{"id":"W3140694014","doi":"","title":"Eternal k-domination on graphs.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Dominating set; Domination analysis; Mathematics; Graph; Sequence (biology); Discrete mathematics","score_opus":0.08171175207183747,"score_gpt":0.22036936872399412,"score_spread":0.13865761665215665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140694014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2665204,0.0028950004,0.63246745,0.0025488944,0.0001969695,0.00027255717,0.0011076729,0.0006190739,0.09337196],"genre_scores_gemma":[0.877432,0.002276355,0.097214505,0.0006601708,0.00029808097,0.00020119581,0.0007513813,0.00020224329,0.020964079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981856,0.0004237601,0.00011866582,0.0005297813,0.00041028217,0.0003319779],"domain_scores_gemma":[0.9912545,0.0051901815,0.0011319697,0.0012468338,0.00056345016,0.00061321934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017050892,0.0007221579,0.0006854727,0.0019349708,0.001991426,0.0025881454,0.0014486699,0.000889079,0.005238879],"category_scores_gemma":[0.009630941,0.00053908303,0.0009957341,0.0018772556,0.0048635225,0.009143868,0.0029757807,0.0021641767,0.0008542455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014573526,0.00004970499,0.0026965002,0.00019784774,0.00004083485,0.00024194874,0.00074169063,0.015858212,0.0032603268,0.94043094,0.0037458374,0.032590605],"study_design_scores_gemma":[0.000020684729,0.000043370103,0.00084351614,0.00004884721,0.000025207391,0.0005720057,0.0001867686,0.032878812,0.0026710108,0.9476463,0.015037882,0.000025684469],"about_ca_topic_score_codex":0.0016375108,"about_ca_topic_score_gemma":0.0018424577,"teacher_disagreement_score":0.005238879,"about_ca_system_score_codex":0.001972667,"about_ca_system_score_gemma":0.00070537033,"threshold_uncertainty_score":0.017525852},"labels":[],"label_agreement":null},{"id":"W3140783139","doi":"10.1007/s00373-022-02478-y","title":"Predominating a Vertex in the Connected Domination Game","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Vertex connectivity; Discrete mathematics","score_opus":0.01243350273283779,"score_gpt":0.24614587311416752,"score_spread":0.23371237038132975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140783139","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73838437,0.00040840093,0.13175648,0.0026504854,0.00012010216,0.0001879385,0.00028442932,0.0002217703,0.12598611],"genre_scores_gemma":[0.9741718,0.00019347461,0.00893758,0.00025005118,0.000047185556,0.000092192524,0.000096088115,0.000053685802,0.016158018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998002,0.000925448,0.00006907078,0.00026244717,0.00035565664,0.0003853866],"domain_scores_gemma":[0.9925908,0.005104429,0.0003664273,0.00031940627,0.00039821403,0.0012207949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001899796,0.00077047414,0.0011903329,0.0010873663,0.00227385,0.004229926,0.002074784,0.002412834,0.0064387154],"category_scores_gemma":[0.0087721655,0.0005177078,0.0005228484,0.0012780664,0.0028452114,0.0043665613,0.0024194538,0.0019462567,0.00062545034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005170596,0.000119934724,0.001193029,0.000114320326,0.000044066637,0.00040455855,0.0009114607,0.009289185,0.004907567,0.9672531,0.0026043602,0.012641334],"study_design_scores_gemma":[0.00010177477,0.00004856062,0.00029209713,0.000020594576,0.000031155152,0.00022251628,0.00033578885,0.03991561,0.0010642026,0.9558705,0.0020751045,0.000022048385],"about_ca_topic_score_codex":0.0024999625,"about_ca_topic_score_gemma":0.0027912213,"teacher_disagreement_score":0.0064387154,"about_ca_system_score_codex":0.001341001,"about_ca_system_score_gemma":0.0012639096,"threshold_uncertainty_score":0.021539629},"labels":[],"label_agreement":null},{"id":"W3141724913","doi":"","title":"Paired-Domination in Claw-Free Graphs with Minimum Degree at Least Four.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Degree (music); Combinatorics; Biology; Physics","score_opus":0.03066532496089894,"score_gpt":0.2654474907939363,"score_spread":0.23478216583303738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141724913","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86918736,0.000692655,0.063296184,0.0015801293,0.00011531123,0.00015036452,0.0012236264,0.0004782313,0.06327614],"genre_scores_gemma":[0.9616247,0.00030215128,0.017859995,0.00031871107,0.00005913468,0.00010376303,0.0011399525,0.00009522975,0.01849634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999419,0.00011556955,0.000028749242,0.00014391684,0.00011255407,0.00018021013],"domain_scores_gemma":[0.9963677,0.0018855585,0.0005390001,0.00030414356,0.00032219102,0.00058135425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043273647,0.000429392,0.00052380416,0.0014209124,0.0018662865,0.0017828344,0.0014342334,0.0011390803,0.009846262],"category_scores_gemma":[0.0038943752,0.0005982341,0.0005011776,0.0012314809,0.0012236906,0.0031011603,0.0018679474,0.0012833641,0.0012811195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011263943,0.0005141665,0.014911431,0.00092686975,0.00023548768,0.0032991276,0.002536925,0.024203712,0.039054018,0.781759,0.02520054,0.10623237],"study_design_scores_gemma":[0.00019978637,0.00015869376,0.0050914534,0.00019546285,0.00016750695,0.00249956,0.0015517656,0.050367862,0.018338354,0.89929265,0.022067681,0.00006927622],"about_ca_topic_score_codex":0.0018337064,"about_ca_topic_score_gemma":0.0036323573,"teacher_disagreement_score":0.009846262,"about_ca_system_score_codex":0.000758572,"about_ca_system_score_gemma":0.0007763366,"threshold_uncertainty_score":0.032939076},"labels":[],"label_agreement":null},{"id":"W31460525","doi":"10.1039/c9cc05103a","title":"Powers of Asteroidal Triple-free Graphs with Applications.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Emil Aaltosen Säätiö; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.010637802496877196,"score_gpt":0.2542648206693099,"score_spread":0.24362701817243268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31460525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15100773,0.006048688,0.4968782,0.0026027935,0.0017902614,0.00018533233,0.0011988229,0.0017997484,0.3384884],"genre_scores_gemma":[0.7937354,0.003047154,0.11899336,0.0007543897,0.00035373453,0.00016015705,0.001018719,0.0003340756,0.08160308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998313,0.00003032047,0.0000139465055,0.00004197506,0.000057371788,0.0000250932],"domain_scores_gemma":[0.999548,0.00011372545,0.000081948136,0.00010998466,0.000073798816,0.00007255455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000260609,0.0003303092,0.0001915089,0.000865113,0.0005895214,0.0012851603,0.00033015996,0.00030145267,0.014867323],"category_scores_gemma":[0.00095999194,0.00017721274,0.00029610473,0.0008387019,0.0009598882,0.0018836699,0.0010632353,0.00075864693,0.002175522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041641382,0.000013983812,0.00012762305,0.00014165303,0.000008613212,0.0001677191,0.00022587355,0.0019487196,0.00724139,0.94465995,0.0048652776,0.040557615],"study_design_scores_gemma":[0.000011616294,0.000043867494,0.00020509922,0.00005054909,0.000011283319,0.0005228469,0.00013020697,0.0062364433,0.007070086,0.86501217,0.12069095,0.000014919898],"about_ca_topic_score_codex":0.0003634996,"about_ca_topic_score_gemma":0.0011064005,"teacher_disagreement_score":0.014867323,"about_ca_system_score_codex":0.0005132919,"about_ca_system_score_gemma":0.00028394724,"threshold_uncertainty_score":0.0497362},"labels":[],"label_agreement":null},{"id":"W3147818285","doi":"","title":"Toughness and [a,b]-factors with inclusion/exclusion properties","year":2011,"lang":"en","type":"article","venue":"中国科学:数学(英文版)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Graph; Inclusion (mineral); Mathematics; Combinatorics; Physics","score_opus":0.04861995598887572,"score_gpt":0.254511906562886,"score_spread":0.2058919505740103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147818285","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6416802,0.00064061885,0.32851407,0.0005829365,0.00012331511,0.00017367015,0.00045447462,0.00038798308,0.027442772],"genre_scores_gemma":[0.92855555,0.00032605775,0.06472195,0.00017517204,0.00014126865,0.00013825792,0.0005028587,0.00012094809,0.005317972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978961,0.00031223486,0.00018676391,0.0006621646,0.00050457433,0.00043814478],"domain_scores_gemma":[0.9860286,0.007124619,0.0025854798,0.0010731134,0.001419673,0.0017683946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013997523,0.0006922431,0.00073986227,0.0013363964,0.002410513,0.001905167,0.00068511616,0.00081750145,0.0053999447],"category_scores_gemma":[0.010665112,0.00063720456,0.0011750024,0.0009541979,0.0033130855,0.0049591595,0.0017980405,0.0013107967,0.0006322827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010751754,0.0002428799,0.016838077,0.00047217993,0.00015674284,0.0022157324,0.0030480197,0.020896446,0.033947647,0.87656283,0.00369853,0.04084579],"study_design_scores_gemma":[0.0001450938,0.00047225674,0.0071452036,0.0001624211,0.00017200515,0.003629691,0.0020133245,0.06524324,0.022973802,0.869323,0.028541857,0.00017812577],"about_ca_topic_score_codex":0.002968703,"about_ca_topic_score_gemma":0.0020225055,"teacher_disagreement_score":0.0053999447,"about_ca_system_score_codex":0.0006414277,"about_ca_system_score_gemma":0.00086366583,"threshold_uncertainty_score":0.018064618},"labels":[],"label_agreement":null},{"id":"W31481056","doi":"10.1186/s12913-019-4391-8","title":"Computing Minimal Triangulations in Time","year":2005,"lang":"en","type":"article","venue":"BMC Health Services Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institutes of Health Research; Ministry of Health, British Columbia","keywords":"Combinatorics; Time complexity; Upper and lower bounds; Triangulation; Vertex (graph theory); Graph; Mathematics; Matrix multiplication; Discrete mathematics; Running time; Computer science; Algorithm","score_opus":0.06898875246700287,"score_gpt":0.44776358983563525,"score_spread":0.3787748373686324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31481056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12909064,0.0009090006,0.84662956,0.0011927342,0.0002191111,0.0002495502,0.004259589,0.001748703,0.015701082],"genre_scores_gemma":[0.3193009,0.0005789065,0.6584349,0.0002101625,0.000107089785,0.0002791475,0.009499391,0.0008803444,0.010709174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985322,0.00028844448,0.0001307628,0.00035937058,0.00041523445,0.0002739428],"domain_scores_gemma":[0.9945485,0.0030468244,0.00039289068,0.0007374454,0.00097356876,0.00030071964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011556636,0.0008991812,0.0013936855,0.002356856,0.0012022922,0.0026999717,0.0019294012,0.0010590315,0.018081907],"category_scores_gemma":[0.011206386,0.0007251854,0.001682438,0.0023134472,0.0012240969,0.0028549263,0.0028875333,0.0014281982,0.0028453805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089394837,0.00018142024,0.012735106,0.0018074604,0.0002729193,0.0007082419,0.002184247,0.38802814,0.008707441,0.18745641,0.036419258,0.36060542],"study_design_scores_gemma":[0.00012247464,0.00014586672,0.001996062,0.00014829895,0.000070240036,0.0002951167,0.0012612168,0.5536446,0.0030169487,0.4167267,0.022530293,0.00004220461],"about_ca_topic_score_codex":0.008175907,"about_ca_topic_score_gemma":0.016148698,"teacher_disagreement_score":0.018081907,"about_ca_system_score_codex":0.0011060039,"about_ca_system_score_gemma":0.001172998,"threshold_uncertainty_score":0.060490012},"labels":[],"label_agreement":null},{"id":"W3151244505","doi":"","title":"Trees with the second and third largest number of maximum independent sets.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.017541912431659378,"score_gpt":0.2757287504529915,"score_spread":0.25818683802133213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151244505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4060585,0.004458025,0.3671485,0.0076204864,0.00096581486,0.0003226558,0.01623516,0.0027664818,0.19442447],"genre_scores_gemma":[0.8249084,0.0012160669,0.13444877,0.0010893904,0.00050786353,0.00027602637,0.0061514326,0.0005136862,0.030888397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990896,0.00018661673,0.000050477203,0.00019798109,0.00023347703,0.00024191744],"domain_scores_gemma":[0.992312,0.0042271097,0.0008193517,0.0011139229,0.0006896718,0.0008380336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007123543,0.00050108304,0.0009303081,0.0014582964,0.002148665,0.0032986766,0.0013210954,0.0020308304,0.01167824],"category_scores_gemma":[0.0090679675,0.0007481413,0.0011121643,0.0018878604,0.0011448152,0.0034882345,0.0014605318,0.0021900628,0.0030683444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006109823,0.00022579047,0.0047160783,0.00055518793,0.00014842083,0.0011175978,0.00052347424,0.00989285,0.019372635,0.82926124,0.06566454,0.06791117],"study_design_scores_gemma":[0.000096462834,0.000060768125,0.004118532,0.00011937204,0.00013346408,0.0026876016,0.00024021635,0.022981733,0.009014555,0.9242321,0.03627244,0.000042666394],"about_ca_topic_score_codex":0.00088449003,"about_ca_topic_score_gemma":0.0021798613,"teacher_disagreement_score":0.01167824,"about_ca_system_score_codex":0.0011574555,"about_ca_system_score_gemma":0.001325396,"threshold_uncertainty_score":0.039067626},"labels":[],"label_agreement":null},{"id":"W3152744231","doi":"10.1007/s00373-023-02638-8","title":"The Explorer–Director Game on Graphs","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Security token; Vertex (graph theory); Graph; Mathematics; Computer science; Square lattice; Wheel graph; Discrete mathematics; Graph power; Line graph","score_opus":0.029609282595315527,"score_gpt":0.277482437763077,"score_spread":0.24787315516776148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152744231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58285934,0.00061833835,0.18236035,0.007136657,0.00018452122,0.00021305693,0.00055749284,0.00037538615,0.22569488],"genre_scores_gemma":[0.95353234,0.00032698226,0.017296826,0.0003580538,0.000060105263,0.00009541635,0.00018641232,0.00007985148,0.028064035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998767,0.0006930244,0.00003495258,0.00014613953,0.00014387099,0.00021504756],"domain_scores_gemma":[0.9956157,0.0028221954,0.00025199345,0.00030365906,0.00012367236,0.00088282936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095568824,0.00064428244,0.0009263949,0.0006323713,0.0016657369,0.0032550446,0.0015717107,0.0027425038,0.011755215],"category_scores_gemma":[0.006126267,0.0004011983,0.00047915473,0.00078064116,0.002747409,0.0062726396,0.0027173,0.0020825318,0.0007706489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003350714,0.00007249468,0.00049092306,0.0000788615,0.00002242102,0.00016886975,0.00038477487,0.012935623,0.001788401,0.96740246,0.004654695,0.011665427],"study_design_scores_gemma":[0.000083550905,0.000042512118,0.00020485274,0.000016783888,0.00001175458,0.00009324803,0.00029085498,0.046551395,0.0004265603,0.94639575,0.0058646896,0.000017933202],"about_ca_topic_score_codex":0.00295461,"about_ca_topic_score_gemma":0.003215139,"teacher_disagreement_score":0.011755215,"about_ca_system_score_codex":0.0011532261,"about_ca_system_score_gemma":0.0009081941,"threshold_uncertainty_score":0.039325178},"labels":[],"label_agreement":null},{"id":"W3152988225","doi":"10.1142/s0129054111009148","title":"APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council","keywords":"Euclidean geometry; Geometric networks; Approximation algorithm; Time complexity; Network planning and design; Computer science; Polynomial; Geometric design; Euclidean space; Algorithm; Mathematical optimization; Polynomial-time approximation scheme; Discrete mathematics; Theoretical computer science; Mathematics; Graph theory; Combinatorics; Geometry","score_opus":0.09136408144728773,"score_gpt":0.34830072277790397,"score_spread":0.2569366413306162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152988225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030323856,0.0011819114,0.9581024,0.0010705852,0.00011515002,0.00017624146,0.0005023454,0.0015643409,0.006963183],"genre_scores_gemma":[0.3954516,0.0010732255,0.5942636,0.000431553,0.00019358828,0.00034084747,0.0020415247,0.00046997226,0.0057340623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808705,0.0005756285,0.00008697295,0.0004871692,0.0003922081,0.00037101645],"domain_scores_gemma":[0.99627656,0.0021002514,0.00036138546,0.0008457647,0.00023928803,0.00017672553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001988565,0.0019322664,0.0021991273,0.0010587097,0.00096673303,0.0025064095,0.0032785297,0.002225259,0.008624668],"category_scores_gemma":[0.007936962,0.0008307675,0.0013772204,0.0029958868,0.0011751904,0.0065682274,0.0022377209,0.0032031971,0.0017075585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006671926,0.00036518945,0.0012850066,0.0005360312,0.00012975384,0.00013697929,0.0002521168,0.7249243,0.003341416,0.08446067,0.01943501,0.1644663],"study_design_scores_gemma":[0.00009558122,0.00006399664,0.00013899867,0.00001731866,0.000029545086,0.000074519,0.00006383486,0.9167324,0.000804738,0.079446025,0.0025211999,0.000011992362],"about_ca_topic_score_codex":0.0038235465,"about_ca_topic_score_gemma":0.006568219,"teacher_disagreement_score":0.008624668,"about_ca_system_score_codex":0.002749282,"about_ca_system_score_gemma":0.0019489152,"threshold_uncertainty_score":0.028852403},"labels":[],"label_agreement":null},{"id":"W3153914952","doi":"10.1002/jgt.22906","title":"Triangle‐free graphs with large chromatic number and no induced wheel","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Windmill graph; Wheel graph; Vertex (graph theory); Graph; Petersen graph; Discrete mathematics; Line graph; Graph power","score_opus":0.012954920009154278,"score_gpt":0.26245799401051345,"score_spread":0.24950307400135918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153914952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9335681,0.00025455127,0.036463987,0.000762247,0.00007893275,0.00003410861,0.00042273698,0.000260925,0.02815441],"genre_scores_gemma":[0.9863905,0.00012968686,0.008294655,0.00013935825,0.00002455755,0.000027208876,0.0003345139,0.000049040988,0.004610489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961215,0.00007173521,0.00001488762,0.00008890546,0.00009374334,0.000118578886],"domain_scores_gemma":[0.99637336,0.0018791775,0.00040155026,0.00043238787,0.00044074672,0.0004727341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034536034,0.000287988,0.00034969285,0.0011075273,0.0010843916,0.0013402981,0.00083010324,0.0005997462,0.005979916],"category_scores_gemma":[0.0018179457,0.0004497416,0.00030618618,0.00090692384,0.0013267884,0.0015874616,0.0011202391,0.0009196987,0.0004243831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009866549,0.00024683448,0.016231563,0.00034030929,0.000094144576,0.001513145,0.00094538555,0.03634791,0.08285063,0.82135284,0.012830559,0.026260003],"study_design_scores_gemma":[0.00030549802,0.00021090443,0.016648488,0.00009417748,0.00011299487,0.0014632911,0.0011038046,0.10495466,0.044511355,0.8072132,0.023269627,0.000111869675],"about_ca_topic_score_codex":0.0045329547,"about_ca_topic_score_gemma":0.0081102615,"teacher_disagreement_score":0.005979916,"about_ca_system_score_codex":0.0011020981,"about_ca_system_score_gemma":0.00043824504,"threshold_uncertainty_score":0.020004869},"labels":[],"label_agreement":null},{"id":"W3155570673","doi":"10.1145/3508069","title":"QCSP on Reflexive Tournaments","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; European Commission","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Tournament; Constraint satisfaction problem; Reflexivity; Discrete mathematics; Graph; Statistics","score_opus":0.05988162739378244,"score_gpt":0.34701124063691474,"score_spread":0.2871296132431323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155570673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3262964,0.0006706819,0.62558603,0.0048560877,0.00022495323,0.0004271338,0.002722007,0.0011545555,0.03806204],"genre_scores_gemma":[0.84328645,0.00052973174,0.14048412,0.0011352577,0.00027485006,0.00042426438,0.0028272886,0.00025945238,0.010778542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705815,0.0006990492,0.00019877675,0.0007715851,0.00071352907,0.0005589531],"domain_scores_gemma":[0.99242413,0.0048259157,0.0006858542,0.0008499904,0.00064862455,0.00056542084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001728993,0.0008543688,0.000961851,0.0008406655,0.0014844638,0.0036595697,0.0021405923,0.0012950284,0.010418357],"category_scores_gemma":[0.007821896,0.0004962601,0.0019964287,0.0020573363,0.0020543584,0.0055141095,0.0030827865,0.003812733,0.0006129596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050239865,0.00030571158,0.0018719097,0.0005046532,0.00018016253,0.00047290197,0.00060060446,0.087824516,0.007209492,0.8459517,0.008412216,0.046163872],"study_design_scores_gemma":[0.0001331335,0.0000975019,0.00062610174,0.000040319464,0.000057182733,0.00017287956,0.00012622739,0.2443513,0.0023725703,0.7464319,0.005554535,0.000036295976],"about_ca_topic_score_codex":0.0044807764,"about_ca_topic_score_gemma":0.003380318,"teacher_disagreement_score":0.010418357,"about_ca_system_score_codex":0.002027474,"about_ca_system_score_gemma":0.001364063,"threshold_uncertainty_score":0.034852862},"labels":[],"label_agreement":null},{"id":"W3156797889","doi":"10.1016/j.disc.2022.113079","title":"Irredundance trees of diameter 3","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Graph; Cardinality (data modeling); Discrete mathematics; Computer science","score_opus":0.02566232620976708,"score_gpt":0.29545894767569775,"score_spread":0.26979662146593064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156797889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70811915,0.002473329,0.11828211,0.0045885895,0.0004427884,0.0002019139,0.003019787,0.0016996041,0.16117279],"genre_scores_gemma":[0.921475,0.0011157176,0.033822093,0.0008823695,0.00037590237,0.00017057646,0.0019828216,0.00059569033,0.03957994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991831,0.00012429056,0.00004747624,0.00019503255,0.00021315698,0.00023685452],"domain_scores_gemma":[0.99373984,0.0038546263,0.00054017943,0.00052864087,0.00053224695,0.0008044641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008903171,0.00082953507,0.001797082,0.002127189,0.0035702344,0.0036767635,0.0014217198,0.0016013874,0.011221977],"category_scores_gemma":[0.0045436956,0.0010101286,0.0010152183,0.0024150638,0.0022659525,0.0036204706,0.0022200784,0.0036741844,0.001666668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035289137,0.000089413246,0.001521961,0.00017322718,0.00003460564,0.0005171505,0.0010418162,0.0018063446,0.010626622,0.96433574,0.007729896,0.011770279],"study_design_scores_gemma":[0.00008788413,0.000060551087,0.0017857912,0.000039182207,0.000052722404,0.0008061975,0.0003472492,0.0063446863,0.004002276,0.9687136,0.017731113,0.000028821854],"about_ca_topic_score_codex":0.0012067712,"about_ca_topic_score_gemma":0.002012127,"teacher_disagreement_score":0.011221977,"about_ca_system_score_codex":0.0015494536,"about_ca_system_score_gemma":0.00047931526,"threshold_uncertainty_score":0.03754127},"labels":[],"label_agreement":null},{"id":"W3157297330","doi":"10.1016/j.jctb.2024.03.001","title":"Typical structure of hereditary properties of binary matroids","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Matroid; Mathematics; Binary number; Graph; Combinatorics; Graphic matroid; Discrete mathematics; Arithmetic","score_opus":0.012493392506069081,"score_gpt":0.258757780643422,"score_spread":0.2462643881373529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157297330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93846846,0.000491109,0.033805944,0.00076144614,0.00003689267,0.000042560994,0.0010901715,0.00025996045,0.025043448],"genre_scores_gemma":[0.9924942,0.00019306058,0.0050954847,0.000056126046,0.00010197501,0.00003600023,0.0006345749,0.00003561466,0.00135291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991918,0.00017267678,0.00006008105,0.00023711356,0.00022087718,0.00011755516],"domain_scores_gemma":[0.99304456,0.0039303615,0.0011454014,0.0006162593,0.0006385347,0.00062482007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006789102,0.00036014995,0.00066462817,0.0024174626,0.0014693771,0.0028146182,0.0010259906,0.0007793349,0.005513053],"category_scores_gemma":[0.0047479253,0.0005682549,0.00048358995,0.0028774356,0.0019546044,0.0041903425,0.00086242,0.0010224062,0.00031610433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020818206,0.00015725949,0.0074629583,0.00022010122,0.000053589418,0.00039886037,0.0007739388,0.0034237423,0.007280293,0.95931906,0.0032570993,0.017444847],"study_design_scores_gemma":[0.000046111192,0.000056864996,0.006882017,0.00003534881,0.00004389977,0.0011072335,0.00034506273,0.015368251,0.002921473,0.9706497,0.002511589,0.000032565626],"about_ca_topic_score_codex":0.0003311542,"about_ca_topic_score_gemma":0.00046614927,"teacher_disagreement_score":0.005513053,"about_ca_system_score_codex":0.0010190643,"about_ca_system_score_gemma":0.00034907667,"threshold_uncertainty_score":0.018442988},"labels":[],"label_agreement":null},{"id":"W3157628167","doi":"10.46298/dmtcs.7437","title":"On the Boolean dimension of a graph and other related parameters","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Université de Lyon; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Université Claude Bernard Lyon 1; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Discrete mathematics; Graph; Dimension (graph theory); Two-element Boolean algebra; Boolean expression; Boolean algebras canonically defined; Boolean function; Algebra over a field; Pure mathematics","score_opus":0.017964657912783323,"score_gpt":0.2741195652994549,"score_spread":0.25615490738667157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157628167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5566565,0.0077190544,0.28512934,0.0057808026,0.00062466256,0.000063463,0.0013870074,0.00030850343,0.14233072],"genre_scores_gemma":[0.96958995,0.0017940535,0.021708185,0.0003251284,0.0005907715,0.00007246188,0.0002508146,0.000099892444,0.0055687088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922013,0.00022828439,0.00003618883,0.00016625554,0.00019726978,0.00015186411],"domain_scores_gemma":[0.99443096,0.003827627,0.000535426,0.00038486885,0.00039541183,0.00042559637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010086977,0.0006638726,0.00066465157,0.0033878444,0.0010815025,0.0028748945,0.0008297074,0.0007406726,0.0058588055],"category_scores_gemma":[0.0058350936,0.0002526452,0.0004980979,0.002434984,0.0038861688,0.0073178615,0.0015962723,0.002129975,0.00058956887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030360261,0.000020361118,0.000624371,0.0000483178,0.000007615864,0.000048678885,0.00012781392,0.003068358,0.0012773216,0.98863846,0.0009520244,0.0051562367],"study_design_scores_gemma":[0.000005209479,0.000019701041,0.00078571273,0.000032521853,0.000010651242,0.00014679262,0.00008574333,0.013643007,0.00076624943,0.9816228,0.0028554427,0.000026316711],"about_ca_topic_score_codex":0.00077423657,"about_ca_topic_score_gemma":0.00070300366,"teacher_disagreement_score":0.0058588055,"about_ca_system_score_codex":0.0015189664,"about_ca_system_score_gemma":0.00037759022,"threshold_uncertainty_score":0.019599676},"labels":[],"label_agreement":null},{"id":"W3159348138","doi":"10.46298/dmtcs.7458","title":"Separating layered treewidth and row treewidth","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Treewidth; Partial k-tree; Combinatorics; Mathematics; Tree-depth; 1-planar graph; Bounded function; Clique-sum; Tree decomposition; Pathwidth; Discrete mathematics; Graph; Chordal graph; Line graph","score_opus":0.019348290710912194,"score_gpt":0.29801633726400634,"score_spread":0.27866804655309413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159348138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2147155,0.001341694,0.7585372,0.0011081678,0.000121978876,0.00005013456,0.00036185118,0.00072618295,0.023037264],"genre_scores_gemma":[0.8382911,0.0011313804,0.15331297,0.00054725504,0.00025005726,0.0001176363,0.00038184342,0.00052952114,0.005438221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986462,0.000272939,0.00007936988,0.00040190166,0.00029245662,0.00030702053],"domain_scores_gemma":[0.99336123,0.0036046442,0.0007411035,0.0011991618,0.000591994,0.00050193653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00099898,0.0007403158,0.00061733,0.00081206055,0.00071050343,0.002699896,0.0015263887,0.0008767132,0.003287075],"category_scores_gemma":[0.006660929,0.0006731726,0.0010003534,0.0007785959,0.0024065375,0.009576941,0.0033197117,0.002792286,0.00060258585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012410547,0.000034681507,0.0013437867,0.0001649758,0.000026153972,0.00017419619,0.00057351106,0.0077281627,0.015600408,0.94640046,0.0015047451,0.026324812],"study_design_scores_gemma":[0.000016113847,0.000055174063,0.001144915,0.00006117424,0.000039055154,0.0005235313,0.0002452247,0.038430873,0.0072135,0.9400977,0.012134532,0.000038221344],"about_ca_topic_score_codex":0.0010021611,"about_ca_topic_score_gemma":0.0012184898,"teacher_disagreement_score":0.003287075,"about_ca_system_score_codex":0.001091933,"about_ca_system_score_gemma":0.0006000401,"threshold_uncertainty_score":0.010996342},"labels":[],"label_agreement":null},{"id":"W3159453235","doi":"10.1007/978-3-662-63170-6_4","title":"Algorithms for Generating Strongly Chordal Graphs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Chordal graph; Interval graph; Split graph; Pathwidth; Indifference graph; Combinatorics; Treewidth; Computer science; Outerplanar graph; Mathematics; Graph; Discrete mathematics; 1-planar graph; Line graph","score_opus":0.03295453966932661,"score_gpt":0.30288861939613304,"score_spread":0.26993407972680644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159453235","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026138403,0.00038581234,0.9171953,0.00063260517,0.00018466568,0.0005776438,0.0017577981,0.00499849,0.048129212],"genre_scores_gemma":[0.15353937,0.00050619745,0.8148391,0.00023470372,0.00010708589,0.0005563907,0.005590658,0.0013841459,0.023242313],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896634,0.00017979692,0.00007099041,0.00021240099,0.0004374275,0.00013303406],"domain_scores_gemma":[0.9956481,0.0024206338,0.00013377913,0.0010890386,0.0005615904,0.00014678588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083485356,0.0011018972,0.0007343647,0.0011688393,0.0011192088,0.0019927884,0.002923672,0.0011829614,0.020908918],"category_scores_gemma":[0.005690381,0.00087530754,0.0013497422,0.0022183456,0.00086448836,0.003540405,0.003499349,0.0021538003,0.006149328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029053364,0.00029952198,0.0008558196,0.0008148901,0.0000516531,0.00015785015,0.0005785063,0.026198262,0.00944003,0.29878235,0.050918594,0.61161196],"study_design_scores_gemma":[0.00018415324,0.00010990201,0.00043618155,0.00011041826,0.00008047246,0.00030105643,0.00029860993,0.16503869,0.013532368,0.774812,0.045056287,0.000039991795],"about_ca_topic_score_codex":0.0010169647,"about_ca_topic_score_gemma":0.0024313582,"teacher_disagreement_score":0.020908918,"about_ca_system_score_codex":0.001284105,"about_ca_system_score_gemma":0.0012572699,"threshold_uncertainty_score":0.0699473},"labels":[],"label_agreement":null},{"id":"W31595256","doi":"10.1016/j.pbj.0000000000000030","title":"Clique graphs of Helly circular arc graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Clique-sum; Combinatorics; Indifference graph; Mathematics; Split graph; Block graph; Cograph; Treewidth; Trapezoid graph; Interval graph; Pathwidth; Discrete mathematics; Clique graph; Clique problem; 1-planar graph; Graph; Line graph","score_opus":0.016661615856261584,"score_gpt":0.27487472912401456,"score_spread":0.258213113267753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31595256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57901037,0.0025304786,0.280334,0.006552592,0.0007017677,0.0006542067,0.004349478,0.0009623868,0.124904685],"genre_scores_gemma":[0.92057693,0.001155665,0.049976643,0.0009089458,0.00024952617,0.00022872273,0.0021383637,0.0001678212,0.024597306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991111,0.0003316617,0.00003923354,0.00018905375,0.00016524587,0.00016372991],"domain_scores_gemma":[0.9931137,0.0040418063,0.0011659986,0.00075359346,0.00041263952,0.0005123329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006606678,0.0004525408,0.00036775536,0.0014076729,0.0023632273,0.0013049168,0.0010242957,0.0009870558,0.0122107435],"category_scores_gemma":[0.0042368528,0.00047540796,0.000641281,0.0014250402,0.0012923139,0.003079987,0.0011792914,0.0011189225,0.0010587712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004592644,0.00016634786,0.0048731244,0.00055714115,0.000151702,0.0020213965,0.0013192657,0.0137399845,0.0082291765,0.9084981,0.018821198,0.04116323],"study_design_scores_gemma":[0.000079713725,0.000065594795,0.0034414353,0.00006957902,0.000093325434,0.0018738392,0.0006455285,0.036110792,0.003764708,0.91905487,0.03475196,0.00004870916],"about_ca_topic_score_codex":0.0025523908,"about_ca_topic_score_gemma":0.003964606,"teacher_disagreement_score":0.0122107435,"about_ca_system_score_codex":0.0010723068,"about_ca_system_score_gemma":0.00062242115,"threshold_uncertainty_score":0.04084903},"labels":[],"label_agreement":null},{"id":"W3159778435","doi":"10.1016/j.ic.2022.104954","title":"Beyond PCSP(1-in-3,NAE)","year":2022,"lang":"en","type":"preprint","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Horizon 2020; European Research Council; Natural Sciences and Engineering Research Council of Canada; European Commission; Royal Society","keywords":"Constraint satisfaction problem; Tuple; Backtracking; Constraint satisfaction; Template; Combinatorics; Mathematics; Constraint (computer-aided design); Computer science; Boolean function; Relaxation (psychology); Discrete mathematics; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.019636919936389,"score_gpt":0.3090241625789866,"score_spread":0.28938724264259763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159778435","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04059719,0.0026590624,0.44242525,0.02320166,0.006121133,0.00038917564,0.009751389,0.013135687,0.46171948],"genre_scores_gemma":[0.49516565,0.0018418216,0.28219864,0.007312666,0.0020779525,0.00058226474,0.007900704,0.0066489116,0.19627143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842286,0.00038623993,0.00007509198,0.0004603905,0.0003804557,0.00027491353],"domain_scores_gemma":[0.99614185,0.0008617776,0.00017103888,0.0019405518,0.0005908443,0.00029399354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016867234,0.0007460073,0.000976905,0.0012069908,0.002819879,0.0058924705,0.0022956105,0.0024894478,0.049668714],"category_scores_gemma":[0.008592291,0.00044767503,0.0012435113,0.001610621,0.002160475,0.008171732,0.00461252,0.00516073,0.026205609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017651834,0.000069211535,0.00034062983,0.00017444222,0.00001729607,0.00007140186,0.00010870614,0.0019871234,0.00095321133,0.8663985,0.08253544,0.047167648],"study_design_scores_gemma":[0.000016102353,0.000009584831,0.00010005813,0.000033956458,0.0000080491145,0.00006823821,0.00002579748,0.0061329175,0.0010944797,0.9407324,0.0517653,0.000013172886],"about_ca_topic_score_codex":0.0025900898,"about_ca_topic_score_gemma":0.004472501,"teacher_disagreement_score":0.049668714,"about_ca_system_score_codex":0.0019196594,"about_ca_system_score_gemma":0.00270168,"threshold_uncertainty_score":0.16615838},"labels":[],"label_agreement":null},{"id":"W3160192199","doi":"10.7151/dmgt.2494","title":"An analogue of quasi-transitivity for edge-coloured graphs","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Mathematics; Combinatorics; Transitive relation; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.02918938736880279,"score_gpt":0.3245934464297203,"score_spread":0.29540405906091755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160192199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48166892,0.0005834842,0.42943332,0.0008807248,0.00030891475,0.00012720103,0.0006600984,0.00048726963,0.08585013],"genre_scores_gemma":[0.9580122,0.00033810223,0.034943994,0.00021697,0.00012109944,0.000048488655,0.0003443153,0.00012689589,0.005847928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990096,0.00018420494,0.000052290037,0.00039951495,0.00018180696,0.00017251527],"domain_scores_gemma":[0.9971277,0.0009194747,0.0005537872,0.000845336,0.00030703263,0.00024670412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007551238,0.0003670216,0.00031283943,0.0010626662,0.00094324123,0.002159775,0.0007375754,0.00062015984,0.0069758645],"category_scores_gemma":[0.0022211012,0.0003370519,0.00093194534,0.00092404167,0.0028897845,0.004218788,0.0010233432,0.0015979679,0.00046189767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000437908,0.000027510046,0.0012193752,0.00007242971,0.000012414872,0.00025096998,0.00040229078,0.0019635381,0.006648312,0.97946024,0.00056337565,0.009335686],"study_design_scores_gemma":[0.000022661929,0.00012455745,0.0027950008,0.000039747974,0.000031220683,0.0010840377,0.00034922006,0.013749738,0.005637704,0.9609133,0.01522514,0.000027754062],"about_ca_topic_score_codex":0.0011972027,"about_ca_topic_score_gemma":0.0010341322,"teacher_disagreement_score":0.0069758645,"about_ca_system_score_codex":0.000900765,"about_ca_system_score_gemma":0.0003158227,"threshold_uncertainty_score":0.02333659},"labels":[],"label_agreement":null},{"id":"W3160395046","doi":"10.1016/j.disc.2021.112441","title":"Reconfiguration of homomorphisms to reflexive digraph cycles","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Algebraic number; Discrete mathematics; Graph; Path (computing); Computer science","score_opus":0.03565127811538304,"score_gpt":0.3294347344413274,"score_spread":0.2937834563259444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160395046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67801356,0.00064446393,0.23485151,0.00044614193,0.00036385862,0.0002238058,0.00053083024,0.002931877,0.081994034],"genre_scores_gemma":[0.9603238,0.00031179536,0.023726182,0.00017708223,0.00009939534,0.000089345696,0.00042439,0.00036056864,0.014487414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991491,0.00015295617,0.00005795643,0.00027844167,0.00011511204,0.00024648858],"domain_scores_gemma":[0.99751115,0.0008487989,0.00025481082,0.00062517816,0.00026060408,0.00049932476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044829637,0.00051126594,0.00058251596,0.0014994394,0.0008879199,0.0022667763,0.0009562547,0.0006795767,0.009549061],"category_scores_gemma":[0.0033586223,0.00061418593,0.00078370236,0.0011139765,0.0014055328,0.0033480343,0.0016532495,0.0012156848,0.0011508436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004369244,0.0002342066,0.0013586436,0.00023225325,0.000061357794,0.0010754594,0.0019987135,0.011840076,0.022924718,0.87385356,0.0040675183,0.081916556],"study_design_scores_gemma":[0.00007341686,0.00011556483,0.0010307188,0.00004380193,0.00004763991,0.0005288409,0.00070776313,0.020785896,0.0121223815,0.9501266,0.014372657,0.000044728506],"about_ca_topic_score_codex":0.00084832,"about_ca_topic_score_gemma":0.000895616,"teacher_disagreement_score":0.009549061,"about_ca_system_score_codex":0.0010219392,"about_ca_system_score_gemma":0.00046056724,"threshold_uncertainty_score":0.03194475},"labels":[],"label_agreement":null},{"id":"W3161061639","doi":"","title":"Price of Connectivity for the vertex cover problem and the dominating set problem: Conjectures and investigation of critical graphs","year":2017,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vertex cover; Combinatorics; Mathematics; Dominating set; Bipartite graph; Vertex (graph theory); Bounded function; Discrete mathematics; Maximal independent set; Feedback vertex set; Edge cover; Connected component; Chordal graph; Graph; 1-planar graph","score_opus":0.01896815255539841,"score_gpt":0.2868417533792701,"score_spread":0.2678736008238717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161061639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5480493,0.01988758,0.28454757,0.04194807,0.001344501,0.00034000358,0.0015703803,0.0005895566,0.10172305],"genre_scores_gemma":[0.9427369,0.0073621892,0.03585785,0.0025487063,0.0024701846,0.00031654522,0.00091792457,0.0004000858,0.0073896223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726033,0.00071658526,0.00010372891,0.0007891562,0.0007618654,0.0003681875],"domain_scores_gemma":[0.9421751,0.04721763,0.0034970725,0.002702233,0.00226609,0.0021418969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043347753,0.0015271591,0.0022002198,0.0034494298,0.0023146272,0.0065400177,0.00385828,0.005202565,0.009800437],"category_scores_gemma":[0.05375391,0.0011535375,0.0022577678,0.00409074,0.0068526412,0.020890042,0.0033657486,0.0070635844,0.0006781187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003263939,0.00013977005,0.0035692262,0.00042579896,0.000087009365,0.00028557825,0.00043013215,0.026219599,0.001703845,0.94014096,0.009923396,0.01674835],"study_design_scores_gemma":[0.00007405927,0.00010029588,0.0016683493,0.0001378135,0.000057963,0.00043835273,0.00023935687,0.092195034,0.0008361613,0.8977512,0.006444228,0.000057215035],"about_ca_topic_score_codex":0.0020862531,"about_ca_topic_score_gemma":0.0010152749,"teacher_disagreement_score":0.009800437,"about_ca_system_score_codex":0.0053599956,"about_ca_system_score_gemma":0.001113821,"threshold_uncertainty_score":0.038889647},"labels":[],"label_agreement":null},{"id":"W3163332497","doi":"10.1007/978-3-030-86838-3_30","title":"On 3-Coloring of $$(2P_4,C_5)$$-Free Graphs","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Grantová Agentura, Univerzita Karlova; Grantová Agentura České Republiky; European Commission; Univerzita Karlova v Praze","keywords":"Combinatorics; Mathematics; Graph coloring; Graph; Class (philosophy); Discrete mathematics; Time complexity; Computer science; Artificial intelligence","score_opus":0.02491208453577773,"score_gpt":0.30208095628936305,"score_spread":0.2771688717535853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163332497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74455273,0.00044519344,0.15362708,0.0018160446,0.00041591102,0.00022921544,0.0022282081,0.0010455654,0.09564015],"genre_scores_gemma":[0.9158867,0.00027416644,0.043300517,0.0006475371,0.00010722502,0.00014378759,0.0027164605,0.00043655807,0.036487084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923205,0.00017955856,0.000024610516,0.00015710891,0.00013509359,0.0002715567],"domain_scores_gemma":[0.99832755,0.0007104716,0.00020647726,0.00020240562,0.0002802948,0.00027282018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005088729,0.00067995075,0.0005199118,0.00094787544,0.0022716054,0.0018105375,0.0007890749,0.0007781227,0.012087521],"category_scores_gemma":[0.0014312132,0.00042496278,0.000984609,0.00096791744,0.0014659131,0.0014603407,0.0010327651,0.00095838634,0.001215304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007196912,0.0002672069,0.005089681,0.00038305164,0.00009735838,0.001712872,0.0011003072,0.050634433,0.018110994,0.8219921,0.043887876,0.056004405],"study_design_scores_gemma":[0.00009707238,0.0000969828,0.0042421618,0.00008784105,0.00006135628,0.0007013536,0.0006769933,0.11852857,0.01519994,0.8226133,0.037624724,0.000069723515],"about_ca_topic_score_codex":0.011805914,"about_ca_topic_score_gemma":0.015296338,"teacher_disagreement_score":0.012087521,"about_ca_system_score_codex":0.0025017061,"about_ca_system_score_gemma":0.0011767974,"threshold_uncertainty_score":0.040436804},"labels":[],"label_agreement":null},{"id":"W3163840932","doi":"10.48550/arxiv.2105.04611","title":"Lower Boundary Independent Broadcasts in Trees","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Boundary (topology); Graph; Upper and lower bounds; Prime (order theory); Physics; Mathematical analysis","score_opus":0.061392257983663566,"score_gpt":0.22171630801829792,"score_spread":0.16032405003463435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163840932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20006143,0.0056962436,0.58995444,0.0047380617,0.00084814953,0.0005024478,0.0039742095,0.004053562,0.1901715],"genre_scores_gemma":[0.69543946,0.0025524625,0.19954179,0.0027574652,0.0012676165,0.0008933719,0.006612387,0.0026036333,0.08833186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659675,0.0006080913,0.0001646941,0.0006913273,0.0009975317,0.00094168744],"domain_scores_gemma":[0.984339,0.009532218,0.0013255412,0.0020005782,0.001672299,0.001130496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020277482,0.0013481163,0.0019611984,0.0023782186,0.0034013726,0.004945071,0.0023554247,0.0022361842,0.021532869],"category_scores_gemma":[0.017799545,0.0010433656,0.0016404509,0.0025036607,0.0024799942,0.0083826175,0.0056405687,0.0047817146,0.005786289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011496793,0.00022601055,0.0017887009,0.0007551229,0.00010640377,0.00057672773,0.0016111116,0.049077194,0.0070705973,0.83601683,0.037175864,0.0644457],"study_design_scores_gemma":[0.00016580465,0.00014263243,0.00061620586,0.00022119255,0.00012598604,0.00030706613,0.0003330188,0.15282886,0.0036252039,0.811388,0.030191515,0.000054388554],"about_ca_topic_score_codex":0.0043791835,"about_ca_topic_score_gemma":0.007918185,"teacher_disagreement_score":0.021532869,"about_ca_system_score_codex":0.0041564708,"about_ca_system_score_gemma":0.001657647,"threshold_uncertainty_score":0.0720346},"labels":[],"label_agreement":null},{"id":"W3165244533","doi":"10.1002/jgt.22685","title":"The list linear arboricity of graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research Foundation of Korea; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Arboricity; Mathematics; Combinatorics; Conjecture; Degeneracy (biology); Dense graph; Graph; Discrete mathematics; Pathwidth; Planar graph; Line graph; Biology","score_opus":0.01652637430472045,"score_gpt":0.2920695333689219,"score_spread":0.27554315906420146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165244533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7820522,0.0012315303,0.1451225,0.0031099324,0.00009811105,0.0000688322,0.0015395554,0.0013897745,0.0653876],"genre_scores_gemma":[0.9880602,0.00030177567,0.0077477023,0.00021597603,0.00007725815,0.000035867983,0.0006308534,0.00007050573,0.0028598236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993315,0.0001641477,0.000034028562,0.00017145125,0.00015051538,0.00014844154],"domain_scores_gemma":[0.9924475,0.004697708,0.00079835625,0.00057706825,0.0010393207,0.00044002745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004647574,0.00022170751,0.00032412919,0.0012535905,0.00113017,0.0016733373,0.0006093149,0.0004635385,0.006502002],"category_scores_gemma":[0.0050722295,0.00026623585,0.0003233437,0.0011568365,0.0011389154,0.0030249776,0.0012403877,0.0010239147,0.0007529692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009161358,0.00023552764,0.029042892,0.0006892542,0.00010712456,0.0014354116,0.002219356,0.05208425,0.029621942,0.76563734,0.02762344,0.09038728],"study_design_scores_gemma":[0.000077879035,0.00015071307,0.0047963457,0.000093529474,0.00006870802,0.0008081027,0.00066840806,0.101213805,0.009512791,0.8660315,0.016540667,0.000037499678],"about_ca_topic_score_codex":0.0018165385,"about_ca_topic_score_gemma":0.0022580128,"teacher_disagreement_score":0.006502002,"about_ca_system_score_codex":0.0011227343,"about_ca_system_score_gemma":0.00045123554,"threshold_uncertainty_score":0.021751344},"labels":[],"label_agreement":null},{"id":"W3170248899","doi":"10.1145/3519935.3520075","title":"Complexity classification of counting graph homomorphisms modulo a prime number","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Modulo; Conjecture; Counting problem; Mathematics; Prime (order theory); Combinatorics; Discrete mathematics; Constraint satisfaction problem; Graph homomorphism; Graph; Prime number; Computer science; Line graph; Voltage graph; Statistics","score_opus":0.09513486052490078,"score_gpt":0.3465210272567365,"score_spread":0.2513861667318357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170248899","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7719817,0.0019280472,0.18121035,0.0111399675,0.00022614106,0.0002159953,0.002280648,0.0011788429,0.029838337],"genre_scores_gemma":[0.9515579,0.0008440474,0.036766563,0.00069891225,0.00084496476,0.00021213472,0.0025181929,0.0002762508,0.006280934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557376,0.00095245725,0.0002082302,0.0015461396,0.001137662,0.0005816982],"domain_scores_gemma":[0.96896154,0.023707522,0.002409625,0.002507319,0.000910647,0.0015033474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00223818,0.0010157702,0.0018370985,0.0024145367,0.0018363983,0.0063221664,0.002972683,0.0024953804,0.007250501],"category_scores_gemma":[0.021121264,0.0006733692,0.0018254747,0.0030784134,0.003934766,0.0127291065,0.0026092378,0.0052452097,0.00054073834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059163664,0.00040119924,0.0111167515,0.00063296047,0.00016839898,0.0004014951,0.001309453,0.047716413,0.0056090215,0.86710185,0.013446664,0.051504187],"study_design_scores_gemma":[0.00007838965,0.000044713703,0.0019386447,0.000028883185,0.00006177456,0.0002406899,0.00015191418,0.1290018,0.0016775564,0.8644905,0.0022419454,0.00004305134],"about_ca_topic_score_codex":0.0021508397,"about_ca_topic_score_gemma":0.0014724951,"teacher_disagreement_score":0.007250501,"about_ca_system_score_codex":0.004115634,"about_ca_system_score_gemma":0.0017689385,"threshold_uncertainty_score":0.029861212},"labels":[],"label_agreement":null},{"id":"W3171062666","doi":"10.1016/j.tcs.2022.11.020","title":"Colouring graphs with no induced six-vertex path or diamond","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Tianjin City; Nankai University; KU Leuven; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Diamond; Perfect graph; Vertex (graph theory); Perfect graph theorem; Discrete mathematics; Graph; Line graph; Pathwidth; Chemistry","score_opus":0.01722655445675764,"score_gpt":0.27155464520713374,"score_spread":0.2543280907503761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171062666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6558185,0.0003985855,0.17585522,0.0017302927,0.0006580183,0.00032268307,0.002042576,0.0020374903,0.16113652],"genre_scores_gemma":[0.80091,0.00033790772,0.16245686,0.00074727123,0.00008185887,0.00018456929,0.0017528207,0.00051265873,0.033016093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993187,0.0001387812,0.000038315153,0.00018547243,0.00012309365,0.00019565706],"domain_scores_gemma":[0.9966858,0.0012914219,0.00029330893,0.0008324384,0.00040151304,0.0004954753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005845432,0.00073224865,0.00087177847,0.00090218836,0.0017609558,0.0019580538,0.0016198069,0.0016201686,0.013481245],"category_scores_gemma":[0.0024881563,0.00070069847,0.0007981841,0.0009988486,0.0014729026,0.002477899,0.0018308782,0.0022549338,0.0021907643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010568646,0.00029900065,0.002141284,0.0006291504,0.000070241476,0.000846763,0.00084139453,0.009707352,0.04638652,0.84691375,0.01912519,0.07198246],"study_design_scores_gemma":[0.00020427458,0.00016949403,0.0012248774,0.00010251617,0.00007624955,0.0006570825,0.00042563255,0.015839858,0.018118916,0.93827033,0.02484743,0.00006337861],"about_ca_topic_score_codex":0.0014268998,"about_ca_topic_score_gemma":0.002017551,"teacher_disagreement_score":0.013481245,"about_ca_system_score_codex":0.0009361954,"about_ca_system_score_gemma":0.0008031065,"threshold_uncertainty_score":0.045099318},"labels":[],"label_agreement":null},{"id":"W3172200572","doi":"10.1109/iccsmt51754.2020.00008","title":"On Star Coloring of Mycielski's Graphs for Special Graphs","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Combinatorics; Vertex (graph theory); Simple graph; Graph; Star (game theory); Mathematics; Computer science; Discrete mathematics","score_opus":0.04483796058432124,"score_gpt":0.3003046990643692,"score_spread":0.255466738480048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172200572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59909666,0.002669431,0.34308192,0.0011147999,0.00033348706,0.00016207695,0.0007503666,0.0006314618,0.052159745],"genre_scores_gemma":[0.908018,0.0022104934,0.08040119,0.00032262286,0.00021132674,0.00011115764,0.00089856866,0.00014691529,0.0076797996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953294,0.00012256637,0.00002829941,0.0001337094,0.00007341583,0.00010907373],"domain_scores_gemma":[0.9984346,0.00073971925,0.0002350945,0.00019916016,0.00020614598,0.0001853458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051468326,0.0005844516,0.0005321722,0.00096880866,0.0013743372,0.000896194,0.00053664023,0.0004598925,0.0034921765],"category_scores_gemma":[0.0022442108,0.00035741212,0.0006978575,0.001502307,0.0012798967,0.0023919563,0.0009651419,0.0010137869,0.0004172579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053330185,0.00016975006,0.005320126,0.0007378597,0.000065656386,0.00046936786,0.0013491071,0.044925146,0.02107668,0.8425852,0.012164426,0.07060344],"study_design_scores_gemma":[0.0000751103,0.00023212687,0.0036779193,0.000083816856,0.00008446175,0.0006992626,0.00066045806,0.121589825,0.0068986057,0.8350268,0.030900499,0.00007102381],"about_ca_topic_score_codex":0.0027512305,"about_ca_topic_score_gemma":0.0032762508,"teacher_disagreement_score":0.0034921765,"about_ca_system_score_codex":0.0014116794,"about_ca_system_score_gemma":0.00079048186,"threshold_uncertainty_score":0.01168251},"labels":[],"label_agreement":null},{"id":"W3175012788","doi":"","title":"Massively winning configurations in the convex grabbing game on the plane","year":2021,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Convex hull; Combinatorics; Regular polygon; Convex body; Cutting-plane method; Mathematics; Point (geometry); Set (abstract data type); Hull; Plane (geometry); Convex combination; Discrete mathematics; Computer science; Mathematical optimization; Convex optimization; Geometry; Engineering; Integer programming","score_opus":0.05902740392706114,"score_gpt":0.28885181292854883,"score_spread":0.2298244090014877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175012788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80823106,0.00025138087,0.13909961,0.0009454071,0.0000458736,0.00012771695,0.00036940956,0.000267158,0.05066243],"genre_scores_gemma":[0.9591816,0.00018204235,0.032519512,0.00010856435,0.000019264184,0.00013760358,0.00029534302,0.00009795782,0.0074581364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987463,0.00041915855,0.00005437021,0.0001846893,0.00022297144,0.00037249638],"domain_scores_gemma":[0.9982653,0.00082636485,0.00017293077,0.0001312991,0.000105187726,0.0004989094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008907851,0.0009010676,0.0012860947,0.0010259632,0.0025880544,0.0033197098,0.0015500955,0.0017013726,0.0076471153],"category_scores_gemma":[0.0042935046,0.00083488855,0.00057385175,0.0010449209,0.0031390644,0.0038046604,0.0034204228,0.0016612239,0.001062571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060984906,0.00009443955,0.0012975393,0.00007941951,0.000043947966,0.00059557706,0.0005635676,0.054517306,0.0056926943,0.92565614,0.002510355,0.00833912],"study_design_scores_gemma":[0.00015171843,0.00009277059,0.00065331644,0.000029382407,0.000021964473,0.00019282533,0.0005059056,0.15660396,0.002240796,0.83704466,0.002420988,0.00004176313],"about_ca_topic_score_codex":0.0021882267,"about_ca_topic_score_gemma":0.0029926253,"teacher_disagreement_score":0.0076471153,"about_ca_system_score_codex":0.0014452594,"about_ca_system_score_gemma":0.0006613211,"threshold_uncertainty_score":0.025582194},"labels":[],"label_agreement":null},{"id":"W317728043","doi":"10.1016/j.disc.2015.03.021","title":"Every 3-colorable graph has a faithful representation in the odd-distance graph","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Burnaby Hospital; Simon Fraser University","funders":"Vietnam Institute for Advanced Study in Mathematics","keywords":"Mathematics; Combinatorics; Graph; Wheel graph; Discrete mathematics; Faithful representation; Enhanced Data Rates for GSM Evolution; Plane (geometry); Geometric graph theory; Graph power; Line graph; Computer science; Geometry; Artificial intelligence","score_opus":0.08234569812872485,"score_gpt":0.33084921438935466,"score_spread":0.24850351626062983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W317728043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6008342,0.00022468953,0.32186636,0.0018989712,0.00031840612,0.00010462176,0.00087851554,0.0010249311,0.072849385],"genre_scores_gemma":[0.9433723,0.00020729471,0.04212028,0.00058035256,0.000098781806,0.0000802928,0.0006938763,0.0002562926,0.012590584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956614,0.00007397942,0.00002161078,0.00013206722,0.000098660814,0.000107564505],"domain_scores_gemma":[0.9981414,0.0005192438,0.00023422242,0.00047189338,0.00033427533,0.00029900848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039983238,0.0006835773,0.00050324993,0.0009987887,0.0013502018,0.0021898774,0.0012626227,0.0012582324,0.009505433],"category_scores_gemma":[0.001742394,0.00040378512,0.0007762789,0.0008628047,0.0018308042,0.0031893556,0.0013155838,0.0026413037,0.0012008242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001929294,0.00009680406,0.00089139654,0.000083017636,0.0000157632,0.00025202916,0.0005667223,0.0031667997,0.009074084,0.96044433,0.0026465997,0.022569614],"study_design_scores_gemma":[0.000032559663,0.00005245318,0.00069464225,0.00001652084,0.000015254965,0.00023056299,0.00020770715,0.009470448,0.0027390234,0.98059213,0.005920687,0.000028005536],"about_ca_topic_score_codex":0.0017601539,"about_ca_topic_score_gemma":0.0014869367,"teacher_disagreement_score":0.009505433,"about_ca_system_score_codex":0.00071422406,"about_ca_system_score_gemma":0.0004831833,"threshold_uncertainty_score":0.03179878},"labels":[],"label_agreement":null},{"id":"W3179074173","doi":"10.1090/proc/16044","title":"Improved bounds for colouring circle graphs","year":2022,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Omega; Combinatorics; Clique number; Bounding overwatch; Mathematics; Clique; Chromatic scale; Constant (computer programming); Graph; Function (biology); Discrete mathematics; Computer science; Physics","score_opus":0.020775671777796007,"score_gpt":0.3039574474717729,"score_spread":0.2831817756939769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179074173","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11330293,0.0025837522,0.74837047,0.004015323,0.00060977857,0.0002453484,0.0015974258,0.008149198,0.12112578],"genre_scores_gemma":[0.62862486,0.002339299,0.3198443,0.0021488357,0.00074222864,0.0005471912,0.0030478877,0.0037704126,0.038935047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952323,0.0008873419,0.00013414783,0.0011756569,0.0015731729,0.0009973618],"domain_scores_gemma":[0.9841679,0.008984502,0.0007331643,0.0038536994,0.0014893,0.00077154156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026118474,0.0026246407,0.001469988,0.002756559,0.001640936,0.0044565722,0.0047561703,0.0024757243,0.026724014],"category_scores_gemma":[0.019449716,0.0009801679,0.0021949208,0.0030781983,0.0035293165,0.011515057,0.0051392624,0.0048353355,0.0068611037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009587168,0.0003226865,0.003210036,0.0009768847,0.00018503494,0.0003765214,0.0011102256,0.12382423,0.023619052,0.6554497,0.049842753,0.14012413],"study_design_scores_gemma":[0.00007904778,0.00018645616,0.0018345519,0.00018545757,0.0002142241,0.00037408856,0.0002469314,0.38726383,0.018464243,0.55280435,0.0382559,0.000090830756],"about_ca_topic_score_codex":0.006813205,"about_ca_topic_score_gemma":0.007357042,"teacher_disagreement_score":0.026724014,"about_ca_system_score_codex":0.0051464154,"about_ca_system_score_gemma":0.0019807967,"threshold_uncertainty_score":0.08940071},"labels":[],"label_agreement":null},{"id":"W3180039493","doi":"10.1016/j.disc.2021.112708","title":"Recolouring weakly chordal graphs and the complement of triangle-free graphs","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Chordal graph; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Complement graph; Complement (music); Graph power; Line graph; Biology","score_opus":0.03833882838192034,"score_gpt":0.30540646669135735,"score_spread":0.267067638309437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180039493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81688386,0.00055096624,0.119298466,0.0006758774,0.00018987464,0.00008374287,0.00041489862,0.00040690592,0.061495416],"genre_scores_gemma":[0.9483251,0.00038754748,0.030844545,0.00016044342,0.000075280404,0.000033551452,0.00052815286,0.00019668328,0.019448597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994741,0.00010496906,0.000019225343,0.000100856436,0.00015464985,0.0001462267],"domain_scores_gemma":[0.9971667,0.0013500293,0.00024566732,0.00057110464,0.00034064363,0.0003257563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046218943,0.00037238645,0.00058569876,0.00114654,0.0014562246,0.001960452,0.0013011724,0.0007090698,0.008241214],"category_scores_gemma":[0.0041510426,0.00028312844,0.00053970463,0.001063372,0.0016887898,0.0028981364,0.0022009087,0.0015912297,0.0005638567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004691066,0.00009669674,0.0012579999,0.00018763897,0.00002100638,0.00031956565,0.0010963934,0.012017968,0.015068446,0.9002709,0.0041171946,0.065077096],"study_design_scores_gemma":[0.00004739669,0.00009546077,0.0008168265,0.000056492863,0.000023873203,0.00029390163,0.0007691038,0.035469875,0.010767646,0.9380494,0.013584445,0.000025557018],"about_ca_topic_score_codex":0.0027195234,"about_ca_topic_score_gemma":0.0036423665,"teacher_disagreement_score":0.008241214,"about_ca_system_score_codex":0.00084309047,"about_ca_system_score_gemma":0.00055514544,"threshold_uncertainty_score":0.027569592},"labels":[],"label_agreement":null},{"id":"W3181262263","doi":"","title":"18. Uncrossed Chords of Cycles in Chordal Graphs","year":2020,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Indifference graph; Interval graph; Pathwidth; Maximal independent set; Treewidth; Discrete mathematics; Graph; 1-planar graph; Line graph","score_opus":0.052886635506897595,"score_gpt":0.3239464415025009,"score_spread":0.2710598059956033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181262263","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35798123,0.006453349,0.21009028,0.0026149412,0.001000976,0.00022045606,0.0023597286,0.00054083695,0.41873816],"genre_scores_gemma":[0.91005176,0.002224701,0.049566034,0.00059942866,0.00046216807,0.000119855256,0.001067184,0.00012433,0.035784505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929786,0.00009466774,0.0000607395,0.00021680947,0.00020120885,0.00012872246],"domain_scores_gemma":[0.99865925,0.00031307974,0.0002766827,0.00014205236,0.00040382522,0.00020507496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038304465,0.00048435805,0.000310604,0.0014144077,0.0011650444,0.0022816947,0.00060245086,0.0005108051,0.008076308],"category_scores_gemma":[0.0019867641,0.00022978632,0.00046186047,0.0015693696,0.0020281186,0.0028872944,0.0012430098,0.001095915,0.0012980087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050481227,0.000011808761,0.0006429307,0.000090848785,0.000008993978,0.0001308407,0.00028162342,0.0008973554,0.0018108209,0.975828,0.002642289,0.017603934],"study_design_scores_gemma":[0.00001619892,0.000033336622,0.00092745764,0.000036934573,0.000013765148,0.00040415698,0.00024718608,0.0023404066,0.0017008394,0.9494296,0.044833705,0.000016457216],"about_ca_topic_score_codex":0.0018444143,"about_ca_topic_score_gemma":0.0015462148,"teacher_disagreement_score":0.008076308,"about_ca_system_score_codex":0.0011492196,"about_ca_system_score_gemma":0.0005645238,"threshold_uncertainty_score":0.027017951},"labels":[],"label_agreement":null},{"id":"W3181935061","doi":"10.1002/jgt.22956","title":"Adaptable and conflict colouring multigraphs with no cycles of length three or four","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigraph; Combinatorics; Integer (computer science); Mathematics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Graph; Artificial intelligence","score_opus":0.047709428510804466,"score_gpt":0.2921879343224165,"score_spread":0.24447850581161207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181935061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8866116,0.00025472787,0.10145025,0.00026926957,0.000037626723,0.00010192599,0.00045249166,0.0002908149,0.010531282],"genre_scores_gemma":[0.9746106,0.000082473634,0.02335315,0.00009538366,0.000021934624,0.000076205186,0.00027587864,0.000048620852,0.0014357488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895966,0.00022482999,0.00010059114,0.0002857007,0.00021659849,0.0002126069],"domain_scores_gemma":[0.99262404,0.004113378,0.001018198,0.0011081491,0.00031917184,0.00081710255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089953863,0.00044127228,0.0005147907,0.0007640914,0.0005858654,0.001385226,0.0010573816,0.0006483581,0.0034363775],"category_scores_gemma":[0.0044950712,0.0004910429,0.00070243474,0.0010522782,0.0012332851,0.0020085224,0.0017150333,0.0011474245,0.00025767062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033162395,0.0006237054,0.0334926,0.00081178354,0.00030476495,0.0036648917,0.0018624337,0.2794922,0.18901744,0.3624965,0.0040659886,0.12085152],"study_design_scores_gemma":[0.00039175016,0.0006766548,0.020244421,0.00011369174,0.00023754913,0.0022836043,0.00093947485,0.4426916,0.06355884,0.4582021,0.010471701,0.00018866167],"about_ca_topic_score_codex":0.0010717859,"about_ca_topic_score_gemma":0.0013421106,"teacher_disagreement_score":0.0034363775,"about_ca_system_score_codex":0.00080700667,"about_ca_system_score_gemma":0.00037288162,"threshold_uncertainty_score":0.011495829},"labels":[],"label_agreement":null},{"id":"W3183008868","doi":"10.1007/s00373-021-02367-w","title":"Characterizing Bipartite Graphs Which Admit a k-NU Polymorphism via Absolute Retracts","year":2021,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Combinatorics; Unanimity; Homomorphism; Discrete mathematics; Graph","score_opus":0.017797393203278264,"score_gpt":0.2520450839134008,"score_spread":0.23424769071012252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183008868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76819,0.0002800736,0.19800165,0.0014211216,0.00008900881,0.00008783887,0.00053361355,0.0013523147,0.030044459],"genre_scores_gemma":[0.9740812,0.00011666832,0.019599298,0.00021994988,0.000053091244,0.00004890006,0.00035985807,0.0002720869,0.0052489107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790764,0.00049625826,0.00013455874,0.000674173,0.00037448536,0.0004129586],"domain_scores_gemma":[0.98931795,0.0060188905,0.0011669119,0.0019664185,0.0007102487,0.0008196763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018822638,0.00064052205,0.001098167,0.0015546425,0.0022078508,0.004767913,0.002339784,0.0022312626,0.005710641],"category_scores_gemma":[0.012012522,0.0009585018,0.001048251,0.002272496,0.0042438353,0.01032632,0.004470763,0.0036637539,0.000918128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038094845,0.00015646771,0.0058989143,0.00016454289,0.000031108877,0.00043435305,0.0017903605,0.007122296,0.009733102,0.9488583,0.0019378158,0.023491867],"study_design_scores_gemma":[0.000022435246,0.000055517492,0.0010114124,0.00004065242,0.00003352234,0.0006058779,0.0010413969,0.019601818,0.004397227,0.96972567,0.0034258068,0.000038689694],"about_ca_topic_score_codex":0.0009465087,"about_ca_topic_score_gemma":0.0010625361,"teacher_disagreement_score":0.005710641,"about_ca_system_score_codex":0.001281493,"about_ca_system_score_gemma":0.00092655787,"threshold_uncertainty_score":0.019103944},"labels":[],"label_agreement":null},{"id":"W3183334394","doi":"10.1016/j.dam.2023.05.031","title":"2-limited broadcast domination on grid graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Cartesian product; Upper and lower bounds; Grid; Combinatorics; Domination analysis; Path (computing); Duality (order theory); Product (mathematics); Chordal graph; Discrete mathematics; Graph; Computer science","score_opus":0.027219764993651266,"score_gpt":0.29709562731315275,"score_spread":0.2698758623195015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183334394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7418433,0.0008728398,0.18641989,0.0019179042,0.00014643751,0.0002365092,0.0015703854,0.00083169574,0.066161074],"genre_scores_gemma":[0.9691635,0.00038502028,0.014717043,0.00031621437,0.00008762519,0.00015100576,0.0005911641,0.00015155904,0.014437028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912554,0.000254185,0.00003919981,0.00017269612,0.00016629245,0.00024210458],"domain_scores_gemma":[0.9911261,0.0057173655,0.0009368318,0.000816526,0.000558615,0.0008445115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007783474,0.0005385705,0.0013351713,0.0013289384,0.0014931984,0.0022441829,0.001735146,0.0010226916,0.009508086],"category_scores_gemma":[0.006935921,0.00068098254,0.0006743444,0.0015869536,0.0013409915,0.002566946,0.0023323148,0.0014218809,0.000748183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012757471,0.00020537525,0.005059345,0.00068359677,0.00014419599,0.00113522,0.0012388241,0.09898361,0.014145523,0.82560056,0.01644,0.035087943],"study_design_scores_gemma":[0.00023752778,0.00006962025,0.0018144218,0.00006253647,0.00005220854,0.00065013417,0.0004081571,0.24198051,0.0028126484,0.7472698,0.004608247,0.00003420731],"about_ca_topic_score_codex":0.0033271667,"about_ca_topic_score_gemma":0.0037331423,"teacher_disagreement_score":0.009508086,"about_ca_system_score_codex":0.001352047,"about_ca_system_score_gemma":0.00081902585,"threshold_uncertainty_score":0.03180766},"labels":[],"label_agreement":null},{"id":"W3183510330","doi":"10.19086/aic.2022.5","title":"Extremal functions for sparse minors","year":2022,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Monash University; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; McGill University","keywords":"Combinatorics; Robertson–Seymour theorem; Mathematics; Graph minor; 1-planar graph; Discrete mathematics; Outerplanar graph; Planar graph; Pathwidth; Line graph; Block graph; Extremal graph theory; Voltage graph; Graph","score_opus":0.026082689526224213,"score_gpt":0.3059711866708144,"score_spread":0.2798884971445902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183510330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45737273,0.0040685697,0.43684375,0.0038072774,0.00045693736,0.00013333914,0.00093196053,0.0010409534,0.09534447],"genre_scores_gemma":[0.950172,0.0019502667,0.02697074,0.000607523,0.00065660564,0.00021418619,0.00079871336,0.00051674456,0.018113079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931717,0.00017507994,0.000028300372,0.00013758849,0.00015818994,0.0001836154],"domain_scores_gemma":[0.994819,0.0031060306,0.00055447366,0.00036415135,0.00048613377,0.0006702826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012705801,0.0012596623,0.001064883,0.0035349522,0.0011553614,0.002477727,0.001401503,0.0014109489,0.009220742],"category_scores_gemma":[0.012154175,0.0005253164,0.0012691487,0.001216476,0.0025552367,0.0038629123,0.0024806492,0.002612152,0.0011214783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081433645,0.000046041663,0.0015500713,0.0001416584,0.000029824329,0.00016273819,0.00027525093,0.008431112,0.002049274,0.9677213,0.0046492293,0.014862112],"study_design_scores_gemma":[0.000015738311,0.000039791674,0.0011948129,0.00006439379,0.000020332498,0.0002218995,0.00014059867,0.06504537,0.0009674275,0.9276679,0.0045874366,0.00003416137],"about_ca_topic_score_codex":0.0009990323,"about_ca_topic_score_gemma":0.0007847135,"teacher_disagreement_score":0.009220742,"about_ca_system_score_codex":0.0017131036,"about_ca_system_score_gemma":0.0004605196,"threshold_uncertainty_score":0.030846477},"labels":[],"label_agreement":null},{"id":"W3185054184","doi":"10.1007/978-3-030-79987-8_6","title":"All Subgraphs of a Wheel Are 5-Coupled-Choosable","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wheel graph; Computer science; Combinatorics; Planar graph; Treewidth; Vertex (graph theory); Graph; Discrete mathematics; Mathematics; Graph power; Pathwidth; Line graph","score_opus":0.024440167776545955,"score_gpt":0.27814393798431986,"score_spread":0.2537037702077739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185054184","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55250835,0.0005313633,0.15512466,0.0007224941,0.00042221174,0.0003965346,0.004855632,0.0013158004,0.284123],"genre_scores_gemma":[0.80537957,0.0005548383,0.054681513,0.00036811488,0.00006308337,0.00040441792,0.0058657457,0.0006881759,0.13199459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962425,0.000030559175,0.000018493602,0.00011316438,0.00007951364,0.00013402011],"domain_scores_gemma":[0.9993975,0.00015388125,0.00009033306,0.000108257525,0.00011587563,0.00013409826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015869038,0.00079118053,0.00072656956,0.0007461662,0.001284411,0.0016907398,0.0012947503,0.0008789523,0.028107008],"category_scores_gemma":[0.0006352727,0.0009210154,0.001155055,0.0010790583,0.00090827496,0.0016400394,0.0012361978,0.0012070806,0.0050854404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086028466,0.00024014553,0.0043539,0.0012150715,0.00025252797,0.0014181079,0.0011221309,0.012881806,0.081654586,0.7708841,0.028848201,0.09626911],"study_design_scores_gemma":[0.0002412056,0.00025615277,0.014366271,0.00026331787,0.0003907007,0.0019950343,0.0013582362,0.027580384,0.064946756,0.7673044,0.12115067,0.00014692498],"about_ca_topic_score_codex":0.0026788076,"about_ca_topic_score_gemma":0.0050448542,"teacher_disagreement_score":0.028107008,"about_ca_system_score_codex":0.0007852756,"about_ca_system_score_gemma":0.0006423184,"threshold_uncertainty_score":0.09402734},"labels":[],"label_agreement":null},{"id":"W3185146491","doi":"10.55016/ojs/cdm.v17i2.72680","title":"simplicity index of tournaments","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Simplicity; Combinatorics; Mathematics; Vertex (graph theory); Simple (philosophy); Index (typography); Class (philosophy); Discrete mathematics; Physics; Computer science; Graph; Philosophy","score_opus":0.017368946544547556,"score_gpt":0.3296349611501178,"score_spread":0.31226601460557024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185146491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89530206,0.0005094295,0.036440164,0.0003335841,0.000052992447,0.000072564355,0.00071529095,0.00014449639,0.066429436],"genre_scores_gemma":[0.9857906,0.00018885083,0.007662619,0.00006040273,0.00007336288,0.000056384397,0.0004888193,0.000031825755,0.0056470605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992248,0.00009589528,0.00005138184,0.000202134,0.00024383434,0.00018196373],"domain_scores_gemma":[0.99793696,0.00069188076,0.0005094683,0.00024186292,0.00015243255,0.00046740606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003978581,0.0003518704,0.00051819306,0.0012610602,0.0011771596,0.0018661229,0.00064378564,0.00047507882,0.0036765798],"category_scores_gemma":[0.0025077786,0.00032368297,0.0006106517,0.0012363514,0.0014255844,0.001437552,0.0011095464,0.000790413,0.00039951995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086057,0.00019650122,0.024780907,0.00025941056,0.0001325502,0.00075226574,0.001178592,0.028689308,0.034761835,0.83156985,0.0070630694,0.06975517],"study_design_scores_gemma":[0.00017631205,0.00071766303,0.04239371,0.000054839027,0.00010056454,0.002064981,0.00035625763,0.09366753,0.012526822,0.8150827,0.032727577,0.00013110098],"about_ca_topic_score_codex":0.0010081298,"about_ca_topic_score_gemma":0.0012472009,"teacher_disagreement_score":0.0036765798,"about_ca_system_score_codex":0.0012124481,"about_ca_system_score_gemma":0.00038008613,"threshold_uncertainty_score":0.012299418},"labels":[],"label_agreement":null},{"id":"W3185570678","doi":"10.1007/s00453-022-01010-1","title":"On the Kernel and Related Problems in Interval Digraphs","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Combinatorics; Mathematics; Vertex (graph theory); Interval (graph theory); Discrete mathematics; Cardinality (data modeling); Dominating set; Kernel (algebra); Graph; Theory of computation; Algorithm; Computer science","score_opus":0.014542216118628522,"score_gpt":0.25060119586709395,"score_spread":0.23605897974846543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185570678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35835117,0.0045508253,0.58286524,0.006232933,0.0003613667,0.00014469039,0.00075726496,0.0003401434,0.046396345],"genre_scores_gemma":[0.9043589,0.0036586982,0.06521203,0.0005473375,0.0008232341,0.00013526922,0.0007867039,0.00021552583,0.024262328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862266,0.0005520376,0.000083024956,0.00032552553,0.00021057614,0.00020618875],"domain_scores_gemma":[0.9849745,0.011641401,0.0009897262,0.00075534574,0.0007141727,0.00092487206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019454983,0.00069350493,0.0018599381,0.0029425218,0.002178273,0.0047216215,0.0031195,0.0025097271,0.009638257],"category_scores_gemma":[0.016040567,0.0008697606,0.0012980155,0.0041209753,0.0037101652,0.016737035,0.0033561846,0.0042217034,0.00081239024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007914211,0.00011773306,0.00076641905,0.00014556658,0.000016047998,0.000094156545,0.0004562924,0.007459678,0.00030537986,0.97566754,0.002303256,0.012588682],"study_design_scores_gemma":[0.000022009683,0.000019413403,0.00025103136,0.000028399596,0.000015756095,0.000079011996,0.00020646166,0.030495442,0.00016376881,0.9671222,0.0015827708,0.000013781743],"about_ca_topic_score_codex":0.002708311,"about_ca_topic_score_gemma":0.0019238656,"teacher_disagreement_score":0.009638257,"about_ca_system_score_codex":0.0020741818,"about_ca_system_score_gemma":0.0009225691,"threshold_uncertainty_score":0.032243133},"labels":[],"label_agreement":null},{"id":"W3186740737","doi":"10.1002/jgt.22829","title":"Polynomial bounds for chromatic number II: Excluding a star‐forest","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Star (game theory); Vertex (graph theory); Clique number; Chromatic scale; Statement (logic); Graph; Clique; Discrete mathematics","score_opus":0.02395129843768923,"score_gpt":0.3024701847071215,"score_spread":0.2785188862694323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186740737","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2501619,0.018458711,0.29448456,0.03356585,0.003201459,0.00028409608,0.0031270515,0.0025525987,0.39416388],"genre_scores_gemma":[0.9359565,0.004210396,0.031196805,0.0027507935,0.0031852117,0.0002249291,0.0014617577,0.0006320552,0.020381564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963882,0.00040627262,0.00007636993,0.0010594166,0.0007785076,0.0012913238],"domain_scores_gemma":[0.97151136,0.01983908,0.0013611022,0.0026421298,0.0017899022,0.0028564176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036888078,0.002277231,0.0020410283,0.0033660128,0.0029335609,0.0061880997,0.0046493514,0.0022241129,0.015979623],"category_scores_gemma":[0.019020593,0.0008392108,0.002423934,0.0028850273,0.005741399,0.01078029,0.005789445,0.009838641,0.0033029232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027867286,0.00077569456,0.012521905,0.0014621812,0.00028671903,0.0008736635,0.0009299422,0.09305696,0.018365178,0.72019815,0.08772231,0.061020635],"study_design_scores_gemma":[0.00020552598,0.00030101452,0.0045804586,0.0004704321,0.0002681679,0.0005639358,0.00027692452,0.22896168,0.0084511675,0.7301538,0.025623884,0.00014302041],"about_ca_topic_score_codex":0.007093694,"about_ca_topic_score_gemma":0.007151634,"teacher_disagreement_score":0.015979623,"about_ca_system_score_codex":0.0072591687,"about_ca_system_score_gemma":0.002654805,"threshold_uncertainty_score":0.05345714},"labels":[],"label_agreement":null},{"id":"W3187594655","doi":"10.1016/j.disc.2022.113108","title":"Mixing colourings in 2K2-free graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Chromatic scale; Social connectedness; Discrete mathematics","score_opus":0.021336088618649843,"score_gpt":0.28297028056507156,"score_spread":0.26163419194642173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187594655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8676859,0.00050406967,0.07277541,0.0019253351,0.00027694012,0.00013386075,0.00083467446,0.00089826674,0.054965626],"genre_scores_gemma":[0.9494032,0.00029440617,0.023577247,0.0005140154,0.000094582254,0.00016789304,0.0008172483,0.00045296617,0.024678288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998466,0.00035036364,0.00009041048,0.0003813976,0.0002879617,0.00042383978],"domain_scores_gemma":[0.99497825,0.0023610184,0.0006781361,0.0007640633,0.0003222911,0.0008962885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008805119,0.0009713443,0.0009628095,0.0019082578,0.0032849088,0.0045394767,0.001760236,0.0029150597,0.016847054],"category_scores_gemma":[0.004312542,0.0013663813,0.001039415,0.0020403233,0.0022998094,0.0051519484,0.003551024,0.0027017659,0.0021087192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006371147,0.00015016753,0.0019850114,0.00021919394,0.000052027688,0.0006843331,0.001616325,0.007909528,0.012057738,0.9516791,0.0053678104,0.017641542],"study_design_scores_gemma":[0.00011741915,0.000049234903,0.0011676541,0.00005673651,0.00004171337,0.00034474136,0.00046969677,0.018115966,0.0050335755,0.9691162,0.0054413807,0.000045702072],"about_ca_topic_score_codex":0.001487094,"about_ca_topic_score_gemma":0.0025594365,"teacher_disagreement_score":0.016847054,"about_ca_system_score_codex":0.0014619102,"about_ca_system_score_gemma":0.00068013516,"threshold_uncertainty_score":0.056358993},"labels":[],"label_agreement":null},{"id":"W3187953129","doi":"10.19086/aic.2022.8","title":"Local Girth Choosability of Planar Graphs","year":2022,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Planar graph; Conjecture; Vertex (graph theory); Graph; Girth (graph theory); Discrete mathematics; Planar; Computer science","score_opus":0.012289818736853081,"score_gpt":0.2865556997259913,"score_spread":0.27426588098913823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187953129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7682641,0.0008744796,0.19552544,0.0007142098,0.000047777852,0.000070406335,0.00040631706,0.0009832568,0.033113934],"genre_scores_gemma":[0.9802532,0.00054522237,0.013609563,0.00013714479,0.000057317633,0.000067427536,0.00037029764,0.000111891946,0.0048479163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995178,0.000061947634,0.000020184409,0.00014221382,0.0001350919,0.00012273715],"domain_scores_gemma":[0.9985415,0.00073698035,0.00023516317,0.00021410135,0.00009907856,0.00017325234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028785816,0.00034008257,0.0004347656,0.00075670786,0.0007485335,0.001232007,0.0009726556,0.0005410343,0.006631692],"category_scores_gemma":[0.0022740285,0.00047388574,0.00053146784,0.0011466122,0.0016734535,0.0019020332,0.0019094187,0.0013060438,0.00067572657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058112154,0.00012313263,0.008784972,0.0005655783,0.00006865276,0.0010042124,0.0014914611,0.06405596,0.054522116,0.7608313,0.0045888955,0.103382535],"study_design_scores_gemma":[0.00015202342,0.00031418083,0.00672175,0.00007601864,0.000102625396,0.0014437095,0.00065166334,0.07154255,0.03778427,0.85984635,0.021266557,0.00009824716],"about_ca_topic_score_codex":0.0010805957,"about_ca_topic_score_gemma":0.001052892,"teacher_disagreement_score":0.006631692,"about_ca_system_score_codex":0.0010058259,"about_ca_system_score_gemma":0.0003585062,"threshold_uncertainty_score":0.022185266},"labels":[],"label_agreement":null},{"id":"W3190183031","doi":"10.1090/jams/1047","title":"Reducing linear Hadwiger’s conjecture to coloring small graphs","year":2024,"lang":"lv","type":"article","venue":"Journal of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Combinatorics; Graph coloring; Discrete mathematics; Graph","score_opus":0.033742551943043014,"score_gpt":0.32666548164259224,"score_spread":0.29292292969954925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190183031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2561662,0.004033083,0.39057624,0.042808935,0.0038718982,0.00024535737,0.0025515174,0.0031095883,0.2966373],"genre_scores_gemma":[0.8591102,0.0017744891,0.060086,0.009759798,0.0024418281,0.0003784712,0.002173685,0.0011232891,0.063152246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969363,0.00099149,0.000080077574,0.0007680764,0.0005548338,0.0006690735],"domain_scores_gemma":[0.9881738,0.008092057,0.00043561196,0.0017618291,0.00088468334,0.0006520472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026952636,0.0014537334,0.0015501863,0.0015660027,0.0033356291,0.0034975805,0.0020692104,0.00292364,0.017445942],"category_scores_gemma":[0.017266823,0.0009699691,0.0020994523,0.0020716812,0.006274117,0.008241849,0.004919678,0.007202126,0.003411613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018034515,0.000068065085,0.00086483196,0.00018557903,0.000033687815,0.00013474406,0.0005522884,0.008434561,0.000658187,0.9533979,0.024950529,0.0105391415],"study_design_scores_gemma":[0.000039084214,0.000014936736,0.0001248614,0.000022377195,0.000012256992,0.000029997818,0.000079999525,0.008135781,0.00034371126,0.98626685,0.0049177585,0.000012417402],"about_ca_topic_score_codex":0.0077407886,"about_ca_topic_score_gemma":0.008715738,"teacher_disagreement_score":0.017445942,"about_ca_system_score_codex":0.005441238,"about_ca_system_score_gemma":0.0021869692,"threshold_uncertainty_score":0.058362544},"labels":[],"label_agreement":null},{"id":"W3193424040","doi":"10.1002/jgt.22862","title":"Polynomial bounds for chromatic number. III. Excluding a double star","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Division of Mathematical Sciences; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Star (game theory); Conjecture; Chromatic scale; Clique; Stars; Tree (set theory); Polynomial; Function (biology); Chromatic polynomial; Discrete mathematics; Physics; Astrophysics","score_opus":0.03039541251985209,"score_gpt":0.3161732757768858,"score_spread":0.2857778632570337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193424040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21579804,0.015756225,0.4044952,0.028247377,0.0022272188,0.0002811492,0.0025696433,0.0019387476,0.32868633],"genre_scores_gemma":[0.91918546,0.0043406384,0.045899983,0.002536308,0.0023289844,0.00022465245,0.0011922877,0.0006136221,0.023678096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971929,0.00032007115,0.00006639619,0.0008060013,0.0006142697,0.0010003488],"domain_scores_gemma":[0.9828198,0.010989259,0.0009772012,0.0021452315,0.0012617109,0.001806697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034416968,0.0019217957,0.0017311554,0.0026502046,0.0028561756,0.005421878,0.004361941,0.0021719807,0.015619481],"category_scores_gemma":[0.01567983,0.0006349924,0.0019620012,0.0029725034,0.005171289,0.009019866,0.0051310263,0.0070803063,0.0031338986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017615183,0.0005595414,0.0068148295,0.0013277759,0.00017644532,0.0006190686,0.0007505422,0.068888344,0.017642278,0.7741796,0.055003617,0.072276466],"study_design_scores_gemma":[0.00012978907,0.00017491014,0.0029269275,0.0003501572,0.00017595176,0.00064098317,0.00022148808,0.18867013,0.009636752,0.7711752,0.025792344,0.0001054018],"about_ca_topic_score_codex":0.0047533475,"about_ca_topic_score_gemma":0.005017354,"teacher_disagreement_score":0.015619481,"about_ca_system_score_codex":0.005603257,"about_ca_system_score_gemma":0.0023288557,"threshold_uncertainty_score":0.05225241},"labels":[],"label_agreement":null},{"id":"W3193864805","doi":"10.4230/lipics.esa.2021.58","title":"QCSP on Reflexive Tournaments","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Tournament; Mathematics; Constraint satisfaction problem; Graph; Statistics","score_opus":0.030196304247193714,"score_gpt":0.3282804791982487,"score_spread":0.298084174951055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193864805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18183048,0.0010012811,0.7858038,0.0038521038,0.0002519978,0.00039962004,0.0023317034,0.0010466796,0.02348246],"genre_scores_gemma":[0.7698987,0.0009005349,0.21232247,0.0012511844,0.00042516398,0.0005515916,0.0036109292,0.00029078967,0.010748651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966371,0.00086111523,0.00022776636,0.0008974841,0.0007736486,0.000602878],"domain_scores_gemma":[0.99032193,0.0065483777,0.0007920916,0.00095119904,0.0008000722,0.0005864203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018943064,0.0009815819,0.0011756496,0.0008250272,0.0012594049,0.0037124748,0.0020108884,0.001223714,0.008842974],"category_scores_gemma":[0.008922559,0.000515152,0.0018158159,0.0021768473,0.0018889604,0.0046243113,0.002862545,0.0037639365,0.0005709766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005657702,0.0004460488,0.002068418,0.000908436,0.00028296333,0.00079745264,0.0008676272,0.21802829,0.008683528,0.68746436,0.012597455,0.06728968],"study_design_scores_gemma":[0.00014071276,0.00009977438,0.0005051187,0.00004912395,0.0000622501,0.00019595648,0.000117543896,0.37978864,0.0017838094,0.61130744,0.005911964,0.000037644746],"about_ca_topic_score_codex":0.0047309347,"about_ca_topic_score_gemma":0.003186822,"teacher_disagreement_score":0.008842974,"about_ca_system_score_codex":0.0020223083,"about_ca_system_score_gemma":0.001378805,"threshold_uncertainty_score":0.02958268},"labels":[],"label_agreement":null},{"id":"W3195612562","doi":"10.1002/jgt.22890","title":"Orientation‐based edge‐colorings and linear arboricity of multigraphs","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Edge coloring; Combinatorics; Mathematics; Arboricity; Multigraph; Conjecture; Simple (philosophy); Upper and lower bounds; Vertex (graph theory); List coloring; Chromatic scale; Discrete mathematics; Graph; Planar graph","score_opus":0.017925671157843062,"score_gpt":0.28816652436230056,"score_spread":0.2702408532044575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195612562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93441874,0.00017896498,0.04923608,0.0001972836,0.000022964212,0.000020144375,0.0001505403,0.00012813773,0.015647097],"genre_scores_gemma":[0.9926801,0.000066390865,0.0059314785,0.000037927173,0.00001621541,0.000011058697,0.00008253003,0.000015768583,0.0011586908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998018,0.000036257894,0.000012189488,0.000048945287,0.000048490947,0.000052306958],"domain_scores_gemma":[0.9982291,0.0007483062,0.00045417526,0.00019525649,0.00016214278,0.00021093605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023408537,0.00022367682,0.00020739784,0.00081315776,0.0005283061,0.0009255123,0.00041371325,0.00027792787,0.0022318284],"category_scores_gemma":[0.0014935511,0.0001995525,0.00021536073,0.00092835614,0.00083035516,0.00093074335,0.00062295055,0.0005474279,0.00015173946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040372834,0.00019057897,0.029263755,0.00023096283,0.00006498169,0.0007221999,0.0010422138,0.068346985,0.05946514,0.7848006,0.0042314646,0.051237486],"study_design_scores_gemma":[0.000060660313,0.00012686598,0.019959142,0.000058722155,0.000049898197,0.00069600047,0.0005024816,0.23518409,0.017670097,0.7194516,0.00618968,0.000050817416],"about_ca_topic_score_codex":0.0015208957,"about_ca_topic_score_gemma":0.0028555265,"teacher_disagreement_score":0.0022318284,"about_ca_system_score_codex":0.0007831939,"about_ca_system_score_gemma":0.00021994163,"threshold_uncertainty_score":0.0074662566},"labels":[],"label_agreement":null},{"id":"W3196344216","doi":"10.1016/j.jctb.2023.10.005","title":"Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Bounded function; Disjoint sets; Discrete mathematics; Degree (music); Conjecture; Vertex (graph theory); Clique-sum; 1-planar graph; Induced subgraph; Graph; Pathwidth; Chordal graph; Line graph","score_opus":0.035810595052561615,"score_gpt":0.2923976960918472,"score_spread":0.25658710103928556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196344216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81796896,0.0010541661,0.15165803,0.0007261437,0.000058850153,0.000096122516,0.0007560763,0.00030784457,0.027373714],"genre_scores_gemma":[0.9360144,0.0008917259,0.047679875,0.0002372543,0.000080008416,0.00014975977,0.0013679279,0.00018173389,0.013397311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999765,0.000059788817,0.000012004759,0.000053593274,0.000042606905,0.00006707457],"domain_scores_gemma":[0.99843246,0.00076829945,0.00032471822,0.00009857486,0.00013011745,0.0002458647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027795145,0.00037780104,0.00045528205,0.0014181054,0.00090617104,0.0024854194,0.0006449635,0.00089185603,0.0059349476],"category_scores_gemma":[0.0018799012,0.00067185896,0.00062309246,0.0014090623,0.0011345277,0.0022485584,0.0009512745,0.0014566116,0.0008423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012197462,0.000081061444,0.0031731122,0.00011089109,0.000017745637,0.00028386034,0.000995328,0.0071916943,0.007434376,0.9598602,0.003080721,0.01764908],"study_design_scores_gemma":[0.000029420898,0.00004420966,0.0027224955,0.000057259913,0.000023807941,0.00030494688,0.0007760121,0.040382944,0.0021711278,0.94956994,0.0038984315,0.000019371673],"about_ca_topic_score_codex":0.0009981827,"about_ca_topic_score_gemma":0.0014569889,"teacher_disagreement_score":0.0059349476,"about_ca_system_score_codex":0.00046098567,"about_ca_system_score_gemma":0.00030282987,"threshold_uncertainty_score":0.019854426},"labels":[],"label_agreement":null},{"id":"W3196808644","doi":"10.1016/j.dam.2023.05.030","title":"A linear-time algorithm for semitotal domination in strongly chordal graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Chordal graph; Mathematics; Dominating set; Combinatorics; Time complexity; Vertex (graph theory); Maximal independent set; Bipartite graph; Interval graph; Discrete mathematics; Graph; 1-planar graph","score_opus":0.01700210038948882,"score_gpt":0.29841595928583475,"score_spread":0.28141385889634596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196808644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22261682,0.0005649836,0.7376029,0.0016082634,0.0002297699,0.001047436,0.0024387876,0.010179107,0.023711927],"genre_scores_gemma":[0.49425125,0.00021076055,0.488471,0.00036613012,0.00010988963,0.00050704216,0.0041305074,0.00097450597,0.01097896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987134,0.00017487773,0.00008571898,0.0004134489,0.0003007572,0.000311874],"domain_scores_gemma":[0.99557036,0.0023839364,0.0002143836,0.0009916179,0.00044800597,0.00039176483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009254532,0.0014149365,0.0015028521,0.0011831084,0.0017925176,0.002398939,0.00397444,0.0013701159,0.011832937],"category_scores_gemma":[0.003562641,0.0007090059,0.0014359136,0.0019153384,0.001256317,0.0045241327,0.0046212813,0.0019123608,0.0020118868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025074629,0.0009442768,0.0045688837,0.0014359447,0.0002694016,0.0003263386,0.0012372104,0.11073314,0.049192607,0.0592744,0.035799526,0.7337108],"study_design_scores_gemma":[0.0008699685,0.00037169558,0.001496145,0.0000674395,0.00017645145,0.00028886044,0.000653241,0.8054613,0.020188162,0.16113669,0.009213695,0.000076252836],"about_ca_topic_score_codex":0.0066782157,"about_ca_topic_score_gemma":0.0130844675,"teacher_disagreement_score":0.011832937,"about_ca_system_score_codex":0.0025953972,"about_ca_system_score_gemma":0.0034187525,"threshold_uncertainty_score":0.039585054},"labels":[],"label_agreement":null},{"id":"W3197412015","doi":"","title":"A quadratic lower bound for homogeneous algebraic branching programs.","year":2017,"lang":"en","type":"article","venue":"Electron. Colloquium Comput. Complex.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Branching (polymer chemistry); Homogeneous; Algebraic number; Quadratic equation; Mathematics; Upper and lower bounds; Combinatorics; Mathematical analysis; Geometry","score_opus":0.03957557006918323,"score_gpt":0.3268838666114183,"score_spread":0.28730829654223505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197412015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07369078,0.0048983614,0.7389027,0.012867545,0.00092376914,0.00045720424,0.003039058,0.0031910758,0.16202945],"genre_scores_gemma":[0.63730407,0.004130785,0.2680099,0.0063532237,0.0028949233,0.0010822833,0.0062117563,0.0029298975,0.07108309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925194,0.0010817858,0.00026645954,0.0014500666,0.0025227582,0.002159526],"domain_scores_gemma":[0.9694568,0.022520576,0.0012059866,0.0031217881,0.0020747038,0.0016201586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004333882,0.002071565,0.0018262446,0.0019543346,0.0025697043,0.0050316,0.0054970817,0.0019270435,0.038127765],"category_scores_gemma":[0.024787955,0.0009662824,0.0027228943,0.0030706383,0.0039501037,0.016121015,0.006828934,0.009760454,0.007055108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001939479,0.000924777,0.005213711,0.0017840415,0.00023892304,0.0006227894,0.00077558256,0.077291414,0.012802088,0.67330897,0.07115005,0.15394811],"study_design_scores_gemma":[0.00019123215,0.00032057567,0.0013675148,0.00013965102,0.00019897344,0.00041444885,0.00012781411,0.29007083,0.004145083,0.680187,0.022771377,0.000065544686],"about_ca_topic_score_codex":0.0035877323,"about_ca_topic_score_gemma":0.005410571,"teacher_disagreement_score":0.038127765,"about_ca_system_score_codex":0.005282439,"about_ca_system_score_gemma":0.0036120934,"threshold_uncertainty_score":0.12755},"labels":[],"label_agreement":null},{"id":"W3197431324","doi":"10.48550/arxiv.2108.12880","title":"Five-List-Coloring Graphs on Surfaces: The Many Faces Far-Apart Generalization of Thomassen's Theorem","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Generalization; Vertex (graph theory); Graph; Mathematical analysis","score_opus":0.06828174157408821,"score_gpt":0.2251705384891648,"score_spread":0.15688879691507657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197431324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30633655,0.0015060569,0.53693485,0.0046551838,0.00082453474,0.00009413788,0.00050977455,0.0012240979,0.14791484],"genre_scores_gemma":[0.85265887,0.001419176,0.117462285,0.0020603726,0.00047082602,0.00013601364,0.00058009767,0.00043851233,0.024773818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990318,0.00016439623,0.000039222457,0.00031232293,0.00023032387,0.00022201655],"domain_scores_gemma":[0.9975489,0.0011969054,0.00015975938,0.00059399655,0.00026614516,0.00023435947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000801067,0.00057996425,0.00088596233,0.0010242229,0.0026101128,0.001899634,0.0019083268,0.001377324,0.00706872],"category_scores_gemma":[0.0034870165,0.0005821424,0.0018057043,0.0014454832,0.0035320746,0.005841592,0.0029775584,0.0034364935,0.0010550673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055604476,0.000022989932,0.0006300215,0.00006954147,0.000015452473,0.000108448294,0.0003793945,0.007442206,0.0013992776,0.97119313,0.004579196,0.014104628],"study_design_scores_gemma":[0.000020355255,0.00003057067,0.0004546849,0.00002495529,0.000027591079,0.0002554871,0.00020314308,0.02582477,0.001531601,0.95705223,0.014546143,0.000028498205],"about_ca_topic_score_codex":0.0040173503,"about_ca_topic_score_gemma":0.004109418,"teacher_disagreement_score":0.00706872,"about_ca_system_score_codex":0.0026140357,"about_ca_system_score_gemma":0.00081626076,"threshold_uncertainty_score":0.023647249},"labels":[],"label_agreement":null},{"id":"W3197468490","doi":"10.48550/arxiv.2109.00327","title":"Universality in minor-closed graph classes","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; European Commission","keywords":"Mathematics; Combinatorics; Countable set; Discrete mathematics; Planar graph; Cubic graph; Graph; Line graph; Voltage graph","score_opus":0.08924809177513338,"score_gpt":0.22465256734945893,"score_spread":0.13540447557432556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197468490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72697854,0.0008753989,0.2141889,0.0018648978,0.00008436057,0.000109263805,0.00073921366,0.0013655274,0.053793974],"genre_scores_gemma":[0.9695229,0.00028010653,0.021994382,0.00021856741,0.000079656056,0.000079383426,0.00057190034,0.0001858779,0.007067218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870265,0.00017780448,0.00006124521,0.0006339273,0.00019998112,0.00022435281],"domain_scores_gemma":[0.99695134,0.0015846901,0.00026847358,0.0005519248,0.00025726386,0.000386278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007635255,0.00045610828,0.00082851795,0.0013149525,0.0017174638,0.0024444656,0.0012893062,0.0007635029,0.0057190675],"category_scores_gemma":[0.0038644942,0.00064489036,0.0013827084,0.00087518,0.0039411946,0.005634311,0.0029953967,0.0017342954,0.0004650761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063775326,0.000028553577,0.001401851,0.00007323713,0.000018705565,0.00010866317,0.0009577258,0.0019874568,0.0028947513,0.98163396,0.0010082162,0.0098230755],"study_design_scores_gemma":[0.000024846899,0.000030271029,0.00085356575,0.000018864992,0.00001937379,0.00019280886,0.0002204369,0.0059026014,0.0017051718,0.9830403,0.007975816,0.000016124406],"about_ca_topic_score_codex":0.0018491459,"about_ca_topic_score_gemma":0.0017914361,"teacher_disagreement_score":0.0057190675,"about_ca_system_score_codex":0.0017330709,"about_ca_system_score_gemma":0.00038513925,"threshold_uncertainty_score":0.019132197},"labels":[],"label_agreement":null},{"id":"W3197941146","doi":"10.19086/aic.2022.6","title":"Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth","year":2022,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Treewidth; Mathematics; Discrete mathematics; Logarithm; Pathwidth; Tree-depth; Conjecture; Induced subgraph; Cograph; Clique-sum; Distance-hereditary graph; Induced path; Chordal graph; Partial k-tree; Graph; 1-planar graph; Vertex (graph theory); Line graph; Graph power","score_opus":0.013977358339436596,"score_gpt":0.2812867664249737,"score_spread":0.2673094080855371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197941146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6750628,0.005022566,0.2681451,0.0036839093,0.00009734298,0.000106327934,0.0016241183,0.0008416266,0.045416202],"genre_scores_gemma":[0.9433286,0.0016866768,0.046906456,0.00046764995,0.00012718106,0.000102093596,0.0014520045,0.00016786586,0.0057614436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945325,0.00009169188,0.000020974263,0.00017971722,0.00012801608,0.00012640152],"domain_scores_gemma":[0.99665415,0.001978094,0.0005192233,0.00046014192,0.00018552909,0.0002027988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005233163,0.00043365484,0.0004088881,0.00082771387,0.0007045853,0.0016495702,0.0009254616,0.000561782,0.0038769247],"category_scores_gemma":[0.0036487055,0.00047146974,0.00069188763,0.0018440385,0.0016193729,0.0031495763,0.0010920345,0.0015241106,0.00046762437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004965826,0.00019810688,0.008583459,0.00047384299,0.00008188363,0.00047225348,0.0010453183,0.062235728,0.02298362,0.8025317,0.012892022,0.08800548],"study_design_scores_gemma":[0.000054682307,0.000053002135,0.0032008414,0.00005417507,0.000045312652,0.0006186232,0.00022387374,0.06923931,0.006151315,0.91072255,0.00961577,0.00002060553],"about_ca_topic_score_codex":0.0022337397,"about_ca_topic_score_gemma":0.0023474512,"teacher_disagreement_score":0.0038769247,"about_ca_system_score_codex":0.0018183828,"about_ca_system_score_gemma":0.00046564854,"threshold_uncertainty_score":0.013193369},"labels":[],"label_agreement":null},{"id":"W3198239652","doi":"10.1016/j.disc.2022.112869","title":"Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Induced subgraph; Hamiltonian path; Distance-hereditary graph; Indifference graph; Pancyclic graph; Induced path; Cograph; Discrete mathematics; Chordal graph; Hamiltonian path problem; Pathwidth; Induced subgraph isomorphism problem; Vertex (graph theory); Longest path problem; Line graph; Graph; Graph power; Voltage graph","score_opus":0.02732548057777925,"score_gpt":0.3102251781203765,"score_spread":0.28289969754259725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198239652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9634425,0.00027994445,0.011254468,0.00049618905,0.00002975584,0.00006171431,0.0006416588,0.00009971005,0.023694104],"genre_scores_gemma":[0.9890876,0.00015109796,0.0048190434,0.00012787394,0.000035797577,0.00006676907,0.0013836324,0.000036016187,0.0042920858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960154,0.00006890638,0.000020102378,0.00012140038,0.00008753636,0.00010046445],"domain_scores_gemma":[0.99854124,0.00066608394,0.0003046213,0.00010329022,0.00009428156,0.00029049627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002495378,0.0005209429,0.00056960864,0.0016127724,0.0011535996,0.0020870017,0.001285456,0.0010729439,0.008544609],"category_scores_gemma":[0.0013867881,0.00059022446,0.00057324005,0.0010217323,0.00094160304,0.0016098828,0.0010149557,0.00094680773,0.00035041472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011011662,0.0006733522,0.016576666,0.0006197588,0.000141861,0.0024032823,0.0031409494,0.0065204655,0.038750842,0.89011574,0.0075001046,0.032455795],"study_design_scores_gemma":[0.00038906967,0.0001930109,0.042700086,0.00013575106,0.00022145528,0.0027547067,0.0018951012,0.04835307,0.011343119,0.8793634,0.0125947,0.00005668042],"about_ca_topic_score_codex":0.00072957703,"about_ca_topic_score_gemma":0.0013205971,"teacher_disagreement_score":0.008544609,"about_ca_system_score_codex":0.00084820524,"about_ca_system_score_gemma":0.0003514723,"threshold_uncertainty_score":0.02858454},"labels":[],"label_agreement":null},{"id":"W3198462604","doi":"10.1137/21m1443352","title":"Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Induced subgraph; Discrete mathematics; Complete coloring; Integer (computer science); Graph; Time complexity; Fractional coloring; List coloring; Graph power; Computer science; Line graph","score_opus":0.0753537972018547,"score_gpt":0.32949796142603377,"score_spread":0.25414416422417907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198462604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53068167,0.004342934,0.30534664,0.043803472,0.0009258288,0.00072780205,0.015459364,0.004618332,0.09409397],"genre_scores_gemma":[0.8688168,0.0019452758,0.097296104,0.004924869,0.0012296604,0.0008783579,0.009674263,0.0006937576,0.014540847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546295,0.0011183555,0.00018365149,0.0011419749,0.0008642757,0.0012287571],"domain_scores_gemma":[0.98030543,0.015397942,0.0009733158,0.0017489035,0.00061764935,0.0009567927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026463468,0.0015729571,0.0021844048,0.0010459098,0.0023173387,0.0074378783,0.003502162,0.0030372792,0.013928664],"category_scores_gemma":[0.010324654,0.00091288367,0.002926682,0.0015617211,0.0022526262,0.0099476455,0.003341803,0.0063684206,0.0019316081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032025087,0.0015360625,0.005498138,0.0021832779,0.0004928336,0.0006569734,0.0012705413,0.1718951,0.014918004,0.6102425,0.11034348,0.0777607],"study_design_scores_gemma":[0.00044891273,0.00015630298,0.0015269031,0.00011532459,0.00015744432,0.00030123632,0.0002635418,0.38100678,0.002768895,0.60511667,0.008060369,0.00007765842],"about_ca_topic_score_codex":0.0036265962,"about_ca_topic_score_gemma":0.0038818002,"teacher_disagreement_score":0.013928664,"about_ca_system_score_codex":0.0064331717,"about_ca_system_score_gemma":0.004758527,"threshold_uncertainty_score":0.04667616},"labels":[],"label_agreement":null},{"id":"W3202012722","doi":"10.4086/toc.2021.v017a009","title":"","year":2021,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Leibniz-Gemeinschaft; Simons Institute for the Theory of Computing, University of California Berkeley; Banff International Research Station for Mathematical Innovation and Discovery; Mathematisches Forschungsinstitut Oberwolfach; Johns Hopkins University; National Science Foundation","keywords":"Combinatorics; Mathematics; Bounded function; Eigenvalues and eigenvectors; Vertex (graph theory); Omega; Binary logarithm; Discrete mathematics; Random graph; Graph","score_opus":0.02864492533377073,"score_gpt":0.3065202544915342,"score_spread":0.2778753291577635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202012722","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27034688,0.0013144731,0.5924855,0.0113617685,0.0005472507,0.0003585301,0.0048151747,0.0020934965,0.11667692],"genre_scores_gemma":[0.8870776,0.0005943105,0.095919475,0.0012080774,0.00011357401,0.00019558848,0.0016750674,0.0001312921,0.013084993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966073,0.00008244899,0.000006481078,0.00010363012,0.00006825243,0.00007846523],"domain_scores_gemma":[0.9987148,0.00059240963,0.00012335656,0.00032985615,0.00013373814,0.00010586856],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039204195,0.0003414646,0.00028346496,0.00040192754,0.00053841446,0.0006609594,0.0005663526,0.0005716308,0.0076030223],"category_scores_gemma":[0.0032897869,0.00014748801,0.00024000519,0.00033670766,0.00068348704,0.00112424,0.0006677398,0.0007570436,0.0020062497],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032850108,0.0001945653,0.005437164,0.0002291335,0.00006635204,0.0004788979,0.00014902653,0.04373947,0.01867789,0.8288433,0.038683876,0.06317179],"study_design_scores_gemma":[0.00006352633,0.00016263577,0.0030410858,0.00004158545,0.000028504879,0.0006370381,0.00012036729,0.25362614,0.008440333,0.67199135,0.061810035,0.000037423884],"about_ca_topic_score_codex":0.001210164,"about_ca_topic_score_gemma":0.0020612755,"teacher_disagreement_score":0.99239695,"about_ca_system_score_codex":0.000617143,"about_ca_system_score_gemma":0.00048119793,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3202928722","doi":"","title":"A survey on alliances in graphs: Defensive alliances","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Alliance; Realizability; Vertex (graph theory); Graph; Mathematics; Combinatorics; Computer science; Geography; Algorithm","score_opus":0.08717187670400472,"score_gpt":0.3625151750718749,"score_spread":0.2753432983678702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202928722","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06549171,0.38186604,0.36309913,0.013523072,0.00180216,0.0001827917,0.0021578074,0.00053289987,0.17134447],"genre_scores_gemma":[0.38781163,0.44692323,0.1293094,0.0035287195,0.005973436,0.00043623164,0.0039480454,0.00042954364,0.02163979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982533,0.0004657203,0.00013922495,0.0005282119,0.0004252966,0.00018818624],"domain_scores_gemma":[0.9962119,0.0026520537,0.00025446873,0.0004202608,0.00028571344,0.00017562973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012978425,0.0012321167,0.0015454722,0.003421678,0.0017144865,0.004779015,0.0019355835,0.0020165988,0.007360709],"category_scores_gemma":[0.004791434,0.00094636035,0.0015077716,0.009748046,0.0028942053,0.013852441,0.002155777,0.0032153288,0.0018157682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060192637,0.000091103815,0.0022189834,0.0022604822,0.00007083003,0.00018162305,0.0006310556,0.0073195007,0.0006395815,0.8533604,0.019732477,0.11343374],"study_design_scores_gemma":[0.000015060317,0.00007122086,0.002086513,0.0006874277,0.00007223874,0.0015066438,0.0005304481,0.010723122,0.00052915415,0.8140213,0.1697046,0.00005224856],"about_ca_topic_score_codex":0.0015492315,"about_ca_topic_score_gemma":0.0012904236,"teacher_disagreement_score":0.007360709,"about_ca_system_score_codex":0.0022627003,"about_ca_system_score_gemma":0.0011966081,"threshold_uncertainty_score":0.02462399},"labels":[],"label_agreement":null},{"id":"W3204767113","doi":"10.1007/s00493-023-00015-w","title":"Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Algorithm; Mathematics","score_opus":0.03349660689747145,"score_gpt":0.32149013006570326,"score_spread":0.2879935231682318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204767113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18972601,0.008124018,0.4460232,0.028752357,0.0017913886,0.0005450206,0.004529057,0.0036646724,0.31684425],"genre_scores_gemma":[0.840994,0.0042950995,0.09046254,0.004123172,0.0027773834,0.0006221842,0.003679516,0.0019834172,0.051062725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944494,0.0006948233,0.00011681837,0.0014197474,0.0014171773,0.0019021997],"domain_scores_gemma":[0.9801379,0.012803353,0.0009160678,0.0026068361,0.0013848935,0.0021510164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003671823,0.0026110802,0.0020155187,0.0034204733,0.0044285585,0.007144355,0.0055103847,0.00248017,0.02914331],"category_scores_gemma":[0.015561623,0.0010373549,0.0034494023,0.0038624771,0.0058834474,0.012478202,0.005716839,0.012561743,0.0059685386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003370873,0.0011317746,0.0072355005,0.0014689601,0.00024304148,0.0007672411,0.0010385441,0.105460234,0.024849618,0.65820175,0.09597529,0.10025729],"study_design_scores_gemma":[0.00028305757,0.00039463595,0.003415982,0.00034546602,0.00031972374,0.0005694829,0.00032672368,0.22642246,0.011776297,0.7185719,0.037415713,0.00015850825],"about_ca_topic_score_codex":0.00977154,"about_ca_topic_score_gemma":0.012517412,"teacher_disagreement_score":0.02914331,"about_ca_system_score_codex":0.008639129,"about_ca_system_score_gemma":0.0039461134,"threshold_uncertainty_score":0.097494066},"labels":[],"label_agreement":null},{"id":"W3205515510","doi":"10.5614/ejgta.2022.10.2.19","title":"Eternal domination and clique covering","year":2022,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Circulant matrix; Split graph; Discrete mathematics; Vertex (graph theory); Domination analysis; Dominating set; Circulant graph; Clique number; Chordal graph; Clique; Graph; Line graph; 1-planar graph; Graph power","score_opus":0.00545523863843947,"score_gpt":0.26256846333263,"score_spread":0.2571132246941905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205515510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8671671,0.00027686905,0.113890536,0.00023060408,0.000012686116,0.00002293768,0.0002064978,0.000110196655,0.018082432],"genre_scores_gemma":[0.9886579,0.000090823356,0.009864953,0.000018450055,0.000011917591,0.000015984866,0.00010891873,0.0000165407,0.0012145063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945825,0.00012512304,0.000016404732,0.00014501727,0.00014787001,0.00010728818],"domain_scores_gemma":[0.99423826,0.0036693225,0.000862754,0.0005791146,0.00033641583,0.0003142514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059651124,0.0002305454,0.00029855306,0.0014029894,0.0006544022,0.00080017885,0.0006816952,0.00024875774,0.0026651642],"category_scores_gemma":[0.0061519365,0.00016141986,0.00032223645,0.00090365816,0.0013830358,0.0016100208,0.00073258154,0.00048670612,0.00011826615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037196826,0.00010884293,0.03047504,0.0001567791,0.000081678336,0.00040051824,0.0006284167,0.13800474,0.026394458,0.7624129,0.0015761977,0.039388392],"study_design_scores_gemma":[0.000041837633,0.00012469845,0.016704522,0.000032111602,0.000046238725,0.0008440629,0.0002599609,0.45893222,0.015072104,0.5006556,0.007240169,0.00004654013],"about_ca_topic_score_codex":0.0015481624,"about_ca_topic_score_gemma":0.0017317836,"teacher_disagreement_score":0.0026651642,"about_ca_system_score_codex":0.0006812198,"about_ca_system_score_gemma":0.00025002842,"threshold_uncertainty_score":0.008915842},"labels":[],"label_agreement":null},{"id":"W3206226465","doi":"10.1016/j.disc.2021.112679","title":"Serial exchanges in matroids","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Thompson Rivers University","keywords":"Matroid; Combinatorics; Mathematics; Conjecture; Rank (graph theory); Binary number; Set (abstract data type); Discrete mathematics; Arithmetic; Computer science","score_opus":0.028078970645199982,"score_gpt":0.3088374225669366,"score_spread":0.2807584519217366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206226465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5373836,0.0010716944,0.24710238,0.0042481623,0.00054785964,0.0001503364,0.0006469688,0.0006990748,0.20814987],"genre_scores_gemma":[0.89925563,0.00080290646,0.025539499,0.0006276525,0.0005121387,0.00013051239,0.00053563045,0.0003324995,0.07226362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988262,0.00042579707,0.0000792503,0.00021275353,0.00028131634,0.00017461632],"domain_scores_gemma":[0.9949451,0.0025393437,0.00073654234,0.00077792373,0.0004395428,0.00056153437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012779484,0.0007317889,0.0010854908,0.0019971118,0.0028155472,0.004201077,0.0014124742,0.0018451043,0.01833886],"category_scores_gemma":[0.005826298,0.00084347615,0.000992113,0.003220812,0.0027415128,0.009496544,0.0025004654,0.0035271186,0.001608955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048435908,0.00003360434,0.00016138716,0.00002527444,0.000005773249,0.00009015202,0.0002079238,0.0013869263,0.0003353869,0.992065,0.001462513,0.0041776192],"study_design_scores_gemma":[0.000015944684,0.000011088697,0.000089927344,0.000007141003,0.0000064667465,0.000074814554,0.00005952315,0.0045731524,0.00023336326,0.9928596,0.0020644723,0.0000045846214],"about_ca_topic_score_codex":0.0008222676,"about_ca_topic_score_gemma":0.0009535685,"teacher_disagreement_score":0.01833886,"about_ca_system_score_codex":0.0013112157,"about_ca_system_score_gemma":0.0005207818,"threshold_uncertainty_score":0.06134957},"labels":[],"label_agreement":null},{"id":"W3206275166","doi":"","title":"A method for proving lower bounds for the 2-limited broadcast domination number on grid graphs","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cartesian product; Grid; Upper and lower bounds; Path (computing); Product (mathematics); Mathematics; Computer science; Yield (engineering); Cartesian coordinate system; Combinatorics; Discrete mathematics; Computer network; Geometry; Physics","score_opus":0.08241547423905698,"score_gpt":0.2687666741549569,"score_spread":0.18635119991589993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206275166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017118506,0.0009794326,0.96059555,0.00088181224,0.0001785742,0.00015890582,0.00054500217,0.0008803523,0.018661957],"genre_scores_gemma":[0.4996131,0.0031903926,0.47866228,0.0012667899,0.0010096504,0.002077696,0.0021966114,0.0011308653,0.0108525595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963182,0.0009055981,0.00017549124,0.0006589403,0.0014876218,0.00045408943],"domain_scores_gemma":[0.9703204,0.02263888,0.0011788199,0.003555053,0.001626175,0.0006806548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040862607,0.0027021077,0.002048089,0.004920551,0.0016574764,0.0035826098,0.003990826,0.0014210328,0.01158998],"category_scores_gemma":[0.024233373,0.0011230231,0.0026530179,0.0045476463,0.00341304,0.0067973966,0.0051081693,0.007794003,0.002629476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005900961,0.00039945386,0.005043847,0.0015536231,0.0003659932,0.00061228126,0.00097535655,0.19708534,0.028295463,0.58909565,0.02590061,0.15008226],"study_design_scores_gemma":[0.000082991384,0.00013522602,0.0012738102,0.00015663425,0.00015077282,0.00039302962,0.00012321431,0.33641875,0.009448935,0.63689214,0.014845806,0.00007870044],"about_ca_topic_score_codex":0.0024687462,"about_ca_topic_score_gemma":0.0031886054,"teacher_disagreement_score":0.01158998,"about_ca_system_score_codex":0.0029271983,"about_ca_system_score_gemma":0.0014755095,"threshold_uncertainty_score":0.038772345},"labels":[],"label_agreement":null},{"id":"W3208757949","doi":"10.1007/s00453-022-01045-4","title":"Shortest Beer Path Queries in Outerplanar Graphs","year":2022,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ackermann function; Combinatorics; Mathematics; Path graph; Shortest path problem; Graph; Distance; Inverse; Wheel graph; Discrete mathematics; Graph power; Line graph","score_opus":0.020354054189384185,"score_gpt":0.295687206561516,"score_spread":0.2753331523721318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208757949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63977027,0.0025514287,0.2712559,0.010877032,0.00035965355,0.00043495762,0.005375842,0.003392241,0.06598262],"genre_scores_gemma":[0.88851476,0.0012016231,0.07247469,0.00094077166,0.00032702106,0.00016424202,0.0051668677,0.0010477576,0.030162435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761355,0.0005564092,0.0001329397,0.00053455686,0.00060220185,0.0005603454],"domain_scores_gemma":[0.9881016,0.008771468,0.000688331,0.0012041598,0.00068949914,0.00054489804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014112009,0.0009776461,0.0018180107,0.0017618656,0.0020732149,0.0046684165,0.0026817278,0.0025696077,0.0133235175],"category_scores_gemma":[0.016050294,0.0007624279,0.00084095827,0.004509902,0.0017786718,0.013625699,0.0049903346,0.0033537992,0.0018836681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038444614,0.000908915,0.0074865273,0.0015436127,0.00018779546,0.0011969896,0.0032156038,0.10100628,0.017774856,0.6287759,0.068041556,0.16601749],"study_design_scores_gemma":[0.00019049778,0.00008727873,0.0009844792,0.000051086558,0.0000837688,0.0003204346,0.0011512346,0.16256125,0.0071148025,0.8149033,0.012515092,0.000036845497],"about_ca_topic_score_codex":0.005365726,"about_ca_topic_score_gemma":0.005775039,"teacher_disagreement_score":0.0133235175,"about_ca_system_score_codex":0.0021072228,"about_ca_system_score_gemma":0.001317319,"threshold_uncertainty_score":0.04457158},"labels":[],"label_agreement":null},{"id":"W3209535718","doi":"10.1007/978-3-030-89543-3_5","title":"A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Listing (finance); Spanning tree; Gray (unit); Computer science; Combinatorics; Mathematics; Business; Medicine","score_opus":0.03706637153232336,"score_gpt":0.29979928516799187,"score_spread":0.26273291363566853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209535718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030521171,0.0009656148,0.7069571,0.00064897997,0.0007116349,0.00068216486,0.006962476,0.040619027,0.21193185],"genre_scores_gemma":[0.12169647,0.000757953,0.74876237,0.00041643367,0.0001127593,0.0003985131,0.0075683957,0.008277158,0.11200993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997713,0.00002403055,0.000012591679,0.00003206077,0.00011418037,0.000045857185],"domain_scores_gemma":[0.99959403,0.00013805211,0.000019804902,0.000087744906,0.00012772155,0.00003267466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023109294,0.00082714943,0.00060653366,0.0017071888,0.0009731241,0.001211243,0.0009998436,0.00080675253,0.06829979],"category_scores_gemma":[0.0013721779,0.00042998043,0.00051098387,0.0021559882,0.00040300755,0.0015330921,0.0008887597,0.0007727296,0.016261548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035768055,0.00019541524,0.00067194557,0.0005119972,0.000013305175,0.00074760296,0.0002664771,0.009272752,0.017056486,0.1591705,0.15116026,0.66057557],"study_design_scores_gemma":[0.00013000585,0.0002589763,0.0015988194,0.0004616833,0.000039285947,0.0017857344,0.000268072,0.09508578,0.03765696,0.28626746,0.5763037,0.00014355381],"about_ca_topic_score_codex":0.003936383,"about_ca_topic_score_gemma":0.0065439628,"teacher_disagreement_score":0.06829979,"about_ca_system_score_codex":0.00092072977,"about_ca_system_score_gemma":0.0011279774,"threshold_uncertainty_score":0.22848558},"labels":[],"label_agreement":null},{"id":"W3210535977","doi":"10.1145/3614094","title":"Recognizing <i>k</i> -Leaf Powers in Polynomial Time, for Constant <i>k</i>","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Combinatorics; Graph; Mathematics; Time complexity; Degree (music); Tree (set theory); Function (biology); Discrete mathematics; Constant (computer programming); Computer science; Physics","score_opus":0.031538997989108974,"score_gpt":0.303262989034617,"score_spread":0.27172399104550804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210535977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53301847,0.00041835455,0.43430233,0.0019057401,0.0001600945,0.00055529043,0.00143072,0.004344055,0.023864888],"genre_scores_gemma":[0.7087206,0.00033933172,0.2762447,0.0004008353,0.00010433752,0.00016562392,0.004287886,0.00071693957,0.009019707],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989524,0.00008135167,0.00009115467,0.0003816629,0.00022595964,0.00026762427],"domain_scores_gemma":[0.9961546,0.0015089571,0.00060866214,0.0010403426,0.0003138522,0.00037347866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060160796,0.0007824479,0.0010493137,0.0007183193,0.0009221846,0.0025436697,0.0016051037,0.0011209404,0.0070429803],"category_scores_gemma":[0.0049663903,0.00062108494,0.0014114489,0.0009491104,0.0011143251,0.0068552056,0.0017488468,0.0014910707,0.002597043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022706515,0.0009551662,0.05051114,0.0017907702,0.0002683856,0.0021515295,0.003013675,0.08876697,0.16673252,0.09155853,0.037223633,0.55475694],"study_design_scores_gemma":[0.00023607531,0.0006697606,0.011935566,0.00017391736,0.0002534047,0.0035885943,0.0019620603,0.4780485,0.10790518,0.36326253,0.031834785,0.00012962225],"about_ca_topic_score_codex":0.0012599366,"about_ca_topic_score_gemma":0.0023501406,"teacher_disagreement_score":0.0070429803,"about_ca_system_score_codex":0.0011328458,"about_ca_system_score_gemma":0.0009335624,"threshold_uncertainty_score":0.02356112},"labels":[],"label_agreement":null},{"id":"W3211499386","doi":"","title":"Randomized Communication and the Implicit Graph Conjecture.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Conjecture; Constant (computer programming); Mathematics; Bipartite graph; Adjacency list; Cartesian product; Randomized algorithm; Graph; Bounded function; Discrete mathematics; Upper and lower bounds; Computer science","score_opus":0.05097654668574888,"score_gpt":0.21891114234009823,"score_spread":0.16793459565434934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211499386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18222177,0.0040856814,0.7081748,0.045122765,0.00081189105,0.00082960504,0.0037118958,0.0024030658,0.05263837],"genre_scores_gemma":[0.82060266,0.0018552172,0.154245,0.004150578,0.0012402119,0.0016955034,0.0028440952,0.0010114285,0.0123553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9862223,0.005941484,0.00060289825,0.003201544,0.00249966,0.0015320037],"domain_scores_gemma":[0.8530526,0.11845592,0.005452246,0.018450372,0.0024914895,0.0020974174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007968053,0.0015221809,0.0021509635,0.0011621935,0.003593452,0.0047159446,0.0049778703,0.0049633025,0.015201292],"category_scores_gemma":[0.074391015,0.0013900892,0.002632996,0.0025093989,0.006094162,0.023603182,0.0053424174,0.008782977,0.0020424586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010949759,0.00045038547,0.0030727256,0.0007980517,0.00016865633,0.00021630677,0.0007668434,0.092698954,0.0038601072,0.8225285,0.022012306,0.052332222],"study_design_scores_gemma":[0.0001583042,0.000091497284,0.00046361142,0.00006386109,0.000051395808,0.00015809645,0.00014695889,0.15673195,0.001382793,0.83527064,0.005441661,0.00003923636],"about_ca_topic_score_codex":0.0029501938,"about_ca_topic_score_gemma":0.0035263682,"teacher_disagreement_score":0.015201292,"about_ca_system_score_codex":0.005541633,"about_ca_system_score_gemma":0.003914158,"threshold_uncertainty_score":0.05085343},"labels":[],"label_agreement":null},{"id":"W3211716743","doi":"10.1016/j.ejc.2021.103467","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e117\" altimg=\"si8.svg\"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> -conjectures on the domination game and claw-free graphs","year":2021,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Conjecture; Combinatorics; Graph; Mathematics; Class (philosophy); Computer science; Artificial intelligence","score_opus":0.01985399388103665,"score_gpt":0.2507570447313059,"score_spread":0.23090305085026924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211716743","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002496217,0.00052259717,0.06343903,0.011430312,0.0014079309,0.00026947472,0.11743816,0.054344486,0.7486517],"genre_scores_gemma":[0.043217916,0.0022360377,0.069535084,0.0031639866,0.0010747726,0.000723045,0.1705856,0.049848717,0.6596149],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995234,0.00007962482,0.0000390358,0.000104289014,0.00019953486,0.000054026474],"domain_scores_gemma":[0.9972792,0.0009863934,0.00016896926,0.00059834064,0.00067514426,0.00029195883],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082721555,0.0012640998,0.0012499398,0.001933881,0.0012207614,0.0063147326,0.0030140108,0.0017795457,0.67286],"category_scores_gemma":[0.0046224548,0.00083412084,0.0009498056,0.0041102297,0.00089887757,0.0061093206,0.0022418066,0.0025818716,0.48899293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006273318,0.000044071217,0.00018268076,0.00024261743,0.000007589582,0.000050674553,0.00009373595,0.00036533902,0.0007114464,0.04357841,0.91839975,0.03626086],"study_design_scores_gemma":[0.000074309144,0.000020619718,0.0009224762,0.000092220565,0.000007664586,0.00018628674,0.00011593301,0.0030807895,0.0023501625,0.05267413,0.94043237,0.000043041262],"about_ca_topic_score_codex":0.009127233,"about_ca_topic_score_gemma":0.01026458,"teacher_disagreement_score":0.67286,"about_ca_system_score_codex":0.002648942,"about_ca_system_score_gemma":0.001477108,"threshold_uncertainty_score":0.46662545},"labels":[],"label_agreement":null},{"id":"W3214559626","doi":"10.1137/20m136373x","title":"Graphon Mean Field Games and Their Equations","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Control and Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"Air Force Office of Scientific Research; Natural Environment Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Field (mathematics); Mathematical economics; Applied mathematics; Calculus (dental); Mathematical analysis; Pure mathematics","score_opus":0.012380578866352868,"score_gpt":0.25629748069981706,"score_spread":0.2439169018334642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214559626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14906302,0.0045042764,0.7030079,0.010555958,0.00069547544,0.0002441764,0.0010346073,0.00023678546,0.1306578],"genre_scores_gemma":[0.85886693,0.003345373,0.069938324,0.0021404028,0.00046805074,0.0006299783,0.0006203179,0.00010251701,0.06388817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951124,0.00018564088,0.00001798304,0.000082795,0.00012898838,0.0000733465],"domain_scores_gemma":[0.9990748,0.0005272433,0.000109625005,0.000039407496,0.00013155665,0.000117279706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010266149,0.00070946314,0.00078611827,0.0011356534,0.0007156347,0.0013084718,0.001136928,0.0020046341,0.004947387],"category_scores_gemma":[0.003891424,0.0002757133,0.00078671926,0.00068958756,0.001719829,0.0021364081,0.0013936928,0.0017006706,0.0004870004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006364793,0.000009757512,0.00017646722,0.00002115357,0.000008707992,0.0000408546,0.00006574362,0.026907371,0.00020634414,0.9690915,0.0017994249,0.0016664178],"study_design_scores_gemma":[0.000019281566,0.000010187956,0.00017606122,0.000014914737,0.000004509433,0.00003120992,0.000031720152,0.19578458,0.000061029645,0.8008499,0.003003333,0.000013197],"about_ca_topic_score_codex":0.01039569,"about_ca_topic_score_gemma":0.0066141984,"teacher_disagreement_score":0.01039569,"about_ca_system_score_codex":0.002109461,"about_ca_system_score_gemma":0.0012408817,"threshold_uncertainty_score":0.020670354},"labels":[],"label_agreement":null},{"id":"W3215138631","doi":"10.37236/11946","title":"Almost Every Matroid has an $M(K_4)$- or a $\\mathcal{W}^3$-Minor","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Matroid; Minor (academic); Discrete mathematics; Humanities","score_opus":0.04081058879379447,"score_gpt":0.3119434884356311,"score_spread":0.2711328996418366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215138631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8154491,0.00038005877,0.08557093,0.0010773704,0.00019143918,0.000078511206,0.0012547544,0.0007916068,0.0952062],"genre_scores_gemma":[0.94043195,0.00021723856,0.025831467,0.00032494144,0.00010352576,0.00008617477,0.0014277531,0.00020300932,0.03137394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997179,0.00003163643,0.000013770753,0.000085197644,0.00006288626,0.000088483204],"domain_scores_gemma":[0.9993469,0.00014537455,0.00016237078,0.00013039072,0.000081288,0.00013364475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016153364,0.00060562993,0.00040024254,0.00048204124,0.0013134842,0.0014450634,0.0007277989,0.00055761664,0.010621875],"category_scores_gemma":[0.0006758528,0.00036729773,0.0010030093,0.00056935166,0.0008948799,0.0016196141,0.0014066542,0.0010491448,0.0020411701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008132356,0.00021165551,0.0081503065,0.00046460822,0.00011433835,0.0018399837,0.0015232065,0.005700099,0.06575202,0.8392311,0.017186219,0.0590132],"study_design_scores_gemma":[0.00010713945,0.00045130367,0.011816476,0.000082267165,0.00015541805,0.0052810702,0.001273595,0.026297884,0.050509505,0.79775256,0.10615947,0.00011330187],"about_ca_topic_score_codex":0.0013810286,"about_ca_topic_score_gemma":0.0017082545,"teacher_disagreement_score":0.010621875,"about_ca_system_score_codex":0.0005110988,"about_ca_system_score_gemma":0.000292184,"threshold_uncertainty_score":0.035533726},"labels":[],"label_agreement":null},{"id":"W3217648472","doi":"10.32920/ryerson.14653842.v1","title":"Constraint Satisfaction Problems and Their Reduction to Directed Graphs","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Complexity of constraint satisfaction; Constraint satisfaction; Backtracking; Constraint satisfaction dual problem; Homomorphism; Constraint graph; Local consistency; Constraint logic programming; Digraph; Constraint programming; Mathematics; Theoretical computer science; Computer science; Discrete mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.03139085037536413,"score_gpt":0.2835385388460185,"score_spread":0.2521476884706544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217648472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01569841,0.0015135714,0.94321316,0.0028302125,0.00025423677,0.00025040476,0.000762662,0.000522098,0.034955252],"genre_scores_gemma":[0.27699345,0.0046878196,0.68423027,0.0019170668,0.0007940536,0.0010025924,0.003813948,0.0005686357,0.025992116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691075,0.0009371823,0.00021909633,0.00069165195,0.0009807728,0.00026054136],"domain_scores_gemma":[0.9960491,0.0027745143,0.0002557886,0.00036149044,0.00040577276,0.00015343532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015920147,0.00085278647,0.0007344686,0.0016731452,0.0012925485,0.0033815617,0.0019309775,0.0011971422,0.006782071],"category_scores_gemma":[0.008299511,0.0007414207,0.0022290524,0.0033312202,0.003114089,0.004897003,0.0034943013,0.0056856647,0.0010872512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001621372,0.00004317005,0.0001355275,0.0001515045,0.000026866444,0.00012253411,0.0003108202,0.0149728,0.00050520955,0.9568849,0.0041555865,0.022674931],"study_design_scores_gemma":[0.000015930758,0.000004892036,0.00005161679,0.000017459894,0.0000088337,0.000052636293,0.00006121718,0.019524112,0.00029340616,0.9700281,0.009934511,0.0000073057245],"about_ca_topic_score_codex":0.0055630696,"about_ca_topic_score_gemma":0.003322755,"teacher_disagreement_score":0.006782071,"about_ca_system_score_codex":0.0024927692,"about_ca_system_score_gemma":0.0016939403,"threshold_uncertainty_score":0.02268833},"labels":[],"label_agreement":null},{"id":"W33291493","doi":"10.1007/978-1-4419-7997-1_76","title":"Graph Searching and Related Problems","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Toronto Metropolitan University","funders":"","keywords":"Graph; Null graph; Probabilistic logic; Combinatorics; Computer science; Digraph; Complement graph; Theoretical computer science; Mathematics; Discrete mathematics; Voltage graph; Line graph; Artificial intelligence","score_opus":0.01691411052915559,"score_gpt":0.26736804140194065,"score_spread":0.25045393087278506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33291493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11580238,0.061871633,0.5754512,0.06474525,0.0024613792,0.00048156298,0.002732521,0.0010937303,0.1753603],"genre_scores_gemma":[0.58704513,0.035800386,0.26642603,0.006382933,0.005862305,0.00053290266,0.0044282745,0.0010500569,0.09247194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631786,0.0012445999,0.00015000023,0.0010946292,0.0008180009,0.00037489206],"domain_scores_gemma":[0.97712666,0.018289141,0.0009923327,0.0019799743,0.0010196953,0.0005922484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027526477,0.0010195154,0.0030272435,0.005155327,0.0054648933,0.008052345,0.006598596,0.008088992,0.023304315],"category_scores_gemma":[0.029035771,0.001413768,0.0022600805,0.0135628255,0.006624828,0.021991795,0.004216707,0.0064536035,0.002303094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012723482,0.00025232867,0.0008451118,0.00069400744,0.00006124189,0.000109069515,0.0004220559,0.016297664,0.00029110734,0.8870624,0.033031795,0.06080613],"study_design_scores_gemma":[0.000022347567,0.00000929662,0.00013570712,0.000044811757,0.000019384192,0.00008437319,0.00013422409,0.016629849,0.00018777495,0.97575,0.0069714147,0.000010767157],"about_ca_topic_score_codex":0.006122032,"about_ca_topic_score_gemma":0.0047609736,"teacher_disagreement_score":0.023304315,"about_ca_system_score_codex":0.0041958517,"about_ca_system_score_gemma":0.002366949,"threshold_uncertainty_score":0.07796067},"labels":[],"label_agreement":null},{"id":"W33743767","doi":"10.1186/s13019-021-01418-w","title":"New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Hamiltonian (control theory); Hamiltonian path; Graph; Connectivity; Pancyclic graph; Discrete mathematics; Line graph; 1-planar graph","score_opus":0.020367679419616945,"score_gpt":0.2765313554340319,"score_spread":0.256163676014415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33743767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14424746,0.003580943,0.6222993,0.009892143,0.0030869467,0.0013878057,0.013779784,0.0023857737,0.19933976],"genre_scores_gemma":[0.7560555,0.0035724377,0.19706881,0.0030420327,0.0023454383,0.0018329584,0.013145937,0.0006475678,0.022289297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860954,0.0003555943,0.0001490625,0.00033276854,0.0002930095,0.00026007276],"domain_scores_gemma":[0.98511654,0.00866257,0.0014917807,0.00083141273,0.002185667,0.0017120128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019352086,0.0011973281,0.0011473262,0.003672521,0.002141282,0.0020485031,0.0019672222,0.0026136492,0.0277718],"category_scores_gemma":[0.015036773,0.00095123285,0.0020412013,0.0020192368,0.0026904421,0.0063715144,0.0028491945,0.004527441,0.0040556244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000275241,0.0002548974,0.0028344656,0.00072063715,0.0000845236,0.0021970377,0.0006904898,0.008380359,0.009298705,0.92211974,0.030470952,0.022672942],"study_design_scores_gemma":[0.00018084019,0.00015307436,0.0025570465,0.00021235576,0.00009963617,0.0016297463,0.00086730596,0.035520326,0.0034011723,0.92345035,0.03179633,0.00013176743],"about_ca_topic_score_codex":0.0021241747,"about_ca_topic_score_gemma":0.0041220556,"teacher_disagreement_score":0.0277718,"about_ca_system_score_codex":0.0014556638,"about_ca_system_score_gemma":0.0020204931,"threshold_uncertainty_score":0.09290594},"labels":[],"label_agreement":null},{"id":"W344896498","doi":"10.46298/dmtcs.2073","title":"Uniquely monopolar-partitionable block graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Postdoctoral Science Foundation","keywords":"Combinatorics; Mathematics; Chordal graph; Bipartite graph; Indifference graph; Cograph; Pathwidth; Partition (number theory); Discrete mathematics; Maximal independent set; 1-planar graph; Modular decomposition; Vertex (graph theory); Block graph; Graph; Line graph","score_opus":0.01466658074978645,"score_gpt":0.2808183078698894,"score_spread":0.266151727120103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W344896498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40757787,0.001221606,0.50820667,0.0011572641,0.00023149587,0.00026990016,0.0034886415,0.0011437457,0.076702796],"genre_scores_gemma":[0.8445064,0.00071549247,0.1229256,0.0004493772,0.00013888648,0.00014108882,0.0044380524,0.0002637863,0.026421234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997019,0.000049967617,0.00001450953,0.00010353304,0.000076628814,0.000053348747],"domain_scores_gemma":[0.99915993,0.00024713125,0.00012684084,0.00021580285,0.0001268279,0.0001234512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017907184,0.00028266723,0.00058570935,0.0006095309,0.0009661452,0.0010974162,0.0006273743,0.0005452218,0.007872545],"category_scores_gemma":[0.0012264958,0.0003377483,0.0003356399,0.0007304752,0.0005808419,0.0016903003,0.00095087674,0.0010612119,0.0012030681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030266427,0.00010159238,0.0023122604,0.00034243314,0.000060145754,0.00052039284,0.0004974584,0.021352096,0.039862975,0.8236773,0.022396494,0.08857413],"study_design_scores_gemma":[0.00003778201,0.00008317581,0.0020048688,0.00004424804,0.00004576265,0.0008894172,0.00023045922,0.077456586,0.0129086245,0.85835755,0.047904484,0.000037005015],"about_ca_topic_score_codex":0.000924446,"about_ca_topic_score_gemma":0.0028704829,"teacher_disagreement_score":0.007872545,"about_ca_system_score_codex":0.0005918257,"about_ca_system_score_gemma":0.00049143157,"threshold_uncertainty_score":0.026336312},"labels":[],"label_agreement":null},{"id":"W34914328","doi":"","title":"Maximally local-edge-connected graphs and digraphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Telecommunications","score_opus":0.010867030066820205,"score_gpt":0.24752762622162705,"score_spread":0.23666059615480683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34914328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36158532,0.005993418,0.54026467,0.0037531133,0.0005126665,0.0004016416,0.009313504,0.0010277122,0.077148],"genre_scores_gemma":[0.83048916,0.0034943058,0.13765603,0.0009629483,0.0003099884,0.00032064144,0.0059370035,0.00012543946,0.020704513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995141,0.0001560801,0.000030417066,0.00019345173,0.00005316707,0.000052824915],"domain_scores_gemma":[0.9982804,0.0008151468,0.00035914461,0.00023263806,0.000121017445,0.00019168651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044167772,0.0005267386,0.0004192015,0.0021913024,0.001095427,0.0011514429,0.00082119764,0.000850541,0.005966468],"category_scores_gemma":[0.0023021246,0.00027787304,0.00053116324,0.0021303683,0.0010756708,0.0023076828,0.0008801651,0.00078172056,0.0009894642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022341768,0.00011370843,0.005051961,0.00082777126,0.00020350367,0.0012900991,0.0006799693,0.017428689,0.006136766,0.87099856,0.0118539175,0.08519163],"study_design_scores_gemma":[0.00004057686,0.00008922539,0.004040333,0.00013391327,0.00012971944,0.0017985287,0.0003581901,0.030820942,0.0017764448,0.9158154,0.044951666,0.0000451015],"about_ca_topic_score_codex":0.0011969637,"about_ca_topic_score_gemma":0.002278296,"teacher_disagreement_score":0.005966468,"about_ca_system_score_codex":0.00069250836,"about_ca_system_score_gemma":0.0003923263,"threshold_uncertainty_score":0.019959807},"labels":[],"label_agreement":null},{"id":"W34988218","doi":"10.1183/23120541.00511-2021","title":"Extremal Size In Graphs With Bounded Degree.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European and Developing Countries Clinical Trials Partnership","keywords":"Mathematics; Degree (music); Bounded function; Combinatorics; Mathematical analysis","score_opus":0.016480262883457268,"score_gpt":0.2541906489632152,"score_spread":0.23771038607975792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34988218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52978784,0.005507844,0.3346921,0.013129196,0.0007522757,0.0001645614,0.0073414007,0.0032079362,0.10541693],"genre_scores_gemma":[0.95476085,0.0012152181,0.030343644,0.0011114419,0.00045647883,0.00019080387,0.0017730523,0.0007472247,0.009401212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982608,0.0005068836,0.00006566355,0.00050502206,0.0002938778,0.0003676939],"domain_scores_gemma":[0.9808158,0.013951719,0.001517169,0.0016475766,0.00062753074,0.001440133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017759384,0.00059754774,0.0012251023,0.0026454334,0.0017250084,0.0028132978,0.0023951204,0.0016729797,0.012178152],"category_scores_gemma":[0.016376426,0.00066981826,0.0010121703,0.0013054892,0.0026589911,0.0067306804,0.0028086638,0.0024002586,0.0011595191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038617876,0.00006431851,0.0038105717,0.0004962323,0.000080193306,0.00036231737,0.000487809,0.01729424,0.005028411,0.9309307,0.023216536,0.01784244],"study_design_scores_gemma":[0.000040006453,0.00003110525,0.0016955356,0.00007933246,0.00004814736,0.00039664336,0.00016106312,0.056674898,0.00220024,0.93210155,0.0065389206,0.00003256083],"about_ca_topic_score_codex":0.0013574893,"about_ca_topic_score_gemma":0.0020335498,"teacher_disagreement_score":0.012178152,"about_ca_system_score_codex":0.0019201858,"about_ca_system_score_gemma":0.0007423087,"threshold_uncertainty_score":0.040739954},"labels":[],"label_agreement":null},{"id":"W35341376","doi":"10.1177/00469580221086922","title":"On Connected [k, k+1]-Factors in Claw-Free Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Apoio à Pesquisa do Estado da Paraíba; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Claw; Mathematics; Combinatorics; Biology; Ecology","score_opus":0.023810903285058988,"score_gpt":0.26164254658796327,"score_spread":0.23783164330290427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35341376","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92761296,0.00112411,0.056975543,0.00061186665,0.00007698971,0.000091511974,0.0013552373,0.0002842466,0.011867607],"genre_scores_gemma":[0.9809136,0.00049714703,0.011444266,0.00011312338,0.000058104222,0.000052531006,0.0014114495,0.00008523152,0.005424563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923706,0.00014790709,0.000037611222,0.000284008,0.00010480494,0.00018860356],"domain_scores_gemma":[0.9944748,0.0024279922,0.0013093696,0.0005221013,0.00040218324,0.0008634445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047752375,0.0007140097,0.0006046339,0.0031996062,0.0019333536,0.0017114092,0.00091427297,0.0008331307,0.008833417],"category_scores_gemma":[0.005346417,0.0004548873,0.00070041005,0.00214395,0.0017482484,0.0027772777,0.0012037376,0.00082307344,0.000989272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014768209,0.00040679422,0.07438716,0.0009875691,0.00041758025,0.0017690981,0.00481069,0.042378455,0.020357754,0.75014365,0.013293334,0.08957107],"study_design_scores_gemma":[0.0000889089,0.00015547773,0.024437092,0.00018083648,0.0001933677,0.0013410198,0.0014708724,0.05760209,0.0035474522,0.89734596,0.013542813,0.00009414674],"about_ca_topic_score_codex":0.0071792467,"about_ca_topic_score_gemma":0.011093097,"teacher_disagreement_score":0.008833417,"about_ca_system_score_codex":0.00084143,"about_ca_system_score_gemma":0.00048007845,"threshold_uncertainty_score":0.029550672},"labels":[],"label_agreement":null},{"id":"W35665625","doi":"10.1016/j.ejmp.2022.05.017","title":"Acyclic Domination Number and Minimum Degree in 2-Diameter-Critical Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.031746575799540606,"score_gpt":0.3052332758681095,"score_spread":0.2734867000685689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35665625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68484837,0.0010132565,0.28232527,0.0010467321,0.00007929437,0.000098674864,0.002214244,0.00041047946,0.02796364],"genre_scores_gemma":[0.9552637,0.000456532,0.040323693,0.00007261034,0.000056568995,0.000081495244,0.0006903513,0.00009029275,0.002964754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955744,0.00015841355,0.000018952775,0.00011909552,0.00008044385,0.00006570866],"domain_scores_gemma":[0.99143326,0.00638914,0.0010288744,0.00036940887,0.00041135144,0.0003680218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074898987,0.00038560713,0.00029752072,0.0032154159,0.00094910903,0.0012052113,0.00070994237,0.00058814784,0.004304296],"category_scores_gemma":[0.009301915,0.00033512004,0.00027048122,0.0013000946,0.0009764136,0.0016362781,0.00057086797,0.000479903,0.00039212866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082807336,0.00011975048,0.041648958,0.0008493691,0.00012727852,0.0006416182,0.0013873479,0.26064816,0.028707553,0.55177635,0.011889226,0.10137626],"study_design_scores_gemma":[0.00005441356,0.00008216665,0.016987005,0.00012431204,0.00006683733,0.0009964996,0.00047122326,0.34146667,0.011248439,0.6170477,0.0113978,0.000057024652],"about_ca_topic_score_codex":0.0020911868,"about_ca_topic_score_gemma":0.0037462641,"teacher_disagreement_score":0.004304296,"about_ca_system_score_codex":0.0011235164,"about_ca_system_score_gemma":0.00044249612,"threshold_uncertainty_score":0.01439929},"labels":[],"label_agreement":null},{"id":"W35857846","doi":"10.1126/sciadv.abo4459","title":"Total Perfect Codes in Tensor Products of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of General Medical Sciences; National Institute on Aging","keywords":"Mathematics; Combinatorics; Discrete mathematics; Tensor product; Vertex (graph theory); Graph; Pure mathematics","score_opus":0.02030590098042657,"score_gpt":0.2640185442954222,"score_spread":0.24371264331499565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35857846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35199973,0.007559043,0.525319,0.004632268,0.0010512733,0.00020208192,0.0042541176,0.0011334964,0.10384901],"genre_scores_gemma":[0.90468955,0.0028469092,0.0559457,0.00086095365,0.0006956749,0.00020008437,0.00196868,0.00031466287,0.032477662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986613,0.0004091204,0.00008972299,0.00028151946,0.00034164157,0.00021662776],"domain_scores_gemma":[0.9961359,0.001600258,0.0007881988,0.00062197656,0.00047633325,0.000377329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011431604,0.0008383492,0.0006617703,0.0028763015,0.0012151917,0.002359316,0.0005865191,0.0007755192,0.0100054145],"category_scores_gemma":[0.004258617,0.00042162655,0.0007893953,0.002114726,0.0023687335,0.0031625107,0.0018016051,0.00132407,0.0016729477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006289869,0.000016177737,0.00038068774,0.000102379934,0.00002299228,0.00009407625,0.00022249516,0.0034143755,0.0008398793,0.9753636,0.0034843818,0.015996065],"study_design_scores_gemma":[0.0000097661705,0.000021188524,0.00025409952,0.000018831646,0.00000726883,0.0001238179,0.000039574767,0.008865237,0.00029092786,0.9848015,0.005555898,0.000011993262],"about_ca_topic_score_codex":0.0011095083,"about_ca_topic_score_gemma":0.0018363993,"teacher_disagreement_score":0.0100054145,"about_ca_system_score_codex":0.0012627539,"about_ca_system_score_gemma":0.0005717992,"threshold_uncertainty_score":0.033471465},"labels":[],"label_agreement":null},{"id":"W36880984","doi":"10.1111/dgd.12848","title":"Theorems and computations in circular colourings of graphs","year":2007,"lang":"en","type":"dissertation","venue":"Development Growth & Differentiation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fondation Maladies Rares","keywords":"Combinatorics; Mathematics; Foster graph; Discrete mathematics; Graph; Lemma (botany); Friendship graph; Graph power; Line graph","score_opus":0.012098582545925135,"score_gpt":0.2794793296674278,"score_spread":0.2673807471215026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36880984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15622425,0.0010752178,0.80266273,0.0013062346,0.00026242202,0.0001662128,0.0017139004,0.0010013701,0.03558761],"genre_scores_gemma":[0.7470709,0.0010688045,0.22533575,0.00032432805,0.0002530752,0.0003552893,0.003111274,0.00045912876,0.022021383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986166,0.0004034527,0.00010776857,0.00035449569,0.00030857505,0.00020917301],"domain_scores_gemma":[0.9926804,0.0050025037,0.0006415891,0.00059914764,0.00073149067,0.00034484125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016665981,0.0009358382,0.00096395094,0.0030359584,0.0010840229,0.0036225736,0.001647675,0.0013969917,0.012153952],"category_scores_gemma":[0.0127233835,0.00054549857,0.0017865576,0.0021947161,0.002367591,0.0042029163,0.0018249655,0.0019234812,0.0015900976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009936252,0.000047968544,0.001491705,0.00020627522,0.000047159963,0.00016990698,0.00034783545,0.09493438,0.0006379426,0.8655355,0.0046182405,0.031863745],"study_design_scores_gemma":[0.000015325933,0.000024036553,0.00023189577,0.00003184107,0.000009478157,0.00005979193,0.00006158953,0.16864963,0.0003244409,0.82764995,0.0029291483,0.000012820987],"about_ca_topic_score_codex":0.002648171,"about_ca_topic_score_gemma":0.002208764,"teacher_disagreement_score":0.012153952,"about_ca_system_score_codex":0.0020982688,"about_ca_system_score_gemma":0.00073308015,"threshold_uncertainty_score":0.04065901},"labels":[],"label_agreement":null},{"id":"W369866893","doi":"10.1007/978-3-540-93952-8","title":"Graph Factors and Matching Extensions","year":2009,"lang":"en","type":"book","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matching (statistics); Computer science; Graph; Graph theory; Theoretical computer science; Mathematics; Combinatorics; Statistics","score_opus":0.02745059931612261,"score_gpt":0.28994935403746575,"score_spread":0.26249875472134315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W369866893","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010393602,0.014360654,0.05675952,0.0017434831,0.0013147856,0.000075812364,0.00030879083,0.000745065,0.9142983],"genre_scores_gemma":[0.18631971,0.026950844,0.05412261,0.0010903695,0.002470319,0.00020304334,0.0012975684,0.00085490604,0.72669065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975616,0.000037930502,0.0000071645395,0.00006806413,0.00009950153,0.00003121438],"domain_scores_gemma":[0.9998086,0.00005288444,0.000015053275,0.00005633483,0.0000410096,0.000026154543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022620735,0.0008182474,0.00062314776,0.0014340306,0.00081314344,0.0014509652,0.0007074873,0.0004293392,0.026990937],"category_scores_gemma":[0.0007653951,0.00042789098,0.0005305998,0.0022269832,0.0013136356,0.004055921,0.0010374571,0.0017134104,0.0100394655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022448798,0.000024521916,0.000056819805,0.00010862193,0.0000066756115,0.000041872932,0.00014399979,0.00061737903,0.00072347006,0.8646489,0.048483193,0.08512214],"study_design_scores_gemma":[0.000006936876,0.000010034836,0.00010688646,0.00004269007,0.0000101678625,0.00015005768,0.00005917627,0.00093888247,0.0004301615,0.7344562,0.26378196,0.0000068093245],"about_ca_topic_score_codex":0.0012127196,"about_ca_topic_score_gemma":0.0016591619,"teacher_disagreement_score":0.026990937,"about_ca_system_score_codex":0.0009472638,"about_ca_system_score_gemma":0.0005962907,"threshold_uncertainty_score":0.090293705},"labels":[],"label_agreement":null},{"id":"W37360314","doi":"10.1007/s41870-023-01336-1","title":"Graph decompositions through prescribed vertices without isolates.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.02692470145932538,"score_gpt":0.2861416189690892,"score_spread":0.25921691750976383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37360314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06757975,0.00078900566,0.8369582,0.0013116471,0.0003655972,0.0005595563,0.0021577128,0.0012531877,0.089025356],"genre_scores_gemma":[0.43607217,0.0017706007,0.4665108,0.0006041587,0.00022389568,0.0008383906,0.00559539,0.00074764254,0.087636925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986468,0.00038418017,0.00010789236,0.0004123926,0.00026325037,0.00018555536],"domain_scores_gemma":[0.9969506,0.0012035717,0.00036506107,0.00074293703,0.00044496983,0.0002928228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084742083,0.0007918012,0.00071338937,0.0028698074,0.0023473094,0.0033631348,0.0012566191,0.0014921075,0.024174718],"category_scores_gemma":[0.005107503,0.00076663063,0.0014774441,0.0022192565,0.0023386476,0.004483815,0.0024903456,0.001774567,0.005059768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011649689,0.000072415045,0.00095717254,0.00024506456,0.000048678306,0.00037462832,0.00080525794,0.012075679,0.002734306,0.923539,0.0076343063,0.051396996],"study_design_scores_gemma":[0.00003621951,0.000048015736,0.0006767163,0.000111409885,0.000050374318,0.00050732074,0.000489584,0.034063905,0.0017811757,0.8959562,0.0662513,0.000027675072],"about_ca_topic_score_codex":0.0038509162,"about_ca_topic_score_gemma":0.005112948,"teacher_disagreement_score":0.024174718,"about_ca_system_score_codex":0.0014045775,"about_ca_system_score_gemma":0.0011718348,"threshold_uncertainty_score":0.080872476},"labels":[],"label_agreement":null},{"id":"W38533780","doi":"10.37201/req/149.2023","title":"Upper bounds on the domination number of a graph in terms of order and minimum degree.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Graph; Order (exchange); Physics","score_opus":0.013871727514548926,"score_gpt":0.27393067211615574,"score_spread":0.26005894460160683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38533780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25529018,0.029731046,0.42215064,0.008695016,0.0008298555,0.00020894878,0.009903193,0.0030488772,0.2701422],"genre_scores_gemma":[0.8776998,0.009981215,0.0859336,0.0009314732,0.001433337,0.0003305991,0.0033756453,0.0007842916,0.01953012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976877,0.0004250942,0.0001206478,0.0003922533,0.0007683896,0.0006059316],"domain_scores_gemma":[0.95557326,0.03655156,0.0018579229,0.0031099892,0.0012837793,0.0016234366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026177994,0.0018378901,0.0016619033,0.0050003626,0.0015400669,0.0040527456,0.0027794284,0.0013054345,0.011948132],"category_scores_gemma":[0.022714032,0.0008767019,0.0012172445,0.0043775523,0.001972256,0.007649778,0.0027396725,0.0030071752,0.0021468827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015899143,0.00043655877,0.011007177,0.0015765271,0.00037391295,0.00050194777,0.000853131,0.23059429,0.026794763,0.52330613,0.044319462,0.15864612],"study_design_scores_gemma":[0.00007311116,0.00013765224,0.008017103,0.0003931229,0.0002580079,0.0009978183,0.00018928574,0.33013842,0.009779456,0.62069833,0.029186044,0.0001317019],"about_ca_topic_score_codex":0.0021674724,"about_ca_topic_score_gemma":0.007961065,"teacher_disagreement_score":0.011948132,"about_ca_system_score_codex":0.00346373,"about_ca_system_score_gemma":0.0013351687,"threshold_uncertainty_score":0.039970517},"labels":[],"label_agreement":null},{"id":"W39381033","doi":"10.3389/fnume.2024.1324698","title":"A Note on the Unit Interval Number and Proper Interval Number of Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Heart, Lung, and Blood Institute","keywords":"Mathematics; Interval (graph theory); Unit interval; Unit (ring theory); Combinatorics; Discrete mathematics; Mathematics education","score_opus":0.021097818232278666,"score_gpt":0.29992475290418696,"score_spread":0.2788269346719083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39381033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020151805,0.040039957,0.6428725,0.042133342,0.037795898,0.0003203532,0.0019122969,0.001409648,0.21336426],"genre_scores_gemma":[0.33142284,0.02162768,0.5654067,0.013793726,0.034747593,0.0008516754,0.0014594807,0.0010725327,0.0296178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955888,0.0017745823,0.00052438775,0.0010190739,0.0008739787,0.00021926952],"domain_scores_gemma":[0.9715996,0.019992482,0.0012322238,0.004068699,0.0024212152,0.0006857682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048470446,0.0008912312,0.0011552012,0.0033754604,0.0021512061,0.0036409306,0.0026488234,0.0016886805,0.008371412],"category_scores_gemma":[0.03363641,0.0005340025,0.0011807717,0.00388723,0.008625667,0.009421378,0.0027607777,0.00802741,0.002499809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016895843,0.000037115627,0.0010885451,0.0004078067,0.00003811673,0.00040393704,0.00034569795,0.0011911979,0.0012307605,0.86511344,0.052407537,0.0775669],"study_design_scores_gemma":[0.000017969183,0.000079223064,0.0015429263,0.000119307,0.00003795984,0.00095169275,0.00011050868,0.0025394706,0.0010813385,0.8637763,0.12966578,0.000077548844],"about_ca_topic_score_codex":0.001869341,"about_ca_topic_score_gemma":0.0015087073,"teacher_disagreement_score":0.008371412,"about_ca_system_score_codex":0.0013114279,"about_ca_system_score_gemma":0.0007899322,"threshold_uncertainty_score":0.028005183},"labels":[],"label_agreement":null},{"id":"W4205106693","doi":"10.1016/s0012-365x(04)00022-6","title":"Absorbing sets in arc-coloured tournaments*1","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tournament; Mathematics; Vertex (graph theory); Combinatorics; Monochromatic color; Arc (geometry); Path (computing); Discrete mathematics; Graph; Geometry; Computer science","score_opus":0.02730265602279779,"score_gpt":0.31723079426519624,"score_spread":0.28992813824239844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205106693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58875465,0.0012198805,0.30041298,0.0023580072,0.0005401311,0.00016082465,0.0008274096,0.0007664763,0.10495958],"genre_scores_gemma":[0.93801415,0.00076904596,0.034125682,0.0005068467,0.00038661854,0.00028472385,0.0009209626,0.00023411679,0.02475779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774456,0.0006858142,0.00013431459,0.0004644533,0.00044855248,0.000522369],"domain_scores_gemma":[0.98867166,0.007939181,0.00087347813,0.0006145897,0.0005776411,0.0013234532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001821378,0.0010594442,0.0018491212,0.002324069,0.0052268277,0.009556317,0.0029345958,0.0028641461,0.010802927],"category_scores_gemma":[0.008554532,0.0016376395,0.0021591512,0.0033156215,0.0037197163,0.0050227274,0.0032792608,0.004975296,0.0011299896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002611853,0.00014283932,0.00088048604,0.0001260388,0.0000622822,0.00024433722,0.0007109022,0.008946916,0.0021200073,0.9739952,0.004173495,0.008336338],"study_design_scores_gemma":[0.00009050794,0.0000534996,0.00047045987,0.00002941646,0.000045819063,0.00017197139,0.00013338514,0.028507221,0.0006640029,0.9672812,0.0025306125,0.00002190121],"about_ca_topic_score_codex":0.0019882047,"about_ca_topic_score_gemma":0.0021090223,"teacher_disagreement_score":0.010802927,"about_ca_system_score_codex":0.0022759107,"about_ca_system_score_gemma":0.0009843174,"threshold_uncertainty_score":0.03613937},"labels":[],"label_agreement":null},{"id":"W4205253237","doi":"10.1016/s0012-365x(04)00143-8","title":"The structure of strong arc-locally semicomplete digraphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Arc (geometry); Digraph; Combinatorics; Vertex (graph theory); Class (philosophy); Generalization; Discrete mathematics; Computer science; Artificial intelligence; Graph","score_opus":0.0176590252653728,"score_gpt":0.2834667429367344,"score_spread":0.26580771767136163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205253237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8383013,0.0004741436,0.11588694,0.0011635757,0.00006914458,0.000058154485,0.0009698082,0.00036779486,0.042709142],"genre_scores_gemma":[0.9728166,0.00033086387,0.013844018,0.00017769341,0.00005551172,0.00006240951,0.0006665429,0.000052344498,0.011993969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996376,0.000076722376,0.000027864226,0.000090307985,0.000092522525,0.0000749386],"domain_scores_gemma":[0.99599767,0.002060717,0.0005172134,0.00031152315,0.0004947174,0.0006181532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005302775,0.000348337,0.00064952485,0.0018496007,0.0020147352,0.0025543387,0.0010302749,0.0008345005,0.006706966],"category_scores_gemma":[0.0026657614,0.0005945148,0.0004124003,0.0020037917,0.0019694273,0.0031942877,0.0015007728,0.00150715,0.0005980206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004506247,0.000022876087,0.00050846074,0.000053365155,0.00000824895,0.00011095312,0.0003287994,0.0020919233,0.0011915766,0.9911972,0.00063877925,0.0038027605],"study_design_scores_gemma":[0.000026562699,0.000023080935,0.0005354985,0.000018552932,0.000012417102,0.00009273167,0.00015486359,0.00893284,0.00069472555,0.9873139,0.002181929,0.000012829162],"about_ca_topic_score_codex":0.0012432098,"about_ca_topic_score_gemma":0.0022565885,"teacher_disagreement_score":0.006706966,"about_ca_system_score_codex":0.001204158,"about_ca_system_score_gemma":0.0007292982,"threshold_uncertainty_score":0.022436976},"labels":[],"label_agreement":null},{"id":"W4205300480","doi":"10.1016/j.jctb.2015.02.003","title":"Projective geometries in exponentially dense matroids. I","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Rank (graph theory); Graphic matroid; Integer (computer science); Prime (order theory); Prime power; Matroid partitioning; Discrete mathematics; Computer science","score_opus":0.02429588280191961,"score_gpt":0.28916004476698653,"score_spread":0.2648641619650669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205300480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58291703,0.008238926,0.120439656,0.008980186,0.00084967003,0.00009519728,0.0021696142,0.0005491237,0.27576065],"genre_scores_gemma":[0.9630136,0.002005072,0.011201673,0.00042887114,0.00095973385,0.00005248421,0.0010621838,0.00009241402,0.021184012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929917,0.0002112377,0.000033458535,0.0001601348,0.00014742592,0.00014846236],"domain_scores_gemma":[0.9972881,0.0015254619,0.00033179994,0.00023662976,0.00023428704,0.0003837197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050957577,0.000634451,0.0006708436,0.001347683,0.0014597491,0.0032718533,0.000928545,0.00089346303,0.013439227],"category_scores_gemma":[0.0038597572,0.000752943,0.0006425119,0.0014177455,0.002879835,0.0068470873,0.0027173168,0.0035290061,0.0016255699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050315055,0.000027116574,0.0009407947,0.00009971221,0.000011280607,0.00011233323,0.00026605141,0.0013186092,0.0006709423,0.98400855,0.006241968,0.0062524006],"study_design_scores_gemma":[0.000014146437,0.000025481926,0.0009763476,0.000029723851,0.000010623035,0.00032779863,0.0001808221,0.0032191388,0.00036146093,0.9899329,0.0049114097,0.000010042744],"about_ca_topic_score_codex":0.000858908,"about_ca_topic_score_gemma":0.0009996502,"teacher_disagreement_score":0.013439227,"about_ca_system_score_codex":0.0013249846,"about_ca_system_score_gemma":0.0003756072,"threshold_uncertainty_score":0.04495871},"labels":[],"label_agreement":null},{"id":"W4205569288","doi":"","title":"Pure pairs VI. Excluding an ordered tree","year":2022,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; National Science Foundation","keywords":"Combinatorics; Mathematics; Subject (documents); Tree (set theory); Discrete mathematics; Computer science; Library science","score_opus":0.043204147124573516,"score_gpt":0.27800537100088335,"score_spread":0.23480122387630983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205569288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2936008,0.0044647534,0.5652171,0.005749411,0.0009549669,0.00045852273,0.0029272358,0.0035131287,0.12311414],"genre_scores_gemma":[0.7050445,0.0015892701,0.25273317,0.0026710902,0.00060055556,0.0006172674,0.004318161,0.0011445975,0.031281494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676585,0.0008463891,0.00013715583,0.0007588047,0.0009195733,0.0005722156],"domain_scores_gemma":[0.9916644,0.0038581449,0.00073837984,0.0020263693,0.0010057118,0.0007070757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016357602,0.0013780455,0.0014017913,0.0012482948,0.003314076,0.0030555935,0.0018905282,0.0013388902,0.01882167],"category_scores_gemma":[0.0100228395,0.001004972,0.0021813158,0.0017416999,0.0023448274,0.011131325,0.0034094008,0.003801508,0.0042725694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011601573,0.00039929635,0.005875649,0.0010888503,0.0001813242,0.0010891017,0.0006868642,0.013514586,0.019816095,0.80417264,0.03532864,0.11668687],"study_design_scores_gemma":[0.000091848415,0.00026811837,0.0011520553,0.00012251611,0.00016794074,0.0013750576,0.00038587788,0.048997223,0.014833615,0.88932264,0.043206073,0.000077091085],"about_ca_topic_score_codex":0.001667398,"about_ca_topic_score_gemma":0.0024431602,"teacher_disagreement_score":0.01882167,"about_ca_system_score_codex":0.0017373626,"about_ca_system_score_gemma":0.0018929626,"threshold_uncertainty_score":0.06296474},"labels":[],"label_agreement":null},{"id":"W4205679529","doi":"10.1007/978-3-030-93176-6_35","title":"An Efficient Oracle for Counting Shortest Paths in Planar Graphs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Combinatorics; Voronoi diagram; Planar graph; Shortest path problem; Mathematics; Path (computing); Binary logarithm; Planar; Discrete mathematics; Computer science; Graph; Geometry","score_opus":0.022331315858264866,"score_gpt":0.29187573104238107,"score_spread":0.2695444151841162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205679529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045522805,0.0021997758,0.89645433,0.0024230347,0.0006069112,0.0005201732,0.005148456,0.014323721,0.0328009],"genre_scores_gemma":[0.2496929,0.0015693232,0.70856315,0.0008568921,0.0007014252,0.0008564848,0.011893106,0.0022768034,0.023589972],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951567,0.0009061431,0.00046763348,0.0009774719,0.00193121,0.00056084566],"domain_scores_gemma":[0.9844765,0.009875654,0.0004937422,0.003574682,0.0010104156,0.0005689493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022016368,0.0022606333,0.0031498575,0.0021437786,0.0012985163,0.00552499,0.0069598756,0.0035293603,0.02146043],"category_scores_gemma":[0.014916492,0.0016814356,0.0019171742,0.00688221,0.0017621826,0.01587324,0.0064414307,0.005926986,0.005897358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020548243,0.00088879117,0.002200349,0.0017459827,0.00015950657,0.0003288355,0.0004414163,0.041788574,0.030709162,0.15760148,0.07372327,0.68835783],"study_design_scores_gemma":[0.0007503276,0.00046349724,0.0023804316,0.0002440496,0.00031846346,0.0010877254,0.0005085931,0.4321297,0.024685826,0.48881295,0.048412025,0.00020645505],"about_ca_topic_score_codex":0.002642613,"about_ca_topic_score_gemma":0.0041029616,"teacher_disagreement_score":0.02146043,"about_ca_system_score_codex":0.002598234,"about_ca_system_score_gemma":0.0035844673,"threshold_uncertainty_score":0.071792364},"labels":[],"label_agreement":null},{"id":"W4205686199","doi":"10.1016/j.procs.2021.11.008","title":"Treelength of Series-parallel Graphs","year":2021,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Ministry of Communications and Information, Singapore; Ministerul Cercetării şi Inovării; Providence Health Care","keywords":"Chordal graph; Combinatorics; Pathwidth; Indifference graph; Mathematics; Metric dimension; Cograph; Modular decomposition; Discrete mathematics; Outerplanar graph; Partial k-tree; Planar graph; Treewidth; Split graph; Clique-sum; Tree-depth; 1-planar graph; Graph; Line graph","score_opus":0.01713181673032898,"score_gpt":0.2728725849228167,"score_spread":0.2557407681924877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205686199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3816894,0.0016807129,0.56807065,0.0012377716,0.0001775289,0.00028714203,0.003146664,0.0021794871,0.04153069],"genre_scores_gemma":[0.7860078,0.001504103,0.19517726,0.0003694483,0.00019646264,0.00025650382,0.0035896902,0.0005313175,0.012367365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992982,0.00008640652,0.00004521417,0.00025623414,0.00021472143,0.000099186844],"domain_scores_gemma":[0.9978071,0.0009378764,0.0004151748,0.00034981666,0.00032006708,0.00017000483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031548052,0.0005185592,0.00049203343,0.0010364209,0.0007875019,0.0015432626,0.00096742465,0.0005395082,0.0050900658],"category_scores_gemma":[0.0037443938,0.00035425526,0.0006944236,0.0014459513,0.0010645265,0.0028425842,0.001156409,0.0011584967,0.0008693223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007770767,0.00015052344,0.0055980003,0.0009536201,0.0000764972,0.00066648715,0.00087155006,0.18827507,0.04290732,0.5397765,0.016779082,0.20316833],"study_design_scores_gemma":[0.000042059182,0.0001345292,0.0017913447,0.000074081254,0.000043179414,0.0008447837,0.00019835196,0.22922681,0.0130388,0.7294903,0.025074366,0.000041394716],"about_ca_topic_score_codex":0.0017104221,"about_ca_topic_score_gemma":0.001665533,"teacher_disagreement_score":0.0050900658,"about_ca_system_score_codex":0.0014126833,"about_ca_system_score_gemma":0.0007823503,"threshold_uncertainty_score":0.017027915},"labels":[],"label_agreement":null},{"id":"W4205716054","doi":"10.1016/j.dam.2009.08.002","title":"On well-covered triangulations: Part III","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Triangulation; Degree (music); Discrete mathematics; Geometry","score_opus":0.01805474444878341,"score_gpt":0.2866769156131945,"score_spread":0.2686221711644111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205716054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22754276,0.02336966,0.4742302,0.007138168,0.0028691648,0.00033533748,0.0020571453,0.00039021217,0.26206732],"genre_scores_gemma":[0.75033283,0.026139686,0.098657906,0.0024124053,0.0048322245,0.00051913963,0.0033378508,0.0009029071,0.11286501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986897,0.00033468008,0.00008135472,0.0002640273,0.00042138767,0.00020897397],"domain_scores_gemma":[0.9970636,0.0015053836,0.00039751834,0.00037918912,0.0003792101,0.0002752337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012239447,0.0015572447,0.0013755247,0.0037581692,0.001484673,0.0029992412,0.0020967377,0.0020125485,0.014848472],"category_scores_gemma":[0.006582677,0.0011687597,0.0018834854,0.0037652117,0.0037033977,0.0062790625,0.0049443133,0.004666551,0.0025675274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072677336,0.000045111155,0.000774184,0.00038768846,0.00004657746,0.0002164363,0.0005684205,0.007612439,0.0025419276,0.9520661,0.008742595,0.026925849],"study_design_scores_gemma":[0.000014708641,0.000043676624,0.0009099671,0.00011828981,0.000027360144,0.00026208375,0.00026892935,0.011569209,0.00059984473,0.9727937,0.013369153,0.000023085959],"about_ca_topic_score_codex":0.0020011694,"about_ca_topic_score_gemma":0.0015358821,"teacher_disagreement_score":0.014848472,"about_ca_system_score_codex":0.0015456856,"about_ca_system_score_gemma":0.0005393927,"threshold_uncertainty_score":0.04967308},"labels":[],"label_agreement":null},{"id":"W4205800876","doi":"10.1016/j.jctb.2010.08.001","title":"On inequivalent representations of matroids over non-prime fields","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Prime (order theory); Combinatorics; Finite field; Mathematics; Order (exchange); Mace; Graphic matroid; Field (mathematics); Discrete mathematics; Pure mathematics","score_opus":0.009937836447893521,"score_gpt":0.3008611600237114,"score_spread":0.29092332357581785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205800876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8128921,0.0008585592,0.057790726,0.0032835852,0.000638581,0.00009850881,0.00038119213,0.00023603669,0.12382069],"genre_scores_gemma":[0.96810067,0.0005525735,0.012622041,0.00048424467,0.00043838946,0.00005998199,0.00045308727,0.00014672504,0.017142268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985876,0.00040821414,0.000104852465,0.0002033599,0.0003510425,0.00034489352],"domain_scores_gemma":[0.9973302,0.0011964942,0.00039050545,0.00036594516,0.00029035375,0.0004265133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015096075,0.00091650273,0.0009975268,0.0023754688,0.0024307854,0.0053080367,0.0015765992,0.002344728,0.013301971],"category_scores_gemma":[0.004298992,0.0006555423,0.0010088639,0.0021185835,0.003239221,0.008360157,0.0029099318,0.0038263714,0.001057623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060761944,0.000057752095,0.00024805928,0.000023804347,0.0000047636395,0.00011860577,0.0003649145,0.0005370102,0.00063723145,0.9924649,0.00078848074,0.004693847],"study_design_scores_gemma":[0.000019135421,0.000017716131,0.00015379519,0.000013908694,0.0000055269115,0.00010714776,0.00020602261,0.002602278,0.00025668408,0.9955481,0.0010613533,0.000008277057],"about_ca_topic_score_codex":0.000563166,"about_ca_topic_score_gemma":0.0009434094,"teacher_disagreement_score":0.013301971,"about_ca_system_score_codex":0.0017096903,"about_ca_system_score_gemma":0.00048051475,"threshold_uncertainty_score":0.044499516},"labels":[],"label_agreement":null},{"id":"W4205847801","doi":"10.1016/j.disc.2006.03.014","title":"Spanning subgraphs with specified valencies","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Valency; Mathematics; Combinatorics; Discrete mathematics; Vertex (graph theory); Graph factorization; Graph; Spanning tree; Voltage graph; Line graph","score_opus":0.019353913978545932,"score_gpt":0.25991806906105447,"score_spread":0.24056415508250853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205847801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5972111,0.0003326306,0.32466453,0.0013559295,0.00011300771,0.0002913633,0.0027567921,0.001294819,0.07197986],"genre_scores_gemma":[0.8706059,0.0003258033,0.11149005,0.00030333127,0.00006084825,0.00030853468,0.0025037795,0.00044515726,0.01395673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908876,0.0002273155,0.000073604824,0.00018439583,0.00020559329,0.000220385],"domain_scores_gemma":[0.9954797,0.0024151057,0.0003628251,0.00074091816,0.00056325056,0.0004383244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008933712,0.00076878874,0.00066590187,0.0013646517,0.001259254,0.0022796092,0.0014401226,0.0015949673,0.008564843],"category_scores_gemma":[0.006392784,0.00080607017,0.000733827,0.0020452412,0.0010610067,0.003132448,0.0019006731,0.0014605188,0.0014651819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032873574,0.00014489602,0.0031972546,0.00030023354,0.00006194275,0.00069588906,0.00068887236,0.014219597,0.022406068,0.9203235,0.0059583033,0.03167467],"study_design_scores_gemma":[0.00007215696,0.00007224881,0.0010408945,0.000069152855,0.00007927212,0.0010555977,0.00037585656,0.033991195,0.015742796,0.93803805,0.009433187,0.000029677589],"about_ca_topic_score_codex":0.0002146066,"about_ca_topic_score_gemma":0.00052069046,"teacher_disagreement_score":0.008564843,"about_ca_system_score_codex":0.000638004,"about_ca_system_score_gemma":0.00050507486,"threshold_uncertainty_score":0.028652191},"labels":[],"label_agreement":null},{"id":"W4205947909","doi":"10.1007/978-3-030-92681-6_11","title":"Computing the One-Visibility Cop-Win Strategies for Trees","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Visibility; Computer science; Tree (set theory); Key (lock); Search tree; Tree structure; Algorithm; Theoretical computer science; Combinatorics; Search algorithm; Mathematics; Binary tree; Computer security","score_opus":0.0434007628512319,"score_gpt":0.31865329805760945,"score_spread":0.27525253520637755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205947909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5612909,0.0011622034,0.38338673,0.002348377,0.00020841171,0.00026336228,0.0014329522,0.0013417936,0.0485653],"genre_scores_gemma":[0.9075993,0.0004563201,0.07715538,0.00022100504,0.000118094606,0.00014968032,0.0010671712,0.00044315838,0.01278981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846387,0.00034246157,0.00008025483,0.00033869295,0.00024876973,0.0005260473],"domain_scores_gemma":[0.98961455,0.007914054,0.00047464535,0.00080018194,0.0003733836,0.00082326465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016062465,0.0015342772,0.0022147663,0.0015056798,0.0016014704,0.0071265115,0.0032629997,0.002597206,0.014560189],"category_scores_gemma":[0.015125003,0.0012459619,0.0014727301,0.0020638118,0.0029473677,0.010162863,0.0028737327,0.003528235,0.0019258189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001134159,0.00052492996,0.004444905,0.0005736188,0.00017407976,0.00027922494,0.000980644,0.19274421,0.0036932253,0.67820334,0.018123547,0.099124044],"study_design_scores_gemma":[0.00006301319,0.000073100484,0.00039297782,0.000038920352,0.000036248257,0.000067330024,0.00022675806,0.21338029,0.000767395,0.7838434,0.0010872047,0.000023362025],"about_ca_topic_score_codex":0.003175652,"about_ca_topic_score_gemma":0.0049804193,"teacher_disagreement_score":0.014560189,"about_ca_system_score_codex":0.002547434,"about_ca_system_score_gemma":0.002287158,"threshold_uncertainty_score":0.048708677},"labels":[],"label_agreement":null},{"id":"W4206382042","doi":"10.1016/j.ejc.2006.06.009","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-Free bound for the class of planar graphs","year":2006,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Graph; Vertex (graph theory); Homomorphism; Scroll; Discrete mathematics; Algorithm; Philosophy; Theology","score_opus":0.01973816240423871,"score_gpt":0.24753745387877338,"score_spread":0.22779929147453468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206382042","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027563309,0.00056027505,0.12061327,0.005823994,0.001206082,0.00019918411,0.0998664,0.060551383,0.708423],"genre_scores_gemma":[0.042240698,0.0020803653,0.09832152,0.0021144124,0.001046711,0.0005616981,0.17359795,0.06992983,0.61010677],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996277,0.000051981206,0.00003126131,0.00007611143,0.0001633824,0.000049540107],"domain_scores_gemma":[0.9984952,0.0004891434,0.00010644881,0.00035968953,0.0003830803,0.00016644511],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00053879205,0.001168094,0.0010066289,0.0022343316,0.0010428246,0.0048974776,0.0025191251,0.0013201677,0.5694078],"category_scores_gemma":[0.0030746183,0.0008203451,0.0008057591,0.0037597138,0.00067488546,0.005653683,0.0018554184,0.0026041735,0.41058263],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005996974,0.00003408934,0.00015240614,0.00021428773,0.000007656891,0.00004058019,0.00009701642,0.00038094074,0.0010949586,0.05542219,0.8981038,0.044392146],"study_design_scores_gemma":[0.00003924436,0.000015711712,0.0008282132,0.00006606455,0.000009420677,0.00016988904,0.000068739966,0.0025908656,0.0036731872,0.05644835,0.93605024,0.000040089435],"about_ca_topic_score_codex":0.006252558,"about_ca_topic_score_gemma":0.006643658,"teacher_disagreement_score":0.43059218,"about_ca_system_score_codex":0.0020782996,"about_ca_system_score_gemma":0.0010011723,"threshold_uncertainty_score":0.6141875},"labels":[],"label_agreement":null},{"id":"W4206830864","doi":"10.1016/j.dam.2021.07.005","title":"Parameterized algorithms for the Happy Set problem","year":2021,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Parameterized complexity; Mathematics; Undirected graph; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.05288598446721245,"score_gpt":0.32754774320663876,"score_spread":0.27466175873942633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206830864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04212148,0.000809421,0.922371,0.003107172,0.00027481603,0.00040209887,0.0015301484,0.002206084,0.027177894],"genre_scores_gemma":[0.30111915,0.0011370643,0.6676554,0.00094070076,0.00043463908,0.0011354189,0.0056472355,0.0021086496,0.01982183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623126,0.0010979935,0.00020613684,0.0010714865,0.00077402825,0.0006190643],"domain_scores_gemma":[0.98847264,0.007394698,0.000550948,0.0024857197,0.0005267925,0.0005690749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030809504,0.001997725,0.0027407203,0.0014789468,0.0029063052,0.0068196617,0.007877691,0.0036751046,0.030362342],"category_scores_gemma":[0.016486026,0.0014914938,0.0032737446,0.0038369843,0.0023901057,0.01596748,0.006887449,0.007979664,0.004546299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010444092,0.0008815245,0.001193712,0.0007202325,0.00021874727,0.00013210761,0.0006625545,0.10209432,0.0033070622,0.61477023,0.050560743,0.22441435],"study_design_scores_gemma":[0.00028418566,0.000072850286,0.00027876266,0.000056792433,0.00007685965,0.00009939948,0.00021059877,0.22769986,0.0012406063,0.7619982,0.007946144,0.00003578163],"about_ca_topic_score_codex":0.003094066,"about_ca_topic_score_gemma":0.0052342587,"teacher_disagreement_score":0.030362342,"about_ca_system_score_codex":0.00409355,"about_ca_system_score_gemma":0.0038923281,"threshold_uncertainty_score":0.101572156},"labels":[],"label_agreement":null},{"id":"W4207028927","doi":"10.1002/jgt.22796","title":"Asymptotically good edge correspondence colourings","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.012935515915053134,"score_gpt":0.26809266483450434,"score_spread":0.2551571489194512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207028927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83511657,0.00026066732,0.083156124,0.0013484634,0.00011706114,0.000067873116,0.00048152823,0.00097165455,0.07848005],"genre_scores_gemma":[0.979055,0.00009702663,0.015350687,0.00017727207,0.0000442974,0.0000325533,0.00017461313,0.00008157934,0.0049869455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874014,0.00043451937,0.000044089316,0.00025169912,0.00029206488,0.0002375386],"domain_scores_gemma":[0.99105483,0.0053933193,0.0005793887,0.00170062,0.0006153232,0.0006565942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089734787,0.00050110713,0.00072065083,0.001090938,0.0014699167,0.0024594879,0.0008208202,0.0013885809,0.012218666],"category_scores_gemma":[0.007842346,0.0005387284,0.0004865899,0.0011677275,0.001924765,0.0032276993,0.0019987205,0.0013234598,0.0009858251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007900493,0.00016401606,0.006447239,0.00028781264,0.000061857616,0.0005756692,0.0006669717,0.03304605,0.02269727,0.9009841,0.009333,0.024946004],"study_design_scores_gemma":[0.00011600899,0.00012168969,0.0022193552,0.000029759323,0.000051619518,0.0005924371,0.00032387112,0.05832294,0.009839444,0.9198149,0.0085394,0.000028504748],"about_ca_topic_score_codex":0.00048579188,"about_ca_topic_score_gemma":0.0010454162,"teacher_disagreement_score":0.012218666,"about_ca_system_score_codex":0.0010336062,"about_ca_system_score_gemma":0.00047973832,"threshold_uncertainty_score":0.040875494},"labels":[],"label_agreement":null},{"id":"W4207062810","doi":"10.1007/978-3-030-95018-7_17","title":"Approximation and Parameterized Algorithms for Balanced Connected Partition Problems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Parameterized complexity; Partition (number theory); Disjoint sets; Mathematics; Graph partition; Vertex (graph theory); Approximation algorithm; Discrete mathematics; Graph","score_opus":0.034742319451082984,"score_gpt":0.2855835556091444,"score_spread":0.2508412361580614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207062810","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048883963,0.0028617133,0.91051775,0.00219017,0.00031392116,0.00033723726,0.0011743053,0.0022396112,0.03148126],"genre_scores_gemma":[0.28506,0.0026198162,0.68013424,0.0007391927,0.00060146913,0.0010866505,0.0054637706,0.0015250432,0.022769727],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744797,0.0007663391,0.00012570764,0.00057026336,0.00067058945,0.00041914536],"domain_scores_gemma":[0.9930427,0.0043372884,0.0003961426,0.001442851,0.00041980852,0.00036131853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002232898,0.0028188883,0.002563375,0.0020159504,0.0018570325,0.005384348,0.0065844893,0.0031180335,0.018500756],"category_scores_gemma":[0.014470697,0.0016609179,0.002147366,0.007175411,0.0019594075,0.013000089,0.004722713,0.0065643834,0.0033831692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014606104,0.0010325359,0.0015304562,0.0009594537,0.00018041377,0.00013420274,0.0005911237,0.24708459,0.0047148517,0.31596926,0.050183907,0.37615865],"study_design_scores_gemma":[0.00026560028,0.00008250173,0.00036455697,0.000081324804,0.00007501315,0.00013392272,0.00017566311,0.515646,0.0014389661,0.47372603,0.007983567,0.000026779535],"about_ca_topic_score_codex":0.003834124,"about_ca_topic_score_gemma":0.005914026,"teacher_disagreement_score":0.018500756,"about_ca_system_score_codex":0.00433663,"about_ca_system_score_gemma":0.0027675182,"threshold_uncertainty_score":0.06189114},"labels":[],"label_agreement":null},{"id":"W4210439484","doi":"10.1016/j.dam.2010.12.024","title":"Generalization of matching extensions in graphs (III)","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Matching (statistics); Generalization; Discrete mathematics; Graph","score_opus":0.03876667402242115,"score_gpt":0.28391648846985723,"score_spread":0.24514981444743608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210439484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29182717,0.0012460519,0.4018831,0.0033064457,0.0012661727,0.00025909994,0.0012566166,0.001347395,0.2976079],"genre_scores_gemma":[0.8523406,0.0013615432,0.080911025,0.0014956472,0.0011572145,0.00019754164,0.0010067194,0.000387674,0.061142057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939203,0.00011762054,0.000043161912,0.0002266443,0.00011700465,0.000103575294],"domain_scores_gemma":[0.9988391,0.00026623972,0.00015060458,0.0003600413,0.00018207867,0.00020197064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008105522,0.0005655327,0.00066292426,0.0012798035,0.0012685257,0.0016890102,0.0011815452,0.0010195227,0.011090005],"category_scores_gemma":[0.0027172952,0.00032498222,0.0015861387,0.0012745411,0.0013996296,0.0051060254,0.0028460475,0.003125324,0.0014481725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043333388,0.00004222937,0.0003015611,0.00007366219,0.000012793332,0.00017579891,0.000255944,0.0011853927,0.0020222196,0.9803879,0.0029976484,0.012501505],"study_design_scores_gemma":[0.00001225566,0.000019220699,0.00033807885,0.000020787644,0.000012838177,0.00029620796,0.00009139282,0.003976369,0.0007652006,0.9838949,0.010563122,0.0000096871145],"about_ca_topic_score_codex":0.00120584,"about_ca_topic_score_gemma":0.0009390435,"teacher_disagreement_score":0.011090005,"about_ca_system_score_codex":0.00079342735,"about_ca_system_score_gemma":0.00054025097,"threshold_uncertainty_score":0.03709978},"labels":[],"label_agreement":null},{"id":"W4210762532","doi":"10.1016/j.disc.2006.03.011","title":"Tough graphs and hamiltonian circuits","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Hamiltonian path; Graph; Discrete mathematics; Hamiltonian (control theory); Cubic graph; Quartic graph; Graph power; Line graph; Voltage graph","score_opus":0.016694382914690224,"score_gpt":0.2695214490345573,"score_spread":0.2528270661198671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210762532","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39307857,0.008749646,0.12729406,0.021401867,0.001656324,0.000106985965,0.00079194846,0.00039740576,0.44652316],"genre_scores_gemma":[0.9397574,0.0022249166,0.010284104,0.0016480603,0.00090033404,0.000095542055,0.0003597759,0.00009815678,0.044631656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966514,0.000105319756,0.000010881452,0.00006823484,0.00008390099,0.00006661598],"domain_scores_gemma":[0.9983437,0.000983948,0.00018971447,0.00015194884,0.0001237276,0.00020686729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039913374,0.00043912552,0.0005558372,0.0017066427,0.0021206944,0.002655992,0.0008745852,0.0017057648,0.017881183],"category_scores_gemma":[0.0026253136,0.0004829662,0.00049765874,0.0017106419,0.0037337455,0.004732713,0.0017088198,0.0029349045,0.0008024819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006236796,0.0000043968716,0.000042621574,0.000012266833,0.000002089051,0.00001640224,0.000067523724,0.00022654148,0.000097716715,0.9967709,0.0012210611,0.0015321454],"study_design_scores_gemma":[0.0000033959652,0.0000013164781,0.00005671684,0.00000261171,0.0000016708442,0.000016292894,0.000033859225,0.00040658843,0.000028593091,0.9979686,0.0014785203,0.0000018655851],"about_ca_topic_score_codex":0.001180309,"about_ca_topic_score_gemma":0.0016151937,"teacher_disagreement_score":0.017881183,"about_ca_system_score_codex":0.0010244972,"about_ca_system_score_gemma":0.00034514922,"threshold_uncertainty_score":0.059818506},"labels":[],"label_agreement":null},{"id":"W4212817891","doi":"10.1016/j.tcs.2022.02.009","title":"Vertex coloring (4K1, hole-twin, 5-wheel)-free graphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Neighbourhood (mathematics); Chordal graph; Mathematics; Feedback vertex set; Vertex (graph theory); Wheel graph; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.016109313204729876,"score_gpt":0.27365762230865104,"score_spread":0.2575483091039212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212817891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80206853,0.00043270344,0.13023084,0.0012377627,0.00026792224,0.00017366164,0.002931435,0.0012139103,0.061443184],"genre_scores_gemma":[0.90114033,0.00033839745,0.0534732,0.00041080898,0.000062075844,0.0001326823,0.0034783722,0.0003915179,0.0405727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992824,0.0001168101,0.00003395415,0.00019153373,0.00010724046,0.00026809107],"domain_scores_gemma":[0.99798524,0.00056568335,0.00032551948,0.0003725389,0.00025599462,0.0004950456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005408373,0.0010280219,0.0010252915,0.000973521,0.002591652,0.0024675638,0.0020738868,0.0013409065,0.011545627],"category_scores_gemma":[0.0019252818,0.00084580574,0.0007858913,0.0014943726,0.0013716976,0.0019498662,0.0017034424,0.0016839324,0.0024626744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020394265,0.0005780902,0.009664239,0.0008912977,0.00021272388,0.002317256,0.0015998235,0.045618672,0.04111641,0.789056,0.040690005,0.06621618],"study_design_scores_gemma":[0.00052266684,0.00024655185,0.0074145016,0.00015524612,0.0003125369,0.0011524733,0.00099804,0.08985321,0.019984387,0.8401011,0.039117817,0.00014146836],"about_ca_topic_score_codex":0.0059208,"about_ca_topic_score_gemma":0.01003865,"teacher_disagreement_score":0.011545627,"about_ca_system_score_codex":0.0013472544,"about_ca_system_score_gemma":0.0013404984,"threshold_uncertainty_score":0.03862399},"labels":[],"label_agreement":null},{"id":"W4213387244","doi":"10.1007/s00453-022-00937-9","title":"On 3-Coloring of ( <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mrow><mml:mn>2</mml:mn> <mml:msub><mml:mi>P</mml:mi> <mml:mn>4</mml:mn></mml:msub> <mml:mo>,</mml:mo> <mml:msub><mml:mi>C</mml:mi> <mml:mn>5</mml:mn></mml:msub> </mml:mrow> </mml:math> )-Free Graphs.","year":2022,"lang":"lv","type":"article","venue":"PubMed","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Grantová Agentura, Univerzita Karlova; Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Combinatorics; Mathematics; Theory of computation; Discrete mathematics; Graph coloring; Class (philosophy); Chordal graph; Graph; Time complexity; Computer science; Algorithm; Artificial intelligence","score_opus":0.02451577508842445,"score_gpt":0.24284211274195935,"score_spread":0.2183263376535349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213387244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1280487,0.0026615593,0.48831668,0.007169412,0.0018032041,0.0003667535,0.006769968,0.001595666,0.36326796],"genre_scores_gemma":[0.6173876,0.003949848,0.17520387,0.004505638,0.0009406563,0.00048399786,0.010647446,0.0021610959,0.1847199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993056,0.00021690482,0.000027352493,0.00016562754,0.00011250064,0.00017194441],"domain_scores_gemma":[0.99662566,0.0019739084,0.000275243,0.000355543,0.00047892204,0.00029077413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007668951,0.00088931754,0.0006195888,0.0012877157,0.0022791515,0.002154762,0.0010876169,0.0009643624,0.035853636],"category_scores_gemma":[0.0036753037,0.0004777181,0.0012985392,0.0014915585,0.0014871102,0.0028471425,0.0017645891,0.0020284362,0.0053944234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024143983,0.00008157875,0.00084265316,0.0003696727,0.00005027747,0.00041609304,0.0006511255,0.009483311,0.0030212507,0.86382955,0.0833329,0.037680168],"study_design_scores_gemma":[0.000037835413,0.000023105024,0.00087467337,0.000090052694,0.000026926295,0.00027055552,0.00016318553,0.014958363,0.0014262408,0.9499468,0.032155354,0.000026923368],"about_ca_topic_score_codex":0.009136586,"about_ca_topic_score_gemma":0.01640811,"teacher_disagreement_score":0.035853636,"about_ca_system_score_codex":0.00219113,"about_ca_system_score_gemma":0.0013925086,"threshold_uncertainty_score":0.11994231},"labels":[],"label_agreement":null},{"id":"W4213422038","doi":"10.37236/10556","title":"The Tree Alternative Conjecture Under the Topological Minor Relation","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Conjecture; Equivalence relation; Minor (academic); Combinatorics; Isomorphism (crystallography); Tree (set theory); Relation (database); Equivalence (formal languages); Class (philosophy); Equivalence class (music); Discrete mathematics; Aleph; Computer science","score_opus":0.014602869886890812,"score_gpt":0.27517264728094887,"score_spread":0.26056977739405807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213422038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8709653,0.00063549884,0.09306982,0.0033032345,0.00012285505,0.000046690595,0.0006753595,0.00034525877,0.03083592],"genre_scores_gemma":[0.9898302,0.00016579173,0.00658433,0.00025542578,0.00017722683,0.000056536945,0.00042083362,0.000046442063,0.0024633086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973425,0.0005355295,0.00012482685,0.0010275544,0.00051570765,0.0004537821],"domain_scores_gemma":[0.9817108,0.0126075,0.0016440033,0.0020126717,0.0008737266,0.0011511906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017210828,0.0004335728,0.001058515,0.00094639196,0.0015620259,0.0028212913,0.0012070724,0.001512818,0.006606916],"category_scores_gemma":[0.012993904,0.00040657137,0.0009878878,0.00082704495,0.004402271,0.011168275,0.0033713966,0.0024311373,0.0005005608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042272464,0.000079128586,0.007198772,0.00014728271,0.00003982438,0.0003133939,0.00095691095,0.005851302,0.0054470114,0.96371025,0.0029091148,0.012924332],"study_design_scores_gemma":[0.00005194092,0.00009896714,0.0031819933,0.000025532141,0.000038658007,0.0007459721,0.00040702755,0.027442656,0.003405724,0.9596609,0.004909875,0.00003075089],"about_ca_topic_score_codex":0.00076985324,"about_ca_topic_score_gemma":0.00065110094,"teacher_disagreement_score":0.006606916,"about_ca_system_score_codex":0.0012095402,"about_ca_system_score_gemma":0.00050867215,"threshold_uncertainty_score":0.022102296},"labels":[],"label_agreement":null},{"id":"W4221140426","doi":"10.4230/lipics.swat.2022.19","title":"An Optimal Algorithm for Product Structure in Planar Graphs","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Product (mathematics); Planar; Graph; Path (computing); Discrete mathematics; Time complexity; Treewidth; Algorithm; Pathwidth; Computer science; Geometry; Line graph","score_opus":0.019428817194095484,"score_gpt":0.3105806399749501,"score_spread":0.2911518227808546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221140426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022719357,0.0004663293,0.94906145,0.00066538167,0.00012467182,0.00035082514,0.0013614793,0.010882681,0.014367838],"genre_scores_gemma":[0.1021846,0.00034857547,0.87843114,0.0002662737,0.00008543708,0.0004638788,0.0066360654,0.0018626674,0.009721412],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986449,0.00015916134,0.000106477455,0.00045212693,0.0003939747,0.00024351789],"domain_scores_gemma":[0.9978758,0.0007716024,0.0001108896,0.0006668527,0.00044502062,0.00012989804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007434708,0.0022467577,0.001502091,0.0021564797,0.0012290394,0.0022364885,0.0031051934,0.0020050472,0.030803006],"category_scores_gemma":[0.0037378268,0.0013042681,0.002149264,0.003282997,0.0011440428,0.006189504,0.0046481933,0.0021533167,0.011369612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079678115,0.00038779495,0.00127198,0.0008257659,0.000114305345,0.00024055623,0.00037523964,0.03237746,0.022385467,0.06530039,0.06618987,0.8097344],"study_design_scores_gemma":[0.00087769766,0.000489368,0.0013287427,0.00013998209,0.00029059645,0.0011790928,0.00050437497,0.5011726,0.031049397,0.39400306,0.068825155,0.0001398748],"about_ca_topic_score_codex":0.0024583393,"about_ca_topic_score_gemma":0.0033150024,"teacher_disagreement_score":0.030803006,"about_ca_system_score_codex":0.0015466874,"about_ca_system_score_gemma":0.0020104016,"threshold_uncertainty_score":0.1030463},"labels":[],"label_agreement":null},{"id":"W4224980430","doi":"10.4230/lipics.isaac.2022.56","title":"Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Treewidth; Planar graph; Pathwidth; Clique-sum; Chordal graph; Vertex (graph theory); Discrete mathematics; Graph; 1-planar graph; Line graph","score_opus":0.08403979795398728,"score_gpt":0.2179856208734921,"score_spread":0.13394582291950483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224980430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7029037,0.001761483,0.27311885,0.002273223,0.0000840018,0.00018252441,0.0002548104,0.0003235497,0.01909792],"genre_scores_gemma":[0.96535194,0.00074005325,0.029305747,0.00016884608,0.00004585755,0.00010288647,0.00013235894,0.000054227552,0.0040981835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999113,0.00025038648,0.000033993038,0.0001867876,0.00014557163,0.00027034327],"domain_scores_gemma":[0.9956424,0.0025326388,0.0008059824,0.00036475042,0.00018439279,0.00046973588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007420894,0.0008866294,0.0008161736,0.0009782806,0.0012820117,0.001327572,0.0012967965,0.0012796061,0.0031410647],"category_scores_gemma":[0.0062341653,0.00036910846,0.00088897697,0.0009282075,0.0030932645,0.0038437853,0.0022039947,0.0016100613,0.00024224116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005159995,0.00026337063,0.008639549,0.000625836,0.00023314549,0.00071311364,0.002036894,0.32832313,0.01742371,0.5839878,0.0063907523,0.05084666],"study_design_scores_gemma":[0.00015204714,0.0005573366,0.0033998466,0.000082911196,0.00012580938,0.0008955015,0.0011734853,0.5440536,0.004423054,0.4320224,0.013046001,0.000068022775],"about_ca_topic_score_codex":0.0039351513,"about_ca_topic_score_gemma":0.0036461754,"teacher_disagreement_score":0.0039351513,"about_ca_system_score_codex":0.0014715743,"about_ca_system_score_gemma":0.00071507815,"threshold_uncertainty_score":0.010677099},"labels":[],"label_agreement":null},{"id":"W4225162735","doi":"10.1016/j.tcs.2022.04.052","title":"A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Modular design; Mathematics; Orthogonality; Time complexity; Decomposition; Scheme (mathematics); Polynomial; Focus (optics); Discrete mathematics; Combinatorics; Algorithm; Computer science","score_opus":0.006917649435479797,"score_gpt":0.27963597498471354,"score_spread":0.27271832554923375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225162735","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007676422,0.00013169074,0.9789909,0.0004714318,0.00017066525,0.00021237934,0.00024023218,0.00064788875,0.011458488],"genre_scores_gemma":[0.06940607,0.00036419753,0.91604644,0.00029081394,0.00023264473,0.00040225068,0.0008088132,0.0004847063,0.011964092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983734,0.0003243468,0.00017353683,0.0004833191,0.00045952766,0.00018582432],"domain_scores_gemma":[0.99757177,0.00089624507,0.00010911176,0.0008560659,0.00037123958,0.0001954723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022017835,0.0014714852,0.001217165,0.0025570907,0.002161069,0.005526945,0.0040646866,0.0020606588,0.01576367],"category_scores_gemma":[0.005702689,0.0010944341,0.0037080084,0.0038467278,0.0031033885,0.008265263,0.0077341036,0.0062153693,0.0043192874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050590028,0.00008344084,0.00027948848,0.00015467369,0.000019349696,0.0000915247,0.00028432492,0.0044765435,0.0033337495,0.91701037,0.0052508074,0.06896527],"study_design_scores_gemma":[0.000036930564,0.000039283146,0.00019547727,0.000047306767,0.00003790895,0.00016434987,0.00008687796,0.027022747,0.001520747,0.95544636,0.015367474,0.00003450846],"about_ca_topic_score_codex":0.0013680103,"about_ca_topic_score_gemma":0.0025046733,"teacher_disagreement_score":0.01576367,"about_ca_system_score_codex":0.0018852423,"about_ca_system_score_gemma":0.001526715,"threshold_uncertainty_score":0.052734733},"labels":[],"label_agreement":null},{"id":"W4225363091","doi":"10.1016/j.dam.2021.11.001","title":"Dichotomizing k-vertex-critical H-free graphs for H of order four","year":2022,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Discrete mathematics; Algorithm; Graph","score_opus":0.03854525185925415,"score_gpt":0.31333448810442494,"score_spread":0.27478923624517076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225363091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8865561,0.00033828494,0.023754997,0.0018958003,0.00011828588,0.00008841057,0.0005559344,0.00031948157,0.086372845],"genre_scores_gemma":[0.98501945,0.000111718895,0.004341496,0.0002711888,0.00004810449,0.000036783265,0.00035540306,0.000059447757,0.009756352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999708,0.000062203406,0.000008843757,0.000054545195,0.000051438125,0.00011496398],"domain_scores_gemma":[0.99886656,0.0005522159,0.00011681473,0.00008952798,0.00010694321,0.00026794345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032956907,0.0005978725,0.00059939874,0.0015917881,0.002465736,0.0020556864,0.00095394335,0.0012085071,0.009681868],"category_scores_gemma":[0.0018463333,0.00045389018,0.0005245486,0.0005826251,0.002154481,0.0018725218,0.001700228,0.0019816575,0.0006470171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031117283,0.00008212659,0.0010445239,0.000117646756,0.000019989831,0.0003145971,0.0006947778,0.005986858,0.00503783,0.9773801,0.004681229,0.00432908],"study_design_scores_gemma":[0.000070921174,0.000033778517,0.0008914434,0.00003341509,0.00001778937,0.00012782465,0.00051802245,0.016049694,0.0019242687,0.9781488,0.0021666784,0.000017404214],"about_ca_topic_score_codex":0.002259743,"about_ca_topic_score_gemma":0.0036432839,"teacher_disagreement_score":0.009681868,"about_ca_system_score_codex":0.001447746,"about_ca_system_score_gemma":0.0007073366,"threshold_uncertainty_score":0.032389104},"labels":[],"label_agreement":null},{"id":"W4225460864","doi":"","title":"Recolouring planar graphs of girth at least five","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Planar graph; 1-planar graph; Pathwidth; Outerplanar graph; Triangle-free graph; Discrete mathematics; Chordal graph; Clique-sum; Indifference graph; Planar straight-line graph; Symmetric graph; Graph; Line graph; Voltage graph","score_opus":0.018902533421486286,"score_gpt":0.2545153314195927,"score_spread":0.23561279799810642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225460864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82478803,0.0007005514,0.13588822,0.0004436829,0.00006193952,0.00012315865,0.001400125,0.0006709402,0.035923343],"genre_scores_gemma":[0.90486723,0.001038383,0.07923357,0.00020591998,0.00004117088,0.00010978021,0.0032199754,0.0001948429,0.011089127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957854,0.000054053777,0.000024243607,0.00013358193,0.00010720627,0.000102394835],"domain_scores_gemma":[0.9982528,0.00060180004,0.00043960495,0.00032674056,0.00019741798,0.00018163423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017703557,0.0004582974,0.00032674527,0.00095318793,0.0006389009,0.0010257039,0.0010055979,0.0004843419,0.0045650844],"category_scores_gemma":[0.0015676154,0.00035789033,0.0006927777,0.0010715006,0.0009776736,0.0015534562,0.001573157,0.0009911885,0.00068734726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010808795,0.00016105679,0.013143457,0.0016682826,0.00012876757,0.0019022593,0.0027628536,0.052385997,0.113870054,0.54777914,0.008164211,0.256953],"study_design_scores_gemma":[0.00016006613,0.000491529,0.025926538,0.00033221082,0.00020669735,0.0059765023,0.0029038338,0.08036903,0.109925054,0.66550803,0.10801784,0.000182708],"about_ca_topic_score_codex":0.00092846935,"about_ca_topic_score_gemma":0.0012657046,"teacher_disagreement_score":0.0045650844,"about_ca_system_score_codex":0.00051517534,"about_ca_system_score_gemma":0.00030177532,"threshold_uncertainty_score":0.015271723},"labels":[],"label_agreement":null},{"id":"W4226093078","doi":"10.1002/jgt.23025","title":"Single-conflict colorings of degenerate graphs","year":2023,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; European Commission","keywords":"Combinatorics; Mathematics; Graph; Degenerate energy levels; Simple graph; Discrete mathematics; Physics","score_opus":0.07845420285947077,"score_gpt":0.3152875862785836,"score_spread":0.23683338341911284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226093078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68489873,0.0005331257,0.2916992,0.000748115,0.00015721263,0.000109720495,0.00055898994,0.00043383506,0.020861154],"genre_scores_gemma":[0.9557611,0.00013178625,0.041209232,0.00016134564,0.000037837628,0.000054528915,0.0003938384,0.000072780385,0.0021776939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800414,0.000679023,0.00011756556,0.0004491804,0.00041504102,0.00033498564],"domain_scores_gemma":[0.99357444,0.0024680772,0.00085782004,0.0012511841,0.0007940135,0.0010545034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015978485,0.0004703689,0.0008843641,0.0011015272,0.0014577842,0.0014297339,0.0013252161,0.0006473236,0.0034948194],"category_scores_gemma":[0.007649778,0.000566,0.00055873924,0.0014148112,0.0021115257,0.0020527665,0.0018017739,0.0010942656,0.00034145304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010337228,0.00027013026,0.008482454,0.00040525643,0.00011908508,0.0012108695,0.0013678398,0.1438397,0.016156089,0.76609796,0.008280906,0.052735988],"study_design_scores_gemma":[0.00008159809,0.00006321241,0.0010422923,0.00003494108,0.000026185537,0.0005542086,0.0003968819,0.19931531,0.0042735413,0.78873986,0.0054414165,0.000030547733],"about_ca_topic_score_codex":0.0011881855,"about_ca_topic_score_gemma":0.0007372972,"teacher_disagreement_score":0.0034948194,"about_ca_system_score_codex":0.0009987901,"about_ca_system_score_gemma":0.00055702304,"threshold_uncertainty_score":0.0116913915},"labels":[],"label_agreement":null},{"id":"W4229847238","doi":"10.1002/jgt.10047","title":"Convex‐round graphs are circular‐perfect","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Regular polygon; Chordal graph; Discrete mathematics; Graph; Geometry","score_opus":0.028524529176912734,"score_gpt":0.2678457779785755,"score_spread":0.23932124880166278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229847238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6791118,0.00046197805,0.21078643,0.0012978216,0.00009876833,0.00018294393,0.0009028682,0.0006703263,0.10648714],"genre_scores_gemma":[0.98498225,0.00014577151,0.010369029,0.00013154648,0.000022781394,0.00003845385,0.00027224666,0.0000443299,0.0039936183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993443,0.00014316678,0.000030293277,0.00018645971,0.000149439,0.00014647734],"domain_scores_gemma":[0.9964424,0.0012519138,0.0008585942,0.0005276787,0.0005340704,0.0003853903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054141495,0.00033933544,0.00042088848,0.0007304146,0.001048277,0.0019246953,0.0006841114,0.00039937813,0.009507431],"category_scores_gemma":[0.0027556967,0.0005338992,0.00038979814,0.00063701486,0.002372773,0.002767717,0.0013944834,0.0006702055,0.00077214406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002588736,0.000028493578,0.0021478822,0.00016541009,0.000034980647,0.00042154052,0.0005517415,0.0074985255,0.0063535646,0.9635101,0.0035050677,0.015523852],"study_design_scores_gemma":[0.00008043425,0.0000880677,0.0046695946,0.000060327784,0.00008766096,0.0010939887,0.0010452351,0.046512,0.015432268,0.9054652,0.025401136,0.00006402401],"about_ca_topic_score_codex":0.0017165304,"about_ca_topic_score_gemma":0.0021173581,"teacher_disagreement_score":0.009507431,"about_ca_system_score_codex":0.00078802556,"about_ca_system_score_gemma":0.00057619996,"threshold_uncertainty_score":0.031805456},"labels":[],"label_agreement":null},{"id":"W4230596415","doi":"10.1002/net.20169","title":"On the minimum path problem in Knödel graphs","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Logarithm; Bipartite graph; Longest path problem; Degree (music); Discrete mathematics; Shortest path problem; Graph","score_opus":0.016665121090767704,"score_gpt":0.27220704893071435,"score_spread":0.25554192783994667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230596415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31172976,0.0014417557,0.66567326,0.0035034763,0.00016241035,0.00028257538,0.0013516854,0.0015295275,0.014325537],"genre_scores_gemma":[0.67556643,0.0011655063,0.31038398,0.00048042467,0.00014290886,0.00025775534,0.0023849965,0.00036681193,0.009251084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999049,0.0003305117,0.000044070788,0.0002406756,0.00016711607,0.00016864343],"domain_scores_gemma":[0.9953751,0.0034687738,0.00032924916,0.00042605895,0.0002058843,0.00019497529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000951337,0.0007317136,0.0009660168,0.00086517853,0.0009024806,0.0017235415,0.0013855036,0.0011471616,0.006514387],"category_scores_gemma":[0.008058915,0.00037487654,0.0005335095,0.0015438396,0.00082113355,0.004821153,0.0016219992,0.0013160476,0.00074702245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018672239,0.0005818399,0.002886015,0.0009136166,0.00012144367,0.0004513344,0.00061850797,0.47088674,0.011424345,0.24314159,0.03647268,0.23063467],"study_design_scores_gemma":[0.00018428067,0.00018594008,0.0004737273,0.000047047644,0.000032255048,0.00034675095,0.00024503304,0.6025095,0.004301036,0.38327262,0.0083741415,0.00002770548],"about_ca_topic_score_codex":0.0023440665,"about_ca_topic_score_gemma":0.0027641384,"teacher_disagreement_score":0.006514387,"about_ca_system_score_codex":0.0016390396,"about_ca_system_score_gemma":0.001205073,"threshold_uncertainty_score":0.021792829},"labels":[],"label_agreement":null},{"id":"W4230754851","doi":"10.7251/139","title":"THE UPPER OPEN GEODETIC NUMBER OF A GRAPH","year":2012,"lang":"sr","type":"article","venue":"Зборник радова Економског факултета у Источном Сарајеву","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Geodetic datum; Combinatorics; Vertex (graph theory); Connectivity; Mathematics; Graph; Geodesic; Bound graph; Cardinality (data modeling); Discrete mathematics; Geodesy; Graph power; Computer science; Geometry; Geography; Line graph","score_opus":0.039316191930176714,"score_gpt":0.3667610176148421,"score_spread":0.3274448256846654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230754851","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49030194,0.0056572426,0.2301791,0.0025416906,0.0009855177,0.00024296794,0.0062890956,0.00091878267,0.26288372],"genre_scores_gemma":[0.9067585,0.0032594523,0.06585985,0.00038051564,0.000596427,0.0002419314,0.0032936337,0.00014540649,0.01946432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987966,0.00017236437,0.0000811285,0.000287153,0.0004083638,0.00025440735],"domain_scores_gemma":[0.99780935,0.00088904204,0.00030307198,0.0002583484,0.00038947252,0.00035081035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004344062,0.00052282994,0.0006812331,0.0032590677,0.0012073508,0.0030937293,0.00066424976,0.0006864572,0.0056609497],"category_scores_gemma":[0.0033055535,0.00033749195,0.0004836443,0.0023067761,0.0022514125,0.00305531,0.001486834,0.0011125273,0.0010060171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002478507,0.00005210545,0.0031463506,0.00036852524,0.00003602808,0.0003860966,0.0005466125,0.012622725,0.0069027655,0.8922397,0.009489068,0.07396218],"study_design_scores_gemma":[0.000036537447,0.00010354394,0.0048094075,0.00015996202,0.000038953527,0.0012187719,0.00040660263,0.026285667,0.004093427,0.87229854,0.09047198,0.00007659443],"about_ca_topic_score_codex":0.0014352964,"about_ca_topic_score_gemma":0.0014117123,"teacher_disagreement_score":0.0056609497,"about_ca_system_score_codex":0.0012010228,"about_ca_system_score_gemma":0.0007957587,"threshold_uncertainty_score":0.018937767},"labels":[],"label_agreement":null},{"id":"W4231986041","doi":"10.1002/1097-0118(200103)36:3<121::aid-jgt1000>3.0.co;2-u","title":"Tree embeddings","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Embedding; Graph; Discrete mathematics; Degree (music); Tree (set theory); Computer science","score_opus":0.017674241947864735,"score_gpt":0.2940075536422283,"score_spread":0.2763333116943636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231986041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050310917,0.0027501942,0.8297011,0.0019376818,0.0011926127,0.00017432102,0.0021671369,0.0018339409,0.109931916],"genre_scores_gemma":[0.4705122,0.0070613413,0.42323413,0.0014975456,0.001143387,0.0004757457,0.006168755,0.0016541309,0.08825278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992092,0.0001103937,0.00006402956,0.00027909226,0.0002036585,0.0001335611],"domain_scores_gemma":[0.99819404,0.0005461096,0.0002259277,0.00043192992,0.00039474154,0.00020729087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004609454,0.00069258723,0.0006185781,0.0012270708,0.0012268826,0.0027307398,0.0010626267,0.0010627315,0.021029297],"category_scores_gemma":[0.0036859682,0.00046616525,0.00094808417,0.0019208374,0.0008762443,0.007559395,0.0034048834,0.0021901962,0.006136818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006724832,0.000044602395,0.00052134617,0.00024724944,0.000023621222,0.00029261332,0.00053540105,0.0028690728,0.0036885662,0.8750918,0.015983293,0.10063513],"study_design_scores_gemma":[0.000018077584,0.000057713598,0.00045955429,0.0000674083,0.000037500376,0.0010275044,0.0002771402,0.011895487,0.0041942713,0.8385085,0.14343145,0.000025458885],"about_ca_topic_score_codex":0.00036499,"about_ca_topic_score_gemma":0.0004946683,"teacher_disagreement_score":0.021029297,"about_ca_system_score_codex":0.00055622694,"about_ca_system_score_gemma":0.00029576587,"threshold_uncertainty_score":0.07034999},"labels":[],"label_agreement":null},{"id":"W4233116492","doi":"10.1002/jgt.20244","title":"Tough spiders","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Combinatorics; Mathematics; Indifference graph; Hamiltonian path; Split graph; Pathwidth; Graph; Spider; Interval graph; Outerplanar graph; Discrete mathematics; 1-planar graph; Line graph; Physics","score_opus":0.017325918051113578,"score_gpt":0.302466478754902,"score_spread":0.28514056070378846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233116492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6498385,0.0009632934,0.20332196,0.0008795102,0.00029951404,0.00024855204,0.0010088992,0.0010789068,0.14236084],"genre_scores_gemma":[0.94318455,0.00037374778,0.036249723,0.00028247444,0.00007728706,0.000096155956,0.0008400924,0.00016763293,0.018728353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941325,0.000079060235,0.000029841898,0.00015784001,0.00018168207,0.0001383528],"domain_scores_gemma":[0.99818426,0.0004932968,0.00029852267,0.0003105015,0.00024363294,0.0004697899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027787036,0.0003672281,0.00047661332,0.0011766305,0.0018529817,0.0016614991,0.0007956264,0.0006950546,0.018647874],"category_scores_gemma":[0.0020867912,0.0004731879,0.0005403236,0.00074777426,0.0015572883,0.002421668,0.0029739817,0.0008754998,0.001737815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003429632,0.00009243785,0.0049819592,0.0003524322,0.00010224408,0.0011902417,0.0013350596,0.009219034,0.0237107,0.8693504,0.013073751,0.07624874],"study_design_scores_gemma":[0.00004307726,0.0001374686,0.003853664,0.00009304129,0.000065297114,0.0018894644,0.0010413206,0.02622714,0.008289344,0.89135426,0.06695202,0.000053837077],"about_ca_topic_score_codex":0.0010748222,"about_ca_topic_score_gemma":0.0014492528,"teacher_disagreement_score":0.018647874,"about_ca_system_score_codex":0.0004720141,"about_ca_system_score_gemma":0.00035452016,"threshold_uncertainty_score":0.062383354},"labels":[],"label_agreement":null},{"id":"W4233474037","doi":"10.1090/stml/061/07","title":"Infinite graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Computer science","score_opus":0.035585325981399074,"score_gpt":0.28144610809560294,"score_spread":0.24586078211420387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233474037","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076252217,0.0018141698,0.03551962,0.0013759586,0.00058537914,0.000023901272,0.00022226476,0.0002598459,0.9525736],"genre_scores_gemma":[0.18268509,0.0043033822,0.020821068,0.0010215825,0.0007533539,0.00012629287,0.00107584,0.0006106894,0.78860265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982315,0.000035215173,0.000005920397,0.00003914609,0.00007612979,0.000020383115],"domain_scores_gemma":[0.9997584,0.000084348896,0.000013152727,0.00005549738,0.000055077893,0.000033582626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015396485,0.0006186229,0.00039329633,0.0010840219,0.0013300147,0.002057544,0.0006715149,0.000604013,0.035294566],"category_scores_gemma":[0.0007402382,0.0003648571,0.00039287066,0.0010045225,0.001433552,0.0033224407,0.00114882,0.0019597197,0.008434816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036194951,0.000006273089,0.000023381332,0.00003250055,0.0000019119675,0.000016783079,0.00010013061,0.00026682988,0.00026739718,0.9692128,0.016210074,0.013858368],"study_design_scores_gemma":[0.0000023072807,0.0000037629331,0.000057645833,0.00003265957,0.000003928921,0.00007838704,0.0000490996,0.0006947138,0.00028925107,0.8871522,0.11163178,0.000004257326],"about_ca_topic_score_codex":0.0006243715,"about_ca_topic_score_gemma":0.0010680687,"teacher_disagreement_score":0.035294566,"about_ca_system_score_codex":0.0010183987,"about_ca_system_score_gemma":0.0004789159,"threshold_uncertainty_score":0.11807209},"labels":[],"label_agreement":null},{"id":"W4235526718","doi":"10.4171/owr/2013/02","title":"Graph Theory","year":2013,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Line graph; Mathematics; Combinatorics; Matroid; Graph; Graph theory; Discrete mathematics","score_opus":0.015043781832494699,"score_gpt":0.2606351500046955,"score_spread":0.2455913681722008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235526718","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008483493,0.061355636,0.2553636,0.05687285,0.012100294,0.00025026136,0.0033222993,0.0011612374,0.6010904],"genre_scores_gemma":[0.31490576,0.070708886,0.19589505,0.021997796,0.01703569,0.000819658,0.006197863,0.0015150629,0.3709242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803764,0.00057460484,0.00009989802,0.0005804994,0.00054296287,0.00016438888],"domain_scores_gemma":[0.99744546,0.0010717183,0.00008292029,0.00053684786,0.00068771036,0.000175396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017209478,0.0009627293,0.0013311995,0.0029147216,0.0024548653,0.005325101,0.0016002785,0.0018780581,0.028225629],"category_scores_gemma":[0.0044551254,0.0006228182,0.0012712779,0.00275286,0.0043949313,0.006074844,0.0026338852,0.0048157866,0.007102008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007525007,0.0000063307234,0.000080799975,0.00008548759,0.000011608324,0.000025967747,0.00013100117,0.0003740567,0.0001305629,0.9482671,0.033214767,0.017664785],"study_design_scores_gemma":[0.000005899597,0.0000060868238,0.00010933523,0.000060081387,0.0000053255535,0.0000746518,0.000056418852,0.0006780565,0.00008515922,0.79858756,0.20032394,0.000007537924],"about_ca_topic_score_codex":0.0033830951,"about_ca_topic_score_gemma":0.0027209066,"teacher_disagreement_score":0.028225629,"about_ca_system_score_codex":0.004384405,"about_ca_system_score_gemma":0.0014883823,"threshold_uncertainty_score":0.09442413},"labels":[],"label_agreement":null},{"id":"W4235539439","doi":"10.15803/ijnc.6.2_149","title":"A Practical Algorithm for Embedding Graphs on Torus","year":2016,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Torus; Embedding; Computer science; Time complexity; Implementation; Exponential function; Graph embedding; Algorithm; Graph; Theoretical computer science; Exponential growth; Mathematics; Artificial intelligence","score_opus":0.04362782216819385,"score_gpt":0.382500242558034,"score_spread":0.33887242038984017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235539439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01719128,0.00019763701,0.9661648,0.0006110665,0.00020616112,0.00022048023,0.00029841333,0.0063941944,0.00871596],"genre_scores_gemma":[0.158306,0.00032766224,0.8279419,0.00023674496,0.00010014036,0.00035599383,0.0022091663,0.00066401775,0.009858336],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989373,0.000100417135,0.00008967986,0.00031611774,0.0003348614,0.00022157274],"domain_scores_gemma":[0.9989023,0.00023327235,0.00008033649,0.00037242615,0.00032831202,0.00008328981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004284046,0.0012392527,0.0006743756,0.0009859509,0.0010500356,0.0009639532,0.0013799387,0.0011327114,0.011147131],"category_scores_gemma":[0.0025930356,0.00045677266,0.0008435594,0.0016623029,0.00066721305,0.0032334693,0.0026450737,0.0012507073,0.0039016528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047643998,0.0003987557,0.0012818581,0.0005462174,0.000080791855,0.0006315474,0.0005738348,0.06878576,0.0389308,0.0688847,0.072312094,0.74709725],"study_design_scores_gemma":[0.00035662478,0.0004768871,0.0008881839,0.000053312513,0.000115344395,0.0020010457,0.00073486095,0.67398936,0.034764726,0.18451709,0.10197386,0.0001287511],"about_ca_topic_score_codex":0.0020734228,"about_ca_topic_score_gemma":0.0027911644,"teacher_disagreement_score":0.011147131,"about_ca_system_score_codex":0.000822574,"about_ca_system_score_gemma":0.0016998783,"threshold_uncertainty_score":0.03729093},"labels":[],"label_agreement":null},{"id":"W4235772560","doi":"10.1007/978-1-4614-6170-8_100097","title":"Heterogeneous Graph","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.0257561604201205,"score_gpt":0.26854258467395653,"score_spread":0.24278642425383604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235772560","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008275075,0.0014806567,0.26814613,0.0012617975,0.00067892985,0.00013947493,0.0010516484,0.000958073,0.7180082],"genre_scores_gemma":[0.20031555,0.0046947887,0.15244594,0.0011552667,0.0006531111,0.0003205515,0.0056699,0.001767471,0.63297755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997894,0.00003226742,0.0000069496946,0.00007826023,0.000070199,0.000022936934],"domain_scores_gemma":[0.9997198,0.00006261051,0.000012380678,0.0001157972,0.000059512266,0.000029853614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022651815,0.0006355449,0.00033236243,0.0010722612,0.0010318721,0.0017333934,0.0009788442,0.0004920231,0.05053872],"category_scores_gemma":[0.0008305558,0.0003146008,0.00043214593,0.001374838,0.0006509378,0.0035524822,0.0016461585,0.001127408,0.011327086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001722987,0.000018183244,0.00009202248,0.00010115139,0.000010273356,0.00007307846,0.00008635755,0.0019634587,0.0015182544,0.8616868,0.04330128,0.09113196],"study_design_scores_gemma":[0.0000064426695,0.0000131353245,0.00020085686,0.00007017272,0.000023434946,0.00023160742,0.00010477804,0.0071557774,0.0024953834,0.6100301,0.37965783,0.000010428364],"about_ca_topic_score_codex":0.001165983,"about_ca_topic_score_gemma":0.0018646136,"teacher_disagreement_score":0.05053872,"about_ca_system_score_codex":0.00077531714,"about_ca_system_score_gemma":0.00050913054,"threshold_uncertainty_score":0.16906887},"labels":[],"label_agreement":null},{"id":"W4235983012","doi":"10.1090/conm/618/12349","title":"Exact Finite Difference Schemes","year":2014,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.03726260562589402,"score_gpt":0.30449115453820524,"score_spread":0.26722854891231124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235983012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029156664,0.0014234434,0.96097153,0.00030555393,0.00033176204,0.00007371586,0.00026913814,0.00046023363,0.033249024],"genre_scores_gemma":[0.20092383,0.0037608987,0.72439533,0.00053031935,0.00032951712,0.00033269988,0.0009548749,0.0005400909,0.06823238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991788,0.00021308879,0.00006465286,0.000106730855,0.00038198283,0.000054608114],"domain_scores_gemma":[0.9989594,0.0003574019,0.00006810647,0.0002833713,0.00028657436,0.000045161873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010365073,0.0006297859,0.0009505131,0.0006463314,0.00058262114,0.0016984944,0.0013426776,0.0013426285,0.013619285],"category_scores_gemma":[0.0046145064,0.00033328353,0.0008178268,0.0009163805,0.0010407383,0.0022030491,0.0019539348,0.0017029283,0.0042628148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005735167,0.000038548107,0.0003667874,0.0002710988,0.000026580685,0.00007291145,0.00017910858,0.10348234,0.0047932193,0.74147993,0.008569597,0.14066254],"study_design_scores_gemma":[0.00004105099,0.000046850502,0.00019666986,0.0001320268,0.000018240362,0.00018327904,0.00006152853,0.59293777,0.0054527977,0.27179605,0.12909372,0.000039982435],"about_ca_topic_score_codex":0.0014809777,"about_ca_topic_score_gemma":0.0011407483,"teacher_disagreement_score":0.013619285,"about_ca_system_score_codex":0.00083503773,"about_ca_system_score_gemma":0.00080606324,"threshold_uncertainty_score":0.045561016},"labels":[],"label_agreement":null},{"id":"W4236037274","doi":"10.32920/ryerson.14652594","title":"Wall cops and robbers","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Hypercube; Combinatorics; Graph; Computer science; Plane (geometry); Mathematics; Theoretical computer science; Geometry","score_opus":0.02797876477314936,"score_gpt":0.3040144018227216,"score_spread":0.27603563704957224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236037274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24990255,0.0013343919,0.469078,0.004744584,0.0007677654,0.0005939993,0.00080736843,0.00096369133,0.27180767],"genre_scores_gemma":[0.835979,0.0006608349,0.09255269,0.00090227823,0.00015585512,0.00053041114,0.0006633745,0.00037222373,0.06818335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976974,0.0009291649,0.00008232953,0.00047317322,0.00036037288,0.0004576125],"domain_scores_gemma":[0.9978162,0.00081052276,0.00027395948,0.00024403157,0.00014486742,0.0007103827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083483127,0.0011614508,0.00093138614,0.00055435306,0.0019166085,0.0027091175,0.0012746966,0.0016489689,0.01683222],"category_scores_gemma":[0.005256078,0.00054183626,0.00075274607,0.00042899413,0.0036046065,0.0060133524,0.0031667948,0.0020927805,0.0019252389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056145416,0.00012908783,0.0011146277,0.00017624068,0.000044477958,0.0003498034,0.0010523807,0.01845385,0.0039306204,0.9306766,0.013984504,0.029526312],"study_design_scores_gemma":[0.00014427099,0.00041650116,0.001747669,0.00019793364,0.000054078515,0.00065434567,0.0021883154,0.085990734,0.005182883,0.76533103,0.13799608,0.000096219104],"about_ca_topic_score_codex":0.0028149516,"about_ca_topic_score_gemma":0.0032043345,"teacher_disagreement_score":0.01683222,"about_ca_system_score_codex":0.0014419251,"about_ca_system_score_gemma":0.000964816,"threshold_uncertainty_score":0.056309402},"labels":[],"label_agreement":null},{"id":"W4236676762","doi":"10.1109/sct.1992.215385","title":"Self-witnessing polynomial-time complexity and prime factorization","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Time complexity; Factorization of polynomials; Computer science; Prime (order theory); Factorization; Polynomial; Prime factor; Prime time; Computational complexity theory; Theoretical computer science; Algebra over a field; Mathematics; Algorithm; Combinatorics; Matrix polynomial; Pure mathematics","score_opus":0.027140715676401743,"score_gpt":0.2783989629865446,"score_spread":0.25125824731014285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236676762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19535026,0.0005843877,0.763977,0.005431587,0.00013525401,0.0002465484,0.0008684938,0.002285095,0.031121453],"genre_scores_gemma":[0.8144393,0.0004350225,0.17409022,0.0005223094,0.00027982134,0.00029054168,0.0011976179,0.00030872718,0.008436418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579227,0.0010331473,0.00023141888,0.0012858788,0.000981577,0.0006757135],"domain_scores_gemma":[0.97682744,0.016600095,0.0013692296,0.0036974153,0.00090174034,0.0006041062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002757153,0.00069601904,0.00090608816,0.0007967481,0.0013958631,0.004014196,0.0018174188,0.0012552083,0.008450232],"category_scores_gemma":[0.017216828,0.00058527186,0.0019614059,0.001384544,0.0035983694,0.010329025,0.003080135,0.004005561,0.0009991855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005627338,0.00020876197,0.0028427606,0.00046341406,0.0000873039,0.000274022,0.00067953166,0.04156223,0.0058028772,0.88412005,0.0077180048,0.05567826],"study_design_scores_gemma":[0.000081001825,0.000060310485,0.00036877874,0.000023768387,0.000033503362,0.00020599204,0.00008817395,0.09149304,0.0050384933,0.8989486,0.0036328998,0.000025460757],"about_ca_topic_score_codex":0.0016133131,"about_ca_topic_score_gemma":0.0017466515,"teacher_disagreement_score":0.008450232,"about_ca_system_score_codex":0.0022033688,"about_ca_system_score_gemma":0.0021932735,"threshold_uncertainty_score":0.028268874},"labels":[],"label_agreement":null},{"id":"W4237366326","doi":"10.2478/v10037-006-0010-3","title":"Chordal Graphs","year":2006,"lang":"en","type":"article","venue":"Formalized Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Chordal graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.015325347601894192,"score_gpt":0.2766044067953619,"score_spread":0.2612790591934677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237366326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06067684,0.0049730013,0.6825428,0.0035992006,0.0013028866,0.0006119379,0.0036771116,0.001455054,0.2411612],"genre_scores_gemma":[0.7182458,0.00441736,0.21325582,0.001716506,0.000761424,0.0004882841,0.0037375197,0.00035826696,0.057019047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983594,0.00031839547,0.000121072735,0.00047601713,0.00041158742,0.00031364788],"domain_scores_gemma":[0.99877566,0.00027784857,0.00016250825,0.00030400034,0.0003310262,0.00014893977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084336166,0.000874364,0.00043592489,0.0017616091,0.0019210705,0.0036897038,0.0018297763,0.0010329821,0.011848258],"category_scores_gemma":[0.0023721964,0.00034725823,0.00071190135,0.0021221177,0.0033703106,0.006318926,0.0032130952,0.0019474123,0.0018272775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012097926,0.000007873344,0.00014634563,0.000053666692,0.000005385478,0.000055289995,0.00023663166,0.00046533655,0.0008201026,0.9888314,0.0021026365,0.0072632194],"study_design_scores_gemma":[0.000015992098,0.000024763094,0.00034722674,0.00006704323,0.000021294562,0.0003466267,0.00042507422,0.0029887676,0.0020914408,0.8344175,0.1592304,0.000023817387],"about_ca_topic_score_codex":0.0026212265,"about_ca_topic_score_gemma":0.0023814202,"teacher_disagreement_score":0.011848258,"about_ca_system_score_codex":0.001944234,"about_ca_system_score_gemma":0.0010290145,"threshold_uncertainty_score":0.039636433},"labels":[],"label_agreement":null},{"id":"W4237481075","doi":"10.1007/978-3-319-71743-2_9","title":"Inequalities","year":2017,"lang":"en","type":"book-chapter","venue":"Springer texts in education","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Subject (documents); Competition (biology); Computer science; World Wide Web; Biology; Ecology","score_opus":0.04005225720859527,"score_gpt":0.33753679237174644,"score_spread":0.29748453516315115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237481075","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025435411,0.0019120481,0.03564521,0.005298675,0.0014809463,0.00004337535,0.0012854517,0.000096936514,0.9516937],"genre_scores_gemma":[0.18611175,0.0070217988,0.024172638,0.006674036,0.0029075942,0.0005064736,0.0037116788,0.00063646695,0.76825756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985487,0.000235697,0.00007312507,0.0004014401,0.0004722897,0.0002687102],"domain_scores_gemma":[0.998706,0.0006169414,0.00008256144,0.00016699483,0.0003354425,0.000092035276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090548873,0.0010044158,0.0006417083,0.0019124601,0.0017048368,0.0036467751,0.0015361841,0.0012074894,0.12061723],"category_scores_gemma":[0.0047275927,0.00034931587,0.0007229986,0.0017749141,0.0024156866,0.004662141,0.0026754872,0.0052691307,0.021971267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014581205,0.000009341248,0.00003838911,0.00006348512,0.0000044804415,0.000021691067,0.000063208005,0.00013231675,0.00017249837,0.95826966,0.02672873,0.014481626],"study_design_scores_gemma":[0.000010872595,0.000008648504,0.00016061048,0.00006085282,0.000007702614,0.00009009569,0.000066174216,0.00059136,0.00025225175,0.84959835,0.14914611,0.000006883672],"about_ca_topic_score_codex":0.0025506588,"about_ca_topic_score_gemma":0.0020817807,"teacher_disagreement_score":0.12061723,"about_ca_system_score_codex":0.001936679,"about_ca_system_score_gemma":0.0011111362,"threshold_uncertainty_score":0.40350485},"labels":[],"label_agreement":null},{"id":"W4237624345","doi":"10.1002/jgt.10121","title":"Partitioning a graph into two isomorphic pieces","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Induced subgraph; Cograph; Property (philosophy); Discrete mathematics; Graph; Split graph; Line graph; Pathwidth","score_opus":0.018785615975345,"score_gpt":0.2971040975381128,"score_spread":0.2783184815627678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237624345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6620252,0.00065626483,0.27111447,0.0005128427,0.00019736786,0.0006851937,0.00067785475,0.00084759085,0.06328321],"genre_scores_gemma":[0.8670878,0.0002800635,0.11525708,0.00018352237,0.000057400583,0.00016266019,0.0014967544,0.00020831855,0.015266339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944454,0.0000876108,0.000035775764,0.00018578293,0.00013951225,0.00010680496],"domain_scores_gemma":[0.9992053,0.00016846518,0.00009522269,0.00033296196,0.000108463304,0.000089622336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017988062,0.000438041,0.00051624374,0.0011236361,0.0011478695,0.0016382018,0.0007522857,0.000698443,0.012034033],"category_scores_gemma":[0.0014619604,0.00036313388,0.00059217744,0.0013382528,0.0014197654,0.0026400727,0.002003752,0.0005333046,0.0012622494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014124066,0.00040519476,0.0062961164,0.000991053,0.0002436622,0.0020196263,0.0030921313,0.043035645,0.117877625,0.5143897,0.0107127465,0.29952416],"study_design_scores_gemma":[0.00016573335,0.0005020188,0.007579686,0.00021100866,0.00026429087,0.0018093707,0.0033549934,0.084679976,0.03835325,0.76982754,0.09314085,0.000111353555],"about_ca_topic_score_codex":0.0019593635,"about_ca_topic_score_gemma":0.0015753771,"teacher_disagreement_score":0.012034033,"about_ca_system_score_codex":0.0005872591,"about_ca_system_score_gemma":0.00043096364,"threshold_uncertainty_score":0.04025781},"labels":[],"label_agreement":null},{"id":"W4238082519","doi":"10.1002/net.20345","title":"Wavelength assignment in multifiber star networks","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Clemson University","keywords":"Maximization; Star network; Star (game theory); Path (computing); Computer science; Minification; Time complexity; Approximation algorithm; Wavelength-division multiplexing; Optimization problem; Mathematics; Algorithm; Mathematical optimization; Topology (electrical circuits); Combinatorics; Wavelength; Network topology; Physics; Optics; Computer network","score_opus":0.01544820293658534,"score_gpt":0.2726451021917512,"score_spread":0.25719689925516587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238082519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42907554,0.0006663007,0.5609063,0.0005629649,0.000058419762,0.00008941518,0.00019168461,0.00025450054,0.008194895],"genre_scores_gemma":[0.8953559,0.00034015303,0.100736365,0.000080520054,0.000045166496,0.00004911069,0.00015957301,0.000035202618,0.0031980488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994715,0.000195754,0.000018114326,0.000090808004,0.0001283912,0.00009547213],"domain_scores_gemma":[0.9991234,0.00040967562,0.00014866306,0.00008382282,0.00014475579,0.00008978625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072964374,0.00038036576,0.00045545047,0.0005532101,0.0006375843,0.00059352117,0.00069011917,0.00042957382,0.00213664],"category_scores_gemma":[0.0018078329,0.00020856883,0.00020167723,0.0008961577,0.0004592111,0.0013038774,0.00090890797,0.0004378573,0.00021326423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029901598,0.00011600628,0.0017067429,0.0001552334,0.000038493345,0.00017911613,0.0001990182,0.7938876,0.009209142,0.09071104,0.0030978199,0.10040079],"study_design_scores_gemma":[0.000019575024,0.00004081766,0.00033231155,0.0000063251496,0.0000057017705,0.000044287757,0.000044548742,0.9436306,0.0015925389,0.05195939,0.0023182598,0.000005544051],"about_ca_topic_score_codex":0.0014430913,"about_ca_topic_score_gemma":0.0018660794,"teacher_disagreement_score":0.00213664,"about_ca_system_score_codex":0.0009060208,"about_ca_system_score_gemma":0.00039685107,"threshold_uncertainty_score":0.007147789},"labels":[],"label_agreement":null},{"id":"W4238200461","doi":"10.1002/jgt.20420","title":"Path homomorphisms, graph colorings, and boolean matrices","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Combinatorics; Mathematics; Homomorphism; Path (computing); Graph; Constructive; Algebraic number; Chromatic scale; Discrete mathematics; Computer science","score_opus":0.012494258158381146,"score_gpt":0.2634158145642281,"score_spread":0.25092155640584696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238200461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4686398,0.0008330299,0.46512207,0.0018580004,0.00015917627,0.00015459662,0.0005934059,0.00074034213,0.061899718],"genre_scores_gemma":[0.90712523,0.00053655327,0.08504912,0.00030766413,0.00012461354,0.0001435834,0.00045206858,0.0003178327,0.005943398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981982,0.0005874027,0.000067758876,0.00038669232,0.00036100417,0.00039901276],"domain_scores_gemma":[0.9738966,0.021808371,0.0013808621,0.0016375349,0.0006545372,0.00062203984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003035804,0.0009969492,0.00062369613,0.0019295609,0.0014579784,0.0027231276,0.0016454393,0.0010938399,0.010774031],"category_scores_gemma":[0.017149424,0.000658085,0.0008989619,0.0017000644,0.003610633,0.0061928025,0.001972011,0.002773109,0.0008027259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034740768,0.000113054586,0.0011187517,0.00020611194,0.000029566258,0.00015903542,0.0002910114,0.05804053,0.0057187267,0.91275436,0.002815981,0.018405402],"study_design_scores_gemma":[0.000054237586,0.00008389657,0.00051900145,0.000051759296,0.00003310927,0.00013013775,0.00011715776,0.15426584,0.004943888,0.8369505,0.0028137567,0.000036784837],"about_ca_topic_score_codex":0.0025215044,"about_ca_topic_score_gemma":0.0035490454,"teacher_disagreement_score":0.010774031,"about_ca_system_score_codex":0.003958794,"about_ca_system_score_gemma":0.0016033287,"threshold_uncertainty_score":0.03604275},"labels":[],"label_agreement":null},{"id":"W4240422189","doi":"10.1002/jgt.20304","title":"Straight line embeddings of cubic planar graphs with integer edge lengths","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Mathematics; Polyhedral graph; Cubic graph; Embedding; Planar; Planar straight-line graph; Book embedding; Integer (computer science); Enhanced Data Rates for GSM Evolution; Graph; Line (geometry); Discrete mathematics; Line graph; 1-planar graph; Geometry; Computer science; Voltage graph; Telecommunications","score_opus":0.019259993860155224,"score_gpt":0.27004024612303285,"score_spread":0.25078025226287765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240422189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8579838,0.00018176337,0.10754433,0.00032643383,0.00006932788,0.00008701852,0.0003974399,0.000728338,0.032681562],"genre_scores_gemma":[0.9575503,0.00021889442,0.03372477,0.00005330128,0.000025154604,0.000050858154,0.0004135778,0.000093978015,0.007869253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997429,0.000029127457,0.000013348054,0.000053825504,0.00010230158,0.000058461537],"domain_scores_gemma":[0.9988269,0.0002426988,0.0004079056,0.00015213885,0.00021447611,0.00015588639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011483401,0.0007347532,0.00026255805,0.0007019165,0.00061672705,0.0010213207,0.0006199781,0.0005046146,0.009638717],"category_scores_gemma":[0.0012561323,0.0004922023,0.0003173345,0.00075735315,0.0009640515,0.0018907946,0.0018636208,0.0011147939,0.0015653536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018182303,0.00050408114,0.009289874,0.0010794743,0.00012799534,0.003332685,0.002817351,0.08038965,0.25063795,0.44160804,0.010170131,0.19822448],"study_design_scores_gemma":[0.0004627259,0.001532888,0.010158999,0.00017296708,0.00023899549,0.0031802976,0.003952923,0.22728947,0.16957887,0.49810398,0.085077494,0.00025037507],"about_ca_topic_score_codex":0.0008981653,"about_ca_topic_score_gemma":0.0012081647,"teacher_disagreement_score":0.009638717,"about_ca_system_score_codex":0.0004450296,"about_ca_system_score_gemma":0.00029179984,"threshold_uncertainty_score":0.032244742},"labels":[],"label_agreement":null},{"id":"W4241301040","doi":"10.1002/jgt.20205","title":"Independent dominating sets and hamiltonian cycles","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Hamiltonian path; Combinatorics; Hamiltonian (control theory); Graph; Hamiltonian path problem; Discrete mathematics; Mathematical optimization","score_opus":0.010089306253866797,"score_gpt":0.27225994589591235,"score_spread":0.26217063964204557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241301040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7562782,0.004359505,0.14311196,0.0023355065,0.000283559,0.00011230617,0.00082553306,0.00017176298,0.092521615],"genre_scores_gemma":[0.9807586,0.00057959935,0.012432528,0.00024988645,0.00010857103,0.000046263376,0.0002814628,0.000021205857,0.005521796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991146,0.00023205172,0.00004783628,0.0002561575,0.00020954871,0.00013987084],"domain_scores_gemma":[0.99612695,0.0022716387,0.0005760127,0.00031971865,0.00033226082,0.0003734533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007001564,0.0003584674,0.00069844234,0.001396129,0.0012900862,0.0015888694,0.0008456007,0.0006329076,0.0034870214],"category_scores_gemma":[0.004355646,0.00048043916,0.00034249696,0.0010661519,0.0018110039,0.0017240044,0.001520688,0.00081513997,0.00028742186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011809968,0.00005300414,0.0033409838,0.00030799635,0.00007733718,0.00055434613,0.0007565042,0.016314503,0.0051193465,0.9320225,0.0070492364,0.03428615],"study_design_scores_gemma":[0.000027891048,0.000048596812,0.0016577566,0.000053378957,0.000050311828,0.00092792884,0.00034520726,0.028005663,0.0030314932,0.9546098,0.011215028,0.000027001472],"about_ca_topic_score_codex":0.00068225386,"about_ca_topic_score_gemma":0.00079117937,"teacher_disagreement_score":0.0034870214,"about_ca_system_score_codex":0.0008480771,"about_ca_system_score_gemma":0.00042148368,"threshold_uncertainty_score":0.011665225},"labels":[],"label_agreement":null},{"id":"W4241335985","doi":"10.1002/jgt.20363","title":"Circle graph obstructions under pivoting","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Corollary; Circle graph; Mathematics; Outerplanar graph; Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.01817147925094919,"score_gpt":0.2891290677880259,"score_spread":0.2709575885370767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241335985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9435661,0.00013249606,0.029374966,0.00027427,0.000049475326,0.00005643453,0.00016834152,0.00041978818,0.025958076],"genre_scores_gemma":[0.99357754,0.00006567646,0.0033415041,0.00005513671,0.000020993259,0.000030184317,0.0002309251,0.00005315194,0.0026249036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990471,0.00013768308,0.000035984696,0.00018090488,0.00024272152,0.0003555954],"domain_scores_gemma":[0.9967878,0.001292498,0.00046137013,0.00052183773,0.0003735751,0.0005628867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042622047,0.00030223024,0.0006652466,0.0010458615,0.002065475,0.0017281767,0.0006154323,0.0007826605,0.0061773174],"category_scores_gemma":[0.0037251294,0.0002933513,0.0005340243,0.00081521604,0.0029623457,0.0019624562,0.0029155228,0.001043307,0.00072732265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008234367,0.0001559481,0.009352752,0.00019821635,0.000033883374,0.0018442963,0.0018733193,0.01048711,0.01809401,0.9263568,0.0054558497,0.025324482],"study_design_scores_gemma":[0.00012538723,0.00023164914,0.007492004,0.000053317533,0.00007366469,0.00189937,0.001910968,0.029171593,0.02114702,0.9177728,0.020039251,0.000082955135],"about_ca_topic_score_codex":0.0016182099,"about_ca_topic_score_gemma":0.0012938435,"teacher_disagreement_score":0.0061773174,"about_ca_system_score_codex":0.0007296813,"about_ca_system_score_gemma":0.00074825867,"threshold_uncertainty_score":0.020665169},"labels":[],"label_agreement":null},{"id":"W4241813520","doi":"10.1007/978-1-4939-7131-2_100370","title":"Exponential Family of Random Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Random graph; Exponential family; Exponential random graph models; Mathematics; Exponential function; Combinatorics; Computer science; Statistics; Graph; Mathematical analysis","score_opus":0.030297262794509578,"score_gpt":0.27517830898890216,"score_spread":0.24488104619439258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241813520","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053750943,0.011906233,0.28836593,0.011360811,0.0012483826,0.00012331344,0.0013235715,0.0009310074,0.6309899],"genre_scores_gemma":[0.56971955,0.020497117,0.043831073,0.0029540735,0.003258662,0.00047233634,0.0017560321,0.0008640217,0.35664716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993063,0.0001860668,0.000017566514,0.00015309671,0.0002653187,0.00007168268],"domain_scores_gemma":[0.99753153,0.0015230242,0.00010345063,0.0003390211,0.0003408414,0.00016211989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009051136,0.00077097025,0.0006601391,0.0014724076,0.0009645402,0.0022889017,0.0012137439,0.0011130144,0.01323602],"category_scores_gemma":[0.0071027004,0.0005120319,0.0006523513,0.0015226637,0.001710993,0.0046767015,0.0014393609,0.0032172687,0.0026868046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011638096,0.000008986279,0.00006987214,0.000040008803,0.000005124331,0.000020454421,0.00005323735,0.0012903077,0.00012322028,0.9787732,0.009811445,0.009792538],"study_design_scores_gemma":[0.000010356304,0.000006703274,0.0001613278,0.000026874533,0.0000068975755,0.00014156921,0.00002696539,0.008025221,0.00015820729,0.9644641,0.026963284,0.000008563672],"about_ca_topic_score_codex":0.00080485555,"about_ca_topic_score_gemma":0.00043737842,"teacher_disagreement_score":0.01323602,"about_ca_system_score_codex":0.0018402027,"about_ca_system_score_gemma":0.0008789662,"threshold_uncertainty_score":0.04427886},"labels":[],"label_agreement":null},{"id":"W4242981398","doi":"10.1109/asonam.2016.7752211","title":"Tradeoffs between density and size in extracting dense subgraphs: A unified framework","year":2016,"lang":"en","type":"article","venue":"2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Maximization; Range (aeronautics); Quadratic equation; Generalization; Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.0412797631814928,"score_gpt":0.34760454320269846,"score_spread":0.30632478002120567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242981398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00922734,0.0008382437,0.98784196,0.0003659509,0.000015011756,0.000091019865,0.000068426714,0.0003167781,0.0012351645],"genre_scores_gemma":[0.1865298,0.0014864217,0.8092846,0.00025319448,0.00013778002,0.00044104728,0.00035762787,0.0003547453,0.0011547789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917454,0.0039050675,0.0004088229,0.0014832822,0.0019546156,0.00050282],"domain_scores_gemma":[0.97592443,0.016854478,0.0013317293,0.0032212995,0.0020306623,0.00063734275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012753765,0.00209577,0.0027925156,0.0052755857,0.0016997011,0.003959973,0.004303632,0.0028221002,0.001985046],"category_scores_gemma":[0.042924885,0.0018301264,0.0020331957,0.004980296,0.0035232643,0.014321796,0.006277513,0.0034805918,0.00052031415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022947472,0.00037055268,0.0064199474,0.000682822,0.00024411506,0.00026497492,0.00081083947,0.54015183,0.009098465,0.17495558,0.005713184,0.2610582],"study_design_scores_gemma":[0.000024185481,0.00007791259,0.0009001701,0.000061144034,0.000074365424,0.00020541059,0.00012225058,0.9279091,0.0018598848,0.06677328,0.001953759,0.000038510945],"about_ca_topic_score_codex":0.0037524926,"about_ca_topic_score_gemma":0.0075861714,"teacher_disagreement_score":0.012753765,"about_ca_system_score_codex":0.0027472484,"about_ca_system_score_gemma":0.0026257369,"threshold_uncertainty_score":0.06744921},"labels":[],"label_agreement":null},{"id":"W4243040998","doi":"10.1002/jgt.20265","title":"Small cycle double covers of products I: Lexicographic product with paths and cycles","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Dalhousie University","funders":"","keywords":"Cartesian product; Lexicographical order; Combinatorics; Mathematics; Vertex (graph theory); Graph; Product (mathematics); Cartesian coordinate system; Discrete mathematics; Geometry","score_opus":0.022393583621144894,"score_gpt":0.266034926208744,"score_spread":0.24364134258759912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243040998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9104769,0.00051361695,0.064039886,0.000399082,0.00004691822,0.000061125764,0.00021717057,0.00016470088,0.024080664],"genre_scores_gemma":[0.97780365,0.00029221844,0.016729314,0.000075847296,0.000044378583,0.00004299401,0.00032107602,0.00003490258,0.0046555735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948823,0.000079554775,0.00004468056,0.00013560653,0.00015299905,0.000098886536],"domain_scores_gemma":[0.9984937,0.0005744659,0.00030318784,0.0002633569,0.00016267262,0.00020265834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048103285,0.00034985977,0.0005743708,0.0011119393,0.00120772,0.0020052257,0.00041858671,0.0005453289,0.0040467014],"category_scores_gemma":[0.0019819443,0.0005655616,0.00053015567,0.0010821274,0.0015386605,0.0028802291,0.0018818993,0.00063369866,0.0003734957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006917493,0.00012470805,0.016755521,0.00034566282,0.00008544176,0.0018353077,0.002351859,0.015274479,0.027519904,0.87893504,0.0042737424,0.05180658],"study_design_scores_gemma":[0.0000784478,0.0002890215,0.0055580814,0.000088116234,0.000130996,0.0033652077,0.0011154792,0.04637549,0.029229764,0.8854866,0.028232403,0.000050410497],"about_ca_topic_score_codex":0.00076481036,"about_ca_topic_score_gemma":0.0009221547,"teacher_disagreement_score":0.0040467014,"about_ca_system_score_codex":0.00066511065,"about_ca_system_score_gemma":0.00033931748,"threshold_uncertainty_score":0.013537586},"labels":[],"label_agreement":null},{"id":"W4244373956","doi":"10.1007/978-0-387-68276-1_7","title":"Combinatorial Analysis","year":2010,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Majorization; Graph theory; Graph; Mathematics; Combinatorics; Section (typography); Incidence matrix; Discrete mathematics; Computer science; Physics","score_opus":0.01776107994668128,"score_gpt":0.2875817969558252,"score_spread":0.2698207170091439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244373956","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058033,0.008952891,0.097482875,0.004055999,0.0018904251,0.000056553723,0.0009482078,0.00067732634,0.88013244],"genre_scores_gemma":[0.18801042,0.014030544,0.049574032,0.0023494768,0.00508149,0.00025710269,0.002631229,0.0015000156,0.73656565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995183,0.0000889268,0.00001486266,0.000111574074,0.00023247847,0.000033875214],"domain_scores_gemma":[0.99952984,0.00014143807,0.000025142806,0.00015278714,0.00011400593,0.000036812322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003363432,0.0010929764,0.0011442401,0.0032331957,0.0010782409,0.0036036372,0.00096127746,0.0008728158,0.048194174],"category_scores_gemma":[0.0016632663,0.00048647998,0.00079360476,0.002827914,0.0017090474,0.002879528,0.0011835728,0.0029395628,0.016673755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068038526,0.000015131528,0.000072533185,0.00007901197,0.000010873345,0.000021478734,0.000050636663,0.00063276006,0.0003681922,0.89301723,0.056674246,0.049051173],"study_design_scores_gemma":[0.000003854614,0.000005361507,0.00020656106,0.000032751755,0.000012100412,0.00012654286,0.000028170707,0.0025682424,0.00025947829,0.87962866,0.11712012,0.000008145322],"about_ca_topic_score_codex":0.0007697945,"about_ca_topic_score_gemma":0.0009521123,"teacher_disagreement_score":0.048194174,"about_ca_system_score_codex":0.0015578689,"about_ca_system_score_gemma":0.0005667158,"threshold_uncertainty_score":0.16122556},"labels":[],"label_agreement":null},{"id":"W4244488833","doi":"10.1007/978-3-319-70151-6_7","title":"Relations: Especially on (Integer) Sequences","year":2012,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Lexicographical order; Equivalence relation; Notation; Natural number; Mathematics; Order (exchange); Equivalence (formal languages); Set (abstract data type); Binary relation; Integer (computer science); Finite set; Combinatorics; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Arithmetic","score_opus":0.04505898733537834,"score_gpt":0.30019110386243564,"score_spread":0.2551321165270573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244488833","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009683176,0.026253711,0.32048792,0.0048724995,0.010098567,0.00012266921,0.0011896841,0.0014669303,0.6258249],"genre_scores_gemma":[0.1319725,0.03146938,0.17958267,0.0035347505,0.009885598,0.00033547622,0.002223299,0.0021196231,0.63887674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941087,0.00013091318,0.000044112236,0.00016540442,0.00019532628,0.00005349521],"domain_scores_gemma":[0.99927264,0.00037570423,0.000049561633,0.00016279191,0.00009528307,0.000044008535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044827285,0.0009167359,0.00055450527,0.0012938664,0.0011173248,0.0023789078,0.0008148848,0.0007359024,0.031463984],"category_scores_gemma":[0.002226923,0.00046662183,0.0005258953,0.0034672718,0.002204728,0.009336655,0.0013663775,0.0022748378,0.013702683],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019329647,0.000013868436,0.000057461417,0.00022573263,0.0000041483713,0.000051896324,0.00034505042,0.0004736085,0.001263454,0.86331177,0.041384358,0.092849225],"study_design_scores_gemma":[0.0000044773683,0.000018799903,0.0000997371,0.00011667267,0.0000056025265,0.00020033526,0.000089394634,0.00062802224,0.00080255355,0.5465696,0.4514528,0.000012055921],"about_ca_topic_score_codex":0.0010784001,"about_ca_topic_score_gemma":0.0017060831,"teacher_disagreement_score":0.031463984,"about_ca_system_score_codex":0.0010208231,"about_ca_system_score_gemma":0.0005331877,"threshold_uncertainty_score":0.10525751},"labels":[],"label_agreement":null},{"id":"W4245157219","doi":"10.1007/978-981-287-532-7_648-1","title":"Critical Braiding Approach to Ethno[Mathematics]","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics education; Mathematics; Sociology; Computer science","score_opus":0.08789507715122324,"score_gpt":0.3497326706677329,"score_spread":0.26183759351650965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245157219","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026072827,0.0042330143,0.1120839,0.0056173177,0.0014014983,0.00006589769,0.000102689395,0.0002893402,0.8735991],"genre_scores_gemma":[0.36331964,0.006214609,0.07220246,0.0027328809,0.0020424614,0.00048223857,0.00032449412,0.0013012341,0.55138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906176,0.00058056216,0.000030489335,0.00011726375,0.00013631482,0.00007352777],"domain_scores_gemma":[0.9990151,0.0005625736,0.000046529185,0.0001448811,0.0001694352,0.00006134909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011011154,0.00073889387,0.00049431785,0.0018107184,0.003627718,0.0041177766,0.0009802651,0.001095284,0.025034772],"category_scores_gemma":[0.002425422,0.000349366,0.00032305837,0.001689064,0.009619673,0.0061526336,0.0017267969,0.0026478702,0.00364487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011148345,0.0000013186342,0.000005581284,0.000011725921,3.8855788e-7,0.000004790832,0.0006139509,0.000015908712,0.00001961639,0.9918978,0.0044966172,0.002930994],"study_design_scores_gemma":[0.0000036479598,0.000003373123,0.000045125216,0.000061514904,0.0000024169467,0.000058995094,0.00062181946,0.00019667656,0.00009932515,0.78541887,0.21348388,0.0000043736504],"about_ca_topic_score_codex":0.0025450313,"about_ca_topic_score_gemma":0.005805088,"teacher_disagreement_score":0.025034772,"about_ca_system_score_codex":0.00286645,"about_ca_system_score_gemma":0.0015186751,"threshold_uncertainty_score":0.08374971},"labels":[],"label_agreement":null},{"id":"W4245789633","doi":"10.1002/jgt.20328","title":"Cycle spaces in topological spaces","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Cycle basis; Combinatorics; Hausdorff space; Complement (music); Discrete mathematics; Generalization; Space (punctuation); Zero-dimensional space; Topological space; Topology (electrical circuits); Graph; Line graph; Topological vector space; Computer science; Mathematical analysis","score_opus":0.026632276348587856,"score_gpt":0.2972262758258897,"score_spread":0.27059399947730184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245789633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45078608,0.0018681791,0.4459221,0.0018979912,0.00028598134,0.00014071265,0.00033943474,0.00028041223,0.09847911],"genre_scores_gemma":[0.96162724,0.00039919923,0.0269036,0.00014794535,0.00013782528,0.000089820554,0.00012074981,0.000045459492,0.010528192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995253,0.00015863945,0.000021377371,0.000088402485,0.00012602027,0.00008025576],"domain_scores_gemma":[0.99931693,0.00021099561,0.00008369774,0.00011115337,0.00012524013,0.00015199995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005954088,0.00042970586,0.0003301559,0.0014719954,0.000870474,0.002257611,0.00073899416,0.00079966895,0.0047981604],"category_scores_gemma":[0.0014759958,0.00015985355,0.00044605977,0.0009635864,0.003114832,0.0037072918,0.0020492577,0.0010673607,0.00037029252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035979767,0.0000034903762,0.00006698117,0.0000055547957,0.0000012127958,0.000017916074,0.00006877923,0.0007728614,0.00024485955,0.99774736,0.00011802528,0.00094927143],"study_design_scores_gemma":[0.0000045248885,0.000017586424,0.000091965245,0.0000084930225,0.0000028633035,0.00006381825,0.00007025874,0.011431135,0.00032246302,0.9815716,0.006409541,0.0000058201535],"about_ca_topic_score_codex":0.0007951387,"about_ca_topic_score_gemma":0.0005949008,"teacher_disagreement_score":0.0047981604,"about_ca_system_score_codex":0.00089560624,"about_ca_system_score_gemma":0.0004215281,"threshold_uncertainty_score":0.016051471},"labels":[],"label_agreement":null},{"id":"W4247202641","doi":"10.1007/s004930070033","title":"Adaptive Multicolouring","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02092664864078052,"score_gpt":0.27073266581200073,"score_spread":0.2498060171712202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247202641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1850382,0.00064616883,0.6641758,0.00067417213,0.0007089008,0.00022006531,0.00044957435,0.003981789,0.14410536],"genre_scores_gemma":[0.7834922,0.00027828617,0.16040416,0.00042487952,0.00023003593,0.00012278637,0.00034923485,0.0007439076,0.053954504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954104,0.000056698496,0.000016428212,0.00015661947,0.00012883681,0.000100396406],"domain_scores_gemma":[0.998326,0.00031391808,0.00008938426,0.0009773904,0.00017397816,0.00011925718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030507482,0.0004082723,0.00040136854,0.00081809575,0.00096037076,0.0009807621,0.0010849754,0.00067397207,0.022910325],"category_scores_gemma":[0.002091572,0.00023651864,0.0004558344,0.0007408056,0.0009092842,0.0016995133,0.002263929,0.0012571238,0.0025016693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046902668,0.00021480376,0.0013486055,0.0002202842,0.00004425847,0.00023825844,0.0002856727,0.025931237,0.056138255,0.45189372,0.01594257,0.44727337],"study_design_scores_gemma":[0.00014434534,0.0002986339,0.0024996682,0.00008985877,0.00007896373,0.0008121954,0.0002129367,0.3342144,0.067655206,0.52319777,0.070711054,0.00008500796],"about_ca_topic_score_codex":0.00042769118,"about_ca_topic_score_gemma":0.0009896415,"teacher_disagreement_score":0.022910325,"about_ca_system_score_codex":0.0004886739,"about_ca_system_score_gemma":0.0003849348,"threshold_uncertainty_score":0.07664269},"labels":[],"label_agreement":null},{"id":"W4247832516","doi":"10.1002/jgt.20271","title":"Maximum acyclic and fragmented sets in regular graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Bounded function; Graph; Upper and lower bounds; Order (exchange); Discrete mathematics","score_opus":0.01239526032330909,"score_gpt":0.2878449829069343,"score_spread":0.2754497225836252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247832516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8790044,0.0008011271,0.10553804,0.00053219794,0.000018398978,0.000049680224,0.0007518726,0.0003055593,0.012998748],"genre_scores_gemma":[0.973417,0.00015523797,0.023764528,0.00007514317,0.000022651306,0.000039694572,0.0006604171,0.000035558172,0.0018297036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989441,0.00023063555,0.000068075424,0.00028398866,0.00033470945,0.00013843169],"domain_scores_gemma":[0.9910858,0.0055371365,0.0011870563,0.0010508244,0.0005028873,0.0006363351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008228253,0.00025543055,0.00064372213,0.0019259361,0.0011165348,0.0016490184,0.0012599372,0.0008066549,0.0041814],"category_scores_gemma":[0.007337827,0.00068562693,0.0005177132,0.0017470116,0.0020666176,0.0031892965,0.0013161064,0.0007973637,0.00026065175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011480217,0.00015408498,0.015076472,0.00057681196,0.0001322683,0.0013286629,0.0024816953,0.046301715,0.01668841,0.8464091,0.0036351418,0.06606768],"study_design_scores_gemma":[0.00008018582,0.00009591167,0.0060867076,0.00009015087,0.00008424072,0.0019293,0.0006275083,0.077467225,0.0063630636,0.8995748,0.0075670043,0.000033851582],"about_ca_topic_score_codex":0.0014015303,"about_ca_topic_score_gemma":0.001994516,"teacher_disagreement_score":0.0041814,"about_ca_system_score_codex":0.0009305434,"about_ca_system_score_gemma":0.00031731575,"threshold_uncertainty_score":0.013988197},"labels":[],"label_agreement":null},{"id":"W4247937443","doi":"10.1002/jgt.20262","title":"Compatible circuit decompositions of 4‐regular graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Combinatorics; Mathematics; Eulerian path; Conjecture; Vertex (graph theory); Discrete mathematics; Cubic graph; Graph; Line graph; Voltage graph; Pure mathematics; Lagrangian","score_opus":0.020600229845801045,"score_gpt":0.2970902916336,"score_spread":0.27649006178779895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247937443","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9503687,0.00008454382,0.043886613,0.000096793614,0.00001650586,0.00005151791,0.00026285148,0.00023235995,0.0050000446],"genre_scores_gemma":[0.9905267,0.000027779908,0.008269839,0.000026791453,0.000008070017,0.00003205126,0.00027664943,0.00002569692,0.0008064359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999524,0.0000564402,0.000031686544,0.00015707436,0.000101370344,0.00012942731],"domain_scores_gemma":[0.9990195,0.00027871985,0.00022183139,0.00016469,0.000109486034,0.00020576223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002635354,0.0002723802,0.0003039287,0.0009832521,0.0006435206,0.0010527099,0.00046246644,0.00043252367,0.003204431],"category_scores_gemma":[0.001257656,0.00038487389,0.0005183042,0.0005263554,0.00081827276,0.0012824343,0.00083626044,0.0005384837,0.0002082227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010701348,0.0002367662,0.019648157,0.00024199016,0.00010513494,0.0022706622,0.0016058774,0.041897543,0.10017863,0.79057115,0.0025227163,0.03965124],"study_design_scores_gemma":[0.00020385791,0.00032462183,0.01119341,0.00007635338,0.00014783868,0.0015674386,0.0008268341,0.17005554,0.055240586,0.7473035,0.012992857,0.000067113295],"about_ca_topic_score_codex":0.00078155263,"about_ca_topic_score_gemma":0.0010724263,"teacher_disagreement_score":0.003204431,"about_ca_system_score_codex":0.0006270784,"about_ca_system_score_gemma":0.00033709162,"threshold_uncertainty_score":0.010719895},"labels":[],"label_agreement":null},{"id":"W4248423866","doi":"10.1002/jgt.20310","title":"Disjoint quasi‐kernels in digraphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Digraph; Combinatorics; Disjoint sets; Mathematics; Vertex (graph theory); Transitive relation; Multipartite; Discrete mathematics; Kernel (algebra); Graph; Physics","score_opus":0.025463151831893203,"score_gpt":0.2833942381524385,"score_spread":0.25793108632054534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248423866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60309005,0.00082627696,0.36834568,0.0006956407,0.00010931645,0.00022721621,0.0012749407,0.0007932259,0.024637586],"genre_scores_gemma":[0.9505676,0.00030428832,0.04267464,0.00014540442,0.00004686705,0.00011029488,0.0007591786,0.00007074015,0.0053208414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988966,0.00020998168,0.000119625925,0.00038740173,0.00017763476,0.00020862176],"domain_scores_gemma":[0.99369735,0.002714887,0.00094426837,0.001067326,0.0006609893,0.0009152635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083195505,0.00038434006,0.00073517906,0.0017354748,0.0015451697,0.0020980341,0.0007799315,0.00075821363,0.005301256],"category_scores_gemma":[0.0042290003,0.0007105011,0.00075809006,0.0010701682,0.0019149102,0.0052301288,0.0018532297,0.00088554627,0.0006780929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022183589,0.0001244763,0.0038173783,0.00025491795,0.00006256196,0.00081042113,0.0008662186,0.00974548,0.005626519,0.95564806,0.0019189081,0.020903112],"study_design_scores_gemma":[0.00007619245,0.00010750854,0.0019566002,0.00006977624,0.00007963227,0.0010971938,0.0003886645,0.05237285,0.0045499937,0.92656344,0.012684055,0.000054221484],"about_ca_topic_score_codex":0.0017237115,"about_ca_topic_score_gemma":0.001858113,"teacher_disagreement_score":0.005301256,"about_ca_system_score_codex":0.0013299418,"about_ca_system_score_gemma":0.0007594502,"threshold_uncertainty_score":0.017734528},"labels":[],"label_agreement":null},{"id":"W4248887642","doi":"10.1016/j.disc.2006.03.009","title":"Edmonds polytopes and a hierarchy of combinatorial problems","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Polytope; Closure (psychology); Polyhedron; Rank (graph theory); Integer (computer science); Bounded function; Discrete mathematics; Integer programming; Order (exchange); Upper and lower bounds; Set (abstract data type); Linear programming; Linear inequality; Inequality; Mathematical optimization","score_opus":0.012975112282765456,"score_gpt":0.26285539803572117,"score_spread":0.2498802857529557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248887642","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35108364,0.011426065,0.26219994,0.017966725,0.00076562003,0.00022982701,0.0016951966,0.00049373135,0.3541392],"genre_scores_gemma":[0.8034398,0.008111641,0.09687988,0.0016181344,0.0010694808,0.00025480182,0.0019405488,0.00022290136,0.08646282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985014,0.00043107185,0.000075637465,0.0002523048,0.00041277343,0.0003268693],"domain_scores_gemma":[0.99528617,0.0030860614,0.00032331946,0.00034685034,0.0003576739,0.0005998955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013241697,0.0009819551,0.0020531632,0.0036971276,0.0041380413,0.0076500066,0.002651725,0.0028107718,0.019985259],"category_scores_gemma":[0.0068671335,0.0012063547,0.0018110529,0.005190562,0.004055133,0.0076657627,0.002886313,0.00748623,0.0014592967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024345416,0.000040785326,0.00020636294,0.000074284486,0.0000109847715,0.000054148975,0.00012726984,0.0032168543,0.00011839186,0.9849097,0.004402258,0.0068147653],"study_design_scores_gemma":[0.000023293862,0.000009564286,0.00020053209,0.000038399998,0.0000100114785,0.00010435961,0.00014392304,0.010614998,0.00008536295,0.9823803,0.0063781044,0.000011075769],"about_ca_topic_score_codex":0.0038697883,"about_ca_topic_score_gemma":0.004487277,"teacher_disagreement_score":0.019985259,"about_ca_system_score_codex":0.004369618,"about_ca_system_score_gemma":0.0013020905,"threshold_uncertainty_score":0.06685734},"labels":[],"label_agreement":null},{"id":"W4249553598","doi":"10.1002/jgt.20202","title":"Between ends and fibers","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Equivalence relation; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.01167765994295173,"score_gpt":0.2656986678228765,"score_spread":0.25402100787992477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249553598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35780123,0.0038566925,0.3133703,0.0025771095,0.001013103,0.00010508651,0.00081032625,0.00068691693,0.3197793],"genre_scores_gemma":[0.88383204,0.0013814478,0.058301985,0.0008093278,0.0006939489,0.00015095675,0.000906119,0.00032034304,0.053603858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842936,0.00028393327,0.00009570259,0.00059728255,0.0003481751,0.0002455408],"domain_scores_gemma":[0.99639845,0.0014725622,0.0004857662,0.0005358901,0.00060012157,0.0005071471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010236937,0.0005472993,0.0005676643,0.0020416393,0.002975352,0.0042023873,0.0008523173,0.0015469504,0.011036161],"category_scores_gemma":[0.0037830146,0.0004917624,0.0006322294,0.0008014189,0.004266184,0.009119991,0.003873424,0.002961967,0.0019515379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006851978,0.000013149225,0.0007022946,0.00003190467,0.000008221859,0.00014865995,0.00043019606,0.0006611893,0.000789104,0.9885132,0.00076118973,0.007872242],"study_design_scores_gemma":[0.000009483757,0.000029254097,0.00040002947,0.00004059078,0.000008913372,0.00017196227,0.00033131678,0.0015702016,0.0010075863,0.98170483,0.014714635,0.000011163359],"about_ca_topic_score_codex":0.0006635313,"about_ca_topic_score_gemma":0.00058176334,"teacher_disagreement_score":0.011036161,"about_ca_system_score_codex":0.00092938583,"about_ca_system_score_gemma":0.00038515983,"threshold_uncertainty_score":0.036919653},"labels":[],"label_agreement":null},{"id":"W4249649555","doi":"10.1002/jgt.20004","title":"Spanning<i>k</i>‐arc‐strong subdigraphs with few arcs in<i>k</i>‐arc‐strong tournaments","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Tournament; Arc (geometry); Combinatorics; Conjecture; Vertex (graph theory); Mathematics; Graph; Geometry","score_opus":0.017238159962472115,"score_gpt":0.27887144748304976,"score_spread":0.26163328752057763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249649555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93760294,0.00013996591,0.053476367,0.00020625893,0.000023614382,0.000065734224,0.0002739796,0.00019372723,0.008017401],"genre_scores_gemma":[0.97321725,0.00006263077,0.024450248,0.000061920226,0.000016310469,0.00005778286,0.00040103402,0.000030236219,0.0017024906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992945,0.00012019342,0.00006187847,0.00018726979,0.00010073941,0.00023534456],"domain_scores_gemma":[0.9978157,0.000713769,0.0004902314,0.00030170754,0.00017248337,0.00050613604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047658058,0.0004176459,0.000423226,0.00044806334,0.00081082614,0.0012854682,0.00062909216,0.00035378025,0.0039122696],"category_scores_gemma":[0.0021264642,0.00028617666,0.0007662621,0.00059306057,0.0006802169,0.0011305603,0.0010192484,0.00078157795,0.00029511435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003715364,0.0013939852,0.12306674,0.0011710322,0.0005646195,0.0015848484,0.0017202736,0.25120696,0.21688889,0.23246063,0.014002047,0.15222462],"study_design_scores_gemma":[0.0004340253,0.001866248,0.06645706,0.00016055217,0.00036750897,0.0026244842,0.001403798,0.6252252,0.06552838,0.20981446,0.02601267,0.00010562578],"about_ca_topic_score_codex":0.0013142519,"about_ca_topic_score_gemma":0.0016564771,"teacher_disagreement_score":0.0039122696,"about_ca_system_score_codex":0.00071087125,"about_ca_system_score_gemma":0.00035893437,"threshold_uncertainty_score":0.013087869},"labels":[],"label_agreement":null},{"id":"W4249657637","doi":"10.1002/jgt.20375","title":"Circular choosability","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Conseil Régional Provence-Alpes-Côte d'Azur; Commonwealth Scholarship Commission; University of Oxford","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Bounded function; Planar; Generalization; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.015441950375016986,"score_gpt":0.28929294776738507,"score_spread":0.27385099739236807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249657637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77754027,0.0010786767,0.17748718,0.0016266784,0.0001362984,0.000116357165,0.0005514953,0.00031761642,0.04114555],"genre_scores_gemma":[0.9854629,0.00028456468,0.009944036,0.00018643794,0.00007514313,0.000047581474,0.00021121996,0.00005496671,0.0037331143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881387,0.00020477446,0.000054221447,0.00033532476,0.0003569925,0.0002349547],"domain_scores_gemma":[0.9905516,0.005227788,0.0013756478,0.0014208716,0.0005576277,0.00086645706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010586673,0.00027754842,0.0004988513,0.0007459124,0.0010782912,0.0012567976,0.0011072535,0.0007881431,0.008444021],"category_scores_gemma":[0.007436745,0.00037638628,0.00063757395,0.0009121956,0.0027854948,0.002709916,0.001999259,0.0011792874,0.00045194585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009715918,0.000100990874,0.01680845,0.00038831233,0.00010012873,0.0007809338,0.0007913937,0.05092501,0.022216704,0.85208637,0.0070733665,0.047756746],"study_design_scores_gemma":[0.00017384149,0.00042396708,0.01039425,0.00008544363,0.00010285514,0.002933444,0.00069549266,0.18527289,0.024953296,0.74934417,0.025521457,0.00009893643],"about_ca_topic_score_codex":0.0011759244,"about_ca_topic_score_gemma":0.0007474362,"teacher_disagreement_score":0.008444021,"about_ca_system_score_codex":0.0010499606,"about_ca_system_score_gemma":0.00051011227,"threshold_uncertainty_score":0.028248012},"labels":[],"label_agreement":null},{"id":"W4249894547","doi":"10.1002/jgt.10148","title":"Weakening arcs in tournaments","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Regina","funders":"","keywords":"Tournament; Arc (geometry); Mathematics; Combinatorics; Graph; Discrete mathematics; Geometry","score_opus":0.017712551384883285,"score_gpt":0.288039795630729,"score_spread":0.27032724424584575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249894547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9256703,0.00045455425,0.06245014,0.00019693334,0.00004188768,0.0000688887,0.00034425518,0.00031863624,0.010454309],"genre_scores_gemma":[0.97752476,0.0001347094,0.018705944,0.000039862993,0.00004641977,0.00003698684,0.00033308435,0.00003594562,0.0031424053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896455,0.00014634294,0.00011293288,0.0002614748,0.00027244963,0.00024223299],"domain_scores_gemma":[0.99396557,0.0029785084,0.0011515743,0.000699232,0.00060867035,0.0005964264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008829314,0.00035944575,0.0006434068,0.0020911023,0.00096125685,0.0019457355,0.0007920008,0.0005243029,0.0041804886],"category_scores_gemma":[0.007434468,0.0003077208,0.0005805013,0.0013495885,0.0010353018,0.0021975604,0.00094823405,0.0011322146,0.00037211744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096172263,0.0003241525,0.04511288,0.00058319856,0.00013728453,0.00057906855,0.0013070412,0.06745164,0.027747693,0.6424856,0.0040693926,0.20924027],"study_design_scores_gemma":[0.000070503644,0.00038361386,0.013691461,0.00009893037,0.00018413115,0.0012342273,0.00040429406,0.21254808,0.01873222,0.7399742,0.012599051,0.00007925857],"about_ca_topic_score_codex":0.0009442196,"about_ca_topic_score_gemma":0.0011402908,"teacher_disagreement_score":0.0041804886,"about_ca_system_score_codex":0.0007105281,"about_ca_system_score_gemma":0.00031915613,"threshold_uncertainty_score":0.013985157},"labels":[],"label_agreement":null},{"id":"W4250290902","doi":"10.1007/s003730050014","title":"Group Connectivity of 3-Edge-Connected Chordal Graphs","year":2000,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Path graph; Induced subgraph; Connectivity; Bound graph; Vertex connectivity; Wheel graph; Chordal graph; Induced path; Hamiltonian path; Graph; Discrete mathematics; Graph power; Vertex (graph theory); Line graph; Longest path problem","score_opus":0.011794593628280486,"score_gpt":0.24316710782463466,"score_spread":0.23137251419635418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250290902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9402027,0.00030841728,0.023191689,0.00063029723,0.000046300967,0.00007931772,0.00051928364,0.00016334788,0.03485869],"genre_scores_gemma":[0.9904274,0.00023447446,0.006083806,0.000109169254,0.000034665853,0.00005855682,0.00045832325,0.000028461585,0.0025650496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971074,0.000058436297,0.000016488279,0.00007608175,0.00006114943,0.00007715203],"domain_scores_gemma":[0.99785304,0.00093518605,0.00048795942,0.0001948292,0.00022148089,0.00030754798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020178262,0.00028504874,0.00049989397,0.0012976798,0.0011475906,0.0018240554,0.0011063362,0.0009549237,0.0085787345],"category_scores_gemma":[0.002164603,0.00025192383,0.00026672112,0.0013731145,0.0012106685,0.0020882722,0.0010257526,0.0007852385,0.00053247664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011990179,0.00025138797,0.010134985,0.000536042,0.00007434431,0.0011551866,0.004060638,0.015162811,0.031323466,0.87094975,0.007617465,0.05753497],"study_design_scores_gemma":[0.0001612052,0.0001113331,0.005413383,0.000057022928,0.00005125028,0.0005183873,0.0016256286,0.022893207,0.005381759,0.95595235,0.0078050303,0.000029475503],"about_ca_topic_score_codex":0.0014802472,"about_ca_topic_score_gemma":0.0013909539,"teacher_disagreement_score":0.0085787345,"about_ca_system_score_codex":0.00050736155,"about_ca_system_score_gemma":0.00034043565,"threshold_uncertainty_score":0.028698742},"labels":[],"label_agreement":null},{"id":"W4250937028","doi":"10.1002/jgt.10140","title":"Steiner type problems for digraphs that are locally semicomplete or extended semicomplete","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Mathematics; Combinatorics; Graph; Polynomial; Directed graph; Discrete mathematics","score_opus":0.05605105297153749,"score_gpt":0.30124318246946197,"score_spread":0.24519212949792446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250937028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7668024,0.00092363055,0.22132811,0.00088042975,0.00007832269,0.00028025304,0.0013865986,0.00029804913,0.008022212],"genre_scores_gemma":[0.8387117,0.0006376536,0.15208213,0.00016319728,0.00007290175,0.00014974581,0.002894645,0.000056611785,0.005231517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959964,0.00011024132,0.000047170386,0.00010892165,0.00006814082,0.0000658453],"domain_scores_gemma":[0.9977709,0.001465302,0.00033611525,0.00017629722,0.000086135275,0.00016527843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006400241,0.00058458,0.0008868002,0.00073195976,0.00065536273,0.0010657761,0.0006119151,0.0010197515,0.00456417],"category_scores_gemma":[0.0028486485,0.0005771426,0.00090958056,0.0014007424,0.000810114,0.0023015374,0.0010639247,0.00078238273,0.0002789789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015813109,0.0005326437,0.009107899,0.001724474,0.00039489925,0.0023808887,0.00092553376,0.49148384,0.018722478,0.31467474,0.015152127,0.14331914],"study_design_scores_gemma":[0.0004565228,0.00038350522,0.0038416304,0.00015022041,0.0002067046,0.0018829816,0.0007449002,0.46264064,0.008075943,0.5110291,0.010532255,0.000055577788],"about_ca_topic_score_codex":0.0010688311,"about_ca_topic_score_gemma":0.0020521854,"teacher_disagreement_score":0.00456417,"about_ca_system_score_codex":0.0009462797,"about_ca_system_score_gemma":0.00055272726,"threshold_uncertainty_score":0.015268683},"labels":[],"label_agreement":null},{"id":"W4251499002","doi":"10.1002/jgt.20036","title":"Graphs with independent perfect matchings","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Perfect graph theorem; Strong perfect graph theorem; Perfect graph; Trivially perfect graph; Matching (statistics); Discrete mathematics; Line graph; Graph; Pathwidth","score_opus":0.009461830976999132,"score_gpt":0.2545278158753462,"score_spread":0.24506598489834705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251499002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8704271,0.0007835833,0.09474597,0.00059522747,0.000050857856,0.0000734242,0.0013114276,0.00042763495,0.031584855],"genre_scores_gemma":[0.97873014,0.0002650223,0.017069925,0.0000736092,0.000048311995,0.00005519808,0.0008000485,0.00003811936,0.0029196874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991177,0.0001316278,0.000049295464,0.00025070284,0.0002218536,0.00022881327],"domain_scores_gemma":[0.99821234,0.00059604493,0.0004654914,0.00035387027,0.00016713224,0.00020505473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000339235,0.00037453277,0.0006556398,0.0012232536,0.001120166,0.0014817894,0.00077550113,0.00062366313,0.004395453],"category_scores_gemma":[0.002979256,0.0005167755,0.00052739977,0.0018042034,0.0010323668,0.0021625194,0.0016145909,0.00065692107,0.00044382812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006500469,0.00011569737,0.009677125,0.00035380237,0.00017580339,0.001080628,0.00084113097,0.03357557,0.0166198,0.8548868,0.0083956225,0.07362807],"study_design_scores_gemma":[0.0000729778,0.000094047966,0.0067830686,0.00005353354,0.00010255141,0.0017666228,0.0005285204,0.07099489,0.0071348078,0.89383507,0.01859114,0.000042769974],"about_ca_topic_score_codex":0.000782998,"about_ca_topic_score_gemma":0.0008113304,"teacher_disagreement_score":0.004395453,"about_ca_system_score_codex":0.0006108324,"about_ca_system_score_gemma":0.0003548211,"threshold_uncertainty_score":0.014704287},"labels":[],"label_agreement":null},{"id":"W4251692629","doi":"10.1002/net.20159","title":"The bridges of Königsberg—A historical perspective","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Perspective (graphical); Computer science; Graph theory; Graph; Operations research; Combinatorics; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.01678236245234923,"score_gpt":0.2940905582696183,"score_spread":0.27730819581726907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251692629","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024699962,0.22339317,0.016011756,0.047024988,0.0032649233,0.000028378567,0.00023551799,0.00008155014,0.6852597],"genre_scores_gemma":[0.80656224,0.12514403,0.005656734,0.0067007425,0.0046527125,0.00007191624,0.00017787392,0.00010014983,0.05093358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989317,0.0003606204,0.000059490878,0.00026424747,0.0002588196,0.0001250737],"domain_scores_gemma":[0.9985133,0.00081336976,0.00014737349,0.000125396,0.00026065775,0.00013984533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021289517,0.00038422397,0.00037039418,0.003367931,0.0033737684,0.0046995385,0.0009079056,0.0022924992,0.0068416037],"category_scores_gemma":[0.004077249,0.00026996748,0.00020201209,0.0032879564,0.007946174,0.009215877,0.0021819056,0.0036328337,0.0008968876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004397221,0.0000042494853,0.00004808247,0.00002764722,0.0000020032908,0.00002383194,0.00033930846,0.00013196119,0.000016265243,0.9896992,0.0038671198,0.005835962],"study_design_scores_gemma":[0.0000036671045,0.000011414855,0.0002531584,0.0001744171,0.000004360937,0.00013953872,0.0003899397,0.00041722064,0.000116146286,0.73522717,0.26325402,0.00000898561],"about_ca_topic_score_codex":0.0044647395,"about_ca_topic_score_gemma":0.0027434793,"teacher_disagreement_score":0.0068416037,"about_ca_system_score_codex":0.005271248,"about_ca_system_score_gemma":0.0014043374,"threshold_uncertainty_score":0.038245738},"labels":[],"label_agreement":null},{"id":"W4251858507","doi":"10.1007/978-1-4939-7131-2_101355","title":"Time-Varying Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.029865651204645575,"score_gpt":0.28319086545208744,"score_spread":0.25332521424744187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251858507","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020057902,0.010878971,0.27359614,0.004535581,0.003360476,0.000056229095,0.0007678797,0.0007478682,0.6859989],"genre_scores_gemma":[0.39262268,0.017205946,0.049487222,0.002093564,0.0026308182,0.000117804935,0.0013772419,0.0012057554,0.533259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998216,0.000038615537,0.0000038142523,0.00006255768,0.00005425959,0.000019243824],"domain_scores_gemma":[0.9995308,0.00022169633,0.000031107145,0.00009829828,0.00006985918,0.000048363327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023858674,0.0006841681,0.0003436096,0.0006330063,0.0005637669,0.001166323,0.0007014755,0.0007378257,0.018113807],"category_scores_gemma":[0.0019442008,0.00027122727,0.00027460518,0.0012096905,0.00074435485,0.0018051725,0.0007310528,0.0019975463,0.004205266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013630992,0.000012550346,0.00006512714,0.0000563652,0.0000072273547,0.000044081684,0.0000786566,0.006494832,0.0008809861,0.9200987,0.03604292,0.03620496],"study_design_scores_gemma":[0.0000047788894,0.000011164412,0.00018320097,0.000029306422,0.000009358163,0.00010893758,0.000043060896,0.012524297,0.00040106007,0.8761759,0.11049927,0.000009680614],"about_ca_topic_score_codex":0.000978468,"about_ca_topic_score_gemma":0.00092122337,"teacher_disagreement_score":0.018113807,"about_ca_system_score_codex":0.0009857081,"about_ca_system_score_gemma":0.00032665307,"threshold_uncertainty_score":0.060596764},"labels":[],"label_agreement":null},{"id":"W4252734876","doi":"10.24124/2009/bpgub587","title":"Hamiltonian cycles in symmetric graphs.","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; University of Northern British Columbia; Library and Archives Canada","funders":"","keywords":"Combinatorics; Homogeneous space; Hamiltonian (control theory); Mathematics; Vertex (graph theory); Binary number; Hamiltonian path; Graph; Discrete mathematics; Geometry; Arithmetic","score_opus":0.016230905270881463,"score_gpt":0.313854579493623,"score_spread":0.29762367422274155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252734876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33278817,0.0046478002,0.5338425,0.0019180324,0.0005029615,0.00044576795,0.0013144312,0.0005272698,0.12401312],"genre_scores_gemma":[0.7798449,0.0030301993,0.18189257,0.0005243687,0.00021529001,0.0003121075,0.0013567511,0.00019108449,0.032632727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972826,0.000082476974,0.000015705395,0.000061996965,0.0000704204,0.000041081577],"domain_scores_gemma":[0.9994535,0.00025017845,0.000098465,0.00007487501,0.00007240447,0.000050576797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028988076,0.00042296044,0.00030005368,0.0010702335,0.00080882583,0.0009536121,0.0005166014,0.000494678,0.004708759],"category_scores_gemma":[0.0016870005,0.00036322023,0.0005863858,0.0010805365,0.0010443476,0.0016512555,0.0007359248,0.00072906475,0.0007345263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003690373,0.000028105684,0.00038867956,0.00014991034,0.000016021331,0.00016373799,0.00038826256,0.0053139343,0.0034645044,0.94554144,0.0039055748,0.040602908],"study_design_scores_gemma":[0.000014899138,0.000019874547,0.0002790954,0.000026105248,0.000010170267,0.00017064094,0.0001264438,0.011171926,0.0012361119,0.9750343,0.011899952,0.000010567591],"about_ca_topic_score_codex":0.0010042542,"about_ca_topic_score_gemma":0.0015366392,"teacher_disagreement_score":0.004708759,"about_ca_system_score_codex":0.00080017856,"about_ca_system_score_gemma":0.0005512431,"threshold_uncertainty_score":0.015752375},"labels":[],"label_agreement":null},{"id":"W4253269339","doi":"10.1007/978-1-4939-7131-2_100463","title":"Heterogeneous Graph","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.03217080802089717,"score_gpt":0.2821233465326942,"score_spread":0.24995253851179705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253269339","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00850642,0.0014386819,0.27961656,0.001364185,0.00075598556,0.00015049079,0.0011897872,0.0010723127,0.70590556],"genre_scores_gemma":[0.2134393,0.0045882715,0.15902735,0.0012971371,0.0007296716,0.00035476297,0.006622731,0.0019718278,0.61196893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997725,0.000034978828,0.0000075673283,0.00008615207,0.00007398587,0.00002490458],"domain_scores_gemma":[0.9996816,0.000070262424,0.000013494708,0.0001339933,0.000066298984,0.000034427358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002465479,0.00065343775,0.0003353431,0.0010816627,0.0010505549,0.0018434217,0.0010327375,0.00052667235,0.05302397],"category_scores_gemma":[0.0009468862,0.00031718597,0.00045291643,0.0013746114,0.00065070833,0.003695691,0.0017544507,0.0011936818,0.012460586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018403107,0.00001935151,0.00009463946,0.000106957435,0.000010808562,0.00007454182,0.000084392545,0.0019603022,0.0015378285,0.868228,0.042421527,0.08544324],"study_design_scores_gemma":[0.000006850342,0.000014167123,0.00020312276,0.000072183415,0.000024706085,0.00022934438,0.000102905906,0.0075629256,0.0025649176,0.61181295,0.3773955,0.0000104767],"about_ca_topic_score_codex":0.0010893709,"about_ca_topic_score_gemma":0.0017026884,"teacher_disagreement_score":0.05302397,"about_ca_system_score_codex":0.00078593026,"about_ca_system_score_gemma":0.00053113844,"threshold_uncertainty_score":0.17738283},"labels":[],"label_agreement":null},{"id":"W4253689634","doi":"10.1002/jgt.20334","title":"Bounding χ in terms of ω and Δ for quasi‐line graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Combinatorics; Mathematics; Line graph; Conjecture; Cubic graph; Graph; Discrete mathematics; Omega; Vertex (graph theory); Vertex-transitive graph; Graph power; Voltage graph; Physics","score_opus":0.04185691599901831,"score_gpt":0.3278837972455143,"score_spread":0.286026881246496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253689634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32864684,0.0018627318,0.642128,0.0037128616,0.00016997526,0.00006164722,0.0005091234,0.0013591383,0.021549674],"genre_scores_gemma":[0.9261735,0.00040247675,0.06912845,0.0004907462,0.00013513373,0.000082672734,0.0002340196,0.00029124346,0.0030617549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972723,0.0012069083,0.00006438947,0.0005990384,0.00041453302,0.00044271856],"domain_scores_gemma":[0.93669784,0.052942973,0.0034388453,0.0038196822,0.0013919529,0.0017086162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037970846,0.0009985127,0.00085182773,0.0019616578,0.0012475573,0.002450877,0.003262127,0.0013177013,0.005284674],"category_scores_gemma":[0.029680658,0.00089857273,0.0006160467,0.0013285651,0.0028722684,0.008448199,0.0027159527,0.0023154048,0.0007145641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001064191,0.0002656112,0.013476532,0.00036761328,0.00011965277,0.00037975275,0.00054126524,0.29428416,0.010213048,0.6242972,0.014196452,0.040794514],"study_design_scores_gemma":[0.000018780556,0.000041098705,0.0009780817,0.000037940626,0.000016159387,0.00007748994,0.000098445606,0.7271854,0.0016364948,0.26790538,0.0019786959,0.000026014884],"about_ca_topic_score_codex":0.0037543792,"about_ca_topic_score_gemma":0.0041008443,"teacher_disagreement_score":0.005284674,"about_ca_system_score_codex":0.0032436794,"about_ca_system_score_gemma":0.0008057139,"threshold_uncertainty_score":0.023534715},"labels":[],"label_agreement":null},{"id":"W4254576424","doi":"10.1007/s00224-007-9040-7","title":"Algorithms in the W-Hierarchy","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hierarchy; Mathematical proof; Intersection (aeronautics); Extension (predicate logic); Set (abstract data type); Upper and lower bounds; Mathematics; State (computer science); Computer science; Discrete mathematics; Theoretical computer science; Algorithm; Programming language; Engineering","score_opus":0.0302898493409319,"score_gpt":0.31553094789313363,"score_spread":0.2852410985522017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254576424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1013794,0.00585195,0.77856165,0.008783959,0.00042752252,0.00015767638,0.00064325175,0.0013886814,0.10280586],"genre_scores_gemma":[0.6354263,0.004186235,0.31174973,0.0020760077,0.000823997,0.00031400443,0.001025518,0.0007030076,0.043695264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974855,0.00073890615,0.00016885341,0.0004709523,0.00064550224,0.00049017667],"domain_scores_gemma":[0.99389535,0.0034728067,0.00036746447,0.0011680882,0.0006246234,0.00047169873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023772244,0.0007417723,0.0017362937,0.0026832686,0.0026498868,0.0055093365,0.0026677332,0.0018169198,0.011161799],"category_scores_gemma":[0.0116255125,0.000851863,0.0014478914,0.0044082776,0.0032622046,0.015132419,0.003715116,0.0039419415,0.0020423206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003856732,0.000026968013,0.00021939303,0.00008048942,0.000015306005,0.000024393934,0.00015235048,0.0021423807,0.00026417655,0.9721657,0.0035350325,0.021335278],"study_design_scores_gemma":[0.000014151799,0.0000073298024,0.000078190154,0.000015825866,0.0000072476005,0.000024241219,0.00003820046,0.009977609,0.00012570513,0.98681706,0.0028889403,0.0000055090163],"about_ca_topic_score_codex":0.005127763,"about_ca_topic_score_gemma":0.005264961,"teacher_disagreement_score":0.011161799,"about_ca_system_score_codex":0.0032371508,"about_ca_system_score_gemma":0.0020191965,"threshold_uncertainty_score":0.037339926},"labels":[],"label_agreement":null},{"id":"W4255025375","doi":"10.1002/jgt.20480","title":"Cycle and cocycle coverings of graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Cover (algebra); Discrete mathematics; Simple graph","score_opus":0.006994280001931636,"score_gpt":0.2609395767562744,"score_spread":0.25394529675434274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255025375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94443166,0.0008124022,0.041553147,0.00015206105,0.00005747139,0.000031092404,0.00020328892,0.00021406896,0.01254487],"genre_scores_gemma":[0.99208003,0.0002255799,0.0050014146,0.00004759538,0.000031655898,0.000026269105,0.0002749359,0.000038304737,0.0022741735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947315,0.0000801341,0.000020910727,0.00015391227,0.0001281199,0.00014378555],"domain_scores_gemma":[0.99821764,0.000615591,0.00032976113,0.00023561977,0.00021622407,0.00038521487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022579536,0.0003854274,0.0005033418,0.0014418447,0.00095460255,0.0010390086,0.0004946337,0.00057964236,0.0040596593],"category_scores_gemma":[0.0023366893,0.00032622856,0.00040567332,0.0011149612,0.0008947264,0.0012566168,0.0012987389,0.00044602255,0.00030074047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014640148,0.0003021093,0.036372144,0.0006166816,0.00025040007,0.0037264703,0.0035427958,0.094023064,0.07122456,0.6354256,0.01084398,0.14220826],"study_design_scores_gemma":[0.00010547032,0.00046922237,0.019178854,0.0001340757,0.00012792813,0.0036321424,0.00093967206,0.3421393,0.019739162,0.5786346,0.034827773,0.00007176788],"about_ca_topic_score_codex":0.002233492,"about_ca_topic_score_gemma":0.0016137157,"teacher_disagreement_score":0.0040596593,"about_ca_system_score_codex":0.0006601564,"about_ca_system_score_gemma":0.00025181766,"threshold_uncertainty_score":0.013580978},"labels":[],"label_agreement":null},{"id":"W4255327711","doi":"10.1002/jgt.20307","title":"Odd‐angulated graphs and cancelling factors in box products","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Combinatorics; Homomorphism; Mathematics; Graph; Graph homomorphism; Girth (graph theory); Discrete mathematics; Path (computing); Connectivity; Graph power; Line graph; Computer science","score_opus":0.025640238291251068,"score_gpt":0.2670994768727819,"score_spread":0.24145923858153084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255327711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7785076,0.000564043,0.19222082,0.0003991555,0.00012157071,0.000058819318,0.00013895122,0.00042828164,0.027560774],"genre_scores_gemma":[0.9744444,0.00015306579,0.019309208,0.00012038151,0.00005305282,0.000031606618,0.00011556151,0.000068435154,0.0057042926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989704,0.00023061082,0.00006362121,0.0003042136,0.00025640085,0.0001748345],"domain_scores_gemma":[0.9970958,0.0014989148,0.0004111261,0.00031761517,0.00039398888,0.00028242354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010787417,0.00028032187,0.000451236,0.00070563314,0.0008798443,0.0011885524,0.00050045893,0.0004255417,0.004450327],"category_scores_gemma":[0.0035239425,0.00028451442,0.00044560095,0.00040250883,0.002063639,0.0032242874,0.0010678906,0.0008171351,0.00040790878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030449635,0.000052628588,0.003078952,0.000112366215,0.000028204784,0.0007303304,0.00083979056,0.0024225859,0.013186523,0.9594206,0.00093262875,0.018890733],"study_design_scores_gemma":[0.000054860026,0.00012082087,0.0017871398,0.00003602079,0.000057614223,0.0012142424,0.0005279398,0.017024165,0.013327447,0.9522782,0.013525065,0.00004654418],"about_ca_topic_score_codex":0.0010663728,"about_ca_topic_score_gemma":0.0010471481,"teacher_disagreement_score":0.004450327,"about_ca_system_score_codex":0.00061006297,"about_ca_system_score_gemma":0.00041662293,"threshold_uncertainty_score":0.01488781},"labels":[],"label_agreement":null},{"id":"W4255623367","doi":"10.32920/ryerson.14652594.v1","title":"Wall cops and robbers","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Hypercube; Combinatorics; Graph; Computer science; Mathematics; Theoretical computer science","score_opus":0.02797876477314936,"score_gpt":0.3040144018227216,"score_spread":0.27603563704957224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255623367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24990273,0.0013343904,0.4690779,0.004744583,0.0007677652,0.0005939991,0.0008073682,0.0009636916,0.27180767],"genre_scores_gemma":[0.8359791,0.00066083466,0.092552625,0.00090227707,0.00015585498,0.00053041073,0.0006633739,0.00037222376,0.06818336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976974,0.0009291649,0.00008232937,0.00047317322,0.0003603727,0.0004576125],"domain_scores_gemma":[0.9978162,0.0008105231,0.00027395948,0.00024403134,0.00014486727,0.0007103827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008348305,0.0011614503,0.00093138614,0.0005543528,0.0019166085,0.002709116,0.001274696,0.0016489689,0.016832236],"category_scores_gemma":[0.005256078,0.0005418367,0.00075274607,0.00042899392,0.0036046014,0.006013355,0.0031667931,0.0020927805,0.0019252416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056145544,0.00012908796,0.0011146289,0.00017624084,0.000044478038,0.00034980386,0.0010523811,0.018453918,0.0039306236,0.9306765,0.013984525,0.029526344],"study_design_scores_gemma":[0.00014427098,0.00041650113,0.0017476679,0.00019793362,0.00005407851,0.0006543454,0.0021883145,0.08599096,0.0051828823,0.765331,0.13799594,0.0000962191],"about_ca_topic_score_codex":0.002814953,"about_ca_topic_score_gemma":0.0032043345,"teacher_disagreement_score":0.016832236,"about_ca_system_score_codex":0.0014419244,"about_ca_system_score_gemma":0.00096481555,"threshold_uncertainty_score":0.056309402},"labels":[],"label_agreement":null},{"id":"W4255798272","doi":"10.1002/jgt.20006","title":"Interval bigraphs and circular arc graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Interval graph; Chordal graph; Indifference graph; Bipartite graph; Cograph; Conjecture; Discrete mathematics; Split graph; Permutation graph; Vertex (graph theory); Interval (graph theory); Graph; 1-planar graph","score_opus":0.015949460529420006,"score_gpt":0.2725096860002505,"score_spread":0.25656022547083046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255798272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.799122,0.00046388482,0.1500355,0.00031868156,0.00008866417,0.00007025415,0.00039119236,0.000377315,0.049132507],"genre_scores_gemma":[0.9774908,0.000103956525,0.019401334,0.00005452366,0.000022694036,0.000026531281,0.00028820662,0.00002428493,0.0025876926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996278,0.00007137602,0.00001736158,0.000116960626,0.00009300153,0.00007349945],"domain_scores_gemma":[0.9983291,0.000702011,0.00032786932,0.00022177218,0.00021524107,0.00020395471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026093394,0.00017127194,0.00023724364,0.0008531734,0.00086451514,0.0013702131,0.00044462507,0.00042176346,0.0055999216],"category_scores_gemma":[0.0017857933,0.00021153089,0.0003130256,0.00081503583,0.0015158642,0.0022676534,0.00083736796,0.00051623216,0.00034708463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027705883,0.0000568661,0.0044198297,0.00014191755,0.000022990951,0.0004952692,0.0011235301,0.00438908,0.010476223,0.94096214,0.0014614149,0.03617361],"study_design_scores_gemma":[0.000048682272,0.0001559267,0.0094419,0.00009410701,0.00007714486,0.0018370718,0.0017087088,0.044595256,0.014975288,0.89459926,0.032410655,0.000056016437],"about_ca_topic_score_codex":0.0016900613,"about_ca_topic_score_gemma":0.0015459262,"teacher_disagreement_score":0.0055999216,"about_ca_system_score_codex":0.00046215465,"about_ca_system_score_gemma":0.0003445957,"threshold_uncertainty_score":0.018733561},"labels":[],"label_agreement":null},{"id":"W4256250877","doi":"10.1002/jgt.20203","title":"Closure for the property of having a hamiltonian prism","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Quartic graph; Graph; Hamiltonian (control theory); Prism; Graph power; Discrete mathematics; Line graph; Physics; Optics","score_opus":0.016521925811267636,"score_gpt":0.27070374401507796,"score_spread":0.2541818182038103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256250877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7260802,0.00039963587,0.20666698,0.0012651709,0.0004064832,0.00021631809,0.00100184,0.0009681529,0.06299525],"genre_scores_gemma":[0.9648061,0.00011803745,0.028369693,0.00022817937,0.00006132626,0.00008949935,0.00044890773,0.00006884867,0.0058094617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897325,0.00014635299,0.00009168193,0.0003301993,0.00022307721,0.00023544847],"domain_scores_gemma":[0.9957755,0.0014229083,0.0008126549,0.00077497645,0.0005307164,0.0006832259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009206052,0.0002573198,0.00054070714,0.00043676782,0.0014015336,0.0013561171,0.0009071248,0.0007040405,0.009762178],"category_scores_gemma":[0.0036842541,0.0004801283,0.00081106374,0.00034833932,0.0024015936,0.0031171606,0.0024586655,0.0015177028,0.00073070807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010801806,0.00038117624,0.006452972,0.0005900933,0.0001129515,0.0033916584,0.0014020965,0.0075105997,0.051520668,0.87456894,0.007987134,0.04500158],"study_design_scores_gemma":[0.00036310634,0.000611853,0.0043944903,0.00013172692,0.00012106609,0.0053265784,0.0020119902,0.0385573,0.042635188,0.87091535,0.034821622,0.000109785644],"about_ca_topic_score_codex":0.0007531949,"about_ca_topic_score_gemma":0.0006271964,"teacher_disagreement_score":0.009762178,"about_ca_system_score_codex":0.00047537807,"about_ca_system_score_gemma":0.0008831894,"threshold_uncertainty_score":0.032657683},"labels":[],"label_agreement":null},{"id":"W4256347034","doi":"10.1002/net.20318","title":"Improper coloring of unit disk graphs","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Complete coloring; Mathematics; Indifference graph; Edge coloring; Chromatic scale; Graph coloring; Discrete mathematics; Chordal graph; Graph; Interval graph; Computer science; Interval (graph theory); Unit disk; 1-planar graph; Line graph; Graph power","score_opus":0.021960333528217062,"score_gpt":0.2843527786470723,"score_spread":0.26239244511885523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256347034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6959259,0.00052168855,0.29365367,0.0008776799,0.000096320895,0.000104442326,0.0006745604,0.00058922847,0.0075565157],"genre_scores_gemma":[0.9168691,0.00030223784,0.079253525,0.00014329085,0.000060984443,0.00006414575,0.00078584213,0.00009323152,0.0024276013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889463,0.00036345678,0.000056180204,0.0002711496,0.00021826391,0.0001963041],"domain_scores_gemma":[0.9936047,0.0030212072,0.00084693835,0.0015933462,0.00048062307,0.00045322446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062509225,0.0005057978,0.000739531,0.0006191906,0.00079078175,0.0017603374,0.0014537805,0.0006308228,0.0031001642],"category_scores_gemma":[0.0048287385,0.00033721825,0.00039953802,0.0016069333,0.0011186874,0.0023707524,0.0011118202,0.0011583406,0.00026361505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012171515,0.0002505779,0.009332425,0.0005078182,0.000114078255,0.0006928923,0.00067588745,0.6562257,0.014751358,0.2222919,0.011914859,0.08202534],"study_design_scores_gemma":[0.000042005897,0.000050385977,0.0012560652,0.000018593435,0.000023915325,0.0002586321,0.00026104864,0.7878114,0.0046574934,0.20158224,0.0040173507,0.000020828467],"about_ca_topic_score_codex":0.0032157428,"about_ca_topic_score_gemma":0.0028932171,"teacher_disagreement_score":0.0032157428,"about_ca_system_score_codex":0.0013485702,"about_ca_system_score_gemma":0.0006376484,"threshold_uncertainty_score":0.010371029},"labels":[],"label_agreement":null},{"id":"W4256561526","doi":"10.1007/978-3-540-79228-4_15","title":"Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; Université du Québec en Outaouais; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Planar graph; Combinatorics; Unit disk graph; Vertex (graph theory); Computer science; Graph factorization; Graph coloring; Graph; Complete coloring; Mathematics; Graph power; Line graph","score_opus":0.032815704219324796,"score_gpt":0.28332560821975944,"score_spread":0.25050990400043466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256561526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5005966,0.0025551685,0.3173814,0.0012932525,0.00027150373,0.00018472422,0.00088004884,0.0019829522,0.17485426],"genre_scores_gemma":[0.85124314,0.0016196151,0.08014516,0.00034649277,0.00024464098,0.00034027157,0.0019210362,0.0009186216,0.06322102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996855,0.0000667495,0.00001280161,0.000077377255,0.000078737634,0.00007886855],"domain_scores_gemma":[0.9991492,0.0003497588,0.00008660952,0.00016518631,0.00010154022,0.00014770943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031426625,0.0005983624,0.0008661077,0.0008535331,0.0012384404,0.0015832613,0.0017082017,0.00060877757,0.0130256275],"category_scores_gemma":[0.0009922562,0.0006262849,0.00080245023,0.0014768062,0.0011507723,0.0020143306,0.0015515855,0.0019022134,0.002252279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044196364,0.0001839917,0.0011301845,0.0007681301,0.00005127677,0.00039780542,0.0009215223,0.019862238,0.018005567,0.8536653,0.020722073,0.083849914],"study_design_scores_gemma":[0.00009714289,0.00008223537,0.0013428398,0.00005529068,0.00007844119,0.00041353365,0.00043387973,0.040809583,0.007079725,0.9330336,0.016535731,0.000038023132],"about_ca_topic_score_codex":0.0016263376,"about_ca_topic_score_gemma":0.0030868733,"teacher_disagreement_score":0.0130256275,"about_ca_system_score_codex":0.0014876322,"about_ca_system_score_gemma":0.00058332825,"threshold_uncertainty_score":0.043575108},"labels":[],"label_agreement":null},{"id":"W4281251691","doi":"10.1016/j.dam.2022.04.014","title":"Critical independent sets of König–Egerváry graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Xi’an Jiaotong University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Thompson Rivers University","keywords":"Mathematics; Combinatorics; Independence number; Independent set; Vertex (graph theory); Discrete mathematics; Graph; Simple graph; Bipartite graph","score_opus":0.02301127744059721,"score_gpt":0.3104668868562302,"score_spread":0.287455609415633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281251691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8511768,0.0012807033,0.05291209,0.0013737538,0.00019170479,0.00008962079,0.00045728686,0.00017573308,0.09234225],"genre_scores_gemma":[0.9811195,0.0004906266,0.006850114,0.00020810684,0.00016345605,0.00010174063,0.0005261306,0.00007162964,0.010468571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993782,0.0001380002,0.000028062388,0.00012745745,0.00017121075,0.00015697701],"domain_scores_gemma":[0.996666,0.0015186147,0.00055270793,0.00026880222,0.00041936993,0.00057438726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074857887,0.00094465236,0.0014377553,0.0049289824,0.0038822428,0.004141114,0.0020641172,0.0016295173,0.005810763],"category_scores_gemma":[0.004037115,0.0010356811,0.001025802,0.0018265384,0.0034427242,0.0028753881,0.0022524677,0.0030462793,0.000569461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007406172,0.000031187854,0.00057024905,0.000040998042,0.0000306068,0.0001481091,0.00028625192,0.0021009904,0.0014224502,0.99188566,0.0012196066,0.0021898032],"study_design_scores_gemma":[0.000027865597,0.00001061019,0.00089496933,0.000022773405,0.00002241388,0.00011232686,0.0001785884,0.0082517825,0.0006410341,0.9885133,0.0013108734,0.000013454107],"about_ca_topic_score_codex":0.0018193332,"about_ca_topic_score_gemma":0.0019003863,"teacher_disagreement_score":0.005810763,"about_ca_system_score_codex":0.0017852776,"about_ca_system_score_gemma":0.0009142883,"threshold_uncertainty_score":0.019438982},"labels":[],"label_agreement":null},{"id":"W4281661106","doi":"10.1137/1.9781611977554.ch116","title":"Sparse graphs with bounded induced cycle packing number have logarithmic treewidth","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"Berlin Mathematics Research Center MATH+; Agence Nationale de la Recherche; Deutsche Forschungsgemeinschaft","keywords":"Treewidth; Combinatorics; Bipartite graph; Mathematics; Logarithm; Cograph; Independent set; Time complexity; Chordal graph; Indifference graph; Discrete mathematics; Maximal independent set; Disjoint sets; Pathwidth; 1-planar graph; Graph; Line graph","score_opus":0.09548717066097315,"score_gpt":0.28618216172683714,"score_spread":0.190694991065864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281661106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7441944,0.00086082687,0.22339253,0.002218967,0.000088676985,0.00018347788,0.0052106557,0.0016431041,0.022207411],"genre_scores_gemma":[0.9269643,0.0006175928,0.060616065,0.00054456654,0.00007915688,0.000197911,0.0044730958,0.000395775,0.00611142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905795,0.00010316859,0.00006236829,0.00025195765,0.00024571744,0.00027882736],"domain_scores_gemma":[0.99065316,0.0054132943,0.0014297321,0.0012289938,0.00058075617,0.00069399516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046737728,0.0008628894,0.000788843,0.0008738504,0.0009894138,0.0021116715,0.0011779178,0.0008520165,0.0061173374],"category_scores_gemma":[0.0051635187,0.0008448561,0.00084644434,0.0018157095,0.0010536405,0.003612879,0.0014222135,0.0015155424,0.00087573304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029626258,0.00079741294,0.03452871,0.0019889474,0.00037308098,0.0013781923,0.0016328844,0.28237063,0.13791424,0.32628742,0.026082298,0.18368356],"study_design_scores_gemma":[0.00023777007,0.00032957504,0.011408995,0.000116364936,0.00023095212,0.0018779695,0.0004521271,0.30914834,0.036469974,0.61851436,0.021135822,0.00007769879],"about_ca_topic_score_codex":0.0018273096,"about_ca_topic_score_gemma":0.0030918913,"teacher_disagreement_score":0.0061173374,"about_ca_system_score_codex":0.0011576522,"about_ca_system_score_gemma":0.0007999742,"threshold_uncertainty_score":0.02046454},"labels":[],"label_agreement":null},{"id":"W4283011735","doi":"10.1137/21m1417077","title":"Robust Connectivity of Graphs on Surfaces","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Uniwersytet Warszawski","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Lambda; Discrete mathematics; Degeneracy (biology); Dominating set; Tree (set theory); Arboricity; Spanning tree; Invariant (physics); Graph; Planar graph","score_opus":0.046048372849475355,"score_gpt":0.2979433993994719,"score_spread":0.2518950265499965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283011735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5762157,0.0020002155,0.33952034,0.0013161391,0.00018620629,0.00017931106,0.001738326,0.0014740044,0.07736979],"genre_scores_gemma":[0.95723116,0.0007382904,0.032027308,0.00022577427,0.00012721976,0.0001686864,0.0014497789,0.00028874326,0.0077430718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937147,0.00009553407,0.000029285982,0.0001839328,0.00022001722,0.000099687444],"domain_scores_gemma":[0.9987406,0.00042334746,0.00032398282,0.00018977957,0.00018639844,0.00013588491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030834778,0.0005369339,0.0005930258,0.0026183012,0.0007567176,0.0016584363,0.0010047398,0.0009498743,0.0063170455],"category_scores_gemma":[0.0029849953,0.00033232663,0.0006103049,0.0013067605,0.002061929,0.0025286903,0.0016656321,0.00095410156,0.0007417568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015846746,0.00004025702,0.0018367181,0.00021515963,0.00004309969,0.0004362756,0.00062363094,0.07748054,0.012009091,0.8572503,0.005269303,0.044637125],"study_design_scores_gemma":[0.000033937198,0.00006824492,0.0035841512,0.00006390336,0.000030225303,0.0005335638,0.0003796944,0.14029266,0.0031630523,0.8312456,0.020558396,0.00004650567],"about_ca_topic_score_codex":0.0016877683,"about_ca_topic_score_gemma":0.0010050954,"teacher_disagreement_score":0.0063170455,"about_ca_system_score_codex":0.0009155217,"about_ca_system_score_gemma":0.00026724956,"threshold_uncertainty_score":0.021132648},"labels":[],"label_agreement":null},{"id":"W4283124407","doi":"10.4230/lipics.approx/random.2022.18","title":"Sketching Distances in Monotone Graph Classes","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Monotone polygon; Computer science; Graph; Theoretical computer science; Combinatorics; Mathematics; Geometry","score_opus":0.02570291299465333,"score_gpt":0.3180068150081586,"score_spread":0.29230390201350526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283124407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37676206,0.0010554299,0.61262065,0.0010565729,0.00004939125,0.00014427846,0.00056339294,0.0009831268,0.006765069],"genre_scores_gemma":[0.87759787,0.00073339214,0.11597594,0.00020142163,0.00015260014,0.0001903286,0.00070566137,0.00030743857,0.00413533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757487,0.0006070794,0.00013122454,0.00067063444,0.0007169282,0.00029932478],"domain_scores_gemma":[0.96614987,0.026467308,0.0021378796,0.0033020014,0.0009552184,0.0009877092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025888016,0.0007655064,0.0009767732,0.001254334,0.00076328794,0.002036147,0.0021642055,0.0013366026,0.00366926],"category_scores_gemma":[0.029905388,0.00064995495,0.0009940933,0.0010563823,0.0018323445,0.008544234,0.0025171344,0.0022451743,0.0004967085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008607473,0.00025473387,0.006842378,0.0007576282,0.00012584506,0.00027199375,0.0011131815,0.3358381,0.016161337,0.41308984,0.0058550104,0.2188292],"study_design_scores_gemma":[0.00007036263,0.00013581688,0.0011637881,0.000035574183,0.000026137368,0.00030064036,0.00012898973,0.72634494,0.0042042024,0.26362285,0.0039374125,0.000029193148],"about_ca_topic_score_codex":0.0013341461,"about_ca_topic_score_gemma":0.0010742964,"teacher_disagreement_score":0.00366926,"about_ca_system_score_codex":0.0017239345,"about_ca_system_score_gemma":0.00054193696,"threshold_uncertainty_score":0.013691068},"labels":[],"label_agreement":null},{"id":"W4283330479","doi":"10.4230/lipics.icalp.2022.81","title":"A Study of Weisfeiler-Leman Colorings on Planar Graphs","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Graph isomorphism; Discrete mathematics; Planar graph; Isomorphism (crystallography); Subgraph isomorphism problem; Line graph; Chordal graph; Pathwidth; Graph","score_opus":0.040270605147283325,"score_gpt":0.3205178733126442,"score_spread":0.2802472681653609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283330479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6693869,0.0010967405,0.29285383,0.0013379504,0.00007149525,0.0001304259,0.0005184127,0.00062059425,0.0339835],"genre_scores_gemma":[0.9059317,0.0009017308,0.079330444,0.00044616908,0.0001477967,0.00015966893,0.0008395186,0.0002739206,0.0119689135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908376,0.00024907524,0.00003733751,0.00022549958,0.00022208443,0.00018224785],"domain_scores_gemma":[0.996024,0.0024120254,0.0006228026,0.0004070578,0.00031140546,0.00022262595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008749745,0.0007380631,0.0005405765,0.001898815,0.0012806639,0.0016248092,0.0012582726,0.0010454367,0.0045335786],"category_scores_gemma":[0.0071179094,0.0006000532,0.0011624243,0.001965592,0.0020786508,0.0032075301,0.0011450502,0.0017251611,0.00039435978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010675518,0.00006967419,0.0030398355,0.00015092299,0.00002958147,0.00021744186,0.0005721497,0.081720024,0.0048083467,0.8847043,0.002232935,0.022347983],"study_design_scores_gemma":[0.000031002004,0.00008427926,0.002197333,0.00007482061,0.000034037486,0.00023672436,0.00026978742,0.19453466,0.0036293892,0.7913335,0.007532382,0.0000421411],"about_ca_topic_score_codex":0.0034242265,"about_ca_topic_score_gemma":0.0024251414,"teacher_disagreement_score":0.0045335786,"about_ca_system_score_codex":0.0028507756,"about_ca_system_score_gemma":0.00076078007,"threshold_uncertainty_score":0.020683885},"labels":[],"label_agreement":null},{"id":"W42843301","doi":"10.1007/978-3-642-25591-5_38","title":"Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Path (computing); Planar graph; Planar; Grid; Graph theory; Mathematics; Time complexity; Minor (academic); Computer science; Combinatorics; Graph; Discrete mathematics; Geometry","score_opus":0.038764956491295466,"score_gpt":0.3027215662326018,"score_spread":0.26395660974130636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42843301","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18296939,0.0026054126,0.75949186,0.0023885206,0.00050429394,0.00038438858,0.0007751863,0.00092438114,0.04995656],"genre_scores_gemma":[0.49079168,0.0012172682,0.49478635,0.0003241329,0.00026703696,0.0004184487,0.0015133263,0.00020493148,0.010476784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988373,0.00036366787,0.00006385829,0.0002867728,0.0002872269,0.00016125817],"domain_scores_gemma":[0.99680746,0.0022008035,0.00015107986,0.0003978324,0.00031454465,0.0001283501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009385461,0.0005895335,0.0011566553,0.0012744792,0.0013959669,0.0024935459,0.0026975716,0.0010605247,0.012041583],"category_scores_gemma":[0.0060349894,0.00033702576,0.0011355587,0.0024616367,0.0009869325,0.004601696,0.0015281441,0.0018444634,0.0008481462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081853895,0.0006146995,0.003583553,0.000948793,0.00012253804,0.0001935906,0.00043232169,0.28229994,0.0059805145,0.43607625,0.02473882,0.24419035],"study_design_scores_gemma":[0.000083130646,0.00016432563,0.00052488875,0.000051823365,0.000054696564,0.000172359,0.0001565066,0.8223852,0.0015192427,0.1702845,0.004577893,0.000025449055],"about_ca_topic_score_codex":0.0030810328,"about_ca_topic_score_gemma":0.0029381642,"teacher_disagreement_score":0.012041583,"about_ca_system_score_codex":0.0018230737,"about_ca_system_score_gemma":0.0022499505,"threshold_uncertainty_score":0.040283084},"labels":[],"label_agreement":null},{"id":"W4285020995","doi":"10.1007/s00453-022-01069-w","title":"The Complexity of Two Colouring Games","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Vancouver Island University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Algorithm; Graph; Computer science; Artificial intelligence; Combinatorics; Mathematics","score_opus":0.044289254215219065,"score_gpt":0.3150605287076965,"score_spread":0.27077127449247745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285020995","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78204453,0.00042636,0.16172217,0.0070238193,0.00014370342,0.00062885677,0.0017842961,0.00092295243,0.045303255],"genre_scores_gemma":[0.96322984,0.0001494143,0.027456693,0.0003211632,0.00006815719,0.00026900196,0.0009642751,0.000110682384,0.007430677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925431,0.0023984734,0.0004894374,0.0013624701,0.001578653,0.0016278215],"domain_scores_gemma":[0.9766075,0.01801845,0.0013745098,0.0014953738,0.0007140942,0.0017901328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025741092,0.0014204409,0.0019362965,0.0015235563,0.0024761918,0.0083256345,0.0034335146,0.0041227643,0.013442862],"category_scores_gemma":[0.01785026,0.0010936018,0.0021917608,0.0018175079,0.004744671,0.010020451,0.005349349,0.0042572925,0.000700085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011142555,0.00061148586,0.0047399304,0.00052485836,0.000255316,0.00082757504,0.0015743716,0.20178819,0.003836542,0.7548367,0.0064204466,0.023470338],"study_design_scores_gemma":[0.00032354938,0.00009148778,0.00061330356,0.000038184437,0.00006401902,0.0001682907,0.00030204185,0.34122843,0.0013801621,0.6530324,0.0027124595,0.000045734792],"about_ca_topic_score_codex":0.00706131,"about_ca_topic_score_gemma":0.0041674217,"teacher_disagreement_score":0.013442862,"about_ca_system_score_codex":0.0057347747,"about_ca_system_score_gemma":0.002735452,"threshold_uncertainty_score":0.04497087},"labels":[],"label_agreement":null},{"id":"W4285075493","doi":"10.48550/arxiv.1907.07441","title":"Maximum rectilinear convex subsets","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Departamento de Investigaciones Científicas y Tecnológicas, Universidad de Santiago de Chile; Comisión Nacional de Investigación Científica y Tecnológica; European Commission; Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación; Gobierno de Aragón; Universidad de Santiago de Chile","keywords":"Convex hull; Combinatorics; Mathematics; Orthogonal convex hull; Regular polygon; Convex set; Boundary (topology); Convex polytope; Hull; Convex body; Point (geometry); Plane (geometry); Mixed volume; Convex combination; Interior point method; Geometry; Mathematical analysis; Algorithm; Convex optimization; Materials science","score_opus":0.08574779962800823,"score_gpt":0.22103733134798143,"score_spread":0.1352895317199732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285075493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17508188,0.0011002971,0.7751343,0.0011540145,0.00011026275,0.00027317373,0.0022252977,0.0010005848,0.043920267],"genre_scores_gemma":[0.44767144,0.00092773576,0.52818674,0.00020444834,0.00011565055,0.00029715797,0.0037045272,0.00030251677,0.0185898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914193,0.00019635045,0.000051243795,0.00025396072,0.00024226653,0.00011426586],"domain_scores_gemma":[0.9988368,0.0004935491,0.0001359378,0.00032161057,0.00013195675,0.00008007788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005501054,0.0009192322,0.00088694214,0.0010670577,0.0006449758,0.0013904169,0.0011514319,0.0005761017,0.0075564575],"category_scores_gemma":[0.0036076715,0.000599096,0.00085643464,0.0018217493,0.0007673205,0.0029189358,0.0016843564,0.0011398243,0.0011760842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066721736,0.00015463085,0.0031899277,0.00061546103,0.00011829834,0.00037957157,0.0006076439,0.29362056,0.016253384,0.36597845,0.02088553,0.29752934],"study_design_scores_gemma":[0.00011015312,0.00013051911,0.0019321481,0.00009366878,0.000041736144,0.00040032843,0.00031810292,0.60064083,0.010702265,0.34590992,0.039687656,0.00003270701],"about_ca_topic_score_codex":0.0016105184,"about_ca_topic_score_gemma":0.0023253905,"teacher_disagreement_score":0.0075564575,"about_ca_system_score_codex":0.00076580775,"about_ca_system_score_gemma":0.0004653379,"threshold_uncertainty_score":0.025278926},"labels":[],"label_agreement":null},{"id":"W4285106094","doi":"10.1007/978-981-19-0957-3_5","title":"Trees","year":2022,"lang":"en","type":"book-chapter","venue":"Texts and readings in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Graph; Computer science; Mathematics; Combinatorics; Forestry; Geography","score_opus":0.02774547025241809,"score_gpt":0.28150271713564173,"score_spread":0.25375724688322365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285106094","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028988721,0.0015696633,0.05806571,0.0018338559,0.0010297335,0.000103757164,0.0054001682,0.0020905235,0.92700773],"genre_scores_gemma":[0.035957843,0.0021848825,0.031951983,0.0011052189,0.00046953798,0.00013388264,0.008401618,0.0017925056,0.9180024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959415,0.000048642272,0.000018043702,0.00011816742,0.00017111485,0.00004993203],"domain_scores_gemma":[0.99952507,0.00010219952,0.000023665476,0.00013399571,0.0001614437,0.000053546646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024375474,0.0005871058,0.000508565,0.0013339911,0.0014353858,0.003387178,0.0009882824,0.00079030904,0.21725237],"category_scores_gemma":[0.0014226246,0.00043273583,0.0004715698,0.0023486419,0.00090626295,0.004336346,0.0013987515,0.001766427,0.11292389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027504751,0.000022067601,0.0001186599,0.00012109492,0.000007612059,0.000053017706,0.00020356837,0.00041806226,0.0009916187,0.63787544,0.23706603,0.12309539],"study_design_scores_gemma":[0.000004864482,0.000005522272,0.00006948834,0.000030956926,0.000004786814,0.000090911475,0.000058902882,0.00037178668,0.00040595926,0.15901233,0.8399396,0.0000048581633],"about_ca_topic_score_codex":0.0016005345,"about_ca_topic_score_gemma":0.0025524138,"teacher_disagreement_score":0.21725237,"about_ca_system_score_codex":0.0009855471,"about_ca_system_score_gemma":0.000832783,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4285174338","doi":"10.1007/978-981-19-0957-3_8","title":"Matching Theory","year":2022,"lang":"en","type":"book-chapter","venue":"Texts and readings in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Disjoint sets; Pairwise comparison; Matching (statistics); Mathematics; Graph; Discrete mathematics; Statistics","score_opus":0.023000625730765358,"score_gpt":0.27914971192498444,"score_spread":0.2561490861942191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285174338","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031026353,0.0042377235,0.057365533,0.0031217763,0.00059030234,0.00004477324,0.000511292,0.00035267393,0.9306732],"genre_scores_gemma":[0.12531902,0.006244961,0.02466758,0.0021500676,0.0012351039,0.00016329833,0.0015263284,0.0005503903,0.8381433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943334,0.00012838766,0.000019177241,0.00014244448,0.00020757553,0.00006912026],"domain_scores_gemma":[0.99970347,0.00009987294,0.000017630031,0.00008957078,0.00006292597,0.000026477122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038818415,0.00078413857,0.0008044932,0.0018703359,0.0018395913,0.003283415,0.0014183506,0.001324994,0.07122367],"category_scores_gemma":[0.0015268363,0.000500364,0.0005968858,0.0031845507,0.0019871376,0.006534698,0.0016575515,0.0025366552,0.025179379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059245563,0.000010920377,0.000030710777,0.000037735615,0.0000033165456,0.00001136379,0.00007159685,0.00019903896,0.00012426672,0.94708526,0.030545717,0.02187409],"study_design_scores_gemma":[0.0000029021137,0.0000035412936,0.000054280994,0.000017984365,0.0000039148604,0.00004368465,0.00004167794,0.00054263807,0.00014751544,0.87829334,0.120845445,0.0000030911317],"about_ca_topic_score_codex":0.0013488311,"about_ca_topic_score_gemma":0.0011600532,"teacher_disagreement_score":0.07122367,"about_ca_system_score_codex":0.0020424265,"about_ca_system_score_gemma":0.00072971993,"threshold_uncertainty_score":0.23826694},"labels":[],"label_agreement":null},{"id":"W4285186269","doi":"10.1007/978-981-19-0957-3_11","title":"Edges and Cycles","year":2022,"lang":"en","type":"book-chapter","venue":"Texts and readings in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Graph; Enhanced Data Rates for GSM Evolution; Multiple edges; Mathematics; Computer science; Artificial intelligence","score_opus":0.030236779175911603,"score_gpt":0.2828326274313007,"score_spread":0.2525958482553891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285186269","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027726982,0.0045801103,0.014604533,0.0019606487,0.0009517667,0.000036321017,0.00021094701,0.000114881586,0.97476816],"genre_scores_gemma":[0.06448077,0.007695331,0.010907526,0.0018347031,0.00085047685,0.00012162499,0.00048984215,0.0003828785,0.9132369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997383,0.00007329693,0.000008697243,0.00007480156,0.00007110371,0.000033756947],"domain_scores_gemma":[0.9996927,0.0001233821,0.000019657873,0.000057060362,0.00006990009,0.000037289075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021147705,0.00076085003,0.00038826204,0.0014722309,0.001746599,0.0036048805,0.0008650812,0.0010954238,0.06693409],"category_scores_gemma":[0.0011932702,0.00037736478,0.00033668484,0.0024580457,0.0025680463,0.005987097,0.0013750239,0.0018370427,0.013186977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044876315,0.000005080688,0.000022920765,0.000036496105,0.0000014384606,0.000015836964,0.00021138861,0.00010815708,0.00011155205,0.9527915,0.026287276,0.020403901],"study_design_scores_gemma":[0.000002341095,0.000004609892,0.00005360505,0.00005663614,0.0000036168726,0.000059935723,0.00019634445,0.0001555212,0.00014228959,0.5857849,0.41353682,0.0000034371071],"about_ca_topic_score_codex":0.002019235,"about_ca_topic_score_gemma":0.0031329587,"teacher_disagreement_score":0.06693409,"about_ca_system_score_codex":0.0012668353,"about_ca_system_score_gemma":0.0006974945,"threshold_uncertainty_score":0.22391683},"labels":[],"label_agreement":null},{"id":"W4285687327","doi":"10.26686/wgtn.12212528.v1","title":"Certifying non-representability of matroids over prime fields","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund","keywords":"Matroid; Prime (order theory); Rank (graph theory); Element (criminal law); Combinatorics; Mathematics; Finite field; Discrete mathematics; Political science","score_opus":0.06243789805997328,"score_gpt":0.35538502633549324,"score_spread":0.29294712827551994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285687327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.620599,0.00069797074,0.33997053,0.004724938,0.00037710604,0.00025526385,0.001046163,0.0043268544,0.028002337],"genre_scores_gemma":[0.96870875,0.0002597613,0.026600895,0.00021966493,0.00023912605,0.00006374089,0.0006275863,0.00015951911,0.0031208952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551636,0.001062758,0.00033854152,0.0009899867,0.0013600878,0.00073216413],"domain_scores_gemma":[0.96661884,0.020117706,0.0042894855,0.0065079597,0.0016803772,0.000785713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026049204,0.00089872937,0.0011489082,0.00082183135,0.0013656749,0.0048152013,0.0018110591,0.001920982,0.007693863],"category_scores_gemma":[0.028338159,0.0008120527,0.001051417,0.0014333574,0.0035246275,0.008138962,0.003761402,0.0036818413,0.0013156848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023818093,0.0005775352,0.015687045,0.001467845,0.000377651,0.002582043,0.0017572613,0.16064562,0.04731057,0.53902566,0.017725138,0.21046196],"study_design_scores_gemma":[0.00022190956,0.00042338556,0.0018693932,0.00012461373,0.000110863875,0.0019302458,0.0003805511,0.19612773,0.032809358,0.75785893,0.008057092,0.00008591843],"about_ca_topic_score_codex":0.0008704143,"about_ca_topic_score_gemma":0.0008500747,"teacher_disagreement_score":0.007693863,"about_ca_system_score_codex":0.0017426801,"about_ca_system_score_gemma":0.0018626384,"threshold_uncertainty_score":0.025738537},"labels":[],"label_agreement":null},{"id":"W4285773650","doi":"10.1016/j.tcs.2022.12.014","title":"The Maker-Breaker Largest Connected Subgraph game","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Agence Nationale de la Recherche; H2020 European Research Council; Providence Health Care; University for the Creative Arts","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Connected component; Induced subgraph; Graph; Discrete mathematics; Factor-critical graph; Planar graph; Distance-hereditary graph; Graph power; Line graph","score_opus":0.010715997083649407,"score_gpt":0.26696795117937877,"score_spread":0.2562519540957294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285773650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4215473,0.0005947669,0.4120096,0.010267903,0.0004155097,0.00060871115,0.0011560158,0.00062878884,0.15277147],"genre_scores_gemma":[0.9195304,0.0003965147,0.0455988,0.00063475064,0.0001224286,0.00023760578,0.00037453216,0.0001391595,0.032965887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801457,0.0010368859,0.000053568725,0.00033569385,0.00025328764,0.00030598883],"domain_scores_gemma":[0.99421895,0.0037752343,0.00034507332,0.00043149185,0.0002216914,0.0010075191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019322728,0.001133034,0.0019206747,0.00074368727,0.0021176382,0.0030833299,0.0033779768,0.004212869,0.016804269],"category_scores_gemma":[0.011240145,0.0006398924,0.0008400373,0.00089353294,0.0021935732,0.0050452584,0.0026138308,0.0033383807,0.0013034939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012373803,0.00032040811,0.0007635273,0.00031911663,0.00014922288,0.00059312826,0.00061244366,0.06338807,0.0051103625,0.88387793,0.018817939,0.024810452],"study_design_scores_gemma":[0.00030853358,0.00016013367,0.0002881598,0.000026563781,0.00005966441,0.0001982903,0.00027177302,0.16789314,0.0013716292,0.82307774,0.006311459,0.000032934866],"about_ca_topic_score_codex":0.0018580598,"about_ca_topic_score_gemma":0.0023063845,"teacher_disagreement_score":0.016804269,"about_ca_system_score_codex":0.0014900026,"about_ca_system_score_gemma":0.0019439221,"threshold_uncertainty_score":0.056215882},"labels":[],"label_agreement":null},{"id":"W4286716144","doi":"10.1007/s00373-022-02517-8","title":"On the Structure of Graphs Without Claw, $$4K_1$$ and co-R","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chordal graph; Claw; Split graph; Induced subgraph; Vertex (graph theory); Indifference graph; Cograph; Discrete mathematics; Pathwidth; 1-planar graph; Graph; Line graph","score_opus":0.013209525833009866,"score_gpt":0.25861029588980816,"score_spread":0.2454007700567983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286716144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48976254,0.0045065214,0.15066908,0.01948502,0.0010020577,0.00013217899,0.0017746448,0.0011591256,0.3315088],"genre_scores_gemma":[0.89914644,0.002093823,0.03944373,0.0029531831,0.0007117623,0.0001211624,0.0018200856,0.0006085892,0.053101365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993512,0.00019560277,0.0000270478,0.0002084897,0.00008933111,0.00012827174],"domain_scores_gemma":[0.9963625,0.0017741248,0.0004896028,0.0005532641,0.00044594708,0.0003745733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082695193,0.0007035818,0.0007443108,0.002663731,0.004608502,0.004476499,0.0018376871,0.001879258,0.013586993],"category_scores_gemma":[0.004044471,0.00071447354,0.0008022747,0.0026886414,0.004831117,0.009345259,0.0028166387,0.0029649087,0.0026107272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004342795,0.000017505947,0.00019949346,0.00004135006,0.000004444037,0.000055653734,0.00040006882,0.00053758523,0.0005427699,0.98762286,0.0036435942,0.006891161],"study_design_scores_gemma":[0.000006297762,0.000005919512,0.00020979182,0.000017391663,0.0000058436062,0.00006316279,0.00015407315,0.0013566659,0.00025904475,0.9923948,0.005516675,0.000010283496],"about_ca_topic_score_codex":0.0032595498,"about_ca_topic_score_gemma":0.00438641,"teacher_disagreement_score":0.013586993,"about_ca_system_score_codex":0.0017962765,"about_ca_system_score_gemma":0.0011969365,"threshold_uncertainty_score":0.045453012},"labels":[],"label_agreement":null},{"id":"W4286796610","doi":"10.1016/j.tcs.2023.113760","title":"A simple certifying algorithm for 3-edge-connectivity","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Edge contraction; Algorithm; Connectivity; Graph; Mathematics; Computer science; Time complexity; Combinatorics; Line graph; Graph power","score_opus":0.039444340114994994,"score_gpt":0.3386094380291295,"score_spread":0.29916509791413454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286796610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04537516,0.00037795547,0.9262146,0.0012589303,0.00047734185,0.0003777976,0.0008101519,0.010282138,0.014825983],"genre_scores_gemma":[0.40327033,0.0003522668,0.58134764,0.00088462787,0.00035914805,0.0005509778,0.0031101834,0.001585327,0.008539439],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977297,0.00031594676,0.00018312558,0.00068116985,0.0007250674,0.00036500406],"domain_scores_gemma":[0.9911175,0.003570463,0.00041624735,0.0035803476,0.000885595,0.000429903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016292699,0.0015401277,0.002028196,0.0013495146,0.0016318626,0.0022563115,0.0037408096,0.0024028486,0.01589987],"category_scores_gemma":[0.009280649,0.00082247495,0.0019412099,0.0021779537,0.001731702,0.007033429,0.007432998,0.0051448653,0.003938618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009871636,0.0007289412,0.0022587115,0.0009931669,0.00017011959,0.00045704373,0.0005293782,0.03814986,0.027275432,0.16764909,0.05239599,0.708405],"study_design_scores_gemma":[0.0007068033,0.00048747036,0.0014306442,0.00010105192,0.00026378676,0.00096561946,0.00029930918,0.26711956,0.024747357,0.67778265,0.025934326,0.00016140199],"about_ca_topic_score_codex":0.000911997,"about_ca_topic_score_gemma":0.0011896738,"teacher_disagreement_score":0.01589987,"about_ca_system_score_codex":0.0010597198,"about_ca_system_score_gemma":0.0023166698,"threshold_uncertainty_score":0.05319035},"labels":[],"label_agreement":null},{"id":"W4286901735","doi":"10.48550/arxiv.2110.08943","title":"Proving exact values for the $2$-limited broadcast domination number on grid graphs","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Square (algebra); Square tiling; Mathematics; Combinatorics; Grid; Discrete mathematics; Geometry","score_opus":0.07982233156300793,"score_gpt":0.2417703291488874,"score_spread":0.16194799758587947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286901735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15446474,0.0020629927,0.7634753,0.0038595884,0.00027302426,0.00026567967,0.002452507,0.0018648297,0.07128129],"genre_scores_gemma":[0.843059,0.0013218004,0.14442375,0.00080450566,0.00032170696,0.0005885446,0.0013127091,0.0007694406,0.007398633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968736,0.00082904607,0.00009839515,0.00062380993,0.00088585453,0.0006893241],"domain_scores_gemma":[0.9740442,0.020330107,0.0014130009,0.0024949787,0.0009845427,0.00073318486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030050057,0.001835769,0.0017459474,0.0023994,0.0014001783,0.0031583267,0.0037027646,0.0016825966,0.014748015],"category_scores_gemma":[0.030057002,0.0012431554,0.0013450622,0.0026818975,0.0028004956,0.0072489874,0.0034639353,0.0042882813,0.0022438928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093801203,0.00040772944,0.009209462,0.0013284974,0.00027808233,0.000606332,0.00075784925,0.47929403,0.018798957,0.37074032,0.032572348,0.08506832],"study_design_scores_gemma":[0.00007258864,0.00006744437,0.0013867348,0.000104134626,0.00007107083,0.00030272512,0.00019145064,0.5328893,0.0058652596,0.45463806,0.0043521803,0.00005906421],"about_ca_topic_score_codex":0.0028798182,"about_ca_topic_score_gemma":0.006577671,"teacher_disagreement_score":0.014748015,"about_ca_system_score_codex":0.0037545646,"about_ca_system_score_gemma":0.0020741255,"threshold_uncertainty_score":0.04933697},"labels":[],"label_agreement":null},{"id":"W4287665957","doi":"10.48550/arxiv.2009.07932","title":"On Weak Flexibility in Planar Graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Iowa State University; Simon Fraser University; National Science Foundation","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Planar graph; Graph; List coloring; Discrete mathematics; Class (philosophy); Computer science; Graph power; Line graph; Artificial intelligence","score_opus":0.11771016570052466,"score_gpt":0.23967822767178157,"score_spread":0.12196806197125691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287665957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.386379,0.007581251,0.48316887,0.007591239,0.00042205374,0.0003086257,0.001777565,0.0011732439,0.11159818],"genre_scores_gemma":[0.93405634,0.0035193542,0.04460512,0.0014762456,0.0007967033,0.0003044164,0.0010771605,0.00035678345,0.013807879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682033,0.00084008265,0.00014715239,0.00082213746,0.00075695314,0.00061332504],"domain_scores_gemma":[0.9871247,0.008321963,0.0011523118,0.0018596653,0.00061775115,0.0009236394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020195865,0.0017339265,0.0014356812,0.003243394,0.0025776646,0.002525499,0.0026036212,0.001747083,0.007861637],"category_scores_gemma":[0.0141693745,0.00093522045,0.0019966823,0.0033609646,0.0057805097,0.008633013,0.0073090307,0.0046839206,0.0010280703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024092126,0.00003751094,0.0014730011,0.00023673824,0.000053255357,0.00032595915,0.0007015717,0.036197804,0.002821474,0.9356285,0.0030445997,0.019238818],"study_design_scores_gemma":[0.000035810877,0.000086524946,0.00076243933,0.000076081924,0.000044368036,0.00034919006,0.0002202543,0.04351726,0.0009936112,0.9410612,0.012803942,0.000049250943],"about_ca_topic_score_codex":0.0025278437,"about_ca_topic_score_gemma":0.0013394877,"teacher_disagreement_score":0.007861637,"about_ca_system_score_codex":0.0024983387,"about_ca_system_score_gemma":0.0006728781,"threshold_uncertainty_score":0.026299834},"labels":[],"label_agreement":null},{"id":"W4287703761","doi":"10.48550/arxiv.2007.14944","title":"Edge-colouring graphs with local list sizes","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Hypergraph; Generalization; Edge coloring; Chromatic scale; Graph; Degree (music); Discrete mathematics; Line graph; Physics; Mathematical analysis; Graph power","score_opus":0.06837617475248794,"score_gpt":0.20711603614274066,"score_spread":0.1387398613902527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287703761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44714102,0.001016753,0.5042203,0.0023967996,0.00010854481,0.00018025987,0.0013884621,0.0045718253,0.038975988],"genre_scores_gemma":[0.89837396,0.00057334226,0.082314774,0.00077077834,0.00017328585,0.00039926943,0.0009627102,0.00072818296,0.015703758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998007,0.00048428026,0.00007588888,0.00078414165,0.00032981136,0.00031887734],"domain_scores_gemma":[0.98613167,0.007690807,0.001435222,0.0031095652,0.00086528016,0.00076732686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001323536,0.0008591687,0.0008997567,0.0012503106,0.0016330299,0.0030368257,0.0029821298,0.0014034577,0.01202916],"category_scores_gemma":[0.014906686,0.0009869664,0.0010105565,0.0024723632,0.002850975,0.009443121,0.0037172786,0.0027498088,0.0023006804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010118397,0.0002827753,0.008499577,0.000858964,0.00014452367,0.0005258983,0.0012804143,0.13333829,0.034459166,0.7371938,0.014176706,0.06822803],"study_design_scores_gemma":[0.00013578557,0.00014161579,0.0023997012,0.000062172854,0.00014003388,0.00044476922,0.00026100868,0.18679509,0.014040221,0.785573,0.00992881,0.00007789869],"about_ca_topic_score_codex":0.0022385695,"about_ca_topic_score_gemma":0.0036305597,"teacher_disagreement_score":0.01202916,"about_ca_system_score_codex":0.0027958758,"about_ca_system_score_gemma":0.0010331091,"threshold_uncertainty_score":0.0402416},"labels":[],"label_agreement":null},{"id":"W4287764604","doi":"10.48550/arxiv.2006.03188","title":"A note on the connected game coloring number","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; List coloring; Complete coloring; Mathematics; Degeneracy (biology); Fractional coloring; Discrete mathematics; Graph; Graph coloring; Bounded function; Edge coloring; Graph power; Line graph","score_opus":0.12157014200749877,"score_gpt":0.23647111567974674,"score_spread":0.11490097367224797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287764604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1195654,0.017184943,0.5168995,0.03265537,0.009005134,0.0002275439,0.000673424,0.00099123,0.30279747],"genre_scores_gemma":[0.78721,0.007827,0.16588864,0.009677899,0.00458994,0.0004010761,0.00041339902,0.00074535684,0.023246689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972281,0.0011049213,0.00008785964,0.00074845325,0.00058355613,0.0002471182],"domain_scores_gemma":[0.98902917,0.008367841,0.0003868643,0.0009590529,0.00055872655,0.00069833157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023180733,0.0013168005,0.0010258324,0.0022242025,0.0020344432,0.0030309358,0.0025429924,0.002458366,0.0058032693],"category_scores_gemma":[0.0144791035,0.00050527113,0.00088739564,0.0026397752,0.008434294,0.008399114,0.0037148744,0.0077865873,0.0009948522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040689883,0.00001878719,0.00031805047,0.000041795043,0.0000072807056,0.00005559097,0.00012302196,0.0030819366,0.0005349776,0.9837601,0.004534653,0.0074832127],"study_design_scores_gemma":[0.000017773526,0.000034094835,0.00020934433,0.00004687754,0.000011437734,0.00009149886,0.00005269176,0.018817531,0.00061056955,0.95860934,0.021470396,0.000028430035],"about_ca_topic_score_codex":0.0026925758,"about_ca_topic_score_gemma":0.0016561986,"teacher_disagreement_score":0.0058032693,"about_ca_system_score_codex":0.0022407158,"about_ca_system_score_gemma":0.00083859963,"threshold_uncertainty_score":0.019413829},"labels":[],"label_agreement":null},{"id":"W4288374872","doi":"10.48550/arxiv.1904.03723","title":"Linear-Time and Efficient Distributed Algorithms for List Coloring\\n Graphs on Surfaces","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Algorithm; Time complexity; Vertex (graph theory); Discrete mathematics; Edge coloring; Graph; Line graph; Graph power","score_opus":0.07860142928739612,"score_gpt":0.2365674104703093,"score_spread":0.15796598118291316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288374872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0899705,0.0021023003,0.85859257,0.002444786,0.00029946305,0.00058527995,0.0012958654,0.019319925,0.025389306],"genre_scores_gemma":[0.50161403,0.0007089633,0.47607765,0.0005802031,0.00019055349,0.0007545605,0.004055706,0.0012337783,0.014784515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968554,0.0004308951,0.00019193256,0.00097565894,0.0007660737,0.0007800479],"domain_scores_gemma":[0.99449146,0.002463422,0.00034987114,0.0018270931,0.0005636098,0.00030456166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013136626,0.0019690206,0.0017093086,0.0011544329,0.002462993,0.0030404748,0.004525829,0.002034082,0.010678352],"category_scores_gemma":[0.0061131204,0.0009250168,0.0017808812,0.0029531745,0.0016999672,0.006262797,0.0042826533,0.0026463557,0.0039849244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003091878,0.0008189255,0.0038746325,0.0011412277,0.00028184813,0.00034637513,0.0013581577,0.2901937,0.030116482,0.1326304,0.057146832,0.4789996],"study_design_scores_gemma":[0.0005817986,0.00022286025,0.00078411505,0.00005168841,0.00011016612,0.00015491543,0.00032460116,0.8154997,0.012310535,0.15595147,0.013934852,0.00007326799],"about_ca_topic_score_codex":0.007708847,"about_ca_topic_score_gemma":0.011968207,"teacher_disagreement_score":0.010678352,"about_ca_system_score_codex":0.0042230366,"about_ca_system_score_gemma":0.0035990686,"threshold_uncertainty_score":0.035722613},"labels":[],"label_agreement":null},{"id":"W4289222390","doi":"10.1016/j.jctb.2022.06.002","title":"Bounding χ by a fraction of Δ for graphs without large cliques","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Degree (music); Upper and lower bounds; Conjecture; Discrete mathematics; Vertex (graph theory); Brooks' theorem; Bounding overwatch; Fractional coloring; Graph; Clique; Chromatic scale; Graph coloring; Greedy coloring; Clique number; Chordal graph; Graph power; Line graph; 1-planar graph; Computer science","score_opus":0.012658909168851392,"score_gpt":0.30400812249916687,"score_spread":0.2913492133303155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289222390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31509253,0.005369253,0.6092999,0.012445437,0.00091897347,0.00021943118,0.0018422859,0.0056216563,0.04919043],"genre_scores_gemma":[0.87912387,0.0014151628,0.10660449,0.0016924113,0.0007004832,0.0002135964,0.0008637197,0.0014971357,0.007889092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944916,0.0015961165,0.00018209899,0.0015439986,0.00094397465,0.0012423219],"domain_scores_gemma":[0.92309326,0.062154245,0.0024654358,0.008212443,0.0013559011,0.002718677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058714612,0.0030619246,0.0024122864,0.002603387,0.0022321153,0.0041484614,0.0061849216,0.0030619886,0.00744134],"category_scores_gemma":[0.05201118,0.0014930954,0.0018681474,0.0019997424,0.004159642,0.014695781,0.004688318,0.005525902,0.0018063963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031393452,0.0008162836,0.013580656,0.001546215,0.00041637605,0.00055340386,0.0007478348,0.42080382,0.031224893,0.4066506,0.026263267,0.09425728],"study_design_scores_gemma":[0.00006383265,0.00010599325,0.0012914586,0.000117178366,0.00011145264,0.00026607796,0.00011263303,0.66824645,0.008587579,0.3175993,0.0034481997,0.000049907874],"about_ca_topic_score_codex":0.0026422008,"about_ca_topic_score_gemma":0.003045335,"teacher_disagreement_score":0.00744134,"about_ca_system_score_codex":0.0036969816,"about_ca_system_score_gemma":0.0020752659,"threshold_uncertainty_score":0.031051636},"labels":[],"label_agreement":null},{"id":"W4289455500","doi":"10.1109/focs.2018.00074","title":"Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Genus; Time complexity; Polynomial-time approximation scheme; Quadratic equation; Mathematics; Scheme (mathematics); Approximation algorithm; Embedding; Polynomial; Combinatorics; Discrete mathematics; Algorithm; Computer science; Mathematical analysis; Artificial intelligence; Geometry","score_opus":0.02184293508396369,"score_gpt":0.2890824211643078,"score_spread":0.26723948608034415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289455500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27158958,0.00059449486,0.7100298,0.00093951717,0.00009896518,0.00021291761,0.00094781426,0.009549465,0.0060374252],"genre_scores_gemma":[0.75097424,0.00022095795,0.24444501,0.00014390712,0.000054302494,0.00017506872,0.0015486485,0.00037018958,0.002067709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982973,0.00023907809,0.00009692026,0.0004491821,0.00053644466,0.0003810868],"domain_scores_gemma":[0.9959537,0.0012341627,0.00039796787,0.0018964794,0.00030130308,0.00021634166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011336192,0.0010162212,0.0011919468,0.00097085297,0.0010976844,0.0026147,0.0029225035,0.0011089419,0.0035980719],"category_scores_gemma":[0.007112288,0.0004531561,0.0011699015,0.0017284811,0.0011522428,0.005025585,0.0028718016,0.0021470422,0.0008632458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031553872,0.00051626394,0.009184534,0.00065493316,0.00018735914,0.00025730504,0.0010190324,0.45025334,0.071415685,0.14607821,0.013276808,0.30400103],"study_design_scores_gemma":[0.00019811867,0.00014396022,0.0010314977,0.000025797748,0.000067247565,0.00014637459,0.00011848869,0.89753574,0.015099323,0.08264774,0.0029458178,0.00003993881],"about_ca_topic_score_codex":0.004228816,"about_ca_topic_score_gemma":0.0051768413,"teacher_disagreement_score":0.004228816,"about_ca_system_score_codex":0.003753962,"about_ca_system_score_gemma":0.0024457998,"threshold_uncertainty_score":0.027236998},"labels":[],"label_agreement":null},{"id":"W4289885984","doi":"10.1002/jgt.22870","title":"Characterizing circular colouring mixing for pq&lt;4 $\\frac{p}{q}\\lt 4$","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Homomorphism; Conjecture; Bipartite graph; Vertex (graph theory); Mixing (physics); Graph; Planar graph; Discrete mathematics; Physics","score_opus":0.022589676475499584,"score_gpt":0.28187799252581675,"score_spread":0.25928831605031716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289885984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75253004,0.0001744521,0.23536246,0.0011120769,0.00003284429,0.00023099183,0.00081355346,0.0008670153,0.008876564],"genre_scores_gemma":[0.94993544,0.0000679541,0.046188667,0.00014042413,0.000030693293,0.000098620825,0.00088525505,0.00014747244,0.0025055283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985323,0.00029228828,0.00009502995,0.0006011,0.00020813815,0.00027117945],"domain_scores_gemma":[0.9907985,0.0056938613,0.00096085377,0.001272281,0.0005468789,0.0007276967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014675509,0.0006062213,0.00063246745,0.00069712463,0.0013329587,0.0026491547,0.0012816272,0.0012462788,0.0053677573],"category_scores_gemma":[0.0065131215,0.00048959267,0.00096997974,0.0009975276,0.00205469,0.0049123843,0.002174241,0.0017267969,0.0004269561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002296071,0.00088874367,0.02135191,0.0005409534,0.00019515493,0.0006802077,0.0020788515,0.20741493,0.057908244,0.60242325,0.009588112,0.094633594],"study_design_scores_gemma":[0.000104536564,0.00020239159,0.0027558361,0.000046048426,0.00006156662,0.00040030372,0.0005915415,0.3848211,0.02576817,0.5799723,0.0052032494,0.00007296799],"about_ca_topic_score_codex":0.002518435,"about_ca_topic_score_gemma":0.002473909,"teacher_disagreement_score":0.0053677573,"about_ca_system_score_codex":0.0018862609,"about_ca_system_score_gemma":0.0012605068,"threshold_uncertainty_score":0.017956913},"labels":[],"label_agreement":null},{"id":"W4290720427","doi":"10.3390/math10152787","title":"Acyclic Chromatic Index of 1-Planar Graphs","year":2022,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Planar graph; Combinatorics; Friendship graph; Edge coloring; Outerplanar graph; Mathematics; Windmill graph; Graph; Book embedding; Butterfly graph; Discrete mathematics; Wheel graph; Graph power; 1-planar graph; Line graph; Voltage graph","score_opus":0.022745750849878076,"score_gpt":0.28162561902337263,"score_spread":0.25887986817349457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290720427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85697496,0.001136662,0.051834844,0.0005640015,0.00006929009,0.00008743022,0.002165372,0.00039113822,0.08677627],"genre_scores_gemma":[0.97491974,0.0009413047,0.013751475,0.0001232026,0.000089823814,0.00006353331,0.0015045428,0.000098724544,0.008507594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955374,0.000039976592,0.000018153432,0.000117207426,0.00013228477,0.0001386888],"domain_scores_gemma":[0.99801505,0.0007102577,0.0003850278,0.000222334,0.0003394543,0.00032797316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031010306,0.00035350112,0.00023940546,0.0031786424,0.001112024,0.0018042455,0.00064598286,0.00030027493,0.004367683],"category_scores_gemma":[0.0018771902,0.0002990145,0.00029419153,0.0025387227,0.0011668591,0.0016225775,0.0010057497,0.000956186,0.00045028146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004208334,0.00012688615,0.016219843,0.00028077886,0.00005207819,0.00028668257,0.0010340933,0.041246913,0.040628698,0.82280993,0.008620358,0.06827291],"study_design_scores_gemma":[0.000051136067,0.00011603598,0.023335073,0.000088977205,0.000087928434,0.0007020851,0.00058867777,0.07792294,0.01763545,0.8347715,0.0445981,0.00010213835],"about_ca_topic_score_codex":0.0070427964,"about_ca_topic_score_gemma":0.008183269,"teacher_disagreement_score":0.0070427964,"about_ca_system_score_codex":0.0023236256,"about_ca_system_score_gemma":0.0006958788,"threshold_uncertainty_score":0.016859174},"labels":[],"label_agreement":null},{"id":"W4291794536","doi":"10.1016/j.dam.2022.08.005","title":"Irredundance graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Graph; Discrete mathematics","score_opus":0.019515790046845772,"score_gpt":0.2775828868383306,"score_spread":0.2580670967914848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291794536","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32627174,0.0010400602,0.13794649,0.004039699,0.00057974085,0.00014174964,0.0011350262,0.0011380909,0.5277074],"genre_scores_gemma":[0.9097772,0.0006211577,0.017364485,0.00093586807,0.00040616083,0.00009415173,0.0009953233,0.00041617826,0.06938945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999178,0.00016020337,0.000036809404,0.0002690188,0.00019842655,0.00015751402],"domain_scores_gemma":[0.9977247,0.0008461314,0.0002640493,0.0004778106,0.00037612274,0.00031123025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071302435,0.0009244089,0.0008109014,0.0025522923,0.003394071,0.002369094,0.0012856422,0.0011748939,0.019631771],"category_scores_gemma":[0.0027778482,0.00056245626,0.0009414842,0.0015606565,0.0024158775,0.0049045025,0.0019342067,0.0035264248,0.0018371037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022852264,0.00001402433,0.00010912118,0.000018160936,0.000004457597,0.00006483091,0.000119786644,0.00019257958,0.00068272883,0.994395,0.0013199787,0.0030565131],"study_design_scores_gemma":[0.000007313017,0.000009500496,0.00019765465,0.000007479589,0.000008010825,0.0001366557,0.000069666225,0.0008786855,0.0006567752,0.99239177,0.00562986,0.000006641473],"about_ca_topic_score_codex":0.00090754626,"about_ca_topic_score_gemma":0.0011162822,"teacher_disagreement_score":0.019631771,"about_ca_system_score_codex":0.0009125602,"about_ca_system_score_gemma":0.0004036287,"threshold_uncertainty_score":0.06567484},"labels":[],"label_agreement":null},{"id":"W4292258317","doi":"10.46298/dmtcs.7660","title":"Tuza's Conjecture for Threshold Graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst; European Commission","keywords":"Clique-sum; Mathematics; Combinatorics; Treewidth; Pathwidth; Cograph; Chordal graph; Conjecture; 1-planar graph; Indifference graph; Discrete mathematics; Planar graph; Split graph; Graph; Disjoint sets; Line graph","score_opus":0.019202324987098087,"score_gpt":0.2970529105084879,"score_spread":0.27785058552138986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292258317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5812925,0.005212354,0.22072223,0.017151525,0.0016535058,0.00020033684,0.0026140602,0.0037067358,0.16744675],"genre_scores_gemma":[0.9650845,0.0018213174,0.017409008,0.0022281636,0.0005672159,0.00019288115,0.001475946,0.0002620398,0.010958974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987741,0.00014186397,0.00005456221,0.00036603032,0.00022419069,0.0004391949],"domain_scores_gemma":[0.9908393,0.005093447,0.0005283349,0.0015849766,0.0009877309,0.00096624426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012263948,0.0007361212,0.0012453052,0.0016546817,0.0022312955,0.004005112,0.0016022773,0.0022070906,0.0102628125],"category_scores_gemma":[0.014378585,0.0005726565,0.0012947607,0.002357151,0.0031503441,0.009034886,0.0029343895,0.0040396466,0.001589073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050894707,0.0001108073,0.0036339103,0.00038380903,0.000050448074,0.00027817235,0.00080488774,0.016855009,0.0070388615,0.90622365,0.03248608,0.03162536],"study_design_scores_gemma":[0.0000870784,0.00006611783,0.0012223554,0.00008015653,0.000051037983,0.00032440925,0.0003651693,0.030140337,0.0027954655,0.944085,0.020743538,0.00003938328],"about_ca_topic_score_codex":0.004486757,"about_ca_topic_score_gemma":0.002995048,"teacher_disagreement_score":0.0102628125,"about_ca_system_score_codex":0.0024985597,"about_ca_system_score_gemma":0.0014513162,"threshold_uncertainty_score":0.034332573},"labels":[],"label_agreement":null},{"id":"W4293795622","doi":"10.48550/arxiv.2112.02633","title":"Hereditary classes of ordered sets of width at most two","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Agence Nationale de la Recherche; Canadian Defence Academy","keywords":"Mathematics; Countable set; Bipartite graph; Combinatorics; Partially ordered set; Conjecture; Permutation (music); Discrete mathematics; Class (philosophy); Graph; Computer science","score_opus":0.07282576209150653,"score_gpt":0.2334737114108887,"score_spread":0.1606479493193822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293795622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9440661,0.00031484774,0.043639682,0.00020826822,0.000023073788,0.000023279323,0.0003547329,0.0001787384,0.011191378],"genre_scores_gemma":[0.9916397,0.00013824862,0.00431938,0.000050003622,0.000047463407,0.000027387812,0.000402192,0.000021866015,0.0033537871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999178,0.000094066054,0.00006269868,0.00026125347,0.00020175285,0.0002022437],"domain_scores_gemma":[0.9975489,0.0011506142,0.0004965769,0.00026549492,0.00018054387,0.00035793227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005411645,0.00032284067,0.00034845638,0.0016993597,0.000892227,0.0020211488,0.0006303537,0.0003210063,0.003172286],"category_scores_gemma":[0.0017082421,0.00037228173,0.00062752946,0.0009904206,0.0018594922,0.003517776,0.0010183947,0.0007117901,0.00015235128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001297122,0.00010141554,0.011562326,0.00008708931,0.000047278612,0.0003724032,0.0012707937,0.0050283326,0.008833373,0.95069075,0.0008774516,0.020999016],"study_design_scores_gemma":[0.000050732586,0.00014957681,0.014069812,0.000044012297,0.00006657604,0.0009480216,0.0009209819,0.033934224,0.009639651,0.9326082,0.007506755,0.00006160431],"about_ca_topic_score_codex":0.0015812741,"about_ca_topic_score_gemma":0.0014597956,"teacher_disagreement_score":0.003172286,"about_ca_system_score_codex":0.0012554623,"about_ca_system_score_gemma":0.000376035,"threshold_uncertainty_score":0.010612309},"labels":[],"label_agreement":null},{"id":"W4295008616","doi":"10.1007/s10878-022-00900-y","title":"Linear time algorithms on mirror trees","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Université du Québec à Chicoutimi","funders":"Agence Nationale de la Recherche","keywords":"Theory of computation; Time complexity; Algorithm; Mathematics; Linear programming; Running time; Isomorphism (crystallography); Graph algorithms; Graph; Combinatorics; Computer science; Discrete mathematics","score_opus":0.015391637546273932,"score_gpt":0.2813810696624643,"score_spread":0.26598943211619036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295008616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22908948,0.0013251202,0.70670897,0.0045956746,0.00030937206,0.0005772026,0.0012110991,0.0044784974,0.05170448],"genre_scores_gemma":[0.59652495,0.00067709904,0.37204146,0.001044725,0.00025863072,0.0005643635,0.0015024884,0.00090483547,0.026481489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812025,0.00060962356,0.00012240156,0.00037415317,0.00042064543,0.00035294215],"domain_scores_gemma":[0.99230874,0.0050145113,0.0004629101,0.0014292288,0.00046388677,0.0003206937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001567903,0.0008761287,0.0016883694,0.0010036358,0.0014750318,0.0033789994,0.0033046692,0.0016266993,0.015051498],"category_scores_gemma":[0.012539074,0.0010841943,0.0012042279,0.0020306662,0.0013471922,0.0089621395,0.0034056604,0.0026019376,0.0022602698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020338607,0.0009867181,0.0023826975,0.000590174,0.00015256443,0.00022084538,0.00056707027,0.10925492,0.010142871,0.5668984,0.03985877,0.2669111],"study_design_scores_gemma":[0.00032502197,0.00014953905,0.00041929065,0.00003719422,0.00006292417,0.00012630083,0.00011937174,0.4202559,0.0030253085,0.5707977,0.004659505,0.000021911426],"about_ca_topic_score_codex":0.0027962085,"about_ca_topic_score_gemma":0.0052771596,"teacher_disagreement_score":0.015051498,"about_ca_system_score_codex":0.0024335543,"about_ca_system_score_gemma":0.0022955167,"threshold_uncertainty_score":0.050352216},"labels":[],"label_agreement":null},{"id":"W4295796971","doi":"10.1016/j.jctb.2022.09.001","title":"A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number","year":2022,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Counterexample; Mathematics; Conjecture; Digraph; Induced subgraph; Clique number; Bounded function; Chromatic scale; Graph; Discrete mathematics; Perfect graph; Pathwidth; Line graph; Vertex (graph theory)","score_opus":0.046242049614965176,"score_gpt":0.20926206288637625,"score_spread":0.16302001327141108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295796971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71470964,0.0009187595,0.18957886,0.033874888,0.0006320382,0.00014131248,0.0018095865,0.0014934308,0.05684153],"genre_scores_gemma":[0.9539731,0.0005609634,0.033974282,0.0024884732,0.0003151771,0.00015374986,0.001655783,0.00019790432,0.006680574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976037,0.0005681493,0.000095046766,0.0008748218,0.00049948966,0.0003588052],"domain_scores_gemma":[0.9779478,0.015897177,0.0013035994,0.0029491722,0.0008784028,0.001023813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019161544,0.00071419403,0.0007639075,0.0009998427,0.0025067315,0.0023781338,0.002790603,0.002364514,0.008247054],"category_scores_gemma":[0.014142697,0.0009012527,0.0011010153,0.0016618836,0.00408899,0.0066095986,0.0030260866,0.0038146172,0.0007801277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009936213,0.00035514275,0.012451308,0.0005975291,0.00012720328,0.0019048683,0.0022057258,0.02573134,0.01680216,0.86976564,0.040464114,0.028601358],"study_design_scores_gemma":[0.00032253543,0.00019136253,0.0039236373,0.000108309636,0.00011350946,0.0022721211,0.0009116559,0.08699515,0.014536544,0.86466855,0.025878873,0.00007775595],"about_ca_topic_score_codex":0.002784511,"about_ca_topic_score_gemma":0.0026461985,"teacher_disagreement_score":0.008247054,"about_ca_system_score_codex":0.0016459831,"about_ca_system_score_gemma":0.00073030917,"threshold_uncertainty_score":0.027589142},"labels":[],"label_agreement":null},{"id":"W4296168370","doi":"10.1007/978-3-031-16081-3_34","title":"Fast Searching on k-Combinable Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cartesian product; Product (mathematics); Graph; Search tree; Tree (set theory); Depth-first search; Search algorithm; Cartesian coordinate system","score_opus":0.021495394991355426,"score_gpt":0.2802285690483312,"score_spread":0.25873317405697577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296168370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2623999,0.003222096,0.600159,0.0015878888,0.00037961607,0.0003427546,0.0029219424,0.009908287,0.119078435],"genre_scores_gemma":[0.37306488,0.0021571973,0.56041485,0.0003208674,0.00014951878,0.00028190887,0.0042101815,0.0020225346,0.05737818],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939394,0.0001041783,0.000039916948,0.0001514157,0.00018577902,0.00012477134],"domain_scores_gemma":[0.9974808,0.0015784249,0.00013267633,0.0005366386,0.00016834323,0.000103105966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003790368,0.0010000708,0.0014521657,0.0019033388,0.0012543208,0.001914427,0.0022587574,0.0011246996,0.021865033],"category_scores_gemma":[0.0030852638,0.0008332156,0.0011909776,0.0055916086,0.0008716164,0.006952412,0.0026354727,0.0012914551,0.004642357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074147107,0.00019853594,0.0016480702,0.0017226752,0.00014894009,0.0005405291,0.0007675326,0.059407517,0.026686609,0.18834361,0.064282015,0.65551245],"study_design_scores_gemma":[0.00015174651,0.00017506305,0.0015465794,0.00019405564,0.00014296436,0.0009894248,0.00045834537,0.24373579,0.011142494,0.7101522,0.031238634,0.00007282446],"about_ca_topic_score_codex":0.003062175,"about_ca_topic_score_gemma":0.0056119678,"teacher_disagreement_score":0.021865033,"about_ca_system_score_codex":0.0013844399,"about_ca_system_score_gemma":0.0008792291,"threshold_uncertainty_score":0.07314587},"labels":[],"label_agreement":null},{"id":"W4296437525","doi":"10.48550/arxiv.1309.4140","title":"Dynamic vs Oblivious Routing in Network Design","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing (electronic design automation); Polytope; Static routing; Multipath routing; Mathematical optimization; Mathematics; Combinatorics; Routing protocol; Computer network","score_opus":0.07349595624345387,"score_gpt":0.21494370200330884,"score_spread":0.14144774575985497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296437525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028075077,0.00049602543,0.9619554,0.001306802,0.000051831372,0.00005394032,0.000095458214,0.00021293746,0.0077524763],"genre_scores_gemma":[0.71452063,0.0016264475,0.27581015,0.00067853514,0.00018321526,0.00024480346,0.00015684598,0.00023051105,0.0065488974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871886,0.00057588273,0.0000375738,0.00027846647,0.00026398088,0.0001252448],"domain_scores_gemma":[0.9966575,0.002064597,0.0004058313,0.000645578,0.00014201012,0.000084530526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019206582,0.00085857045,0.00071575714,0.0005343691,0.0004742289,0.0011292794,0.0014102994,0.0011990109,0.003835082],"category_scores_gemma":[0.0065403,0.00054347486,0.00053864624,0.0006894811,0.0021212485,0.003981954,0.001449863,0.0019529585,0.00045978426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015087255,0.000047257377,0.00019549362,0.00017406908,0.000044291017,0.000054716777,0.000057000725,0.57885504,0.004878077,0.38355878,0.0016016335,0.030382678],"study_design_scores_gemma":[0.000039843973,0.00012925586,0.000103923514,0.000020493968,0.000021071985,0.000042184245,0.000037014666,0.6292086,0.0031403697,0.36332855,0.0039135176,0.00001514661],"about_ca_topic_score_codex":0.000642695,"about_ca_topic_score_gemma":0.0008293991,"teacher_disagreement_score":0.003835082,"about_ca_system_score_codex":0.0016960786,"about_ca_system_score_gemma":0.0007009098,"threshold_uncertainty_score":0.012829602},"labels":[],"label_agreement":null},{"id":"W4297724406","doi":"10.37236/10411","title":"$2\\times n$ Grids have Unbounded Anagram-Free Chromatic Number","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Anagram; Mathematics; Combinatorics; Vertex (graph theory); Bounded function; Chromatic scale; Square-free integer; Grid; Discrete mathematics; Graph; Geometry","score_opus":0.008679594744389717,"score_gpt":0.2614543574190871,"score_spread":0.2527747626746974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297724406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8078992,0.0005299784,0.14312203,0.0014128096,0.00021306972,0.000060894385,0.0005667746,0.0010651791,0.04513008],"genre_scores_gemma":[0.9176389,0.00030706942,0.06306914,0.00039426843,0.00003342564,0.0001434842,0.00052469224,0.00033135535,0.017557627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928856,0.00011385044,0.0000321478,0.0001748525,0.00014411753,0.0002463463],"domain_scores_gemma":[0.9954608,0.0024363147,0.00045198397,0.0010169456,0.00023381895,0.00040017677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043741637,0.0006798931,0.0005193029,0.0004028818,0.0012585956,0.0017907209,0.0013691612,0.0006825074,0.010824769],"category_scores_gemma":[0.0027556457,0.0005153239,0.000764351,0.00061122316,0.0015756598,0.0038487911,0.00222985,0.0013894174,0.001208625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024662279,0.000323268,0.012315955,0.00071400753,0.00014764818,0.0015292784,0.0010911035,0.08521532,0.11894156,0.6825397,0.020152684,0.074563324],"study_design_scores_gemma":[0.00028693123,0.000289786,0.007019858,0.0000911074,0.000118764496,0.0016383353,0.0007421316,0.19342217,0.048195437,0.70375985,0.0443254,0.00011026511],"about_ca_topic_score_codex":0.0029702587,"about_ca_topic_score_gemma":0.0054352963,"teacher_disagreement_score":0.010824769,"about_ca_system_score_codex":0.0009962508,"about_ca_system_score_gemma":0.0008149194,"threshold_uncertainty_score":0.036212444},"labels":[],"label_agreement":null},{"id":"W4298156949","doi":"10.60692/qgwq7-feg45","title":"Cycle transversals in bounded degree graphs","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Degree (music); Bounded function; Mathematics; Combinatorics; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.08373494902059772,"score_gpt":0.29485420605563617,"score_spread":0.21111925703503845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298156949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49506652,0.0021235803,0.4863988,0.0020828878,0.00008085087,0.00034252097,0.0011568824,0.0015536947,0.0111943],"genre_scores_gemma":[0.70917267,0.0013186187,0.27999333,0.00027219087,0.00008883919,0.00018783096,0.0029745316,0.00031572493,0.00567617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986921,0.0003311308,0.00008870376,0.0003819843,0.00025541897,0.00025071338],"domain_scores_gemma":[0.99453294,0.0034231746,0.00060992746,0.00074455497,0.00033819384,0.00035111973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009944172,0.0008350298,0.0011232643,0.0012427642,0.001158686,0.0026128998,0.0017950493,0.001113463,0.004866923],"category_scores_gemma":[0.0066619823,0.00077354704,0.0012348519,0.0022089742,0.0014687119,0.0049519413,0.0019023257,0.0018826508,0.0006183373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011501485,0.0003654624,0.0050488496,0.00091689476,0.00017876543,0.00034794596,0.0008701898,0.60229206,0.020752426,0.25217205,0.0076826615,0.108222514],"study_design_scores_gemma":[0.00013343223,0.00009569213,0.0008160824,0.000058390426,0.00006024537,0.00030699524,0.00039324386,0.66669726,0.0079231765,0.3191165,0.0043655653,0.000033367156],"about_ca_topic_score_codex":0.0054135867,"about_ca_topic_score_gemma":0.0069286083,"teacher_disagreement_score":0.0054135867,"about_ca_system_score_codex":0.0022119726,"about_ca_system_score_gemma":0.0013421682,"threshold_uncertainty_score":0.016281486},"labels":[],"label_agreement":null},{"id":"W4299814619","doi":"10.48550/arxiv.1107.1292","title":"Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with\\n Applications","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Separator (oil production); Mathematics; Binary logarithm; Graph; Minor (academic); Upper and lower bounds; Planar graph; Discrete mathematics; Physics; Mathematical analysis; Thermodynamics","score_opus":0.06812773794562967,"score_gpt":0.2137788574022211,"score_spread":0.14565111945659143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299814619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093680575,0.002561348,0.8196917,0.0038803644,0.00036940104,0.00028565593,0.0010240225,0.002672673,0.07583421],"genre_scores_gemma":[0.5998703,0.0029256148,0.3329523,0.002754707,0.0007866169,0.0010501642,0.0028953522,0.0013854781,0.05537941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990607,0.00015731584,0.00006626084,0.00026441645,0.00027616217,0.00017522005],"domain_scores_gemma":[0.994279,0.0037171189,0.00037554014,0.0008016964,0.00050559436,0.0003209614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010388126,0.0014952851,0.00080270256,0.0022886838,0.001488235,0.0017319213,0.001981241,0.0009738977,0.011576511],"category_scores_gemma":[0.006138979,0.00081521366,0.0019235893,0.0021798934,0.0019161919,0.006134704,0.004694347,0.0045820605,0.002453637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005632912,0.00019395606,0.0013561193,0.0006469834,0.0000948899,0.0003024101,0.0010324726,0.015934475,0.013450906,0.83300555,0.019824566,0.113594435],"study_design_scores_gemma":[0.000108323045,0.000106403095,0.00093030406,0.00006802553,0.000072193674,0.00034995834,0.00016677985,0.050621547,0.007991931,0.9097913,0.029742785,0.000050438834],"about_ca_topic_score_codex":0.0015091441,"about_ca_topic_score_gemma":0.0020642576,"teacher_disagreement_score":0.011576511,"about_ca_system_score_codex":0.0017522092,"about_ca_system_score_gemma":0.0010491771,"threshold_uncertainty_score":0.038727283},"labels":[],"label_agreement":null},{"id":"W4300040415","doi":"","title":"Locating any two vertices on Hamiltonian cycles","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Jewish General Hospital","funders":"","keywords":"Hamiltonian (control theory); Hamiltonian path; Combinatorics; Mathematics; Physics; Computer science; Graph; Mathematical optimization","score_opus":0.023523900163965907,"score_gpt":0.287574474175542,"score_spread":0.2640505740115761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300040415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5930211,0.0011884526,0.34858176,0.0014557677,0.00036978215,0.00019641593,0.00046273423,0.0005244651,0.05419943],"genre_scores_gemma":[0.9134098,0.0005522204,0.07628917,0.00030469065,0.000059646223,0.0001297947,0.0003809612,0.00011568391,0.008757965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995302,0.000084897394,0.000018338178,0.00014864278,0.000091492,0.00012639955],"domain_scores_gemma":[0.9989171,0.0005745692,0.00013495922,0.0001626997,0.000098205244,0.000112434376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024409477,0.0005115833,0.0005991243,0.0006541144,0.0016552946,0.00086521846,0.0012154012,0.0012320528,0.006349942],"category_scores_gemma":[0.003466705,0.0006229206,0.0005291515,0.00080979214,0.0013982407,0.0024200997,0.0030010198,0.0011560043,0.0008873178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047579556,0.000078182115,0.0061635706,0.00068372,0.00007025249,0.002296244,0.0022346776,0.027439453,0.02263296,0.8712154,0.006363209,0.060346425],"study_design_scores_gemma":[0.00011280867,0.00012899996,0.0023688124,0.00018640114,0.0000841852,0.0010558157,0.0014652695,0.07699467,0.014002223,0.86547637,0.038047902,0.00007661766],"about_ca_topic_score_codex":0.0018999667,"about_ca_topic_score_gemma":0.0019952625,"teacher_disagreement_score":0.006349942,"about_ca_system_score_codex":0.00052054384,"about_ca_system_score_gemma":0.0005543375,"threshold_uncertainty_score":0.021242678},"labels":[],"label_agreement":null},{"id":"W4300051575","doi":"","title":"(Circular) backbone colouring: tree backbones in planar graphs","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar; Tree (set theory); Computer science; Mathematics; Computer graphics (images)","score_opus":0.04534725260201361,"score_gpt":0.30355880036842553,"score_spread":0.2582115477664119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300051575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47086242,0.0015941863,0.4977011,0.0037236682,0.00014503478,0.00033629776,0.0013291134,0.00088834995,0.023419784],"genre_scores_gemma":[0.8154259,0.001472456,0.1713729,0.000572906,0.00022295954,0.00019989662,0.001708192,0.00022556083,0.008799256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989121,0.00021744521,0.000055151166,0.00039367293,0.00018851095,0.00023311807],"domain_scores_gemma":[0.9945353,0.0033389868,0.00068286905,0.000708207,0.00032860358,0.00040600856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012790475,0.0004981713,0.0007222339,0.00061903667,0.00139896,0.0023442372,0.0020761539,0.0022015446,0.0065735625],"category_scores_gemma":[0.006780301,0.0006789183,0.00066441373,0.0017669566,0.002328417,0.00677479,0.0026475086,0.0016652643,0.0007799482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014527125,0.0005122738,0.008082397,0.0015956871,0.00011119891,0.0011493867,0.0018109132,0.16087523,0.03260919,0.6234745,0.02373642,0.14459008],"study_design_scores_gemma":[0.0003127137,0.0003852141,0.0034522568,0.00014182633,0.00012521778,0.0028710715,0.0013954026,0.3292353,0.020299813,0.6163362,0.025354357,0.000090546644],"about_ca_topic_score_codex":0.0025970577,"about_ca_topic_score_gemma":0.002217493,"teacher_disagreement_score":0.0065735625,"about_ca_system_score_codex":0.0011115512,"about_ca_system_score_gemma":0.000797754,"threshold_uncertainty_score":0.021990716},"labels":[],"label_agreement":null},{"id":"W4300158289","doi":"","title":"Cycles intersecting edge-cuts of prescribed sizes","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.025753434914451305,"score_gpt":0.30150521464283647,"score_spread":0.27575177972838516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300158289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85296905,0.0005621955,0.11905228,0.00045047025,0.00006627975,0.00006414412,0.000518275,0.00024735622,0.026069876],"genre_scores_gemma":[0.9503053,0.00037214466,0.043422844,0.00013597883,0.00003393543,0.00005153501,0.0007365377,0.00006643778,0.004875251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994765,0.000052287043,0.00002455871,0.00015789334,0.00013785316,0.00015098164],"domain_scores_gemma":[0.99800974,0.00081933255,0.0004560551,0.00028241752,0.00020543704,0.00022701717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002860356,0.00047562874,0.0004401816,0.00077207375,0.00095609896,0.0013090738,0.0007873781,0.0007441094,0.004310777],"category_scores_gemma":[0.002718356,0.00045780095,0.0006045411,0.0008969923,0.00108629,0.0022580633,0.0013734009,0.0009235149,0.0003810183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009852714,0.00017530551,0.017379574,0.00063240516,0.00014809455,0.0016652634,0.0014910173,0.071934335,0.05697258,0.7618721,0.007310184,0.079433866],"study_design_scores_gemma":[0.00015636373,0.00041927837,0.00808248,0.00022179558,0.0001919598,0.00290671,0.001417274,0.19029903,0.057014816,0.6768747,0.062318217,0.0000974914],"about_ca_topic_score_codex":0.0028482366,"about_ca_topic_score_gemma":0.004314479,"teacher_disagreement_score":0.004310777,"about_ca_system_score_codex":0.00088915863,"about_ca_system_score_gemma":0.00050322886,"threshold_uncertainty_score":0.014421046},"labels":[],"label_agreement":null},{"id":"W4300944187","doi":"10.1016/j.aam.2006.05.006","title":"Counting unlabelled toroidal graphs with no <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-subdivisions","year":2007,"lang":"lv","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Scroll; Mathematics; Toroid; Combinatorics; Physics; Theology; Philosophy","score_opus":0.01626335641312451,"score_gpt":0.26011814077966683,"score_spread":0.24385478436654232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300944187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40799236,0.0008907153,0.5122195,0.0017201075,0.0004958636,0.00030413197,0.005529208,0.0018900471,0.068958096],"genre_scores_gemma":[0.7431572,0.00052856404,0.21203756,0.0004940313,0.00024083823,0.00032753905,0.009443548,0.0008786783,0.03289198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981571,0.00037333646,0.00015216156,0.00048512043,0.00048063145,0.0003516472],"domain_scores_gemma":[0.9891216,0.0058926623,0.0009844349,0.0015163556,0.0016454392,0.0008394577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014284613,0.0006898913,0.0009779964,0.0024511514,0.0017628496,0.0039280234,0.0026521133,0.001580055,0.0136256805],"category_scores_gemma":[0.013706879,0.00056862604,0.00091073924,0.0025570334,0.0019562822,0.0058366144,0.0020327382,0.0013792608,0.0018970149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010422979,0.00012254245,0.010730667,0.0011322765,0.00013960275,0.0005493396,0.0009096045,0.04745833,0.007340675,0.78243923,0.029655706,0.11847964],"study_design_scores_gemma":[0.00005015718,0.000089735186,0.002862907,0.00016039249,0.00010708518,0.00048308956,0.00054485386,0.13084951,0.008774375,0.84033704,0.01568772,0.000053096566],"about_ca_topic_score_codex":0.004335761,"about_ca_topic_score_gemma":0.0085364375,"teacher_disagreement_score":0.0136256805,"about_ca_system_score_codex":0.0023283958,"about_ca_system_score_gemma":0.0010546548,"threshold_uncertainty_score":0.045582473},"labels":[],"label_agreement":null},{"id":"W4301417336","doi":"10.1002/rsa.20118","title":"The satisfiability threshold for randomly generated binary constraint satisfaction problems","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Satisfiability; Homomorphism; Constraint (computer-aided design); Constraint satisfaction; Discrete mathematics; Binary number; Mathematics; Random graph; Computer science; Combinatorics; Statistics; Arithmetic; Graph","score_opus":0.013276901874903858,"score_gpt":0.2629478193031268,"score_spread":0.24967091742822292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301417336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7801865,0.00037186372,0.21042982,0.0020970933,0.00003320782,0.00014120775,0.00035973667,0.0008807425,0.005499842],"genre_scores_gemma":[0.9745841,0.00011395366,0.023762638,0.0001637442,0.000021557118,0.00009987141,0.00031433173,0.00008746534,0.0008523043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616516,0.0018095169,0.00020625767,0.0005964997,0.0008432315,0.00037934692],"domain_scores_gemma":[0.92012626,0.06683888,0.0053104474,0.004367932,0.0017227645,0.0016337926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060713296,0.00040281648,0.0010208183,0.0012112233,0.00062475604,0.002337738,0.0019441083,0.0016396645,0.0028064328],"category_scores_gemma":[0.055083465,0.00069513434,0.0009231177,0.0006755875,0.0024410007,0.004143061,0.0014636451,0.0026319707,0.00024568223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007110955,0.00047899695,0.007843064,0.00029302147,0.00020204563,0.00056621287,0.00067084376,0.60520995,0.023554528,0.34348366,0.0027120765,0.014274545],"study_design_scores_gemma":[0.00005404661,0.000098439385,0.0006824308,0.00001424693,0.000022570666,0.0001582944,0.000070425296,0.90415984,0.0041382206,0.09019337,0.00038715816,0.000021044376],"about_ca_topic_score_codex":0.0012978727,"about_ca_topic_score_gemma":0.00094602234,"teacher_disagreement_score":0.0060713296,"about_ca_system_score_codex":0.0026048485,"about_ca_system_score_gemma":0.0010130154,"threshold_uncertainty_score":0.032108665},"labels":[],"label_agreement":null},{"id":"W4301830469","doi":"10.48550/arxiv.1707.05252","title":"Spanning Euler tours and spanning Euler families in hypergraphs with\\n particular vertex cuts","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Euler's formula; Hypergraph; Vertex (graph theory); Mathematics; Traverse; Euler characteristic; Spanning tree; Discrete mathematics; Graph; Mathematical analysis","score_opus":0.06581837429658459,"score_gpt":0.22308820371650773,"score_spread":0.15726982941992312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301830469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68672585,0.0012203486,0.28977582,0.0009112343,0.000051369945,0.00010395657,0.0011367087,0.00034273506,0.019731846],"genre_scores_gemma":[0.8904947,0.0011031968,0.09891139,0.00018970619,0.00006769255,0.0001299953,0.0016194778,0.00011491205,0.007368834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994253,0.00016437209,0.000041096548,0.00018615375,0.00008409384,0.00009893737],"domain_scores_gemma":[0.99697554,0.0017113509,0.00049875013,0.0003089972,0.00015677862,0.00034849733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005293261,0.0003691002,0.00034188692,0.001039925,0.0010769464,0.0015170188,0.00052916945,0.0008904358,0.004242149],"category_scores_gemma":[0.0038553672,0.000512885,0.00053854764,0.001276801,0.0016970162,0.004430592,0.001163976,0.0011792656,0.0002910691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002750183,0.000076128774,0.0045804535,0.00025820854,0.000049267877,0.00071776664,0.00147008,0.07343785,0.007131569,0.86637056,0.004515456,0.04111761],"study_design_scores_gemma":[0.000036196234,0.000081401544,0.0030828803,0.00011006026,0.000038777933,0.0010458112,0.0009991203,0.15500909,0.0033086715,0.8209001,0.015340585,0.00004732382],"about_ca_topic_score_codex":0.001675589,"about_ca_topic_score_gemma":0.0019605602,"teacher_disagreement_score":0.004242149,"about_ca_system_score_codex":0.0011223246,"about_ca_system_score_gemma":0.00055732124,"threshold_uncertainty_score":0.014191389},"labels":[],"label_agreement":null},{"id":"W4306652466","doi":"10.37236/11179","title":"Digraphs with All Induced Directed Cycles of the Same Length are not $\\vec{\\chi}$-Bounded","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Royal Society Te Apārangi; Royal Society","keywords":"Combinatorics; Mathematics; Bounded function; Digraph; Chordal graph; Clique; Vertex (graph theory); Discrete mathematics; Treewidth; Graph; Pathwidth","score_opus":0.017181983305825422,"score_gpt":0.2577195889919505,"score_spread":0.2405376056861251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306652466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7074242,0.0007793087,0.23413526,0.0025846951,0.00012098116,0.00040027616,0.008306117,0.0007392666,0.04550989],"genre_scores_gemma":[0.8786737,0.0006041748,0.09909947,0.00047743318,0.0000608326,0.00032388666,0.008616555,0.00014177224,0.012002131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990146,0.00013484669,0.00007610197,0.00038183248,0.00019749819,0.00019511704],"domain_scores_gemma":[0.9949071,0.0027666248,0.00064929243,0.0008092301,0.0004830961,0.0003846371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048205737,0.0007137974,0.00077717716,0.0005364919,0.0012888311,0.0022870894,0.0019441443,0.00066429446,0.00700693],"category_scores_gemma":[0.003785605,0.00054725545,0.0009829866,0.0012344568,0.0011831953,0.0037605553,0.0014174896,0.0013430293,0.00095929217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023339621,0.00070065353,0.021462584,0.0022971595,0.000465185,0.0020113296,0.0020294278,0.08623396,0.09426894,0.61994755,0.016833523,0.1514157],"study_design_scores_gemma":[0.00036635605,0.00031168235,0.010010103,0.00018162334,0.0002747103,0.0033904167,0.0011820074,0.1286343,0.04589847,0.7622672,0.04735184,0.00013127993],"about_ca_topic_score_codex":0.0027238852,"about_ca_topic_score_gemma":0.0046419185,"teacher_disagreement_score":0.00700693,"about_ca_system_score_codex":0.0016182739,"about_ca_system_score_gemma":0.0011543432,"threshold_uncertainty_score":0.02344054},"labels":[],"label_agreement":null},{"id":"W4306976709","doi":"10.37236/11070","title":"On the Hamiltonian Property Hierarchy of 3-Connected Planar Graphs","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Hamiltonian path; Discrete mathematics; Outerplanar graph; Prism; Graph; Line graph; Pathwidth; Physics; Optics","score_opus":0.012745447788768032,"score_gpt":0.2377635597652711,"score_spread":0.22501811197650307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306976709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.712526,0.005497497,0.12671535,0.004352021,0.00011089021,0.000111520356,0.0013503177,0.00058303244,0.14875332],"genre_scores_gemma":[0.97008353,0.0020160193,0.02067791,0.00076102605,0.00012427331,0.000059352285,0.0007143766,0.000079152036,0.005484203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926466,0.00014188846,0.00003264297,0.00016568552,0.00021851622,0.00017661572],"domain_scores_gemma":[0.9973145,0.0016938368,0.00034190752,0.00020283874,0.00021137019,0.00023543488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005378372,0.00037125306,0.00053538516,0.0020463257,0.0018639652,0.0018747575,0.00085030723,0.0008355364,0.0062511214],"category_scores_gemma":[0.002672434,0.00057949463,0.0006656846,0.0023648525,0.0028877708,0.0039548306,0.0020264527,0.001760256,0.0005933543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007455105,0.00005075815,0.0025117777,0.00022892472,0.00002753059,0.00061017193,0.0015628672,0.0054567633,0.0040393937,0.95933276,0.004073984,0.02203056],"study_design_scores_gemma":[0.000029011448,0.000047089507,0.0028423846,0.000065328066,0.000030594336,0.00069056614,0.0004839057,0.014589111,0.001066604,0.96885496,0.011273682,0.000026718493],"about_ca_topic_score_codex":0.0036506304,"about_ca_topic_score_gemma":0.0029748403,"teacher_disagreement_score":0.0062511214,"about_ca_system_score_codex":0.0018959922,"about_ca_system_score_gemma":0.0004550638,"threshold_uncertainty_score":0.02091211},"labels":[],"label_agreement":null},{"id":"W4307260506","doi":"10.46298/dmtcs.8877","title":"Improved product structure for graphs on surfaces","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Banff International Research Station for Mathematical Innovation and Discovery; Australian Government","keywords":"Treewidth; Combinatorics; Mathematics; Planar graph; 1-planar graph; Graph; Pathwidth; Partial k-tree; Graph minor; Outerplanar graph; Discrete mathematics; Chordal graph; Line graph; Graph power","score_opus":0.016088019632851162,"score_gpt":0.29082658547601,"score_spread":0.2747385658431588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307260506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31951293,0.0030749484,0.48653963,0.002944818,0.00088013796,0.00018072636,0.0015385045,0.0018219256,0.18350634],"genre_scores_gemma":[0.799981,0.0017115083,0.14279222,0.0006238792,0.0006007723,0.00015279533,0.0024242885,0.0006803528,0.051033165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928916,0.00013506073,0.00003632054,0.00020888793,0.00022341221,0.0001071779],"domain_scores_gemma":[0.9988803,0.0002897426,0.0000848732,0.00030364012,0.0003053313,0.00013602074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000664905,0.0007207223,0.0007980216,0.001754025,0.0012418063,0.002624692,0.0012002084,0.0009466467,0.012900626],"category_scores_gemma":[0.0024463593,0.0005374262,0.0010347841,0.0017308145,0.0015886668,0.005080372,0.0027542058,0.001959317,0.0023484118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005471481,0.000022584845,0.0002678095,0.00005828901,0.0000083654595,0.000074578165,0.0002712223,0.0030783203,0.0014076458,0.97160184,0.0040415414,0.019113066],"study_design_scores_gemma":[0.00001897082,0.000057340654,0.00037868027,0.000025772895,0.000018850928,0.00012375994,0.000114416776,0.02209831,0.0011573475,0.9450398,0.03094635,0.000020365283],"about_ca_topic_score_codex":0.0023610597,"about_ca_topic_score_gemma":0.0022359628,"teacher_disagreement_score":0.012900626,"about_ca_system_score_codex":0.0014037036,"about_ca_system_score_gemma":0.0004952233,"threshold_uncertainty_score":0.043156862},"labels":[],"label_agreement":null},{"id":"W4307725203","doi":"10.1016/j.disc.2022.113220","title":"Obstructions for acyclic local tournament orientation completions","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Directed acyclic graph; Mathematics; Combinatorics; Orientation (vector space); Interval graph; Directed graph; Discrete mathematics; Graph; Class (philosophy); Pathwidth; Computer science; Line graph; Geometry; Artificial intelligence","score_opus":0.035658052615687615,"score_gpt":0.3263953272624663,"score_spread":0.2907372746467787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307725203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6947897,0.0006873958,0.12911604,0.0032057394,0.000572337,0.00016401788,0.00096543884,0.0010535431,0.1694458],"genre_scores_gemma":[0.9449309,0.0004059508,0.007943103,0.00037972964,0.00038070235,0.00012626218,0.0009832183,0.0003007489,0.044549316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984962,0.00022222364,0.0000647208,0.00027947273,0.00049082586,0.00044647156],"domain_scores_gemma":[0.99622285,0.0013469415,0.00040726335,0.00025419818,0.0002602226,0.0015085591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012280337,0.00087235513,0.0013860586,0.0026796116,0.0036268719,0.0052538672,0.0016014377,0.0014693835,0.020344576],"category_scores_gemma":[0.0041896678,0.00082825316,0.0013781597,0.0020461103,0.0034868508,0.005624046,0.0057217744,0.005423943,0.001769106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007440846,0.000081629485,0.00035683103,0.000041106166,0.000009460064,0.0001030602,0.00031601026,0.0010110063,0.000533215,0.9931292,0.0018841804,0.002459841],"study_design_scores_gemma":[0.00007924491,0.000026352907,0.0005396591,0.000012953819,0.000018392031,0.000113279064,0.00018916259,0.0048134746,0.00042155889,0.98966265,0.0040969173,0.000026449943],"about_ca_topic_score_codex":0.002773585,"about_ca_topic_score_gemma":0.0029101756,"teacher_disagreement_score":0.020344576,"about_ca_system_score_codex":0.0020302364,"about_ca_system_score_gemma":0.00089468725,"threshold_uncertainty_score":0.068059444},"labels":[],"label_agreement":null},{"id":"W4307930562","doi":"10.32920/21482265","title":"A Finer Reduction of Constraint Problems to Digraphs","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Grantová Agentura České Republiky; Grantová Agentura, Univerzita Karlova","keywords":"Digraph; Nondeterministic algorithm; Constraint satisfaction problem; Combinatorics; Mathematics; Conjecture; Constraint (computer-aided design); Discrete mathematics; Complexity of constraint satisfaction; Reduction (mathematics); Algebraic number; Local consistency","score_opus":0.03845277788491487,"score_gpt":0.31617200238418675,"score_spread":0.2777192244992719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307930562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07156133,0.0008866023,0.8320409,0.005170369,0.00032710587,0.00023877148,0.0012826812,0.0007909126,0.08770142],"genre_scores_gemma":[0.6305249,0.0011598081,0.31810462,0.0020179967,0.00064357393,0.0003728119,0.0023111582,0.000505648,0.044359565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979956,0.00055411865,0.00011947699,0.0006631733,0.0004510262,0.0002166523],"domain_scores_gemma":[0.99724066,0.0015600023,0.00015105015,0.00064763357,0.0002173233,0.00018322826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009788801,0.00052625785,0.00071189593,0.0010626612,0.0012463197,0.003844072,0.00143553,0.0010448198,0.015176543],"category_scores_gemma":[0.004661982,0.00051693036,0.001798541,0.0019429936,0.0023006431,0.006143933,0.0040909946,0.005357136,0.0011222012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016424696,0.000041848798,0.00011839887,0.000059546503,0.00001022774,0.000067665314,0.00015101508,0.004726534,0.00071002555,0.98054343,0.0020405913,0.011514233],"study_design_scores_gemma":[0.000020577554,0.000011992941,0.0001288871,0.000013607264,0.000007932031,0.000061558974,0.000055210792,0.018350264,0.0004799599,0.9693606,0.0115010375,0.000008403532],"about_ca_topic_score_codex":0.0033363868,"about_ca_topic_score_gemma":0.0037947495,"teacher_disagreement_score":0.015176543,"about_ca_system_score_codex":0.0019694488,"about_ca_system_score_gemma":0.001129579,"threshold_uncertainty_score":0.05077058},"labels":[],"label_agreement":null},{"id":"W4307930563","doi":"10.32920/21482265.v1","title":"A Finer Reduction of Constraint Problems to Digraphs","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Grantová Agentura České Republiky; Grantová Agentura, Univerzita Karlova","keywords":"Digraph; Nondeterministic algorithm; Constraint satisfaction problem; Combinatorics; Mathematics; Conjecture; Constraint (computer-aided design); Discrete mathematics; Complexity of constraint satisfaction; Reduction (mathematics); Algebraic number; Local consistency","score_opus":0.03845277788491487,"score_gpt":0.31617200238418675,"score_spread":0.2777192244992719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307930563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07156133,0.0008866023,0.8320409,0.005170369,0.00032710587,0.00023877148,0.0012826812,0.0007909126,0.08770142],"genre_scores_gemma":[0.6305249,0.0011598081,0.31810462,0.0020179967,0.00064357393,0.0003728119,0.0023111582,0.000505648,0.044359565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979956,0.00055411865,0.00011947699,0.0006631733,0.0004510262,0.0002166523],"domain_scores_gemma":[0.99724066,0.0015600023,0.00015105015,0.00064763357,0.0002173233,0.00018322826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009788801,0.00052625785,0.00071189593,0.0010626612,0.0012463197,0.003844072,0.00143553,0.0010448198,0.015176543],"category_scores_gemma":[0.004661982,0.00051693036,0.001798541,0.0019429936,0.0023006431,0.006143933,0.0040909946,0.005357136,0.0011222012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016424696,0.000041848798,0.00011839887,0.000059546503,0.00001022774,0.000067665314,0.00015101508,0.004726534,0.00071002555,0.98054343,0.0020405913,0.011514233],"study_design_scores_gemma":[0.000020577554,0.000011992941,0.0001288871,0.000013607264,0.000007932031,0.000061558974,0.000055210792,0.018350264,0.0004799599,0.9693606,0.0115010375,0.000008403532],"about_ca_topic_score_codex":0.0033363868,"about_ca_topic_score_gemma":0.0037947495,"teacher_disagreement_score":0.015176543,"about_ca_system_score_codex":0.0019694488,"about_ca_system_score_gemma":0.001129579,"threshold_uncertainty_score":0.05077058},"labels":[],"label_agreement":null},{"id":"W4309783453","doi":"10.1007/s00453-022-01062-3","title":"On the Tractability of Covering a Graph with 2-Clubs","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Università degli studi di Bergamo","keywords":"Algorithm; Parameterized complexity; Graph; Computer science; Club; Artificial intelligence; Combinatorics; Mathematics; Geology","score_opus":0.014201262110029454,"score_gpt":0.2454591080255627,"score_spread":0.23125784591553325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309783453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66485095,0.0010792654,0.27703026,0.010492722,0.00017377337,0.00040339914,0.005708015,0.0015201927,0.038741417],"genre_scores_gemma":[0.92577547,0.0007795234,0.059031043,0.001005714,0.00031672095,0.0004862837,0.004641448,0.0006100236,0.0073538315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957865,0.0014343056,0.00019934167,0.0010918862,0.00074989937,0.0007381655],"domain_scores_gemma":[0.96322346,0.030104188,0.0022420133,0.0022677353,0.00077172555,0.0013909804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002667732,0.0013281438,0.0021118503,0.001477917,0.0020039377,0.004965453,0.0033759002,0.002787929,0.013448397],"category_scores_gemma":[0.020839412,0.0011516953,0.0029229634,0.0029178567,0.0030201594,0.010307857,0.0036247203,0.0043237433,0.0010751488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016580225,0.0007101077,0.010300647,0.00139592,0.00041359267,0.00094319315,0.0010908018,0.58725923,0.008698808,0.32644784,0.026262445,0.034819447],"study_design_scores_gemma":[0.00014844297,0.00013542594,0.001467097,0.00007396601,0.000097282034,0.0003513134,0.00017224925,0.6184491,0.0023216545,0.37303954,0.0037021134,0.00004175486],"about_ca_topic_score_codex":0.0051671057,"about_ca_topic_score_gemma":0.005554709,"teacher_disagreement_score":0.013448397,"about_ca_system_score_codex":0.0039202827,"about_ca_system_score_gemma":0.0019492102,"threshold_uncertainty_score":0.044989347},"labels":[],"label_agreement":null},{"id":"W4310697302","doi":"10.48550/arxiv.2111.03639","title":"Randomized Communication and Implicit Graph Representations","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; University of Waterloo","keywords":"Combinatorics; Mathematics; Bipartite graph; Adjacency list; Constant (computer programming); Discrete mathematics; Oracle; Graph; Adjacency matrix; Computer science","score_opus":0.07825722120564545,"score_gpt":0.2509182619427501,"score_spread":0.17266104073710464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310697302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092340484,0.0007311403,0.87989193,0.005642005,0.00018918229,0.00026697203,0.00047082844,0.0008076763,0.019659782],"genre_scores_gemma":[0.76493686,0.0008670279,0.2191671,0.00085455674,0.0003900184,0.00076632143,0.0006907942,0.00050485966,0.011822493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894812,0.0041381237,0.0006097376,0.0024975436,0.0020986856,0.0011747739],"domain_scores_gemma":[0.93270046,0.044563603,0.004280549,0.015481353,0.0019217262,0.001052253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00586215,0.0009008693,0.0014147445,0.001065267,0.0020630085,0.004230589,0.0040965565,0.0030328454,0.009489693],"category_scores_gemma":[0.047072805,0.0008303706,0.001536253,0.0022891206,0.0052851755,0.021162638,0.0058525046,0.0059796297,0.0010459676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116661795,0.00007715243,0.00030647454,0.000144089,0.000017459804,0.00004593277,0.0002515033,0.021692818,0.0012542362,0.9538838,0.0014840856,0.020725768],"study_design_scores_gemma":[0.00003849942,0.00005074136,0.00013756385,0.000033317865,0.000019682207,0.00008448506,0.00009620684,0.072167605,0.0017796512,0.92096037,0.00460537,0.000026368718],"about_ca_topic_score_codex":0.001045015,"about_ca_topic_score_gemma":0.00089218956,"teacher_disagreement_score":0.009489693,"about_ca_system_score_codex":0.0040937443,"about_ca_system_score_gemma":0.0021469237,"threshold_uncertainty_score":0.03174615},"labels":[],"label_agreement":null},{"id":"W4311250857","doi":"10.48550/arxiv.2212.04659","title":"A refinement on the structure of vertex-critical ($P_5$, gem)-free graphs","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Combinatorics; Induced subgraph; Mathematics; Discrete mathematics; Chordal graph; Computer science; Graph","score_opus":0.0711221325704998,"score_gpt":0.22897521253619568,"score_spread":0.15785307996569586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311250857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30516475,0.0006243591,0.6279499,0.003090728,0.00031763047,0.0003358062,0.0017191587,0.002208966,0.05858867],"genre_scores_gemma":[0.8116096,0.00045315406,0.17094383,0.0010698288,0.00016043728,0.0001434221,0.0019505675,0.0004809464,0.013188228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885917,0.00014703182,0.000054589913,0.0004011458,0.00032430785,0.00021379256],"domain_scores_gemma":[0.9928678,0.0037141147,0.00038493727,0.0014100686,0.0011555131,0.00046752224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011525403,0.0005756181,0.0005535049,0.0013498411,0.0018161952,0.0019047953,0.0014472854,0.00069281395,0.007856298],"category_scores_gemma":[0.007632474,0.00067500287,0.0011518296,0.00086271664,0.0029833694,0.0049677435,0.003072186,0.00412953,0.0010265074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041517036,0.00014603262,0.006359492,0.000577833,0.00003918427,0.0009283566,0.0017085559,0.016680067,0.03289285,0.8688605,0.012630877,0.058761105],"study_design_scores_gemma":[0.00010824969,0.00018204033,0.0041167433,0.0001453025,0.00009473517,0.0010349398,0.0005748802,0.053573895,0.03902579,0.8524123,0.048643425,0.0000876728],"about_ca_topic_score_codex":0.0034879013,"about_ca_topic_score_gemma":0.0040226365,"teacher_disagreement_score":0.007856298,"about_ca_system_score_codex":0.0013347473,"about_ca_system_score_gemma":0.0015911948,"threshold_uncertainty_score":0.026281953},"labels":[],"label_agreement":null},{"id":"W4312107465","doi":"10.48550/arxiv.2212.10757","title":"Circular flows in mono-directed signed graphs","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; European Commission; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Young Elite Scientists Sponsorship Program by Tianjin; Agence Nationale de la Recherche","keywords":"Combinatorics; Signed graph; Mathematics; Vertex (graph theory); Sigma; Graph; Discrete mathematics; Physics","score_opus":0.06446944014509982,"score_gpt":0.21298352238818033,"score_spread":0.1485140822430805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312107465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14512004,0.0046359594,0.7870023,0.00088327244,0.0008070892,0.00024751903,0.0007120262,0.0006824053,0.05990944],"genre_scores_gemma":[0.72557056,0.0041155475,0.24907617,0.0009282882,0.00062295643,0.00037098024,0.001127053,0.0002295018,0.017959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992938,0.00014161547,0.000056223023,0.00020686127,0.00019982814,0.00010164852],"domain_scores_gemma":[0.99880385,0.00041275556,0.00024415064,0.00016168303,0.00021040035,0.0001671455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006671695,0.00060964824,0.0003499393,0.002016882,0.0010535838,0.0016310154,0.00077458017,0.0007975526,0.0046735704],"category_scores_gemma":[0.0024724538,0.0003099139,0.0005227213,0.0019498634,0.0017028018,0.0038321759,0.0016365133,0.0011956568,0.00077344757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073154544,0.00003358336,0.00065235025,0.00016372431,0.000009776038,0.00016786157,0.00035100788,0.007172795,0.003137014,0.9397712,0.0018960828,0.046571493],"study_design_scores_gemma":[0.000019214463,0.00006915213,0.0007376346,0.00012014321,0.000030443232,0.0005253013,0.0003295018,0.05361052,0.0036947527,0.89071965,0.05008089,0.00006290646],"about_ca_topic_score_codex":0.0012496117,"about_ca_topic_score_gemma":0.0010752103,"teacher_disagreement_score":0.0046735704,"about_ca_system_score_codex":0.0011857055,"about_ca_system_score_gemma":0.0005695967,"threshold_uncertainty_score":0.015634656},"labels":[],"label_agreement":null},{"id":"W4312619734","doi":"10.1007/978-3-031-20624-5_32","title":"On the Zombie Number of Various Graph Classes","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Ottawa; Carleton University","funders":"","keywords":"Zombie; Combinatorics; Vertex (graph theory); Graph; Computer science; Upper and lower bounds; Time complexity; Mathematics; Computer security","score_opus":0.021685132845375713,"score_gpt":0.286610425871994,"score_spread":0.26492529302661827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312619734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5198414,0.011290417,0.09718852,0.009591624,0.0004965756,0.00017469695,0.0013487715,0.00089740084,0.35917056],"genre_scores_gemma":[0.9265299,0.0038917933,0.037708674,0.0007818024,0.0005537743,0.00036102507,0.0006658962,0.00049079844,0.029016398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990095,0.0002526297,0.00004112143,0.00025562543,0.00024254601,0.00019860796],"domain_scores_gemma":[0.9918704,0.0059546307,0.0005385106,0.00064716995,0.00037994832,0.0006094605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020055969,0.0006644628,0.0015353425,0.008869033,0.0046937144,0.0050670467,0.0025656011,0.0017410931,0.014100025],"category_scores_gemma":[0.013097428,0.0013056545,0.0009922046,0.0047283066,0.0056848447,0.010566744,0.003562866,0.005649929,0.00094965904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104435974,0.000015020855,0.00059290195,0.000095261305,0.000012458416,0.000023859158,0.00034205228,0.0013079701,0.00043385805,0.9839601,0.0033441046,0.009768005],"study_design_scores_gemma":[0.000028751614,0.0000132428995,0.0012685431,0.00008898281,0.000032786058,0.000106493295,0.00021752888,0.0067630284,0.0004493385,0.9843454,0.006665048,0.000020757097],"about_ca_topic_score_codex":0.003661739,"about_ca_topic_score_gemma":0.0050743166,"teacher_disagreement_score":0.014100025,"about_ca_system_score_codex":0.0027136959,"about_ca_system_score_gemma":0.000666251,"threshold_uncertainty_score":0.047169268},"labels":[],"label_agreement":null},{"id":"W4312849998","doi":"10.1007/978-3-031-20624-5_31","title":"Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"","keywords":"Homomorphism; Combinatorics; Conjecture; Mathematics; Discrete mathematics; Graph homomorphism; Bipartite graph; Graph; Line graph","score_opus":0.016646946668137996,"score_gpt":0.2586985705551679,"score_spread":0.2420516238870299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312849998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38706195,0.0044489284,0.2315218,0.008661102,0.0011961203,0.00012443509,0.0014786371,0.0011187085,0.36438823],"genre_scores_gemma":[0.8937876,0.0018511681,0.038462654,0.0012917464,0.0007854,0.00017869195,0.0010833476,0.0003911099,0.06216831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991586,0.0002051245,0.000049677397,0.0001611231,0.00024746227,0.0001780121],"domain_scores_gemma":[0.9977531,0.0014672559,0.00016225474,0.00022585459,0.00019620733,0.00019528663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010521525,0.00054489396,0.00073426944,0.0019134706,0.002501247,0.0050808345,0.0012090402,0.0012092614,0.010831566],"category_scores_gemma":[0.003874255,0.00058632484,0.00091051875,0.0023378236,0.0032983425,0.010928887,0.0022114138,0.0042944592,0.0011228218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059754268,0.000028504324,0.000112961825,0.00003734597,0.0000036087606,0.00003102338,0.00022220975,0.00036103668,0.00043047758,0.98745406,0.0022347178,0.009024274],"study_design_scores_gemma":[0.000008320394,0.0000083526875,0.000084890184,0.000009813005,0.0000036189579,0.00003822504,0.00007675116,0.0013245796,0.0002825337,0.99607974,0.0020767625,0.0000064079236],"about_ca_topic_score_codex":0.00081685674,"about_ca_topic_score_gemma":0.0011126137,"teacher_disagreement_score":0.010831566,"about_ca_system_score_codex":0.0021815856,"about_ca_system_score_gemma":0.001000371,"threshold_uncertainty_score":0.036235213},"labels":[],"label_agreement":null},{"id":"W4313325064","doi":"10.1016/j.disc.2022.113289","title":"Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Induced subgraph; Mathematics; Distance-hereditary graph; Hamiltonian path; Pancyclic graph; Discrete mathematics; Factor-critical graph; Induced path; Cograph; Graph; Line graph; Vertex (graph theory); Pathwidth; Graph power","score_opus":0.019883120479224105,"score_gpt":0.2683981368726628,"score_spread":0.24851501639343868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313325064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9653607,0.00033562808,0.012229298,0.00029816866,0.00002679554,0.000039497667,0.00095148,0.00012124673,0.020637153],"genre_scores_gemma":[0.98916966,0.00019320546,0.0031124398,0.00007426689,0.000036755166,0.000049899434,0.0014577956,0.000036603426,0.0058692046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979454,0.000028723809,0.000008125181,0.00006209747,0.000049097336,0.000057428417],"domain_scores_gemma":[0.9993924,0.00020586298,0.0001570616,0.000057012006,0.000054564072,0.00013317549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014647821,0.00038475927,0.00055746414,0.0012542491,0.0010602075,0.0014795265,0.0009692129,0.00057898834,0.0061466354],"category_scores_gemma":[0.00066306005,0.0003985526,0.00035795773,0.0008921402,0.0006079794,0.0012076095,0.0006634257,0.0006516184,0.0003557902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088393764,0.0005253956,0.021225922,0.0006887367,0.00019790637,0.0020207136,0.0017572744,0.013795481,0.04574333,0.8533835,0.01262433,0.04715339],"study_design_scores_gemma":[0.00021222448,0.00009541745,0.03925474,0.00009480591,0.00016943587,0.0015704808,0.000816608,0.051085778,0.010641698,0.8807387,0.01527724,0.000042811094],"about_ca_topic_score_codex":0.0014220665,"about_ca_topic_score_gemma":0.0020845702,"teacher_disagreement_score":0.0061466354,"about_ca_system_score_codex":0.000616534,"about_ca_system_score_gemma":0.00035589637,"threshold_uncertainty_score":0.02056253},"labels":[],"label_agreement":null},{"id":"W4313331485","doi":"10.1287/moor.2022.1339","title":"Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Unimodular matrix; Mathematics; Bounded function; Polynomial; Integer (computer science); Upper and lower bounds; Combinatorics; Matrix (chemical analysis); Relaxation (psychology); Matrix polynomial; Constraint (computer-aided design); Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.08539722762037652,"score_gpt":0.38763204911546406,"score_spread":0.3022348214950875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313331485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38451704,0.0018184353,0.54796803,0.0052314103,0.00029022712,0.00024665415,0.0010964031,0.0014608005,0.05737099],"genre_scores_gemma":[0.8643413,0.0009860017,0.121729694,0.0007121464,0.00038626156,0.0002636113,0.00090508995,0.00055217714,0.010123731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709857,0.00062417856,0.0001201774,0.0006563914,0.0007585398,0.0007421259],"domain_scores_gemma":[0.96842426,0.025020793,0.0019457162,0.0020330735,0.0011390237,0.0014371747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029766962,0.0019572694,0.0012927417,0.0012279745,0.0012941234,0.0037963665,0.0027675866,0.0012716418,0.010804883],"category_scores_gemma":[0.02299248,0.00081574597,0.0012883235,0.0016230907,0.0029424503,0.008357493,0.0034892939,0.0060053715,0.0015970492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001210315,0.0006041049,0.0064220284,0.00085336785,0.00017412347,0.0005003852,0.00069208146,0.27642015,0.022234617,0.58151174,0.011453206,0.09792399],"study_design_scores_gemma":[0.00006760503,0.00018343546,0.0008670933,0.0000619733,0.000068953945,0.0001481763,0.000102598904,0.59467316,0.00627509,0.39397156,0.003537818,0.000042606418],"about_ca_topic_score_codex":0.0012572356,"about_ca_topic_score_gemma":0.0023849178,"teacher_disagreement_score":0.010804883,"about_ca_system_score_codex":0.003096854,"about_ca_system_score_gemma":0.0017318923,"threshold_uncertainty_score":0.036145985},"labels":[],"label_agreement":null},{"id":"W4313349528","doi":"10.1007/978-3-031-20796-9_14","title":"Bounds for the Oriented Diameter of Planar Triangulations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Planar graph; Treewidth; Outerplanar graph; Pathwidth; Mathematics; Bounded function; Planar; 1-planar graph; Discrete mathematics; Upper and lower bounds; Graph; Book embedding; Chordal graph; Computer science; Line graph","score_opus":0.030204133745168296,"score_gpt":0.2973592118436405,"score_spread":0.2671550780984722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313349528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07209388,0.040957965,0.5251452,0.007829445,0.0026168895,0.00017057463,0.002725573,0.0020630104,0.34639752],"genre_scores_gemma":[0.5821423,0.050296307,0.25974247,0.0035169479,0.009975077,0.0013076863,0.0048670312,0.0042070523,0.08394511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997926,0.00034209728,0.00011353777,0.0005031591,0.00077912264,0.00033612386],"domain_scores_gemma":[0.9802208,0.015230761,0.0007945665,0.0012900895,0.0013256017,0.0011381982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025598663,0.0031538922,0.0021751784,0.00593437,0.0018673178,0.006037965,0.005261067,0.0018627279,0.01712237],"category_scores_gemma":[0.019210633,0.0015900484,0.0017676237,0.005267047,0.0036164154,0.011476298,0.006002557,0.007778667,0.0051151607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003433193,0.00013011458,0.0020258804,0.001081026,0.00014349494,0.00021978866,0.00066226773,0.026506925,0.008054124,0.829752,0.037598617,0.09348251],"study_design_scores_gemma":[0.000046302932,0.00009932502,0.0025109446,0.0003787136,0.00020236986,0.00045699926,0.00024973953,0.056096233,0.0029728422,0.89665717,0.04025847,0.00007101236],"about_ca_topic_score_codex":0.0015644424,"about_ca_topic_score_gemma":0.0019953838,"teacher_disagreement_score":0.01712237,"about_ca_system_score_codex":0.0035122512,"about_ca_system_score_gemma":0.00074472517,"threshold_uncertainty_score":0.057280004},"labels":[],"label_agreement":null},{"id":"W4313351153","doi":"10.1007/978-3-031-22105-7_25","title":"Semi-strict Chordal Digraphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Chordal graph; Digraph; Interval graph; Combinatorics; Computer science; Mathematics; Transitive relation; Discrete mathematics; Graph; 1-planar graph","score_opus":0.01945569434449878,"score_gpt":0.273544141588552,"score_spread":0.2540884472440532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313351153","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18141079,0.0016198333,0.21574321,0.0009004148,0.0009114696,0.00028423607,0.0025837682,0.0007913584,0.5957549],"genre_scores_gemma":[0.8064622,0.0016412333,0.060775936,0.00034963663,0.00021669242,0.00015648517,0.0021871638,0.00020973787,0.12800087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976605,0.000032820866,0.000020373574,0.00005793633,0.00007708348,0.000045688746],"domain_scores_gemma":[0.99900347,0.00030948903,0.0000629056,0.00017891824,0.00022847073,0.00021681651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019297401,0.00030388116,0.0004280956,0.0007871891,0.0012814545,0.0018765981,0.0007242047,0.0004601267,0.011462176],"category_scores_gemma":[0.0014108691,0.0003530944,0.00031639528,0.0010710591,0.00079179107,0.0020024334,0.0012763202,0.001302452,0.0024130072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006244721,0.0000255979,0.00026628384,0.0001691396,0.000008196746,0.0001885935,0.00035016338,0.0011723044,0.0032894413,0.9547107,0.0050774124,0.03467971],"study_design_scores_gemma":[0.000021973889,0.000045411525,0.00050345407,0.00004898011,0.0000138395,0.00049470493,0.00031730364,0.0047297725,0.0018178752,0.9331546,0.05883763,0.000014551885],"about_ca_topic_score_codex":0.00074076507,"about_ca_topic_score_gemma":0.0018488888,"teacher_disagreement_score":0.011462176,"about_ca_system_score_codex":0.00062987563,"about_ca_system_score_gemma":0.0004599469,"threshold_uncertainty_score":0.0383448},"labels":[],"label_agreement":null},{"id":"W4313450058","doi":"10.1016/j.ejc.2007.04.014","title":"An upper bound for the chromatic number of line graphs","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Upper and lower bounds; Computer science; Line (geometry); Combinatorics; Mathematics; Geometry","score_opus":0.02439923940933715,"score_gpt":0.3239694786796888,"score_spread":0.29957023927035165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313450058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18713944,0.013814768,0.5354586,0.011635665,0.0018017477,0.000322637,0.0044773575,0.005157271,0.24019247],"genre_scores_gemma":[0.74995464,0.0073947404,0.18385978,0.0025100694,0.0024069862,0.0007051977,0.0037276044,0.0017956749,0.047645353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968863,0.0005361439,0.000105543295,0.00085011247,0.00086459,0.0007573694],"domain_scores_gemma":[0.9802182,0.0137991,0.00074831827,0.0025695679,0.0011971191,0.0014677079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023930226,0.0026831478,0.0020172093,0.005993534,0.0028125716,0.0068224785,0.0056093344,0.0031458775,0.023644846],"category_scores_gemma":[0.014181236,0.0013836313,0.0016421512,0.0048118597,0.0036362663,0.009788108,0.0046560424,0.0064890315,0.0046671047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017150607,0.0005804286,0.0051218565,0.001505958,0.0002838632,0.0005042057,0.0008530975,0.11207543,0.046333164,0.641627,0.062437087,0.12696281],"study_design_scores_gemma":[0.00014356003,0.00024771155,0.0045987405,0.00038378336,0.00032642667,0.0006760862,0.00024553938,0.28677282,0.015993953,0.6370895,0.053314414,0.0002074924],"about_ca_topic_score_codex":0.0028473458,"about_ca_topic_score_gemma":0.0054752617,"teacher_disagreement_score":0.023644846,"about_ca_system_score_codex":0.0052648215,"about_ca_system_score_gemma":0.0014938918,"threshold_uncertainty_score":0.079099834},"labels":[],"label_agreement":null},{"id":"W4313483988","doi":"10.48550/arxiv.2301.00434","title":"Cops and robbers pebbling in graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Merge (version control); Security token; Graph; Computer science; Combinatorics; Theoretical computer science; Discrete mathematics; Mathematics; Computer network; Parallel computing","score_opus":0.12628454702569075,"score_gpt":0.22976733723899354,"score_spread":0.10348279021330278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313483988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2990955,0.0057906224,0.60602504,0.004237558,0.00032128315,0.00013161502,0.0004210861,0.0011021189,0.08287506],"genre_scores_gemma":[0.8769573,0.0028205945,0.09626226,0.00072990084,0.00039831473,0.00017237845,0.0004873083,0.000472547,0.021699373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986284,0.0002939972,0.000053208485,0.000430315,0.00029907105,0.00029502073],"domain_scores_gemma":[0.9917528,0.0056017353,0.0006468628,0.00099078,0.00040077823,0.00060712046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093064987,0.000986005,0.0011909402,0.0016379872,0.002221192,0.0027339307,0.0017892477,0.0016783327,0.009790162],"category_scores_gemma":[0.009550491,0.0007275112,0.00070439023,0.0019446329,0.004866988,0.010889515,0.0029777226,0.003433893,0.0012956194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011826743,0.000048670256,0.0011712738,0.00024673817,0.000022159446,0.00019628092,0.00054786797,0.03047473,0.0025534914,0.92671037,0.0057293787,0.03218072],"study_design_scores_gemma":[0.000015713256,0.00003915618,0.00052884594,0.00004677576,0.000020050085,0.0002892516,0.0002961014,0.050028045,0.0022157417,0.93193793,0.014557752,0.0000246302],"about_ca_topic_score_codex":0.0023171117,"about_ca_topic_score_gemma":0.0028316062,"teacher_disagreement_score":0.009790162,"about_ca_system_score_codex":0.0019829122,"about_ca_system_score_gemma":0.0008232418,"threshold_uncertainty_score":0.03275132},"labels":[],"label_agreement":null},{"id":"W4315472389","doi":"10.1109/cdc51059.2022.9992862","title":"Linear Stochastic Graphon Systems with Q-Space Noise","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Noise (video); Computer science; Space (punctuation); Linear system; Statistical physics; Mathematics; Physics; Mathematical analysis; Artificial intelligence","score_opus":0.022862459549763823,"score_gpt":0.2726310505189883,"score_spread":0.24976859096922446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315472389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088443235,0.0005679899,0.89918756,0.0011220318,0.00014815427,0.000046127254,0.00009354038,0.00024882256,0.010142462],"genre_scores_gemma":[0.9701011,0.00042716652,0.02049247,0.00020528499,0.00009212979,0.00009610665,0.000074160154,0.000043296564,0.008468253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991898,0.0003359595,0.000028924464,0.00013636478,0.0002054553,0.00010345336],"domain_scores_gemma":[0.9984433,0.00093623775,0.00022068413,0.00009239322,0.00020253897,0.000104830906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012224015,0.0006961915,0.0008157359,0.00050169695,0.0005947029,0.0015920799,0.0008924706,0.0014706195,0.0018383396],"category_scores_gemma":[0.0033431323,0.000347846,0.00065133715,0.000534408,0.0023210603,0.0016135888,0.001545144,0.0012484821,0.00024469433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046706726,0.00002381073,0.00044927592,0.000034075107,0.000026600055,0.00012526754,0.000118714204,0.62484306,0.0018467928,0.36897272,0.0005636623,0.0029493868],"study_design_scores_gemma":[0.000005969555,0.000011653428,0.00006936983,0.000002136735,0.000002157171,0.000010770786,0.000009054777,0.9632832,0.000118838565,0.036209084,0.0002711159,0.000006639721],"about_ca_topic_score_codex":0.008678792,"about_ca_topic_score_gemma":0.003555135,"teacher_disagreement_score":0.008678792,"about_ca_system_score_codex":0.0015567177,"about_ca_system_score_gemma":0.00090759515,"threshold_uncertainty_score":0.017256558},"labels":[],"label_agreement":null},{"id":"W4316652490","doi":"10.1137/1.9781611977554.ch52","title":"Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"Uniwersytet Warszawski","keywords":"Combinatorics; Euclidean geometry; Travelling salesman problem; Mathematics; Plane (geometry); Planar graph; Euclidean distance; Graph; Algorithm; Geometry","score_opus":0.12640079075434937,"score_gpt":0.31834753798452814,"score_spread":0.19194674723017877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316652490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069281496,0.0021028342,0.8918519,0.0017914927,0.0003089672,0.00028475528,0.00084636145,0.0027955272,0.030736713],"genre_scores_gemma":[0.31812006,0.0014633375,0.65479004,0.0007762815,0.0002333431,0.00044104952,0.0024277465,0.00098319,0.02076499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815065,0.00043568303,0.00010236067,0.00047587452,0.0004426785,0.00039275622],"domain_scores_gemma":[0.9963613,0.0020152081,0.00022570501,0.0009557758,0.0002073403,0.0002347077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018247935,0.001727522,0.0020200978,0.0009621177,0.0014808415,0.0031796198,0.004214291,0.0021478096,0.014199627],"category_scores_gemma":[0.007694318,0.00085407053,0.0020186824,0.0030359481,0.0012832346,0.008888708,0.0047252267,0.0048422515,0.0029043478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015384032,0.0006524638,0.0019206023,0.0014045429,0.00018670934,0.0003692747,0.000976151,0.3336433,0.007623984,0.31568632,0.040200055,0.29579818],"study_design_scores_gemma":[0.00018639423,0.00018496098,0.0005079074,0.000098715966,0.000085883294,0.00038428273,0.0002779293,0.6828466,0.0032608942,0.2930833,0.019051393,0.000031690204],"about_ca_topic_score_codex":0.0024869803,"about_ca_topic_score_gemma":0.003447403,"teacher_disagreement_score":0.014199627,"about_ca_system_score_codex":0.0033187193,"about_ca_system_score_gemma":0.0022812549,"threshold_uncertainty_score":0.047502458},"labels":[],"label_agreement":null},{"id":"W4317617507","doi":"10.26493/1855-3974.2853.b51","title":"Domination and independence number of large 2-crossing-critical graphs","year":2023,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Independence number; Mathematics; Combinatorics; Domination analysis; Independence (probability theory); Subfamily; Crossing number (knot theory); Upper and lower bounds; Discrete mathematics; Graph; Statistics; Geography; Vertex (graph theory)","score_opus":0.03054575374732277,"score_gpt":0.3541777078688711,"score_spread":0.3236319541215483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317617507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.867873,0.0025699355,0.07092644,0.0010685234,0.00007910291,0.000041425836,0.00089271786,0.00029281646,0.056256037],"genre_scores_gemma":[0.9893545,0.0009154195,0.0061854552,0.00010534425,0.00011480257,0.000044171782,0.00043855445,0.00005578881,0.0027860892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954885,0.000088804074,0.000012960983,0.00012156405,0.000118508186,0.00010920922],"domain_scores_gemma":[0.9919559,0.0058375075,0.00060754333,0.000317926,0.00036475674,0.000916278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007120123,0.00064925686,0.00043673886,0.0029358338,0.00095934194,0.0013625842,0.00090109464,0.000475725,0.003398327],"category_scores_gemma":[0.007173557,0.00039648748,0.0003968963,0.0011865365,0.0018633584,0.0015905767,0.0011338665,0.0016236842,0.0003064516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084104,0.00017900253,0.026970029,0.0005828659,0.00017846577,0.0011280362,0.0013597427,0.065374136,0.041207556,0.7996013,0.013572281,0.049005456],"study_design_scores_gemma":[0.000055738077,0.00007456915,0.019102322,0.000108673514,0.00010011395,0.0012669291,0.0002679048,0.16212316,0.010309186,0.79730034,0.009212348,0.00007866703],"about_ca_topic_score_codex":0.0010926818,"about_ca_topic_score_gemma":0.0016952867,"teacher_disagreement_score":0.003398327,"about_ca_system_score_codex":0.0010289145,"about_ca_system_score_gemma":0.00037201174,"threshold_uncertainty_score":0.011368573},"labels":[],"label_agreement":null},{"id":"W4318620924","doi":"10.48550/arxiv.2301.11577","title":"Defective acyclic colorings of planar graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Graph; Integer (computer science); Planar; Edge coloring; Discrete mathematics; Graph power; Computer science; Line graph","score_opus":0.11543747030010088,"score_gpt":0.23038956970957775,"score_spread":0.11495209940947687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318620924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5109691,0.0018055601,0.4209137,0.0014020641,0.00029913036,0.00015959218,0.001524176,0.0013549742,0.06157167],"genre_scores_gemma":[0.89633125,0.0013642667,0.087584786,0.00045628668,0.00013899789,0.000104802115,0.0015240418,0.0002239184,0.012271612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921215,0.00015185666,0.000041147585,0.00015672988,0.0002120753,0.00022613288],"domain_scores_gemma":[0.9967803,0.0014275254,0.00056525256,0.000535381,0.00031462216,0.0003768394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005129199,0.0006086885,0.0003284834,0.001085115,0.0008106615,0.0010480159,0.0009029408,0.00048175783,0.004074913],"category_scores_gemma":[0.003168695,0.0005563659,0.0007311685,0.0011198337,0.0011004442,0.0016441544,0.0011411818,0.0013027182,0.0003162285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026222473,0.00010007571,0.006157371,0.00036701042,0.000056784003,0.00065157533,0.000602108,0.14302902,0.017083425,0.76462126,0.009200712,0.057868477],"study_design_scores_gemma":[0.00011442266,0.0001755742,0.00399639,0.00009786828,0.000086532185,0.0016497202,0.00059408846,0.29888365,0.014559025,0.61112386,0.068625115,0.00009380359],"about_ca_topic_score_codex":0.0067841588,"about_ca_topic_score_gemma":0.008406206,"teacher_disagreement_score":0.0067841588,"about_ca_system_score_codex":0.001888867,"about_ca_system_score_gemma":0.0007108905,"threshold_uncertainty_score":0.013704777},"labels":[],"label_agreement":null},{"id":"W4318953856","doi":"10.1016/j.disc.2023.113342","title":"The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Hypergraph; Bounded function; Matching (statistics); Vertex (graph theory); Time complexity; Discrete mathematics; Graph","score_opus":0.01991825721515068,"score_gpt":0.2848979128020826,"score_spread":0.26497965558693193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318953856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41323563,0.0015103254,0.54881555,0.0062182355,0.00025297145,0.0005498792,0.0028939664,0.0010435352,0.0254799],"genre_scores_gemma":[0.7850422,0.001215679,0.19210763,0.0007575066,0.00047027654,0.00048186982,0.002005594,0.00070116523,0.01721803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692315,0.0013488437,0.00014060369,0.0008136924,0.0003370489,0.0004366929],"domain_scores_gemma":[0.9770289,0.017782686,0.0016738743,0.0012227689,0.00078276504,0.0015088643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037844959,0.0016952383,0.0031647047,0.0018061264,0.0023902012,0.0059956815,0.006275889,0.0042884382,0.011369511],"category_scores_gemma":[0.018466396,0.002001318,0.002301807,0.0037893238,0.0032940062,0.011121137,0.0030299155,0.0032650367,0.0011176032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023611537,0.00091718556,0.003056944,0.0016228241,0.0004105085,0.0005592998,0.0010921928,0.48088545,0.010883215,0.41545585,0.01980539,0.062949955],"study_design_scores_gemma":[0.0002710146,0.000146271,0.00070154364,0.00006478529,0.00008782887,0.00015054313,0.00032010663,0.5405225,0.0028874583,0.45312303,0.0016720325,0.00005284808],"about_ca_topic_score_codex":0.0056832065,"about_ca_topic_score_gemma":0.0054694326,"teacher_disagreement_score":0.011369511,"about_ca_system_score_codex":0.0035183944,"about_ca_system_score_gemma":0.0030870026,"threshold_uncertainty_score":0.038034737},"labels":[],"label_agreement":null},{"id":"W4319722891","doi":"10.37236/11461","title":"Cooperative Colorings of Forests","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Star (game theory); Graph; Greedy coloring; Discrete mathematics; Line graph","score_opus":0.015500626155127003,"score_gpt":0.2886190215033137,"score_spread":0.2731183953481867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319722891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70189655,0.0007491162,0.26978475,0.00090300833,0.00010076663,0.00010560031,0.00057220476,0.00087071717,0.025017297],"genre_scores_gemma":[0.9495176,0.00027850704,0.04369762,0.0002808119,0.00007653095,0.00012383521,0.0005126646,0.00009645879,0.0054160003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880433,0.00024451004,0.00003592058,0.00039573808,0.00019176262,0.0003276865],"domain_scores_gemma":[0.99183625,0.003518016,0.00060278067,0.002442353,0.00066867867,0.0009319255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013287327,0.00047031353,0.000628701,0.00079266826,0.0019048795,0.0015158585,0.0015423226,0.00080046715,0.003177491],"category_scores_gemma":[0.0070852893,0.0007546638,0.00092493446,0.00089794444,0.0016654712,0.0029319227,0.0019724765,0.0012659343,0.00054136233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000872321,0.00028770798,0.017392483,0.00029642807,0.00014878335,0.0007792828,0.0015946756,0.15915148,0.036108885,0.69068336,0.018975414,0.073709175],"study_design_scores_gemma":[0.00015452996,0.0001787415,0.003909923,0.000048348906,0.00009876834,0.0011113267,0.0005021973,0.4861718,0.009677986,0.4786435,0.019451126,0.00005165902],"about_ca_topic_score_codex":0.0047833915,"about_ca_topic_score_gemma":0.0066526015,"teacher_disagreement_score":0.0047833915,"about_ca_system_score_codex":0.0015728776,"about_ca_system_score_gemma":0.001180639,"threshold_uncertainty_score":0.011412084},"labels":[],"label_agreement":null},{"id":"W4321277043","doi":"10.1007/s00453-025-01356-2","title":"Maximum Independent Set when Excluding an Induced Minor: $$K_1 + tK_2$$ and $$tC_3 \\uplus C_4$$","year":2025,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Disjoint sets; Discrete mathematics; Time complexity; Graph; Planar graph","score_opus":0.06205807901296858,"score_gpt":0.3396687315471117,"score_spread":0.27761065253414313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321277043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.564531,0.000435195,0.299902,0.0040213163,0.0009542518,0.0005748399,0.0039205593,0.0018902675,0.12377042],"genre_scores_gemma":[0.86959976,0.00019251592,0.08587385,0.00069509214,0.00039854826,0.00037584675,0.004684928,0.0009606809,0.03721868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978003,0.00044092358,0.00009538652,0.0005890345,0.0004435405,0.0006308131],"domain_scores_gemma":[0.98946416,0.0057188533,0.0008193535,0.0016565355,0.0008179396,0.0015232431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001675956,0.0011426596,0.0015244975,0.0018389795,0.0038219846,0.004274525,0.0028309748,0.0026375982,0.013787718],"category_scores_gemma":[0.012903493,0.0008963357,0.0020401077,0.0016019609,0.002432729,0.004228619,0.0028193572,0.003503993,0.0020603696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040234425,0.0008997322,0.008962146,0.0007423715,0.00027532695,0.0027789236,0.0015883346,0.05371606,0.025301084,0.7717953,0.06285116,0.06706611],"study_design_scores_gemma":[0.00023635972,0.00019413757,0.0037812977,0.00009120321,0.00017563875,0.0019193869,0.0005910619,0.18444991,0.015643878,0.7797597,0.013067453,0.000089820154],"about_ca_topic_score_codex":0.002333136,"about_ca_topic_score_gemma":0.004017726,"teacher_disagreement_score":0.013787718,"about_ca_system_score_codex":0.0011574996,"about_ca_system_score_gemma":0.0020600841,"threshold_uncertainty_score":0.046124518},"labels":[],"label_agreement":null},{"id":"W4321377127","doi":"10.1007/s00454-022-00478-6","title":"Three-Dimensional Graph Products with Unbounded Stack-Number","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bounded function; Combinatorics; Mathematics; Upper and lower bounds; Cartesian product; Discrete mathematics; Graph; Vertex (graph theory); Degree (music)","score_opus":0.023090070453325007,"score_gpt":0.29694691226906667,"score_spread":0.27385684181574166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321377127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51927304,0.0006459249,0.30541852,0.0021222231,0.0006937989,0.000096355805,0.00078489986,0.0015617966,0.16940346],"genre_scores_gemma":[0.921627,0.00039243713,0.047277458,0.0003868258,0.00018102076,0.00009319696,0.0004188278,0.00057298364,0.029050294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933904,0.00011831439,0.00004339839,0.00012693644,0.0002170435,0.00015530776],"domain_scores_gemma":[0.9986494,0.00037821507,0.00019313642,0.00020857292,0.00019062817,0.00038014082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063825183,0.001073518,0.0007775338,0.002009968,0.0020926492,0.0040963134,0.0015768869,0.0016197915,0.011987703],"category_scores_gemma":[0.0023451452,0.0007076322,0.0009599221,0.0013092795,0.0033981944,0.0057001747,0.003818085,0.0023911304,0.002456699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037623464,0.000017150744,0.00013445549,0.000020669959,0.0000056457993,0.00009432055,0.00013088546,0.0012210067,0.0009392417,0.9939235,0.0008703963,0.0026050902],"study_design_scores_gemma":[0.000011244081,0.0000125676515,0.00012977126,0.000010849273,0.000007280573,0.00014862875,0.000080063204,0.0068631545,0.0011066634,0.9886545,0.0029575047,0.000017636075],"about_ca_topic_score_codex":0.0012488145,"about_ca_topic_score_gemma":0.001582391,"teacher_disagreement_score":0.011987703,"about_ca_system_score_codex":0.0011966309,"about_ca_system_score_gemma":0.0008036945,"threshold_uncertainty_score":0.0401029},"labels":[],"label_agreement":null},{"id":"W43227363","doi":"","title":"Average distance in k-connected tournaments.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01215013825521703,"score_gpt":0.2710863167351376,"score_spread":0.25893617847992056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43227363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.734965,0.0033572346,0.19748814,0.00347296,0.00040953347,0.000097206146,0.0024274054,0.00089498895,0.05688752],"genre_scores_gemma":[0.96729594,0.0009541019,0.019711677,0.00029921604,0.00033527424,0.00010226437,0.0010070177,0.00017098057,0.010123522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979673,0.000474279,0.00012003985,0.0006003521,0.00045932323,0.00037871787],"domain_scores_gemma":[0.98606586,0.008875857,0.0015429811,0.0009675308,0.0008073402,0.001740506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015173755,0.0007166055,0.001857983,0.0026383684,0.0021732883,0.005371954,0.003187843,0.0019584526,0.010778454],"category_scores_gemma":[0.017416012,0.00060274004,0.0008360756,0.0036451553,0.0019821771,0.006286991,0.002472764,0.002264267,0.001345112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081080676,0.00019533969,0.006667216,0.0004912235,0.00022485947,0.00030401847,0.00071872113,0.06022927,0.003273651,0.8517532,0.016325753,0.059005976],"study_design_scores_gemma":[0.00009490559,0.0000943281,0.002271532,0.00005160685,0.000072812596,0.0004437291,0.00019039722,0.10145399,0.0010423086,0.8896277,0.004616802,0.000039955048],"about_ca_topic_score_codex":0.0018075919,"about_ca_topic_score_gemma":0.0025300677,"teacher_disagreement_score":0.010778454,"about_ca_system_score_codex":0.0024648705,"about_ca_system_score_gemma":0.0007860411,"threshold_uncertainty_score":0.03605753},"labels":[],"label_agreement":null},{"id":"W4323317406","doi":"10.1007/s00453-023-01106-2","title":"Path Cover Problems with Length Cost","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Science and Technology Corporation; Japan Society for the Promotion of Science London","keywords":"Combinatorics; Mathematics; Disjoint sets; Hamiltonian path; Cover (algebra); Path (computing); Vertex (graph theory); Discrete mathematics; Graph; Computer science","score_opus":0.022347467224206333,"score_gpt":0.2734891129624179,"score_spread":0.25114164573821157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323317406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48623624,0.004415205,0.3986145,0.014550295,0.0007381146,0.000643215,0.005885888,0.0015632802,0.08735324],"genre_scores_gemma":[0.7577903,0.0030575374,0.16632035,0.0012278989,0.0013795575,0.0007900373,0.0047975024,0.0011216634,0.063515216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832207,0.00041669447,0.000075977005,0.00033651778,0.00051929726,0.0003294671],"domain_scores_gemma":[0.9867287,0.010655144,0.00075674546,0.0007175947,0.00045931598,0.00068247697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012055781,0.0013415011,0.0017361003,0.0018522957,0.0017142148,0.0034084402,0.0032710556,0.0038823793,0.025280207],"category_scores_gemma":[0.013677522,0.0011798015,0.0016564502,0.0045861313,0.0018278656,0.010152278,0.003180498,0.0049346173,0.0015713255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015993108,0.00092769245,0.0040702573,0.0017842264,0.0003408932,0.0009284873,0.0007060578,0.2829299,0.006463125,0.5265246,0.053994965,0.11973055],"study_design_scores_gemma":[0.00024245783,0.00018154454,0.0007213538,0.00007750518,0.00013889138,0.00040528257,0.00018172366,0.24304402,0.0019716287,0.7440506,0.008949842,0.00003521463],"about_ca_topic_score_codex":0.0016214355,"about_ca_topic_score_gemma":0.0022243254,"teacher_disagreement_score":0.025280207,"about_ca_system_score_codex":0.0027483788,"about_ca_system_score_gemma":0.0014601259,"threshold_uncertainty_score":0.084570706},"labels":[],"label_agreement":null},{"id":"W4323557190","doi":"10.4230/lipics.itcs.2024.55","title":"Electrical Flows for Polylogarithmic Competitive Oblivious Routing","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Austrian Science Fund; European Commission","keywords":"Routing (electronic design automation); Routing algorithm; Regular polygon; Tree (set theory); Computer science; Combinatorics; Scheme (mathematics); Mathematics; Discrete mathematics; Computer network; Routing protocol; Geometry","score_opus":0.10157218864569131,"score_gpt":0.23884959101315972,"score_spread":0.1372774023674684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323557190","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04873154,0.0012510067,0.85311383,0.0044651115,0.00031253014,0.00031998154,0.0008001695,0.0024101576,0.08859572],"genre_scores_gemma":[0.56476766,0.0014637846,0.3926489,0.0019312701,0.0004280711,0.0009654177,0.0011037441,0.001169898,0.03552123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805474,0.00040765424,0.0000773718,0.00037153144,0.00072117517,0.00036759066],"domain_scores_gemma":[0.9951609,0.0027269665,0.00033855974,0.0012238842,0.00036836875,0.00018133155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015312093,0.0010392893,0.00064044516,0.0008741519,0.0016590514,0.0035078165,0.0020774554,0.0014848391,0.019133197],"category_scores_gemma":[0.008895676,0.0005273374,0.0008336317,0.001453797,0.0025017906,0.0059487224,0.0023501876,0.0031516817,0.0035516263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052527623,0.00016840617,0.00040926642,0.00030010566,0.000025249425,0.00009408115,0.00014656268,0.09491796,0.008805376,0.8202737,0.015390727,0.058943335],"study_design_scores_gemma":[0.000093308234,0.00006800636,0.00026558287,0.00004392865,0.0000275912,0.00016178141,0.000054961314,0.3229374,0.0071683894,0.64083236,0.02831182,0.000034786197],"about_ca_topic_score_codex":0.0030252594,"about_ca_topic_score_gemma":0.0042585703,"teacher_disagreement_score":0.019133197,"about_ca_system_score_codex":0.004878155,"about_ca_system_score_gemma":0.002387433,"threshold_uncertainty_score":0.064006984},"labels":[],"label_agreement":null},{"id":"W4324311863","doi":"10.48550/arxiv.2303.06299","title":"Reconfiguration of Minimum Independent Dominating Sets in Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Block graph; Pathwidth; Split graph; Chordal graph; Indifference graph; Symmetric graph; Graph; Maximal independent set; Vertex-transitive graph; Line graph; Graph power; Voltage graph","score_opus":0.11058991501462338,"score_gpt":0.24482338640016452,"score_spread":0.13423347138554115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324311863","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5815637,0.0011114959,0.3460441,0.0009068445,0.0002458735,0.00025924688,0.0013130804,0.0021761162,0.06637955],"genre_scores_gemma":[0.91181105,0.00055702036,0.07977536,0.00020744854,0.000068393485,0.00019670618,0.0013010963,0.0002188414,0.0058640973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937624,0.00011470957,0.000055117147,0.00019229116,0.000131536,0.0001300679],"domain_scores_gemma":[0.9982016,0.00063450326,0.00030278254,0.00041604918,0.0001657843,0.0002792326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003554071,0.0005109276,0.000655751,0.0008529433,0.00085062615,0.0015075403,0.000980216,0.0005734895,0.0033635406],"category_scores_gemma":[0.0034021032,0.0006743177,0.0006054297,0.0011136215,0.00093756337,0.0022554188,0.0014987362,0.0008765858,0.0005490397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093300233,0.00026411554,0.0062258258,0.00079080585,0.00014274486,0.0012339214,0.0015571995,0.32917848,0.101811185,0.39605117,0.011456327,0.15035516],"study_design_scores_gemma":[0.00014625971,0.00033096332,0.0041935532,0.00010240316,0.00009383797,0.0012651888,0.0007663962,0.46723977,0.041191626,0.4468362,0.037754547,0.00007931447],"about_ca_topic_score_codex":0.0011507932,"about_ca_topic_score_gemma":0.0013369782,"teacher_disagreement_score":0.0033635406,"about_ca_system_score_codex":0.0014515028,"about_ca_system_score_gemma":0.00051456434,"threshold_uncertainty_score":0.011252224},"labels":[],"label_agreement":null},{"id":"W4327630093","doi":"10.1016/j.disc.2023.113405","title":"2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Providence Health Care","keywords":"Combinatorics; Mathematics; Complete coloring; Edge coloring; Injective function; List coloring; Square (algebra); Fractional coloring; Planar graph; Discrete mathematics; Degree (music); Greedy coloring; Graph; Graph power; Geometry; Physics; Line graph","score_opus":0.036004568719994384,"score_gpt":0.2867906976001002,"score_spread":0.25078612888010576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327630093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87561035,0.0003545227,0.07911215,0.0010613694,0.000095253476,0.00004435075,0.0007309208,0.00055962254,0.042431485],"genre_scores_gemma":[0.9630253,0.0002481211,0.023376793,0.00021469488,0.00005786717,0.00003142423,0.0007461764,0.00012382008,0.0121757295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995086,0.000078816396,0.000021339089,0.00011511207,0.00012488209,0.00015124501],"domain_scores_gemma":[0.9975128,0.0011726242,0.00038901198,0.0002874213,0.00028843732,0.00034971384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031667048,0.00061105634,0.0005253472,0.0008776405,0.00138161,0.0024312956,0.0016975276,0.000835173,0.0056640343],"category_scores_gemma":[0.0025178744,0.0005934324,0.00049754605,0.0011868146,0.0012695913,0.0026980632,0.0016369357,0.0013074484,0.000767747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010727661,0.0003817167,0.0086853225,0.00054735417,0.00008148366,0.0009924597,0.0016572607,0.0509038,0.02594665,0.84495205,0.01095964,0.053819466],"study_design_scores_gemma":[0.00014125006,0.00018874397,0.00485876,0.000048177266,0.000095704905,0.00094182015,0.0010648196,0.092135295,0.015045679,0.87688196,0.008521951,0.000075704476],"about_ca_topic_score_codex":0.0028273773,"about_ca_topic_score_gemma":0.004521142,"teacher_disagreement_score":0.0056640343,"about_ca_system_score_codex":0.0011490312,"about_ca_system_score_gemma":0.00094956945,"threshold_uncertainty_score":0.018948019},"labels":[],"label_agreement":null},{"id":"W4327905048","doi":"10.1016/j.dam.2023.03.019","title":"Separable and equatable hypergraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Technion-Israel Institute of Technology; Israel Science Foundation; University of Toronto","keywords":"Matroid; Hypergraph; Separable space; Mathematics; Combinatorics; Class (philosophy); Discrete mathematics; Monotone polygon; Function (biology); Binary number; Multipartite; Computer science; Arithmetic","score_opus":0.025312144205700066,"score_gpt":0.29147204455506776,"score_spread":0.2661599003493677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327905048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39158145,0.0015091496,0.352492,0.004230765,0.0004022891,0.0000973865,0.0011997357,0.0004558778,0.24803138],"genre_scores_gemma":[0.82399654,0.0017214215,0.053332448,0.0009942835,0.0005887452,0.00014048019,0.0014355705,0.0005163521,0.11727405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885464,0.0003200156,0.00007214225,0.00033093084,0.00024458717,0.0001776605],"domain_scores_gemma":[0.99440116,0.0030881525,0.00048011515,0.00078885246,0.0006982104,0.00054355786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120886,0.0006722125,0.00096808246,0.0024027766,0.002458594,0.004591533,0.0014125643,0.0015555279,0.022856738],"category_scores_gemma":[0.008116459,0.0010727871,0.0008350974,0.003097271,0.0031770002,0.012837236,0.0037056466,0.0048008794,0.0021980456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045988734,0.000024320627,0.0001308435,0.000032873875,0.0000056006033,0.00007683426,0.00022293985,0.0005130414,0.00039628195,0.99254155,0.0009925093,0.0050171777],"study_design_scores_gemma":[0.000008886665,0.0000052268515,0.00010683434,0.000010396451,0.000006808257,0.00007966726,0.00011067287,0.0017785792,0.0002506723,0.9952181,0.0024193877,0.0000047697117],"about_ca_topic_score_codex":0.00095287367,"about_ca_topic_score_gemma":0.000970171,"teacher_disagreement_score":0.022856738,"about_ca_system_score_codex":0.0012437132,"about_ca_system_score_gemma":0.0005403432,"threshold_uncertainty_score":0.0764634},"labels":[],"label_agreement":null},{"id":"W4353057842","doi":"10.5206/mase/15775","title":"Minimum Dominating Set for the Prism Graph Family","year":2023,"lang":"en","type":"article","venue":"Mathematics in Applied Sciences and Engineering","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Combinatorics; Vertex (graph theory); Neighbourhood (mathematics); Mathematics; Domination analysis; Graph; Prism; Maximal independent set; Discrete mathematics; Line graph; Physics; 1-planar graph; Optics","score_opus":0.04418239865493833,"score_gpt":0.29690884563862796,"score_spread":0.2527264469836896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353057842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4037882,0.0026585576,0.5018017,0.0013221494,0.00027991127,0.00019335341,0.0048541613,0.0005426745,0.08455931],"genre_scores_gemma":[0.8597619,0.001694998,0.1224517,0.00028120098,0.00010903871,0.00018065784,0.0025290404,0.000088352775,0.012903199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953055,0.00006602751,0.000023592595,0.00015999953,0.00015152135,0.000068278765],"domain_scores_gemma":[0.9993154,0.00024645086,0.00011072979,0.00006414295,0.00016546718,0.00009775988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050325086,0.00038580332,0.00037041324,0.0011847877,0.00096583273,0.0010906279,0.00048385918,0.0003621177,0.003927197],"category_scores_gemma":[0.0015604679,0.00020779828,0.0004893104,0.00082830247,0.0005259068,0.0013226685,0.00069319044,0.000761946,0.00038295175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039339895,0.00009534274,0.005751546,0.0006726242,0.00012526222,0.0008035983,0.00068214355,0.057760093,0.025542626,0.7729056,0.019488264,0.11577943],"study_design_scores_gemma":[0.00004668901,0.00028009902,0.006527806,0.00013053995,0.000070924754,0.004528908,0.00057289103,0.1643537,0.010431171,0.7230812,0.08990727,0.00006881203],"about_ca_topic_score_codex":0.0010875501,"about_ca_topic_score_gemma":0.0010017363,"teacher_disagreement_score":0.003927197,"about_ca_system_score_codex":0.0012123857,"about_ca_system_score_gemma":0.0006441756,"threshold_uncertainty_score":0.013137817},"labels":[],"label_agreement":null},{"id":"W4360975061","doi":"10.1007/s10878-023-01012-x","title":"Fast searching on cactus graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Chordal graph; Combinatorics; Mathematics; Graph; Discrete mathematics","score_opus":0.018589754965846778,"score_gpt":0.2992848647634814,"score_spread":0.28069510979763457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360975061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5922357,0.0018073969,0.32082877,0.0024498045,0.00044148503,0.000372806,0.0013156355,0.007119872,0.07342861],"genre_scores_gemma":[0.7000201,0.00046389375,0.27781695,0.0003628417,0.00012248168,0.0001876927,0.0014291353,0.00062602316,0.018970845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993561,0.00016361629,0.00002648868,0.00012817662,0.00017308803,0.00015261395],"domain_scores_gemma":[0.9956593,0.0031080197,0.00020832654,0.00048576386,0.00032960583,0.0002089264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062216795,0.0008689653,0.0012367882,0.002062935,0.0012841106,0.0013186642,0.0019319648,0.0014589598,0.015542072],"category_scores_gemma":[0.007185381,0.000603157,0.0007086063,0.0026792916,0.0008881193,0.003094163,0.0015359969,0.001090833,0.0012326955],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018445574,0.00043187273,0.00361891,0.0008768393,0.00011738369,0.00047274824,0.00046018272,0.40113235,0.011343038,0.1380642,0.053613365,0.38802466],"study_design_scores_gemma":[0.00016000544,0.000119356315,0.0005564817,0.000047554237,0.000029869141,0.00013277878,0.0001205521,0.9058234,0.0025770825,0.08651935,0.0038962502,0.00001731903],"about_ca_topic_score_codex":0.008628178,"about_ca_topic_score_gemma":0.012539558,"teacher_disagreement_score":0.015542072,"about_ca_system_score_codex":0.0016357524,"about_ca_system_score_gemma":0.0012755285,"threshold_uncertainty_score":0.05199337},"labels":[],"label_agreement":null},{"id":"W4361865602","doi":"10.48550/arxiv.2303.17028","title":"On the Complexity of Embedding in Graph Products","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Pathwidth; Tree-depth; Combinatorics; Embedding; Discrete mathematics; Mathematics; Tree decomposition; Partial k-tree; Graph; Computer science; Line graph","score_opus":0.24681553037414253,"score_gpt":0.2605355533776101,"score_spread":0.013720023003467557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361865602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.674387,0.0032576795,0.27706066,0.011917091,0.00024589937,0.00031596786,0.004916667,0.001507034,0.026391992],"genre_scores_gemma":[0.8795359,0.0023909959,0.10263451,0.0008196697,0.00043685897,0.00029043938,0.0047191256,0.00071826566,0.00845428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968167,0.0009603535,0.0001890884,0.00086046744,0.00074485474,0.00042860262],"domain_scores_gemma":[0.96335375,0.031021837,0.0016235011,0.002270205,0.0008361691,0.0008945689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020035782,0.0011470114,0.0016863092,0.0009415752,0.0014462618,0.0053007356,0.0029797915,0.002407827,0.009173093],"category_scores_gemma":[0.021698609,0.0010459566,0.0016390667,0.002603704,0.0027206244,0.016528394,0.0037154392,0.0037307686,0.0009621709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017819608,0.00066188147,0.011082973,0.0018578714,0.00034070382,0.0008777152,0.0015139569,0.56693506,0.011467056,0.25849798,0.02884648,0.11613632],"study_design_scores_gemma":[0.00011085622,0.00010009305,0.0013926773,0.0000561181,0.00008696433,0.00039810693,0.0003410594,0.5390386,0.003018156,0.4515045,0.003907876,0.00004492064],"about_ca_topic_score_codex":0.0031254098,"about_ca_topic_score_gemma":0.0034392723,"teacher_disagreement_score":0.009173093,"about_ca_system_score_codex":0.0026706096,"about_ca_system_score_gemma":0.0015325652,"threshold_uncertainty_score":0.030687034},"labels":[],"label_agreement":null},{"id":"W4364374056","doi":"10.48550/arxiv.2101.11168","title":"Using edge cuts to find Euler tours and Euler families in hypergraphs","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Traverse; Hypergraph; Euler's formula; Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence; Geography","score_opus":0.10936681950473502,"score_gpt":0.24257572430812954,"score_spread":0.13320890480339453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364374056","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19722188,0.0005648758,0.79407424,0.00036229586,0.000042263746,0.00023795827,0.0007969201,0.0007930421,0.005906595],"genre_scores_gemma":[0.3289179,0.00055865105,0.6642554,0.000099783305,0.000029706624,0.0001734494,0.0018739325,0.0002623919,0.0038288787],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994117,0.00017173815,0.00004181292,0.00017470235,0.000108359556,0.00009157962],"domain_scores_gemma":[0.9971238,0.0016143322,0.00037279318,0.00038136196,0.0002586238,0.00024909328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069792266,0.0007589311,0.0006750134,0.0021677085,0.0011451653,0.0015233294,0.00086082844,0.00096777995,0.004126927],"category_scores_gemma":[0.0060713957,0.00083819183,0.00076740026,0.0023525108,0.0012322207,0.0046347133,0.0018280518,0.0014486768,0.00060444634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005386887,0.00033932558,0.013317325,0.0006028883,0.00014698558,0.00059221184,0.0016221768,0.30016947,0.016082564,0.30308765,0.010294114,0.3532066],"study_design_scores_gemma":[0.000051323168,0.0001465857,0.0024102482,0.00016947479,0.000060900362,0.00045413233,0.00088101946,0.5574028,0.0109260315,0.41445318,0.012975317,0.000069011454],"about_ca_topic_score_codex":0.0026464148,"about_ca_topic_score_gemma":0.0039748815,"teacher_disagreement_score":0.004126927,"about_ca_system_score_codex":0.0011395133,"about_ca_system_score_gemma":0.001005265,"threshold_uncertainty_score":0.013805985},"labels":[],"label_agreement":null},{"id":"W4364380168","doi":"10.48550/arxiv.2304.03857","title":"On the restricted Hanoi Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Digraph; Mathematics; Arc (geometry); Discrete mathematics; Graph; Geometry","score_opus":0.1365597770595831,"score_gpt":0.22598559858804346,"score_spread":0.08942582152846035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364380168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30981013,0.0010908621,0.52264553,0.0029510327,0.00034889864,0.00028793598,0.0013151364,0.0008351285,0.1607153],"genre_scores_gemma":[0.7920984,0.0014530328,0.16534437,0.0011526726,0.00036312538,0.00033484405,0.0014313804,0.00024187958,0.03758029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916685,0.00026821223,0.000028428762,0.00021971617,0.00014533158,0.00017142367],"domain_scores_gemma":[0.9984616,0.00069771806,0.00018836933,0.00026378882,0.00017177561,0.00021672474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000733518,0.0009143632,0.00068052515,0.0010635027,0.0016086348,0.0009786283,0.001634159,0.0011487122,0.011544702],"category_scores_gemma":[0.0030973153,0.0005455077,0.0007209043,0.001329883,0.002196279,0.005515948,0.002120872,0.0028313138,0.0010703278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008545847,0.000045405443,0.0002892984,0.00014049374,0.000021705637,0.00033450002,0.00038395156,0.0134947905,0.0032079006,0.96272147,0.0040483405,0.015226551],"study_design_scores_gemma":[0.000038264385,0.000035050507,0.00048165073,0.000030056783,0.000020016101,0.00027269145,0.00025154455,0.031092778,0.0016771916,0.94596153,0.020099686,0.000039481325],"about_ca_topic_score_codex":0.003286683,"about_ca_topic_score_gemma":0.0029665288,"teacher_disagreement_score":0.011544702,"about_ca_system_score_codex":0.0009628403,"about_ca_system_score_gemma":0.00041239458,"threshold_uncertainty_score":0.03862089},"labels":[],"label_agreement":null},{"id":"W4365520282","doi":"10.1016/j.aim.2023.109020","title":"Breaking the degeneracy barrier for coloring graphs with no K minor","year":2023,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Mathematics; Degeneracy (biology); Combinatorics; Minor (academic); Graph; Graph minor; Discrete mathematics; Graph power; Line graph; Humanities","score_opus":0.024666962673488654,"score_gpt":0.32302891935356604,"score_spread":0.29836195668007737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365520282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51451385,0.0010955664,0.36002764,0.0069031706,0.0007886671,0.0002310715,0.0007303348,0.0032209735,0.11248874],"genre_scores_gemma":[0.9117696,0.00049632497,0.069888666,0.0016873505,0.00016382514,0.00019250519,0.00041164336,0.0012136562,0.014176357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853504,0.00043483175,0.000056326415,0.000300014,0.00027519785,0.0003986532],"domain_scores_gemma":[0.98875207,0.00633559,0.0006733455,0.0025849328,0.00044382273,0.0012102472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019042242,0.0010170678,0.0017055116,0.0012074636,0.0037924536,0.003162055,0.0026772502,0.0024558767,0.013734233],"category_scores_gemma":[0.01566434,0.0009222852,0.0010822554,0.00092120224,0.0034487806,0.006691774,0.0049357787,0.0058424,0.0024270238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006414507,0.00021669998,0.0011512906,0.00033613344,0.00004891074,0.00026113068,0.00064982066,0.017852033,0.010272846,0.9243469,0.013327017,0.0308957],"study_design_scores_gemma":[0.00006087578,0.00003569513,0.00014820557,0.000047294678,0.000013971084,0.00012426489,0.00015184404,0.039879657,0.0013193026,0.95573986,0.0024607303,0.000018301263],"about_ca_topic_score_codex":0.0018937826,"about_ca_topic_score_gemma":0.0031209919,"teacher_disagreement_score":0.013734233,"about_ca_system_score_codex":0.0018198765,"about_ca_system_score_gemma":0.0017051202,"threshold_uncertainty_score":0.045945525},"labels":[],"label_agreement":null},{"id":"W4366371563","doi":"10.1007/s10107-023-01950-8","title":"Small separations in pinch-graphic matroids","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Corollary; Combinatorics; Graphic matroid; Mathematics; Time complexity; Polynomial; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.06714110996471906,"score_gpt":0.33528556079250055,"score_spread":0.2681444508277815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366371563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64270276,0.00080674764,0.23872857,0.0026469778,0.00024817014,0.00012411382,0.00032845952,0.00088803965,0.11352614],"genre_scores_gemma":[0.9357971,0.00052496727,0.033077706,0.0006278292,0.00023107452,0.00016520341,0.0003199212,0.00025354186,0.02900256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992453,0.00020771667,0.000026609952,0.0001509634,0.00022019324,0.00014924676],"domain_scores_gemma":[0.99569654,0.0025304828,0.00056455703,0.0002756383,0.00021448235,0.0007183043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065981515,0.0009983225,0.0011570018,0.0018291126,0.0020885644,0.0037621004,0.0016091228,0.0016586811,0.013708445],"category_scores_gemma":[0.005724566,0.001249841,0.0008016221,0.0017090295,0.0027937866,0.004471474,0.0026455703,0.0044111684,0.0015460706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013624593,0.00006983879,0.00046793337,0.000086478234,0.000013757976,0.00013245367,0.00023188221,0.007554774,0.0016881385,0.9802018,0.002701918,0.006714679],"study_design_scores_gemma":[0.00003899332,0.00003419583,0.0002655025,0.000017660297,0.000013506108,0.00012007466,0.00011057156,0.020701945,0.00084337656,0.9758699,0.0019727591,0.000011442978],"about_ca_topic_score_codex":0.0007458484,"about_ca_topic_score_gemma":0.0012887224,"teacher_disagreement_score":0.013708445,"about_ca_system_score_codex":0.0012592467,"about_ca_system_score_gemma":0.0006264124,"threshold_uncertainty_score":0.045859337},"labels":[],"label_agreement":null},{"id":"W4366465856","doi":"10.1007/s10107-023-01951-7","title":"Recognizing pinch-graphic matroids","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Graphic matroid; Combinatorics; Matroid partitioning; Mathematics; Pinch; Graph; Binary number; Oriented matroid; Discrete mathematics; Time complexity; Arithmetic; Physics","score_opus":0.04805252912963237,"score_gpt":0.32410374137317893,"score_spread":0.27605121224354656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366465856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3045814,0.0003101778,0.638983,0.00092177815,0.00019281117,0.00028870197,0.0010218974,0.0034986073,0.05020161],"genre_scores_gemma":[0.78011036,0.00032925373,0.18891898,0.0004193737,0.00011734733,0.00013598811,0.0033891466,0.0006974218,0.02588214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994429,0.00007954502,0.000035190635,0.0001840572,0.00013571228,0.00012270817],"domain_scores_gemma":[0.9989742,0.00035126947,0.00014656196,0.0002543172,0.00018385633,0.00008974246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002648904,0.0008563542,0.00084659434,0.001187704,0.00088213093,0.0029355686,0.0013561617,0.0013283911,0.013526778],"category_scores_gemma":[0.00253447,0.00078607263,0.0008610193,0.0014462294,0.0007625893,0.0044144094,0.0021002295,0.0019919977,0.002846233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047330133,0.00038097877,0.007044745,0.00069115846,0.000086136235,0.0013328592,0.0009898287,0.10986453,0.040255338,0.48537248,0.028330198,0.3251785],"study_design_scores_gemma":[0.000044596254,0.00015141998,0.0019144795,0.00008191562,0.00005349647,0.0007299543,0.0007984269,0.45853698,0.024990559,0.48751673,0.025133913,0.0000475955],"about_ca_topic_score_codex":0.001680529,"about_ca_topic_score_gemma":0.0030184644,"teacher_disagreement_score":0.013526778,"about_ca_system_score_codex":0.00065973215,"about_ca_system_score_gemma":0.00044526215,"threshold_uncertainty_score":0.04525155},"labels":[],"label_agreement":null},{"id":"W4366958223","doi":"10.1007/978-3-031-30448-4_4","title":"Independent Set Under a Change Constraint from an Initial Solution","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Interval graph; Combinatorics; Mathematics; Bipartite graph; Chordal graph; Comparability; Vertex cover; Split graph; Independent set; Discrete mathematics; Maximal independent set; Vertex (graph theory); Bounded function; Time complexity; Indifference graph; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.09432143081044465,"score_gpt":0.3439484019149341,"score_spread":0.24962697110448945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366958223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09973428,0.0005932244,0.8477851,0.0015805505,0.00029461988,0.00054832123,0.0012414746,0.00093982613,0.04728256],"genre_scores_gemma":[0.5123023,0.00053079,0.45623884,0.0005589814,0.0002238837,0.00077601627,0.0031414607,0.000487324,0.025740484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983348,0.00030505282,0.00006607632,0.0005766636,0.0004769929,0.00024046845],"domain_scores_gemma":[0.99655163,0.0018100387,0.00026204326,0.00080467376,0.0003660656,0.00020550817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017164366,0.0009518802,0.0009936624,0.00077818386,0.0010316372,0.001910698,0.0033081812,0.0016378999,0.0141594205],"category_scores_gemma":[0.008237021,0.0005124923,0.0013673538,0.001712458,0.0011647769,0.0044801105,0.0022187044,0.0032034984,0.0018326252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097017473,0.00066025596,0.0021970437,0.00080970966,0.00017106507,0.0009246663,0.00044116305,0.35346606,0.016815197,0.3343069,0.02198561,0.2672522],"study_design_scores_gemma":[0.00018369163,0.00042446586,0.0011999753,0.000100157944,0.000102189595,0.00059595896,0.00022665698,0.7178968,0.015545136,0.22287041,0.040796366,0.00005816499],"about_ca_topic_score_codex":0.0013741198,"about_ca_topic_score_gemma":0.0013690144,"teacher_disagreement_score":0.0141594205,"about_ca_system_score_codex":0.0014326662,"about_ca_system_score_gemma":0.0016715499,"threshold_uncertainty_score":0.04736793},"labels":[],"label_agreement":null},{"id":"W4366999929","doi":"10.48550/arxiv.2304.11795","title":"Fractional eternal domination: securely distributing resources across a network","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Université de Montréal; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Combinatorics; Mathematics; Cayley graph; Chordal graph; Graph; Order (exchange); Abelian group; Discrete mathematics","score_opus":0.09792242774839244,"score_gpt":0.2528480175974495,"score_spread":0.15492558984905708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366999929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32279715,0.00054050505,0.6639973,0.0011796611,0.000067968635,0.00016465494,0.00033730787,0.0004270563,0.010488427],"genre_scores_gemma":[0.9038335,0.0004805227,0.08913032,0.00020136776,0.000074479365,0.0001382797,0.00021487741,0.00012374997,0.0058028633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983436,0.0005297277,0.00007574402,0.00033205483,0.00034473886,0.00037413626],"domain_scores_gemma":[0.98907757,0.007149461,0.0009423483,0.0018623272,0.00044271944,0.00052562956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022720646,0.00075599866,0.0010404657,0.0008833728,0.0014195445,0.0019861034,0.0019306254,0.0009076093,0.0050492794],"category_scores_gemma":[0.012731724,0.00038824722,0.00069719105,0.0013436486,0.0022994834,0.0063649183,0.0026735882,0.0015298467,0.00039671792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012804802,0.00016191255,0.0046910704,0.00040509185,0.00013935906,0.0005445002,0.0008960496,0.4440379,0.029199265,0.3963728,0.004449981,0.117821656],"study_design_scores_gemma":[0.000051248055,0.00010686003,0.00057791686,0.000032569093,0.00003527017,0.00036403042,0.0002397195,0.70734805,0.0073474552,0.27928105,0.004584622,0.000031209223],"about_ca_topic_score_codex":0.0018458026,"about_ca_topic_score_gemma":0.0024913668,"teacher_disagreement_score":0.0050492794,"about_ca_system_score_codex":0.0014489444,"about_ca_system_score_gemma":0.001010094,"threshold_uncertainty_score":0.01689154},"labels":[],"label_agreement":null},{"id":"W4367046853","doi":"10.1016/j.disc.2023.113419","title":"A cop-winning strategy on strongly cop-win graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Monotonic function; Graph; Generalization; Discrete mathematics","score_opus":0.04702494367628042,"score_gpt":0.3317302440295708,"score_spread":0.2847053003532904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367046853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49293616,0.00042140303,0.36619633,0.0046371603,0.00036034372,0.00048233024,0.0011077748,0.0011386322,0.13271986],"genre_scores_gemma":[0.93229026,0.0002625256,0.03685332,0.0006359131,0.00011455351,0.00029984454,0.00075871556,0.0003288762,0.028455969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983065,0.00042919692,0.000076902055,0.00038784213,0.00027650793,0.00052312994],"domain_scores_gemma":[0.99380505,0.0033858733,0.00034949186,0.0006749577,0.00063721504,0.0011473941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013598003,0.001259594,0.0019796754,0.0014413601,0.0034272254,0.005302795,0.0025722953,0.0026637032,0.012154277],"category_scores_gemma":[0.008200842,0.0011379252,0.001521844,0.0016312031,0.002511374,0.005929686,0.004344071,0.0037385323,0.0021087816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000436412,0.00018918359,0.001330692,0.00020008808,0.00010351152,0.00031917437,0.00069159514,0.007990974,0.0038298904,0.9529003,0.01210106,0.019907152],"study_design_scores_gemma":[0.00006234882,0.000038152128,0.00023251539,0.000018689614,0.000036665322,0.00010788136,0.00017986633,0.026847223,0.0009363515,0.96947753,0.002047711,0.000015095006],"about_ca_topic_score_codex":0.0017875572,"about_ca_topic_score_gemma":0.0021026714,"teacher_disagreement_score":0.012154277,"about_ca_system_score_codex":0.0015920654,"about_ca_system_score_gemma":0.0019661,"threshold_uncertainty_score":0.040660143},"labels":[],"label_agreement":null},{"id":"W4367050287","doi":"10.1007/s10107-023-01944-6","title":"Recognizing even-cycle and even-cut matroids","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Matroid partitioning; Graphic matroid; Combinatorics; Mathematics; Oriented matroid; Weighted matroid; Binary number; Discrete mathematics; Time complexity; Polynomial; Arithmetic","score_opus":0.03575428695673117,"score_gpt":0.3188795183276457,"score_spread":0.28312523137091455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367050287","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48901013,0.00053073815,0.48403624,0.0010998,0.00012207768,0.00014734975,0.0014328755,0.0015061233,0.0221146],"genre_scores_gemma":[0.8202389,0.00036874347,0.16397657,0.00031244842,0.00010009516,0.00008268328,0.004024607,0.00037109051,0.01052488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949276,0.000069655754,0.00004092266,0.00017832807,0.00010720617,0.000111178655],"domain_scores_gemma":[0.99839574,0.0005719528,0.00023039861,0.00032817147,0.0003181988,0.00015544804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003210179,0.0006375569,0.0006969662,0.00092580024,0.00068914774,0.0027587975,0.0013065534,0.0009659385,0.0051042624],"category_scores_gemma":[0.0028049015,0.0005204954,0.00072818465,0.0011630987,0.0005992451,0.005145195,0.0015140502,0.00164434,0.001339012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005584446,0.00049184944,0.017907256,0.00063108903,0.00010783335,0.0010395348,0.0015619142,0.07580491,0.043282375,0.50768447,0.023811368,0.3271188],"study_design_scores_gemma":[0.000030723153,0.00007084871,0.0023707133,0.000059987226,0.000048334583,0.00057975645,0.00077201996,0.27007896,0.015199836,0.6944838,0.016270787,0.000034124096],"about_ca_topic_score_codex":0.0021975175,"about_ca_topic_score_gemma":0.0038798202,"teacher_disagreement_score":0.0051042624,"about_ca_system_score_codex":0.0006260844,"about_ca_system_score_gemma":0.0006314869,"threshold_uncertainty_score":0.017075479},"labels":[],"label_agreement":null},{"id":"W4367317590","doi":"10.18280/mmep.100222","title":"Power Domination in Different Graphs with Applications","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Power (physics); Computer science; Mathematics; Physics","score_opus":0.01965937566093939,"score_gpt":0.23895016890802862,"score_spread":0.21929079324708922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367317590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3527405,0.00251981,0.54700947,0.0021814005,0.00016861629,0.0001337375,0.00044766665,0.0003493021,0.09444955],"genre_scores_gemma":[0.95267314,0.0012550817,0.034517642,0.00029708818,0.00018913452,0.000100390265,0.00024132332,0.00006117713,0.010665143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907887,0.00027561016,0.000043874883,0.00026182068,0.00022208842,0.0001177556],"domain_scores_gemma":[0.99680066,0.0018710572,0.00030618292,0.0002664571,0.0004962442,0.00025940736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008970286,0.0004548335,0.00039283172,0.002025852,0.0013878867,0.001876573,0.00063444645,0.00059108296,0.0029545047],"category_scores_gemma":[0.004367312,0.000232018,0.0007075085,0.0016826221,0.00209314,0.0026390736,0.0014608852,0.0008124054,0.00025271217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005086453,0.000027096412,0.0012272852,0.00009720326,0.000023864952,0.00040447243,0.00058006577,0.015137868,0.0025902742,0.9598657,0.0021080198,0.01788722],"study_design_scores_gemma":[0.000014514835,0.00002427877,0.001018115,0.00002859669,0.000024362871,0.00061665,0.00022275085,0.062979415,0.0012060917,0.92171746,0.012132506,0.000015238425],"about_ca_topic_score_codex":0.0023160207,"about_ca_topic_score_gemma":0.0015007792,"teacher_disagreement_score":0.0029545047,"about_ca_system_score_codex":0.0013818403,"about_ca_system_score_gemma":0.000397404,"threshold_uncertainty_score":0.010026038},"labels":[],"label_agreement":null},{"id":"W4367848794","doi":"10.1007/s44007-023-00044-3","title":"Eternal Distance-k Domination on Graphs","year":2023,"lang":"en","type":"article","venue":"La Matematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; Université du Québec à Montréal; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; Mount Allison University; Mount Saint Vincent University; Université du Québec à Montréal","keywords":"Combinatorics; Vertex (graph theory); Domination analysis; Mathematics; Dominating set; Graph; Guard (computer science); Sequence (biology); Discrete mathematics; Computer science","score_opus":0.0210567289810974,"score_gpt":0.31274645861037026,"score_spread":0.29168972962927286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367848794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77718127,0.0013396463,0.13817862,0.004433133,0.0002038481,0.00007736375,0.0009533207,0.00032586238,0.07730693],"genre_scores_gemma":[0.9481089,0.000657273,0.018376386,0.0005482495,0.0002160988,0.000090416725,0.00058483996,0.00012125524,0.03129653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979353,0.00054329354,0.00013609024,0.00049481954,0.0005206325,0.00036989382],"domain_scores_gemma":[0.9893084,0.006672092,0.0011218422,0.0009981683,0.0009389885,0.0009605297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014201142,0.00078424625,0.0013250724,0.0020480081,0.0021623445,0.003858938,0.003045597,0.0018569378,0.009412652],"category_scores_gemma":[0.008893759,0.0007089556,0.0008590074,0.0025211207,0.0033444655,0.006228136,0.0033464949,0.003233706,0.00090654276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004926375,0.00013564623,0.0034563376,0.00020881141,0.00006954113,0.0003033408,0.0009724923,0.01171766,0.0038431725,0.94802344,0.0046669217,0.026110068],"study_design_scores_gemma":[0.000082247745,0.00003976475,0.0013492953,0.000027286082,0.000033198467,0.0004156068,0.00020773614,0.030813534,0.0016392609,0.9618673,0.0034975584,0.000027193704],"about_ca_topic_score_codex":0.0016371383,"about_ca_topic_score_gemma":0.0020989948,"teacher_disagreement_score":0.009412652,"about_ca_system_score_codex":0.0024361555,"about_ca_system_score_gemma":0.0006957451,"threshold_uncertainty_score":0.03148842},"labels":[],"label_agreement":null},{"id":"W4368372142","doi":"10.1016/j.disc.2023.113473","title":"Metric hypergraphs and metric-line equivalences","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; HORIZON EUROPE Framework Programme; Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Mathematics; Metric space; Combinatorics; Real line; Metric (unit); Equivalence (formal languages); Equivalence relation; Line (geometry); Intrinsic metric; Injective metric space; Discrete mathematics; Geometry","score_opus":0.04917666888456311,"score_gpt":0.3371808582659878,"score_spread":0.2880041893814247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368372142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32500613,0.0049427375,0.3808987,0.013012228,0.0011603422,0.00011950337,0.001382614,0.00056252413,0.27291512],"genre_scores_gemma":[0.92817676,0.002375716,0.032893877,0.0016955961,0.0011233782,0.00014001995,0.0009032509,0.00021068535,0.032480706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988238,0.0004067062,0.00006775803,0.00030562835,0.00027442086,0.000121584584],"domain_scores_gemma":[0.9968791,0.001362917,0.0005072892,0.00032464278,0.00052071625,0.0004052796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008650709,0.0005802374,0.0007525094,0.0027158016,0.0019402483,0.0040660882,0.0012460172,0.001671047,0.015586538],"category_scores_gemma":[0.004325111,0.00048024938,0.00070516666,0.0033131451,0.0032450054,0.012448675,0.0030360639,0.0035286846,0.0013278655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009402225,0.000011624069,0.0000838155,0.0000140980255,0.0000036631352,0.000026048463,0.000111237605,0.00017117319,0.00011048621,0.9959074,0.0007447095,0.0028064372],"study_design_scores_gemma":[0.0000052024266,0.0000036534516,0.000094361174,0.0000040639443,0.0000032979756,0.00003548645,0.000062137384,0.0006306263,0.00006433314,0.9966756,0.0024178608,0.0000033562267],"about_ca_topic_score_codex":0.0008885352,"about_ca_topic_score_gemma":0.0006833845,"teacher_disagreement_score":0.015586538,"about_ca_system_score_codex":0.0012058367,"about_ca_system_score_gemma":0.00034158703,"threshold_uncertainty_score":0.052142143},"labels":[],"label_agreement":null},{"id":"W4372233695","doi":"10.1016/j.tcs.2023.113936","title":"A refinement on the structure of vertex-critical (P5, gem)-free graphs","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; The King's University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Induced subgraph; Mathematics; Discrete mathematics; Chordal graph; Computer science; Graph","score_opus":0.019315533797664167,"score_gpt":0.3026259989599015,"score_spread":0.28331046516223735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372233695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6596393,0.0010430759,0.21879973,0.0031534638,0.00038452438,0.00018642397,0.0014731995,0.0012222829,0.114097975],"genre_scores_gemma":[0.93091714,0.00038100823,0.051970337,0.00057213346,0.00015430413,0.000055248078,0.0011442386,0.00027627728,0.014529351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996476,0.00008881115,0.000014857866,0.000101032034,0.00008078085,0.00006679925],"domain_scores_gemma":[0.99786085,0.0008963808,0.00016682247,0.00049369264,0.00035589506,0.00022642054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006521673,0.00048477974,0.0005183507,0.0018947419,0.0021332977,0.0016768554,0.0013582355,0.001022491,0.007327213],"category_scores_gemma":[0.004414074,0.00041545994,0.0005666337,0.0013369031,0.002107341,0.0028756792,0.0014450771,0.002090185,0.0008398867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017628174,0.000034588447,0.0012421194,0.00010830915,0.000010251457,0.00026232182,0.0007149413,0.002989884,0.005739255,0.9682363,0.0047382126,0.015747486],"study_design_scores_gemma":[0.00003934131,0.000043100725,0.000970956,0.000053876884,0.000019824527,0.00021880987,0.00028770682,0.011032796,0.0033173836,0.97262484,0.011374345,0.000017013397],"about_ca_topic_score_codex":0.0031500494,"about_ca_topic_score_gemma":0.0034025023,"teacher_disagreement_score":0.007327213,"about_ca_system_score_codex":0.0008910202,"about_ca_system_score_gemma":0.0008341578,"threshold_uncertainty_score":0.024511933},"labels":[],"label_agreement":null},{"id":"W4376618462","doi":"10.1007/s00373-023-02644-w","title":"On Reconfiguration Graphs of Independent Sets Under Token Sliding","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Control reconfiguration; Bipartite graph; Discrete mathematics; Graph; Computer science","score_opus":0.03079598120794812,"score_gpt":0.2877690375327042,"score_spread":0.2569730563247561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376618462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62729883,0.0007884069,0.28336355,0.001960921,0.0003067976,0.00023289243,0.0007074078,0.001308689,0.08403248],"genre_scores_gemma":[0.9534243,0.0006661285,0.028752448,0.00039523115,0.00020334515,0.00018918439,0.00078059593,0.0003672258,0.015221478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859136,0.00035122145,0.00007872011,0.00035004137,0.00028824623,0.0003405137],"domain_scores_gemma":[0.99211794,0.0038700642,0.0013586441,0.0011800712,0.00048354216,0.0009897405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011199531,0.00090982066,0.0012448248,0.0021061632,0.0024252604,0.003139542,0.0023389738,0.0017281084,0.012576691],"category_scores_gemma":[0.0077234693,0.0009986241,0.001580359,0.0026676534,0.0036737951,0.006597527,0.003032968,0.0025283874,0.0010843709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030602928,0.00007462749,0.0009405408,0.00012682246,0.00003811803,0.00050424074,0.0007689666,0.022775758,0.004094389,0.95168084,0.0024031457,0.016286448],"study_design_scores_gemma":[0.00004146544,0.00004948198,0.0008008566,0.000036376492,0.000043837183,0.00023627434,0.00042871304,0.04272921,0.001494119,0.95176953,0.0023424143,0.000027812626],"about_ca_topic_score_codex":0.0021672568,"about_ca_topic_score_gemma":0.0016731357,"teacher_disagreement_score":0.012576691,"about_ca_system_score_codex":0.0019450993,"about_ca_system_score_gemma":0.0010398672,"threshold_uncertainty_score":0.04207325},"labels":[],"label_agreement":null},{"id":"W4377200039","doi":"10.1007/978-3-031-32726-1_29","title":"Cut-Sufficient Directed 2-Commodity Multiflow Topologies","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Network topology; Path (computing); Computer science; Directed graph; Topology (electrical circuits); Graph; Path length; Mathematics; Mathematical optimization; Combinatorics; Computer network","score_opus":0.03793505711548806,"score_gpt":0.3009265805198412,"score_spread":0.26299152340435317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33216926,0.0011102523,0.51522315,0.0017120065,0.00023655841,0.00012920075,0.0021828862,0.0005769605,0.14665966],"genre_scores_gemma":[0.87199914,0.001120835,0.08072533,0.00042963785,0.00014139734,0.0002189986,0.0019613963,0.0002466293,0.043156672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996117,0.00008208993,0.000023285136,0.00007859311,0.0001119547,0.000092454145],"domain_scores_gemma":[0.9981275,0.00094053225,0.000173959,0.00016845287,0.0002977858,0.00029175525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065410696,0.0006864363,0.0007704473,0.0015622907,0.001212052,0.0018336463,0.001128151,0.000972923,0.013191314],"category_scores_gemma":[0.0030517422,0.00059756055,0.00065707037,0.0013023975,0.00073424185,0.003258439,0.0019538354,0.0019447478,0.001475704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020436308,0.00005410096,0.00044576637,0.0002491292,0.000020300384,0.00025594427,0.00022018328,0.013045516,0.006412868,0.9574581,0.004714416,0.016919382],"study_design_scores_gemma":[0.000032071846,0.00004763594,0.0004125739,0.000055796685,0.00001793613,0.00026184507,0.00015880147,0.028222302,0.0018242735,0.96189284,0.0070573348,0.000016576823],"about_ca_topic_score_codex":0.00072780414,"about_ca_topic_score_gemma":0.0015297579,"teacher_disagreement_score":0.013191314,"about_ca_system_score_codex":0.00085342897,"about_ca_system_score_gemma":0.0005796153,"threshold_uncertainty_score":0.044129312},"labels":[],"label_agreement":null},{"id":"W4377822168","doi":"10.1142/s1793830923500568","title":"A constructive proof of the Fulkerson–Ryser characterization of digraphic sequences","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Digraph; Constructive; Vertex (graph theory); Combinatorics; Mathematics; Constructive proof; Characterization (materials science); Inequality; Graph; Discrete mathematics; Computer science; Physics; Process (computing)","score_opus":0.018277324969393504,"score_gpt":0.2813524692736935,"score_spread":0.2630751443043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377822168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0128291445,0.0027761776,0.88603497,0.004762159,0.0018421109,0.0003627551,0.0011077755,0.0006445828,0.08964034],"genre_scores_gemma":[0.30587083,0.0057743727,0.64739865,0.0038359251,0.0022022026,0.0010548156,0.0014407841,0.0004754882,0.031946875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997869,0.0005728566,0.00017063523,0.0004217557,0.00077641173,0.00018934689],"domain_scores_gemma":[0.991667,0.0051554875,0.0003795749,0.0006097779,0.0017076513,0.0004806027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00364964,0.0020686374,0.0014451838,0.0038141825,0.0016289419,0.0029064585,0.0017221039,0.0016825836,0.015388734],"category_scores_gemma":[0.013212194,0.0009688658,0.0025492157,0.0026519254,0.00405821,0.0049410765,0.0050844015,0.0082770055,0.0027391373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029446079,0.000057250687,0.00017784954,0.0003398929,0.000028071208,0.0003173148,0.00042203444,0.0031458377,0.004904347,0.9640058,0.006144428,0.020427726],"study_design_scores_gemma":[0.000040875024,0.000058949805,0.0004918656,0.00015676966,0.00004035958,0.00061330287,0.00017861566,0.0112358695,0.00461612,0.9227316,0.059757356,0.00007834249],"about_ca_topic_score_codex":0.0015322194,"about_ca_topic_score_gemma":0.0020087548,"teacher_disagreement_score":0.015388734,"about_ca_system_score_codex":0.0023215052,"about_ca_system_score_gemma":0.0019607767,"threshold_uncertainty_score":0.051480412},"labels":[],"label_agreement":null},{"id":"W4378611059","doi":"10.9734/bpi/ratmcs/v1/5816e","title":"On the DAG Decomposition into Minimum Number of Chains","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Disjoint sets; Node (physics); Path (computing); Directed acyclic graph; Mathematics; Time complexity; Bounded function; Discrete mathematics; Decomposition; Computer science; Computer network; Chemistry; Physics","score_opus":0.034842895703856396,"score_gpt":0.33279935747495826,"score_spread":0.29795646177110185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378611059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012192856,0.0038455797,0.94466394,0.0018808151,0.00035669023,0.00024075765,0.0014006882,0.0014538693,0.033964794],"genre_scores_gemma":[0.054510787,0.004536918,0.90016913,0.0005824242,0.00031842513,0.00033378752,0.0029633623,0.0012328388,0.035352327],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994167,0.00011633117,0.000034066405,0.00021845757,0.00013580376,0.000078582125],"domain_scores_gemma":[0.99908435,0.0004038411,0.000062689694,0.00025704587,0.00012388967,0.00006830297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007459184,0.002072698,0.0012116798,0.0012466884,0.0010723149,0.0019710436,0.001283064,0.00083846465,0.014691405],"category_scores_gemma":[0.0026661265,0.000945715,0.0013161853,0.003562282,0.0010414574,0.005320741,0.0020265142,0.0023170013,0.0043825447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032166572,0.00015488453,0.0004277372,0.0012294225,0.000068142275,0.00019367649,0.00029143077,0.10036236,0.008438262,0.26867312,0.085562974,0.5342763],"study_design_scores_gemma":[0.00012112316,0.00012107534,0.00038232078,0.0002674893,0.000058118076,0.00035719105,0.00018626326,0.20539598,0.00516349,0.659999,0.12790668,0.000041199903],"about_ca_topic_score_codex":0.0022567303,"about_ca_topic_score_gemma":0.0026275534,"teacher_disagreement_score":0.014691405,"about_ca_system_score_codex":0.0015472994,"about_ca_system_score_gemma":0.0017138313,"threshold_uncertainty_score":0.049147666},"labels":[],"label_agreement":null},{"id":"W4379251988","doi":"10.48550/arxiv.2306.00220","title":"Graphs with Large Girth and Small Cop Number","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Girth (graph theory); Conjecture; Mathematics; Exponent; Degree (music); Upper and lower bounds; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.089286639939253,"score_gpt":0.21654945631519476,"score_spread":0.12726281637594178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379251988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8795767,0.0020836766,0.082727924,0.0019714755,0.0001355162,0.00010405986,0.0005701284,0.00044665555,0.032383878],"genre_scores_gemma":[0.97978115,0.00083819055,0.014101583,0.00020937025,0.00012279552,0.000075631935,0.00034847655,0.00013912142,0.004383756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950135,0.00007730031,0.000010756938,0.00014953804,0.00010065183,0.00016045784],"domain_scores_gemma":[0.9972344,0.0011984918,0.00042113333,0.0003965988,0.00022080721,0.0005285415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040530923,0.00064720947,0.00079377444,0.0012378225,0.0013511222,0.0017123839,0.0010546091,0.0007714079,0.005416345],"category_scores_gemma":[0.004354771,0.0005570249,0.0005208101,0.001240813,0.0020612874,0.004098298,0.0023123492,0.0015341443,0.0005363799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061208254,0.00016763785,0.015663914,0.0006716234,0.00016232343,0.0020153162,0.0010288463,0.103658296,0.023806134,0.79056746,0.012973677,0.04867264],"study_design_scores_gemma":[0.000101750775,0.000235108,0.012261314,0.00013719419,0.00014753669,0.002115494,0.00082578906,0.2039027,0.012982945,0.74617887,0.021026976,0.00008424421],"about_ca_topic_score_codex":0.0014828757,"about_ca_topic_score_gemma":0.0023004266,"teacher_disagreement_score":0.005416345,"about_ca_system_score_codex":0.0013136319,"about_ca_system_score_gemma":0.000692373,"threshold_uncertainty_score":0.018119454},"labels":[],"label_agreement":null},{"id":"W4380186075","doi":"10.48550/arxiv.2306.04710","title":"On heroes in digraphs with forbidden induced forests","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Government of Ontario","keywords":"Combinatorics; Transitive relation; Tournament; Digraph; Mathematics; Degree (music); Bounded function; Class (philosophy); HERO; Discrete mathematics; Computer science; Physics; Artificial intelligence","score_opus":0.12366488989010033,"score_gpt":0.23423496352129694,"score_spread":0.11057007363119661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380186075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.766193,0.0013848883,0.18678601,0.0010490827,0.0000892689,0.00010467991,0.0009970353,0.00057427597,0.042821765],"genre_scores_gemma":[0.94546455,0.0008737747,0.035282657,0.00032896976,0.0001371702,0.00010271691,0.0011131855,0.00019481522,0.016502116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895465,0.00025034347,0.000043562,0.00033317762,0.00017174083,0.0002464538],"domain_scores_gemma":[0.9936279,0.0038071685,0.00077825383,0.00068518514,0.00030923338,0.0007922967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089552096,0.0006068372,0.0009308024,0.0016616422,0.002500255,0.002540455,0.0009354643,0.0007638696,0.005679306],"category_scores_gemma":[0.004656798,0.00073851825,0.00092990755,0.0014743578,0.0019845879,0.0041972524,0.0014960835,0.0013506629,0.00049574877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024135761,0.000091966955,0.003995194,0.00016806003,0.00005639386,0.0004936872,0.0010944128,0.015329698,0.0047809253,0.9572085,0.003137639,0.013402174],"study_design_scores_gemma":[0.00010060862,0.0001223547,0.002406376,0.0000754193,0.00006576457,0.00089092867,0.00042390137,0.060383428,0.0028239524,0.917206,0.015452128,0.000049162],"about_ca_topic_score_codex":0.003489438,"about_ca_topic_score_gemma":0.0046870424,"teacher_disagreement_score":0.005679306,"about_ca_system_score_codex":0.00235142,"about_ca_system_score_gemma":0.0006285441,"threshold_uncertainty_score":0.01899916},"labels":[],"label_agreement":null},{"id":"W4380551832","doi":"10.48550/arxiv.2306.06449","title":"List homomorphisms to separable signed graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Horizon 2020 Framework Programme; Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura, Univerzita Karlova; European Commission; Univerzita Karlova v Praze","keywords":"Signed graph; Separable space; Homomorphism; Conjecture; Focus (optics); Combinatorics; Mathematics; Discrete mathematics; Chordal graph; Indifference graph; Class (philosophy); Computer science; Graph; Artificial intelligence","score_opus":0.11939388513340575,"score_gpt":0.23558697130494538,"score_spread":0.11619308617153963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380551832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82072896,0.0008769882,0.1534403,0.0026207713,0.00011091865,0.00015467868,0.0015506204,0.0007921104,0.019724721],"genre_scores_gemma":[0.96720964,0.0006256493,0.0235994,0.0002571096,0.0002192196,0.00010744195,0.0019291497,0.00014180051,0.0059106937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982828,0.00041094655,0.00012146045,0.0004928639,0.00039476517,0.0002971625],"domain_scores_gemma":[0.9849999,0.009475423,0.001974574,0.0014372169,0.0008563292,0.001256536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009533632,0.0006289761,0.00086756673,0.0018797474,0.0010515482,0.004025373,0.0014815575,0.0013988974,0.0099373],"category_scores_gemma":[0.01142961,0.0005048903,0.001036374,0.0020834813,0.0021155232,0.011639541,0.002434704,0.0027452973,0.0008706809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007582987,0.00049777084,0.01029372,0.00087237655,0.00014131455,0.00065487676,0.0021242464,0.05147329,0.009929531,0.82914996,0.011397386,0.08270732],"study_design_scores_gemma":[0.000040641244,0.000050629806,0.00147528,0.000026656457,0.000024482038,0.0002822431,0.00040110224,0.053378556,0.002455982,0.9389206,0.0029074238,0.000036368856],"about_ca_topic_score_codex":0.0012727797,"about_ca_topic_score_gemma":0.0010304698,"teacher_disagreement_score":0.0099373,"about_ca_system_score_codex":0.0019327668,"about_ca_system_score_gemma":0.0009079458,"threshold_uncertainty_score":0.033243537},"labels":[],"label_agreement":null},{"id":"W4380563556","doi":"10.1109/focs57990.2023.00116","title":"Proof of the Clustered Hadwiger Conjecture","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Conjecture; Computer science; Mathematics; Combinatorics","score_opus":0.05355433327769208,"score_gpt":0.3220586471461332,"score_spread":0.2685043138684411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380563556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14829378,0.0029902044,0.47610304,0.023259515,0.0019105978,0.00034742992,0.0068608993,0.002903222,0.33733138],"genre_scores_gemma":[0.8359376,0.0019161251,0.10761924,0.007390823,0.0012217044,0.00054587325,0.0048031053,0.00072544056,0.039839983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844295,0.00020322033,0.0000678518,0.00056035956,0.0004260709,0.0002995567],"domain_scores_gemma":[0.9945639,0.0022467014,0.0003722651,0.0014310256,0.0008357815,0.0005504072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012427742,0.0009570053,0.0010888869,0.0011758517,0.0019533555,0.002261184,0.0022593762,0.0014536551,0.033910222],"category_scores_gemma":[0.0078937095,0.0007836534,0.0017266851,0.0017177591,0.0029925387,0.004952526,0.0060439114,0.0050843526,0.004727844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010810651,0.00005794653,0.0012386177,0.00021785156,0.000044693094,0.00019030005,0.00033515252,0.006755382,0.0017463147,0.9471037,0.02924612,0.012955874],"study_design_scores_gemma":[0.00007937472,0.00004199905,0.0009449484,0.00007023002,0.00003779621,0.00020626873,0.00014106579,0.018374614,0.0015129453,0.95044786,0.028104246,0.000038565606],"about_ca_topic_score_codex":0.004455449,"about_ca_topic_score_gemma":0.003917342,"teacher_disagreement_score":0.033910222,"about_ca_system_score_codex":0.0023964094,"about_ca_system_score_gemma":0.0014447613,"threshold_uncertainty_score":0.11344099},"labels":[],"label_agreement":null},{"id":"W4380629273","doi":"10.1007/s00493-023-00024-9","title":"An Improved Bound for the Linear Arboricity Conjecture","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Conjecture; Mathematics; Combinatorics","score_opus":0.028501187315718303,"score_gpt":0.33020969997860394,"score_spread":0.3017085126628856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380629273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16947275,0.013344966,0.40443286,0.041459065,0.004374544,0.0003980958,0.0064833127,0.007400067,0.35263434],"genre_scores_gemma":[0.84726536,0.0050805304,0.08265131,0.00797943,0.0051103164,0.00047931814,0.007216856,0.0020946602,0.042122204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99214786,0.0015910525,0.00023062757,0.0021031566,0.0021742422,0.0017530927],"domain_scores_gemma":[0.96088946,0.026057485,0.0013828757,0.0060200742,0.0036321452,0.0020178922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004874858,0.0021504252,0.0021057753,0.0031596574,0.0029265606,0.0048883297,0.005414177,0.0030751547,0.0505234],"category_scores_gemma":[0.032472186,0.0012795933,0.0029641688,0.0032885722,0.0042922515,0.016492948,0.006537747,0.011278509,0.010235768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021723502,0.0007680749,0.008067281,0.001373135,0.00027931604,0.0011961123,0.0007883699,0.04946346,0.011618939,0.6262246,0.19524741,0.102800936],"study_design_scores_gemma":[0.00019355876,0.0002207603,0.0017289512,0.00023928205,0.00014941336,0.0006105324,0.00020485568,0.14629151,0.0042245407,0.8092621,0.036783654,0.00009086584],"about_ca_topic_score_codex":0.004171835,"about_ca_topic_score_gemma":0.004424318,"teacher_disagreement_score":0.0505234,"about_ca_system_score_codex":0.00423933,"about_ca_system_score_gemma":0.0019323556,"threshold_uncertainty_score":0.16901761},"labels":[],"label_agreement":null},{"id":"W4380876845","doi":"10.5817/cz.muni.eurocomb23-042","title":"Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Institute for Basic Science; Agence Nationale de la Recherche; European Commission","keywords":"Combinatorics; Conjecture; Mathematics; Clique number; Vertex (graph theory); Graph; Omega; Digraph; Clique; Discrete mathematics; Physics","score_opus":0.0287188648968487,"score_gpt":0.3202329579205905,"score_spread":0.29151409302374176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380876845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4630301,0.0009370374,0.3274319,0.014548485,0.0012067939,0.00046199915,0.0025049113,0.0015727548,0.1883061],"genre_scores_gemma":[0.88263386,0.0009142929,0.08044619,0.00411268,0.0005520845,0.00028711447,0.00361012,0.00048665746,0.026956886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983511,0.00029435405,0.00007980449,0.00057379564,0.00034660203,0.00035436833],"domain_scores_gemma":[0.9926765,0.0044477615,0.00052092416,0.0010496081,0.0007807877,0.00052439055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012901458,0.0009948759,0.0008593541,0.00096378603,0.0020505523,0.0024423094,0.001383132,0.0015485995,0.013485913],"category_scores_gemma":[0.011682731,0.0009042861,0.0019524891,0.0011739838,0.0028847312,0.006923872,0.0039309277,0.00562291,0.0019197445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003035175,0.00025600844,0.0060893567,0.00030171292,0.00008630694,0.000848893,0.0010278387,0.011563931,0.006286714,0.9222196,0.024918003,0.02609807],"study_design_scores_gemma":[0.00017003261,0.000086992615,0.0012325676,0.000055651064,0.00006370011,0.00033290102,0.0005034982,0.023746118,0.004437415,0.94731146,0.022002507,0.000057115114],"about_ca_topic_score_codex":0.007093701,"about_ca_topic_score_gemma":0.0069449064,"teacher_disagreement_score":0.013485913,"about_ca_system_score_codex":0.0022251308,"about_ca_system_score_gemma":0.0011627416,"threshold_uncertainty_score":0.045114875},"labels":[],"label_agreement":null},{"id":"W4380876964","doi":"10.5817/cz.muni.eurocomb23-058","title":"Cop number of random k-uniform hypergraphs","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Hypergraph; Combinatorics; Conjecture; Random graph; Mathematics; Social connectedness; Zigzag; Upper and lower bounds; Graph; Discrete mathematics; Binomial (polynomial); Vertex (graph theory); Binary logarithm; Geometry; Statistics","score_opus":0.022611169466931723,"score_gpt":0.3191085700868565,"score_spread":0.2964974006199248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380876964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80236524,0.0010512045,0.16086826,0.0030972068,0.000119005,0.00029664842,0.0011966503,0.0006708901,0.030334992],"genre_scores_gemma":[0.98558784,0.00037495143,0.007412542,0.00036507563,0.00006807605,0.00023534005,0.0005065376,0.00020098126,0.005248813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977822,0.00095187273,0.0000741862,0.00046849914,0.00033525913,0.00038789544],"domain_scores_gemma":[0.9829959,0.010142565,0.0023220468,0.0016535908,0.000770819,0.0021150182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024330833,0.0010019095,0.0015746265,0.0021607012,0.0015175006,0.0027564478,0.002542412,0.0020081706,0.0077305143],"category_scores_gemma":[0.024909832,0.0009563572,0.00088903366,0.0010916527,0.004669717,0.0044903154,0.002381402,0.002450826,0.0009953395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007440828,0.00015269473,0.0075810584,0.0003487373,0.00014373181,0.00080543745,0.00068947236,0.11347738,0.005585288,0.849419,0.01216513,0.008887955],"study_design_scores_gemma":[0.00013527152,0.00009181849,0.002962749,0.000107070126,0.000054438024,0.00046634302,0.00024405283,0.60087895,0.00270936,0.3897817,0.0024916034,0.00007661428],"about_ca_topic_score_codex":0.0024794184,"about_ca_topic_score_gemma":0.002153698,"teacher_disagreement_score":0.0077305143,"about_ca_system_score_codex":0.0027015964,"about_ca_system_score_gemma":0.0009177348,"threshold_uncertainty_score":0.025861144},"labels":[],"label_agreement":null},{"id":"W4380876996","doi":"10.5817/cz.muni.eurocomb23-021","title":"The Localization game on locally finite trees","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Finite graph; Combinatorics; Discrete mathematics; Vertex (graph theory); Countable set; Finite set; Subdivision; Graph","score_opus":0.028917622296725235,"score_gpt":0.3050418196226142,"score_spread":0.27612419732588894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380876996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53515244,0.00043295158,0.41592047,0.0018765148,0.000053474672,0.0001074978,0.0003561731,0.00041767035,0.04568281],"genre_scores_gemma":[0.9559014,0.0002566217,0.028870061,0.00020767435,0.000034586985,0.0001512084,0.00026392346,0.00010036884,0.014214153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920493,0.0002689327,0.000030367144,0.0001715756,0.00010836019,0.00021586547],"domain_scores_gemma":[0.99572915,0.0029045471,0.0003255548,0.00033137324,0.00020123775,0.0005080923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007630279,0.000550058,0.00083907327,0.0006886304,0.0017580497,0.0019512298,0.0015596412,0.0011620013,0.0075853714],"category_scores_gemma":[0.004871847,0.0003284261,0.0006591424,0.0007046658,0.0034977766,0.006686026,0.002520833,0.0020363843,0.000816267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089674126,0.000045825615,0.0005533994,0.0000882565,0.000014303744,0.00027483757,0.0006320034,0.022988936,0.0035052435,0.9641481,0.0010022632,0.006657146],"study_design_scores_gemma":[0.000036181962,0.000059255482,0.0003406592,0.000034892084,0.00002004758,0.00018920477,0.000473382,0.09905646,0.0020722472,0.89347863,0.0042131627,0.000025952677],"about_ca_topic_score_codex":0.0028966735,"about_ca_topic_score_gemma":0.0028954162,"teacher_disagreement_score":0.0075853714,"about_ca_system_score_codex":0.002087536,"about_ca_system_score_gemma":0.0007031833,"threshold_uncertainty_score":0.025375605},"labels":[],"label_agreement":null},{"id":"W4381333094","doi":"10.1007/s10878-023-01058-x","title":"Balanced connected partitions of graphs: approximation, parameterization and lower bounds","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Combinatorics; Mathematics; Approximation algorithm; Partition (number theory); Vertex (graph theory); Time complexity; Discrete mathematics; Graph","score_opus":0.0146910651880712,"score_gpt":0.27154278237925394,"score_spread":0.2568517171911827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381333094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18835345,0.0066039325,0.76826245,0.004861009,0.00039198247,0.00061856216,0.0025601722,0.0021312034,0.026217226],"genre_scores_gemma":[0.75248384,0.0040850737,0.22579725,0.0010773287,0.0007251041,0.0010827042,0.004988506,0.0015840768,0.008176044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928774,0.0030057835,0.00028376302,0.0014128011,0.0014035684,0.0010167275],"domain_scores_gemma":[0.9460522,0.039368477,0.0031229605,0.0073058503,0.0022549403,0.0018956714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065970453,0.00441556,0.0039346,0.0051756944,0.0024988663,0.008650592,0.008056277,0.005047835,0.011596574],"category_scores_gemma":[0.07198911,0.0025435064,0.0022475135,0.009185735,0.0034752488,0.01620021,0.0072378297,0.007332664,0.0023097862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021401139,0.00110883,0.00806631,0.0008594636,0.00028139207,0.0002064724,0.00093729404,0.6133539,0.0071101314,0.20392206,0.024144394,0.13786955],"study_design_scores_gemma":[0.00010087352,0.00012958447,0.0007394814,0.0001473714,0.00011539845,0.00019966619,0.00021451963,0.7734081,0.0017106187,0.2201913,0.0029991185,0.000043893644],"about_ca_topic_score_codex":0.0033384298,"about_ca_topic_score_gemma":0.0047890362,"teacher_disagreement_score":0.011596574,"about_ca_system_score_codex":0.005820735,"about_ca_system_score_gemma":0.0032231442,"threshold_uncertainty_score":0.042232573},"labels":[],"label_agreement":null},{"id":"W4381433330","doi":"10.1016/j.jctb.2023.05.004","title":"Local Hadwiger's Conjecture","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Conjecture; Minor (academic); Complement (music); Mathematics; Graph; Vertex (graph theory); Discrete mathematics; Biology; Humanities","score_opus":0.012895943215520312,"score_gpt":0.27703519847462554,"score_spread":0.26413925525910525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381433330","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2805788,0.0018068659,0.05507215,0.037551638,0.0025991711,0.00012044146,0.0013085156,0.0012907726,0.6196717],"genre_scores_gemma":[0.913439,0.0006872995,0.007412832,0.0043651517,0.0015418625,0.00017758257,0.000834195,0.00024600315,0.071296155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879116,0.00025386672,0.000048456528,0.00034900347,0.0002257272,0.00033183926],"domain_scores_gemma":[0.9975661,0.0010952158,0.00014589397,0.0006047736,0.0002530485,0.00033493474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551522,0.0010985736,0.002414408,0.0020039254,0.004476866,0.004840044,0.0030136898,0.0033871476,0.030760465],"category_scores_gemma":[0.0050994605,0.00077706267,0.0016562903,0.0023839988,0.0056331917,0.012670036,0.005751795,0.0064354464,0.004723045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053224056,0.00003241582,0.00022120061,0.000047091165,0.000009065626,0.00006731931,0.00016065744,0.00052193494,0.00013565482,0.9898179,0.0063891965,0.0025441963],"study_design_scores_gemma":[0.000029370683,0.000005453244,0.00010375372,0.000009413289,0.000006981433,0.00004116205,0.000054113254,0.00071372703,0.000110968605,0.9962373,0.0026799412,0.000007694077],"about_ca_topic_score_codex":0.0018434233,"about_ca_topic_score_gemma":0.0016614167,"teacher_disagreement_score":0.030760465,"about_ca_system_score_codex":0.0024383224,"about_ca_system_score_gemma":0.0010732138,"threshold_uncertainty_score":0.10290402},"labels":[],"label_agreement":null},{"id":"W4381798257","doi":"10.1002/jgt.22987","title":"Polynomial bounds for chromatic number VII. Disjoint holes","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Disjoint sets; Chromatic scale; Bounded function; Graph; Chromatic polynomial; Discrete mathematics; Integer (computer science); Constant (computer programming)","score_opus":0.02322918043151791,"score_gpt":0.31729970638571847,"score_spread":0.2940705259542006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381798257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53314614,0.007226721,0.23876677,0.014824755,0.0006262869,0.00027822933,0.0030797184,0.0018482336,0.20020309],"genre_scores_gemma":[0.95723265,0.0015097394,0.026379768,0.0007152827,0.0005143031,0.00011367481,0.00074014877,0.00034682767,0.012447585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738044,0.00027958886,0.000051723076,0.0006135953,0.0006454004,0.0010292392],"domain_scores_gemma":[0.98134124,0.013592522,0.0011868884,0.001481807,0.0010425546,0.0013548726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017958304,0.0012582007,0.0011400692,0.0021300358,0.0020532452,0.0045238556,0.0026457692,0.0012694811,0.012416533],"category_scores_gemma":[0.010466385,0.0005464189,0.0013485915,0.001837715,0.0037996594,0.0059292167,0.0033041257,0.004588653,0.0013885028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022741107,0.0005210287,0.012727442,0.0008847668,0.00017216327,0.0004908038,0.0010117319,0.10748524,0.0402472,0.7149823,0.032263033,0.08694021],"study_design_scores_gemma":[0.00019510217,0.00022219768,0.006084708,0.00018653552,0.00015780987,0.00043397615,0.0003229404,0.25259897,0.016669758,0.70392776,0.019088361,0.00011181604],"about_ca_topic_score_codex":0.007805077,"about_ca_topic_score_gemma":0.0092817405,"teacher_disagreement_score":0.012416533,"about_ca_system_score_codex":0.008226397,"about_ca_system_score_gemma":0.0018478524,"threshold_uncertainty_score":0.05968696},"labels":[],"label_agreement":null},{"id":"W4383604917","doi":"10.48550/arxiv.2307.02816","title":"The grid-minor theorem revisited","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Monash University; Australian Government","keywords":"Combinatorics; Graph minor; Treewidth; Minor (academic); Mathematics; Robertson–Seymour theorem; Discrete mathematics; Graph; Planar graph; Upper and lower bounds; 1-planar graph; Line graph; Pathwidth; Graph power","score_opus":0.1084343330650851,"score_gpt":0.2325336489437,"score_spread":0.12409931587861489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383604917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10424263,0.003760573,0.7666567,0.0072467276,0.0010636788,0.00014333386,0.00068322883,0.0014561522,0.11474694],"genre_scores_gemma":[0.844689,0.0019826256,0.12199541,0.002872872,0.0005740012,0.00032613223,0.0005393477,0.00062826055,0.026392434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986827,0.00021128402,0.00004414964,0.00049943745,0.00032624594,0.00023623544],"domain_scores_gemma":[0.99586296,0.002032245,0.0003489893,0.00095564855,0.00042811738,0.00037205222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014850597,0.00070704543,0.0008340215,0.000924113,0.001478297,0.0016872871,0.002079472,0.0009900574,0.011195057],"category_scores_gemma":[0.0065598385,0.00048068128,0.0012619405,0.0009158162,0.0031930883,0.0056120427,0.003203077,0.0033807436,0.0017865323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015687638,0.000041257124,0.0017730261,0.0002261268,0.00003437589,0.00017790924,0.00024138912,0.0074609327,0.0070425966,0.9472861,0.009646661,0.025912885],"study_design_scores_gemma":[0.00006191906,0.00016241967,0.0017434622,0.000061460065,0.000049754646,0.0009242272,0.00020392421,0.04229434,0.010067417,0.8904111,0.053979486,0.000040524876],"about_ca_topic_score_codex":0.0030772518,"about_ca_topic_score_gemma":0.002745001,"teacher_disagreement_score":0.011195057,"about_ca_system_score_codex":0.0015332542,"about_ca_system_score_gemma":0.0009276563,"threshold_uncertainty_score":0.037451208},"labels":[],"label_agreement":null},{"id":"W4383982199","doi":"10.2139/ssrn.4506735","title":"The Minimum Size of Matching-Saturated Graphs","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matching (statistics); Combinatorics; Mathematics; Statistics","score_opus":0.017843584668923815,"score_gpt":0.29589907023783385,"score_spread":0.27805548556891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383982199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84681004,0.00197492,0.08397846,0.0089844465,0.0003218844,0.00016792023,0.0069892877,0.001054886,0.04971812],"genre_scores_gemma":[0.96308565,0.0011280875,0.02386225,0.00065283774,0.0005525803,0.00024329063,0.0026976187,0.00049252843,0.007285214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787486,0.0007096552,0.000112582056,0.0005619674,0.000385671,0.0003553757],"domain_scores_gemma":[0.9646876,0.026869314,0.002372608,0.002441822,0.0013093605,0.0023192917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020799174,0.0009859885,0.0020766123,0.0021070102,0.0014797526,0.0048375432,0.0031573002,0.0030815117,0.011761027],"category_scores_gemma":[0.022810563,0.0015174709,0.0010701137,0.002591173,0.0022447747,0.009897362,0.0023159403,0.0022035472,0.0011803118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004564671,0.00042879762,0.011332556,0.0023315114,0.00042125574,0.00064924837,0.0016057745,0.07354132,0.04793018,0.74994874,0.038853884,0.06839205],"study_design_scores_gemma":[0.00027899066,0.00014349612,0.0031246275,0.00010203755,0.00012978316,0.00046418936,0.00034094404,0.07530724,0.007864814,0.9072121,0.004988336,0.000043436114],"about_ca_topic_score_codex":0.0009275794,"about_ca_topic_score_gemma":0.0010738745,"teacher_disagreement_score":0.011761027,"about_ca_system_score_codex":0.0020663165,"about_ca_system_score_gemma":0.0016101144,"threshold_uncertainty_score":0.03934461},"labels":[],"label_agreement":null},{"id":"W4384339936","doi":"10.37236/11657","title":"Graphs of Linear Growth have Bounded Treewidth","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Japan Society for the Promotion of Science; Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Australian Government","keywords":"Combinatorics; Treewidth; Mathematics; Bounded function; Discrete mathematics; Graph; Partial k-tree; 1-planar graph; Pathwidth; Chordal graph; Line graph","score_opus":0.016056357463164528,"score_gpt":0.28395786498195147,"score_spread":0.26790150751878694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384339936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7878785,0.0022528328,0.15828829,0.005591644,0.00010378177,0.00007221447,0.0028125306,0.0018528021,0.041147362],"genre_scores_gemma":[0.9616788,0.0011075563,0.02642234,0.0006418003,0.00017763946,0.00013247557,0.0017934194,0.00045105864,0.007594775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907625,0.00010006704,0.000026346721,0.0002386573,0.00023150416,0.00032716978],"domain_scores_gemma":[0.9872793,0.008935266,0.0013029258,0.0008633325,0.0007640048,0.00085508276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043707708,0.00072245795,0.0006823208,0.0010266536,0.0011282311,0.002398841,0.0012153803,0.0010345185,0.00433135],"category_scores_gemma":[0.0065229754,0.0005446564,0.00066318613,0.0013478845,0.0017185801,0.0056084516,0.0015395853,0.002203199,0.0009434578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010121414,0.00021324948,0.017614305,0.00082988024,0.00011473959,0.0010698277,0.002429329,0.08960424,0.059496153,0.70433515,0.03218015,0.09110076],"study_design_scores_gemma":[0.000112016874,0.00017422816,0.011587424,0.00011822633,0.00008609133,0.0020300501,0.0007155272,0.22815214,0.02145357,0.7017865,0.03370035,0.000083714054],"about_ca_topic_score_codex":0.003186669,"about_ca_topic_score_gemma":0.0041522984,"teacher_disagreement_score":0.00433135,"about_ca_system_score_codex":0.0013776236,"about_ca_system_score_gemma":0.0005974996,"threshold_uncertainty_score":0.01448983},"labels":[],"label_agreement":null},{"id":"W4385290098","doi":"10.1016/j.aam.2023.102593","title":"Rota's basis conjecture for matroids with density close to one","year":2023,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Mathematics; Disjoint sets; Combinatorics; Conjecture; Rainbow; Basis (linear algebra); Rank (graph theory); Graphic matroid; Discrete mathematics; Geometry","score_opus":0.019146766410876957,"score_gpt":0.304987635809085,"score_spread":0.285840869398208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385290098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4908456,0.0020602045,0.22654676,0.023216147,0.0014434381,0.00020516108,0.0019910843,0.0020933885,0.2515982],"genre_scores_gemma":[0.9284136,0.001185485,0.035908204,0.003382362,0.000925164,0.00028356776,0.0013292094,0.00043060898,0.028141826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775535,0.0006211421,0.000095403324,0.00048331806,0.00052279077,0.0005220161],"domain_scores_gemma":[0.99167526,0.00445203,0.0005707064,0.0015762359,0.0007915712,0.00093414134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020356006,0.0011848678,0.0024470156,0.0017723258,0.0034054047,0.005377657,0.0027261127,0.003988096,0.01859438],"category_scores_gemma":[0.0129375355,0.0013350315,0.0017907651,0.0022601816,0.004968599,0.011184394,0.005028948,0.007121291,0.002958205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012229898,0.000060889684,0.00047254778,0.00008446611,0.000020091124,0.000054418164,0.00021167836,0.0019718506,0.0006688403,0.9802178,0.008756558,0.007358496],"study_design_scores_gemma":[0.000027495347,0.000013597989,0.0001589112,0.000017316093,0.000007322041,0.00006793,0.00008843678,0.0053872135,0.00021922258,0.99212027,0.0018801993,0.000012084248],"about_ca_topic_score_codex":0.0017409357,"about_ca_topic_score_gemma":0.0016639101,"teacher_disagreement_score":0.01859438,"about_ca_system_score_codex":0.0014360797,"about_ca_system_score_gemma":0.001077999,"threshold_uncertainty_score":0.06220442},"labels":[],"label_agreement":null},{"id":"W4385317346","doi":"10.1007/978-3-031-38906-1_7","title":"A Parameterized Approximation Scheme for Generalized Partial Vertex Cover","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Vertex cover; Parameterized complexity; Combinatorics; Cover (algebra); Mathematics; Vertex (graph theory); Partition (number theory); Discrete mathematics; Time complexity; Graph","score_opus":0.04523031406818988,"score_gpt":0.30699976659108835,"score_spread":0.26176945252289846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385317346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08417996,0.0006803163,0.8785941,0.0008974376,0.00019694825,0.0004629372,0.0019460836,0.0035195393,0.029522616],"genre_scores_gemma":[0.45452946,0.0008586468,0.5174813,0.0003088569,0.00019479834,0.00059055025,0.0040997122,0.0009035121,0.021033218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808204,0.00028876023,0.000105049534,0.00042350974,0.00075408356,0.00034657752],"domain_scores_gemma":[0.99733055,0.0007322225,0.000110542955,0.0014774834,0.00018110267,0.0001681467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009864795,0.0011033845,0.0018393821,0.001326203,0.0013899112,0.004245351,0.00427512,0.0013812844,0.0128196385],"category_scores_gemma":[0.004300499,0.00073364703,0.0016753409,0.0049181567,0.0012250381,0.0074164355,0.005202646,0.0033833652,0.0019443108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009900295,0.0003908338,0.00093929056,0.00046054702,0.00010205782,0.00017435575,0.0005674452,0.124512196,0.010694518,0.49398893,0.02092735,0.34625235],"study_design_scores_gemma":[0.0001723951,0.00012218325,0.0004989155,0.00007401409,0.00010196145,0.0002561795,0.00017659512,0.45152342,0.0045660576,0.52027726,0.022182759,0.000048326277],"about_ca_topic_score_codex":0.003447126,"about_ca_topic_score_gemma":0.004218451,"teacher_disagreement_score":0.0128196385,"about_ca_system_score_codex":0.0043582274,"about_ca_system_score_gemma":0.0020774722,"threshold_uncertainty_score":0.04288602},"labels":[],"label_agreement":null},{"id":"W4385357590","doi":"10.1007/978-3-031-38906-1_22","title":"Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Computer science; Discrete mathematics; Graph; 1-planar graph","score_opus":0.023025434302450163,"score_gpt":0.2662281672661516,"score_spread":0.24320273296370146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385357590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47413683,0.0025932502,0.4706868,0.0015989493,0.00026533756,0.00020350111,0.0027543919,0.002014714,0.045746174],"genre_scores_gemma":[0.78753656,0.00091901404,0.19801581,0.0002527814,0.00017156977,0.00014051328,0.0029988177,0.00055294,0.00941192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992393,0.00017616445,0.0000395458,0.00019936592,0.00022143479,0.00012423155],"domain_scores_gemma":[0.9969529,0.0017514251,0.0002620363,0.0005861529,0.00027197436,0.00017551747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000446476,0.0009988543,0.0011765183,0.001232948,0.0009626636,0.002672903,0.0028729213,0.0009882913,0.0067295805],"category_scores_gemma":[0.0067196116,0.00090097403,0.00092915964,0.0029578297,0.00093273947,0.0036111972,0.001789252,0.0015927508,0.0008474091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027017142,0.0003511872,0.0071889474,0.001448688,0.00025329122,0.00045187044,0.0011749552,0.38507763,0.02894637,0.24176317,0.028337155,0.30230507],"study_design_scores_gemma":[0.00010823934,0.000077045064,0.0020884632,0.00006376743,0.000082564,0.00045571683,0.0003922183,0.5450606,0.008867892,0.4360688,0.006705893,0.000028840392],"about_ca_topic_score_codex":0.0026074862,"about_ca_topic_score_gemma":0.0048414106,"teacher_disagreement_score":0.0067295805,"about_ca_system_score_codex":0.0020537574,"about_ca_system_score_gemma":0.0006634561,"threshold_uncertainty_score":0.022512674},"labels":[],"label_agreement":null},{"id":"W4385659976","doi":"10.1007/s11083-023-09641-x","title":"Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications","year":2023,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Interval graph; Discrete mathematics; Split graph; Distance-hereditary graph; Line graph; Pathwidth; Chordal graph; Induced subgraph; Block graph; Cograph; Intersection graph; Indifference graph; Induced subgraph isomorphism problem; Graph; Graph power; Voltage graph; Vertex (graph theory)","score_opus":0.031763554937995854,"score_gpt":0.3440101601170344,"score_spread":0.3122466051790385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385659976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28925788,0.0010759471,0.5897119,0.0053413077,0.00034054453,0.0002836294,0.0019882503,0.0014811482,0.11051937],"genre_scores_gemma":[0.7936958,0.00061422307,0.168294,0.0005828725,0.0005716642,0.00028654555,0.0025373893,0.0005063729,0.032911126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883693,0.00027127928,0.00005103486,0.00035923845,0.0002712847,0.00021027973],"domain_scores_gemma":[0.9912503,0.005426575,0.00071684335,0.00081953494,0.0008653851,0.0009214912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078258297,0.00071217923,0.0009117919,0.002647938,0.0038354865,0.005163808,0.001895237,0.0013466496,0.01604105],"category_scores_gemma":[0.0063913055,0.0008759458,0.0014452671,0.00371287,0.0033153174,0.0059284694,0.0022357788,0.004223861,0.0014051307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006985829,0.00008886751,0.00062471296,0.00006810447,0.000011255069,0.00007025756,0.00040363363,0.002397321,0.00091995334,0.981954,0.0040087826,0.009383259],"study_design_scores_gemma":[0.000022664484,0.000015260728,0.00026959582,0.000017859336,0.000015531532,0.00008069645,0.0002900426,0.019154105,0.0010764814,0.97444135,0.0046007796,0.00001559809],"about_ca_topic_score_codex":0.004399825,"about_ca_topic_score_gemma":0.008280827,"teacher_disagreement_score":0.01604105,"about_ca_system_score_codex":0.0023243034,"about_ca_system_score_gemma":0.0017598514,"threshold_uncertainty_score":0.053662598},"labels":[],"label_agreement":null},{"id":"W4385986349","doi":"10.1007/s00373-023-02696-y","title":"A Note on $$\\Delta $$-Critical Graphs","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Conjecture; Delta; Critical graph; Graph; Discrete mathematics; Line graph; Graph power; Physics","score_opus":0.025462665368886868,"score_gpt":0.3117780709124376,"score_spread":0.2863154055435507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385986349","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04984313,0.016041398,0.1237531,0.058755018,0.029792478,0.00013165324,0.00058861764,0.00074192474,0.72035265],"genre_scores_gemma":[0.63165295,0.019148879,0.08031676,0.02047405,0.014798401,0.00024526037,0.00075336645,0.0011333846,0.23147699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997392,0.00007461388,0.000012158239,0.000060398128,0.00007013071,0.000043510314],"domain_scores_gemma":[0.9986609,0.00069497403,0.00005943767,0.00016780336,0.0002624622,0.00015435054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056159974,0.0006992862,0.0005794811,0.0017441765,0.0027726,0.0017637888,0.0014704318,0.001236555,0.013370412],"category_scores_gemma":[0.0027303305,0.00031347864,0.00057872984,0.0013725471,0.0021872274,0.00476992,0.0019280298,0.003220252,0.0020690607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001550692,0.000011644467,0.000107619955,0.000060951123,0.00000377776,0.00013570189,0.000090861075,0.00043902177,0.00047035277,0.9507117,0.036828514,0.011124372],"study_design_scores_gemma":[0.000004430844,0.0000070258966,0.000083836145,0.000033685603,0.000005018367,0.00015884472,0.00007809739,0.0007392072,0.00043603076,0.92294395,0.075501524,0.000008298109],"about_ca_topic_score_codex":0.0013871791,"about_ca_topic_score_gemma":0.0024237852,"teacher_disagreement_score":0.013370412,"about_ca_system_score_codex":0.001182116,"about_ca_system_score_gemma":0.0006000269,"threshold_uncertainty_score":0.044728518},"labels":[],"label_agreement":null},{"id":"W4386266281","doi":"10.1016/j.jctb.2023.08.001","title":"A proof of the tree alternative conjecture under the topological minor relation","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Conjecture; Minor (academic); Equivalence relation; Relation (database); Combinatorics; Tree (set theory); Isomorphism (crystallography); Congruence relation; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.023536585466061296,"score_gpt":0.2928676424930599,"score_spread":0.2693310570269986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386266281","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.314388,0.0036520434,0.25731596,0.05049,0.006521191,0.00017777483,0.0014252651,0.0015706118,0.36445913],"genre_scores_gemma":[0.9291161,0.0017520249,0.03783745,0.0042519025,0.003344015,0.0001286922,0.00096152123,0.00037751623,0.022230772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989002,0.00024142429,0.000057254278,0.0002809693,0.00033622058,0.00018386902],"domain_scores_gemma":[0.9924819,0.0047912337,0.0005059651,0.0010337036,0.0006539282,0.0005333019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016341085,0.00077721523,0.0012302551,0.0012750257,0.0020434714,0.003012027,0.0021307992,0.0024404747,0.018139487],"category_scores_gemma":[0.008440525,0.00068515365,0.0015954716,0.0015269432,0.0048642033,0.00921071,0.0054902793,0.0058137467,0.002267265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008711155,0.00004699966,0.0002941507,0.00010833022,0.000015210841,0.00028499353,0.00020340568,0.0005319482,0.0011828701,0.9862142,0.00622791,0.0048027947],"study_design_scores_gemma":[0.00003849976,0.000022633467,0.00023160517,0.00002238444,0.000014194965,0.0002229363,0.00007709037,0.002236292,0.000363402,0.9905363,0.006222322,0.000012339859],"about_ca_topic_score_codex":0.0009519042,"about_ca_topic_score_gemma":0.0010074937,"teacher_disagreement_score":0.018139487,"about_ca_system_score_codex":0.0011927242,"about_ca_system_score_gemma":0.0006862754,"threshold_uncertainty_score":0.060682595},"labels":[],"label_agreement":null},{"id":"W4386559272","doi":"10.37236/11862","title":"Irreducible Subcube Partitions","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Environment and Climate Change Canada; University of Haifa; Israel Science Foundation; Fonds Wetenschappelijk Onderzoek; Vlaamse regering; European Commission","keywords":"Combinatorics; Mathematics; Partition (number theory); Discrete mathematics; Dimension (graph theory)","score_opus":0.019568141892636892,"score_gpt":0.29277190572134376,"score_spread":0.27320376382870687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386559272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8314027,0.0003815981,0.11522125,0.00024668602,0.00007482512,0.00021615798,0.0019741685,0.0007853786,0.049697246],"genre_scores_gemma":[0.9536379,0.00021440485,0.033783738,0.00009849581,0.000033783366,0.00018592994,0.002042373,0.00023884127,0.009764523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989735,0.00012956631,0.00006275176,0.00018978996,0.00029963328,0.00034475146],"domain_scores_gemma":[0.99818796,0.0005227093,0.00020162159,0.0005258257,0.000335305,0.00022663391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043584596,0.000600109,0.000656758,0.0012460686,0.0022258507,0.0017354931,0.0008016801,0.00048287577,0.009925401],"category_scores_gemma":[0.0027561097,0.0004157737,0.00057417864,0.0016793398,0.0011975117,0.0017399399,0.0023129948,0.0008240231,0.00069616234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005601871,0.00021120453,0.0076687476,0.00031851782,0.00007338944,0.00083323923,0.0013496055,0.03344271,0.048749637,0.8443378,0.010438934,0.05201608],"study_design_scores_gemma":[0.000110702436,0.0002694903,0.010052098,0.00010254337,0.00014579162,0.001370972,0.0019059955,0.14923574,0.064580835,0.7364457,0.035684817,0.00009526143],"about_ca_topic_score_codex":0.0018919269,"about_ca_topic_score_gemma":0.003399128,"teacher_disagreement_score":0.009925401,"about_ca_system_score_codex":0.00095442246,"about_ca_system_score_gemma":0.0006613813,"threshold_uncertainty_score":0.03320378},"labels":[],"label_agreement":null},{"id":"W4386621544","doi":"10.48550/arxiv.2309.04390","title":"Induced subgraphs and tree decompositions XI. Local structure in even-hole-free graphs of large treewidth","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; Clique-sum; Chordal graph; Mathematics; Tree-depth; Partial k-tree; 1-planar graph; Converse; Tree decomposition; Discrete mathematics; Pathwidth; Bounded function; Graph; Line graph","score_opus":0.060262239499770644,"score_gpt":0.23721944233531103,"score_spread":0.1769572028355404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386621544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8295294,0.0013520034,0.1442931,0.00085527025,0.000033541335,0.0000687106,0.00056443986,0.0004716204,0.022831919],"genre_scores_gemma":[0.96768904,0.0004695291,0.027109694,0.00016415196,0.000035796536,0.000056922767,0.0006789598,0.000078119585,0.0037176923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977404,0.000038160742,0.0000079764695,0.00007725492,0.00004775282,0.00005473483],"domain_scores_gemma":[0.99871194,0.0006116235,0.00023895122,0.00020032868,0.00008678332,0.00015042076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024854933,0.00029744473,0.0003678234,0.0008155925,0.0006462113,0.0008683172,0.0006721302,0.00036058007,0.002942172],"category_scores_gemma":[0.0013278989,0.00038581467,0.0005512268,0.00082677824,0.0010440999,0.0020540447,0.001225435,0.0010601898,0.00036943852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034444494,0.00017183957,0.009284023,0.00045976916,0.00008316341,0.0008556107,0.0020999238,0.028664038,0.031914245,0.86913073,0.005397885,0.051594295],"study_design_scores_gemma":[0.00008540635,0.00007287185,0.0040598786,0.000054048192,0.00007659376,0.0005088631,0.0005452727,0.04777412,0.009827372,0.9283726,0.00859755,0.000025488278],"about_ca_topic_score_codex":0.0018005704,"about_ca_topic_score_gemma":0.003038657,"teacher_disagreement_score":0.002942172,"about_ca_system_score_codex":0.00087705493,"about_ca_system_score_gemma":0.0002810492,"threshold_uncertainty_score":0.009842575},"labels":[],"label_agreement":null},{"id":"W4386786301","doi":"10.1016/j.tcs.2023.114186","title":"The one-visibility localization game","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Mathematics; Combinatorics; Visibility; Isoperimetric inequality; Constant (computer programming); Multiplicative function; Discrete mathematics; Tree (set theory); Treewidth; Order (exchange); Computer science; Pathwidth; Mathematical analysis; Graph","score_opus":0.02531236495019715,"score_gpt":0.317641038245972,"score_spread":0.29232867329577483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386786301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2974424,0.00068446575,0.5047828,0.013501174,0.00027892453,0.00026588602,0.00065799826,0.0006561997,0.18173015],"genre_scores_gemma":[0.9557155,0.00034080946,0.021725832,0.0005131419,0.0000683771,0.00011571481,0.00019539866,0.00008868118,0.021236746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849844,0.00063527905,0.000046908142,0.00026714877,0.00021471742,0.0003375319],"domain_scores_gemma":[0.9952276,0.0030368732,0.00023598594,0.00047446688,0.0002629221,0.0007622386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013661893,0.00085507974,0.0013070169,0.00061842427,0.0016758634,0.0040085907,0.002361291,0.0031087496,0.01005384],"category_scores_gemma":[0.007785265,0.0004484109,0.0006496908,0.0006571215,0.0030891339,0.0076112733,0.003712424,0.003412414,0.0010336367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020481262,0.000059617116,0.00024148112,0.00007759049,0.000017838716,0.0001389822,0.00021086173,0.0074989186,0.0010761344,0.9772543,0.0041154255,0.009103942],"study_design_scores_gemma":[0.000082812934,0.000034014796,0.00009014447,0.000016461145,0.000012947168,0.00010322447,0.00014500355,0.044246316,0.0005400478,0.95236075,0.0023531914,0.0000150614205],"about_ca_topic_score_codex":0.0018684755,"about_ca_topic_score_gemma":0.0013411676,"teacher_disagreement_score":0.01005384,"about_ca_system_score_codex":0.001558697,"about_ca_system_score_gemma":0.0015960678,"threshold_uncertainty_score":0.03363347},"labels":[],"label_agreement":null},{"id":"W4386832011","doi":"10.1016/j.ejc.2023.103809","title":"Guarding isometric subgraphs and cops and robber in planar graphs","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Conjecture; Planar graph; Graph; Planar; Discrete mathematics; Computer science; Computer graphics (images)","score_opus":0.021495076137568046,"score_gpt":0.26022560617976226,"score_spread":0.23873053004219422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386832011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74356586,0.0005929136,0.19576582,0.0019412785,0.0001460509,0.00015019753,0.00071799906,0.0010591946,0.0560607],"genre_scores_gemma":[0.9441015,0.0004397496,0.036111772,0.0003140999,0.00009443084,0.0000879854,0.00095882296,0.0003145057,0.017577177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990397,0.00020903564,0.000041957468,0.00022980066,0.00017788282,0.0003015515],"domain_scores_gemma":[0.9956809,0.002146866,0.00072973187,0.0006907862,0.0002483254,0.00050341507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070786796,0.0006870152,0.0013853868,0.0010619952,0.0016787092,0.0020595666,0.0019355136,0.0016809818,0.010089568],"category_scores_gemma":[0.0061205872,0.0010786502,0.0012094001,0.0011579468,0.002582369,0.0041337796,0.0033817608,0.0021399204,0.0009884151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004560398,0.0002200886,0.0029927639,0.0003704432,0.000065389344,0.0009984393,0.0014856753,0.030833276,0.0055976156,0.90670794,0.009058115,0.041214246],"study_design_scores_gemma":[0.00006472042,0.000072516275,0.0015266825,0.000049932238,0.000055124186,0.00057880743,0.00062551105,0.05578768,0.003313995,0.93208975,0.0057990504,0.000036310194],"about_ca_topic_score_codex":0.0032517186,"about_ca_topic_score_gemma":0.0032924835,"teacher_disagreement_score":0.010089568,"about_ca_system_score_codex":0.0006825774,"about_ca_system_score_gemma":0.0006490082,"threshold_uncertainty_score":0.033752978},"labels":[],"label_agreement":null},{"id":"W4387101675","doi":"10.1017/s0963548323000275","title":"The Excluded Tree Minor Theorem Revisited","year":2023,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Monash University; Australian Government","keywords":"Minor (academic); Combinatorics; Mathematics; Robertson–Seymour theorem; Graph minor; Discrete mathematics; Graph; Upper and lower bounds; Tree (set theory); RADIUS; Pathwidth; Line graph; Computer science; Graph power; Law; Mathematical analysis","score_opus":0.039797771614092606,"score_gpt":0.30333307116574887,"score_spread":0.2635352995516563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387101675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34633029,0.0050691236,0.532524,0.005275037,0.0005525695,0.00013495197,0.00075837737,0.0013689994,0.107986666],"genre_scores_gemma":[0.9533998,0.000777374,0.03399145,0.00089190487,0.00029973697,0.00010887313,0.00033139088,0.00029790937,0.00990165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983729,0.00038601732,0.0000646001,0.00044939414,0.00046331092,0.0002636492],"domain_scores_gemma":[0.99401253,0.0034594315,0.00046327795,0.0008349718,0.0006826943,0.00054706726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013693835,0.00042678195,0.00094313966,0.0010245104,0.0016806737,0.0017274324,0.0017652368,0.0010992032,0.007928499],"category_scores_gemma":[0.006665265,0.00042191386,0.0009968437,0.000732666,0.0030384765,0.0043044332,0.0027705794,0.0021434654,0.0014192591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003693644,0.00006495949,0.0019953717,0.00034042876,0.00005758424,0.00075697235,0.00066985225,0.006944664,0.0208251,0.9384995,0.008392264,0.021083904],"study_design_scores_gemma":[0.00008533644,0.00022850612,0.0022657237,0.000084161125,0.000076604374,0.002884239,0.00037861857,0.047826193,0.018307982,0.8779981,0.049804702,0.000059794827],"about_ca_topic_score_codex":0.0012324179,"about_ca_topic_score_gemma":0.001027588,"teacher_disagreement_score":0.007928499,"about_ca_system_score_codex":0.0009506435,"about_ca_system_score_gemma":0.0005916776,"threshold_uncertainty_score":0.02652347},"labels":[],"label_agreement":null},{"id":"W4387172124","doi":"10.1002/jgt.23035","title":"The edge‐connectivity of vertex‐transitive hypergraphs","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Transitive relation; Vertex (graph theory); Hypergraph; Discrete mathematics; Transitive reduction; Automorphism; Graph; Line graph; Voltage graph","score_opus":0.01647421525668126,"score_gpt":0.2826238086771157,"score_spread":0.2661495934204344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387172124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89375466,0.00042665933,0.06887153,0.0004930613,0.000029838204,0.000050480277,0.00056950905,0.00012552437,0.035678748],"genre_scores_gemma":[0.9914238,0.00018886018,0.0069224737,0.00004796864,0.000023616203,0.000043307875,0.00024427997,0.00001934736,0.0010863153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942505,0.00022196968,0.000035067926,0.00012371416,0.00012274638,0.000071512986],"domain_scores_gemma":[0.9962339,0.002451285,0.000494947,0.0002501111,0.0002971038,0.0002726458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004042446,0.00022595063,0.00030492592,0.0017315289,0.0009155174,0.001599986,0.0005681958,0.00064203993,0.0043728016],"category_scores_gemma":[0.0035041694,0.00032359746,0.00022124988,0.0017141226,0.0016673267,0.0023616494,0.0010228349,0.00054268003,0.00020588959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022773808,0.000055712622,0.0072098523,0.00027010054,0.000071930874,0.00077223906,0.0012110252,0.019752506,0.012946151,0.9296679,0.0023017847,0.025513122],"study_design_scores_gemma":[0.000042807907,0.00004825671,0.0056418027,0.00009174647,0.000078578414,0.0006625077,0.0006315185,0.05908872,0.0074362606,0.91960585,0.0066400208,0.00003191061],"about_ca_topic_score_codex":0.0010669194,"about_ca_topic_score_gemma":0.0009058426,"teacher_disagreement_score":0.0043728016,"about_ca_system_score_codex":0.00049821805,"about_ca_system_score_gemma":0.00021285935,"threshold_uncertainty_score":0.01462847},"labels":[],"label_agreement":null},{"id":"W4387258707","doi":"10.46298/dmtcs.9957","title":"Homomorphically Full Oriented Graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Syddansk Universitet","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.018584024645807756,"score_gpt":0.2938300156535539,"score_spread":0.2752459910077461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387258707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35513398,0.0010478492,0.58167684,0.0014474737,0.00017427393,0.00031827326,0.0040902384,0.0018522169,0.054258868],"genre_scores_gemma":[0.8665431,0.00080844015,0.115400225,0.00070754153,0.00011387929,0.00021761237,0.004069916,0.0002460494,0.011893226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916506,0.00014780703,0.00004722026,0.00027500038,0.00019133781,0.00017371189],"domain_scores_gemma":[0.99822885,0.0005553696,0.00025851914,0.0005289097,0.0002445715,0.00018388305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039148025,0.00038230777,0.00033518393,0.00081237353,0.00067891314,0.0013033417,0.000827229,0.00056505995,0.0052196626],"category_scores_gemma":[0.0015751799,0.0003834471,0.0004270043,0.0010023772,0.0018616617,0.003575519,0.001591304,0.0009877844,0.0007200433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023114381,0.00017134055,0.0042019053,0.00045839645,0.000070671646,0.001241187,0.00098379,0.010069644,0.029167667,0.81936324,0.01371292,0.12032812],"study_design_scores_gemma":[0.000026059823,0.00005992745,0.002381258,0.0000627298,0.000044330736,0.0013537335,0.00053662475,0.016811013,0.01180288,0.92779946,0.03908047,0.00004146076],"about_ca_topic_score_codex":0.0009773578,"about_ca_topic_score_gemma":0.0010858565,"teacher_disagreement_score":0.0052196626,"about_ca_system_score_codex":0.00048845506,"about_ca_system_score_gemma":0.0006434633,"threshold_uncertainty_score":0.017461538},"labels":[],"label_agreement":null},{"id":"W4387294350","doi":"10.48550/arxiv.2309.17291","title":"Exponentially Many Correspondence Colourings of Planar and Locally Planar Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Conjecture; Planar; Girth (graph theory); Class (philosophy); Triangle-free graph; 1-planar graph; Discrete mathematics; Graph; Chordal graph; Computer science","score_opus":0.07458261769763382,"score_gpt":0.21845678630421392,"score_spread":0.1438741686065801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387294350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93838614,0.00043146205,0.04296772,0.00092927145,0.00004623814,0.000044964778,0.0006211288,0.0003205629,0.016252497],"genre_scores_gemma":[0.98127156,0.00020134149,0.012836746,0.00017573666,0.000056897505,0.00007027358,0.0006989165,0.00009102737,0.004597666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987827,0.00020062277,0.000058381273,0.00039123162,0.0002926411,0.00027450352],"domain_scores_gemma":[0.9885011,0.007944014,0.0011688815,0.001022612,0.0005679112,0.0007955943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010278138,0.00045135216,0.0006647675,0.001095271,0.0012905643,0.0024524515,0.0018913597,0.0011064374,0.0066177216],"category_scores_gemma":[0.012000033,0.0005052617,0.0008746164,0.0011609575,0.0015740043,0.0031697615,0.0017494055,0.0019285291,0.0004061214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00207318,0.00029906048,0.053610057,0.0010718744,0.000260543,0.0015381181,0.0027647433,0.09440212,0.05483469,0.700708,0.012831918,0.07560576],"study_design_scores_gemma":[0.00017212256,0.00018606307,0.01988205,0.00008710087,0.00024806277,0.002050966,0.0010184483,0.31103614,0.029163392,0.6219692,0.014112467,0.00007391174],"about_ca_topic_score_codex":0.0012453496,"about_ca_topic_score_gemma":0.002286576,"teacher_disagreement_score":0.0066177216,"about_ca_system_score_codex":0.0022386888,"about_ca_system_score_gemma":0.00059690967,"threshold_uncertainty_score":0.022138476},"labels":[],"label_agreement":null},{"id":"W4387351544","doi":"10.2139/ssrn.4592858","title":"Computing the Pathwidth and Bandwidth of Solid, Convex Grids ∗","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Regular polygon; Bandwidth (computing); Mathematics; Computer science; Telecommunications; Geometry","score_opus":0.023204293377991826,"score_gpt":0.30854352318974804,"score_spread":0.2853392298117562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387351544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6203855,0.00062158075,0.3674601,0.0010699603,0.00008723018,0.00003940958,0.0015392805,0.0013739978,0.007422963],"genre_scores_gemma":[0.8681889,0.00029306317,0.12780514,0.00005836898,0.000045880406,0.00003475669,0.0011276617,0.00024889343,0.002197476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996737,0.000085037864,0.000014095686,0.00009681187,0.000073421754,0.000056984456],"domain_scores_gemma":[0.99532795,0.003417238,0.0002929317,0.00048532902,0.0002260986,0.00025037813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006866866,0.0005229466,0.0005003993,0.0008898884,0.00036628614,0.001369238,0.00092812924,0.0008614324,0.0036875445],"category_scores_gemma":[0.00981908,0.00037636046,0.00027088253,0.0011981752,0.00070423516,0.002390116,0.00093783584,0.00095450436,0.00054260116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011483516,0.000129713,0.0100116655,0.00032587242,0.000073991454,0.00013695014,0.00028918064,0.75817966,0.009779451,0.0641278,0.00945216,0.14634527],"study_design_scores_gemma":[0.000021364081,0.00003885555,0.0009777455,0.000012735342,0.0000072405355,0.000050297254,0.00010059657,0.9247713,0.0021296244,0.07087415,0.0010097445,0.000006313416],"about_ca_topic_score_codex":0.002984964,"about_ca_topic_score_gemma":0.0036755411,"teacher_disagreement_score":0.0036875445,"about_ca_system_score_codex":0.00066393457,"about_ca_system_score_gemma":0.0005680995,"threshold_uncertainty_score":0.012336016},"labels":[],"label_agreement":null},{"id":"W4388317972","doi":"10.1093/oso/9780198505617.005.0003","title":"Asymptotics for <i>q</i> -factorials","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03807506390446683,"score_gpt":0.2945142205117252,"score_spread":0.25643915660725836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388317972","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09393506,0.0065973676,0.3609662,0.011625256,0.0018238887,0.00014729246,0.00061829505,0.003099044,0.52118754],"genre_scores_gemma":[0.8181936,0.0034140802,0.0643888,0.003819439,0.004554228,0.0007650758,0.00069961004,0.0024312679,0.10173388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961738,0.0012943449,0.00014341796,0.000608484,0.0011856889,0.00059434597],"domain_scores_gemma":[0.98127395,0.0126907565,0.0009276706,0.0021038402,0.0017900907,0.0012136584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005432776,0.001460854,0.0016565346,0.006412088,0.003464016,0.0062358077,0.0032574744,0.003122832,0.033894636],"category_scores_gemma":[0.032993857,0.0012541745,0.002047476,0.003813186,0.0065281657,0.011542852,0.0040998086,0.0063980925,0.005664333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016826481,0.000021762733,0.00019652827,0.000054438886,0.0000050076196,0.000033212764,0.00008996296,0.000537599,0.00030863384,0.9907486,0.003437675,0.004549806],"study_design_scores_gemma":[0.000008810728,0.0000074984914,0.0002925921,0.000038869897,0.000008273377,0.00014169936,0.000030607047,0.0062250053,0.00021253162,0.989358,0.0036609946,0.000015153552],"about_ca_topic_score_codex":0.002156842,"about_ca_topic_score_gemma":0.0019832395,"teacher_disagreement_score":0.033894636,"about_ca_system_score_codex":0.0050752144,"about_ca_system_score_gemma":0.0017103757,"threshold_uncertainty_score":0.11338884},"labels":[],"label_agreement":null},{"id":"W4388317990","doi":"10.1093/oso/9780198505617.005.0004","title":"Bond or edge percolation","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Scholarship; Combinatorics; Percolation (cognitive psychology); Subject (documents); Enhanced Data Rates for GSM Evolution; Bond; Graph theory; Graph; Percolation theory; Mathematics; Statistical physics; Computer science; Physics; Library science; Psychology; Economics; Artificial intelligence; Topology (electrical circuits)","score_opus":0.03989398380301909,"score_gpt":0.2966270266582216,"score_spread":0.2567330428552025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388317990","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006089536,0.0103352,0.026276149,0.0063437233,0.0033077917,0.00005797891,0.0006103594,0.0003760464,0.9466032],"genre_scores_gemma":[0.12080902,0.014491921,0.008860643,0.002958851,0.0038736595,0.00015022335,0.00084832945,0.0005966706,0.8474107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997172,0.000050849016,0.00000874012,0.00006848868,0.000111555106,0.00004322531],"domain_scores_gemma":[0.9995402,0.00016899013,0.000030494337,0.000093048206,0.00008133367,0.000085898915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003022775,0.00071794837,0.00088216324,0.0020163725,0.0014230114,0.0036420727,0.0009799784,0.0017197604,0.065269835],"category_scores_gemma":[0.0019435836,0.0003843714,0.0004101428,0.002818872,0.0022153754,0.0059127472,0.0014353873,0.0021890702,0.013776667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008246466,0.000014224257,0.000062625666,0.000076840195,0.0000042399765,0.000022194734,0.00009017795,0.00023805311,0.000194436,0.88332283,0.09247882,0.023487294],"study_design_scores_gemma":[0.0000040352056,0.000005223399,0.00017581516,0.000045425648,0.000005544013,0.00006304748,0.000043929485,0.0007689635,0.00013653576,0.7734737,0.22527222,0.000005517672],"about_ca_topic_score_codex":0.0014769062,"about_ca_topic_score_gemma":0.0020731378,"teacher_disagreement_score":0.065269835,"about_ca_system_score_codex":0.0012223066,"about_ca_system_score_gemma":0.0007749537,"threshold_uncertainty_score":0.21834934},"labels":[],"label_agreement":null},{"id":"W4388318195","doi":"10.1093/oso/9780198505617.005.0002","title":"Convex functions","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Combinatorics; Subject (documents); Scholarship; Mathematics; Graph; Regular polygon; Graph theory; Discrete mathematics; Computer science; Library science; Political science; Geometry","score_opus":0.030368163834407,"score_gpt":0.2701441202576862,"score_spread":0.2397759564232792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388318195","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022496718,0.005346169,0.023163527,0.0034261632,0.0012834133,0.000023370989,0.00051608804,0.00016377131,0.96382785],"genre_scores_gemma":[0.054224215,0.010416407,0.009113429,0.00082211435,0.0022155805,0.00010417867,0.0007918345,0.00053037034,0.9217819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996418,0.0000581064,0.000014287388,0.00007497973,0.00017706645,0.000033783705],"domain_scores_gemma":[0.9996171,0.00011471304,0.000018198405,0.000082137136,0.00012755845,0.00004031367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037777098,0.0010481867,0.0010011537,0.0022511648,0.0015220055,0.004234739,0.0007394109,0.0009281483,0.065304816],"category_scores_gemma":[0.001311894,0.00040071746,0.0004109931,0.0036965827,0.0020297242,0.003660542,0.0013946015,0.0032390053,0.01852601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053825975,0.000010122985,0.000032730135,0.0000675923,0.0000035130067,0.000013282019,0.000078643956,0.00040243036,0.00021272626,0.8418933,0.107368305,0.049912095],"study_design_scores_gemma":[0.0000041797757,0.000007917755,0.00029544014,0.00006378197,0.000006476869,0.00009161378,0.00006543752,0.0014271573,0.0003342421,0.4816287,0.5160663,0.000008760311],"about_ca_topic_score_codex":0.002430048,"about_ca_topic_score_gemma":0.0031096307,"teacher_disagreement_score":0.065304816,"about_ca_system_score_codex":0.0028195812,"about_ca_system_score_gemma":0.0011348488,"threshold_uncertainty_score":0.2184664},"labels":[],"label_agreement":null},{"id":"W4388456631","doi":"10.1002/rsa.21197","title":"Sharp thresholds in adaptive random graph processes","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation of Sri Lanka; University of Toronto; National Science Foundation","keywords":"Mathematics; Random regular graph; Graph; Monotone polygon; Null graph; Combinatorics; Random graph; Line graph; Complement graph; Discrete mathematics; Voltage graph; Geometry; Pathwidth","score_opus":0.0224160680928744,"score_gpt":0.2887039899985048,"score_spread":0.2662879219056304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388456631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30509633,0.00086551666,0.66979647,0.00178981,0.00011789264,0.00021187816,0.00021446976,0.0005487395,0.021358857],"genre_scores_gemma":[0.9765421,0.00020343896,0.019285237,0.0002831369,0.000054644523,0.00012733253,0.000060715996,0.000050109928,0.003393284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974492,0.0009774717,0.00013105695,0.0005673613,0.00045977836,0.00041503838],"domain_scores_gemma":[0.96659875,0.025117645,0.0030909202,0.0016464309,0.0015617042,0.0019846512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005580222,0.00089982443,0.0015287152,0.0018865329,0.00092332886,0.0030664254,0.0017368037,0.0023944494,0.004915385],"category_scores_gemma":[0.035576645,0.0006928196,0.0012138642,0.00060923793,0.005382331,0.0038105117,0.0025220057,0.0033625145,0.00044792413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009756822,0.0000443597,0.0011916057,0.00009379653,0.00004779655,0.00025621557,0.00034568922,0.04451183,0.002857253,0.94579995,0.00079053664,0.003963558],"study_design_scores_gemma":[0.00005554933,0.000077283636,0.0006743618,0.000038230417,0.000023549888,0.00009744099,0.00010869809,0.35170195,0.0010407523,0.6454169,0.0007276925,0.000037712656],"about_ca_topic_score_codex":0.0020839423,"about_ca_topic_score_gemma":0.0012795407,"teacher_disagreement_score":0.005580222,"about_ca_system_score_codex":0.0027472982,"about_ca_system_score_gemma":0.0008101958,"threshold_uncertainty_score":0.029511333},"labels":[],"label_agreement":null},{"id":"W4388471823","doi":"10.1016/j.jctb.2023.10.008","title":"Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Induced subgraph; Subdivision; Bipartite graph; Discrete mathematics; Treewidth; Chordal graph; Cograph; Graph; Pathwidth; 1-planar graph; Line graph; Vertex (graph theory)","score_opus":0.017087698286873558,"score_gpt":0.27820646013842604,"score_spread":0.26111876185155247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388471823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78390855,0.0046178936,0.07948496,0.0028554667,0.0003328773,0.00014220708,0.00096246955,0.00042528292,0.12727028],"genre_scores_gemma":[0.96771485,0.0016969764,0.009782351,0.0002973548,0.0003307957,0.00006571607,0.0006761783,0.00007966507,0.019356247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996716,0.00004997153,0.000019565923,0.000057807676,0.00009643653,0.000104664694],"domain_scores_gemma":[0.99930835,0.00030455572,0.0001089219,0.0000659108,0.000052527474,0.00015973118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035876757,0.000490425,0.00063703186,0.0018878038,0.0014518297,0.0026740397,0.0006407941,0.00092852017,0.006554803],"category_scores_gemma":[0.0011668836,0.00050563004,0.0010549985,0.0014881847,0.002136941,0.002677497,0.0023019502,0.0018578139,0.0007258097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004616612,0.000056376175,0.00092317536,0.00009027834,0.00001137669,0.00021224772,0.00062073465,0.0012552969,0.002475884,0.9834029,0.001994806,0.008910667],"study_design_scores_gemma":[0.000015006432,0.00001908832,0.0015121967,0.000021150134,0.000014151779,0.00021601918,0.00026614606,0.0031536848,0.00059590617,0.989408,0.0047660903,0.000012585172],"about_ca_topic_score_codex":0.0013971898,"about_ca_topic_score_gemma":0.0015923983,"teacher_disagreement_score":0.006554803,"about_ca_system_score_codex":0.0007660829,"about_ca_system_score_gemma":0.00040720552,"threshold_uncertainty_score":0.021928012},"labels":[],"label_agreement":null},{"id":"W4388473630","doi":"10.1016/j.disc.2023.113777","title":"On an f-coloring generalization of linear arboricity of multigraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arboricity; Combinatorics; Mathematics; Multigraph; Conjecture; Degree (music); Simple (philosophy); Generalization; Vertex (graph theory); Edge coloring; Function (biology); Discrete mathematics; Graph; Planar graph; Line graph; Graph power; Biology; Physics","score_opus":0.04239752126348623,"score_gpt":0.3394515713267526,"score_spread":0.29705405006326635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388473630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.488325,0.0011146057,0.34732428,0.0037193582,0.00073225476,0.00012336565,0.0007493349,0.0006731869,0.1572387],"genre_scores_gemma":[0.89928234,0.0012459913,0.05990598,0.0013183726,0.00093922706,0.00008347833,0.0006526155,0.00030617273,0.036265932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996605,0.00009484263,0.000011568863,0.000108699154,0.000053240423,0.00007116044],"domain_scores_gemma":[0.9980313,0.0010052277,0.00022181324,0.00026007093,0.00020562654,0.00027601238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044092978,0.0005463575,0.00056758884,0.0010838711,0.0014038961,0.0012451202,0.0010949789,0.0008197669,0.007820442],"category_scores_gemma":[0.0022701987,0.00039197883,0.0011186476,0.0015883475,0.0011966486,0.0023454074,0.0012262943,0.0024785378,0.00056363264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007132159,0.000058424885,0.0009124459,0.000084905856,0.00001685455,0.00038716552,0.00035271145,0.0068756673,0.0033481983,0.96730685,0.006733134,0.013852158],"study_design_scores_gemma":[0.000023063378,0.00003025316,0.0008270991,0.000027690205,0.000016398364,0.00030974657,0.00012842353,0.031354927,0.00068193034,0.9605345,0.006049222,0.000016826461],"about_ca_topic_score_codex":0.0041428055,"about_ca_topic_score_gemma":0.004917027,"teacher_disagreement_score":0.007820442,"about_ca_system_score_codex":0.0012309566,"about_ca_system_score_gemma":0.00042422875,"threshold_uncertainty_score":0.026162028},"labels":[],"label_agreement":null},{"id":"W4388650663","doi":"10.48550/arxiv.2311.05719","title":"Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; Subdivision; Tree decomposition; Graph; Line graph; Vertex (graph theory); Mathematics; Distance-hereditary graph; Planar graph; Tree-depth; Discrete mathematics; 1-planar graph; Pathwidth; Graph power; Geography","score_opus":0.10192352268935731,"score_gpt":0.24007779009271785,"score_spread":0.13815426740336054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388650663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7111833,0.0017282146,0.233586,0.0010588492,0.00012440037,0.00013096562,0.0010674408,0.00043908673,0.050681718],"genre_scores_gemma":[0.9182429,0.00078380096,0.0618821,0.00031589845,0.00009531328,0.000115072864,0.0016246396,0.00015936978,0.016780857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982774,0.000033163364,0.000006923625,0.000048554724,0.000040394334,0.00004320503],"domain_scores_gemma":[0.9995395,0.00015355302,0.0001164899,0.000065020424,0.00004710156,0.000078412406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015828568,0.00025910587,0.00026712066,0.0007362591,0.00059197034,0.0009816166,0.00047671943,0.00041434853,0.004621257],"category_scores_gemma":[0.0007721536,0.00030322105,0.0004452377,0.000902064,0.000846767,0.0014142677,0.0010042718,0.00081098906,0.0005550385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010125772,0.0000637416,0.0018668077,0.00012401812,0.000019711588,0.000358076,0.00073349767,0.0075284964,0.009911932,0.94606084,0.005067915,0.028163705],"study_design_scores_gemma":[0.000035991932,0.000040646748,0.0024223092,0.000044498982,0.000033187123,0.00045272976,0.0003819002,0.028246406,0.003607783,0.9453376,0.019381663,0.000015358652],"about_ca_topic_score_codex":0.0013689133,"about_ca_topic_score_gemma":0.0018777918,"teacher_disagreement_score":0.004621257,"about_ca_system_score_codex":0.0005756302,"about_ca_system_score_gemma":0.0002199215,"threshold_uncertainty_score":0.015459657},"labels":[],"label_agreement":null},{"id":"W4388763349","doi":"10.1007/s00012-023-00834-4","title":"Surjective polymorphisms of directed reflexive cycles","year":2023,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Champlain Regional College; University of Waterloo","funders":"","keywords":"Surjective function; Mathematics; Unary operation; Digraph; Reflexivity; Combinatorics; Property (philosophy); Discrete mathematics; Pure mathematics","score_opus":0.023771078318776527,"score_gpt":0.29066574735699496,"score_spread":0.26689466903821846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388763349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7650271,0.0010168619,0.13952139,0.0009905657,0.00030312102,0.0000851222,0.00041845208,0.00051036465,0.09212705],"genre_scores_gemma":[0.9615237,0.00055517437,0.015440244,0.00017409812,0.00020616698,0.00008055134,0.00024308976,0.0001338579,0.021643024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987509,0.00027621322,0.00007428727,0.00034711303,0.00028357166,0.00026788664],"domain_scores_gemma":[0.99710363,0.001443119,0.00032134936,0.00033298173,0.00033707518,0.00046178073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010470075,0.000511016,0.00076769793,0.0017608779,0.0018518497,0.0035437848,0.0012106235,0.00067646627,0.0050621713],"category_scores_gemma":[0.0034175327,0.0006152059,0.0006315398,0.0017995619,0.0028020553,0.005731187,0.0026761235,0.0022389393,0.0005705791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027208525,0.00002058215,0.00020256049,0.000016985465,0.000006393656,0.00007360748,0.00034304272,0.00040893673,0.00081771077,0.9930225,0.00028318563,0.004777222],"study_design_scores_gemma":[0.000018432323,0.000016639437,0.00024070255,0.000014299879,0.000014696917,0.00009929662,0.00018884063,0.0015095972,0.0011578072,0.99256504,0.0041599907,0.000014634329],"about_ca_topic_score_codex":0.0011908272,"about_ca_topic_score_gemma":0.0013584496,"teacher_disagreement_score":0.0050621713,"about_ca_system_score_codex":0.001412302,"about_ca_system_score_gemma":0.0008289472,"threshold_uncertainty_score":0.016934633},"labels":[],"label_agreement":null},{"id":"W4388850666","doi":"10.1002/jgt.23055","title":"Induced subgraphs and tree decompositions V. one neighbor in a hole","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; 1-planar graph; Mathematics; Tree-depth; Clique-sum; Partial k-tree; Tree decomposition; Vertex (graph theory); Discrete mathematics; Bounded function; Pathwidth; Chordal graph; Graph; Line graph","score_opus":0.031559004045184,"score_gpt":0.30382379051584285,"score_spread":0.2722647864706589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388850666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86065686,0.00064272404,0.11049107,0.00078134326,0.00006268257,0.00007270398,0.0006144741,0.00029093603,0.026387231],"genre_scores_gemma":[0.96884346,0.00030359463,0.024500823,0.00018483268,0.000034626508,0.000047342728,0.00089985115,0.00005994341,0.0051254155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996233,0.000060286737,0.000018773426,0.00009429582,0.00011664286,0.00008664756],"domain_scores_gemma":[0.9986424,0.00052495324,0.00027454374,0.00019949152,0.00016330731,0.0001953027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000247506,0.00025279025,0.0003936718,0.0007135525,0.0007270586,0.0007764461,0.00047722246,0.000410415,0.0031216387],"category_scores_gemma":[0.0012732648,0.0003002669,0.0004891122,0.00078419765,0.00077259674,0.0016022605,0.0011723175,0.000874137,0.00033614217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003248179,0.00017462582,0.007884507,0.00028541576,0.00006556548,0.0018988183,0.0016917173,0.013467579,0.025101691,0.9003253,0.005863315,0.042916734],"study_design_scores_gemma":[0.00005375411,0.000097007054,0.0057614306,0.000073685216,0.000085423206,0.0010901695,0.0007321185,0.031580858,0.008383644,0.93113375,0.020981299,0.000026878888],"about_ca_topic_score_codex":0.0012746863,"about_ca_topic_score_gemma":0.0016247126,"teacher_disagreement_score":0.0031216387,"about_ca_system_score_codex":0.000586386,"about_ca_system_score_gemma":0.00023787942,"threshold_uncertainty_score":0.010442913},"labels":[],"label_agreement":null},{"id":"W4388906444","doi":"10.46298/dmtcs.11478","title":"Proving exact values for the $2$-limited broadcast domination number on grid graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Square (algebra); Mathematics; Square tiling; Combinatorics; Grid; Discrete mathematics; Geometry","score_opus":0.026306557541697813,"score_gpt":0.3233868965664962,"score_spread":0.2970803390247984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388906444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1598303,0.0019760649,0.76224947,0.0030928457,0.00024207166,0.0002723669,0.0021535836,0.0018175765,0.06836572],"genre_scores_gemma":[0.8535085,0.0012227779,0.13568145,0.0006638818,0.0002664703,0.0005487136,0.0011150074,0.0006480433,0.0063452316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970293,0.00074203825,0.00009819667,0.0005859284,0.00086729694,0.00067725277],"domain_scores_gemma":[0.9762591,0.018465942,0.0013757325,0.0022768218,0.00095070316,0.0006716714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002800108,0.0017667692,0.001694254,0.0023265004,0.0012958705,0.002931241,0.0035381939,0.001550435,0.013765606],"category_scores_gemma":[0.027848825,0.0011977546,0.0012783447,0.002530436,0.0026067446,0.0071002864,0.0032975103,0.0038331735,0.0020289372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009483546,0.00039000987,0.009558351,0.0013315363,0.00027410933,0.0006350321,0.0007169754,0.5064657,0.021076867,0.3412669,0.027310817,0.09002526],"study_design_scores_gemma":[0.00007287649,0.00007679834,0.0015143777,0.00011031193,0.000076595206,0.0003502987,0.00020044466,0.56807834,0.0068599065,0.41835248,0.004241846,0.00006569981],"about_ca_topic_score_codex":0.0027310213,"about_ca_topic_score_gemma":0.006093711,"teacher_disagreement_score":0.013765606,"about_ca_system_score_codex":0.0036034537,"about_ca_system_score_gemma":0.0020112991,"threshold_uncertainty_score":0.04605055},"labels":[],"label_agreement":null},{"id":"W4389067604","doi":"10.1016/j.dam.2023.11.042","title":"Vertex-critical <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e185\" altimg=\"si23.svg\"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">+</mml:mo><mml:mi>ℓ</mml:mi><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>-free and vertex-critical (gem, co-gem)-free graphs","year":2023,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Prince Edward Island; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Clique number; Discrete mathematics","score_opus":0.019513514046064873,"score_gpt":0.264985636913285,"score_spread":0.24547212286722014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389067604","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05533687,0.00095372443,0.28598097,0.0022666545,0.0008025101,0.00020939419,0.019986987,0.013239871,0.6212231],"genre_scores_gemma":[0.512713,0.0016785921,0.087358855,0.0009923491,0.00037522666,0.00017575864,0.040288344,0.009894546,0.34652343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977654,0.000026809359,0.000008822873,0.00006586488,0.00006905997,0.000052926636],"domain_scores_gemma":[0.9991203,0.0002476955,0.000060681356,0.00019862335,0.0002318814,0.00014085566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027404155,0.0005179035,0.00037432785,0.0012521496,0.0010255763,0.002138078,0.00094820117,0.00043824108,0.088999376],"category_scores_gemma":[0.0021911613,0.00037734825,0.000398632,0.0016296089,0.0006978233,0.0022948594,0.001299732,0.0012211297,0.024317017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021662492,0.00004782585,0.000840765,0.00031968314,0.000015190105,0.00033202406,0.00039840382,0.0033356575,0.004615797,0.67949045,0.24656719,0.06382044],"study_design_scores_gemma":[0.00004810122,0.000026963715,0.0009939302,0.000085676285,0.000026239919,0.00040340083,0.00030349285,0.0077679576,0.009763065,0.5099706,0.47057614,0.000034494915],"about_ca_topic_score_codex":0.004473376,"about_ca_topic_score_gemma":0.005880684,"teacher_disagreement_score":0.088999376,"about_ca_system_score_codex":0.0012310217,"about_ca_system_score_gemma":0.0007821155,"threshold_uncertainty_score":0.2977326},"labels":[],"label_agreement":null},{"id":"W4389129622","doi":"10.1016/j.jctb.2023.11.005","title":"Hitting all maximum stable sets in P5-free graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Combinatorics; Mathematics; Bounded function; Induced subgraph; Conjecture; Discrete mathematics; Graph; Vertex (graph theory); Induced path; Cardinality (data modeling); Longest path problem; Chordal graph; Computer science","score_opus":0.021601945378098928,"score_gpt":0.29157513236965915,"score_spread":0.2699731869915602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389129622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8924408,0.0004367441,0.057728246,0.0014035931,0.00013278509,0.00015431347,0.0012466554,0.0006959909,0.045760922],"genre_scores_gemma":[0.9658939,0.00024115274,0.016407428,0.0003387886,0.00007864712,0.00017339012,0.0017901043,0.0002592687,0.014817343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858737,0.00024217778,0.00007744602,0.0003533829,0.00035904683,0.0003805833],"domain_scores_gemma":[0.992366,0.0046907575,0.0006639202,0.00062051055,0.0005869091,0.001071981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009831534,0.0013088937,0.0019717126,0.0034177012,0.006185142,0.005625894,0.0034385875,0.003081894,0.01598416],"category_scores_gemma":[0.007940405,0.0018540077,0.0019666557,0.0032843812,0.0030770674,0.0061532515,0.004246605,0.0031106095,0.0021982316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013253415,0.00042834337,0.008059186,0.0006568849,0.0003233532,0.0016003298,0.0029206858,0.019933319,0.012227254,0.90226173,0.016249983,0.03401369],"study_design_scores_gemma":[0.00015210113,0.000109757726,0.0016043026,0.00006869368,0.000109974826,0.000503567,0.0008516889,0.033668716,0.0057778005,0.95424503,0.0028643676,0.000043946675],"about_ca_topic_score_codex":0.0020622252,"about_ca_topic_score_gemma":0.0038995894,"teacher_disagreement_score":0.01598416,"about_ca_system_score_codex":0.001801245,"about_ca_system_score_gemma":0.0011594456,"threshold_uncertainty_score":0.05347228},"labels":[],"label_agreement":null},{"id":"W4389152900","doi":"10.4230/lipics.mfcs.2024.48","title":"Local Certification of Geometric Graph Classes","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Discrete mathematics; Vertex (graph theory); Upper and lower bounds; Graph","score_opus":0.15941040939257803,"score_gpt":0.24286886965372095,"score_spread":0.08345846026114292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389152900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46986228,0.00045690656,0.4953499,0.0023048674,0.000074538955,0.00035206607,0.0008706018,0.0058837603,0.0248451],"genre_scores_gemma":[0.9431748,0.00017923178,0.050768808,0.00017415416,0.000068755624,0.00012940298,0.0010034557,0.00039183415,0.0041094976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962316,0.00079898856,0.0001726048,0.0012109311,0.00093490095,0.0006510472],"domain_scores_gemma":[0.9651334,0.016620113,0.0031740272,0.011211769,0.0024454063,0.0014150813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021336367,0.0005866306,0.0011040142,0.0008198934,0.0016127956,0.0031104095,0.0027394786,0.0013400147,0.010568649],"category_scores_gemma":[0.023684828,0.00059012935,0.0012476405,0.0011250902,0.0031882583,0.00944032,0.004344071,0.0027146265,0.0014670332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012339901,0.000504842,0.022313572,0.0011103427,0.0001539897,0.0008265957,0.0019178122,0.2671398,0.04145698,0.43398404,0.013802801,0.21555518],"study_design_scores_gemma":[0.00019123794,0.0004137442,0.005885537,0.00010157461,0.00012332962,0.0009167304,0.00082781556,0.5350999,0.05214598,0.38524354,0.018953891,0.00009672437],"about_ca_topic_score_codex":0.0028622728,"about_ca_topic_score_gemma":0.0025984244,"teacher_disagreement_score":0.010568649,"about_ca_system_score_codex":0.003295901,"about_ca_system_score_gemma":0.002404177,"threshold_uncertainty_score":0.035355628},"labels":[],"label_agreement":null},{"id":"W4389192328","doi":"10.22215/etd/2023-15707","title":"Graph Colouring and Decomposition","year":2023,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Monash University; University of Ottawa","keywords":"Treewidth; Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Discrete mathematics; Pathwidth; Wheel graph; Chromatic scale; Graph; Line graph; Graph power","score_opus":0.01831761318829731,"score_gpt":0.3450516480140816,"score_spread":0.3267340348257843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389192328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06250859,0.0042809797,0.8308876,0.004410475,0.00095968356,0.0001971673,0.0006238649,0.0010365383,0.09509505],"genre_scores_gemma":[0.5832163,0.003960637,0.36857808,0.0023738875,0.00096948486,0.00026192085,0.0013457242,0.0009918472,0.03830216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973386,0.0005719348,0.000116989846,0.0008363671,0.0007083316,0.0004277536],"domain_scores_gemma":[0.992469,0.0032638444,0.0006285051,0.0024444333,0.00074094534,0.00045331605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016672403,0.0012051912,0.000912419,0.0012456907,0.0015904466,0.003832256,0.0016050976,0.0015087023,0.013882737],"category_scores_gemma":[0.010263937,0.0007390766,0.0015684688,0.0016231562,0.0044421647,0.009420622,0.0043458263,0.005635842,0.0026489873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008664865,0.00003915794,0.00042422552,0.00015664447,0.000019048985,0.00004838756,0.00030445197,0.014030131,0.0022359188,0.9377805,0.0070767393,0.037798125],"study_design_scores_gemma":[0.000018544748,0.0000478773,0.00024320498,0.0000639555,0.000023496923,0.00016563231,0.000110826026,0.02537976,0.0014648881,0.94719,0.025272787,0.000019066427],"about_ca_topic_score_codex":0.002332813,"about_ca_topic_score_gemma":0.0020843262,"teacher_disagreement_score":0.013882737,"about_ca_system_score_codex":0.0031858783,"about_ca_system_score_gemma":0.0013740879,"threshold_uncertainty_score":0.04644233},"labels":[],"label_agreement":null},{"id":"W4389224571","doi":"10.1287/moor.2022.0335","title":"Proximity and Flatness Bounds for Linear Integer Optimization","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Polyhedron; Combinatorics; Unimodular matrix; Cutting-plane method; Integer programming; Integer (computer science); Linear programming; Linear programming relaxation; Integer points in convex polyhedra; Hyperplane; Vertex (graph theory); Polytope; Regular polygon; Discrete mathematics; Branch and price; Mathematical optimization; Computer science; Geometry","score_opus":0.13205313635593666,"score_gpt":0.4352795687934838,"score_spread":0.3032264324375471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389224571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014524601,0.004410611,0.94238436,0.0017000122,0.00026382954,0.00011533589,0.00020230113,0.00033024923,0.036068633],"genre_scores_gemma":[0.5450854,0.0069681113,0.42921728,0.0019180471,0.0016084916,0.00065673725,0.00061410054,0.0005535046,0.013378403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99354446,0.002059342,0.00028469224,0.0012552463,0.0021997225,0.0006564231],"domain_scores_gemma":[0.97188705,0.022161318,0.001918435,0.0020463842,0.0011642695,0.00082250417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006735384,0.0025993427,0.0019024343,0.0032207354,0.0017972917,0.0039682365,0.0029088918,0.0014286722,0.011267024],"category_scores_gemma":[0.03834982,0.0011450246,0.0020830452,0.003684177,0.0053272936,0.01429341,0.0063449945,0.0108911395,0.0019451124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026843257,0.00013645651,0.0011571349,0.0006130295,0.00007307217,0.0002327248,0.00060396956,0.10850575,0.003414051,0.8036208,0.0048440895,0.07653056],"study_design_scores_gemma":[0.000027222206,0.00019593298,0.0006566473,0.00017170835,0.00003961257,0.00016245196,0.0001489528,0.2254503,0.0028814815,0.7598311,0.01038638,0.00004827131],"about_ca_topic_score_codex":0.0016683494,"about_ca_topic_score_gemma":0.0011711373,"teacher_disagreement_score":0.011267024,"about_ca_system_score_codex":0.0024239088,"about_ca_system_score_gemma":0.0009988543,"threshold_uncertainty_score":0.03769201},"labels":[],"label_agreement":null},{"id":"W4389363201","doi":"10.48550/arxiv.2312.00979","title":"Recoloring some hereditary graph classes","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Computer science; Geography; Theoretical computer science","score_opus":0.14564447674312617,"score_gpt":0.23506731079044713,"score_spread":0.08942283404732096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389363201","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9380086,0.0001903138,0.03620317,0.0003217746,0.00003234611,0.000032142998,0.00044170715,0.00045387622,0.024316171],"genre_scores_gemma":[0.9863154,0.00012325519,0.008143165,0.00007452045,0.000029667075,0.000029892286,0.00071116013,0.00008437656,0.0044885194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994854,0.00005603407,0.000020412483,0.00019974202,0.00009735019,0.00014109566],"domain_scores_gemma":[0.99836355,0.0005854513,0.0003896227,0.0003250465,0.0001429101,0.00019336675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025019105,0.00026900528,0.00025515744,0.00056250236,0.0009165197,0.00086884695,0.000588723,0.00033363767,0.003788156],"category_scores_gemma":[0.0013998062,0.00023477874,0.0004081071,0.00044653495,0.000877294,0.0011681786,0.00061137433,0.0004730501,0.00021266926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003909285,0.00028140238,0.022363985,0.00030791032,0.000115586285,0.0017967848,0.0015437051,0.03322082,0.047964394,0.80597275,0.0110710645,0.07497066],"study_design_scores_gemma":[0.00017667317,0.0002840795,0.030009566,0.000091466994,0.00020618539,0.0051827417,0.0016964206,0.14940794,0.068826824,0.6714423,0.07256756,0.00010836367],"about_ca_topic_score_codex":0.0027124432,"about_ca_topic_score_gemma":0.0032146438,"teacher_disagreement_score":0.003788156,"about_ca_system_score_codex":0.0010321081,"about_ca_system_score_gemma":0.00039332372,"threshold_uncertainty_score":0.012672603},"labels":[],"label_agreement":null},{"id":"W4389482197","doi":"10.1007/978-3-031-49190-0_9","title":"Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Oracle; Turing machine; Combinatorics; Time complexity; Computer science; Discrete mathematics; Polynomial; Mathematics; Algorithm","score_opus":0.033529423076539416,"score_gpt":0.28663770938035055,"score_spread":0.2531082863038111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389482197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3694569,0.0055404846,0.43407923,0.025318226,0.0008349534,0.00091123796,0.0037577888,0.008137508,0.15196365],"genre_scores_gemma":[0.806249,0.001971669,0.14682883,0.0018049855,0.0014423601,0.0010366159,0.0030126658,0.0024230639,0.03523083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959596,0.0009416434,0.00023051692,0.00090419315,0.0011109136,0.0008530221],"domain_scores_gemma":[0.9698396,0.023294143,0.0011260192,0.0039199856,0.00073226413,0.0010880815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034425033,0.0020235654,0.0027922394,0.0023862545,0.003111328,0.0067326543,0.005276914,0.003463794,0.022705428],"category_scores_gemma":[0.027964443,0.0015687654,0.00415963,0.005385881,0.004704245,0.020105919,0.0055159424,0.012180161,0.002719424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001700282,0.0007509985,0.0018757315,0.00086358277,0.00016651448,0.0002301266,0.0011160771,0.06218412,0.006918915,0.7695247,0.035354346,0.1193145],"study_design_scores_gemma":[0.00018027614,0.00009656318,0.00068972434,0.000084583866,0.00011016004,0.0001870404,0.00018509204,0.11712216,0.0035447483,0.8733964,0.0043495684,0.000053876258],"about_ca_topic_score_codex":0.0016817125,"about_ca_topic_score_gemma":0.003613298,"teacher_disagreement_score":0.022705428,"about_ca_system_score_codex":0.0066693393,"about_ca_system_score_gemma":0.003393231,"threshold_uncertainty_score":0.07595724},"labels":[],"label_agreement":null},{"id":"W4389482199","doi":"10.1007/978-3-031-49190-0_13","title":"Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Parameterized complexity; Combinatorics; Vertex (graph theory); Feedback vertex set; Computer science; Degree (music); Neighbourhood (mathematics); Discrete mathematics; Graph; Pathwidth; Mathematics; Algorithm; Line graph; Physics","score_opus":0.05257799256211758,"score_gpt":0.30604118313786904,"score_spread":0.25346319057575145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389482199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08474698,0.0007541917,0.8870751,0.000929889,0.00019136896,0.0004987059,0.0014068921,0.0048220004,0.019574836],"genre_scores_gemma":[0.22237316,0.00071719935,0.7463583,0.00032756885,0.00015504609,0.00054861646,0.0047683627,0.0021029755,0.022648863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792284,0.00040340587,0.000114430724,0.00066574634,0.0004796666,0.0004139994],"domain_scores_gemma":[0.9925774,0.0029208597,0.00046463317,0.0031333263,0.0005261415,0.00037753413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016407438,0.0018566498,0.0024108745,0.0014205315,0.0022102303,0.0038072239,0.007908365,0.0020587877,0.015332357],"category_scores_gemma":[0.007928447,0.0015271091,0.0022651982,0.005200361,0.001735964,0.0092651155,0.005501841,0.0037937742,0.003403793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012789037,0.00061492436,0.0022676785,0.0009786618,0.00022622039,0.00020606582,0.00078991667,0.3011041,0.013378088,0.22561468,0.047282398,0.4062583],"study_design_scores_gemma":[0.00025380106,0.00009448473,0.000754317,0.00007086433,0.00011871378,0.0002535277,0.0003726459,0.57936054,0.009159933,0.39312688,0.016377997,0.00005635837],"about_ca_topic_score_codex":0.0040746303,"about_ca_topic_score_gemma":0.008442309,"teacher_disagreement_score":0.015332357,"about_ca_system_score_codex":0.004728367,"about_ca_system_score_gemma":0.0035629224,"threshold_uncertainty_score":0.051291883},"labels":[],"label_agreement":null},{"id":"W4389482327","doi":"10.1007/978-3-031-49190-0_14","title":"Sum-of-Local-Effects Data Structures for Separable Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Graph; Separable space; Distance; Mathematics; Computer science; Discrete mathematics; Shortest path problem","score_opus":0.04905899834068726,"score_gpt":0.33177045157629137,"score_spread":0.2827114532356041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389482327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028808672,0.0013184056,0.9167527,0.0009705455,0.00039440976,0.00020028872,0.0036947473,0.016474154,0.031386055],"genre_scores_gemma":[0.38080466,0.0015459555,0.5204834,0.0008647026,0.00042213418,0.00063344714,0.010884306,0.008639716,0.07572161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985759,0.00026171407,0.00018936774,0.00027295572,0.0004938427,0.00020616988],"domain_scores_gemma":[0.9955491,0.0011087514,0.00016096447,0.002470711,0.00050823006,0.00020230655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015398257,0.0011195276,0.0016178956,0.00154941,0.0017575343,0.003493119,0.0032160454,0.0010066346,0.019867033],"category_scores_gemma":[0.0046600215,0.0011256406,0.0018163534,0.0034117056,0.001785745,0.010198093,0.0063707326,0.0037829033,0.007097961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006343684,0.0002285321,0.0009817216,0.000790352,0.00009205668,0.00017422519,0.0007151425,0.010016119,0.0069303913,0.68707305,0.042535778,0.24982834],"study_design_scores_gemma":[0.0000694485,0.000095911426,0.00021538048,0.000114535076,0.00010645931,0.00019047562,0.00015823713,0.021082716,0.015925797,0.9024116,0.05955826,0.000071129674],"about_ca_topic_score_codex":0.001686681,"about_ca_topic_score_gemma":0.0039013156,"teacher_disagreement_score":0.019867033,"about_ca_system_score_codex":0.0016136949,"about_ca_system_score_gemma":0.0016547668,"threshold_uncertainty_score":0.06646186},"labels":[],"label_agreement":null},{"id":"W4389678620","doi":"10.1016/j.disc.2023.113829","title":"Comparability digraphs: An analogue of comparability graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Comparability; Digraph; Mathematics; Lemma (botany); Combinatorics; Comparability graph; Discrete mathematics; Cograph; Graph; Chordal graph; 1-planar graph","score_opus":0.06293062498048756,"score_gpt":0.3512163822837604,"score_spread":0.2882857573032728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389678620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11607804,0.00093673286,0.7054293,0.002859395,0.0007662226,0.00035026795,0.0022472113,0.0008083163,0.17052442],"genre_scores_gemma":[0.7620593,0.0015308892,0.18510681,0.0017565462,0.0007548952,0.00046141088,0.0029025264,0.0005385398,0.044889096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984554,0.00040564127,0.00010574329,0.0005853994,0.00027717653,0.00017062237],"domain_scores_gemma":[0.9941148,0.0025695614,0.0008646532,0.00097425154,0.0007801656,0.00069658784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001091322,0.00074130704,0.00067631545,0.0024492189,0.0019857509,0.00423745,0.0018512963,0.0014850434,0.017904637],"category_scores_gemma":[0.0053179706,0.0006918467,0.00112171,0.0030420187,0.0031354036,0.009394094,0.0020371675,0.0031650325,0.0013859953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024270079,0.000027456734,0.00013715962,0.000052355117,0.000007810436,0.00009893115,0.00014643894,0.00071967015,0.0005976674,0.9916619,0.0008710364,0.005655386],"study_design_scores_gemma":[0.00001687666,0.000016181597,0.00017993223,0.00001413991,0.0000123293075,0.00016903393,0.00009609601,0.002886235,0.00054620573,0.9848668,0.011186341,0.000009793551],"about_ca_topic_score_codex":0.0016347427,"about_ca_topic_score_gemma":0.0013792181,"teacher_disagreement_score":0.017904637,"about_ca_system_score_codex":0.0015277257,"about_ca_system_score_gemma":0.00085302786,"threshold_uncertainty_score":0.059897006},"labels":[],"label_agreement":null},{"id":"W4389899308","doi":"10.1016/j.ejc.2023.103908","title":"Reconfiguration of vertex colouring and forbidden induced subgraphs","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Induced subgraph; Bound graph; Graph power; Discrete mathematics; Line graph","score_opus":0.03411597351799357,"score_gpt":0.2729934213049364,"score_spread":0.23887744778694286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389899308","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8955769,0.00021576411,0.065957256,0.00026781435,0.00011279594,0.00007461552,0.00047936884,0.0010300807,0.036285434],"genre_scores_gemma":[0.9783588,0.00011602131,0.014828882,0.00007226469,0.000028662673,0.00004024472,0.0006174575,0.00021590323,0.0057217176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993129,0.00011408319,0.000034819965,0.00019800794,0.00010692388,0.00023322518],"domain_scores_gemma":[0.9972076,0.00096219947,0.00043282995,0.0007424205,0.00018564875,0.00046933113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002402064,0.0003940578,0.0004854477,0.0008002941,0.0008667256,0.0015597793,0.0011755516,0.0007089346,0.008319822],"category_scores_gemma":[0.0023206782,0.0004630165,0.00058440753,0.0010316544,0.00092637824,0.0013974706,0.0009627476,0.0007654403,0.00075524795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002714267,0.0007871568,0.013517788,0.00058701815,0.00017008766,0.0051904987,0.0017563307,0.13851954,0.22079057,0.45002267,0.011543551,0.15440062],"study_design_scores_gemma":[0.000242315,0.00030575975,0.014286799,0.00006795318,0.00014626898,0.002808699,0.00095121557,0.20997873,0.064322524,0.6875893,0.019190602,0.00010992558],"about_ca_topic_score_codex":0.001519496,"about_ca_topic_score_gemma":0.0017080259,"teacher_disagreement_score":0.008319822,"about_ca_system_score_codex":0.0007820607,"about_ca_system_score_gemma":0.0004492465,"threshold_uncertainty_score":0.027832568},"labels":[],"label_agreement":null},{"id":"W4390018095","doi":"10.1137/1.9781611977806.ch10","title":"Chapter 10: Normal Cones","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Cone (formal languages); Combinatorics; Dual cone and polar cone; Convex cone; Mathematics; Regular polygon; Geometry; Convex set; Convex optimization; Algorithm","score_opus":0.10414404048757395,"score_gpt":0.27998350114644727,"score_spread":0.17583946065887332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390018095","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021016106,0.020658853,0.039115727,0.00289926,0.0034422013,0.000074163174,0.000707171,0.00032309393,0.93067795],"genre_scores_gemma":[0.04485158,0.047572806,0.032768823,0.0023919533,0.0047725257,0.00021442607,0.00207429,0.0009719509,0.8643817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994735,0.00006017392,0.000018959066,0.00009090038,0.0003112069,0.000045249148],"domain_scores_gemma":[0.9996152,0.00009462901,0.00001732372,0.000033194407,0.00020092772,0.000038725306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040952335,0.000962197,0.0004835639,0.0013922495,0.0013370475,0.0034502444,0.00079745875,0.0006366701,0.061698593],"category_scores_gemma":[0.0010349158,0.00036039227,0.0004972488,0.0015225398,0.0013315515,0.0037164383,0.0011293198,0.0032338046,0.018369913],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001405576,0.000020236628,0.000047535155,0.00016627894,0.0000029465284,0.000042833668,0.00014305653,0.00054994016,0.0008018463,0.7913047,0.14809707,0.058809433],"study_design_scores_gemma":[0.000002981611,0.000012181742,0.00008354845,0.0001506107,0.0000026413518,0.00014706793,0.00007424422,0.0005449935,0.00042501837,0.25365907,0.74488777,0.000009827131],"about_ca_topic_score_codex":0.0025118934,"about_ca_topic_score_gemma":0.002459228,"teacher_disagreement_score":0.061698593,"about_ca_system_score_codex":0.0017489535,"about_ca_system_score_gemma":0.0013207751,"threshold_uncertainty_score":0.2064023},"labels":[],"label_agreement":null},{"id":"W4390075896","doi":"10.5840/cpsem20227","title":"Intentionally Going Through Percolations of Mazes","year":2022,"lang":"en","type":"book-chapter","venue":"Semiotics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.041488461351376994,"score_gpt":0.29939055137865433,"score_spread":0.2579020900272773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390075896","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054268096,0.0025882057,0.33334896,0.006019621,0.00093577785,0.0000870502,0.00025252608,0.0011479636,0.60135174],"genre_scores_gemma":[0.7680498,0.0027221132,0.088127986,0.0010048697,0.00031705457,0.00020892371,0.00021361749,0.0014363137,0.1379194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903274,0.00042358882,0.000028594059,0.00017907438,0.00022167528,0.00011442577],"domain_scores_gemma":[0.99741024,0.0015190372,0.00012231062,0.00055859715,0.00020305291,0.0001867321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007119878,0.0006589699,0.0005477739,0.0014987106,0.003001642,0.0058314293,0.0009501771,0.0016376995,0.013971225],"category_scores_gemma":[0.006624455,0.00077085604,0.00083557784,0.0012197485,0.0074667586,0.011681608,0.0040618232,0.003510002,0.0028082926],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005796305,0.0000031651005,0.000045423167,0.00002103518,0.0000027552499,0.00004228409,0.00075710553,0.00051175436,0.00026787902,0.993404,0.0020017375,0.0029371446],"study_design_scores_gemma":[0.00000293084,0.000004478204,0.0000406637,0.000028938577,0.0000038960593,0.00010241844,0.00053042173,0.0014015458,0.00028130726,0.9682444,0.029353067,0.0000059978456],"about_ca_topic_score_codex":0.00072558323,"about_ca_topic_score_gemma":0.0014653954,"teacher_disagreement_score":0.013971225,"about_ca_system_score_codex":0.0011234574,"about_ca_system_score_gemma":0.00067288935,"threshold_uncertainty_score":0.046738446},"labels":[],"label_agreement":null},{"id":"W4390098013","doi":"10.1109/focs57990.2023.00109","title":"Testing Graph Properties with the Container Method","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Induced subgraph; Mathematics; Clique; Split graph; Graph; Discrete mathematics; Property testing; Induced subgraph isomorphism problem; Chordal graph; Line graph; 1-planar graph; Vertex (graph theory)","score_opus":0.08386699813099939,"score_gpt":0.32629457350167634,"score_spread":0.24242757537067694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390098013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1442901,0.00026259446,0.84517324,0.0010107659,0.00007999145,0.00023076536,0.0006414558,0.0038650404,0.0044459663],"genre_scores_gemma":[0.6340319,0.00015007853,0.36149102,0.0003844268,0.000077854376,0.00055394263,0.0014457868,0.0005742962,0.001290626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99325514,0.0024835141,0.00032274835,0.0016615111,0.0015557449,0.0007213377],"domain_scores_gemma":[0.9574143,0.025567057,0.003408856,0.010952799,0.0014499816,0.0012070333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048064305,0.0015845727,0.0019490931,0.0016637587,0.0011304935,0.002050959,0.0040206313,0.0017714713,0.003760653],"category_scores_gemma":[0.03110351,0.0010905198,0.0027349866,0.0016988752,0.0033624265,0.007655522,0.0040671583,0.003759605,0.0009113073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033869348,0.0013190851,0.038932204,0.000563579,0.00052009104,0.00093812926,0.0006093916,0.4646941,0.05076466,0.19255982,0.012970323,0.23274173],"study_design_scores_gemma":[0.00009623989,0.00029898706,0.0012174573,0.000023400551,0.000044236484,0.0002158499,0.0000738348,0.92179,0.009065145,0.06592862,0.0012089389,0.00003735587],"about_ca_topic_score_codex":0.0037197163,"about_ca_topic_score_gemma":0.004526768,"teacher_disagreement_score":0.0048064305,"about_ca_system_score_codex":0.0021672805,"about_ca_system_score_gemma":0.0031929382,"threshold_uncertainty_score":0.025419116},"labels":[],"label_agreement":null},{"id":"W4390214413","doi":"10.48550/arxiv.2312.14295","title":"On Separating Path and Tree Systems in Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; National Science Foundation","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Path (computing); Tree (set theory); Graph; Pathwidth; Discrete mathematics; Computer science; Line graph","score_opus":0.10675457928508525,"score_gpt":0.23460405408787643,"score_spread":0.12784947480279119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390214413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35349378,0.01179989,0.5540333,0.003455956,0.0004965424,0.0001929884,0.0016135314,0.000653698,0.07426043],"genre_scores_gemma":[0.8090628,0.0071505764,0.16840516,0.00088739884,0.0012459288,0.00035275705,0.001786061,0.00038548996,0.010723855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986504,0.0003747827,0.00007365383,0.00037771818,0.00030202905,0.0002214884],"domain_scores_gemma":[0.99298966,0.004975577,0.0006975675,0.00049275975,0.0004463259,0.0003980877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013097273,0.00087178464,0.00092874933,0.0030071896,0.0019017798,0.0024584434,0.0011206901,0.0011959078,0.0075464807],"category_scores_gemma":[0.0074993926,0.00047800282,0.0007978981,0.004823485,0.0038373475,0.010349977,0.0033322764,0.002200736,0.000838342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052793228,0.000026251144,0.00075971475,0.00015370571,0.00001535518,0.00008564808,0.0004781268,0.009263989,0.0017715538,0.9695394,0.003019838,0.014833547],"study_design_scores_gemma":[0.000011957494,0.000026302136,0.00040666954,0.000021419404,0.000009518374,0.0001216363,0.00011027337,0.016264075,0.00045771647,0.9756581,0.0068980404,0.000014305842],"about_ca_topic_score_codex":0.0020367098,"about_ca_topic_score_gemma":0.0012677768,"teacher_disagreement_score":0.0075464807,"about_ca_system_score_codex":0.0016781803,"about_ca_system_score_gemma":0.0006067771,"threshold_uncertainty_score":0.025245488},"labels":[],"label_agreement":null},{"id":"W4390238367","doi":"10.1016/j.dam.2023.12.003","title":"Induced forests in some distance-regular graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Regina; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Upper and lower bounds; Order (exchange); Graph; Discrete mathematics","score_opus":0.028890506300846216,"score_gpt":0.29864886284332104,"score_spread":0.2697583565424748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390238367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8666021,0.00081030064,0.09333898,0.0011414969,0.00009745679,0.000073426454,0.0008711698,0.0002739668,0.03679118],"genre_scores_gemma":[0.9529123,0.00057370344,0.030043652,0.00031410746,0.0001347732,0.00009250371,0.0009379503,0.00009741431,0.0148937395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994473,0.00010347785,0.000032064807,0.0001651825,0.00015584462,0.00009617787],"domain_scores_gemma":[0.99628687,0.0020141557,0.0005288948,0.00022694362,0.00036266385,0.00058044674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047079503,0.00036163058,0.00065384206,0.0015987251,0.0014870132,0.001954355,0.0010991744,0.00075816194,0.0039524683],"category_scores_gemma":[0.0029344803,0.0005872656,0.00066903635,0.001684472,0.0010508867,0.002461468,0.00093160354,0.0017503285,0.00048314023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024322106,0.00017821386,0.0029945446,0.00019413847,0.000051954026,0.0006595759,0.0010480605,0.00681001,0.008528683,0.9595443,0.0036052668,0.016141953],"study_design_scores_gemma":[0.00007056959,0.000040770436,0.0026304126,0.000022987697,0.000049165687,0.00082923274,0.00033750583,0.030289888,0.002459049,0.95873123,0.00451807,0.000020919922],"about_ca_topic_score_codex":0.0010735067,"about_ca_topic_score_gemma":0.0017572849,"teacher_disagreement_score":0.0039524683,"about_ca_system_score_codex":0.0008926182,"about_ca_system_score_gemma":0.00040918638,"threshold_uncertainty_score":0.013222337},"labels":[],"label_agreement":null},{"id":"W4390545157","doi":"10.1007/978-3-031-30488-0_8","title":"An Addendum to Trees","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Addendum; Notation; Binary tree; Simple (philosophy); Combinatorics; Mathematics; Conjecture; Weight-balanced tree; Graph theory; Binary number; Function (biology); Graph; Binary expression tree; Discrete mathematics; Computer science; Arithmetic; Binary search tree","score_opus":0.02637404452301958,"score_gpt":0.2987445835412294,"score_spread":0.27237053901820985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390545157","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022504318,0.028459508,0.055361487,0.0074760965,0.050346207,0.00010630823,0.001869559,0.0013887183,0.8527417],"genre_scores_gemma":[0.0074949656,0.01202413,0.012814428,0.001357684,0.009021977,0.00007160755,0.0012341681,0.0011285082,0.9548526],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997341,0.00003059123,0.00001177666,0.00005679594,0.00013855979,0.000028098419],"domain_scores_gemma":[0.99949,0.00014795018,0.000017809838,0.00008730784,0.00015297816,0.00010397768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021073833,0.0007585829,0.00075621373,0.0014577967,0.0011428065,0.002808964,0.000924279,0.0007302542,0.12699196],"category_scores_gemma":[0.0009014987,0.00047536465,0.00064355804,0.0029373681,0.00063606235,0.003118542,0.0016781577,0.0026007548,0.06814872],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027409902,0.00003712073,0.000048636466,0.00024688354,0.000006274635,0.000060334492,0.00012670802,0.001095187,0.0014016323,0.11227083,0.6257662,0.25891268],"study_design_scores_gemma":[0.0000021108394,0.000009699977,0.00006305136,0.000041876952,0.000003636007,0.000056777273,0.000019560623,0.00022400833,0.00016308333,0.02234449,0.9770675,0.000004254508],"about_ca_topic_score_codex":0.0011036531,"about_ca_topic_score_gemma":0.0032252073,"teacher_disagreement_score":0.12699196,"about_ca_system_score_codex":0.0010466285,"about_ca_system_score_gemma":0.00093701587,"threshold_uncertainty_score":0.42483044},"labels":[],"label_agreement":null},{"id":"W4390575946","doi":"10.1137/1.9781611977912.46","title":"Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Random graph; Chordal graph; Indifference graph; Random regular graph; Mathematics; Combinatorics; Pathwidth; Maximal independent set; Embedding; 1-planar graph; Discrete mathematics; Logarithm; Graph; Line graph; Computer science","score_opus":0.045822696444820246,"score_gpt":0.289255121712687,"score_spread":0.2434324252678668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390575946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4408288,0.007190517,0.47748303,0.011769512,0.0005349075,0.00018390604,0.0028216306,0.0020278902,0.057159845],"genre_scores_gemma":[0.93183494,0.0041213147,0.04017551,0.0013052367,0.00048698537,0.000364053,0.0017261985,0.00058448606,0.019401213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991598,0.00021477892,0.000025887757,0.00029120286,0.00021447577,0.00009383157],"domain_scores_gemma":[0.99121547,0.0061872904,0.0007201974,0.00122859,0.00027389402,0.00037455035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001419103,0.0006881649,0.00095628074,0.0008662484,0.0008707768,0.0026304203,0.0016638079,0.0017673966,0.0057089105],"category_scores_gemma":[0.0131643545,0.00060391106,0.00076053507,0.0010316004,0.0024441993,0.0060409303,0.0012033846,0.0023022473,0.0011637255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047999347,0.00012218047,0.010738116,0.00067198684,0.00016694645,0.00053219614,0.00046350466,0.104182616,0.0072295642,0.74333286,0.032310195,0.099769816],"study_design_scores_gemma":[0.000039545066,0.00007639206,0.0038493455,0.00008329213,0.000048688045,0.0007867953,0.000103351544,0.1337473,0.003303774,0.8470246,0.010900235,0.0000366517],"about_ca_topic_score_codex":0.00053867884,"about_ca_topic_score_gemma":0.00069729576,"teacher_disagreement_score":0.0057089105,"about_ca_system_score_codex":0.0013863517,"about_ca_system_score_gemma":0.0003557812,"threshold_uncertainty_score":0.019098163},"labels":[],"label_agreement":null},{"id":"W4390681216","doi":"10.1007/978-3-031-49275-4_1","title":"Cops and Robbers on 1-Planar Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Manitoba","funders":"","keywords":"Planar graph; Planar; Pathwidth; Combinatorics; 1-planar graph; Outerplanar graph; Chordal graph; Planar straight-line graph; Computer science; Indifference graph; Mathematics; Book embedding; Graph; Discrete mathematics; Line graph; Computer graphics (images)","score_opus":0.024908045172357517,"score_gpt":0.2772720050297431,"score_spread":0.2523639598573856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390681216","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12646778,0.0093023125,0.16815361,0.003316089,0.0012950039,0.00015096436,0.00062091846,0.00058581703,0.6901076],"genre_scores_gemma":[0.5457892,0.0107456595,0.06475083,0.00079482415,0.0015207059,0.00033996042,0.0010378866,0.0007351728,0.3742857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961096,0.00008676656,0.000014824683,0.00008815664,0.000112907175,0.00008635694],"domain_scores_gemma":[0.99947923,0.0002939067,0.000059964423,0.00006048109,0.0000526699,0.000053846317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023831279,0.0012211156,0.0010878154,0.0019817576,0.0018952886,0.0023056737,0.0014336844,0.0011970418,0.020105626],"category_scores_gemma":[0.0016694074,0.00096430327,0.0010322625,0.002454634,0.0020832305,0.004833484,0.002248273,0.002831229,0.0033535697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020174033,0.0000151433815,0.000048896716,0.00011350628,0.0000057725097,0.00006681394,0.00021402372,0.0027353955,0.0005094052,0.9708458,0.007935526,0.017489478],"study_design_scores_gemma":[0.0000064806504,0.000010296549,0.00014860899,0.000028017952,0.000006638284,0.000107677,0.000082782644,0.0028990812,0.00022197966,0.9806003,0.015880005,0.0000081296885],"about_ca_topic_score_codex":0.0015007221,"about_ca_topic_score_gemma":0.0020875658,"teacher_disagreement_score":0.020105626,"about_ca_system_score_codex":0.0011474447,"about_ca_system_score_gemma":0.00037579436,"threshold_uncertainty_score":0.06726003},"labels":[],"label_agreement":null},{"id":"W4390761431","doi":"10.1007/978-3-031-49272-3_19","title":"Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Interval graph; Mathematics; Conjecture; Line graph; Intersection graph; Pathwidth; Discrete mathematics; Block graph; Graph; Complement (music); Interval (graph theory)","score_opus":0.03456102144668092,"score_gpt":0.3022580983892588,"score_spread":0.2676970769425779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390761431","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2561194,0.006764137,0.16026306,0.002459076,0.0006320672,0.000069798785,0.0005039923,0.0002567552,0.5729317],"genre_scores_gemma":[0.9058899,0.004383501,0.031046454,0.00026852044,0.00032448678,0.000057344896,0.00035778817,0.00010404397,0.05756781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981946,0.00005012518,0.000008689061,0.00004006574,0.000053755546,0.000027877428],"domain_scores_gemma":[0.99937195,0.00038545846,0.000057806003,0.000059341397,0.000077942714,0.000047537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003181457,0.00027798963,0.00040402287,0.00097383925,0.0010210226,0.0027209476,0.00042985912,0.0005320038,0.007255785],"category_scores_gemma":[0.001509267,0.00029742488,0.00037251995,0.0019037294,0.0018850862,0.0043662586,0.0007148812,0.0014411693,0.00070661295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021092661,0.000006718712,0.00006380314,0.000020057507,0.0000019373745,0.00002394275,0.00012774406,0.0009144536,0.00016928795,0.98723805,0.0013667784,0.010046225],"study_design_scores_gemma":[0.00000576915,0.000008075495,0.00008715757,0.0000114927525,0.0000033739332,0.000042844953,0.00011921914,0.0014999106,0.00019787136,0.98799974,0.010020277,0.0000041518533],"about_ca_topic_score_codex":0.0014028436,"about_ca_topic_score_gemma":0.001616129,"teacher_disagreement_score":0.007255785,"about_ca_system_score_codex":0.00076081813,"about_ca_system_score_gemma":0.00046495858,"threshold_uncertainty_score":0.024273038},"labels":[],"label_agreement":null},{"id":"W4390923673","doi":"10.22457/apam.v28n1a02913","title":"Common Minimal Common Neighborhood Dominating Symmetric n-Sigraphs","year":2023,"lang":"en","type":"article","venue":"Annals of Pure and Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.057692848681984356,"score_gpt":0.3369124050235708,"score_spread":0.2792195563415864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390923673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6758232,0.0003534228,0.25745746,0.00031093942,0.000088726556,0.0002193822,0.00083494605,0.00033925124,0.06457271],"genre_scores_gemma":[0.9483404,0.00020519322,0.03866718,0.00010605158,0.00003616919,0.00010292526,0.0011372478,0.000054344662,0.01135045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994848,0.00006514969,0.000031377138,0.00021692492,0.00012150631,0.0000802675],"domain_scores_gemma":[0.9993253,0.0001576214,0.00007397703,0.00011075369,0.00023717643,0.000095251926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023966856,0.00035464254,0.00044455472,0.00076519244,0.0011086024,0.0008106348,0.0007122016,0.00035684695,0.0039165514],"category_scores_gemma":[0.00086182606,0.00016224649,0.00044674185,0.0005597936,0.0008866455,0.0016316312,0.0010192809,0.00044724575,0.00041315638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041789305,0.00018682044,0.008355063,0.0005158704,0.00012211915,0.0016983588,0.0018292976,0.016545275,0.06124008,0.7885854,0.0045843357,0.11591949],"study_design_scores_gemma":[0.000060279253,0.00031127638,0.009492506,0.000098690994,0.00018634781,0.0026294685,0.0017855122,0.07850322,0.047728747,0.8027496,0.056380715,0.000073648545],"about_ca_topic_score_codex":0.0020317845,"about_ca_topic_score_gemma":0.003454152,"teacher_disagreement_score":0.0039165514,"about_ca_system_score_codex":0.0008362931,"about_ca_system_score_gemma":0.0006893664,"threshold_uncertainty_score":0.013102233},"labels":[],"label_agreement":null},{"id":"W4391123222","doi":"10.1016/j.dam.2024.01.017","title":"A note on the minimum size of matching-saturated graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Xi’an Jiaotong University; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Graph; Complement (music); Matching (statistics); Discrete mathematics; Statistics","score_opus":0.018700145839186038,"score_gpt":0.2922533596073705,"score_spread":0.2735532137681844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391123222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19898625,0.03169816,0.5107878,0.06165336,0.010636497,0.00036443063,0.006094814,0.0022300088,0.17754877],"genre_scores_gemma":[0.7447968,0.017159546,0.18063305,0.007731248,0.016704831,0.0007181343,0.0029293383,0.0019884927,0.02733845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619234,0.0009937042,0.00024476112,0.0012548015,0.000878634,0.0004357783],"domain_scores_gemma":[0.9471391,0.044413995,0.0011302584,0.004263231,0.0015145178,0.0015389051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042299405,0.001702554,0.0030502237,0.0029681313,0.0021893815,0.0041506817,0.0050535714,0.0035541872,0.012144996],"category_scores_gemma":[0.03246711,0.0014500252,0.0029713789,0.004818251,0.0043534404,0.01633321,0.0047164685,0.009216321,0.0016956207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001627994,0.00023237207,0.0027705024,0.0020019512,0.0002742056,0.00060439686,0.0006995093,0.029524177,0.022879545,0.80408347,0.05812051,0.077181436],"study_design_scores_gemma":[0.000101728176,0.00009671598,0.0009827443,0.00009032132,0.00010984229,0.0002523826,0.000111024674,0.02305819,0.00350774,0.95902973,0.012608155,0.00005138791],"about_ca_topic_score_codex":0.00149041,"about_ca_topic_score_gemma":0.0015611657,"teacher_disagreement_score":0.012144996,"about_ca_system_score_codex":0.00296386,"about_ca_system_score_gemma":0.0015123736,"threshold_uncertainty_score":0.04062903},"labels":[],"label_agreement":null},{"id":"W4391127430","doi":"10.61091/ars157-11","title":"Independent Fixed Connected Geodetic Number of a Graph","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Combinatorics; Geodesy; Geography","score_opus":0.018683842477843642,"score_gpt":0.2954436813489655,"score_spread":0.2767598388711218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7618943,0.0007809824,0.17588122,0.0005658133,0.0000917118,0.00009804751,0.00077987456,0.0004513996,0.05945664],"genre_scores_gemma":[0.97215414,0.00033817664,0.021679249,0.000066692046,0.000050588733,0.00009844373,0.00045423218,0.0000699456,0.0050884327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994211,0.00011287593,0.000020178413,0.0001829793,0.00015233131,0.000110556626],"domain_scores_gemma":[0.99786025,0.0010473668,0.0003315331,0.0002875716,0.00020079201,0.00027243904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039198424,0.0005304671,0.0005442571,0.002480453,0.0012499891,0.0016156335,0.0010349719,0.0007576232,0.00597333],"category_scores_gemma":[0.0028423136,0.00036725678,0.0005411892,0.0016296097,0.0020463646,0.002499879,0.0011750797,0.0011354354,0.00044971696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022737478,0.00004420364,0.003749678,0.00020012053,0.000051160227,0.00032184095,0.00039956698,0.023807567,0.017042939,0.9327245,0.0025572556,0.01887375],"study_design_scores_gemma":[0.000062385705,0.00014552026,0.0076230397,0.000089607296,0.000089785906,0.0012423331,0.00044921777,0.108566016,0.01608167,0.8482038,0.017342929,0.00010379542],"about_ca_topic_score_codex":0.0007550026,"about_ca_topic_score_gemma":0.0010393491,"teacher_disagreement_score":0.00597333,"about_ca_system_score_codex":0.0012105688,"about_ca_system_score_gemma":0.0005797217,"threshold_uncertainty_score":0.019982815},"labels":[],"label_agreement":null},{"id":"W4391127506","doi":"10.61091/ars157-12","title":"Broadcast Domination in Line Graphs of Trees","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Line (geometry); Combinatorics; Geometry","score_opus":0.021494279347316576,"score_gpt":0.30032992707406947,"score_spread":0.2788356477267529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73289067,0.0009476131,0.23698491,0.0006103639,0.000027007882,0.00013789207,0.000967344,0.0010321942,0.026402047],"genre_scores_gemma":[0.9510737,0.00044473074,0.04189952,0.00018240725,0.000048588547,0.00014849956,0.00082978205,0.00009119967,0.0052814623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992287,0.00015176725,0.000038049395,0.00021405838,0.00016133754,0.00020614456],"domain_scores_gemma":[0.9954632,0.002351991,0.0008531802,0.00036213826,0.0005666433,0.00040278205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037174232,0.00031954705,0.00048862945,0.0009039074,0.00092200626,0.0013776951,0.0007852,0.000518642,0.0030741917],"category_scores_gemma":[0.0037040224,0.00033492615,0.00031983416,0.0010760906,0.0010006736,0.0016970929,0.0010127269,0.00079300447,0.00038752725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001512373,0.00025559508,0.012583247,0.00080754556,0.00015588748,0.0012954875,0.0026993854,0.1790357,0.09688885,0.5477565,0.014364545,0.14264491],"study_design_scores_gemma":[0.00024066647,0.0004947965,0.008699984,0.00012276319,0.0001373428,0.002398279,0.0015082104,0.5240645,0.031245632,0.38887066,0.04211551,0.000101681995],"about_ca_topic_score_codex":0.0034202358,"about_ca_topic_score_gemma":0.0036856635,"teacher_disagreement_score":0.0034202358,"about_ca_system_score_codex":0.0016353724,"about_ca_system_score_gemma":0.0004553823,"threshold_uncertainty_score":0.011865497},"labels":[],"label_agreement":null},{"id":"W4391127510","doi":"10.61091/ars157-13","title":"Extremal Regular Graphs of Given Chromatic Number","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.019419569842584146,"score_gpt":0.28633348463248803,"score_spread":0.2669139147899039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8688877,0.00024761131,0.075755574,0.0006117669,0.00006640413,0.00004118214,0.00047595287,0.00037327022,0.05354052],"genre_scores_gemma":[0.9757947,0.00010993702,0.018702734,0.00009432935,0.000027474138,0.000028899001,0.00025792356,0.00007140046,0.0049126456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965894,0.00008271102,0.000013282276,0.00010218115,0.000057067362,0.00008582805],"domain_scores_gemma":[0.9989371,0.00034226722,0.00023945568,0.00016206568,0.0001508728,0.00016826214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027543821,0.00032244297,0.00027535236,0.0009785785,0.00080153765,0.00128259,0.0006270231,0.0005439444,0.0045401533],"category_scores_gemma":[0.0013075928,0.00026041624,0.00022848118,0.00063297764,0.0011769336,0.0013212105,0.000762884,0.0008171943,0.0002972049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021107057,0.00005014939,0.0025017955,0.000110702655,0.00002756548,0.00042609565,0.00029874928,0.013728679,0.022897458,0.94616807,0.0021699565,0.011409601],"study_design_scores_gemma":[0.00004732978,0.000101617414,0.005927357,0.00005532763,0.000056095672,0.0010267871,0.00090838695,0.10003847,0.016038248,0.8618273,0.013903992,0.0000691348],"about_ca_topic_score_codex":0.00050867285,"about_ca_topic_score_gemma":0.0012766204,"teacher_disagreement_score":0.0045401533,"about_ca_system_score_codex":0.0008728012,"about_ca_system_score_gemma":0.00023279423,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4391148150","doi":"10.55016/ojs/cdm.v18i2.73457","title":"On Colouring Oriented Graphs of Large Girth","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Discrete mathematics","score_opus":0.016449777144991736,"score_gpt":0.3373477100802734,"score_spread":0.3208979329352817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4522709,0.0010689475,0.4891412,0.0013338424,0.00019934766,0.00012357197,0.00027136345,0.00063064444,0.05496012],"genre_scores_gemma":[0.88583225,0.0016488099,0.097795255,0.0006351865,0.00027023195,0.00017565304,0.0006017044,0.00029496633,0.0127459625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991542,0.00017841785,0.00002771784,0.00026876264,0.00018267294,0.00018816629],"domain_scores_gemma":[0.99386567,0.0038377324,0.00078843033,0.000752389,0.00028630137,0.00046943972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007543086,0.0009621763,0.0004603173,0.0011135378,0.0012254704,0.0015503375,0.0011858592,0.0008471442,0.004417642],"category_scores_gemma":[0.0058664368,0.000535957,0.0008472359,0.0013408037,0.004026811,0.0034338115,0.0032797281,0.0019543942,0.000849433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001725555,0.00010748468,0.0032330917,0.00024300112,0.000039989427,0.0003640603,0.00091941876,0.033491585,0.013769971,0.9139594,0.003344066,0.03035543],"study_design_scores_gemma":[0.00004722326,0.00010245157,0.0014082398,0.000056543104,0.000046530873,0.00036366947,0.00024500658,0.052320875,0.0060103666,0.9298055,0.009550821,0.00004270874],"about_ca_topic_score_codex":0.0023155017,"about_ca_topic_score_gemma":0.0024288266,"teacher_disagreement_score":0.004417642,"about_ca_system_score_codex":0.0016809594,"about_ca_system_score_gemma":0.00069709175,"threshold_uncertainty_score":0.014778435},"labels":[],"label_agreement":null},{"id":"W4391148179","doi":"10.55016/ojs/cdm.v18i2.74004","title":"Structural theory of trees I. Branching and condensations of trees","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Branching (polymer chemistry); Mathematics; Combinatorics; Tree (set theory); Chemistry","score_opus":0.02636778410779442,"score_gpt":0.3287260191071142,"score_spread":0.30235823499931974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071910195,0.030066084,0.747219,0.0046532536,0.00079050893,0.00012672349,0.0011181022,0.00050385756,0.14361227],"genre_scores_gemma":[0.7636861,0.018638156,0.18941891,0.0015993797,0.0016263766,0.00026943602,0.0011725178,0.0002258568,0.023363248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919254,0.00023886816,0.000046621586,0.00019501094,0.00023471317,0.00009229744],"domain_scores_gemma":[0.999059,0.00045261817,0.00014085561,0.00012735164,0.00012259041,0.00009761474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000737527,0.00045668424,0.000430313,0.0013120095,0.0010566143,0.0026082748,0.00081288855,0.0010305052,0.00419854],"category_scores_gemma":[0.0020390956,0.00041107088,0.0008550924,0.0021413167,0.0052912226,0.0048800954,0.0013828719,0.0020388386,0.0010658564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055658134,0.000004281986,0.00009311464,0.000056525703,0.0000033459578,0.000021765432,0.00021993568,0.0009905488,0.00096643466,0.99355316,0.0006907278,0.0033946198],"study_design_scores_gemma":[0.000005318385,0.000020211826,0.00017820766,0.000043584663,0.0000055849955,0.000107319494,0.00011492791,0.0034831974,0.0007257682,0.9721453,0.023161553,0.000009069745],"about_ca_topic_score_codex":0.0009344777,"about_ca_topic_score_gemma":0.00073232816,"teacher_disagreement_score":0.00419854,"about_ca_system_score_codex":0.0018987366,"about_ca_system_score_gemma":0.0006267635,"threshold_uncertainty_score":0.0140455365},"labels":[],"label_agreement":null},{"id":"W4391294907","doi":"10.1016/j.dam.2024.01.014","title":"The <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e20\" altimg=\"si5.svg\"> <mml:mi>q</mml:mi> </mml:math> -analogue of zero forcing for certain families of graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Manitoba; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Mathematics; Scalable Vector Graphics; Zero (linguistics); Combinatorics; Forcing (mathematics); Algorithm; Discrete mathematics; Mathematical analysis; Computer science; World Wide Web","score_opus":0.02191222765559496,"score_gpt":0.275700517625191,"score_spread":0.253788289969596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391294907","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010882873,0.00047844878,0.23578909,0.0073549366,0.0017696976,0.00008816951,0.0052933902,0.0045524104,0.73379093],"genre_scores_gemma":[0.396506,0.0018024474,0.15375361,0.0059838383,0.0020867211,0.0004276817,0.010634928,0.01312855,0.41567618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942774,0.0001538058,0.0000389129,0.0001576344,0.00015933791,0.000062574676],"domain_scores_gemma":[0.998264,0.0007509955,0.0001012525,0.00041526213,0.00034167932,0.00012687077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071396545,0.00034134387,0.0005012061,0.0010772444,0.0013263677,0.0032109458,0.0009483691,0.0009826673,0.13543288],"category_scores_gemma":[0.0029001117,0.00042604335,0.00078037195,0.0012449399,0.0018594797,0.00500467,0.0013952206,0.0024347317,0.03035011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003294385,0.000013836766,0.000096626274,0.0001059124,0.000003663627,0.00007357757,0.00026399645,0.00019549635,0.0013048598,0.911444,0.07425657,0.0122085465],"study_design_scores_gemma":[0.000035363842,0.000019852308,0.0006422806,0.00006250527,0.000007518411,0.00045507785,0.00014323505,0.0028896169,0.0035057466,0.63044566,0.36174956,0.000043595952],"about_ca_topic_score_codex":0.0017909808,"about_ca_topic_score_gemma":0.001749941,"teacher_disagreement_score":0.13543288,"about_ca_system_score_codex":0.0012971133,"about_ca_system_score_gemma":0.00054701685,"threshold_uncertainty_score":0.45306814},"labels":[],"label_agreement":null},{"id":"W4391361420","doi":"10.18280/mmep.110112","title":"Dominance Parameters in Prism Graphs: A Comparative Study of Minimum Dominating Sets","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominance (genetics); Prism; Mathematics; Combinatorics; Computer science; Physics; Biology; Optics; Genetics","score_opus":0.04892220258389337,"score_gpt":0.29323350337982174,"score_spread":0.24431130079592836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391361420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31789958,0.019700967,0.58358043,0.0021358526,0.00041881463,0.00050876226,0.0014554558,0.00066190364,0.073638305],"genre_scores_gemma":[0.8866903,0.008958025,0.098381944,0.00032841048,0.00019935732,0.00019188908,0.00078966585,0.00016150285,0.0042990013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574655,0.001561183,0.00024580644,0.0007200053,0.0012617165,0.00046471276],"domain_scores_gemma":[0.97925055,0.01493697,0.001674126,0.0013835038,0.0018094075,0.0009453933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049199164,0.0013296423,0.0015860904,0.003969733,0.0015001934,0.0033437714,0.0022306596,0.00113083,0.0029489512],"category_scores_gemma":[0.023431398,0.0007653714,0.0014148443,0.0043879678,0.0015933992,0.007477604,0.0022692215,0.0017488211,0.00041385568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077736576,0.0003054983,0.010050703,0.0015898389,0.00035140885,0.00050490175,0.0012021064,0.5318247,0.008630307,0.27299148,0.0065563475,0.1652153],"study_design_scores_gemma":[0.000113531976,0.0009590857,0.005013508,0.0003731458,0.00030735804,0.0022609206,0.0018127029,0.7422173,0.006548233,0.21492983,0.02533273,0.00013164716],"about_ca_topic_score_codex":0.0025891168,"about_ca_topic_score_gemma":0.0024672812,"teacher_disagreement_score":0.0049199164,"about_ca_system_score_codex":0.003511717,"about_ca_system_score_gemma":0.0023028026,"threshold_uncertainty_score":0.026019335},"labels":[],"label_agreement":null},{"id":"W4391716630","doi":"10.1007/s00373-023-02747-4","title":"Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dawson College","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Colored; Vertex (graph theory); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.050015451489095294,"score_gpt":0.2940527677184181,"score_spread":0.2440373162293228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391716630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36241776,0.0017577391,0.55620563,0.006150126,0.00026652304,0.00045891988,0.0030680462,0.0010227454,0.06865249],"genre_scores_gemma":[0.8527488,0.0023693,0.11646781,0.0010019894,0.0008052746,0.0005843822,0.0038359622,0.00068800274,0.02149838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724174,0.00058580015,0.00013115595,0.0008188985,0.00081807066,0.0004044467],"domain_scores_gemma":[0.9600342,0.031201214,0.0025066733,0.0031572874,0.001562346,0.0015382504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002063318,0.0017638578,0.0018344772,0.0026784523,0.0025105844,0.0064422665,0.00518131,0.0024784342,0.014516179],"category_scores_gemma":[0.02138588,0.0015087266,0.002657071,0.005199789,0.0038652855,0.017530808,0.0045937914,0.0058802655,0.0010120107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006037637,0.0007682537,0.0055845003,0.00082576985,0.00019842267,0.0003933438,0.0010563878,0.13203059,0.0061352607,0.7977305,0.014936623,0.03973652],"study_design_scores_gemma":[0.000077665994,0.00004400697,0.001000669,0.000030717012,0.00009380797,0.00018729156,0.00019448143,0.16929854,0.0016613175,0.82492006,0.002461569,0.0000297619],"about_ca_topic_score_codex":0.004148465,"about_ca_topic_score_gemma":0.0056790933,"teacher_disagreement_score":0.014516179,"about_ca_system_score_codex":0.003623293,"about_ca_system_score_gemma":0.0019048332,"threshold_uncertainty_score":0.048561454},"labels":[],"label_agreement":null},{"id":"W4391918015","doi":"10.1142/s179352532450016x","title":"Automorphisms and subdivisions of Helly graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Topology and Analysis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Automorphism; Subdivision; Combinatorics; Discrete mathematics; Geography","score_opus":0.01287078616966978,"score_gpt":0.3106733131053419,"score_spread":0.2978025269356721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391918015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8947133,0.00019258226,0.08504009,0.0002096774,0.000029312336,0.000028280921,0.000058600664,0.000094038085,0.019634157],"genre_scores_gemma":[0.9868845,0.0001026817,0.0075372765,0.000036330588,0.000021932088,0.00001924552,0.00007333146,0.00003239196,0.0052922564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969435,0.00005761333,0.00001538322,0.000066684166,0.00008929968,0.00007670084],"domain_scores_gemma":[0.9991357,0.0002921304,0.00014462607,0.00019119139,0.00007084985,0.00016561974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002922857,0.00024398424,0.00024253003,0.0008553144,0.00084604963,0.0011591817,0.00041615617,0.00034310942,0.0030929453],"category_scores_gemma":[0.001544002,0.0002600037,0.0004792511,0.00030268528,0.003485426,0.0023950075,0.0019352508,0.0009893733,0.00028397242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044719858,0.000015990814,0.0016563513,0.000021808857,0.000006803164,0.00015009656,0.0008438453,0.00737908,0.0049306946,0.98000014,0.0001963155,0.004754171],"study_design_scores_gemma":[0.000018711959,0.000037064347,0.0016307124,0.0000144741325,0.000009084073,0.00022266494,0.0005981089,0.020758772,0.003920443,0.9667049,0.006065677,0.000019307781],"about_ca_topic_score_codex":0.0011024983,"about_ca_topic_score_gemma":0.00085861137,"teacher_disagreement_score":0.0030929453,"about_ca_system_score_codex":0.0007756814,"about_ca_system_score_gemma":0.00019386772,"threshold_uncertainty_score":0.010346949},"labels":[],"label_agreement":null},{"id":"W4391994399","doi":"10.2478/amsil-2024-0002","title":"The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets","year":2024,"lang":"en","type":"article","venue":"Annales Mathematicae Silesianae","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Realizability; Control reconfiguration; Mathematics; Combinatorics; Computer science; Discrete mathematics; Algorithm","score_opus":0.025256115818017066,"score_gpt":0.3218521306284077,"score_spread":0.2965960148103906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391994399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8816058,0.00019593253,0.09955364,0.00020536766,0.000023674047,0.000046127654,0.00031683352,0.00026003623,0.017792558],"genre_scores_gemma":[0.98971176,0.00007829785,0.008654324,0.000030056897,0.000010820483,0.00004135856,0.0001877,0.000027240205,0.0012583833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996419,0.00007719573,0.000020603487,0.00009254966,0.00008188396,0.000085818974],"domain_scores_gemma":[0.9981452,0.00085658376,0.00042361591,0.00022159074,0.00010886103,0.00024419816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003693681,0.00030616252,0.00032640342,0.000777871,0.00048162907,0.0013459738,0.00048560483,0.00033877138,0.0027684134],"category_scores_gemma":[0.0022327916,0.0004023949,0.0005522573,0.0005980639,0.001050563,0.0012404657,0.0009264713,0.000670601,0.0001833844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005152778,0.0001090493,0.0072805556,0.00022196001,0.000073645424,0.0011232934,0.00090994145,0.14262705,0.036975764,0.7770731,0.0017356824,0.03135474],"study_design_scores_gemma":[0.00012860744,0.0002450817,0.004636993,0.00006157631,0.00007066367,0.0007915961,0.00063047564,0.2132798,0.014970058,0.7562556,0.008883444,0.000045977562],"about_ca_topic_score_codex":0.0007874292,"about_ca_topic_score_gemma":0.0009197188,"teacher_disagreement_score":0.0027684134,"about_ca_system_score_codex":0.00091565744,"about_ca_system_score_gemma":0.00031198192,"threshold_uncertainty_score":0.00926131},"labels":[],"label_agreement":null},{"id":"W4392128265","doi":"10.1093/imrn/rnaf189","title":"Web Bases in Degree Two From Hourglass Plabic Graphs","year":2025,"lang":"en","type":"preprint","venue":"International Mathematics Research Notices","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Austrian Science Fund; Natural Sciences and Engineering Research Council of Canada; Österreichischen Akademie der Wissenschaften; North Dakota State University; National Science Foundation","keywords":"Hourglass; Degree (music); Computer science; World Wide Web; Geography; Physics; Archaeology","score_opus":0.17196761521514492,"score_gpt":0.4493012501158872,"score_spread":0.27733363490074225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392128265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8319643,0.00029348533,0.08871611,0.00032477564,0.00016936529,0.00008325594,0.00035583376,0.00040295397,0.0776899],"genre_scores_gemma":[0.97043926,0.00018642479,0.017168814,0.00019752054,0.00007394619,0.00006947291,0.000297927,0.00012300629,0.0114436215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979025,0.000036547004,0.000009398676,0.000035605157,0.0000671493,0.00006112072],"domain_scores_gemma":[0.9996909,0.000054964825,0.0000494379,0.00006233084,0.000059074355,0.000083314226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021731493,0.00033962558,0.00029601637,0.00126646,0.0008830219,0.0014386881,0.0004834885,0.00056157185,0.0069135483],"category_scores_gemma":[0.00057456543,0.00022632147,0.000311398,0.000562411,0.0010560252,0.0013311026,0.00090342225,0.0007630734,0.0008254459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000331484,0.000026237001,0.00022495427,0.000024858397,0.000003601584,0.00010658087,0.00016102166,0.0029441076,0.003441075,0.9842036,0.0010571817,0.007773689],"study_design_scores_gemma":[0.000023098817,0.00005135812,0.0007385924,0.000025724983,0.000006212831,0.00017584632,0.00031249793,0.024744697,0.0038518414,0.9600931,0.009948421,0.000028626022],"about_ca_topic_score_codex":0.0014364437,"about_ca_topic_score_gemma":0.0020999047,"teacher_disagreement_score":0.0069135483,"about_ca_system_score_codex":0.0005987767,"about_ca_system_score_gemma":0.00028917604,"threshold_uncertainty_score":0.023128092},"labels":[],"label_agreement":null},{"id":"W4392144194","doi":"10.1007/s00373-024-02756-x","title":"Infinite Families of k-Vertex-Critical ($$P_5$$, $$C_5$$)-Free Graphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.015829665010986597,"score_gpt":0.2788217830343118,"score_spread":0.2629921180233252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392144194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8701472,0.00085122307,0.053201362,0.0012856519,0.00010612239,0.000065536726,0.0007892076,0.0006283626,0.072925344],"genre_scores_gemma":[0.9806157,0.00025604523,0.0065995143,0.00020544734,0.00004304981,0.00008547454,0.0009173972,0.00016971526,0.011107671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993938,0.00010782386,0.000026988453,0.00014885553,0.00013572542,0.00018680499],"domain_scores_gemma":[0.9962457,0.0021634328,0.00028319668,0.00023831955,0.0004183466,0.0006508758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057284295,0.00066171226,0.0005273238,0.0026764073,0.0036122443,0.0028608877,0.0017900824,0.0009910756,0.008420706],"category_scores_gemma":[0.0042077526,0.00080566393,0.0006797992,0.001166379,0.002222929,0.0027552014,0.001912501,0.0015530732,0.00063475006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028914004,0.000061215,0.003263698,0.000179425,0.000037405633,0.0012842844,0.0014314636,0.003957558,0.0060317037,0.9690449,0.0061355596,0.008283551],"study_design_scores_gemma":[0.00007593908,0.000037857404,0.002942899,0.00014463867,0.000078136465,0.0014310697,0.00086729997,0.020711305,0.005516649,0.95600706,0.012125355,0.00006187845],"about_ca_topic_score_codex":0.0018369158,"about_ca_topic_score_gemma":0.0027405887,"teacher_disagreement_score":0.008420706,"about_ca_system_score_codex":0.0019395708,"about_ca_system_score_gemma":0.0007584181,"threshold_uncertainty_score":0.02817005},"labels":[],"label_agreement":null},{"id":"W4392238446","doi":"10.1137/18m1234849","title":"Four-Coloring \\(\\boldsymbol{P_6}\\)-Free Graphs. II. Finding an Excellent Precoloring","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; National Science Foundation","keywords":"Combinatorics; Mathematics; Graph coloring; Complete coloring; Discrete mathematics; Graph; Line graph","score_opus":0.05692025520573841,"score_gpt":0.3279586546606393,"score_spread":0.2710383994549009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392238446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50726163,0.0007149943,0.43347222,0.0022173491,0.00023409691,0.00028065103,0.0024102437,0.0021395169,0.051269345],"genre_scores_gemma":[0.66079706,0.00051917916,0.296409,0.0007001156,0.00012037765,0.00017976134,0.004715343,0.0007487249,0.035810445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995116,0.00007340775,0.000022191196,0.00015495507,0.000097554606,0.00014032867],"domain_scores_gemma":[0.9985623,0.00052481523,0.00021387174,0.000394765,0.00013817911,0.0001659926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004018402,0.0005514217,0.00058694463,0.00060616987,0.00127928,0.0011538579,0.0012039514,0.00049653667,0.0075937104],"category_scores_gemma":[0.0011841124,0.00054034346,0.0006947847,0.0009622983,0.00083969557,0.0025711067,0.0017618563,0.0017013882,0.0012044017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014773216,0.00048754454,0.010775159,0.0011149527,0.00014454169,0.0012948783,0.00090493815,0.061859895,0.08664287,0.48694402,0.055981386,0.29237252],"study_design_scores_gemma":[0.00008934075,0.00022262406,0.004455786,0.00007775083,0.000089160734,0.001261309,0.00036426575,0.08960989,0.066145465,0.75312656,0.08447861,0.00007922478],"about_ca_topic_score_codex":0.0013425753,"about_ca_topic_score_gemma":0.0028694102,"teacher_disagreement_score":0.0075937104,"about_ca_system_score_codex":0.0010025435,"about_ca_system_score_gemma":0.000584439,"threshold_uncertainty_score":0.0254035},"labels":[],"label_agreement":null},{"id":"W4392450535","doi":"10.1007/978-3-031-55601-2_3","title":"Bi-arc Digraphs: Recognition Algorithm and Applications","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Arc (geometry); Algorithm; Mathematics","score_opus":0.021695642205586597,"score_gpt":0.2808262074283002,"score_spread":0.2591305652227136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392450535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016334152,0.0013656404,0.9555769,0.00036000978,0.000245683,0.00015472513,0.0024493146,0.0053535406,0.01815994],"genre_scores_gemma":[0.12825511,0.0017250922,0.8371358,0.00021314448,0.000116202165,0.00017103188,0.0054301824,0.000618371,0.026335036],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997243,0.000033061224,0.00002133299,0.00011386044,0.00007676805,0.00003064509],"domain_scores_gemma":[0.99936324,0.00016551993,0.00005435915,0.00014498178,0.00020650073,0.00006548354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025125267,0.0007807152,0.0006258654,0.0023102653,0.00070123054,0.0016345886,0.0015116624,0.00095517345,0.01149212],"category_scores_gemma":[0.0014356859,0.00058091304,0.0005592907,0.0041352347,0.00039333667,0.0018768721,0.0007945498,0.001111215,0.00653336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017240834,0.00015169199,0.002306116,0.0005202156,0.00003907035,0.00022553572,0.0001623892,0.028199503,0.010975106,0.08678795,0.045715325,0.82474464],"study_design_scores_gemma":[0.00004440126,0.000083379724,0.002761629,0.00017333617,0.000083094594,0.0013109912,0.00027806315,0.7017958,0.01952978,0.16167684,0.11218664,0.00007601446],"about_ca_topic_score_codex":0.003757912,"about_ca_topic_score_gemma":0.0055024726,"teacher_disagreement_score":0.01149212,"about_ca_system_score_codex":0.0007413318,"about_ca_system_score_gemma":0.00081833935,"threshold_uncertainty_score":0.038444996},"labels":[],"label_agreement":null},{"id":"W4392595156","doi":"10.1002/jgt.23089","title":"Finding triangle‐free 2‐factors in general graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Carnegie Mellon University","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.029967797853744167,"score_gpt":0.31226156345549816,"score_spread":0.282293765601754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392595156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37050474,0.001248531,0.6017892,0.0010352127,0.000097995464,0.00048551612,0.0020500321,0.001767029,0.021021793],"genre_scores_gemma":[0.70282394,0.000668985,0.28453687,0.00025179362,0.00006724567,0.00016289734,0.0022041786,0.00040289594,0.008881074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991559,0.000120477285,0.00005329257,0.00033744477,0.00012833891,0.00020465594],"domain_scores_gemma":[0.9973748,0.0014249082,0.00033259235,0.00041396325,0.00026683896,0.00018704697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005374802,0.0009857143,0.0009968522,0.0009361315,0.0010188081,0.0013600372,0.0010683445,0.0010386265,0.01034052],"category_scores_gemma":[0.0039212047,0.0006431291,0.0010926182,0.0012630492,0.0010037768,0.004756342,0.0014258737,0.00095747085,0.001088833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022011911,0.0006833408,0.011200901,0.002093569,0.0002651492,0.0015680795,0.0014361126,0.36181948,0.046851516,0.29992032,0.031106954,0.24085346],"study_design_scores_gemma":[0.00024710235,0.0003977222,0.002516314,0.00014586508,0.00010375808,0.0015184075,0.00088067877,0.406232,0.028662572,0.5277607,0.031447,0.00008794537],"about_ca_topic_score_codex":0.005085409,"about_ca_topic_score_gemma":0.0051266295,"teacher_disagreement_score":0.01034052,"about_ca_system_score_codex":0.000936604,"about_ca_system_score_gemma":0.0008852189,"threshold_uncertainty_score":0.03459245},"labels":[],"label_agreement":null},{"id":"W4393008377","doi":"10.1137/22m1515768","title":"List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Combinatorics; Mathematics; Edge coloring; List coloring; Complete coloring; Discrete mathematics; Brooks' theorem; Graph coloring; Greedy coloring; Chordal graph; Graph; 1-planar graph; Line graph","score_opus":0.03265438846763929,"score_gpt":0.3106433100962616,"score_spread":0.2779889216286223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393008377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27824748,0.0004267011,0.67506397,0.0025033525,0.0003252002,0.00067527476,0.0069869147,0.004160967,0.03161021],"genre_scores_gemma":[0.66213536,0.00029244408,0.3112246,0.00092745916,0.00009888563,0.00030599482,0.009233099,0.0004709586,0.015311241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987914,0.0002660526,0.00008072406,0.00031052865,0.00028710606,0.0002642401],"domain_scores_gemma":[0.9958034,0.002234021,0.00041470144,0.00070411054,0.0005205161,0.00032332065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063024164,0.0008007723,0.0006258004,0.00065748225,0.0010906003,0.0019611667,0.00135656,0.00094837096,0.008468098],"category_scores_gemma":[0.00288021,0.00044460833,0.0012797439,0.001461817,0.0010488065,0.0030144951,0.001174189,0.0014781147,0.0011474534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018033264,0.001249166,0.0065680062,0.0016384827,0.00022202915,0.0018848085,0.000926164,0.33618146,0.03339955,0.40030995,0.048121728,0.16769531],"study_design_scores_gemma":[0.0002338448,0.00027739594,0.001528541,0.00009034813,0.00009790096,0.00067410397,0.00040633266,0.43188044,0.025563845,0.5179769,0.02118885,0.00008150924],"about_ca_topic_score_codex":0.0067651006,"about_ca_topic_score_gemma":0.0090815695,"teacher_disagreement_score":0.008468098,"about_ca_system_score_codex":0.0022601418,"about_ca_system_score_gemma":0.0024512177,"threshold_uncertainty_score":0.028328598},"labels":[],"label_agreement":null},{"id":"W4393024088","doi":"","title":"A guide book for the traveller on graphs full of blockages","year":2019,"lang":"en","type":"preprint","venue":"theses.fr (ABES)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Data science; Mathematics","score_opus":0.041242483411066726,"score_gpt":0.32370673419779705,"score_spread":0.2824642507867303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393024088","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025761714,0.06472772,0.45508683,0.014912519,0.01011291,0.00060690386,0.010046733,0.017562585,0.42436767],"genre_scores_gemma":[0.012386984,0.044786364,0.250984,0.0064086276,0.0030597015,0.00059639406,0.009587119,0.008348401,0.6638424],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951637,0.000087707216,0.00003383379,0.00013930489,0.00018161282,0.000041214236],"domain_scores_gemma":[0.9987722,0.0005892938,0.000038680253,0.00021551369,0.0003006949,0.000083493745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005051233,0.0027352544,0.0017497279,0.003012687,0.0015664203,0.0026792395,0.0021265189,0.002177848,0.14706083],"category_scores_gemma":[0.0033694566,0.0017126789,0.002166701,0.0048516653,0.0010132794,0.0074569117,0.00217331,0.003885639,0.08727295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046469064,0.000056077195,0.00017407304,0.0004911904,0.000033386088,0.00013072728,0.0001166729,0.0034219206,0.0011521804,0.043683402,0.7210736,0.22962031],"study_design_scores_gemma":[0.000013770762,0.00002911708,0.00026074797,0.00021818098,0.0000125977995,0.00041388712,0.00007432627,0.0025358894,0.00038863116,0.06590721,0.93011326,0.000032300937],"about_ca_topic_score_codex":0.0073489463,"about_ca_topic_score_gemma":0.0139802275,"teacher_disagreement_score":0.14706083,"about_ca_system_score_codex":0.0020653622,"about_ca_system_score_gemma":0.001531469,"threshold_uncertainty_score":0.4919675},"labels":[],"label_agreement":null},{"id":"W4393216900","doi":"10.1016/j.disc.2024.114005","title":"A note on highly connected K2,-minor free graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Minor (academic); Discrete mathematics","score_opus":0.022923630332942358,"score_gpt":0.30634562913222824,"score_spread":0.28342199879928587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393216900","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3489698,0.015237137,0.17543267,0.043614347,0.008199584,0.00015476866,0.0017615311,0.0016098513,0.4050203],"genre_scores_gemma":[0.8575473,0.006875264,0.046036832,0.0046905535,0.005258672,0.00006678768,0.0009560961,0.0004773362,0.07809119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997861,0.00004771452,0.000009849293,0.00006836452,0.000057863832,0.00003001833],"domain_scores_gemma":[0.998865,0.0006792539,0.000081404,0.00014018602,0.00010274339,0.00013133837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003558073,0.0006938365,0.0005075282,0.00076819595,0.0017939549,0.0014521858,0.0009557702,0.00080023764,0.0064316513],"category_scores_gemma":[0.0020560806,0.00027854595,0.00043858838,0.0012374783,0.0012263551,0.0031326269,0.0016010398,0.0018406073,0.0010602837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026703125,0.00006755613,0.0018874098,0.0005453477,0.000043822987,0.0014122033,0.0007117519,0.008417939,0.015670562,0.84142363,0.07907383,0.050478823],"study_design_scores_gemma":[0.000023668259,0.000057855417,0.002512968,0.00004188517,0.00003481548,0.0009797231,0.00025424964,0.009161197,0.0032706866,0.9051039,0.07853087,0.000028243307],"about_ca_topic_score_codex":0.0017444729,"about_ca_topic_score_gemma":0.0030368532,"teacher_disagreement_score":0.0064316513,"about_ca_system_score_codex":0.0006823263,"about_ca_system_score_gemma":0.00031330623,"threshold_uncertainty_score":0.021515965},"labels":[],"label_agreement":null},{"id":"W4394190359","doi":"10.6084/m9.figshare.5325607","title":"Property Graphs","year":2017,"lang":"en","type":"dataset","venue":"Figshare","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Computer science; Combinatorics","score_opus":0.08526674129771894,"score_gpt":0.34934958491836515,"score_spread":0.2640828436206462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394190359","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002117528,0.00037278092,0.00046108177,0.0002339786,0.0000775031,0.00008277903,0.99313265,0.0020347936,0.001486892],"genre_scores_gemma":[0.0021335054,0.000107505526,0.0009663141,0.000090491005,0.000008488468,0.00013156171,0.9959967,0.00009547743,0.0004699322],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982948,0.0002565338,0.00023194448,0.00059738057,0.00042539748,0.00019392869],"domain_scores_gemma":[0.99693525,0.0010231178,0.00026501904,0.00086916913,0.0006605801,0.00024695354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010964386,0.0035174736,0.0013759972,0.0047759977,0.00119861,0.001953828,0.0035486526,0.0027753515,0.030211972],"category_scores_gemma":[0.008284748,0.0007097275,0.0025663797,0.0057596536,0.00074966,0.0022914195,0.0019878754,0.0028384242,0.024685705],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021987931,0.00016047503,0.002880378,0.0018610096,0.00011835846,0.00010833438,0.000044990862,0.0016841915,0.00060730084,0.0016245742,0.9818601,0.008830489],"study_design_scores_gemma":[0.00092969195,0.00016151386,0.012574761,0.0007744242,0.00018523856,0.00057277916,0.0003006564,0.006629275,0.0026779063,0.005824256,0.9692863,0.000083166546],"about_ca_topic_score_codex":0.024890305,"about_ca_topic_score_gemma":0.056370433,"teacher_disagreement_score":0.030211972,"about_ca_system_score_codex":0.0021963553,"about_ca_system_score_gemma":0.0030917104,"threshold_uncertainty_score":0.10106915},"labels":[],"label_agreement":null},{"id":"W4394572107","doi":"10.1007/s00493-024-00097-0","title":"Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Prism; Tree (set theory); Forestry; Geography; Physics","score_opus":0.025770290063203218,"score_gpt":0.2955779802607052,"score_spread":0.269807690197502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394572107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.613565,0.0010544104,0.3162238,0.0019982534,0.00020493225,0.00012426947,0.0008650482,0.0005072358,0.06545702],"genre_scores_gemma":[0.89444464,0.00070178544,0.084307745,0.00039927728,0.000103294224,0.00008946526,0.0010887854,0.00016058123,0.018704446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996736,0.000060758925,0.000018539615,0.00008674419,0.000073465104,0.00008690508],"domain_scores_gemma":[0.9989531,0.00048126874,0.00018138763,0.000113767615,0.00009195188,0.0001785695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047740518,0.0003787446,0.00039921157,0.0009251372,0.0010091268,0.001700418,0.000743912,0.0006625285,0.0050718565],"category_scores_gemma":[0.0015039,0.00064567174,0.000980663,0.0012142933,0.0013219687,0.0025866025,0.0013044177,0.002247353,0.0005307093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015195133,0.000079754,0.0028094286,0.000229125,0.000044017554,0.000573162,0.00092875614,0.007563448,0.010446589,0.94957507,0.0048884284,0.022710288],"study_design_scores_gemma":[0.00003800466,0.000037741785,0.002032766,0.00004644037,0.00005254249,0.000653193,0.0005653542,0.018074527,0.0037418467,0.9681111,0.0066298144,0.000016588414],"about_ca_topic_score_codex":0.0020262087,"about_ca_topic_score_gemma":0.0032957161,"teacher_disagreement_score":0.0050718565,"about_ca_system_score_codex":0.00066398265,"about_ca_system_score_gemma":0.0006195607,"threshold_uncertainty_score":0.016966999},"labels":[],"label_agreement":null},{"id":"W4394576516","doi":"10.1017/nws.2024.3","title":"Generating preferential attachment graphs via a Pólya urn with expanding colors","year":2024,"lang":"en","type":"article","venue":"Network Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.02093150770126085,"score_gpt":0.31378465379297715,"score_spread":0.2928531460917163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394576516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08601817,0.00016209723,0.9086002,0.00044855574,0.00008369824,0.00013080759,0.00018397214,0.000316235,0.00405623],"genre_scores_gemma":[0.7814117,0.0002830829,0.20688145,0.00021128092,0.0000634003,0.00039714738,0.00025343098,0.00013553648,0.010362966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821585,0.00097179547,0.000047741953,0.00037874287,0.00023881134,0.00014709121],"domain_scores_gemma":[0.99328196,0.0043132124,0.000567308,0.0008427827,0.0005940307,0.0004007213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027570953,0.00061501213,0.0010133532,0.0012800839,0.0010530464,0.0016858694,0.0026200449,0.0016904451,0.0054321294],"category_scores_gemma":[0.0113733215,0.000731381,0.0010849909,0.0013248193,0.0018191646,0.0024392444,0.002031571,0.0019205046,0.0008277521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015461346,0.00011486018,0.0024873384,0.000071907554,0.000054608056,0.00030378127,0.00033341025,0.65895414,0.003085997,0.30902985,0.0022077733,0.023201775],"study_design_scores_gemma":[0.000016494108,0.000019542143,0.0001591779,0.000006372116,0.000008066986,0.00003471833,0.00001842945,0.95960295,0.00029019918,0.038995612,0.0008376276,0.000010878666],"about_ca_topic_score_codex":0.0050105127,"about_ca_topic_score_gemma":0.005373149,"teacher_disagreement_score":0.0054321294,"about_ca_system_score_codex":0.0016301281,"about_ca_system_score_gemma":0.0008269122,"threshold_uncertainty_score":0.018172264},"labels":[],"label_agreement":null},{"id":"W4394758905","doi":"10.1007/s00453-024-01228-1","title":"Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Univerzita Karlova v Praze","keywords":"Homomorphism; Mathematics; Combinatorics; Conjecture; Discrete mathematics; Pathwidth; Chordal graph; Extension (predicate logic); Class (philosophy); Indifference graph; Graph; Computer science; Line graph","score_opus":0.012695415782799858,"score_gpt":0.2723994767271793,"score_spread":0.2597040609443794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394758905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6312804,0.002184086,0.23002984,0.013639157,0.0006095265,0.00011225158,0.0017038287,0.00094711105,0.11949378],"genre_scores_gemma":[0.94851494,0.0009769328,0.025215218,0.00162518,0.00068264804,0.0001829983,0.0014144877,0.00027452255,0.021113263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852884,0.00041596236,0.00007406719,0.00033490488,0.00032454674,0.00032165405],"domain_scores_gemma":[0.9920948,0.00526201,0.000729192,0.0005827914,0.0004734558,0.000857707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018056649,0.00074512133,0.0011078555,0.0026585853,0.0032902777,0.00636496,0.0018552426,0.001926574,0.013807054],"category_scores_gemma":[0.00929368,0.0008006377,0.0011232407,0.0028936905,0.004574561,0.014535373,0.003473928,0.0051352438,0.0010704895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012359161,0.000075116244,0.000605672,0.000061078106,0.0000095517535,0.000049785976,0.00039189612,0.00080565107,0.00051557244,0.98661184,0.002665713,0.008084627],"study_design_scores_gemma":[0.00001626371,0.000010834008,0.00017897379,0.000009101711,0.000006001881,0.000035298268,0.00012447477,0.002699061,0.00019819663,0.995805,0.00090904,0.000007747141],"about_ca_topic_score_codex":0.0010871895,"about_ca_topic_score_gemma":0.0014691715,"teacher_disagreement_score":0.013807054,"about_ca_system_score_codex":0.00232112,"about_ca_system_score_gemma":0.0014092958,"threshold_uncertainty_score":0.04618919},"labels":[],"label_agreement":null},{"id":"W4394792901","doi":"10.61091/um119-01","title":"Generalized 3-Rainbow Domination in Graphs and Honeycomb System (HC(n))","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Rainbow; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.018841296281883378,"score_gpt":0.2930727004844571,"score_spread":0.27423140420257375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394792901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6213322,0.00064224633,0.35956433,0.00028848852,0.00007269257,0.00010599598,0.00023210977,0.00020292727,0.017559083],"genre_scores_gemma":[0.9153184,0.00025726514,0.07955992,0.00007613989,0.000020619531,0.00008212077,0.00014251826,0.000021309519,0.004521731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998599,0.000031573916,0.0000065133536,0.00004045188,0.000034098935,0.000027378577],"domain_scores_gemma":[0.99978644,0.00008507812,0.000039722698,0.000028944662,0.000025867284,0.000033962267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018500882,0.00020092867,0.00022602691,0.00038434647,0.0005627552,0.00047996745,0.00030852214,0.0003131232,0.0015709394],"category_scores_gemma":[0.00059137744,0.00013231106,0.00031490356,0.00036264453,0.0006172298,0.0008403939,0.0006686453,0.0002719562,0.0001368076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021489663,0.00005412879,0.004691863,0.00032348454,0.00009645334,0.0007755351,0.0004454673,0.13849486,0.032899603,0.73950034,0.0040855873,0.07841775],"study_design_scores_gemma":[0.00004374246,0.00011994392,0.0038560915,0.000025999927,0.000032374035,0.0009102051,0.00021018396,0.47332075,0.0078840265,0.50194144,0.011615815,0.000039277027],"about_ca_topic_score_codex":0.0010174743,"about_ca_topic_score_gemma":0.0013986776,"teacher_disagreement_score":0.0015709394,"about_ca_system_score_codex":0.00041150532,"about_ca_system_score_gemma":0.0002964301,"threshold_uncertainty_score":0.0052553415},"labels":[],"label_agreement":null},{"id":"W4394793198","doi":"10.61091/ars158-05","title":"On Domination and 2-packing Numbers in Intersecting Linear Systems","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Prime (order theory); Rank (graph theory); Projective plane; Element (criminal law); Discrete mathematics; Geometry","score_opus":0.015467110374370329,"score_gpt":0.2987086625492166,"score_spread":0.28324155217484626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6414893,0.012564167,0.22545443,0.004200745,0.0005851944,0.00017144889,0.0016617929,0.0005883176,0.113284715],"genre_scores_gemma":[0.95819443,0.0033750173,0.02516901,0.0005502622,0.0008532835,0.00020013859,0.0010269514,0.0001434788,0.010487516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768484,0.00065501116,0.00012241561,0.00046555922,0.00049506506,0.00057708286],"domain_scores_gemma":[0.988457,0.008368441,0.0011661021,0.00058089953,0.00056915026,0.0008583821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016570741,0.001488442,0.0018933528,0.00495364,0.0028116233,0.0045407247,0.0017503402,0.0014078525,0.008340076],"category_scores_gemma":[0.010257854,0.0009540266,0.0010854106,0.0058894577,0.004842536,0.0079208445,0.003294733,0.0027219818,0.001027683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039500865,0.00008087226,0.004080888,0.00028457324,0.00006400611,0.00029313762,0.0010296626,0.023852654,0.0024592977,0.9384642,0.006784183,0.022211464],"study_design_scores_gemma":[0.000060381564,0.00010596699,0.0018581928,0.00010082716,0.000041131556,0.00033090773,0.00030389713,0.084715165,0.0009549762,0.9045489,0.0069136135,0.000066042834],"about_ca_topic_score_codex":0.0027989938,"about_ca_topic_score_gemma":0.0022273562,"teacher_disagreement_score":0.008340076,"about_ca_system_score_codex":0.0036394296,"about_ca_system_score_gemma":0.0008754719,"threshold_uncertainty_score":0.027900398},"labels":[],"label_agreement":null},{"id":"W4394793215","doi":"10.61091/ars158-03","title":"Algorithmic Aspects of Vertex-edge Domination in Some Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"SASTRA University; National Board for Higher Mathematics; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Neighbourhood (mathematics); Dominating set; Edge cover; Chordal graph; Bipartite graph; Vertex cover; Discrete mathematics; Maximal independent set; Graph; 1-planar graph","score_opus":0.012135276949478156,"score_gpt":0.2796549732610593,"score_spread":0.2675196963115812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29894114,0.0013680639,0.6606463,0.0028212527,0.000093562354,0.00038812228,0.00065712765,0.00051109114,0.034573395],"genre_scores_gemma":[0.7832802,0.0006539393,0.20541553,0.0003577666,0.0001030613,0.00023864431,0.00093710725,0.00010405047,0.008909636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985177,0.00044975537,0.0000972847,0.00034755727,0.00037252408,0.00021516206],"domain_scores_gemma":[0.9951624,0.0033440092,0.0004299566,0.00041245337,0.00039873662,0.00025246528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014241725,0.00045016303,0.00062168547,0.0012498297,0.0013414411,0.002564775,0.001800117,0.0009914213,0.0027762966],"category_scores_gemma":[0.008085935,0.0004052053,0.0006180227,0.0019960182,0.0018882792,0.003402378,0.0022287525,0.0012806527,0.00025780944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040484135,0.00023376264,0.0076237204,0.0004702339,0.000120667624,0.00081329985,0.0010963891,0.1490805,0.00824498,0.7299666,0.00727914,0.09466597],"study_design_scores_gemma":[0.00009532386,0.00006184419,0.0011426386,0.000038379538,0.000054226643,0.00063480466,0.00026347992,0.40238625,0.0029440369,0.58203566,0.010318235,0.000025105022],"about_ca_topic_score_codex":0.0024105152,"about_ca_topic_score_gemma":0.0033650466,"teacher_disagreement_score":0.0027762966,"about_ca_system_score_codex":0.0016073021,"about_ca_system_score_gemma":0.0010954129,"threshold_uncertainty_score":0.011661828},"labels":[],"label_agreement":null},{"id":"W4394877485","doi":"10.26493/2590-9770.1641.f6d","title":"On the restricted Hanoi graphs","year":2024,"lang":"en","type":"article","venue":"The Art of Discrete and Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Computer science","score_opus":0.02129496135886784,"score_gpt":0.27305642652165074,"score_spread":0.2517614651627829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394877485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25051603,0.0003402263,0.7076473,0.0010533093,0.000077812314,0.00041581216,0.001117415,0.0014580067,0.037374012],"genre_scores_gemma":[0.6461277,0.000447151,0.33230758,0.0003786126,0.00008692872,0.0003838629,0.002091846,0.00029587955,0.017880352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999099,0.00025438002,0.00003830728,0.0002458023,0.0001857249,0.00017682271],"domain_scores_gemma":[0.99778795,0.0010943365,0.00024677403,0.0005279052,0.0001673396,0.00017564873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064841035,0.0006418111,0.00054331427,0.0006242617,0.0010239702,0.00095736363,0.0013626765,0.00083389593,0.007561838],"category_scores_gemma":[0.0034036813,0.00038937663,0.0007462427,0.000999898,0.001476052,0.0038055137,0.0014997035,0.0017814024,0.00096750987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070822396,0.00027245498,0.0014863691,0.00042753326,0.000069929534,0.0007103162,0.00089945697,0.15498133,0.022363598,0.6892646,0.012852189,0.115963995],"study_design_scores_gemma":[0.0001764628,0.00019699012,0.00143749,0.000053629567,0.000054015043,0.00070678885,0.0004086412,0.33615857,0.016738957,0.61715496,0.026830928,0.00008253696],"about_ca_topic_score_codex":0.0026609635,"about_ca_topic_score_gemma":0.0028213689,"teacher_disagreement_score":0.007561838,"about_ca_system_score_codex":0.0010111613,"about_ca_system_score_gemma":0.0007091228,"threshold_uncertainty_score":0.025296867},"labels":[],"label_agreement":null},{"id":"W4394881837","doi":"10.1007/s00373-024-02778-5","title":"Semi-strict Chordality of Digraphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.014632078909479816,"score_gpt":0.2712885078436402,"score_spread":0.2566564289341604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394881837","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7812974,0.0005430148,0.1274799,0.00073987996,0.00016386871,0.00010891416,0.0010735525,0.00027532643,0.088318236],"genre_scores_gemma":[0.9784177,0.0003521092,0.010943147,0.00015543737,0.00008863424,0.000052880114,0.00068502343,0.00007939615,0.009225579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878305,0.00023709227,0.00011227144,0.00034182242,0.00027682362,0.00024895326],"domain_scores_gemma":[0.9934232,0.0030761284,0.00064465136,0.00079799467,0.0007692639,0.001288596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000842919,0.0005183109,0.0009962559,0.0020369813,0.002406359,0.0049338536,0.001456914,0.00080223114,0.005439631],"category_scores_gemma":[0.005288551,0.0008004016,0.000978096,0.0019644222,0.0030592254,0.0050751204,0.0036480678,0.002362408,0.00066244206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096640375,0.000030415738,0.0012533554,0.000069796566,0.000019414087,0.00021778514,0.0008463801,0.0011297957,0.0020405045,0.9872584,0.00057829736,0.0064593335],"study_design_scores_gemma":[0.000022039252,0.000023823752,0.0007540321,0.000024077235,0.000018235392,0.00018394449,0.0003553539,0.0032343,0.0008625726,0.99227226,0.0022349022,0.000014479134],"about_ca_topic_score_codex":0.0015839715,"about_ca_topic_score_gemma":0.002260685,"teacher_disagreement_score":0.005439631,"about_ca_system_score_codex":0.0012071324,"about_ca_system_score_gemma":0.0006378067,"threshold_uncertainty_score":0.018197417},"labels":[],"label_agreement":null},{"id":"W4394906558","doi":"10.48550/arxiv.2404.10663","title":"A note on inverting the dijoin of oriented graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.06808779366377844,"score_gpt":0.23019993041954723,"score_spread":0.1621121367557688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394906558","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15789631,0.0042469003,0.5524751,0.010267945,0.0025986356,0.00030110063,0.00066414924,0.0016419286,0.26990795],"genre_scores_gemma":[0.63121045,0.0064152605,0.32212165,0.005820747,0.0023926967,0.00057473313,0.0011757856,0.0014378286,0.02885092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981437,0.00043248516,0.00011652065,0.000388175,0.0006272886,0.00029188965],"domain_scores_gemma":[0.99172217,0.00558504,0.00030280865,0.0013746818,0.0005419647,0.00047338993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023431336,0.0012143743,0.0010703417,0.0016929705,0.0018034684,0.002031685,0.0021463956,0.001296602,0.007601109],"category_scores_gemma":[0.010666903,0.00071411446,0.0015175975,0.0020439266,0.0065997243,0.009075572,0.005433544,0.008859984,0.001290871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007674391,0.00009367543,0.0010233034,0.0001696183,0.00001500792,0.00024882107,0.00058963755,0.0027352853,0.0048677586,0.94091785,0.008856667,0.040405665],"study_design_scores_gemma":[0.000037238144,0.00010225272,0.0010234653,0.000055851153,0.000032365624,0.0004901072,0.00027655353,0.008431395,0.005508036,0.949046,0.034942128,0.000054623997],"about_ca_topic_score_codex":0.0030002738,"about_ca_topic_score_gemma":0.0032201617,"teacher_disagreement_score":0.007601109,"about_ca_system_score_codex":0.0014949485,"about_ca_system_score_gemma":0.0014015724,"threshold_uncertainty_score":0.025428236},"labels":[],"label_agreement":null},{"id":"W4394913316","doi":"10.1016/j.tcs.2024.114580","title":"List homomorphisms to separable signed graphs","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Agence Nationale de la Recherche; Univerzita Karlova v Praze; HORIZON EUROPE Framework Programme; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura, Univerzita Karlova; European Commission","keywords":"Signed graph; Separable space; Homomorphism; Mathematics; Focus (optics); Combinatorics; Conjecture; Discrete mathematics; Chordal graph; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.013531344058050261,"score_gpt":0.3004726099934867,"score_spread":0.2869412659354364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394913316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3294753,0.0012216263,0.56994003,0.0031463248,0.0010094654,0.00019105869,0.00086281594,0.002469541,0.09168384],"genre_scores_gemma":[0.83811384,0.0014726821,0.072251104,0.0012085134,0.0008071326,0.00026549277,0.0008853081,0.0011032867,0.08389258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906117,0.0002534662,0.00006274087,0.00022047288,0.00023618077,0.00016594907],"domain_scores_gemma":[0.9969708,0.001334776,0.00038586376,0.00039086206,0.00041736648,0.0005002187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008905389,0.0008417631,0.0007124474,0.0033055046,0.0016534328,0.0035667652,0.0013831985,0.0010785557,0.014380368],"category_scores_gemma":[0.0047113094,0.00067891966,0.00091923913,0.003152681,0.0021666442,0.009113814,0.0041049826,0.003301735,0.002494635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000598729,0.000055025423,0.0001163669,0.000056122317,0.000006056899,0.000089560555,0.00046508602,0.0005432674,0.00097095076,0.97916794,0.0016948959,0.016774934],"study_design_scores_gemma":[0.000018592427,0.000022380897,0.000097203534,0.000016938708,0.000010731877,0.00009660846,0.00015065722,0.0031003226,0.0009076439,0.9906176,0.0049471036,0.000014131792],"about_ca_topic_score_codex":0.0006375111,"about_ca_topic_score_gemma":0.00070531183,"teacher_disagreement_score":0.014380368,"about_ca_system_score_codex":0.0015355772,"about_ca_system_score_gemma":0.00075953046,"threshold_uncertainty_score":0.048107088},"labels":[],"label_agreement":null},{"id":"W4395452445","doi":"10.1002/jgt.23091","title":"Another proof of Seymour's 6‐flow theorem","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical proof; Combinatorial proof; Generalization; Combinatorics; Robertson–Seymour theorem; Graph; Discrete mathematics; Flow (mathematics); Graph minor; Voltage graph; 1-planar graph; Line graph; Mathematical analysis; Geometry","score_opus":0.016249949979179206,"score_gpt":0.2863374115613792,"score_spread":0.2700874615822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395452445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07935363,0.0047178264,0.60859144,0.01665849,0.004494521,0.00018321344,0.000773279,0.0010826378,0.2841449],"genre_scores_gemma":[0.7529641,0.003859098,0.16128984,0.007949248,0.0024427567,0.00036862388,0.0006949186,0.00061597675,0.06981546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940896,0.00012752146,0.0000246979,0.00013074388,0.00017681245,0.00013133998],"domain_scores_gemma":[0.99889046,0.00049216405,0.000085234526,0.000103612896,0.00026679604,0.00016165388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009873238,0.0007465681,0.0004961804,0.0015376769,0.0014606321,0.0012344862,0.0013833967,0.0014715553,0.0164508],"category_scores_gemma":[0.002822327,0.0003890071,0.0013908036,0.0009985261,0.0025315362,0.004126521,0.0027515434,0.004305514,0.0017183479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037748847,0.000024763265,0.000093924406,0.00006491439,0.000014596734,0.00018054264,0.00017842733,0.0006809743,0.0020921472,0.97717005,0.008780429,0.010681385],"study_design_scores_gemma":[0.00003604455,0.00003779645,0.00035714134,0.000059518614,0.000012482409,0.0001898767,0.00005731393,0.0036735388,0.0024262934,0.9425045,0.050623994,0.000021476926],"about_ca_topic_score_codex":0.0013542352,"about_ca_topic_score_gemma":0.00080074335,"teacher_disagreement_score":0.0164508,"about_ca_system_score_codex":0.0010806739,"about_ca_system_score_gemma":0.0007802024,"threshold_uncertainty_score":0.055033386},"labels":[],"label_agreement":null},{"id":"W4395462958","doi":"10.1002/jgt.23104","title":"Tree independence number I. (Even hole, diamond, pyramid)‐free graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Alexander von Humboldt-Stiftung","keywords":"Treewidth; Combinatorics; Mathematics; Bounded function; Clique-sum; Partial k-tree; Tree-depth; Discrete mathematics; Chordal graph; Independent set; Tree decomposition; Conjecture; 1-planar graph; Graph; Pathwidth; Line graph","score_opus":0.014898540024867096,"score_gpt":0.2909779846108253,"score_spread":0.27607944458595823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395462958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7267811,0.00048301773,0.23065239,0.001282419,0.000052172876,0.000085920154,0.00089269027,0.000572715,0.03919763],"genre_scores_gemma":[0.97245854,0.0001812242,0.024237206,0.000092606446,0.00004694149,0.000036199897,0.0003640327,0.000049118084,0.0025341446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950445,0.000069197595,0.000015222223,0.0001540165,0.00014367996,0.00011336403],"domain_scores_gemma":[0.99617565,0.0024889747,0.00043373855,0.00030815005,0.00019146121,0.00040209398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056438654,0.0002357091,0.00040246968,0.00068711577,0.00073001586,0.0014212291,0.0009880974,0.00046216106,0.00332797],"category_scores_gemma":[0.0034734441,0.00029556573,0.00036653766,0.0009441922,0.0011692345,0.001961824,0.00093266484,0.0013868145,0.00020871309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040049353,0.00021651197,0.009267811,0.0002330325,0.000060493014,0.0003608132,0.0004400734,0.062390756,0.021738654,0.8422849,0.012089562,0.05051697],"study_design_scores_gemma":[0.00007397671,0.000076529504,0.0060938844,0.000031824817,0.000048638296,0.0004890558,0.00012441278,0.35468835,0.013411669,0.6168762,0.008048359,0.000037093818],"about_ca_topic_score_codex":0.0029765337,"about_ca_topic_score_gemma":0.0031227162,"teacher_disagreement_score":0.00332797,"about_ca_system_score_codex":0.00141686,"about_ca_system_score_gemma":0.00072586123,"threshold_uncertainty_score":0.011133134},"labels":[],"label_agreement":null},{"id":"W4395481781","doi":"10.4230/lipics.fsttcs.2024.7","title":"Minimum Consistent Subset in Trees and Interval Graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Interval (graph theory); Combinatorics; Mathematics; Interval graph; Discrete mathematics; Chordal graph; Computer science; Graph; 1-planar graph","score_opus":0.07786774674370767,"score_gpt":0.22547202554912035,"score_spread":0.1476042788054127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395481781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108678,0.0009619925,0.88191074,0.001182493,0.000058643287,0.00016387501,0.0011677764,0.0008428924,0.005033611],"genre_scores_gemma":[0.4999093,0.00096065074,0.49338746,0.00028424797,0.00016058233,0.00029245028,0.00250484,0.00022834248,0.0022722161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875975,0.00039971454,0.00006794327,0.0003457117,0.0003045509,0.00012230838],"domain_scores_gemma":[0.9948519,0.0037965064,0.0004007878,0.0005412111,0.00025573344,0.00015395992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011472355,0.0006435792,0.0011273366,0.00085576694,0.0007775216,0.0017389735,0.0014135486,0.0009032105,0.0028437385],"category_scores_gemma":[0.0075889975,0.0004486204,0.00093364384,0.0022661402,0.0010988682,0.0046289293,0.0010954593,0.0016806794,0.00036568273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005191661,0.0002683761,0.0030556314,0.00070556125,0.00012626513,0.00048651168,0.00074259273,0.3604674,0.010203447,0.43421414,0.016809523,0.17240143],"study_design_scores_gemma":[0.00007605697,0.00011033998,0.0006567199,0.00005154838,0.00004835415,0.000581849,0.00027140332,0.439808,0.0036904337,0.5465342,0.008142698,0.000028333108],"about_ca_topic_score_codex":0.0015556382,"about_ca_topic_score_gemma":0.0020069222,"teacher_disagreement_score":0.0028437385,"about_ca_system_score_codex":0.0009872791,"about_ca_system_score_gemma":0.00093638944,"threshold_uncertainty_score":0.009513259},"labels":[],"label_agreement":null},{"id":"W4395689393","doi":"10.1016/j.dam.2024.04.012","title":"Proximity and remoteness in graphs: A survey","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"United Arab Emirates University","keywords":"Mathematics; Combinatorics","score_opus":0.030622952570315574,"score_gpt":0.30350614578349416,"score_spread":0.2728831932131786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395689393","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056418665,0.64572936,0.25616443,0.0059249066,0.0007079666,0.00009632621,0.00071172375,0.0002221307,0.034024466],"genre_scores_gemma":[0.3964066,0.51063806,0.07987632,0.0015897204,0.004509993,0.0001339482,0.0012540794,0.00015025026,0.0054410603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966742,0.000744022,0.00024461155,0.001310458,0.00085016096,0.00017659957],"domain_scores_gemma":[0.98482853,0.012416707,0.0006157138,0.0010074831,0.0008002571,0.00033128602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002802178,0.0010096186,0.0031187774,0.005337929,0.0014777249,0.0048192935,0.0024553451,0.0025196485,0.003772002],"category_scores_gemma":[0.010191458,0.0011182975,0.0014204294,0.013329386,0.0049138386,0.014232571,0.003332967,0.003029004,0.0008378992],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015535936,0.00031184187,0.009786429,0.0061336453,0.0002499107,0.0002719312,0.0012647943,0.015423755,0.0014690714,0.54752177,0.007351342,0.4100602],"study_design_scores_gemma":[0.000042972944,0.00023729459,0.005056791,0.00096978544,0.0002169855,0.0017626224,0.0014312101,0.02472911,0.0012022672,0.86897206,0.09527355,0.00010539961],"about_ca_topic_score_codex":0.0020395943,"about_ca_topic_score_gemma":0.0015257819,"teacher_disagreement_score":0.005337929,"about_ca_system_score_codex":0.0018500965,"about_ca_system_score_gemma":0.001361094,"threshold_uncertainty_score":0.014819503},"labels":[],"label_agreement":null},{"id":"W4395695587","doi":"10.1007/s10878-024-01165-3","title":"Planar graphs are acyclically edge $$(\\Delta + 5)$$-colorable","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Ministry of Science and Technology of the People's Republic of China; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Combinatorics; Planar graph; Theory of computation; Mathematics; Enhanced Data Rates for GSM Evolution; Planar; Outerplanar graph; Chordal graph; Delta; Computer science; Pathwidth; Discrete mathematics; Graph; Physics; Algorithm; Telecommunications; Line graph; Computer graphics (images)","score_opus":0.014175916864579724,"score_gpt":0.2796604955159583,"score_spread":0.26548457865137853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395695587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62711656,0.0005021481,0.14369796,0.0020134551,0.0003316699,0.000403974,0.0045643123,0.0021419337,0.21922807],"genre_scores_gemma":[0.8862743,0.00045653665,0.050089777,0.00068580656,0.00009246393,0.0002694147,0.0032476876,0.00045494162,0.05842922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950445,0.00006435167,0.000020271875,0.00013277672,0.00011906921,0.00015910158],"domain_scores_gemma":[0.9983942,0.0005219948,0.00033164315,0.00019147119,0.0003077168,0.00025311514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002740175,0.00076909654,0.0006211184,0.0011185793,0.001030006,0.0026676229,0.0014302139,0.0008775807,0.022139976],"category_scores_gemma":[0.0020739331,0.00094698404,0.00058124063,0.0015547778,0.0012380406,0.0018613375,0.0013560563,0.0016815163,0.0018426452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067293865,0.0002598914,0.0031841088,0.0004694577,0.000080347374,0.000606253,0.00038937508,0.017859705,0.017190704,0.85636604,0.024190636,0.078730434],"study_design_scores_gemma":[0.00020226896,0.00013700227,0.0059432858,0.00011320547,0.00015557828,0.00094854855,0.000513236,0.038228825,0.014078897,0.8930967,0.04648677,0.00009575973],"about_ca_topic_score_codex":0.0031398928,"about_ca_topic_score_gemma":0.0062337425,"teacher_disagreement_score":0.022139976,"about_ca_system_score_codex":0.0011736149,"about_ca_system_score_gemma":0.00091067323,"threshold_uncertainty_score":0.074065566},"labels":[],"label_agreement":null},{"id":"W4396212934","doi":"10.61091/jcmcc119-13","title":"NDC Pebbling Number for Some Class of Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Class (philosophy); Mathematics; Combinatorics; Computer science; Discrete mathematics; Artificial intelligence","score_opus":0.0224031363621556,"score_gpt":0.3129240023425292,"score_spread":0.29052086598037363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396212934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78984684,0.001706264,0.123942,0.0020534156,0.0001820745,0.00014906717,0.0020853495,0.00049529836,0.07953965],"genre_scores_gemma":[0.95952237,0.0012083194,0.025460016,0.00030596086,0.00022471543,0.00016458165,0.0015126459,0.000095399104,0.011506039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953926,0.000037995072,0.000019845844,0.00016390007,0.00013798058,0.0001009735],"domain_scores_gemma":[0.9979075,0.00096564787,0.00029976032,0.0002494213,0.00019710705,0.0003805134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043197483,0.00053040055,0.00047493805,0.0017278716,0.0011719239,0.0016529142,0.00110008,0.000872696,0.0060950518],"category_scores_gemma":[0.003125734,0.00022687716,0.0005051719,0.0015968394,0.0012450715,0.002581647,0.0008272925,0.0012777828,0.00049175584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036338845,0.00026479756,0.014016322,0.000352908,0.00006811915,0.0007057591,0.0006367083,0.045871273,0.016118532,0.83459604,0.017717924,0.069288105],"study_design_scores_gemma":[0.000077380166,0.00016841078,0.011605438,0.00008033643,0.000038971913,0.0020426845,0.0003827899,0.23938091,0.005359858,0.7018319,0.038973387,0.000057993155],"about_ca_topic_score_codex":0.0017664001,"about_ca_topic_score_gemma":0.0014377834,"teacher_disagreement_score":0.0060950518,"about_ca_system_score_codex":0.001999477,"about_ca_system_score_gemma":0.0005581473,"threshold_uncertainty_score":0.020389974},"labels":[],"label_agreement":null},{"id":"W4396240826","doi":"10.61091/jcmcc119-25","title":"An Upper Bound on the Total Roman { 2 } -domination Number of Graphs with Minimum Degree Two","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Babol Noshirvani University of Technology","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Vertex (graph theory); Minimum weight; Degree (music); Upper and lower bounds; Dominating set; Order (exchange); Induced subgraph; Function (biology); Discrete mathematics; Physics","score_opus":0.0194097962874946,"score_gpt":0.3029665248546538,"score_spread":0.2835567285671592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396240826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7660683,0.0025372466,0.13215393,0.0015153872,0.00015856187,0.000093861345,0.0011275586,0.000511742,0.09583338],"genre_scores_gemma":[0.95471597,0.0012998326,0.033993497,0.0002597452,0.00013777043,0.000095791045,0.0008877404,0.00018356772,0.008426028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992638,0.00012252612,0.00003232966,0.00016878913,0.00018777729,0.00022479423],"domain_scores_gemma":[0.99592763,0.0026294705,0.0003240936,0.0004236191,0.0003040713,0.0003911392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084407715,0.0010071972,0.0006890078,0.0013960738,0.0008976883,0.0017451165,0.0012005932,0.00050102145,0.0042402036],"category_scores_gemma":[0.003969507,0.00036797486,0.00073059945,0.0012896839,0.0012446304,0.0022815284,0.0013356921,0.0011983635,0.0006167582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018450657,0.00042070303,0.02485942,0.001639819,0.00036340317,0.0008667142,0.0010389076,0.1213064,0.10894729,0.55018526,0.017824857,0.17070222],"study_design_scores_gemma":[0.00016578066,0.0005502059,0.016060082,0.00027481775,0.0002860556,0.0023657957,0.00034340494,0.3585536,0.050447904,0.531267,0.039569825,0.000115614625],"about_ca_topic_score_codex":0.00063415687,"about_ca_topic_score_gemma":0.0011897938,"teacher_disagreement_score":0.0042402036,"about_ca_system_score_codex":0.0012107885,"about_ca_system_score_gemma":0.0006227354,"threshold_uncertainty_score":0.014184952},"labels":[],"label_agreement":null},{"id":"W4396571105","doi":"10.1007/978-981-97-2340-9_13","title":"On the 3-Tree Core of Plane Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Core (optical fiber); Tree (set theory); Plane (geometry); Theoretical computer science; Combinatorics; Mathematics; Geometry; Telecommunications","score_opus":0.03032448685657374,"score_gpt":0.28373159396970354,"score_spread":0.2534071071131298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396571105","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37815017,0.0052535194,0.23124926,0.0023582538,0.00034678585,0.00012597286,0.0011471605,0.0005783715,0.38079044],"genre_scores_gemma":[0.81232727,0.005866945,0.10108731,0.0010304893,0.00044962193,0.00014714479,0.0019384188,0.00065569946,0.07649717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983275,0.000034063232,0.0000065002137,0.00003205008,0.000053837633,0.000040674953],"domain_scores_gemma":[0.9995536,0.0002151492,0.000046324763,0.000055946693,0.000069898764,0.000058906877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021040645,0.000437315,0.0007094094,0.0011847216,0.0008704707,0.0017885988,0.00078131654,0.00080662034,0.0081426045],"category_scores_gemma":[0.0011796785,0.00054987473,0.00056641205,0.0019117267,0.0010931909,0.0031263253,0.0012634775,0.0020783925,0.0018925122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007223624,0.000024821264,0.00020260274,0.00009530665,0.000008729053,0.00008421128,0.00027798774,0.0032568881,0.0024265458,0.95925003,0.008118292,0.026182432],"study_design_scores_gemma":[0.000009831618,0.000013504931,0.0003585153,0.000036407964,0.000008421692,0.00011410985,0.00009262107,0.008375474,0.0006281072,0.98058367,0.009772917,0.000006406616],"about_ca_topic_score_codex":0.0023589781,"about_ca_topic_score_gemma":0.0030655304,"teacher_disagreement_score":0.0081426045,"about_ca_system_score_codex":0.0008541185,"about_ca_system_score_gemma":0.00034952088,"threshold_uncertainty_score":0.02723968},"labels":[],"label_agreement":null},{"id":"W4396609193","doi":"10.1016/j.comgeo.2024.102103","title":"Distance queries over dynamic interval graphs","year":2024,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interval (graph theory); Interval graph; Computer science; Combinatorics; Mathematics; Chordal graph; Theoretical computer science; Graph; 1-planar graph","score_opus":0.012364742372267706,"score_gpt":0.3126870457532805,"score_spread":0.3003223033810128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396609193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08708883,0.0008194473,0.8922779,0.00090553204,0.00013425892,0.0002114971,0.002331141,0.010068584,0.006162799],"genre_scores_gemma":[0.6222381,0.00051329547,0.36813644,0.00042665884,0.0001757856,0.0003211343,0.0043541077,0.0007748646,0.0030596405],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954965,0.0006459684,0.00056936964,0.0012274551,0.0014911726,0.00056955946],"domain_scores_gemma":[0.99065536,0.0033687607,0.0009972488,0.0034529795,0.0011416049,0.00038409856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018563954,0.0009708571,0.0013516787,0.0014726255,0.0008316661,0.0028350332,0.0042715003,0.0013168218,0.0036124657],"category_scores_gemma":[0.011382359,0.0007611666,0.000999486,0.0031749532,0.0012836996,0.01031248,0.0040674037,0.0020858431,0.0008922576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024957645,0.00045362677,0.0069701886,0.00082552107,0.00012987721,0.00039315314,0.0012427291,0.22639823,0.033044193,0.24289954,0.02623583,0.45891142],"study_design_scores_gemma":[0.00023168334,0.00046786107,0.0009843495,0.00008452738,0.00007199536,0.00035289407,0.00057799584,0.68078035,0.039887037,0.24442494,0.03201837,0.00011807379],"about_ca_topic_score_codex":0.0025010307,"about_ca_topic_score_gemma":0.0019953458,"teacher_disagreement_score":0.0042715003,"about_ca_system_score_codex":0.0017399944,"about_ca_system_score_gemma":0.0012211243,"threshold_uncertainty_score":0.012624621},"labels":[],"label_agreement":null},{"id":"W4396700657","doi":"10.1002/jgt.23113","title":"Gallai‐like characterization of strong cocomparability graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Characterization (materials science); Combinatorics; Discrete mathematics; Physics","score_opus":0.0202377984288647,"score_gpt":0.29752501998863096,"score_spread":0.27728722155976626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396700657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32847592,0.00036771322,0.62694186,0.0011127273,0.000113392576,0.0002993831,0.0014511585,0.0019179395,0.039319873],"genre_scores_gemma":[0.92944866,0.00013790753,0.062510714,0.00020389477,0.00007124467,0.00014318712,0.0012972008,0.00012301689,0.0060642343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990976,0.00011871116,0.00005420624,0.000370008,0.0002257116,0.00013384708],"domain_scores_gemma":[0.996084,0.0015401517,0.00071453286,0.00064669125,0.0006795834,0.00033501763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003279252,0.00065462454,0.0003678942,0.0016771029,0.000869058,0.0016877274,0.00094473385,0.0006260575,0.0070141563],"category_scores_gemma":[0.0030667782,0.00032981957,0.00060887856,0.0014129067,0.0014700147,0.0027317929,0.0014504222,0.0016278682,0.0009112856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004891523,0.00024216862,0.007487978,0.00045661515,0.00008756925,0.0010006314,0.0011925085,0.05052755,0.070047244,0.7400251,0.013385963,0.11505749],"study_design_scores_gemma":[0.000035593104,0.00014676999,0.00412919,0.000054632677,0.00005410247,0.0010521121,0.00049808243,0.19791117,0.04425156,0.7276127,0.024185384,0.000068755144],"about_ca_topic_score_codex":0.0014444642,"about_ca_topic_score_gemma":0.0010305061,"teacher_disagreement_score":0.0070141563,"about_ca_system_score_codex":0.0008845903,"about_ca_system_score_gemma":0.0003373932,"threshold_uncertainty_score":0.02346468},"labels":[],"label_agreement":null},{"id":"W4396867382","doi":"10.1002/jgt.23117","title":"Density of 3‐critical signed graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Centre National de la Recherche Scientifique; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Indo-French Centre for Applied Mathematics; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Signed graph; Discrete mathematics; Graph","score_opus":0.01684958187808392,"score_gpt":0.3136223571510856,"score_spread":0.29677277527300167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396867382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89619744,0.00033294148,0.08607482,0.00049063645,0.000045803845,0.000055984263,0.0002656059,0.0003414105,0.016195275],"genre_scores_gemma":[0.9947044,0.00009203037,0.003948268,0.000057908972,0.000017045808,0.00003067356,0.00013078931,0.00003412481,0.0009847273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993761,0.00014425859,0.00002242068,0.000121656,0.00020536881,0.00013017945],"domain_scores_gemma":[0.9942545,0.0033021073,0.00063088903,0.00039265436,0.00070112257,0.0007187527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005393804,0.00028007154,0.00043288208,0.0013889419,0.0009039979,0.0014997415,0.00092746934,0.000592995,0.006019962],"category_scores_gemma":[0.0090438295,0.0003734042,0.00028515095,0.00066739146,0.0017884431,0.0018964706,0.0014346635,0.00068148476,0.00034869832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052673864,0.00011014968,0.016989095,0.0003023888,0.000042266933,0.00073693437,0.001127645,0.03457739,0.032403957,0.88142544,0.0045120325,0.027245969],"study_design_scores_gemma":[0.000080745354,0.0001642308,0.009168751,0.00010448567,0.000054120963,0.0013444007,0.0008186292,0.2548462,0.021702494,0.702559,0.00908119,0.000075739605],"about_ca_topic_score_codex":0.002132623,"about_ca_topic_score_gemma":0.0014570563,"teacher_disagreement_score":0.006019962,"about_ca_system_score_codex":0.001243336,"about_ca_system_score_gemma":0.00053325424,"threshold_uncertainty_score":0.02013874},"labels":[],"label_agreement":null},{"id":"W4396872920","doi":"10.1007/s00453-024-01236-1","title":"Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Parameterized complexity; Theory of computation; Center (category theory); Computer science; Algorithm; Approximation algorithm; Cluster analysis; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.023096027130502784,"score_gpt":0.2990533772984482,"score_spread":0.2759573501679454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396872920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042440757,0.0124728875,0.9106131,0.005901194,0.0008552292,0.00045328838,0.0016406055,0.0021003603,0.023522636],"genre_scores_gemma":[0.38655153,0.009196966,0.5716941,0.0022477366,0.0022381197,0.0014316229,0.005051725,0.0030468982,0.018541418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98587865,0.004604042,0.0006446699,0.003124386,0.0036263117,0.002122026],"domain_scores_gemma":[0.9371958,0.040444717,0.003184835,0.011773208,0.004707404,0.0026939877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011845443,0.005794395,0.0064973803,0.0051644645,0.0051207086,0.01321442,0.019209754,0.0071326955,0.015526065],"category_scores_gemma":[0.072473064,0.0026763042,0.004976871,0.018165752,0.00686887,0.025884775,0.01071157,0.016529944,0.004857878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023643253,0.0013721273,0.004045721,0.0015468079,0.0005218607,0.00017843663,0.0011889979,0.43004856,0.0035726503,0.35739934,0.04773328,0.15002787],"study_design_scores_gemma":[0.00014862468,0.00013269184,0.00068014197,0.00014461909,0.00021707288,0.00021343702,0.00029253462,0.70781887,0.0016314394,0.28208235,0.0065658134,0.0000723881],"about_ca_topic_score_codex":0.010500015,"about_ca_topic_score_gemma":0.015354667,"teacher_disagreement_score":0.019209754,"about_ca_system_score_codex":0.015531459,"about_ca_system_score_gemma":0.009872753,"threshold_uncertainty_score":0.11268914},"labels":[],"label_agreement":null},{"id":"W4396892769","doi":"10.1145/3651144","title":"On Reporting Durable Patterns in Temporal Proximity Graphs","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.08898262796644435,"score_gpt":0.3509226316586121,"score_spread":0.26194000369216774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396892769","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21445453,0.0038429408,0.7467605,0.0033235403,0.0004151045,0.00054769916,0.010209891,0.012878201,0.0075675966],"genre_scores_gemma":[0.74037284,0.0012731705,0.24477397,0.0006585868,0.00027267236,0.00030445674,0.008913123,0.0005866873,0.002844581],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99019486,0.0017508547,0.0012612303,0.0020679757,0.004112924,0.00061220344],"domain_scores_gemma":[0.9394614,0.029790048,0.0085572945,0.015029036,0.0057014637,0.0014607199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00434885,0.0012604654,0.0016662992,0.004998861,0.001511091,0.0033563888,0.0025188697,0.002103411,0.0024967538],"category_scores_gemma":[0.07849787,0.0007972623,0.00078257994,0.010401985,0.0014520218,0.011592067,0.004709005,0.0018531987,0.0013123138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021123243,0.00044796808,0.06291169,0.001382423,0.00036235063,0.0014072751,0.002773007,0.29368642,0.019845873,0.070450656,0.03765471,0.5069654],"study_design_scores_gemma":[0.00012399576,0.00034006368,0.0076572797,0.00011303173,0.00012266156,0.0020371408,0.0013143014,0.80155796,0.01030641,0.15741551,0.018901577,0.00011006443],"about_ca_topic_score_codex":0.008415269,"about_ca_topic_score_gemma":0.008173718,"teacher_disagreement_score":0.008415269,"about_ca_system_score_codex":0.001575254,"about_ca_system_score_gemma":0.0017218416,"threshold_uncertainty_score":0.022999167},"labels":[],"label_agreement":null},{"id":"W4396904930","doi":"10.1007/s00493-024-00106-2","title":"List-k-Coloring H-Free Graphs for All $$k&gt;4$$","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.03212748022118933,"score_gpt":0.3144627735592146,"score_spread":0.28233529333802526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396904930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3792717,0.0010823641,0.32061872,0.012374806,0.0010871134,0.00072404376,0.030983744,0.012802689,0.24105483],"genre_scores_gemma":[0.7842073,0.0006855529,0.09929721,0.0032346665,0.00028754617,0.00064189633,0.017737282,0.0025975837,0.09131098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998776,0.00014271522,0.0000490223,0.00038024777,0.00015151603,0.00050039665],"domain_scores_gemma":[0.99345374,0.0025628945,0.0005041057,0.0016497994,0.0009709151,0.0008585894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667312,0.0012473364,0.00083778345,0.0009935182,0.0031080362,0.003648406,0.0027807201,0.00149651,0.036668994],"category_scores_gemma":[0.004086096,0.00084586616,0.0010632388,0.0014504001,0.0016481142,0.0043890867,0.002514997,0.003277268,0.008098781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023133021,0.00083587045,0.007988652,0.0014130133,0.00024163414,0.0007395557,0.0012630502,0.012698255,0.03310633,0.6358971,0.20617424,0.09732908],"study_design_scores_gemma":[0.00024105773,0.000116061085,0.0044708084,0.00010333362,0.0001814278,0.001166032,0.0008072925,0.025768869,0.02239453,0.89104664,0.053604517,0.000099516],"about_ca_topic_score_codex":0.0034439464,"about_ca_topic_score_gemma":0.0062070987,"teacher_disagreement_score":0.036668994,"about_ca_system_score_codex":0.0021420952,"about_ca_system_score_gemma":0.0025579457,"threshold_uncertainty_score":0.122669995},"labels":[],"label_agreement":null},{"id":"W4396917302","doi":"10.1051/ro/2024108","title":"Graphs obtained by disjoint unions and joins of cliques and stable sets","year":2024,"lang":"en","type":"article","venue":"RAIRO. Operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Joins; Disjoint sets; Combinatorics; Mathematics; Computer science; Programming language","score_opus":0.047757475617777975,"score_gpt":0.394298531317709,"score_spread":0.346541055699931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396917302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6382519,0.00038949397,0.3276283,0.00022534894,0.000054580487,0.00017776029,0.0011406821,0.00068867067,0.03144325],"genre_scores_gemma":[0.88955104,0.00025855517,0.09986393,0.00009273758,0.00003841643,0.00012864586,0.001703734,0.00020240784,0.008160553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999652,0.000052120075,0.000014653774,0.00011015378,0.000110162924,0.00006098401],"domain_scores_gemma":[0.9991061,0.0003721996,0.00017388229,0.00015478587,0.00009300558,0.000099976925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002750548,0.00035502444,0.0002870144,0.0010302293,0.0009417058,0.00090240967,0.00055287057,0.00032334737,0.0034309654],"category_scores_gemma":[0.001803085,0.00029463277,0.0006041048,0.0010541923,0.00087282737,0.0016208575,0.0009424261,0.00049376406,0.00043573583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005662085,0.00022360528,0.007085181,0.00041683216,0.00014000203,0.0012035264,0.001333543,0.058174375,0.06393153,0.7273761,0.0054404195,0.13410862],"study_design_scores_gemma":[0.00009747727,0.00023226092,0.0092763305,0.00008036872,0.00017665874,0.0017856736,0.0010349989,0.13825125,0.06557246,0.7508363,0.03258692,0.00006934609],"about_ca_topic_score_codex":0.0007924768,"about_ca_topic_score_gemma":0.0015015033,"teacher_disagreement_score":0.0034309654,"about_ca_system_score_codex":0.00042286652,"about_ca_system_score_gemma":0.00035449784,"threshold_uncertainty_score":0.011477709},"labels":[],"label_agreement":null},{"id":"W4398143410","doi":"10.1007/s10878-024-01177-z","title":"On the oriented diameter of planar triangulations","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Treewidth; Pathwidth; Outerplanar graph; Bounded function; 1-planar graph; Discrete mathematics; Upper and lower bounds; Book embedding; Graph; Chordal graph; Line graph","score_opus":0.015825023237351098,"score_gpt":0.2827445070449693,"score_spread":0.2669194838076182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398143410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61877966,0.0139606595,0.23072691,0.0053882482,0.0010833774,0.00011173523,0.0014813775,0.00041438593,0.12805355],"genre_scores_gemma":[0.9348143,0.008014876,0.0422003,0.0006750255,0.0015972374,0.00017627473,0.0008829847,0.00048484636,0.011154179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890924,0.0003835984,0.00004538727,0.0002037271,0.00027233557,0.00018574382],"domain_scores_gemma":[0.98118114,0.014162766,0.0016912811,0.00053687167,0.0009947745,0.0014330818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001726686,0.0013433524,0.001587457,0.0042657848,0.001385732,0.0029259,0.0025548427,0.0014915279,0.0073866686],"category_scores_gemma":[0.01954756,0.0012067511,0.0007139304,0.0027479462,0.0034453524,0.0053775315,0.0033030047,0.0024507293,0.00094811304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050633406,0.00012214013,0.0082222475,0.00048929075,0.000085898384,0.00030384547,0.0008313058,0.079725094,0.0064529344,0.8456998,0.014345878,0.043215208],"study_design_scores_gemma":[0.00010253254,0.00014353504,0.006848987,0.00026459392,0.000094056486,0.0005211498,0.0007081823,0.2077907,0.0016929774,0.7684169,0.013336576,0.00007994675],"about_ca_topic_score_codex":0.0021067515,"about_ca_topic_score_gemma":0.0019724024,"teacher_disagreement_score":0.0073866686,"about_ca_system_score_codex":0.002068789,"about_ca_system_score_gemma":0.0005227931,"threshold_uncertainty_score":0.024710834},"labels":[],"label_agreement":null},{"id":"W4398163973","doi":"10.1109/dcc58796.2024.00058","title":"Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Bounded function; Combinatorics; Interval (graph theory); Graph; Degree (music); Interval graph; Discrete mathematics; Mathematics; Computer science; Line graph; Physics; Pathwidth; Mathematical analysis","score_opus":0.0951751355430854,"score_gpt":0.38383912099140566,"score_spread":0.2886639854483203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398163973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15956582,0.0013402646,0.8060462,0.0032732575,0.0002618977,0.0004447929,0.009680489,0.009305357,0.0100819385],"genre_scores_gemma":[0.52719736,0.00088176545,0.44287154,0.0009935446,0.0002052501,0.00087681547,0.01669264,0.0014985411,0.008782512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965599,0.0007005648,0.00047495303,0.00070614053,0.0011324926,0.00042589134],"domain_scores_gemma":[0.9791767,0.00880838,0.0018919345,0.007988732,0.0015571848,0.000577115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024658309,0.000942854,0.0012876071,0.0016938396,0.0015279817,0.004083518,0.0034327852,0.0015933113,0.009441666],"category_scores_gemma":[0.015141269,0.0010106686,0.0012841278,0.0048114993,0.0016622547,0.012634254,0.0036937147,0.0030171373,0.0021106135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034964213,0.0006474142,0.0060224873,0.0012217719,0.00014477318,0.00042184608,0.0016500781,0.11710374,0.027752237,0.4466021,0.050364595,0.34457245],"study_design_scores_gemma":[0.00046367533,0.00051603024,0.0010272558,0.00029521508,0.00013557241,0.00042873243,0.0008601476,0.32344866,0.042946592,0.58299196,0.046735957,0.0001503251],"about_ca_topic_score_codex":0.0018641443,"about_ca_topic_score_gemma":0.0032432172,"teacher_disagreement_score":0.009441666,"about_ca_system_score_codex":0.0026755088,"about_ca_system_score_gemma":0.002244231,"threshold_uncertainty_score":0.031585574},"labels":[],"label_agreement":null},{"id":"W4399075280","doi":"10.1007/s00453-024-01242-3","title":"Approximation Algorithms for Covering Vertices by Long Paths","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology of the People's Republic of China","keywords":"Theory of computation; Combinatorics; Approximation algorithm; Computer science; Algorithm; Mathematics; Discrete mathematics","score_opus":0.02174289278522585,"score_gpt":0.30872613055365705,"score_spread":0.2869832377684312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399075280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10276844,0.0023426365,0.8724887,0.0024885207,0.0002836284,0.0004554837,0.0018226143,0.0030743082,0.014275594],"genre_scores_gemma":[0.34525052,0.0017184558,0.6331534,0.0006997452,0.00036541445,0.00070414867,0.004472443,0.0010371564,0.012598738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971635,0.00068360235,0.00013824503,0.00076604524,0.0006693006,0.000579395],"domain_scores_gemma":[0.98622364,0.009295085,0.00068629486,0.0024289594,0.0006077102,0.0007583928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002476975,0.002875835,0.0029580223,0.0028884504,0.0021780045,0.0043175505,0.0070981216,0.0037545946,0.017437877],"category_scores_gemma":[0.016847355,0.0018160379,0.0029760285,0.0074539413,0.002409125,0.011496649,0.005377863,0.0052172365,0.0028777036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017791258,0.0011513353,0.0042585577,0.0013274834,0.00036482167,0.0002640414,0.00097464013,0.42937234,0.0047009415,0.14312845,0.040586267,0.372092],"study_design_scores_gemma":[0.0003307747,0.00015740436,0.0004912616,0.00009662045,0.00018270964,0.0002523043,0.0002623471,0.7286566,0.0021128103,0.26183984,0.005584017,0.000033346645],"about_ca_topic_score_codex":0.0052502975,"about_ca_topic_score_gemma":0.007968389,"teacher_disagreement_score":0.017437877,"about_ca_system_score_codex":0.00429088,"about_ca_system_score_gemma":0.0029884698,"threshold_uncertainty_score":0.058335483},"labels":[],"label_agreement":null},{"id":"W4399213339","doi":"10.37236/12429","title":"Constructing Graphs with No Independent Transversals","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Maximal independent set; Chordal graph; 1-planar graph; Graph","score_opus":0.007709438158755823,"score_gpt":0.25164732720706195,"score_spread":0.24393788904830613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399213339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7828524,0.00037522617,0.19876707,0.00072508585,0.000059813876,0.00008611621,0.0006571472,0.00072971557,0.015747447],"genre_scores_gemma":[0.8734915,0.00034266294,0.11837477,0.00027940102,0.00004232315,0.00010746894,0.0018669835,0.00027309454,0.005221828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941504,0.00015908203,0.000029114992,0.00019289998,0.00010046659,0.000103489016],"domain_scores_gemma":[0.9958851,0.0014435456,0.000593769,0.0012137454,0.00046701054,0.00039686446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005544707,0.0005580141,0.0005787053,0.00088778377,0.00089403667,0.0008925012,0.0010708214,0.0007254743,0.0030521383],"category_scores_gemma":[0.0040231906,0.0008165817,0.0007697608,0.0007707888,0.0012133301,0.0018102041,0.0018859135,0.0017273336,0.0006021547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009821852,0.00027804615,0.019449817,0.000804045,0.0001620007,0.0011524127,0.0023202377,0.046791207,0.116369285,0.712979,0.008832906,0.08987881],"study_design_scores_gemma":[0.00020033437,0.0004827103,0.007664712,0.00020472189,0.00023827692,0.002063422,0.0014136093,0.17382897,0.051643066,0.73930794,0.022852166,0.000099992765],"about_ca_topic_score_codex":0.0007828018,"about_ca_topic_score_gemma":0.0020229213,"teacher_disagreement_score":0.0030521383,"about_ca_system_score_codex":0.0007920182,"about_ca_system_score_gemma":0.0005424729,"threshold_uncertainty_score":0.010210454},"labels":[],"label_agreement":null},{"id":"W4399262599","doi":"10.1007/978-3-031-47417-0_12","title":"Treewidth, Circle Graphs and Circular Drawings","year":2024,"lang":"en","type":"book-chapter","venue":"MATRIX book series","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Treewidth; Mathematics; Partial k-tree; 1-planar graph; Combinatorics; Chordal graph; Pathwidth; Graph; Line graph","score_opus":0.011174332977298888,"score_gpt":0.2525441712170429,"score_spread":0.24136983823974403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399262599","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004716919,0.03645202,0.048149604,0.0020982686,0.0020774503,0.00005041401,0.00070637214,0.000642188,0.9051067],"genre_scores_gemma":[0.059818905,0.054165322,0.05458334,0.0015492318,0.0020077766,0.00013044091,0.0019202018,0.0009340021,0.8248907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99988604,0.000015480915,0.00000366026,0.000030298486,0.00005262349,0.000011855511],"domain_scores_gemma":[0.9997383,0.00010700021,0.000021942742,0.000040167426,0.00006656034,0.000026070325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009921959,0.00066934567,0.0003591089,0.001034176,0.00072962395,0.0021472801,0.0007729524,0.0006093854,0.050336797],"category_scores_gemma":[0.00093316747,0.00045080885,0.00026176768,0.003950171,0.0007155232,0.0029631695,0.00051905,0.001377772,0.013244516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026037098,0.00003340107,0.00009038229,0.0002619639,0.0000055308815,0.00004014034,0.00018107973,0.002187334,0.0012199045,0.5124021,0.27800602,0.20554608],"study_design_scores_gemma":[0.0000063820826,0.000014261016,0.0002886328,0.0001149627,0.000007756035,0.00020501297,0.00015717166,0.0021442934,0.000507209,0.31894004,0.6776045,0.000009838229],"about_ca_topic_score_codex":0.002620162,"about_ca_topic_score_gemma":0.004811211,"teacher_disagreement_score":0.050336797,"about_ca_system_score_codex":0.00097451906,"about_ca_system_score_gemma":0.0006156587,"threshold_uncertainty_score":0.16839337},"labels":[],"label_agreement":null},{"id":"W4399357727","doi":"10.1016/j.tcs.2024.114676","title":"The zero-visibility cops and robber game on graph products","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Partition (number theory); Vertex (graph theory); Graph; Graph partition; Discrete mathematics; Monotonic function; Zero (linguistics)","score_opus":0.01449946632246951,"score_gpt":0.2950471680457049,"score_spread":0.2805477017232354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399357727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.508132,0.0006138951,0.37864095,0.002840506,0.00021041687,0.00027422456,0.000604671,0.000304249,0.10837906],"genre_scores_gemma":[0.9426005,0.00035177468,0.02879521,0.0001563862,0.00007542917,0.00013331363,0.0002554324,0.00010695269,0.027524984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985453,0.0005574066,0.000052465493,0.0002836612,0.00026128656,0.000299935],"domain_scores_gemma":[0.99647874,0.0020192647,0.0002797645,0.00035289742,0.00022134656,0.00064806826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011438902,0.0011367601,0.0016935654,0.0010139955,0.0015730057,0.003741544,0.0027125953,0.002873718,0.010649908],"category_scores_gemma":[0.006453891,0.0007729105,0.0007945679,0.0010743298,0.003391377,0.007037226,0.003085651,0.0025554614,0.00069898705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002734795,0.00011274309,0.00037898036,0.00013688269,0.000041718842,0.00022354959,0.0003683299,0.039356533,0.0013063381,0.9433677,0.004478812,0.009954764],"study_design_scores_gemma":[0.00006673989,0.000061115665,0.00024592507,0.00002997092,0.000022277469,0.00009592158,0.00017705347,0.15215208,0.0005535898,0.84366345,0.0029057655,0.000026117206],"about_ca_topic_score_codex":0.0045159794,"about_ca_topic_score_gemma":0.003540784,"teacher_disagreement_score":0.010649908,"about_ca_system_score_codex":0.001514074,"about_ca_system_score_gemma":0.0016799442,"threshold_uncertainty_score":0.035627544},"labels":[],"label_agreement":null},{"id":"W4399377993","doi":"10.1145/3662158.3662796","title":"(Δ+1) Vertex Coloring in <i>O</i> ( <i>n</i> ) Communication","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex (graph theory); Computer science; Combinatorics; Mathematics; Theoretical computer science; Graph","score_opus":0.0203841843562385,"score_gpt":0.30369220479877135,"score_spread":0.28330802044253284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399377993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26193675,0.0011698713,0.6846188,0.009303778,0.00047167874,0.0007744045,0.0013119205,0.0028228378,0.03759],"genre_scores_gemma":[0.8173058,0.00066559465,0.16698134,0.0013141005,0.00034953194,0.00085885887,0.00064448,0.00084256765,0.011037569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901108,0.0036793966,0.0003662737,0.0019207136,0.001583624,0.002339204],"domain_scores_gemma":[0.9624059,0.028054005,0.0022419805,0.005885852,0.0007075092,0.00070472545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048012193,0.0014314054,0.0017226378,0.00059459696,0.0023855814,0.003996188,0.0040082578,0.0023597898,0.009795987],"category_scores_gemma":[0.020534595,0.0010463528,0.0016043397,0.0014946985,0.0031967561,0.00854286,0.003920562,0.004015498,0.0015494225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036588863,0.0008229126,0.003845578,0.0011859767,0.00028865828,0.0005722945,0.0007985419,0.5766663,0.024943735,0.28570554,0.017696869,0.08381467],"study_design_scores_gemma":[0.0005783426,0.00024171443,0.00090050045,0.00007300832,0.000120565215,0.00033467766,0.00018812393,0.74874085,0.012784329,0.2315894,0.004369741,0.000078823316],"about_ca_topic_score_codex":0.0037223788,"about_ca_topic_score_gemma":0.0063599595,"teacher_disagreement_score":0.009795987,"about_ca_system_score_codex":0.005281036,"about_ca_system_score_gemma":0.0051950603,"threshold_uncertainty_score":0.038316727},"labels":[],"label_agreement":null},{"id":"W4399552751","doi":"10.1007/s00373-024-02808-2","title":"Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum degree spanning tree; Graph; Geometric graph theory; Trémaux tree; Discrete mathematics; Line graph; Voltage graph; Pathwidth","score_opus":0.022334004117094065,"score_gpt":0.2883388245521849,"score_spread":0.2660048204350908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399552751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6842626,0.00084228383,0.23992236,0.0017591187,0.00036952196,0.00013028683,0.0014799905,0.0006496864,0.07058419],"genre_scores_gemma":[0.9536513,0.0003008698,0.026243774,0.0002869105,0.000065001674,0.00008029567,0.00047793848,0.00012508853,0.018768772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997793,0.000042937674,0.000009515439,0.000045457007,0.000057956604,0.000064922926],"domain_scores_gemma":[0.99924785,0.000339792,0.00009346392,0.00012758312,0.000113707894,0.00007752533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028852638,0.00026534993,0.0003120334,0.0009353394,0.0008032634,0.001001015,0.00044319185,0.000780765,0.0064367605],"category_scores_gemma":[0.00208627,0.00016218788,0.00027448632,0.0006239854,0.0008577707,0.0010398503,0.0007642104,0.00085729477,0.0007500777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016251666,0.000032669283,0.0006118143,0.00005565235,0.0000075881208,0.00014548226,0.00027519488,0.009276644,0.0058919755,0.95074093,0.004795209,0.028004205],"study_design_scores_gemma":[0.000020015961,0.000029559735,0.00058786356,0.000038536033,0.0000084949725,0.0001690556,0.000099212484,0.041482683,0.0029334917,0.9487847,0.005826197,0.000020119614],"about_ca_topic_score_codex":0.0022754646,"about_ca_topic_score_gemma":0.0031299682,"teacher_disagreement_score":0.0064367605,"about_ca_system_score_codex":0.00087178464,"about_ca_system_score_gemma":0.00072873867,"threshold_uncertainty_score":0.021533132},"labels":[],"label_agreement":null},{"id":"W4399739735","doi":"10.1002/jgt.23143","title":"A tight upper bound on the average order of dominating sets of a graph","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph; Upper and lower bounds; Order (exchange); Discrete mathematics","score_opus":0.016489319360998834,"score_gpt":0.2957467529953223,"score_spread":0.2792574336343235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399739735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.618271,0.0046102596,0.33315563,0.0022116692,0.00027271092,0.00006528175,0.0032825975,0.0014018515,0.036728997],"genre_scores_gemma":[0.97306865,0.000940005,0.022644596,0.0002125083,0.00022693604,0.0000359687,0.0008323989,0.00017879826,0.0018601816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728465,0.00033456192,0.00012739828,0.00084123656,0.0007307671,0.0006813357],"domain_scores_gemma":[0.97546935,0.01655481,0.0015581094,0.0026207992,0.0018916338,0.001905365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024557493,0.0010984208,0.0020224198,0.0032440326,0.001798399,0.0056051943,0.0028173458,0.001509379,0.005219829],"category_scores_gemma":[0.016671434,0.00097443035,0.00082658994,0.0033943614,0.00209221,0.0079756705,0.0018780571,0.002595522,0.00062331994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019833834,0.0004129008,0.03130303,0.0009204811,0.00035101673,0.0005302343,0.0010763566,0.3112169,0.04893289,0.5139715,0.013431304,0.075870045],"study_design_scores_gemma":[0.000054962344,0.0002913945,0.009596643,0.00013834487,0.00012991825,0.00075043086,0.00034375157,0.5244259,0.017652983,0.43594503,0.010573348,0.00009732738],"about_ca_topic_score_codex":0.0018467773,"about_ca_topic_score_gemma":0.0023375766,"teacher_disagreement_score":0.0056051943,"about_ca_system_score_codex":0.0027506785,"about_ca_system_score_gemma":0.0007654804,"threshold_uncertainty_score":0.019957662},"labels":[],"label_agreement":null},{"id":"W4399888599","doi":"10.1007/978-3-031-63021-7_24","title":"Directed Path Partition Problem on Directed Acyclic Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Directed acyclic graph; Computer science; Partition (number theory); Directed graph; Path (computing); Longest path problem; Theoretical computer science; Algorithm; Graph; Combinatorics; Chordal graph; Mathematics; Programming language","score_opus":0.018878436264308907,"score_gpt":0.2743530151173555,"score_spread":0.2554745788530466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399888599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15811583,0.003697199,0.7547633,0.0045124018,0.00036018505,0.00081740285,0.0056106574,0.0013211061,0.070801914],"genre_scores_gemma":[0.46093532,0.004399439,0.47095188,0.0007272424,0.0005161914,0.0009880465,0.010616915,0.00080553535,0.05005944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904984,0.00030133405,0.000043402837,0.00027779897,0.00019439546,0.00013330542],"domain_scores_gemma":[0.9961706,0.0029835692,0.00018197519,0.00029006792,0.00017407302,0.00019982063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009814126,0.001144784,0.0018710251,0.0013581353,0.0009883172,0.0027177434,0.0025836478,0.0021976607,0.013311437],"category_scores_gemma":[0.006183462,0.0009956212,0.000849501,0.003330323,0.001189446,0.0065385746,0.0024985692,0.0022992184,0.0014407954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007406579,0.00048651348,0.0011189234,0.0018560719,0.00019438984,0.00036701647,0.0005356149,0.3621076,0.0044377493,0.2971286,0.055355687,0.27567124],"study_design_scores_gemma":[0.00018839526,0.00011737095,0.00062348414,0.00016721422,0.000078289704,0.0002962062,0.0003952864,0.38396695,0.002645066,0.5948974,0.016592441,0.00003190058],"about_ca_topic_score_codex":0.0027130884,"about_ca_topic_score_gemma":0.002516197,"teacher_disagreement_score":0.013311437,"about_ca_system_score_codex":0.0015303699,"about_ca_system_score_gemma":0.0012422061,"threshold_uncertainty_score":0.044531226},"labels":[],"label_agreement":null},{"id":"W4399888636","doi":"10.1007/978-3-031-63021-7_23","title":"On the Finiteness of k-Vertex-Critical $$2P_2$$-Free Graphs with Forbidden Induced Squids or Bulls","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island; The King's University","funders":"","keywords":"Vertex (graph theory); Computer science; Combinatorics; Discrete mathematics; Graph; Mathematics; Theoretical computer science","score_opus":0.03512476857951113,"score_gpt":0.30017009480869183,"score_spread":0.2650453262291807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399888636","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76582664,0.0012359271,0.08941373,0.0019611917,0.00020683094,0.00011445503,0.0009164209,0.0007193941,0.13960539],"genre_scores_gemma":[0.96254814,0.00045397767,0.0163945,0.0004283704,0.000097584,0.00012803648,0.00088323693,0.0002799365,0.018786196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995136,0.00009892329,0.000025166028,0.00014913856,0.00009249561,0.000120760764],"domain_scores_gemma":[0.99488187,0.0035656518,0.0003760797,0.0004123593,0.000330965,0.000433048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008153734,0.00065388065,0.0007359196,0.0015363569,0.0026395456,0.0028656528,0.0017439646,0.0010979259,0.008438123],"category_scores_gemma":[0.0045926077,0.0009364211,0.0009420723,0.0012069639,0.0035068027,0.004819387,0.0019517748,0.0022393856,0.00074032956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019406965,0.000046057263,0.001098873,0.00017197421,0.00002073437,0.0002514822,0.00095360266,0.005860832,0.0041037556,0.9749748,0.003686444,0.008637307],"study_design_scores_gemma":[0.00003008002,0.00002176716,0.0005006557,0.00004656273,0.0000200658,0.00017835229,0.00021745158,0.007969611,0.001972886,0.9857407,0.0032811943,0.000020678446],"about_ca_topic_score_codex":0.0024473567,"about_ca_topic_score_gemma":0.0034237956,"teacher_disagreement_score":0.008438123,"about_ca_system_score_codex":0.0016227848,"about_ca_system_score_gemma":0.0007976005,"threshold_uncertainty_score":0.028228283},"labels":[],"label_agreement":null},{"id":"W4399909327","doi":"10.1007/978-3-031-63021-7_37","title":"Broadcasting in Stars of Cliques","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Stars; Telecommunications; Astronomy; Computer security; Computer vision; Physics","score_opus":0.02653955470938015,"score_gpt":0.30489880643104855,"score_spread":0.2783592517216684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399909327","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.328911,0.0062612705,0.26100627,0.0044028126,0.00076261954,0.00024611285,0.0010741386,0.00077548577,0.39656037],"genre_scores_gemma":[0.7682127,0.004476741,0.07749971,0.00059178733,0.00076643616,0.00022881023,0.00096495124,0.00048063905,0.14677835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941397,0.00020459971,0.000024004878,0.00012233424,0.00012118179,0.00011399337],"domain_scores_gemma":[0.9957711,0.0030452998,0.00022069359,0.00025297963,0.00029032902,0.0004195708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006490518,0.00029366752,0.00095871004,0.0009646303,0.0017984094,0.0022246914,0.0010059567,0.0009479829,0.008881407],"category_scores_gemma":[0.004581247,0.00062232924,0.00073994655,0.0021619978,0.0014673176,0.0030701025,0.0015132336,0.002009006,0.0012818102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016386763,0.000033960652,0.00036696313,0.00025318522,0.000020930753,0.000101483165,0.00062528823,0.0055186045,0.002116487,0.9574464,0.011350206,0.022002622],"study_design_scores_gemma":[0.000042517073,0.000030200483,0.00037860466,0.000032111388,0.000018164817,0.00014543424,0.00016056215,0.014044377,0.0006941443,0.9710035,0.013440873,0.000009604584],"about_ca_topic_score_codex":0.0018532075,"about_ca_topic_score_gemma":0.0024039324,"teacher_disagreement_score":0.008881407,"about_ca_system_score_codex":0.0014219648,"about_ca_system_score_gemma":0.0006703668,"threshold_uncertainty_score":0.029711306},"labels":[],"label_agreement":null},{"id":"W4400139069","doi":"10.5539/jmr.v16n3p49","title":"2-Distance and 3-Distance Domination Numbers of the Sierpinski Star Graph","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universitas Diponegoro","keywords":"Combinatorics; Mathematics; Domination analysis; Vertex (graph theory); Graph; Bound graph; Discrete mathematics; Graph power; Line graph","score_opus":0.04679325449883979,"score_gpt":0.37815985448198125,"score_spread":0.33136659998314144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400139069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8998431,0.0011339603,0.07258851,0.00022260028,0.000042461164,0.000056613128,0.00056647474,0.000107402935,0.025438923],"genre_scores_gemma":[0.97963697,0.00043379283,0.017238345,0.0000399972,0.000036689114,0.000044307206,0.00026462958,0.000014071088,0.0022911832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995321,0.000090651185,0.000034287586,0.0001008395,0.00014040893,0.00010175269],"domain_scores_gemma":[0.9983317,0.0009923556,0.00025232832,0.00007405299,0.00018206968,0.00016748685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003749096,0.00032812564,0.00030569645,0.0016635053,0.00059996685,0.0009174507,0.00046733159,0.0002763726,0.0017204235],"category_scores_gemma":[0.0021922668,0.00017985556,0.00042401225,0.0011014233,0.0007298875,0.0017421227,0.00041230398,0.0004706586,0.00012958892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005485924,0.00014871953,0.017756304,0.0005040806,0.00009484468,0.0006878584,0.0011978543,0.1233838,0.039198037,0.7243424,0.0038692018,0.08826838],"study_design_scores_gemma":[0.000070664006,0.0002672755,0.0175109,0.00008197504,0.00009735009,0.0019851804,0.00063294044,0.41194543,0.02016413,0.530217,0.01689405,0.00013300344],"about_ca_topic_score_codex":0.0013645089,"about_ca_topic_score_gemma":0.0016558778,"teacher_disagreement_score":0.0017204235,"about_ca_system_score_codex":0.0009294948,"about_ca_system_score_gemma":0.00052228034,"threshold_uncertainty_score":0.0067439675},"labels":[],"label_agreement":null},{"id":"W4400213152","doi":"10.1137/23m1548633","title":"Complexity Classification of Counting Graph Homomorphisms Modulo a Prime Number","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modulo; Homomorphism; Prime (order theory); Prime number; Combinatorics; Mathematics; Discrete mathematics; Graph; Computer science","score_opus":0.0611886896354861,"score_gpt":0.34249233135040036,"score_spread":0.2813036417149143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400213152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78696024,0.0011219803,0.1656968,0.0068895984,0.00032938973,0.00020837985,0.0013942405,0.001106152,0.03629322],"genre_scores_gemma":[0.9540845,0.0005008312,0.03327757,0.00047334132,0.0008383305,0.00013673198,0.0016885764,0.0002783133,0.008721873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970843,0.00064134935,0.00014525041,0.0008022921,0.00080549094,0.0005212522],"domain_scores_gemma":[0.97341406,0.019909149,0.0020100505,0.0022099593,0.0009647143,0.0014920215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020675804,0.0010543395,0.0016361767,0.0037310205,0.0022790334,0.007017684,0.0038066853,0.0025751805,0.00939039],"category_scores_gemma":[0.018854188,0.00070515723,0.0015806968,0.003832454,0.0034870165,0.013878396,0.0028341883,0.0042638406,0.0006699395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006319965,0.0004177339,0.009334278,0.00035548615,0.00008368833,0.00023457075,0.0008287365,0.021718334,0.0051593096,0.8991276,0.012047109,0.05006125],"study_design_scores_gemma":[0.00005914997,0.0000651688,0.0020570157,0.00003476929,0.000055430548,0.00028707628,0.00015748195,0.106707714,0.0022092278,0.88603806,0.0022930286,0.000035810845],"about_ca_topic_score_codex":0.0018471227,"about_ca_topic_score_gemma":0.0016541688,"teacher_disagreement_score":0.00939039,"about_ca_system_score_codex":0.0042730463,"about_ca_system_score_gemma":0.00186544,"threshold_uncertainty_score":0.031413972},"labels":[],"label_agreement":null},{"id":"W4400218314","doi":"10.3389/fbinf.2024.1391086","title":"Maximum-scoring path sets on pangenome graphs of constant treewidth","year":2024,"lang":"en","type":"article","venue":"Frontiers in Bioinformatics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"HORIZON EUROPE Marie Sklodowska-Curie Actions; European Commission; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Natural Sciences and Engineering Research Council of Canada; Agentúra Ministerstva Školstva, Vedy, Výskumu a Športu SR; National Institutes of Health; National Human Genome Research Institute; Agentúra na Podporu Výskumu a Vývoja","keywords":"Treewidth; Constant (computer programming); Path (computing); Mathematics; Combinatorics; Partial k-tree; Pathwidth; 1-planar graph; Graph; Computer science; Chordal graph","score_opus":0.0175788546057046,"score_gpt":0.26583076268259626,"score_spread":0.24825190807689165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400218314","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1524564,0.000583654,0.8412794,0.00065151986,0.000029620018,0.00028257907,0.0012456189,0.0012135137,0.0022577185],"genre_scores_gemma":[0.26029655,0.0005119554,0.7314967,0.0002045734,0.000048555517,0.00039897716,0.0038775166,0.00042796024,0.002737269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989497,0.00027771178,0.000062551786,0.00039087108,0.00021692211,0.00010220705],"domain_scores_gemma":[0.99346364,0.004512753,0.00068977266,0.0006586789,0.0004004727,0.00027465296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013920856,0.0013273383,0.001372606,0.0023638166,0.0010662798,0.0013958346,0.0020508196,0.001670845,0.0035411504],"category_scores_gemma":[0.01035731,0.0010189717,0.0012982702,0.002950564,0.0012602288,0.004919608,0.0026260342,0.0017571746,0.00061073725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066449994,0.00035045922,0.00611619,0.0013492381,0.00024416696,0.0006212047,0.0010031622,0.50325435,0.02454758,0.13699065,0.011083685,0.31377476],"study_design_scores_gemma":[0.0000756053,0.00012068149,0.0009881736,0.00006385515,0.000048633414,0.00035102287,0.00021644223,0.6181858,0.006144991,0.36975887,0.0040206397,0.000025229047],"about_ca_topic_score_codex":0.0011769285,"about_ca_topic_score_gemma":0.0018103393,"teacher_disagreement_score":0.0035411504,"about_ca_system_score_codex":0.000953331,"about_ca_system_score_gemma":0.0008872506,"threshold_uncertainty_score":0.011846304},"labels":[],"label_agreement":null},{"id":"W4400467622","doi":"10.1137/23m1591773","title":"Product Structure Extension of the Alon–Seymour–Thomas Theorem","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki; Fonds De La Recherche Scientifique - FNRS; Australian Government; National Science Foundation","keywords":"Mathematics; Extension (predicate logic); Combinatorics; Product (mathematics); Discrete mathematics; Structured program theorem; Geometry; Computer science","score_opus":0.019635966402535964,"score_gpt":0.30057751453888726,"score_spread":0.2809415481363513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400467622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51188004,0.0011691782,0.33118996,0.0015713685,0.00027057808,0.00011630534,0.0010427309,0.0008437764,0.15191612],"genre_scores_gemma":[0.9373149,0.0006438259,0.041324846,0.00043005435,0.00023479745,0.000100865196,0.00083084416,0.00023160518,0.018888315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963593,0.00003270159,0.0000148421705,0.00013025379,0.000099545934,0.00008668643],"domain_scores_gemma":[0.9986058,0.00050174416,0.00012458737,0.00035123102,0.00023815532,0.00017838438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036791206,0.00038872685,0.00051984494,0.0007058339,0.0010471162,0.0010293772,0.00093638897,0.0006069885,0.010372816],"category_scores_gemma":[0.0017322808,0.0004497971,0.0009802468,0.00056483917,0.0014316256,0.00420225,0.0019596189,0.0017113604,0.0010694518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015874079,0.000049876082,0.0013741788,0.00013855114,0.000025816755,0.0003013535,0.0004569274,0.0040262025,0.0077801286,0.95978004,0.0048228255,0.021085287],"study_design_scores_gemma":[0.000069495094,0.00017039808,0.0022301183,0.000023544208,0.00004499831,0.0009957553,0.00018231252,0.022303497,0.007126438,0.9369819,0.029838081,0.000033291813],"about_ca_topic_score_codex":0.0013655176,"about_ca_topic_score_gemma":0.0012483585,"teacher_disagreement_score":0.010372816,"about_ca_system_score_codex":0.00054118433,"about_ca_system_score_gemma":0.00036136314,"threshold_uncertainty_score":0.034700513},"labels":[],"label_agreement":null},{"id":"W4400484640","doi":"10.61091/jcmcc120-38","title":"A New Lower Bound for the Domination Number of Complete Cylindrical Grid Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Grid; Domination analysis; Upper and lower bounds; Mathematics; Combinatorics; Computer science; Geometry; Graph; Mathematical analysis; Vertex (graph theory)","score_opus":0.023852832496387914,"score_gpt":0.31446046119005205,"score_spread":0.29060762869366413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400484640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067002915,0.0014701367,0.89262885,0.0012182684,0.00022006554,0.00012238977,0.00074098306,0.0007599676,0.03583641],"genre_scores_gemma":[0.561825,0.0018361832,0.41834193,0.0005988502,0.0004102122,0.00059078046,0.0016410819,0.0007022969,0.014053705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875486,0.00020126489,0.00005516757,0.00031878112,0.0004171535,0.00025273615],"domain_scores_gemma":[0.9934321,0.0043751444,0.00039733446,0.0007397511,0.0005850467,0.00047065318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013596591,0.0013135587,0.0014005777,0.002218164,0.0012672329,0.003401051,0.002858931,0.0011533805,0.007866618],"category_scores_gemma":[0.008565143,0.0006860335,0.0011254905,0.0021672135,0.0016690198,0.0054521826,0.002965144,0.004263183,0.0009688917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004988005,0.00028260387,0.0039392607,0.0007449356,0.00015819474,0.00033783828,0.00042659824,0.32341748,0.0308931,0.5084191,0.018416474,0.11246562],"study_design_scores_gemma":[0.000051662657,0.00010055502,0.0010076853,0.00008134306,0.000060523853,0.0002419576,0.000067127774,0.73088753,0.006719616,0.24909876,0.011638202,0.000045101293],"about_ca_topic_score_codex":0.0020316588,"about_ca_topic_score_gemma":0.0033453621,"teacher_disagreement_score":0.007866618,"about_ca_system_score_codex":0.0023893497,"about_ca_system_score_gemma":0.0010969234,"threshold_uncertainty_score":0.026316464},"labels":[],"label_agreement":null},{"id":"W4400484698","doi":"10.61091/jcmcc120-37","title":"On Vertex-Euclidean Deficiency of Complete Fan Graphs and Complete Wheel Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Combinatorics; Euclidean geometry; Mathematics; 1-planar graph; Indifference graph; Chordal graph; Graph; Geometry","score_opus":0.024362601796538607,"score_gpt":0.2847584975143031,"score_spread":0.2603958957177645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400484698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8181071,0.0010697438,0.15501587,0.0011579811,0.000072898685,0.00005980446,0.0007367205,0.00011443063,0.023665447],"genre_scores_gemma":[0.96348244,0.0006443643,0.030754212,0.00012477998,0.00009297132,0.00005166226,0.0007138188,0.00005176351,0.004083997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993794,0.00022329777,0.000027546088,0.00016399754,0.00012339368,0.0000823854],"domain_scores_gemma":[0.9964348,0.0020067745,0.00058742595,0.00026015338,0.00030225958,0.00040852686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012042732,0.00061594986,0.0006352633,0.0015021046,0.0006830823,0.0011132902,0.00080768525,0.00073601777,0.0023912815],"category_scores_gemma":[0.0060345093,0.00038916213,0.00035907535,0.0012617776,0.0019378362,0.0036880248,0.0009670657,0.0008590303,0.0002458472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028124027,0.00006930714,0.0067231217,0.00014502213,0.00002047305,0.0002812277,0.00062372745,0.06246308,0.003898155,0.90366507,0.0027187061,0.01911086],"study_design_scores_gemma":[0.00004163126,0.00010495225,0.0036866567,0.00005881215,0.000019017185,0.0004949125,0.0005406738,0.14432338,0.0017440487,0.8409924,0.007960991,0.000032457323],"about_ca_topic_score_codex":0.0023078748,"about_ca_topic_score_gemma":0.001752314,"teacher_disagreement_score":0.0023912815,"about_ca_system_score_codex":0.0013808445,"about_ca_system_score_gemma":0.00039129035,"threshold_uncertainty_score":0.010018766},"labels":[],"label_agreement":null},{"id":"W4400485647","doi":"10.61091/jcmcc120-17","title":"A Sufficient Condition for Fractional ( 2 , b , k ) -Critical Covered Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02003362452505353,"score_gpt":0.32568461532104936,"score_spread":0.30565099079599584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400485647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88244325,0.00052862475,0.093653865,0.0009086991,0.00015592342,0.00020137428,0.0013240668,0.0005285739,0.020255724],"genre_scores_gemma":[0.9844961,0.00020486747,0.012601655,0.00017981135,0.00007217847,0.00008441456,0.0010724004,0.00006944971,0.0012189843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989792,0.00012407596,0.00006954457,0.00026003507,0.00017838525,0.00038875474],"domain_scores_gemma":[0.99447674,0.0029035106,0.0005518582,0.00039013385,0.0007280695,0.00094978674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064803066,0.00062627444,0.00086239696,0.0022567315,0.0020368167,0.0014662651,0.00097179966,0.0015037804,0.006161217],"category_scores_gemma":[0.007591497,0.0006758425,0.00090026093,0.0010038906,0.0016135351,0.0029010093,0.0021158122,0.001287213,0.00070438953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028546134,0.0005769002,0.029403718,0.000997533,0.00017934997,0.008166827,0.0028602036,0.075368114,0.1762905,0.64578134,0.015330211,0.04219065],"study_design_scores_gemma":[0.0004483576,0.0010036223,0.020543791,0.0003394108,0.00021993778,0.00741072,0.0040113376,0.2993226,0.090242855,0.5399411,0.036206063,0.00031027306],"about_ca_topic_score_codex":0.0022297895,"about_ca_topic_score_gemma":0.0019670536,"teacher_disagreement_score":0.006161217,"about_ca_system_score_codex":0.0010516028,"about_ca_system_score_gemma":0.0008728348,"threshold_uncertainty_score":0.020611286},"labels":[],"label_agreement":null},{"id":"W4400485947","doi":"10.61091/jcmcc120-03","title":"Carathéodory Number of P 3 -Convexity of Claw-Free Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Convexity; Mathematics; Combinatorics; Biology; Economics","score_opus":0.01864598468377219,"score_gpt":0.30034493183276073,"score_spread":0.2816989471489885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400485947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9205028,0.00070926565,0.04593814,0.0009161984,0.000050953848,0.00006411965,0.0009004779,0.00013285763,0.030785274],"genre_scores_gemma":[0.9866931,0.00041031223,0.009566677,0.00009193569,0.000055918805,0.00005464481,0.0005085419,0.000039456892,0.0025794983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958676,0.00007645502,0.000016054035,0.000120744604,0.00008568332,0.00011429635],"domain_scores_gemma":[0.9958371,0.0024048241,0.00038618053,0.0003205096,0.00025626394,0.0007950866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005657794,0.00054848316,0.0006048241,0.0016903816,0.0011779935,0.002069104,0.0011245025,0.0006327013,0.004568492],"category_scores_gemma":[0.0039389418,0.00048197972,0.00061733683,0.0010272396,0.0023930226,0.0024598457,0.0010414693,0.00196746,0.0003715494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004207501,0.00010149393,0.011245847,0.00019550264,0.000060332553,0.000547836,0.0006804649,0.03144971,0.011410569,0.910608,0.0077452464,0.025534336],"study_design_scores_gemma":[0.000046883244,0.00011158619,0.0088427905,0.000055483193,0.0000450463,0.0009863542,0.00033116725,0.11652678,0.010562552,0.8528566,0.009562161,0.00007249096],"about_ca_topic_score_codex":0.0020633347,"about_ca_topic_score_gemma":0.0020602832,"teacher_disagreement_score":0.004568492,"about_ca_system_score_codex":0.0015501479,"about_ca_system_score_gemma":0.00083503657,"threshold_uncertainty_score":0.015283108},"labels":[],"label_agreement":null},{"id":"W4400486273","doi":"10.61091/jcmcc121-10","title":"Introducing 3-Path Domination in Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"City University of New York; Virginia Commonwealth University; National Science Foundation","keywords":"Path (computing); Mathematics; Computer science; Combinatorics; Computer network","score_opus":0.01262711222905419,"score_gpt":0.28516963011301527,"score_spread":0.27254251788396106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04324259,0.012091975,0.90458894,0.0023726132,0.00075578585,0.000333239,0.0013680856,0.00079840905,0.03444827],"genre_scores_gemma":[0.49700987,0.012730362,0.47555503,0.0029820928,0.0015374981,0.0007892771,0.0013610538,0.00042992618,0.0076049315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968982,0.00076405343,0.00019286541,0.00093905994,0.00083754945,0.00036830516],"domain_scores_gemma":[0.99430484,0.0034652539,0.00054083974,0.0006594117,0.0006603173,0.00036931556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018408151,0.0022318156,0.0010026839,0.0028223458,0.0016509081,0.0026130006,0.002122236,0.0016230874,0.0031796878],"category_scores_gemma":[0.0065122982,0.00083460304,0.0013877149,0.0052659977,0.004117075,0.008502097,0.0041779745,0.0041268934,0.0008430853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015312409,0.0001139392,0.0016439941,0.0005744961,0.00008630407,0.00045470698,0.0006829454,0.08008823,0.0066730483,0.84605443,0.010224866,0.053249866],"study_design_scores_gemma":[0.000030365285,0.00013414692,0.0006651127,0.00013941439,0.000062765626,0.0007279923,0.00012131678,0.09009342,0.002477963,0.84046996,0.06501739,0.000060182407],"about_ca_topic_score_codex":0.0028034202,"about_ca_topic_score_gemma":0.0020469713,"teacher_disagreement_score":0.003443033,"about_ca_system_score_codex":0.003443033,"about_ca_system_score_gemma":0.0011862026,"threshold_uncertainty_score":0.024981081},"labels":[],"label_agreement":null},{"id":"W4400486360","doi":"10.61091/jcmcc121-04","title":"On Vertex-Euclidean Deficiency of Complete Fan Graphs and Complete Wheel Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Combinatorics; Euclidean geometry; Mathematics; 1-planar graph; Chordal graph; Graph; Computer science; Geometry","score_opus":0.024362601796538607,"score_gpt":0.2847584975143031,"score_spread":0.2603958957177645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8181071,0.0010697438,0.15501587,0.0011579811,0.000072898685,0.00005980446,0.0007367205,0.00011443063,0.023665447],"genre_scores_gemma":[0.96348244,0.0006443643,0.030754212,0.00012477998,0.00009297132,0.00005166226,0.0007138188,0.00005176351,0.004083997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993794,0.00022329777,0.000027546088,0.00016399754,0.00012339368,0.0000823854],"domain_scores_gemma":[0.9964348,0.0020067745,0.00058742595,0.00026015338,0.00030225958,0.00040852686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012042732,0.00061594986,0.0006352633,0.0015021046,0.0006830823,0.0011132902,0.00080768525,0.00073601777,0.0023912815],"category_scores_gemma":[0.0060345093,0.00038916213,0.00035907535,0.0012617776,0.0019378362,0.0036880248,0.0009670657,0.0008590303,0.0002458472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028124027,0.00006930714,0.0067231217,0.00014502213,0.00002047305,0.0002812277,0.00062372745,0.06246308,0.003898155,0.90366507,0.0027187061,0.01911086],"study_design_scores_gemma":[0.00004163126,0.00010495225,0.0036866567,0.00005881215,0.000019017185,0.0004949125,0.0005406738,0.14432338,0.0017440487,0.8409924,0.007960991,0.000032457323],"about_ca_topic_score_codex":0.0023078748,"about_ca_topic_score_gemma":0.001752314,"teacher_disagreement_score":0.0023912815,"about_ca_system_score_codex":0.0013808445,"about_ca_system_score_gemma":0.00039129035,"threshold_uncertainty_score":0.010018766},"labels":[],"label_agreement":null},{"id":"W4400486492","doi":"10.61091/jcmcc121-02","title":"Realizing the Asymmetric Index of a Graph","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Index (typography); Graph; Computer science; Mathematics; Theoretical computer science; World Wide Web","score_opus":0.019716257370139226,"score_gpt":0.29545527896834994,"score_spread":0.27573902159821073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6595665,0.00034258488,0.30991614,0.00095026114,0.00009906715,0.00007957179,0.0003797742,0.0003321671,0.028333822],"genre_scores_gemma":[0.9781628,0.0001043989,0.020466354,0.000083710656,0.000074261065,0.000041047595,0.00015034359,0.00003921797,0.0008778497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868995,0.00031248204,0.000078468904,0.00036135342,0.00041079376,0.00014696976],"domain_scores_gemma":[0.99307656,0.0026248838,0.001169257,0.0019414577,0.00062753435,0.0005602345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000838871,0.00032276806,0.0004183456,0.0008933196,0.00067190704,0.0013360853,0.0008133759,0.0007887862,0.0018396291],"category_scores_gemma":[0.007360747,0.00024824406,0.00032699393,0.00060013443,0.0018486001,0.0034260028,0.0015293908,0.0011067917,0.0003925008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003757325,0.00011298305,0.01322062,0.00019937643,0.00004032432,0.0004381486,0.0005935864,0.027840054,0.04582787,0.85209626,0.0017864464,0.057468683],"study_design_scores_gemma":[0.000022594011,0.00013915128,0.0036123123,0.00003534694,0.000031453845,0.0008327234,0.00022762589,0.09012495,0.014622362,0.88494337,0.005373116,0.00003505127],"about_ca_topic_score_codex":0.00022659915,"about_ca_topic_score_gemma":0.00024741373,"teacher_disagreement_score":0.0018396291,"about_ca_system_score_codex":0.0006617652,"about_ca_system_score_gemma":0.00034768504,"threshold_uncertainty_score":0.0061541796},"labels":[],"label_agreement":null},{"id":"W4400512456","doi":"10.61091/ars159-12","title":"A Note on Acyclic Token Sliding Reconfiguration Graphs of Independent Sets","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Japan Society for the Promotion of Science; Vietnam Institute for Advanced Study in Mathematics","keywords":"Combinatorics; Security token; Graph; Control reconfiguration; Mathematics; Discrete mathematics; Computer science; Computer network","score_opus":0.022282467778505767,"score_gpt":0.3089376826373435,"score_spread":0.2866552148588377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29836905,0.0034715335,0.5289405,0.004546772,0.0006429473,0.00023780207,0.0010205627,0.0009146826,0.16185622],"genre_scores_gemma":[0.84935284,0.0035866753,0.1236418,0.0015103455,0.00088886695,0.0002038945,0.0011199017,0.0002562671,0.019439451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992889,0.00015203629,0.0000420485,0.00017896546,0.00021208108,0.0001259292],"domain_scores_gemma":[0.9961739,0.0023605856,0.0004971411,0.00039928165,0.0002968016,0.00027239343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006952951,0.00045894596,0.00036979493,0.0014267341,0.0012302704,0.0012688537,0.0010907447,0.00063647627,0.008262238],"category_scores_gemma":[0.0027184943,0.000500604,0.000955829,0.0021553647,0.0018016805,0.0032335618,0.001497391,0.0019487517,0.0005336778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015224246,0.00006541699,0.002120823,0.00026556925,0.000037337733,0.0008957016,0.0007662748,0.016883822,0.007485848,0.9254021,0.0046660737,0.041258793],"study_design_scores_gemma":[0.000038300932,0.00015182227,0.003390439,0.00008205669,0.00007253995,0.00069666945,0.0005215786,0.04156725,0.0060034418,0.9048233,0.04259865,0.000053941825],"about_ca_topic_score_codex":0.0038108246,"about_ca_topic_score_gemma":0.0037446357,"teacher_disagreement_score":0.008262238,"about_ca_system_score_codex":0.0010764232,"about_ca_system_score_gemma":0.00069757487,"threshold_uncertainty_score":0.027639985},"labels":[],"label_agreement":null},{"id":"W4400513378","doi":"10.61091/ars159-01","title":"On Fractional ID-\\((g,f)\\)-factor-critical Covered Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Government of Jiangsu Province","keywords":"Mathematics; Factor (programming language); Combinatorics; Computer science; Programming language","score_opus":0.019749619431785062,"score_gpt":0.31950573020830364,"score_spread":0.2997561107765186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400513378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8660452,0.0007016082,0.118020184,0.00035505267,0.00004744372,0.000070686016,0.00063071074,0.00025683176,0.013872222],"genre_scores_gemma":[0.9735092,0.00039932178,0.023057934,0.00010020072,0.000060385355,0.000047597267,0.00079025724,0.0000715273,0.0019635663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948525,0.00006106851,0.00002540321,0.00016799873,0.00010074404,0.00015944894],"domain_scores_gemma":[0.99831104,0.0007228113,0.00023814519,0.00019193221,0.00021948529,0.00031660724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032882873,0.00057618594,0.00052865094,0.001797023,0.001540567,0.001114667,0.0006046071,0.00065134175,0.002950745],"category_scores_gemma":[0.0028805262,0.00035912398,0.00063334266,0.0012826707,0.0014843019,0.0019179209,0.0013335877,0.00061587326,0.0002881264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010739636,0.00014425328,0.02115077,0.0005527845,0.00011488673,0.0025199617,0.002255225,0.071576424,0.061523058,0.7737939,0.0065699522,0.058724806],"study_design_scores_gemma":[0.0001097868,0.00026665337,0.011352032,0.00019403386,0.00019547941,0.0041877073,0.0016725957,0.20309739,0.030821854,0.7168165,0.03116782,0.00011809775],"about_ca_topic_score_codex":0.0036433376,"about_ca_topic_score_gemma":0.0026345253,"teacher_disagreement_score":0.0036433376,"about_ca_system_score_codex":0.0011055741,"about_ca_system_score_gemma":0.00048912084,"threshold_uncertainty_score":0.009871244},"labels":[],"label_agreement":null},{"id":"W4400596703","doi":"10.55016/ojs/cdm.v14i1.62676","title":"Sun toughness and $P_{\\geq3}$-factors in graphs","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Combinatorics; Graph; Mathematics; Discrete mathematics","score_opus":0.014420542068680871,"score_gpt":0.3067048240553862,"score_spread":0.2922842819867053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7357979,0.0037162653,0.21200515,0.0016118415,0.00032426303,0.00016694145,0.0018471968,0.0008611043,0.0436693],"genre_scores_gemma":[0.95362747,0.0015424722,0.03032533,0.00024695563,0.0003988156,0.0001576874,0.0014150931,0.00026541966,0.012020733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998654,0.00019656231,0.00007128649,0.00045754726,0.0002730627,0.00034747345],"domain_scores_gemma":[0.99658847,0.0012197624,0.00079279154,0.00025694544,0.00026736245,0.0008747403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007209507,0.0013620418,0.00087509496,0.0024228734,0.0018906703,0.002425859,0.0011015853,0.0010230308,0.012226962],"category_scores_gemma":[0.0034177825,0.00065425655,0.0011042078,0.0021075946,0.0032483232,0.005044622,0.0021734403,0.0017170087,0.0010368485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005094243,0.00019271816,0.010568218,0.0005149448,0.00010149026,0.0007973648,0.0021973723,0.036594883,0.010823192,0.8645382,0.013874549,0.059287623],"study_design_scores_gemma":[0.000042079606,0.00015783848,0.00877141,0.00012358828,0.000057729274,0.0010871191,0.0009380727,0.06426939,0.0039720456,0.8928718,0.027588481,0.00012045096],"about_ca_topic_score_codex":0.0027666537,"about_ca_topic_score_gemma":0.0022702299,"teacher_disagreement_score":0.012226962,"about_ca_system_score_codex":0.0015379288,"about_ca_system_score_gemma":0.000514673,"threshold_uncertainty_score":0.04090327},"labels":[],"label_agreement":null},{"id":"W4400596716","doi":"10.55016/ojs/cdm.v13i1.62554","title":"Some inequalities for orderings of acyclic digraphs","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Order (exchange); Partially ordered set; Class (philosophy); Dimension (graph theory); Comparability; Discrete mathematics","score_opus":0.028690178979588993,"score_gpt":0.351742915839808,"score_spread":0.323052736860219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13033766,0.0066553163,0.49076605,0.0061803693,0.00084395026,0.0004000613,0.009646997,0.0007868743,0.35438272],"genre_scores_gemma":[0.7500809,0.0055883015,0.18160461,0.0023844063,0.0013075822,0.0007184124,0.008589485,0.00052209914,0.049204282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681914,0.0006563157,0.00030224846,0.0006452676,0.0008279511,0.0007489072],"domain_scores_gemma":[0.98727965,0.009002374,0.0008189441,0.000602097,0.0014376378,0.0008594193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029712585,0.0012945376,0.0007110328,0.0035617035,0.001742481,0.003556578,0.001536076,0.0009745074,0.019609548],"category_scores_gemma":[0.011225311,0.0007197185,0.0012169761,0.0042434563,0.0020115727,0.008093087,0.0020817807,0.0039495016,0.0016836205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085805055,0.000055272092,0.00091241807,0.00018538117,0.000022018496,0.00020272796,0.00031192673,0.0022150117,0.0010800208,0.96612084,0.0061565707,0.02265195],"study_design_scores_gemma":[0.000036700574,0.00006993751,0.0014225574,0.00013159121,0.000043200518,0.000298977,0.00024822776,0.01782742,0.0013829763,0.9493115,0.02919534,0.000031610245],"about_ca_topic_score_codex":0.005769531,"about_ca_topic_score_gemma":0.007775351,"teacher_disagreement_score":0.019609548,"about_ca_system_score_codex":0.0040511005,"about_ca_system_score_gemma":0.0012495713,"threshold_uncertainty_score":0.065600455},"labels":[],"label_agreement":null},{"id":"W4400596816","doi":"10.55016/ojs/cdm.v16i3.62279","title":"Graphs where each spanning tree has a perfect matching","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Spanning tree; Minimum degree spanning tree; Matching (statistics); Graph; Connectivity; Discrete mathematics; Connected dominating set; Tree (set theory); Minimum spanning tree","score_opus":0.02635374451992335,"score_gpt":0.3218086747465916,"score_spread":0.29545493022666824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7704423,0.0008387828,0.14831142,0.0007042253,0.00006792219,0.000070091446,0.0013417299,0.00042252368,0.07780096],"genre_scores_gemma":[0.9645573,0.0005174745,0.02662994,0.00015793508,0.00005563921,0.00003654948,0.00084625813,0.00005321154,0.007145675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996387,0.00005055911,0.00003391634,0.0001272691,0.000068152774,0.000081398786],"domain_scores_gemma":[0.9992454,0.000229291,0.0002036748,0.00016109883,0.00009378664,0.00006675855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019554562,0.00031326563,0.00032699708,0.00078131206,0.00091328396,0.0010340721,0.00041452728,0.000508415,0.004053949],"category_scores_gemma":[0.0011900278,0.0002683856,0.00035108597,0.001076552,0.0006574287,0.0025463072,0.0007808614,0.00030263216,0.0005895442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025760054,0.000084758765,0.004973164,0.00032738713,0.000089562636,0.00087693956,0.00064154353,0.018643081,0.0309963,0.8617322,0.0063916403,0.0749857],"study_design_scores_gemma":[0.000028968516,0.000128074,0.0056768632,0.00006392324,0.00010915299,0.0028999809,0.0006885168,0.046550788,0.016317088,0.88820195,0.03929811,0.000036568334],"about_ca_topic_score_codex":0.00070092414,"about_ca_topic_score_gemma":0.0012304467,"teacher_disagreement_score":0.004053949,"about_ca_system_score_codex":0.0004467898,"about_ca_system_score_gemma":0.00040786734,"threshold_uncertainty_score":0.013561785},"labels":[],"label_agreement":null},{"id":"W4400596823","doi":"10.55016/ojs/cdm.v16i1.68557","title":"k-Forcing number for Cartesian product of some graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Bipartite graph; Forcing (mathematics); Mathematics; Combinatorics; Graph coloring; Graph; Product (mathematics); Discrete mathematics; Generalization; Geometry; Mathematical analysis","score_opus":0.019671688235078175,"score_gpt":0.3361353020900227,"score_spread":0.3164636138549445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7221816,0.00035282955,0.23856033,0.00062459137,0.0001386839,0.00006973372,0.00042014706,0.00027842057,0.0373737],"genre_scores_gemma":[0.9447853,0.00029019784,0.047787312,0.00012704165,0.000102410704,0.00010913473,0.0003272483,0.00010206857,0.0063693374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990953,0.00019090417,0.000061032875,0.00027911927,0.00019804019,0.00017567303],"domain_scores_gemma":[0.9965906,0.0017670051,0.00042692843,0.00040200911,0.00038153116,0.00043197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009021084,0.00033992666,0.00041269584,0.0013894592,0.0015198911,0.001187328,0.00061378535,0.0006781756,0.0066214935],"category_scores_gemma":[0.0034181692,0.00026135572,0.00064530264,0.00063851377,0.002558913,0.0032082591,0.0012274962,0.0011612877,0.0006722317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006213142,0.000020912807,0.0015228604,0.00005576248,0.000008631174,0.000117606,0.00033928704,0.0046022134,0.0043939115,0.98057,0.0011707167,0.007135924],"study_design_scores_gemma":[0.000017434357,0.000075616204,0.0016196463,0.000030100831,0.000013855768,0.0004550347,0.00015580146,0.03383952,0.004803281,0.9523736,0.006574107,0.00004196532],"about_ca_topic_score_codex":0.0005808137,"about_ca_topic_score_gemma":0.00052082125,"teacher_disagreement_score":0.0066214935,"about_ca_system_score_codex":0.00068574684,"about_ca_system_score_gemma":0.0005890297,"threshold_uncertainty_score":0.022151053},"labels":[],"label_agreement":null},{"id":"W4400596840","doi":"10.55016/ojs/cdm.v16i1.62258","title":"H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México","keywords":"Digraph; Combinatorics; Mathematics; Transitive relation; Arc (geometry); Kernel (algebra); Independence (probability theory); Discrete mathematics; Geometry","score_opus":0.012375351633211898,"score_gpt":0.3119576176220196,"score_spread":0.2995822659888077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6797539,0.00040321096,0.26310563,0.0008099342,0.00012434475,0.00010059004,0.0006034237,0.00033154027,0.054767366],"genre_scores_gemma":[0.9729865,0.00021569483,0.017802302,0.00021985402,0.00007809044,0.00006015693,0.00039989225,0.000049137958,0.008188496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992194,0.00013010544,0.000035861012,0.00023105183,0.0001689894,0.00021454525],"domain_scores_gemma":[0.9960031,0.0022061355,0.0006033057,0.0004300396,0.00028979604,0.00046761005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050646404,0.00035629372,0.00042571896,0.00075015886,0.0015253745,0.00168437,0.00082630204,0.00066477794,0.0070524905],"category_scores_gemma":[0.002344767,0.0006086401,0.0008791667,0.00059291447,0.0021940481,0.0031810545,0.0014334721,0.0021966165,0.0008246027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025866457,0.00017057128,0.0033254283,0.00017277377,0.000066300374,0.0007851409,0.0011533514,0.0046168054,0.016219199,0.95659935,0.0016981573,0.014934282],"study_design_scores_gemma":[0.000106377316,0.00013744274,0.0038235842,0.000039319802,0.00009725213,0.00097641663,0.00038417132,0.035028737,0.011913229,0.9364429,0.010997638,0.00005297672],"about_ca_topic_score_codex":0.0021475386,"about_ca_topic_score_gemma":0.0021598397,"teacher_disagreement_score":0.0070524905,"about_ca_system_score_codex":0.00084474945,"about_ca_system_score_gemma":0.0005698017,"threshold_uncertainty_score":0.02359289},"labels":[],"label_agreement":null},{"id":"W4400596854","doi":"10.55016/ojs/cdm.v16i3.69926","title":"Degree conditions of nearly induced matching extendable graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Graph; Matching (statistics); Factor-critical graph; Discrete mathematics; Graph power; Line graph","score_opus":0.037133332334841104,"score_gpt":0.34569371354047956,"score_spread":0.30856038120563845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89575887,0.0005043717,0.068701915,0.00075091276,0.00006301794,0.0000962736,0.0017807027,0.00028311313,0.032060906],"genre_scores_gemma":[0.98206306,0.00034376126,0.012934686,0.00014692234,0.00007623393,0.000065930566,0.0013938833,0.00004450959,0.002931016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992874,0.000094441675,0.000055800672,0.00023167391,0.00017273973,0.00015797146],"domain_scores_gemma":[0.9970957,0.0012305566,0.0004940424,0.0002525486,0.00036503345,0.000562141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005003161,0.0005095,0.00051402976,0.0011312751,0.00067081576,0.0009587059,0.0007983932,0.00075311307,0.004705198],"category_scores_gemma":[0.0033028023,0.00033069614,0.00049804855,0.0009905678,0.000866295,0.0028584038,0.0015340172,0.0013382426,0.00051803846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012134485,0.00040660397,0.014573857,0.0007109637,0.000100901736,0.0026906733,0.0015813851,0.067200124,0.0947105,0.75397575,0.0069431276,0.05589273],"study_design_scores_gemma":[0.00017674862,0.00036618765,0.013429265,0.00011157223,0.0000801854,0.0021440673,0.0010892726,0.11249282,0.035474744,0.8185954,0.01593481,0.00010493963],"about_ca_topic_score_codex":0.0008442139,"about_ca_topic_score_gemma":0.0012494047,"teacher_disagreement_score":0.004705198,"about_ca_system_score_codex":0.00065270736,"about_ca_system_score_gemma":0.0003351398,"threshold_uncertainty_score":0.015740454},"labels":[],"label_agreement":null},{"id":"W4400596861","doi":"10.55016/ojs/cdm.v15i3.62742","title":"A classification of isomorphism-invariant random digraphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Commission","keywords":"Combinatorics; Mathematics; Randomness; Vertex (graph theory); Discrete mathematics; Invariant (physics); Isomorphism (crystallography); Random graph; Graph","score_opus":0.032306691093479986,"score_gpt":0.3125621024309222,"score_spread":0.2802554113374422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40464514,0.001106756,0.53458786,0.0011799156,0.00017623228,0.00037708465,0.0026032715,0.0011397249,0.05418406],"genre_scores_gemma":[0.93934244,0.0007476337,0.043970775,0.00044753996,0.00012608578,0.00028337695,0.0031896832,0.00014428813,0.011748158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986897,0.00027584168,0.00011283615,0.00045304155,0.00023493177,0.00023363299],"domain_scores_gemma":[0.9954366,0.0020630516,0.0006361625,0.00083974213,0.0005041005,0.00052030303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074384216,0.0005937517,0.0006964407,0.0025224295,0.0009721349,0.002209776,0.0009268148,0.0009462914,0.0059359577],"category_scores_gemma":[0.00515339,0.0003665988,0.00090582354,0.0014038226,0.001909826,0.0024336192,0.0012950215,0.0012199954,0.0007988194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096324264,0.000083880615,0.0067264414,0.00014253381,0.000054465003,0.00034267097,0.000314279,0.010197591,0.0035896117,0.9410406,0.003306185,0.034105368],"study_design_scores_gemma":[0.0000614882,0.00012458423,0.004869362,0.000059367518,0.000051040253,0.00076456595,0.0002903388,0.078730024,0.002256779,0.8940316,0.018679101,0.00008175928],"about_ca_topic_score_codex":0.0015488745,"about_ca_topic_score_gemma":0.001213484,"teacher_disagreement_score":0.0059359577,"about_ca_system_score_codex":0.0015300077,"about_ca_system_score_gemma":0.00069052866,"threshold_uncertainty_score":0.019857764},"labels":[],"label_agreement":null},{"id":"W4400596866","doi":"10.55016/ojs/cdm.v15i2.62639","title":"The 2-tuple dominating independent number of a random graph","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Tuple; Graph; Dominating set; Random graph; Discrete mathematics","score_opus":0.01744434532324139,"score_gpt":0.3260284658623288,"score_spread":0.3085841205390874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37626433,0.006361227,0.5427318,0.009525902,0.00055684906,0.00028235972,0.0014178095,0.0008213293,0.062038347],"genre_scores_gemma":[0.9391093,0.0031850622,0.03884512,0.0011551691,0.00068152416,0.00039979053,0.00056442764,0.00022852967,0.015831087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979882,0.0007476435,0.000075020005,0.00045770837,0.0004464481,0.00028488442],"domain_scores_gemma":[0.98398095,0.0117692305,0.0010842959,0.0009225717,0.00093119545,0.0013116809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020737653,0.0012564211,0.0018584534,0.0030792376,0.0018812759,0.0036329718,0.0024695224,0.0016224285,0.004067214],"category_scores_gemma":[0.016292479,0.00076275313,0.0011391123,0.0020304963,0.0044061374,0.0068586804,0.0030422155,0.0033416855,0.0009635524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000355546,0.000060558294,0.0020507104,0.0003161004,0.00008977899,0.0003060325,0.0005368994,0.043297708,0.006768771,0.9229822,0.009600443,0.013635348],"study_design_scores_gemma":[0.00007457827,0.00017263766,0.0018396974,0.000103850405,0.00010515716,0.00089011475,0.00013981598,0.40876895,0.008341918,0.5686335,0.010821255,0.00010859997],"about_ca_topic_score_codex":0.00080367154,"about_ca_topic_score_gemma":0.0005231919,"teacher_disagreement_score":0.004067214,"about_ca_system_score_codex":0.0027510906,"about_ca_system_score_gemma":0.00095881283,"threshold_uncertainty_score":0.019960701},"labels":[],"label_agreement":null},{"id":"W4400596989","doi":"10.55016/ojs/cdm.v16i3.71109","title":"Starred Italian domination in graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Domination analysis; Neighbourhood (mathematics); Vertex (graph theory); Graph; Omega; Discrete mathematics; Physics","score_opus":0.015552851451988425,"score_gpt":0.3261180961084776,"score_spread":0.31056524465648916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7248104,0.002124344,0.2315401,0.00091981195,0.000060196482,0.00008104989,0.0014090043,0.00076232327,0.038292766],"genre_scores_gemma":[0.97074854,0.00080327236,0.022803295,0.00014436671,0.00008299229,0.00004534048,0.00072958204,0.00008228293,0.0045602317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933285,0.00012809383,0.000032052696,0.00021479542,0.00014665036,0.00014553189],"domain_scores_gemma":[0.9976508,0.0015098745,0.0002497367,0.00023541546,0.00016990495,0.00018425005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005507379,0.0006584884,0.00046944906,0.0013707314,0.0008703546,0.0017039258,0.0007229538,0.00048163044,0.0024336295],"category_scores_gemma":[0.003583681,0.00034223372,0.000524954,0.0022161356,0.001754485,0.0026288843,0.0009792486,0.0008050013,0.00032554878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005513431,0.00016250537,0.01357924,0.00053069927,0.00011981161,0.00058029115,0.0016314271,0.13069932,0.01425004,0.69993556,0.012268368,0.1256914],"study_design_scores_gemma":[0.000041475767,0.00008025464,0.0061396672,0.000057066125,0.00007764968,0.0007342857,0.00035997282,0.267519,0.006132197,0.6991823,0.019622209,0.000053844975],"about_ca_topic_score_codex":0.002946248,"about_ca_topic_score_gemma":0.003924991,"teacher_disagreement_score":0.002946248,"about_ca_system_score_codex":0.0021003846,"about_ca_system_score_gemma":0.0006899057,"threshold_uncertainty_score":0.015239358},"labels":[],"label_agreement":null},{"id":"W4400667814","doi":"10.48550/arxiv.2407.08927","title":"Tree Independence Number IV. Even-hole-free Graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Tree (set theory); Independence (probability theory); Combinatorics; Mathematics; Forestry; Geography; Statistics","score_opus":0.059267110027745866,"score_gpt":0.22973993481027977,"score_spread":0.1704728247825339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400667814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7495814,0.0010292544,0.19406793,0.0026267134,0.00008753486,0.000098754106,0.0017621738,0.0007813893,0.04996483],"genre_scores_gemma":[0.97939837,0.0003329244,0.015364649,0.0001855026,0.000060353013,0.000043094937,0.00062329817,0.000094756666,0.003896983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994468,0.00006721098,0.000016395878,0.00015786788,0.0001631512,0.00014851431],"domain_scores_gemma":[0.99475795,0.0034959603,0.00051076297,0.00048211936,0.00025826378,0.00049496326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005629717,0.0004359856,0.00042737593,0.000787233,0.00085800904,0.001796285,0.0011016121,0.00048433983,0.0062168897],"category_scores_gemma":[0.0041935113,0.0003859521,0.0005200657,0.0010619097,0.0014876589,0.0028943908,0.0010772281,0.002539416,0.0005872611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013776781,0.00038334922,0.022889523,0.00081263686,0.00013739002,0.0008429529,0.0008697564,0.15522501,0.10447291,0.60260665,0.022187037,0.08819519],"study_design_scores_gemma":[0.00007567774,0.00009822329,0.008762519,0.00004757566,0.00009228157,0.0005620233,0.0001644987,0.2602731,0.03284266,0.689777,0.007258882,0.00004549978],"about_ca_topic_score_codex":0.0020343484,"about_ca_topic_score_gemma":0.0026601853,"teacher_disagreement_score":0.0062168897,"about_ca_system_score_codex":0.0015536308,"about_ca_system_score_gemma":0.0007498157,"threshold_uncertainty_score":0.02079755},"labels":[],"label_agreement":null},{"id":"W4400720472","doi":"10.1016/j.disc.2024.114154","title":"A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Grantová Agentura České Republiky","keywords":"Mathematics; Closure (psychology); Social connectedness; Combinatorics; Discrete mathematics","score_opus":0.025501284242576465,"score_gpt":0.31533044034136765,"score_spread":0.2898291560987912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400720472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80516404,0.0005988948,0.1015609,0.001925807,0.00028969583,0.00023991468,0.0017896551,0.0007205115,0.087710686],"genre_scores_gemma":[0.96771127,0.00026119803,0.01579147,0.0004261654,0.00013501357,0.00017062611,0.0013874028,0.00022778881,0.013889134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928635,0.00008838405,0.0000461057,0.00024625316,0.00013341977,0.0001995383],"domain_scores_gemma":[0.9970855,0.0013655601,0.00037842224,0.00020121942,0.0002927351,0.0006764834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066551747,0.00074521545,0.0010475762,0.0022130578,0.0035984002,0.004641403,0.00167477,0.0016022559,0.012949677],"category_scores_gemma":[0.0025970528,0.00073821854,0.0013539187,0.0014228935,0.0032725127,0.0046363235,0.0026764888,0.0032854134,0.0010315385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023864294,0.00008744456,0.00072264334,0.00012658238,0.000020914646,0.00040048463,0.0015038626,0.0007634368,0.0040457523,0.98358786,0.0024633573,0.0060388814],"study_design_scores_gemma":[0.00006841369,0.000033621433,0.0006025457,0.000038400325,0.000021316228,0.00023631046,0.0005879437,0.0038019752,0.0015328837,0.9894509,0.0036028095,0.000023004111],"about_ca_topic_score_codex":0.0033391295,"about_ca_topic_score_gemma":0.0026971316,"teacher_disagreement_score":0.012949677,"about_ca_system_score_codex":0.0014003956,"about_ca_system_score_gemma":0.00092177297,"threshold_uncertainty_score":0.043320954},"labels":[],"label_agreement":null},{"id":"W4400805883","doi":"10.1007/s40314-024-02854-9","title":"On regular triangle-distinct graphs","year":2024,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Science Fund of the Republic of Serbia","keywords":"Mathematics; Combinatorics","score_opus":0.02480918071135287,"score_gpt":0.285359270146763,"score_spread":0.26055008943541014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400805883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5100873,0.00095518713,0.2976636,0.004256422,0.0006477274,0.0001934208,0.0009377436,0.0005695665,0.18468903],"genre_scores_gemma":[0.85911345,0.001270228,0.07289125,0.0013778768,0.0006226047,0.00016799012,0.0015749952,0.00066229387,0.06231928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986615,0.00034372078,0.000055598608,0.00036657677,0.0003175392,0.00025504825],"domain_scores_gemma":[0.9928686,0.0037992613,0.0008483998,0.000781858,0.0006359038,0.0010659347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010063977,0.0012592528,0.0013585013,0.0027130186,0.0028289063,0.003298032,0.0030308608,0.001944619,0.014778379],"category_scores_gemma":[0.0067993123,0.0010764664,0.0013472372,0.0029716683,0.0035481923,0.0068049594,0.004445534,0.0044132904,0.0019167044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008759272,0.000036229405,0.00030330662,0.00007346498,0.00000930401,0.00018890746,0.00036675297,0.0014837667,0.001220888,0.9874357,0.0025981804,0.0061958455],"study_design_scores_gemma":[0.000018756933,0.000010815864,0.00015228128,0.000013586435,0.0000086368045,0.0001330655,0.00010367413,0.0053979545,0.00031146305,0.9921644,0.0016787268,0.0000067972187],"about_ca_topic_score_codex":0.0017410077,"about_ca_topic_score_gemma":0.0025540933,"teacher_disagreement_score":0.014778379,"about_ca_system_score_codex":0.001436633,"about_ca_system_score_gemma":0.0006269574,"threshold_uncertainty_score":0.049438596},"labels":[],"label_agreement":null},{"id":"W4400869467","doi":"10.1002/jgt.23152","title":"Cycles in 3‐connected claw‐free planar graphs and 4‐connected planar graphs without 4‐cycles","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Claw; Planar straight-line graph; Chordal graph; Planar; Outerplanar graph; 1-planar graph; Pathwidth; Discrete mathematics; Graph; Computer science; Line graph; Biology","score_opus":0.017210814976967793,"score_gpt":0.28433814695748216,"score_spread":0.26712733198051436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400869467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95700806,0.00030799513,0.023407284,0.00020592134,0.000020926818,0.00003772986,0.00029110993,0.00008091691,0.018640121],"genre_scores_gemma":[0.99133486,0.0001812584,0.0060250955,0.000056802826,0.000013027238,0.000038742553,0.00029460673,0.000022906643,0.0020326953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999699,0.000039384307,0.000017167313,0.00006293271,0.00010352009,0.00007799916],"domain_scores_gemma":[0.9987764,0.0004990784,0.00025591624,0.00006595774,0.00021364645,0.00018906774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022207329,0.00043838393,0.0003012843,0.0025369725,0.0009102047,0.0012551377,0.00054579764,0.00054399465,0.004937674],"category_scores_gemma":[0.0014716345,0.00032550225,0.00033083803,0.0013606513,0.0011885874,0.001576026,0.0011315369,0.00055272673,0.0003652622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036335012,0.00012813145,0.010286873,0.00019850952,0.000052536518,0.0005832545,0.0010452769,0.026597561,0.024255037,0.8902484,0.0030568452,0.04318418],"study_design_scores_gemma":[0.00004912502,0.00008872093,0.008144209,0.00009630484,0.0000436807,0.0007076138,0.0010794279,0.07588165,0.01578236,0.8885457,0.00952007,0.00006115172],"about_ca_topic_score_codex":0.001709442,"about_ca_topic_score_gemma":0.0018191256,"teacher_disagreement_score":0.004937674,"about_ca_system_score_codex":0.0008601872,"about_ca_system_score_gemma":0.00042916098,"threshold_uncertainty_score":0.016518176},"labels":[],"label_agreement":null},{"id":"W4401333586","doi":"10.1007/s00493-024-00117-z","title":"Pure Pairs. VIII. Excluding a Sparse Graph","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.03483557909027746,"score_gpt":0.2996560542547483,"score_spread":0.2648204751644708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401333586","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08951117,0.001449592,0.27680817,0.009541257,0.0019711817,0.00027719451,0.0016880087,0.0009920037,0.6177614],"genre_scores_gemma":[0.6880951,0.0015940646,0.102940336,0.0041248333,0.0010320259,0.0005815619,0.0027586946,0.0008452956,0.19802813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917394,0.00022339135,0.000035450463,0.00018774642,0.0002065402,0.00017283086],"domain_scores_gemma":[0.9984579,0.00061348954,0.00014074524,0.00027899677,0.00032179503,0.00018710586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005426694,0.0008325926,0.00076323847,0.0011193809,0.0030385545,0.0020179525,0.0011842573,0.0016845361,0.033101387],"category_scores_gemma":[0.0037145973,0.0004986169,0.0010383397,0.0009281368,0.0018626367,0.005200465,0.002452153,0.0020556473,0.0086005805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006424049,0.000031966123,0.00033078896,0.00016905885,0.000020104506,0.00025535282,0.00017573759,0.00047801097,0.0014492186,0.95641696,0.021772437,0.018836034],"study_design_scores_gemma":[0.000012777679,0.000020227495,0.00025667666,0.000037763133,0.000019853898,0.00029876843,0.00013861808,0.0016422443,0.0017165609,0.97343713,0.022411175,0.000008210011],"about_ca_topic_score_codex":0.0011093011,"about_ca_topic_score_gemma":0.001606944,"teacher_disagreement_score":0.033101387,"about_ca_system_score_codex":0.0007506787,"about_ca_system_score_gemma":0.00090406113,"threshold_uncertainty_score":0.11073512},"labels":[],"label_agreement":null},{"id":"W4401352220","doi":"10.1016/j.cosrev.2024.100663","title":"A survey on the parameterized complexity of reconfiguration problems","year":2024,"lang":"en","type":"article","venue":"Computer Science Review","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Providence Health Care; University Research Board, American University of Beirut; Alexander von Humboldt-Stiftung","keywords":"Control reconfiguration; Parameterized complexity; Vertex (graph theory); Computer science; Security token; Feedback vertex set; Graph; Theoretical computer science; Independent set; Vertex cover; Algorithm","score_opus":0.20152490290374092,"score_gpt":0.375823881507837,"score_spread":0.1742989786040961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401352220","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03383434,0.41012013,0.44480902,0.022239383,0.0023061337,0.00028348863,0.0021638433,0.0009616604,0.083281964],"genre_scores_gemma":[0.24234778,0.5256366,0.19362156,0.004035826,0.012365658,0.0006491311,0.0056126313,0.0008810679,0.0148498705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963486,0.00087614846,0.00025661843,0.00087495527,0.0012702013,0.00037345238],"domain_scores_gemma":[0.98597926,0.010883299,0.00062757335,0.001441358,0.0007390091,0.00032953377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028666286,0.001986799,0.0024620781,0.003089933,0.001071667,0.0055176197,0.003718536,0.0023837108,0.010722216],"category_scores_gemma":[0.015490262,0.0013393678,0.0020030101,0.008375387,0.0022878621,0.013800492,0.0021080934,0.005505889,0.0020405487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016111587,0.00031096055,0.0020037354,0.004365208,0.00016471632,0.00013677163,0.00016347783,0.06890744,0.0012882173,0.46491984,0.051379517,0.40619895],"study_design_scores_gemma":[0.000060874558,0.00010017011,0.0015557959,0.0007555085,0.00008024407,0.0004964579,0.00015659285,0.073083535,0.000731047,0.83916986,0.083754174,0.000055794604],"about_ca_topic_score_codex":0.0019850016,"about_ca_topic_score_gemma":0.001677796,"teacher_disagreement_score":0.010722216,"about_ca_system_score_codex":0.0043080333,"about_ca_system_score_gemma":0.003125031,"threshold_uncertainty_score":0.03586942},"labels":[],"label_agreement":null},{"id":"W4401390257","doi":"10.1145/3686798","title":"Automorphisms and Isomorphisms of Maps in Linear Time","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agentúra na Podporu Výskumu a Vývoja; Grantová Agentura České Republiky","keywords":"Automorphism; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.018948114718378872,"score_gpt":0.2882847886829304,"score_spread":0.2693366739645515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401390257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23362331,0.00081190927,0.7176828,0.0013608324,0.0001895762,0.00057714956,0.001447868,0.018261498,0.02604506],"genre_scores_gemma":[0.51475817,0.00025604622,0.4645828,0.00032271544,0.000132354,0.0005008206,0.0046929033,0.0015765235,0.013177716],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963607,0.0005700358,0.0002642202,0.0011184806,0.000982512,0.00070394785],"domain_scores_gemma":[0.9932509,0.0039582853,0.000508101,0.0015797343,0.00047372485,0.00022926032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011445981,0.001541987,0.0012199716,0.0012083079,0.001522347,0.004349759,0.002385215,0.0013747489,0.01289387],"category_scores_gemma":[0.008416471,0.00095133216,0.0021172897,0.0020497085,0.0025384994,0.007338084,0.0038089699,0.002026116,0.003678224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027187408,0.0008824692,0.0090105375,0.0013056907,0.00034186657,0.0009047249,0.0019519101,0.13422085,0.038565103,0.1699416,0.022621004,0.6175355],"study_design_scores_gemma":[0.0006245507,0.0003948052,0.0019340586,0.00008500011,0.00021725647,0.0004317055,0.0006620299,0.40730837,0.028230663,0.5398446,0.020173838,0.00009315186],"about_ca_topic_score_codex":0.00518893,"about_ca_topic_score_gemma":0.008017787,"teacher_disagreement_score":0.01289387,"about_ca_system_score_codex":0.002559909,"about_ca_system_score_gemma":0.0023777978,"threshold_uncertainty_score":0.043134272},"labels":[],"label_agreement":null},{"id":"W4401656754","doi":"10.1016/j.dam.2024.07.044","title":"Hamiltonicity of covering graphs of trees","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.019444275876684104,"score_gpt":0.28881422514983274,"score_spread":0.2693699492731486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401656754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9427665,0.00031784427,0.032968517,0.00049894187,0.000036974685,0.000046569832,0.0004171558,0.00011221378,0.022835396],"genre_scores_gemma":[0.98634964,0.0003304643,0.005819643,0.0001269867,0.00005689172,0.0000507386,0.0005098032,0.000049636983,0.0067061945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964356,0.00009238439,0.000015892983,0.00006599682,0.00008787354,0.00009432814],"domain_scores_gemma":[0.9967957,0.0019616869,0.00046601723,0.0002136875,0.00023371245,0.0003291347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029401292,0.0003142048,0.0005516851,0.0011490237,0.0011081273,0.0018253252,0.0006903704,0.00073912693,0.0043935124],"category_scores_gemma":[0.002954934,0.00058357045,0.0004985425,0.0014815129,0.0011696172,0.0013688639,0.000960821,0.0007274519,0.00036877484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001847734,0.00006394776,0.0039249784,0.00011284634,0.000043665594,0.0004941464,0.0014505106,0.012230907,0.008821315,0.9560867,0.0031089683,0.013477312],"study_design_scores_gemma":[0.000043515367,0.0000360136,0.0028610716,0.000021368101,0.000023901008,0.00023201725,0.0004225336,0.029335583,0.0014389259,0.96284443,0.0027274878,0.000013132454],"about_ca_topic_score_codex":0.0034955419,"about_ca_topic_score_gemma":0.004088497,"teacher_disagreement_score":0.0043935124,"about_ca_system_score_codex":0.00091721734,"about_ca_system_score_gemma":0.0005504364,"threshold_uncertainty_score":0.01469779},"labels":[],"label_agreement":null},{"id":"W4401748186","doi":"10.1016/j.ejc.2024.104043","title":"The Nash-Williams orientation theorem for graphs with countably many ends","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Orientation (vector space); Discrete mathematics; Geometry","score_opus":0.014185230573488274,"score_gpt":0.27121071112808504,"score_spread":0.2570254805545968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401748186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3003108,0.0022979935,0.44416964,0.0060766707,0.0006641422,0.00016183921,0.000867037,0.0005462605,0.24490559],"genre_scores_gemma":[0.8851247,0.0023641067,0.078724064,0.0019505647,0.00070434646,0.00036088892,0.0013110841,0.0002731174,0.029187204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989973,0.00019442195,0.000047050384,0.0003239147,0.00018959929,0.0002477744],"domain_scores_gemma":[0.99700147,0.0016615357,0.00026651027,0.000422651,0.00032482014,0.00032309187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957408,0.0008267211,0.0007793185,0.0012547402,0.002145588,0.0033055474,0.0012503094,0.0012691983,0.008245115],"category_scores_gemma":[0.005034833,0.00052828575,0.00090949656,0.0011288841,0.0040756986,0.0081546055,0.0029927052,0.0028611461,0.0017259307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007939795,0.000023356137,0.0010445003,0.000077911645,0.000012373819,0.00009009855,0.00017690794,0.0031372267,0.0013656563,0.9820426,0.0030123063,0.008937514],"study_design_scores_gemma":[0.000012187485,0.000017362576,0.0004860902,0.000028175042,0.000015565643,0.00009730179,0.00015542362,0.007443875,0.0010646686,0.98172474,0.008937434,0.000017324897],"about_ca_topic_score_codex":0.002128904,"about_ca_topic_score_gemma":0.0027307759,"teacher_disagreement_score":0.008245115,"about_ca_system_score_codex":0.0013998303,"about_ca_system_score_gemma":0.00072996574,"threshold_uncertainty_score":0.027582645},"labels":[],"label_agreement":null},{"id":"W4401823787","doi":"10.1007/s00373-024-02829-x","title":"Existential Closure in Line Graphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Closure (psychology); Combinatorics; Line (geometry); Discrete mathematics; Geometry; Political science","score_opus":0.018311866831261008,"score_gpt":0.28131773073709204,"score_spread":0.263005863905831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401823787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46273682,0.0021455304,0.36533335,0.005604209,0.0003410484,0.0001191231,0.0012335175,0.0015062836,0.16098012],"genre_scores_gemma":[0.95888674,0.0008662826,0.020367408,0.0005892643,0.00021194507,0.0000736559,0.00073753187,0.0003424176,0.017924815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986112,0.0004826138,0.00008886354,0.00036179007,0.00021166922,0.00024383873],"domain_scores_gemma":[0.9958923,0.0025867454,0.00037294134,0.00042841857,0.00039673437,0.00032285188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013600775,0.0007132758,0.0009702672,0.0026630433,0.0030450325,0.0054502827,0.0012286017,0.0014451665,0.0131134195],"category_scores_gemma":[0.0049264804,0.0009806779,0.0011071328,0.0034933668,0.00447245,0.0166244,0.003533011,0.004017474,0.001274265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004290067,0.000028688351,0.0003972326,0.000043575048,0.0000069440785,0.00011020404,0.00074379257,0.00044566585,0.00040108932,0.99134153,0.0011853804,0.0052529476],"study_design_scores_gemma":[0.000012435571,0.0000072461225,0.00016792666,0.000016901618,0.000013334093,0.00008767471,0.00035813046,0.0012573132,0.00041015848,0.9939976,0.003662319,0.000008940825],"about_ca_topic_score_codex":0.0016367151,"about_ca_topic_score_gemma":0.0011302765,"teacher_disagreement_score":0.0131134195,"about_ca_system_score_codex":0.0015610318,"about_ca_system_score_gemma":0.00048057316,"threshold_uncertainty_score":0.04386872},"labels":[],"label_agreement":null},{"id":"W4401909052","doi":"10.5206/mase/18527","title":"The equitable non-split domination number of graphs","year":2024,"lang":"en","type":"article","venue":"Mathematics in Applied Sciences and Engineering","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Domination analysis; Combinatorics; Mathematics; Computer science; Graph; Vertex (graph theory)","score_opus":0.01583315733226827,"score_gpt":0.2886430563984206,"score_spread":0.27280989906615233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401909052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50149107,0.0007300465,0.45174974,0.0014840566,0.00009882484,0.00014906075,0.00037969698,0.00023548283,0.043682054],"genre_scores_gemma":[0.9570195,0.0003219093,0.038204495,0.00012430946,0.000059544873,0.00014494975,0.00010789795,0.00005366933,0.0039638435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979772,0.00068557484,0.000110801186,0.00041839323,0.00052231294,0.00028587025],"domain_scores_gemma":[0.99099475,0.005572179,0.0009303236,0.0009598176,0.0008543783,0.0006886079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020224054,0.00045309434,0.0005360743,0.0014952145,0.001249832,0.0021988845,0.0009243076,0.000622541,0.0020773683],"category_scores_gemma":[0.0118960515,0.00037832092,0.0002821309,0.0009676085,0.002811859,0.0038692402,0.0016039677,0.00089024927,0.00021408871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002493596,0.000051892486,0.0033796665,0.00018385205,0.00005252241,0.00029498234,0.0006229917,0.115518354,0.01035098,0.8268959,0.002284888,0.04011471],"study_design_scores_gemma":[0.000033610293,0.00007823598,0.0015258179,0.000040954405,0.000021940368,0.00041373455,0.00023393509,0.1658564,0.0048488313,0.8202456,0.0066736634,0.000027217535],"about_ca_topic_score_codex":0.0005080919,"about_ca_topic_score_gemma":0.00087838055,"teacher_disagreement_score":0.0021988845,"about_ca_system_score_codex":0.0013630586,"about_ca_system_score_gemma":0.0006576772,"threshold_uncertainty_score":0.010695577},"labels":[],"label_agreement":null},{"id":"W4401976660","doi":"10.1093/comjnl/bxae055","title":"Approximation algorithms for maximum weighted internal spanning trees in regular graphs and subdivisions of graphs","year":2024,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Spanning tree; Subdivision; Computer science; Algorithm; Combinatorics; Mathematics; Geography","score_opus":0.02779165139718254,"score_gpt":0.3050763644660477,"score_spread":0.27728471306886515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401976660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26071626,0.00070122257,0.7264157,0.0007635684,0.00007939503,0.00020365951,0.0005426711,0.0016423702,0.008935137],"genre_scores_gemma":[0.60622716,0.0003331528,0.38730162,0.0001514989,0.000040155923,0.00018549945,0.0019366926,0.00022579113,0.0035983217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992931,0.00015163235,0.000041940464,0.00019195581,0.00016056567,0.00016082007],"domain_scores_gemma":[0.998825,0.0004374269,0.00016838725,0.00031555514,0.00013715687,0.000116509254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007309616,0.0007518833,0.0008472944,0.001274736,0.00059060345,0.0011865682,0.0015357842,0.00086135074,0.003136283],"category_scores_gemma":[0.0042847726,0.00046797196,0.0010224199,0.0018346276,0.0005949453,0.002466895,0.0017042885,0.0009470816,0.00062874355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006176179,0.00044162376,0.0050411336,0.00036437038,0.00018996111,0.0003192177,0.0007087564,0.58699644,0.013367568,0.12719557,0.0151000265,0.24965772],"study_design_scores_gemma":[0.00004844024,0.00005699524,0.00038130063,0.000025244346,0.000022895498,0.00010259308,0.00011968763,0.91898376,0.0019784484,0.076026544,0.0022453924,0.000008770554],"about_ca_topic_score_codex":0.0027942676,"about_ca_topic_score_gemma":0.0038338092,"teacher_disagreement_score":0.003136283,"about_ca_system_score_codex":0.0012403753,"about_ca_system_score_gemma":0.00068961515,"threshold_uncertainty_score":0.010491908},"labels":[],"label_agreement":null},{"id":"W4402137504","doi":"10.1016/j.disc.2024.114195","title":"Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; Mathematics; Partial k-tree; Tree-depth; Clique-sum; 1-planar graph; Tree decomposition; Discrete mathematics; Chordal graph; Bounded function; Pathwidth; Clique-width; Graph; Line graph; Voltage graph","score_opus":0.020182274357420475,"score_gpt":0.29895184390847096,"score_spread":0.2787695695510505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402137504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4040571,0.007789752,0.4121468,0.0035553642,0.0006342278,0.0002652186,0.0032266576,0.00060529466,0.1677195],"genre_scores_gemma":[0.7946732,0.0036623352,0.14419904,0.0007500641,0.00042359388,0.0001667678,0.003565666,0.0002705257,0.05228876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996333,0.00007621595,0.000022331735,0.0001045377,0.00009716702,0.00006651382],"domain_scores_gemma":[0.9992306,0.0002804844,0.0001785515,0.00008157752,0.00011675805,0.000112053094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027233709,0.000500766,0.00044530394,0.0018733962,0.000758352,0.002274245,0.00058613933,0.0008974851,0.009560627],"category_scores_gemma":[0.0013302421,0.00055721344,0.00079577917,0.0018630445,0.0009725041,0.0019581574,0.0009926453,0.0018339613,0.0013090078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009103332,0.00005913045,0.00092236436,0.00024424074,0.000047774683,0.00034357185,0.00047258526,0.004670454,0.0072182803,0.9435721,0.008558463,0.03379999],"study_design_scores_gemma":[0.000015012972,0.000018113229,0.0013417238,0.00006654769,0.000033248387,0.00046047708,0.00023870287,0.010963011,0.0015912463,0.9733257,0.011933552,0.000012635272],"about_ca_topic_score_codex":0.0013030041,"about_ca_topic_score_gemma":0.0016901394,"teacher_disagreement_score":0.009560627,"about_ca_system_score_codex":0.0007270271,"about_ca_system_score_gemma":0.0003361034,"threshold_uncertainty_score":0.031983435},"labels":[],"label_agreement":null},{"id":"W4402461337","doi":"10.1137/23m157627x","title":"Minimum Spanning Trees in Infinite Graphs: Theory and Algorithms","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Spanning tree; Combinatorics; Minimum spanning tree; Algorithm; Discrete mathematics; Mathematical optimization","score_opus":0.017276378262051327,"score_gpt":0.30020955161130003,"score_spread":0.2829331733492487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402461337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028288146,0.008236773,0.94902515,0.0023125915,0.00023902256,0.00007280981,0.0004129345,0.00040619963,0.0110063255],"genre_scores_gemma":[0.42513707,0.016628917,0.5390633,0.0011094098,0.001748072,0.0005321215,0.0015801087,0.00050335325,0.013697686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833447,0.00061981217,0.00009612339,0.00042627516,0.0003666478,0.00015663222],"domain_scores_gemma":[0.9805401,0.016723363,0.00093362463,0.0006855961,0.00075653894,0.0003607678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023837166,0.0015176053,0.0025786797,0.0036393101,0.0017735502,0.005467239,0.0049299346,0.0035041147,0.0050109904],"category_scores_gemma":[0.019892847,0.0018207653,0.0017358052,0.008240855,0.0038252573,0.012620427,0.0029221452,0.0058569806,0.0009876324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008150657,0.00015963023,0.00071530184,0.0006672021,0.000074218806,0.000080798585,0.00037273092,0.11315574,0.0006591775,0.7948224,0.010397397,0.07881379],"study_design_scores_gemma":[0.000018250134,0.000016885007,0.00013103595,0.00005713448,0.000025595751,0.00008099958,0.0000722723,0.16605543,0.00021244602,0.83100396,0.0023105475,0.000015467549],"about_ca_topic_score_codex":0.0017163785,"about_ca_topic_score_gemma":0.0025884174,"teacher_disagreement_score":0.005467239,"about_ca_system_score_codex":0.0025001063,"about_ca_system_score_gemma":0.001798792,"threshold_uncertainty_score":0.0181396},"labels":[],"label_agreement":null},{"id":"W4402478393","doi":"10.1016/j.laa.2024.09.009","title":"On the zero forcing number of the complement of graphs with forbidden subgraphs","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Medical Research Council; Natural Sciences and Engineering Research Council of Canada; American Mathematical Society; National Science Foundation","keywords":"Mathematics; Complement (music); Zero (linguistics); Combinatorics; Forcing (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.020219131405441286,"score_gpt":0.29753853548819864,"score_spread":0.27731940408275735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402478393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8285045,0.00088232197,0.07633747,0.00255209,0.00044631353,0.00005759113,0.00069204887,0.00032996084,0.09019769],"genre_scores_gemma":[0.97652787,0.0004557165,0.012519806,0.00033799783,0.00045765526,0.00010416489,0.0005558118,0.00014448642,0.008896458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884486,0.00030805627,0.000047252597,0.00027524016,0.0002558413,0.00026868685],"domain_scores_gemma":[0.98886245,0.0077904277,0.0009129913,0.00050710223,0.00064381753,0.00128317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017507869,0.0008688528,0.0015800197,0.0043181228,0.0030933747,0.00432651,0.0024275873,0.0017801981,0.010919808],"category_scores_gemma":[0.0086032525,0.00068520824,0.0012919646,0.002188821,0.006304517,0.006761878,0.0025891846,0.0034704218,0.000819947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017402618,0.00004386517,0.00067620893,0.00007748406,0.000014923347,0.00006788037,0.00020261627,0.0026627057,0.0013917269,0.9891866,0.0013818382,0.004120001],"study_design_scores_gemma":[0.00003249518,0.00002988154,0.0005485869,0.000039415583,0.000019311583,0.00009872328,0.00009809505,0.015144378,0.0010028301,0.98190534,0.001049406,0.000031551717],"about_ca_topic_score_codex":0.0017387028,"about_ca_topic_score_gemma":0.0016593444,"teacher_disagreement_score":0.010919808,"about_ca_system_score_codex":0.0024467874,"about_ca_system_score_gemma":0.0016664085,"threshold_uncertainty_score":0.036530375},"labels":[],"label_agreement":null},{"id":"W4402696811","doi":"10.48550/arxiv.2408.10452","title":"Eternally surrounding a robber","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Business","score_opus":0.09573952555297077,"score_gpt":0.2311861016547281,"score_spread":0.13544657610175734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402696811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22652638,0.00080244715,0.6330479,0.003516999,0.00042310037,0.00018115489,0.0009991918,0.00077719573,0.13372566],"genre_scores_gemma":[0.8241609,0.00073838443,0.117889136,0.00047757823,0.00013702708,0.00018976307,0.0011742638,0.00044190802,0.054790985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858165,0.00039058627,0.000050868188,0.00049092335,0.00022451226,0.0002614611],"domain_scores_gemma":[0.99764913,0.0008221379,0.00036505013,0.00061285694,0.00021127802,0.0003395992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008565481,0.000746831,0.0007588873,0.00054705335,0.0021261787,0.0023226463,0.001690689,0.0015350232,0.019376297],"category_scores_gemma":[0.004823922,0.00047718838,0.0006883138,0.00077346823,0.0029400634,0.007473871,0.0038354043,0.0017524977,0.002729157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022171748,0.000086689295,0.001606277,0.0002235711,0.00003835502,0.00040599777,0.0008689502,0.03422345,0.002730129,0.90833855,0.010593873,0.04066255],"study_design_scores_gemma":[0.00004056037,0.00015428205,0.0009289928,0.00011116058,0.00005119318,0.00060652656,0.0013357068,0.06244548,0.0056636054,0.8250662,0.10354996,0.00004629777],"about_ca_topic_score_codex":0.0023606296,"about_ca_topic_score_gemma":0.0026517601,"teacher_disagreement_score":0.019376297,"about_ca_system_score_codex":0.0006793374,"about_ca_system_score_gemma":0.00065053406,"threshold_uncertainty_score":0.06482023},"labels":[],"label_agreement":null},{"id":"W4402732438","doi":"10.1016/j.ejc.2024.104072","title":"Induced subdivisions with pinned branch vertices","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Mathematics; Combinatorics; Subdivision","score_opus":0.023751553805502992,"score_gpt":0.2766314345661225,"score_spread":0.2528798807606195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402732438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7329223,0.00021509099,0.20168586,0.00012939282,0.00006788106,0.000096831944,0.00029475728,0.00039562458,0.06419224],"genre_scores_gemma":[0.92957896,0.00021898386,0.056224924,0.00009389312,0.00002422219,0.000116533716,0.00076220906,0.000114886985,0.012865391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963915,0.00004825178,0.00001659924,0.000105305975,0.00009300428,0.00009781684],"domain_scores_gemma":[0.99915445,0.00018903309,0.00014977012,0.00028511562,0.00008446991,0.00013725735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018879853,0.0002625285,0.00027336334,0.00035546793,0.00045320063,0.0007884868,0.0009342306,0.00030334422,0.0055136234],"category_scores_gemma":[0.001277475,0.00029672022,0.00046159176,0.00041645422,0.0008244884,0.0012082275,0.001730844,0.0011154021,0.00078574155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003225178,0.00019624176,0.0051412596,0.00017673327,0.00004624974,0.00078798673,0.0013345955,0.021126352,0.043466575,0.85981756,0.0021785498,0.06540529],"study_design_scores_gemma":[0.0001331045,0.00040363363,0.006594347,0.00009832216,0.00013371532,0.00084561924,0.0008002158,0.09192501,0.04629743,0.811266,0.041462664,0.00003989907],"about_ca_topic_score_codex":0.00092010933,"about_ca_topic_score_gemma":0.0017429646,"teacher_disagreement_score":0.0055136234,"about_ca_system_score_codex":0.00046909993,"about_ca_system_score_gemma":0.00036010015,"threshold_uncertainty_score":0.018444955},"labels":[],"label_agreement":null},{"id":"W4402779380","doi":"10.1016/j.ejc.2024.104074","title":"Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; Ministry of Colleges and Universities; National Science Foundation","keywords":"Mathematics; Combinatorics; Tree (set theory)","score_opus":0.01722149256355198,"score_gpt":0.2757203212955558,"score_spread":0.2584988287320038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402779380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.614461,0.0039384947,0.24688144,0.0022800823,0.0004539476,0.00032247626,0.0018054404,0.00040882474,0.12944828],"genre_scores_gemma":[0.862987,0.0016608099,0.089636594,0.0004136289,0.00024568036,0.00017387883,0.0017484836,0.0002173131,0.04291656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972993,0.00005047508,0.000015382318,0.00006526948,0.00005798813,0.00008084693],"domain_scores_gemma":[0.9992343,0.00032638444,0.00015031944,0.0000795241,0.00007785413,0.00013159735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030119382,0.0003515822,0.0005771588,0.0013297139,0.0013243897,0.0020453308,0.00092545187,0.0009776601,0.009333418],"category_scores_gemma":[0.0014634355,0.00058550393,0.000880316,0.0017827937,0.0011453955,0.0023619507,0.0014335554,0.001397426,0.0012224003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011295316,0.0001077749,0.0016392004,0.00019441154,0.000022649005,0.000681223,0.0013415515,0.004944691,0.007850683,0.94927806,0.006005251,0.027821617],"study_design_scores_gemma":[0.000026320846,0.000030132276,0.0017568413,0.000063126696,0.000040902352,0.0006072292,0.0007332829,0.016933357,0.0014695044,0.96638453,0.011940068,0.000014712228],"about_ca_topic_score_codex":0.0015697193,"about_ca_topic_score_gemma":0.0023987142,"teacher_disagreement_score":0.009333418,"about_ca_system_score_codex":0.0006150092,"about_ca_system_score_gemma":0.00031851538,"threshold_uncertainty_score":0.031223416},"labels":[],"label_agreement":null},{"id":"W4402795462","doi":"10.1016/j.jcta.2024.105953","title":"On the proportion of metric matroids whose Jacobians have nontrivial p-torsion","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Matroid; Torsion (gastropod); Metric (unit); Combinatorics; Pure mathematics; Discrete mathematics; Surgery","score_opus":0.011077114220522991,"score_gpt":0.2752186489763287,"score_spread":0.2641415347558057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402795462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783844,0.00039599815,0.011214539,0.00047145726,0.00003382134,0.000017615155,0.00046995483,0.00017197907,0.008840246],"genre_scores_gemma":[0.9957897,0.00038999936,0.0016881129,0.000050110324,0.00010648149,0.000035463563,0.00057033694,0.00006833037,0.0013015547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811965,0.00040460017,0.00011211279,0.00053488417,0.0005068767,0.00032189285],"domain_scores_gemma":[0.97803724,0.01371682,0.004091498,0.0014932903,0.0011590694,0.0015020865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018687922,0.0007252134,0.0012269743,0.005524065,0.0018871776,0.004244283,0.0018955328,0.00163189,0.0066778897],"category_scores_gemma":[0.023297317,0.0006452562,0.00050695526,0.0027129916,0.003794072,0.0049095177,0.0024753688,0.0013622398,0.0006943138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014368461,0.0002888365,0.13603401,0.00068445335,0.00033939866,0.0021424661,0.002094653,0.060924184,0.036718313,0.6692198,0.010107788,0.08000916],"study_design_scores_gemma":[0.00019295826,0.0005313544,0.07517953,0.00020580791,0.00025117554,0.008665188,0.0022615793,0.18420044,0.026560208,0.6915769,0.010083675,0.00029115038],"about_ca_topic_score_codex":0.0006911363,"about_ca_topic_score_gemma":0.0005225938,"teacher_disagreement_score":0.0066778897,"about_ca_system_score_codex":0.0010989483,"about_ca_system_score_gemma":0.00034920115,"threshold_uncertainty_score":0.022339761},"labels":[],"label_agreement":null},{"id":"W4402841196","doi":"10.2139/ssrn.4967530","title":"Distance-Restricted Firefighting on Finite Graphs","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Firefighting; Computer science; Geography; Cartography","score_opus":0.016156056965141313,"score_gpt":0.2880911824740665,"score_spread":0.2719351255089252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402841196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5896439,0.0003845558,0.3695083,0.00083205337,0.00009118448,0.00015193349,0.00047938456,0.0006415284,0.03826723],"genre_scores_gemma":[0.9166506,0.00037006632,0.055821188,0.00017024536,0.00007602387,0.00011891128,0.0005860188,0.00024714606,0.025959766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992052,0.00019313667,0.000029278372,0.00024168509,0.00012395452,0.00020678474],"domain_scores_gemma":[0.9953301,0.0023019696,0.00048005703,0.00078031863,0.00032601578,0.00078150985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000746343,0.00064598804,0.0011041573,0.0010028583,0.0015210066,0.0017244614,0.0024514976,0.0011803085,0.008034715],"category_scores_gemma":[0.005499068,0.00058452424,0.001024242,0.0010582589,0.0017975613,0.0033226176,0.0026635893,0.002300327,0.00095783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066607824,0.00027366925,0.0022027735,0.00035596368,0.00008579555,0.0003141268,0.00088969624,0.17129712,0.014087872,0.74821025,0.008076652,0.053539984],"study_design_scores_gemma":[0.00007643041,0.000093987976,0.00069668744,0.000034202894,0.00003151952,0.00018340682,0.00025461565,0.2971157,0.0033554276,0.6950229,0.0031102765,0.000024857116],"about_ca_topic_score_codex":0.0035415478,"about_ca_topic_score_gemma":0.0030253616,"teacher_disagreement_score":0.008034715,"about_ca_system_score_codex":0.0014412455,"about_ca_system_score_gemma":0.0007313835,"threshold_uncertainty_score":0.026878774},"labels":[],"label_agreement":null},{"id":"W4402914195","doi":"10.2139/ssrn.4969841","title":"On 1-Planar Graphs with Bounded Cop-Number","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Bounded function; Planar; Planar graph; Mathematics; Combinatorics; Discrete mathematics; Computer science; Graph; Mathematical analysis; Computer graphics (images)","score_opus":0.010839086775392992,"score_gpt":0.28560327834682864,"score_spread":0.27476419157143567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402914195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55985767,0.004211137,0.22770882,0.010042012,0.0007577625,0.00028961827,0.002343236,0.0012811492,0.19350861],"genre_scores_gemma":[0.8662589,0.0046505816,0.06520495,0.002151957,0.001042893,0.00044129422,0.002692554,0.001265743,0.05629119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984024,0.00044997287,0.000051694664,0.00036926076,0.00033450118,0.00039223477],"domain_scores_gemma":[0.9875794,0.0082839085,0.0016692728,0.0008061382,0.00048223507,0.0011790824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011582451,0.00287883,0.0026785312,0.004985055,0.003295555,0.0051591997,0.004155036,0.0033985563,0.0188241],"category_scores_gemma":[0.011397221,0.001797344,0.0018454214,0.0052578165,0.0042123687,0.00963418,0.0058653187,0.0057986276,0.0028422151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031653143,0.00012535111,0.0011185856,0.00051566376,0.00004468113,0.00033290134,0.0006561743,0.023031745,0.0028228746,0.93896025,0.011909355,0.020165982],"study_design_scores_gemma":[0.000037408718,0.000029291796,0.0004729909,0.000058831083,0.000028982882,0.00016473437,0.00014239465,0.026148826,0.0006877168,0.9696611,0.0025469707,0.000020741736],"about_ca_topic_score_codex":0.002413534,"about_ca_topic_score_gemma":0.00314994,"teacher_disagreement_score":0.0188241,"about_ca_system_score_codex":0.0033113807,"about_ca_system_score_gemma":0.0010750885,"threshold_uncertainty_score":0.0629729},"labels":[],"label_agreement":null},{"id":"W4403088534","doi":"10.1016/j.disc.2024.114278","title":"Linear colouring of binomial random graphs","year":2024,"lang":"ca","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Binomial (polynomial); Discrete mathematics; Statistics","score_opus":0.027235953647663784,"score_gpt":0.32104101288585546,"score_spread":0.29380505923819167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403088534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90863967,0.000560058,0.079450116,0.0009167635,0.00007542001,0.000059096306,0.00015950055,0.00029777744,0.009841583],"genre_scores_gemma":[0.99269366,0.00020189026,0.0044777174,0.000117546006,0.000042251675,0.00004377411,0.00009549991,0.000041802385,0.0022859313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993229,0.00029147044,0.000010780341,0.0001113173,0.00008272762,0.00018090219],"domain_scores_gemma":[0.9928342,0.004613966,0.0008780362,0.00037875533,0.00049974635,0.0007953151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014453703,0.00032732828,0.00041867877,0.0014986878,0.0007909389,0.0011475191,0.0010378031,0.00055012456,0.002808],"category_scores_gemma":[0.00790089,0.00035409423,0.00034897585,0.0005305343,0.002704301,0.0015311218,0.0009245648,0.00088793266,0.00029003806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006041404,0.00015828326,0.01602439,0.0002409337,0.00008254372,0.0005966659,0.00059433747,0.14241031,0.019708425,0.80084896,0.0052901288,0.013440875],"study_design_scores_gemma":[0.00007767488,0.0001085859,0.0041207466,0.00003816583,0.000022481898,0.00026354572,0.00015622207,0.7081417,0.003188154,0.28255576,0.0012736785,0.000053319225],"about_ca_topic_score_codex":0.003689486,"about_ca_topic_score_gemma":0.0038169788,"teacher_disagreement_score":0.003689486,"about_ca_system_score_codex":0.0018280143,"about_ca_system_score_gemma":0.00054840004,"threshold_uncertainty_score":0.013263226},"labels":[],"label_agreement":null},{"id":"W4403100092","doi":"10.1007/s10107-024-02146-4","title":"Dyadic linear programming and extensions","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Engineering and Physical Sciences Research Council; Office of Naval Research Global; Natural Sciences and Engineering Research Council of Canada","keywords":"Representation (politics); Mathematics; Rational number; Integer (computer science); Binary number; Closure (psychology); Discrete mathematics; Algorithm; Computer science; Arithmetic","score_opus":0.0349194155187307,"score_gpt":0.334993497210502,"score_spread":0.3000740816917713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403100092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09399809,0.0017232014,0.82820547,0.0032764906,0.00020189703,0.00011034709,0.0006776952,0.00067179545,0.071135096],"genre_scores_gemma":[0.6975514,0.0015345954,0.27198172,0.0007844976,0.00037820626,0.00035374446,0.0008381911,0.00026590397,0.026311714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775153,0.0007477578,0.00011674666,0.00056634867,0.0005505009,0.000267142],"domain_scores_gemma":[0.99589145,0.0024400896,0.00037715008,0.0004168572,0.0006166148,0.00025783165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017302823,0.0006224835,0.0009361753,0.00095461257,0.0009880018,0.0026541285,0.0011953891,0.0006718417,0.011780095],"category_scores_gemma":[0.006925036,0.0004348663,0.000780713,0.0024314448,0.002699652,0.004347219,0.003037259,0.0029330072,0.001405721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000952394,0.000050190458,0.00028520296,0.000121703546,0.000012231119,0.00007137742,0.0002050928,0.016721413,0.00065100077,0.95709056,0.003463652,0.021232238],"study_design_scores_gemma":[0.000031114385,0.000042553806,0.00015870252,0.000046255198,0.000012246382,0.000112217036,0.00014932187,0.08663759,0.0006782149,0.8980884,0.0140268905,0.000016569607],"about_ca_topic_score_codex":0.0024255267,"about_ca_topic_score_gemma":0.0025272353,"teacher_disagreement_score":0.011780095,"about_ca_system_score_codex":0.0023086888,"about_ca_system_score_gemma":0.0011308149,"threshold_uncertainty_score":0.039408326},"labels":[],"label_agreement":null},{"id":"W4403165693","doi":"10.61091/ars-60-03","title":"Illuminating a Graph","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.015949325037328408,"score_gpt":0.28917292093243696,"score_spread":0.27322359589510853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073848754,0.0008455169,0.84435433,0.0018884,0.0002718314,0.00028687197,0.0005962248,0.0008602881,0.07704789],"genre_scores_gemma":[0.59377795,0.0012357661,0.36620158,0.0009054087,0.00015079715,0.0003136514,0.0006565257,0.00033713994,0.036421224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988232,0.00036896218,0.000038880687,0.00030935084,0.00022997579,0.00022954062],"domain_scores_gemma":[0.99881494,0.00055215554,0.000090393616,0.00026299834,0.00009392951,0.00018565191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065641257,0.0011310364,0.0006885421,0.0005140714,0.0010510825,0.0018026815,0.0013307217,0.0012979531,0.01594868],"category_scores_gemma":[0.0023471597,0.00041863442,0.00078564347,0.00055145065,0.0022126106,0.003864593,0.0029581827,0.0023512298,0.0018312111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021264402,0.00011298125,0.0006400177,0.0002292021,0.00004639793,0.00035876787,0.00039355922,0.049722493,0.011956415,0.890993,0.006784444,0.038550016],"study_design_scores_gemma":[0.00006761607,0.00031620136,0.0004787499,0.00007503005,0.000048323534,0.00062850723,0.00032395276,0.1488882,0.006433661,0.77456534,0.06812213,0.000052236952],"about_ca_topic_score_codex":0.0012541852,"about_ca_topic_score_gemma":0.0014636981,"teacher_disagreement_score":0.01594868,"about_ca_system_score_codex":0.0011330346,"about_ca_system_score_gemma":0.0006579759,"threshold_uncertainty_score":0.053353667},"labels":[],"label_agreement":null},{"id":"W4403165696","doi":"10.61091/ars-160-16","title":"Edge Domination and Secure Edge Domination in Mycielski Graph of Trees","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Combinatorics; Domination analysis; Computer science; Vertex (graph theory); Telecommunications","score_opus":0.011006214837464,"score_gpt":0.2774832059882226,"score_spread":0.2664769911507586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80139494,0.001583825,0.16821547,0.0009893589,0.000073715026,0.00011328034,0.000958073,0.00024899427,0.02642232],"genre_scores_gemma":[0.9829427,0.00044361176,0.01438596,0.00008423034,0.000031308096,0.000039568313,0.00026341155,0.00002530624,0.0017840213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890864,0.00017117878,0.000069202004,0.0002614195,0.00028622468,0.00030331124],"domain_scores_gemma":[0.99474984,0.00326036,0.00050964975,0.0005180963,0.0004821021,0.00047991765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009864127,0.00053497247,0.0006048575,0.0013395445,0.0012785243,0.0018549009,0.00094147195,0.00046316264,0.0019506625],"category_scores_gemma":[0.0049239867,0.0003409409,0.0005453117,0.0011218784,0.0015363736,0.0034484959,0.001844581,0.0013321401,0.00024449936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013843692,0.00019831695,0.01922423,0.00061176904,0.00014973518,0.00051168597,0.0014901011,0.08146909,0.06794813,0.7709091,0.005455077,0.050648373],"study_design_scores_gemma":[0.00011629777,0.00028558014,0.009003923,0.00009994241,0.00020473123,0.0010654582,0.0005831371,0.26759556,0.025044583,0.6791086,0.016793348,0.000098767494],"about_ca_topic_score_codex":0.0013129557,"about_ca_topic_score_gemma":0.0024646383,"teacher_disagreement_score":0.0019506625,"about_ca_system_score_codex":0.0018247493,"about_ca_system_score_gemma":0.00072016823,"threshold_uncertainty_score":0.0132395625},"labels":[],"label_agreement":null},{"id":"W4403165709","doi":"10.61091/ars-160-04","title":"Outer Independent Double Roman Domination Stability in Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stability (learning theory); Combinatorics; Computer science","score_opus":0.022446951307488958,"score_gpt":0.2950131467055869,"score_spread":0.27256619539809795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8538639,0.0007807716,0.12832065,0.00024515932,0.000023260312,0.00006649612,0.00041208309,0.00030787312,0.0159798],"genre_scores_gemma":[0.9831424,0.0003785974,0.013915208,0.000050100003,0.00004601246,0.000045049877,0.00038790744,0.000060204053,0.0019745084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993326,0.00011239354,0.000041132298,0.00019472753,0.00018362822,0.00013554974],"domain_scores_gemma":[0.9957867,0.002442769,0.00066339347,0.00031985829,0.00043686433,0.0003504303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007553833,0.00085218536,0.0005255641,0.0022521932,0.00073860557,0.0012738549,0.00087438105,0.00045932955,0.0017805464],"category_scores_gemma":[0.0050021275,0.0003829324,0.0006289896,0.001334697,0.001273158,0.001592634,0.0012421256,0.0006970583,0.00032859523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015001664,0.00022330797,0.031630266,0.0006566594,0.0002659566,0.0010091556,0.0020235237,0.42497644,0.10933724,0.2953249,0.004651557,0.12840089],"study_design_scores_gemma":[0.00007201528,0.0002336905,0.011057503,0.000061956605,0.000092663664,0.00080631336,0.00037171802,0.6992434,0.029106779,0.25260484,0.006274651,0.00007442043],"about_ca_topic_score_codex":0.0012959111,"about_ca_topic_score_gemma":0.0012549453,"teacher_disagreement_score":0.0022521932,"about_ca_system_score_codex":0.0009980139,"about_ca_system_score_gemma":0.00035851746,"threshold_uncertainty_score":0.0072411895},"labels":[],"label_agreement":null},{"id":"W4403165717","doi":"10.61091/ars-160-12","title":"On the k-Spanning Cyclability of 4-Valent Cayley Graphs on Abelian Groups","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Abelian group; Mathematics; Combinatorics; Pure mathematics; Graph","score_opus":0.020262456624433163,"score_gpt":0.2878129390935451,"score_spread":0.26755048246911195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9734167,0.00042999478,0.011340571,0.00025089196,0.000030762872,0.000027086566,0.00013511868,0.00005775525,0.014311127],"genre_scores_gemma":[0.99440336,0.0004632952,0.002967415,0.000045835357,0.00008978947,0.000019707413,0.00021086859,0.000015901667,0.0017839748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997254,0.000057698868,0.00001744943,0.00007218448,0.00004722309,0.0000800909],"domain_scores_gemma":[0.99865204,0.00058311236,0.00034794764,0.000094907125,0.00010476487,0.00021727003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030430214,0.00043840735,0.00028171533,0.0016636819,0.0010091638,0.0011972808,0.00048083317,0.0006369857,0.0045676786],"category_scores_gemma":[0.0013931566,0.00023945092,0.00036225928,0.0014041301,0.0016378735,0.0023707817,0.0010747412,0.00054400193,0.00026510263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043616895,0.00013201241,0.009882754,0.0002628276,0.00005788597,0.002070715,0.0028767665,0.022930335,0.022930013,0.8968823,0.0025811577,0.038957],"study_design_scores_gemma":[0.00005211686,0.00018873469,0.0071767345,0.000069922266,0.00003768428,0.0011480564,0.0016317606,0.038403854,0.004549526,0.93930954,0.00737148,0.000060565566],"about_ca_topic_score_codex":0.001682221,"about_ca_topic_score_gemma":0.0014927335,"teacher_disagreement_score":0.0045676786,"about_ca_system_score_codex":0.0005521899,"about_ca_system_score_gemma":0.00022947958,"threshold_uncertainty_score":0.015280426},"labels":[],"label_agreement":null},{"id":"W4403165727","doi":"10.61091/ars-160-09","title":"Decomposition of Complete Tripartite Graphs into Short Cycles","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Decomposition; Discrete mathematics; Chemistry","score_opus":0.02228818980086592,"score_gpt":0.3231222616827255,"score_spread":0.30083407188185957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47621936,0.0025845533,0.44238213,0.00083916966,0.00028924365,0.0004824004,0.0034776246,0.00055008795,0.07317544],"genre_scores_gemma":[0.838907,0.0011788177,0.12506513,0.00059918273,0.00017895056,0.00040987984,0.0044534975,0.00020937508,0.028998218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995105,0.00008943853,0.000034668814,0.00013642144,0.00011432284,0.000114664275],"domain_scores_gemma":[0.99901915,0.000121315534,0.00016658376,0.00020592548,0.00023536701,0.00025164773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022412064,0.00052407035,0.00040790663,0.0012827654,0.0008752463,0.0013101129,0.0006379003,0.0005740572,0.006651316],"category_scores_gemma":[0.0012929462,0.00040161863,0.0006554992,0.0011180397,0.00069312996,0.0021831307,0.001320513,0.0010060875,0.0010166396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039855012,0.00008845493,0.0018369525,0.00046895805,0.00011704459,0.00054679794,0.0010419105,0.024961624,0.027971428,0.8321564,0.013057192,0.09735455],"study_design_scores_gemma":[0.00003110712,0.000098770106,0.0017114081,0.000106726104,0.00005731769,0.0006059035,0.0004695071,0.047027364,0.0046997545,0.9063103,0.038842358,0.00003946957],"about_ca_topic_score_codex":0.001738779,"about_ca_topic_score_gemma":0.0029715311,"teacher_disagreement_score":0.006651316,"about_ca_system_score_codex":0.00089747796,"about_ca_system_score_gemma":0.0005055168,"threshold_uncertainty_score":0.022250831},"labels":[],"label_agreement":null},{"id":"W4403165805","doi":"10.61091/jcmcc122-12","title":"Tree Covers of Graphs and their Linear Preservers","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Forestry; Tree (set theory); Geography; Discrete mathematics","score_opus":0.018206796616971773,"score_gpt":0.2807509794985006,"score_spread":0.2625441828815288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85630566,0.00079323095,0.10300028,0.0003074473,0.00006829107,0.0000600404,0.00044832748,0.0002904396,0.038726352],"genre_scores_gemma":[0.96621865,0.0005507618,0.020023603,0.00010636404,0.00017250516,0.00007918632,0.0005182704,0.00010100632,0.012229625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993923,0.0000930057,0.000027913711,0.00012442406,0.00021836329,0.00014405443],"domain_scores_gemma":[0.9984176,0.0007390463,0.00034844468,0.0001526854,0.00012257973,0.00021953005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004583795,0.00035921196,0.00030342,0.0013740093,0.0008591404,0.001601456,0.00046072731,0.0005112974,0.0038320045],"category_scores_gemma":[0.0016933461,0.00026409203,0.0006461753,0.0010345781,0.0014074758,0.001906816,0.0010642501,0.0007825531,0.0004373997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021009702,0.00009213837,0.0018170421,0.000096534226,0.00003157419,0.0004943773,0.0008539252,0.011474869,0.014357053,0.92992204,0.0017150735,0.038935244],"study_design_scores_gemma":[0.000044779365,0.00029861013,0.0042403652,0.000039508457,0.00004441462,0.0014333742,0.0004502759,0.06324911,0.010874519,0.9028738,0.016402988,0.000048269583],"about_ca_topic_score_codex":0.00065680087,"about_ca_topic_score_gemma":0.0006160928,"teacher_disagreement_score":0.0038320045,"about_ca_system_score_codex":0.0006132565,"about_ca_system_score_gemma":0.00028246274,"threshold_uncertainty_score":0.01281935},"labels":[],"label_agreement":null},{"id":"W4403166158","doi":"10.61091/jcmcc122-27","title":"Efficient Domination in Grid Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Grid; Computer science; Mathematics; Geometry","score_opus":0.014013155764631998,"score_gpt":0.28755652944821863,"score_spread":0.2735433736835866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4542557,0.0011024058,0.5168297,0.0006060287,0.00006381239,0.00020379345,0.00067085196,0.000484967,0.02578271],"genre_scores_gemma":[0.9372051,0.00051518134,0.054455556,0.00016432935,0.000034674,0.00015993834,0.00049707264,0.000115505514,0.006852672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991524,0.00025100916,0.00004064592,0.00017268956,0.00014948129,0.0002338313],"domain_scores_gemma":[0.9975127,0.0013019715,0.00032895053,0.00039880147,0.00020821633,0.00024936756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074687443,0.0005007311,0.0007810828,0.0006571252,0.0007491312,0.00122727,0.000975396,0.0004562922,0.0024808957],"category_scores_gemma":[0.0033642775,0.00040587722,0.0005031986,0.00094619626,0.0009939119,0.0017700766,0.0012114212,0.00063332124,0.00027627745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045709618,0.00016135792,0.005155674,0.00039992647,0.00014625599,0.0008132123,0.0005413346,0.5413708,0.019210966,0.36487472,0.0064557297,0.06041285],"study_design_scores_gemma":[0.00013066416,0.00012557225,0.0017699349,0.000033404645,0.000048974114,0.00055151293,0.00023844633,0.58877164,0.004528841,0.3936848,0.010088104,0.000028057568],"about_ca_topic_score_codex":0.002861017,"about_ca_topic_score_gemma":0.0029561385,"teacher_disagreement_score":0.002861017,"about_ca_system_score_codex":0.0009520103,"about_ca_system_score_gemma":0.0006094081,"threshold_uncertainty_score":0.00829941},"labels":[],"label_agreement":null},{"id":"W4403166161","doi":"10.61091/jcmcc122-25","title":"Decomposition of Complete Graphs into Paths and Stars with Different Number of Edges","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; Combinatorics; Decomposition; Mathematics; Computer science; Astrophysics; Physics; Chemistry","score_opus":0.014974458052679803,"score_gpt":0.2936325487595871,"score_spread":0.2786580907069073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45080596,0.00072320184,0.5090305,0.00031531634,0.00008809772,0.00020040787,0.0011704,0.00029393125,0.03737216],"genre_scores_gemma":[0.7870165,0.0006987566,0.19718893,0.00019012633,0.00004363586,0.00019193372,0.0020270415,0.00010818112,0.012534948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996613,0.00008473534,0.00001870899,0.00008908808,0.00006914585,0.00007702405],"domain_scores_gemma":[0.9993894,0.000132013,0.00012523988,0.00009749154,0.00012783943,0.0001279719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032852413,0.00049911404,0.0002742841,0.00064482767,0.000535242,0.0008635054,0.00035515105,0.00031530162,0.0032812762],"category_scores_gemma":[0.0008895065,0.00029989812,0.0004953525,0.0005850039,0.00076520693,0.0012122437,0.0008130144,0.0004900236,0.0004085608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005928578,0.00015025158,0.0037058615,0.00042920842,0.00008690978,0.0007163448,0.00074008136,0.04759816,0.028778577,0.8312002,0.007847984,0.07815366],"study_design_scores_gemma":[0.00008663073,0.00024550303,0.004417992,0.00010699111,0.00007894456,0.001200683,0.00064452953,0.09119544,0.007667212,0.86122334,0.03308701,0.00004580653],"about_ca_topic_score_codex":0.00071490224,"about_ca_topic_score_gemma":0.0014560858,"teacher_disagreement_score":0.0032812762,"about_ca_system_score_codex":0.0004477676,"about_ca_system_score_gemma":0.0005225729,"threshold_uncertainty_score":0.010976911},"labels":[],"label_agreement":null},{"id":"W4403214649","doi":"10.1002/jgt.23192","title":"Towards Nash‐Williams orientation conjecture for infinite graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Combinatorics; Orientation (vector space); Nash equilibrium; Discrete mathematics; Mathematical economics; Geometry","score_opus":0.019004085473819626,"score_gpt":0.31852215968629016,"score_spread":0.29951807421247056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403214649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62678564,0.00097299914,0.20576131,0.0056032944,0.0005243588,0.000056967947,0.0002611756,0.00034617406,0.15968803],"genre_scores_gemma":[0.9790244,0.00038421075,0.012987287,0.0005933115,0.0002686004,0.000035658657,0.00019907496,0.000051894327,0.006455592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993722,0.00016099778,0.000018838664,0.000165114,0.00015092167,0.00013195434],"domain_scores_gemma":[0.99686784,0.001653582,0.000268285,0.00031801863,0.00042460815,0.0004676388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010492536,0.00033597878,0.0004081458,0.0009959617,0.0010355094,0.0020340667,0.0007120652,0.0009805434,0.0066467305],"category_scores_gemma":[0.0043623676,0.00031596844,0.00053797255,0.0006099691,0.0034648245,0.003537676,0.0021203142,0.0023358692,0.00061627803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003873951,0.000025704881,0.00095002557,0.000031586922,0.000005266847,0.00013361798,0.00016788932,0.0021214832,0.0010601899,0.9903036,0.0016745159,0.0034874491],"study_design_scores_gemma":[0.000009439125,0.000013041059,0.00042817908,0.000019155921,0.0000052776986,0.000076647724,0.00018022432,0.0073265526,0.0005540357,0.9882395,0.0031392947,0.000008532454],"about_ca_topic_score_codex":0.0018134596,"about_ca_topic_score_gemma":0.0013078868,"teacher_disagreement_score":0.0066467305,"about_ca_system_score_codex":0.0010688534,"about_ca_system_score_gemma":0.00048972055,"threshold_uncertainty_score":0.022235513},"labels":[],"label_agreement":null},{"id":"W4403323930","doi":"10.48550/arxiv.2410.04874","title":"On graphs which have locally complete 2-edge-colourings and their relationship to proper circular-arc graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arc (geometry); Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematics; Indifference graph; 1-planar graph; Chordal graph; Computer science; Graph; Geometry; Telecommunications","score_opus":0.08552962598946565,"score_gpt":0.2229627904206511,"score_spread":0.13743316443118545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403323930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8636377,0.00035708913,0.12286256,0.00035478207,0.000019898453,0.00006955676,0.0005449894,0.0004206495,0.011732814],"genre_scores_gemma":[0.96973383,0.0002119752,0.025770886,0.00008502519,0.000038991344,0.00006474275,0.0008487782,0.000098623794,0.0031472016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991503,0.00016702116,0.00004463995,0.00033093413,0.00015368116,0.00015348723],"domain_scores_gemma":[0.99245065,0.0039023692,0.0016199347,0.0011316875,0.0004167989,0.00047856825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044509812,0.00049158855,0.0004938057,0.0012819013,0.0010130425,0.001484403,0.0008619078,0.00076904194,0.0037800523],"category_scores_gemma":[0.004070594,0.00050568546,0.00061691867,0.0017149176,0.0025484108,0.0035458936,0.0010817879,0.0010712311,0.0003410386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008567806,0.0002202498,0.02650889,0.00058529613,0.000108305096,0.00154534,0.003217525,0.070247225,0.04333119,0.7788585,0.0035540962,0.07096661],"study_design_scores_gemma":[0.000080031285,0.0002688689,0.017745849,0.000080729704,0.00010821119,0.0024016807,0.001073804,0.110486425,0.019161597,0.83707714,0.011435393,0.00008032399],"about_ca_topic_score_codex":0.0023443107,"about_ca_topic_score_gemma":0.0020080025,"teacher_disagreement_score":0.0037800523,"about_ca_system_score_codex":0.0010109792,"about_ca_system_score_gemma":0.00038821672,"threshold_uncertainty_score":0.012645602},"labels":[],"label_agreement":null},{"id":"W4403386980","doi":"10.1016/j.dam.2024.09.029","title":"On some classes of quasi-triangulated graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02014365155555507,"score_gpt":0.30091563586410225,"score_spread":0.28077198430854716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403386980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7088851,0.0015292892,0.1377,0.0038970665,0.00052927795,0.00017967957,0.0014724965,0.0003738858,0.1454332],"genre_scores_gemma":[0.9311083,0.0014569433,0.027890563,0.00079231075,0.0005098124,0.00019180952,0.0016671226,0.00025223466,0.03613088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992798,0.00015158232,0.000030119983,0.00019771648,0.00017507355,0.00016568803],"domain_scores_gemma":[0.9968274,0.001533347,0.00045279745,0.00026715713,0.0003025936,0.0006168025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008412933,0.0006871606,0.00093853706,0.002534694,0.0032813998,0.0037781529,0.0022281394,0.0015211101,0.017142707],"category_scores_gemma":[0.0038125755,0.0008981806,0.0012983902,0.002699571,0.003255238,0.0051844055,0.00232363,0.0035297242,0.00081150356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003392293,0.0000173345,0.00027880582,0.000039107847,0.0000068049785,0.00008419869,0.0001944421,0.0008710102,0.00030383954,0.9943329,0.0012305902,0.0026071265],"study_design_scores_gemma":[0.000024349876,0.0000160398,0.00055804756,0.000024933142,0.0000111611,0.00012656844,0.00020724098,0.0069736103,0.00018561361,0.98846114,0.0034013914,0.000009926813],"about_ca_topic_score_codex":0.003236806,"about_ca_topic_score_gemma":0.0036303839,"teacher_disagreement_score":0.017142707,"about_ca_system_score_codex":0.0025119893,"about_ca_system_score_gemma":0.00074729795,"threshold_uncertainty_score":0.057348073},"labels":[],"label_agreement":null},{"id":"W4403425141","doi":"10.1007/s00012-024-00874-4","title":"Graphs of finite algebras: maximality, rectangularity, and decomposition","year":2024,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Decomposition; Algebra over a field; Pure mathematics; Discrete mathematics","score_opus":0.013411490564310425,"score_gpt":0.2813205636403192,"score_spread":0.2679090730760088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403425141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58243966,0.0033439705,0.34777144,0.003683275,0.00017060846,0.000067107845,0.0007772537,0.0004732543,0.061273344],"genre_scores_gemma":[0.9664547,0.000768215,0.027201932,0.0002719735,0.0001495644,0.000031467156,0.00037346745,0.00008476297,0.004664081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923253,0.0002495732,0.000039665378,0.00023776451,0.00010941313,0.00013094551],"domain_scores_gemma":[0.9944863,0.0028888695,0.00079542043,0.0006476378,0.0005800476,0.00060182885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013039793,0.00040579174,0.0007427241,0.001830095,0.001749762,0.0033013003,0.0011541306,0.00068011443,0.005116347],"category_scores_gemma":[0.004929415,0.0006810234,0.0009791137,0.0019245974,0.0053283954,0.008956059,0.0017821133,0.0019599493,0.00035105873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019405248,0.000006790187,0.00042311315,0.000020691165,0.000004941997,0.000018742854,0.00022272374,0.00039628462,0.0002719404,0.9955468,0.0003436967,0.0027249623],"study_design_scores_gemma":[0.000004996778,0.000004568575,0.00021237525,0.000012393025,0.000010101579,0.00004582956,0.00016306093,0.0017659749,0.00035485864,0.99644285,0.0009765,0.000006486249],"about_ca_topic_score_codex":0.0030729116,"about_ca_topic_score_gemma":0.0036131074,"teacher_disagreement_score":0.005116347,"about_ca_system_score_codex":0.001406162,"about_ca_system_score_gemma":0.0009796317,"threshold_uncertainty_score":0.017115891},"labels":[],"label_agreement":null},{"id":"W4403462576","doi":"10.1016/j.dam.2024.09.030","title":"Time-delayed Cops and Robbers","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Vancouver Island University; Mount Saint Vincent University; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.012243395674120416,"score_gpt":0.2746837846845574,"score_spread":0.262440389010437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403462576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33281815,0.0006720809,0.6257355,0.0011509941,0.00021930475,0.0002677442,0.00047984876,0.00022932234,0.03842691],"genre_scores_gemma":[0.93383455,0.00042120545,0.053682115,0.00018255625,0.000113747,0.00022876161,0.00020397673,0.00008578323,0.011247238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978726,0.000598406,0.00008454557,0.00058437313,0.00043358584,0.0004264771],"domain_scores_gemma":[0.99138695,0.004585689,0.0012388572,0.0010320906,0.00047321952,0.0012830861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018259414,0.0014227194,0.0014332087,0.0008711943,0.0010754495,0.0019495172,0.0033173535,0.001550435,0.009307273],"category_scores_gemma":[0.012819222,0.0006011798,0.00079174235,0.00079867704,0.003349209,0.0066026263,0.0024498715,0.002356023,0.0006012695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005623305,0.00016263318,0.0009084162,0.0001913807,0.00007097441,0.00038461364,0.00029593325,0.18594575,0.0060816314,0.78991556,0.0025050058,0.012975754],"study_design_scores_gemma":[0.00012879922,0.00033234467,0.00059837446,0.000047534926,0.000039605417,0.00027162847,0.00022735301,0.47202206,0.0037347618,0.5164979,0.0060416106,0.00005804018],"about_ca_topic_score_codex":0.0021073772,"about_ca_topic_score_gemma":0.0018112462,"teacher_disagreement_score":0.009307273,"about_ca_system_score_codex":0.0019950706,"about_ca_system_score_gemma":0.0011308743,"threshold_uncertainty_score":0.031135917},"labels":[],"label_agreement":null},{"id":"W4403526016","doi":"10.4230/lipics.gd.2024.14","title":"Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Japan Society for the Promotion of Science; Deutsche Forschungsgemeinschaft","keywords":"Treewidth; Bounding overwatch; Combinatorics; Planar graph; 1-planar graph; Chordal graph; Planar; Clique-sum; Pathwidth; Mathematics; Computer science; Graph; Artificial intelligence; Computer graphics (images); Line graph","score_opus":0.08265023632790686,"score_gpt":0.2319563006026829,"score_spread":0.14930606427477605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403526016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16892469,0.003842058,0.79597986,0.0024119962,0.00021843221,0.00012588901,0.00127132,0.0013531919,0.025872638],"genre_scores_gemma":[0.65313375,0.0054352223,0.32853544,0.00099377,0.0003665378,0.0003190357,0.0023795122,0.0013150781,0.0075215916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979748,0.0003434612,0.000095064526,0.0005520079,0.0006842153,0.00035044886],"domain_scores_gemma":[0.99139637,0.0051379176,0.0010003384,0.001412433,0.00066253974,0.00039045207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010730196,0.0014115376,0.0012912595,0.0016806034,0.0010782003,0.0024691643,0.0027835434,0.0015407188,0.006028311],"category_scores_gemma":[0.014060183,0.0013301932,0.0018704793,0.0023854258,0.0020168293,0.008642245,0.004001673,0.0044688955,0.0016369248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083378365,0.00019986623,0.01168381,0.0015798558,0.00031895845,0.0009570561,0.0016572261,0.33269796,0.049166724,0.41033274,0.02475407,0.1658179],"study_design_scores_gemma":[0.00007529074,0.000121517674,0.0024123583,0.00018360683,0.00014027608,0.00083888345,0.0004150553,0.49959496,0.010862766,0.4657772,0.019500688,0.00007735272],"about_ca_topic_score_codex":0.002381,"about_ca_topic_score_gemma":0.0038307507,"teacher_disagreement_score":0.006028311,"about_ca_system_score_codex":0.0016662508,"about_ca_system_score_gemma":0.000672135,"threshold_uncertainty_score":0.020166755},"labels":[],"label_agreement":null},{"id":"W4403560623","doi":"10.1007/s10878-024-01207-w","title":"The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Brock University","funders":"","keywords":"Theory of computation; Hamiltonian path; Combinatorics; Grid; Mathematics; Hamiltonian (control theory); Hamiltonian path problem; Simple (philosophy); Path (computing); Lattice graph; Discrete mathematics; Simple graph; Graph; Longest path problem; Computer science; Chordal graph; Line graph; Algorithm; Voltage graph; Mathematical optimization; Geometry","score_opus":0.010735848812645252,"score_gpt":0.2803335710840392,"score_spread":0.26959772227139395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403560623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9001177,0.00038995314,0.0601895,0.00068123086,0.000089132074,0.00012302914,0.0009871025,0.00028790356,0.037134383],"genre_scores_gemma":[0.97565186,0.00028744913,0.018390723,0.00015725532,0.000027541757,0.000091287264,0.0007032873,0.00007033892,0.0046203006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978,0.000049044582,0.0000094087145,0.00006800334,0.00003815926,0.000055466196],"domain_scores_gemma":[0.99803644,0.001085576,0.00034474634,0.00012968424,0.00014513684,0.00025841902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025840645,0.00041663964,0.0005592787,0.001228796,0.0012685867,0.0018816654,0.0009251627,0.0011836648,0.011977338],"category_scores_gemma":[0.0030680103,0.0006188184,0.00048005898,0.0013779504,0.0015534983,0.001976628,0.001022754,0.00085688476,0.0006028024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008530541,0.00024985638,0.0075457077,0.00090707693,0.00015280946,0.0011469141,0.0010217435,0.088164054,0.013049562,0.8247213,0.015017993,0.047169987],"study_design_scores_gemma":[0.00017112505,0.0001404177,0.005397195,0.00008364263,0.00008755538,0.0005394087,0.00081659795,0.1454431,0.0023292245,0.84014153,0.0048087635,0.00004151013],"about_ca_topic_score_codex":0.0030266764,"about_ca_topic_score_gemma":0.0041376757,"teacher_disagreement_score":0.011977338,"about_ca_system_score_codex":0.0006844925,"about_ca_system_score_gemma":0.00073552097,"threshold_uncertainty_score":0.04006821},"labels":[],"label_agreement":null},{"id":"W4403733504","doi":"10.1016/j.disc.2024.114288","title":"Large matchings in maximal 1-planar graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics; Planar; Planar graph; Chordal graph; Graph; Computer science","score_opus":0.018123747558879955,"score_gpt":0.30189577878873863,"score_spread":0.28377203122985867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403733504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7012649,0.0036706105,0.23354393,0.00367178,0.00013826057,0.00024932073,0.0012442461,0.001410454,0.054806475],"genre_scores_gemma":[0.93680626,0.001536482,0.05303045,0.0006682115,0.00016815584,0.00016532527,0.00091209775,0.00022933625,0.00648374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980914,0.00035016873,0.00009815233,0.0006559527,0.00041990963,0.0003844025],"domain_scores_gemma":[0.98473245,0.01106735,0.0020067676,0.00082341867,0.00047019063,0.00089990057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001632872,0.0009210574,0.0010108284,0.0015941595,0.0012804173,0.0023656026,0.0018656417,0.0015727056,0.0108999675],"category_scores_gemma":[0.015243224,0.0009828364,0.00082798884,0.002182651,0.0019515045,0.007841375,0.0027771986,0.0016179279,0.001084122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017877733,0.00042522524,0.008958875,0.002011082,0.00026414584,0.0013632255,0.0013086847,0.09517919,0.058208875,0.73044425,0.012563744,0.087484956],"study_design_scores_gemma":[0.00015202834,0.00022513699,0.0026056129,0.00011484744,0.00014279778,0.0008881082,0.00049935986,0.0686686,0.018653158,0.8944893,0.013501431,0.000059674305],"about_ca_topic_score_codex":0.0011405151,"about_ca_topic_score_gemma":0.0018496678,"teacher_disagreement_score":0.0108999675,"about_ca_system_score_codex":0.0015290232,"about_ca_system_score_gemma":0.00069724064,"threshold_uncertainty_score":0.036463976},"labels":[],"label_agreement":null},{"id":"W4404235910","doi":"10.1016/j.dam.2024.10.026","title":"Recoloring some hereditary graph classes","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.02648004777911063,"score_gpt":0.2954527750302783,"score_spread":0.26897272725116766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404235910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80885255,0.00030709815,0.08950666,0.0011260813,0.0002122728,0.00009170447,0.00045311992,0.0007437855,0.09870675],"genre_scores_gemma":[0.91922647,0.00030679212,0.03462119,0.0003789692,0.00011492378,0.00007360531,0.0005611816,0.00043800293,0.044278838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947506,0.00009934575,0.000020601856,0.00015753215,0.000110212975,0.0001372654],"domain_scores_gemma":[0.9978254,0.000960158,0.00029459377,0.00043959823,0.00019292848,0.00028732448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050775055,0.00038160392,0.00046579854,0.0010573032,0.0021500876,0.0016090538,0.0009979502,0.00072229415,0.010141224],"category_scores_gemma":[0.0021951539,0.00041679476,0.00065244926,0.0009388891,0.0012649152,0.0020603067,0.001155767,0.0013413114,0.00073624816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013086559,0.00011963327,0.001556814,0.00011266827,0.000025188452,0.0002509376,0.00068256876,0.0033655704,0.008000201,0.9475089,0.00746237,0.030784253],"study_design_scores_gemma":[0.000068693094,0.000055656426,0.0021117718,0.000039967497,0.000052626394,0.0005453069,0.00042263838,0.021359857,0.008268461,0.9469357,0.02011288,0.000026365607],"about_ca_topic_score_codex":0.0017159063,"about_ca_topic_score_gemma":0.003004417,"teacher_disagreement_score":0.010141224,"about_ca_system_score_codex":0.0012739227,"about_ca_system_score_gemma":0.0004540767,"threshold_uncertainty_score":0.03392577},"labels":[],"label_agreement":null},{"id":"W4404885503","doi":"10.1002/rsa.21271","title":"Typical Structure of Hereditary Graph Families. I. Apex‐free Families","year":2024,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Graph","score_opus":0.008741220257620879,"score_gpt":0.258519497421506,"score_spread":0.2497782771638851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404885503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8332792,0.0012327409,0.13854586,0.00080443703,0.000056596888,0.00007189399,0.00095457997,0.00031863773,0.024736142],"genre_scores_gemma":[0.98585284,0.000294101,0.011524626,0.00006068775,0.000044107383,0.00003995905,0.0002774398,0.000031648186,0.0018745763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920493,0.00013223282,0.000048542573,0.00025625248,0.00022905813,0.00012899238],"domain_scores_gemma":[0.9947267,0.0022839122,0.0010724908,0.00055833935,0.0006001881,0.00075849076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010358114,0.00026375634,0.000534724,0.002225546,0.001762347,0.0019436503,0.000736862,0.00075364293,0.003639466],"category_scores_gemma":[0.0053974106,0.00045453492,0.0005834422,0.001777705,0.002281612,0.004408832,0.0011030949,0.0009876216,0.00021394833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056182344,0.000025190264,0.0057545374,0.000073725816,0.000023825723,0.00022619925,0.0005537304,0.007713332,0.0018880892,0.9745667,0.0014126617,0.007705773],"study_design_scores_gemma":[0.000026912696,0.000051278254,0.0042760577,0.000052955675,0.00003859712,0.0015385575,0.0004949818,0.0510271,0.0025457162,0.9313194,0.00858181,0.000046706078],"about_ca_topic_score_codex":0.0014167731,"about_ca_topic_score_gemma":0.00083638716,"teacher_disagreement_score":0.003639466,"about_ca_system_score_codex":0.0019415137,"about_ca_system_score_gemma":0.00047974198,"threshold_uncertainty_score":0.014086783},"labels":[],"label_agreement":null},{"id":"W4404984221","doi":"","title":"A NOTE ON QUARTER-SYMMETRIC METRIC CONNECTIONS","year":2015,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Metric (unit); Mathematics; Combinatorics; Geography; Engineering; Archaeology; Operations management","score_opus":0.3238713946165705,"score_gpt":0.5692896157092927,"score_spread":0.2454182210927222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404984221","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07748812,0.0044073258,0.19424231,0.045796733,0.014320246,0.00013249848,0.0015121321,0.0012610285,0.66083956],"genre_scores_gemma":[0.69522077,0.005959487,0.08475668,0.014028199,0.008672107,0.000299462,0.0013333337,0.001807237,0.18792272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985061,0.0004117969,0.000082452236,0.00030431533,0.0005062936,0.00018901912],"domain_scores_gemma":[0.9956032,0.0014227035,0.00031837428,0.0012618664,0.00086329266,0.0005305444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015235135,0.00080261036,0.0011041894,0.0017649058,0.0034075738,0.0030772663,0.0026259008,0.0030171315,0.033441737],"category_scores_gemma":[0.010876602,0.00043581083,0.0008395184,0.0025085947,0.0029458362,0.011785943,0.0039206236,0.005292699,0.005661548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001462923,0.0000059809136,0.0000354766,0.00002178128,0.0000022101856,0.00003955901,0.0000426965,0.0002060273,0.00016952289,0.9827969,0.010788219,0.005876976],"study_design_scores_gemma":[0.0000045377383,0.0000073650617,0.000052478514,0.000009976176,0.0000022318932,0.00011598108,0.000024131841,0.0009862396,0.00013482376,0.98200476,0.01664959,0.000007895441],"about_ca_topic_score_codex":0.0012072208,"about_ca_topic_score_gemma":0.0011269458,"teacher_disagreement_score":0.033441737,"about_ca_system_score_codex":0.0013501908,"about_ca_system_score_gemma":0.00087347213,"threshold_uncertainty_score":0.111873806},"labels":[],"label_agreement":null},{"id":"W4405231961","doi":"10.1017/s0963548324000415","title":"Tight bound for the Erdős–Pósa property of tree minors","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; University of Ottawa","keywords":"Combinatorics; Mathematics; Disjoint sets; Upper and lower bounds; Minor (academic); Vertex (graph theory); Graph; Tree (set theory); Discrete mathematics; Integer (computer science); Pairwise comparison; Computer science; Statistics","score_opus":0.043453593176519964,"score_gpt":0.3042557150052427,"score_spread":0.2608021218287227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405231961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39458805,0.0055405702,0.5155463,0.010894599,0.00090864423,0.00048428428,0.0041596526,0.0030769145,0.06480102],"genre_scores_gemma":[0.9051137,0.002527488,0.07613949,0.001430191,0.0011749949,0.00045821635,0.0021343555,0.0010657447,0.009955898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962231,0.0007570723,0.00020865255,0.0011778866,0.00085419626,0.00077902246],"domain_scores_gemma":[0.96428174,0.023383697,0.0022566377,0.0048091444,0.0022077835,0.003061012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004021193,0.0018117074,0.0032133288,0.0023020448,0.003229123,0.006295982,0.004265562,0.0024168866,0.017068502],"category_scores_gemma":[0.030776048,0.0018431145,0.0029456501,0.0026528602,0.0037284596,0.01610162,0.005918266,0.006590003,0.0033479072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025599939,0.0006520219,0.008878295,0.0013806951,0.0003642952,0.0013405953,0.0018991051,0.053400274,0.044690125,0.78840446,0.040752582,0.05567755],"study_design_scores_gemma":[0.0002247177,0.00033303804,0.0022181529,0.00019008826,0.000273842,0.0017453474,0.00040626852,0.18623534,0.010680812,0.7790874,0.018467428,0.00013755636],"about_ca_topic_score_codex":0.0012802046,"about_ca_topic_score_gemma":0.001148004,"teacher_disagreement_score":0.017068502,"about_ca_system_score_codex":0.0025659865,"about_ca_system_score_gemma":0.001317877,"threshold_uncertainty_score":0.05709982},"labels":[],"label_agreement":null},{"id":"W4405364433","doi":"10.1137/23m1548591","title":"On the Parameterized Complexity of Deletion to \\(\\boldsymbol{\\mathcal{H}}\\)-Free Strong Components","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Horizon 2020 Framework Programme","keywords":"Parameterized complexity; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.08969256280258837,"score_gpt":0.33928839582178805,"score_spread":0.2495958330191997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405364433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6743307,0.00089533225,0.25164744,0.008356266,0.00030486297,0.00038945966,0.0043150038,0.003042706,0.056718197],"genre_scores_gemma":[0.9256724,0.0005656969,0.043798693,0.0010641811,0.00030047607,0.00039036793,0.0043891044,0.0021827165,0.021636363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951207,0.0011709222,0.0002592311,0.0011375644,0.0012134106,0.001098095],"domain_scores_gemma":[0.9602979,0.030391566,0.0020770708,0.0042322488,0.0014398814,0.0015614188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029157735,0.0018577,0.0023928748,0.0019140526,0.003497928,0.009653704,0.0063735493,0.0033191151,0.030269781],"category_scores_gemma":[0.030006979,0.0015205678,0.0028356088,0.0034885542,0.004916185,0.021266717,0.0072057825,0.006737359,0.0030452483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016338958,0.0004752342,0.006220725,0.00064509606,0.00018116174,0.00033622797,0.0016483354,0.113937736,0.0060651703,0.8031886,0.02171786,0.043949872],"study_design_scores_gemma":[0.0001789662,0.000064108994,0.0011182146,0.000058665508,0.00013561976,0.00018730437,0.0003162073,0.13507749,0.0033614347,0.85589415,0.0035539719,0.00005390411],"about_ca_topic_score_codex":0.0051976284,"about_ca_topic_score_gemma":0.005810036,"teacher_disagreement_score":0.030269781,"about_ca_system_score_codex":0.005557175,"about_ca_system_score_gemma":0.003985129,"threshold_uncertainty_score":0.10126245},"labels":[],"label_agreement":null},{"id":"W4405475243","doi":"10.1137/24m169669x","title":"Corrigendum: Orthogonal Tree-Decompositions of Graphs","year":2024,"lang":"en","type":"erratum","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Australian Research Council; University of Ottawa","keywords":"Mathematics; Combinatorics; Tree (set theory); Discrete mathematics","score_opus":0.031064065311332986,"score_gpt":0.3166621801442057,"score_spread":0.28559811483287273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405475243","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041509978,0.0033636633,0.0036701246,0.041825727,0.9243978,0.00004109194,0.0012117899,0.00063413946,0.02444054],"genre_scores_gemma":[0.026022024,0.018064156,0.014461906,0.05292236,0.453188,0.00029851487,0.005295934,0.003013163,0.4267339],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964533,0.0008007203,0.00033044146,0.00063479645,0.0015528632,0.00022780734],"domain_scores_gemma":[0.98527217,0.0032558164,0.0003266373,0.001577205,0.008906239,0.0006618996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022587948,0.002405027,0.0022139782,0.005616914,0.003228638,0.004686315,0.003157494,0.003633883,0.09324079],"category_scores_gemma":[0.0282876,0.0010335451,0.002027588,0.005585487,0.0021748089,0.0041825417,0.0017282147,0.004862733,0.03836336],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016639347,0.000008546093,0.000031353735,0.00009183317,0.000008558735,0.000046355002,0.000012340668,0.00012237413,0.00004071673,0.0038031375,0.988214,0.007604102],"study_design_scores_gemma":[0.00004183862,0.000043493335,0.0012334763,0.00027802316,0.00008244781,0.00040030546,0.00008511538,0.0019216532,0.00047857928,0.032349642,0.96301323,0.000072239025],"about_ca_topic_score_codex":0.017806098,"about_ca_topic_score_gemma":0.024588563,"teacher_disagreement_score":0.09324079,"about_ca_system_score_codex":0.0049021575,"about_ca_system_score_gemma":0.002563553,"threshold_uncertainty_score":0.31192154},"labels":[],"label_agreement":null},{"id":"W4405592103","doi":"10.1051/ita/2024015","title":"Enumerating Minimum Feedback Vertex Sets in directed graphs with union-cat trees","year":2024,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Vertex (graph theory); Combinatorics; Feedback vertex set; Mathematics; Discrete mathematics; Graph; Computer science","score_opus":0.008375581791291243,"score_gpt":0.26857800056655173,"score_spread":0.2602024187752605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405592103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51968133,0.0006747052,0.47300047,0.00040451146,0.00003215132,0.00014359961,0.0021074698,0.0011725116,0.0027832468],"genre_scores_gemma":[0.7245295,0.00026252892,0.2707459,0.000092232636,0.000016459839,0.00020053683,0.0024838455,0.00013774035,0.001531222],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992545,0.00016971081,0.00007611131,0.00019112405,0.00020748023,0.00010101783],"domain_scores_gemma":[0.996009,0.0028294965,0.00029473612,0.00033376834,0.00033470354,0.0001983314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008351297,0.00041537758,0.00094854226,0.0013553894,0.00087077514,0.0012478705,0.0014327794,0.001038782,0.0017335361],"category_scores_gemma":[0.007162745,0.0004750123,0.0007085699,0.0015478566,0.0006943961,0.0032657431,0.0012276232,0.0010018173,0.00029124034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001094321,0.00046003112,0.017537387,0.0015070419,0.00014737873,0.00055031374,0.0017245706,0.35950503,0.03728012,0.20223814,0.009424415,0.36853123],"study_design_scores_gemma":[0.00007704228,0.00016430592,0.0014565523,0.00012117459,0.000046139416,0.0004733631,0.00049341633,0.7044943,0.017874362,0.27067995,0.0040823636,0.00003701803],"about_ca_topic_score_codex":0.001512545,"about_ca_topic_score_gemma":0.0028107932,"teacher_disagreement_score":0.0017335361,"about_ca_system_score_codex":0.0009468126,"about_ca_system_score_gemma":0.0009911408,"threshold_uncertainty_score":0.0068696737},"labels":[],"label_agreement":null},{"id":"W4405695073","doi":"10.1016/j.disc.2024.114372","title":"Existential closure in uniform hypergraphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Closure (psychology); Combinatorics; Discrete mathematics; Hypergraph; Existentialism","score_opus":0.02157182862074907,"score_gpt":0.305390688148636,"score_spread":0.28381885952788694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405695073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4826525,0.0009910215,0.4849116,0.0011590476,0.00009102875,0.00011170032,0.0006229939,0.0007145811,0.028745571],"genre_scores_gemma":[0.9302389,0.0004145206,0.061934292,0.00042043603,0.00006993394,0.00022175926,0.00040327923,0.0001938148,0.0061030434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975078,0.0009399873,0.00014594515,0.00070856186,0.00039786007,0.0002998864],"domain_scores_gemma":[0.98827565,0.0077095455,0.0008246109,0.0016982754,0.0007716795,0.0007203539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024686581,0.0004976136,0.00064625224,0.0009594131,0.0015480334,0.0021386538,0.00096952333,0.0009826336,0.0032701418],"category_scores_gemma":[0.012829014,0.00076365646,0.00096998806,0.00086431124,0.004039165,0.0045696846,0.0034541488,0.0021216704,0.0003657544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098799464,0.000030973748,0.0013778076,0.00009947375,0.00001902597,0.00014960903,0.00059469906,0.0058240816,0.004184821,0.97480214,0.0009376586,0.011880962],"study_design_scores_gemma":[0.00003644191,0.000058095502,0.0007170427,0.000053173062,0.000029354484,0.00038765164,0.0002050107,0.02184672,0.0045887907,0.9650776,0.0069692866,0.000030789557],"about_ca_topic_score_codex":0.00070316176,"about_ca_topic_score_gemma":0.0005304258,"teacher_disagreement_score":0.0032701418,"about_ca_system_score_codex":0.0015872681,"about_ca_system_score_gemma":0.00058312673,"threshold_uncertainty_score":0.013055682},"labels":[],"label_agreement":null},{"id":"W4405806035","doi":"10.1016/j.ejc.2024.104104","title":"On heroes in digraphs with forbidden induced forests","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; Grantová Agentura České Republiky","keywords":"Mathematics; Combinatorics; Digraph","score_opus":0.01995709647949996,"score_gpt":0.27270917631230945,"score_spread":0.2527520798328095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405806035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67530274,0.0014087097,0.2057418,0.0027707492,0.00040547532,0.00018292372,0.0009824035,0.0006723463,0.1125329],"genre_scores_gemma":[0.91052437,0.0010839535,0.03595938,0.00052592036,0.00028090848,0.00009778313,0.00091603084,0.0003009245,0.050310772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925464,0.00021381561,0.000031648713,0.00016426083,0.00012205418,0.00021352097],"domain_scores_gemma":[0.99415684,0.0034748886,0.00057993596,0.00035036338,0.00035886155,0.0010791206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007883643,0.0007814953,0.0014135164,0.0019248055,0.0032787605,0.0028886236,0.0014738552,0.001984978,0.01000926],"category_scores_gemma":[0.0046227113,0.0010607556,0.0011994621,0.001655081,0.0022023125,0.0048708925,0.0028831132,0.00308687,0.0010937471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017033957,0.0000690439,0.00083569705,0.00011914321,0.000022333463,0.0004230912,0.0007060157,0.0077841873,0.0011095793,0.97772104,0.0034860948,0.007553516],"study_design_scores_gemma":[0.00005156183,0.000036508216,0.00034415704,0.00005796014,0.00002331913,0.00021581411,0.00031760946,0.027590211,0.00044074262,0.96676517,0.0041390355,0.000017767974],"about_ca_topic_score_codex":0.0036655331,"about_ca_topic_score_gemma":0.006067435,"teacher_disagreement_score":0.01000926,"about_ca_system_score_codex":0.0016914166,"about_ca_system_score_gemma":0.0007253983,"threshold_uncertainty_score":0.03348428},"labels":[],"label_agreement":null},{"id":"W4406142000","doi":"10.1137/1.9781611978322.110","title":"Planar Graphs in Blowups of Fans","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Social Sciences and Humanities Research Council; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Computer science","score_opus":0.05531187485176512,"score_gpt":0.2729049954355485,"score_spread":0.2175931205837834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406142000","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33555883,0.0051782355,0.33347178,0.0013597916,0.0005116321,0.0001438682,0.0006421948,0.0013263698,0.32180727],"genre_scores_gemma":[0.8094914,0.003474477,0.09062419,0.00039786135,0.0002487582,0.000097716125,0.0009788831,0.0003734791,0.094313145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998791,0.000014808959,0.000003366478,0.0000372152,0.00004756888,0.00001797126],"domain_scores_gemma":[0.9998066,0.0000688493,0.000027590419,0.000040926298,0.000029642966,0.00002649597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102912745,0.0004395971,0.0003012464,0.000649367,0.0005623265,0.00064755714,0.00042163098,0.00033097432,0.008577972],"category_scores_gemma":[0.0006965117,0.0003396492,0.0004271833,0.000597658,0.00083498243,0.001529846,0.0011074714,0.00084474223,0.0009766676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010867534,0.00002281396,0.00036038077,0.0003078205,0.000021085705,0.00048563955,0.00038782513,0.025477923,0.01529291,0.85334116,0.009112857,0.095080964],"study_design_scores_gemma":[0.000028024662,0.00008870414,0.0014778046,0.000103777864,0.00004057985,0.0011356348,0.00036917432,0.044853874,0.010394983,0.80693066,0.13455376,0.000023084489],"about_ca_topic_score_codex":0.0007900824,"about_ca_topic_score_gemma":0.0011157278,"teacher_disagreement_score":0.008577972,"about_ca_system_score_codex":0.00041164496,"about_ca_system_score_gemma":0.00015580635,"threshold_uncertainty_score":0.02869618},"labels":[],"label_agreement":null},{"id":"W4406151938","doi":"10.1137/1.9781611978322.151","title":"Tree Independence Number IV. Even-hole-free graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Tree (set theory); Independence (probability theory); Mathematics; Combinatorics; Independence number; Discrete mathematics; Graph; Statistics","score_opus":0.05098567971063879,"score_gpt":0.280411270088534,"score_spread":0.22942559037789523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406151938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40694737,0.0050026835,0.28274605,0.0037623716,0.00045558528,0.00014072121,0.0012360493,0.0011232109,0.29858604],"genre_scores_gemma":[0.92589575,0.0018734151,0.034057494,0.00044371904,0.00020159777,0.00006571941,0.0006904253,0.00018828954,0.0365836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997271,0.000025108277,0.0000074279396,0.00007294862,0.000108517765,0.00005895616],"domain_scores_gemma":[0.99883157,0.0006855619,0.000102754944,0.00015391223,0.00009731602,0.00012896386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024593298,0.0002786198,0.00026384866,0.0005698924,0.0005412347,0.001460048,0.0006489225,0.00035511923,0.0060998136],"category_scores_gemma":[0.001592873,0.00027838585,0.0003936688,0.0008403659,0.0010531609,0.0019919872,0.00071468565,0.002208435,0.0009035268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031772113,0.000111509275,0.0031266601,0.00042836062,0.000030686348,0.0004189939,0.00037851575,0.033980668,0.050292123,0.7805106,0.024255238,0.10614898],"study_design_scores_gemma":[0.000023654542,0.000058941125,0.0037420164,0.000053149073,0.00003293483,0.00054600416,0.00009080486,0.06271531,0.021709533,0.8801656,0.030834673,0.000027382317],"about_ca_topic_score_codex":0.0012013362,"about_ca_topic_score_gemma":0.001423296,"teacher_disagreement_score":0.0060998136,"about_ca_system_score_codex":0.0011275907,"about_ca_system_score_gemma":0.0004884921,"threshold_uncertainty_score":0.020405948},"labels":[],"label_agreement":null},{"id":"W4406163979","doi":"10.61091/ars161-15","title":"Hamilton-connected properties of 3-connected {claw, hourglass, bull}-free graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Hourglass; Mathematics; Combinatorics; Geography; Structural engineering; Engineering","score_opus":0.01876740492641785,"score_gpt":0.24959209917180447,"score_spread":0.23082469424538662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406163979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9405855,0.00021887978,0.036205065,0.00024496944,0.00001876324,0.000056411252,0.0005696769,0.0001830678,0.021917704],"genre_scores_gemma":[0.9884157,0.00017813398,0.007820431,0.00007205958,0.000013811802,0.00004483024,0.0004813192,0.000045015015,0.0029286984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998529,0.000017202308,0.000008831022,0.0000435877,0.00004059288,0.000036840378],"domain_scores_gemma":[0.9990466,0.00036496858,0.00023164923,0.00009592345,0.00009992694,0.00016093659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121905185,0.00028957773,0.00021130955,0.0009959845,0.0011117962,0.0010232126,0.0005059439,0.0004365761,0.0052194027],"category_scores_gemma":[0.0009428567,0.00035792805,0.00026563497,0.00089180836,0.0009365344,0.0010146546,0.00069125294,0.0005344289,0.00026520048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048423212,0.00014906781,0.017210575,0.0005605142,0.00013733085,0.0031011375,0.0029774748,0.022822678,0.09820299,0.7957187,0.0069837705,0.05165148],"study_design_scores_gemma":[0.00013739121,0.00016666754,0.027183596,0.000117427306,0.00021579265,0.0031082043,0.0018102557,0.049245354,0.044575747,0.8441462,0.029195229,0.00009817849],"about_ca_topic_score_codex":0.0040271115,"about_ca_topic_score_gemma":0.0054183872,"teacher_disagreement_score":0.0052194027,"about_ca_system_score_codex":0.00047717404,"about_ca_system_score_gemma":0.0003222343,"threshold_uncertainty_score":0.017460644},"labels":[],"label_agreement":null},{"id":"W4406164433","doi":"10.61091/ars161-10","title":"3-Trees with Diameter 2","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.013178216316463988,"score_gpt":0.2714635989864607,"score_spread":0.25828538266999673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48323557,0.003951001,0.3407571,0.002260338,0.0005257208,0.00031044416,0.0077186613,0.0013126059,0.15992856],"genre_scores_gemma":[0.8239591,0.002087427,0.13477589,0.0009186064,0.0002566577,0.0002740478,0.0042264536,0.0003396109,0.033162143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960774,0.00004319474,0.000027873597,0.00012031815,0.000102434846,0.00009842856],"domain_scores_gemma":[0.9986877,0.000533334,0.00024291249,0.0001688729,0.00018912237,0.00017807061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024181079,0.00040973423,0.0004653472,0.0008574304,0.0008444931,0.0016830147,0.0005737908,0.0010445527,0.0067791096],"category_scores_gemma":[0.0016103634,0.00045258153,0.0006166576,0.0010668936,0.00082319044,0.0018955753,0.0012181655,0.0010746323,0.0022047805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037503094,0.00008166099,0.0029353693,0.00046998658,0.000044947545,0.0008473792,0.0007146855,0.007884306,0.050508518,0.8621042,0.014716096,0.05931784],"study_design_scores_gemma":[0.00007562787,0.00014696247,0.005066423,0.00013157284,0.00006494769,0.003516221,0.00039923843,0.018912902,0.01785638,0.8192811,0.1344928,0.000055761833],"about_ca_topic_score_codex":0.0005476914,"about_ca_topic_score_gemma":0.0008325061,"teacher_disagreement_score":0.0067791096,"about_ca_system_score_codex":0.0005604837,"about_ca_system_score_gemma":0.00033383304,"threshold_uncertainty_score":0.022678375},"labels":[],"label_agreement":null},{"id":"W4406164824","doi":"10.61091/ars161-16","title":"The 2 -burning Number of a Graph","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01337650856485818,"score_gpt":0.30332214073398817,"score_spread":0.28994563216913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5838604,0.0011662756,0.35461572,0.0050649345,0.0002017747,0.00022077166,0.000805239,0.0005477283,0.053517215],"genre_scores_gemma":[0.9356314,0.0005821637,0.046900578,0.000398731,0.00012392027,0.00019744283,0.0003702431,0.00017018494,0.015625445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998566,0.0005958516,0.000052724798,0.00033788808,0.00022499614,0.00022263225],"domain_scores_gemma":[0.9894075,0.0064854436,0.0012344908,0.0009374809,0.00044883165,0.0014862851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022117475,0.00092854444,0.0014095402,0.001331788,0.001966304,0.0032296602,0.0026459203,0.0025663697,0.010940521],"category_scores_gemma":[0.012753705,0.0009761875,0.0010253818,0.0010555318,0.003817679,0.007818833,0.0018867484,0.003330549,0.0011760169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003035263,0.00013232089,0.0013069956,0.00017150446,0.00003589174,0.00023666419,0.00060663855,0.0866115,0.0043524164,0.8950472,0.004212601,0.0069827056],"study_design_scores_gemma":[0.00008307032,0.000105155435,0.00041311487,0.0000484089,0.000021799842,0.0002608271,0.00018632963,0.32721883,0.0011616569,0.66749465,0.0029676908,0.00003841977],"about_ca_topic_score_codex":0.0014768639,"about_ca_topic_score_gemma":0.0012215001,"teacher_disagreement_score":0.010940521,"about_ca_system_score_codex":0.002333892,"about_ca_system_score_gemma":0.0010465049,"threshold_uncertainty_score":0.036599696},"labels":[],"label_agreement":null},{"id":"W4406171432","doi":"10.1016/j.disc.2024.114383","title":"The sandwich problem for odd-hole-free and even-hole-free graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016880662444144736,"score_gpt":0.29887521204873435,"score_spread":0.28199454960458964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58268756,0.0020059112,0.39177436,0.005048358,0.00020194509,0.00038995803,0.0025471528,0.00069456303,0.014650242],"genre_scores_gemma":[0.90825397,0.0010098525,0.08392258,0.0005940451,0.00019527918,0.00021732593,0.002133366,0.0001405717,0.0035330658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852496,0.00040941776,0.00015460646,0.0005041186,0.00017455584,0.00023240031],"domain_scores_gemma":[0.9855354,0.011247837,0.0008862089,0.00127391,0.00036914225,0.00068750576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026429736,0.0010152298,0.0013412418,0.0006026031,0.0017401833,0.0028717278,0.002048865,0.0021994999,0.0037992462],"category_scores_gemma":[0.010645839,0.0008582752,0.0016883557,0.0011433188,0.0026734625,0.011199836,0.0030073852,0.0027298422,0.0005055279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026661565,0.00073322555,0.009979293,0.0017962041,0.00039402596,0.0019885886,0.0024204697,0.14277373,0.017340465,0.6939579,0.019934062,0.1060159],"study_design_scores_gemma":[0.00018482916,0.00021451704,0.0013436667,0.00007069402,0.00009648086,0.0010314016,0.00080470246,0.09156436,0.006261139,0.8929185,0.0054518706,0.00005783606],"about_ca_topic_score_codex":0.0013416538,"about_ca_topic_score_gemma":0.0009703735,"teacher_disagreement_score":0.0037992462,"about_ca_system_score_codex":0.0012052275,"about_ca_system_score_gemma":0.0012151223,"threshold_uncertainty_score":0.013977528},"labels":[],"label_agreement":null},{"id":"W4406172191","doi":"10.61091/um121-06","title":"D-irregularity Strength of a Graph","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Direktorat Jenderal Pendidikan Tinggi; Kementerian Pendidikan, Kebudayaan, Riset, dan Teknologi; Institut Teknologi Bandung","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.026275882808709693,"score_gpt":0.31175349837280947,"score_spread":0.2854776155640998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406172191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9146335,0.00027949794,0.062897764,0.00075858424,0.000052844327,0.000043750446,0.0003555989,0.00014698015,0.020831486],"genre_scores_gemma":[0.9840514,0.00020346134,0.013548292,0.00012613917,0.000055165587,0.000046025016,0.00019952415,0.00003974444,0.0017303445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992574,0.00016998456,0.000050140305,0.00023277116,0.00017225649,0.000117434116],"domain_scores_gemma":[0.9935867,0.002833653,0.001161381,0.0007095566,0.0005779028,0.0011308688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010477838,0.00039439907,0.00053222344,0.0019110363,0.0011384326,0.0013984751,0.0007718678,0.00069074554,0.0023337742],"category_scores_gemma":[0.0054291105,0.000402141,0.00048367336,0.0009567154,0.0018497584,0.002044058,0.0015804366,0.0013008869,0.0003126209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003332142,0.000109302535,0.01734839,0.00023776553,0.00009806425,0.0005018711,0.0007764601,0.031622432,0.039040614,0.87805885,0.0022186914,0.029654274],"study_design_scores_gemma":[0.000062328654,0.00023402166,0.012849532,0.00007485147,0.00008310808,0.0014785652,0.00053991674,0.17371859,0.015948517,0.7815299,0.013396154,0.00008458067],"about_ca_topic_score_codex":0.00045051437,"about_ca_topic_score_gemma":0.0003833157,"teacher_disagreement_score":0.0023337742,"about_ca_system_score_codex":0.00089209474,"about_ca_system_score_gemma":0.00029711568,"threshold_uncertainty_score":0.007807195},"labels":[],"label_agreement":null},{"id":"W4406203418","doi":"10.61091/jcmcc123-42","title":"Saturation of \\(K_{4}\\) Subdivisions in Multidimensional Grids","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Graph; Complete bipartite graph; Induced subgraph; Discrete mathematics; Vertex (graph theory)","score_opus":0.017579574090746362,"score_gpt":0.30022087855568325,"score_spread":0.2826413044649369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406203418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8595342,0.00030717006,0.11122412,0.00039512236,0.000048174352,0.00008593734,0.000582399,0.00072673534,0.027096163],"genre_scores_gemma":[0.9468403,0.00011837149,0.046727,0.00010031344,0.000012497055,0.000102608305,0.00085853296,0.00014085021,0.0050995355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994307,0.00010890127,0.000044447694,0.00013448653,0.000102133556,0.00017931289],"domain_scores_gemma":[0.99834585,0.0005749868,0.00019176674,0.00042804432,0.00022364067,0.00023572554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033063054,0.000341681,0.0006112887,0.00062913704,0.0007954119,0.0013787984,0.0013166474,0.00063238,0.005660442],"category_scores_gemma":[0.0027775601,0.0004889507,0.0004807044,0.00079715066,0.0009382353,0.0017198945,0.0026421302,0.00065158296,0.0009321758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013741859,0.00027134045,0.015649404,0.0005600487,0.000100359066,0.00085152965,0.0022527257,0.3248673,0.055755947,0.49365154,0.009225506,0.095440075],"study_design_scores_gemma":[0.00012463576,0.00020196165,0.0032699073,0.000102095226,0.000036089066,0.00037032287,0.0010541161,0.7221006,0.021889133,0.23345418,0.017352698,0.00004426037],"about_ca_topic_score_codex":0.002969132,"about_ca_topic_score_gemma":0.0029537503,"teacher_disagreement_score":0.005660442,"about_ca_system_score_codex":0.0010392794,"about_ca_system_score_gemma":0.00046630725,"threshold_uncertainty_score":0.018936098},"labels":[],"label_agreement":null},{"id":"W4406215708","doi":"10.46298/dmtcs.6848","title":"Colourings of $(m, n)$-coloured mixed graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.01252100145226509,"score_gpt":0.29307219231010706,"score_spread":0.28055119085784197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406215708","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26308972,0.0028612365,0.29409343,0.029947584,0.004425982,0.00024276445,0.0015587274,0.0020684272,0.40171215],"genre_scores_gemma":[0.8670392,0.0015543434,0.0741039,0.0069314656,0.0006238048,0.00023931224,0.0004823144,0.00035600012,0.04866964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939036,0.00012634548,0.00003442711,0.00017585349,0.00017829075,0.00009469158],"domain_scores_gemma":[0.99749666,0.001232098,0.0002536412,0.00043181877,0.00040474194,0.00018093463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007593582,0.00028914184,0.0002471874,0.0006743142,0.0015726598,0.0013597575,0.000988596,0.0009463383,0.013506431],"category_scores_gemma":[0.0048279436,0.00027611683,0.0005077953,0.0007973801,0.0022479948,0.0037507282,0.0012729646,0.0013423017,0.00135054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018087412,0.0000103043585,0.0017817101,0.00019173912,0.000019809979,0.00036468406,0.00094222307,0.0022630526,0.005054316,0.9266075,0.028353151,0.03423066],"study_design_scores_gemma":[0.000043896824,0.000043759766,0.002873589,0.00011043946,0.00003007932,0.0010126012,0.0009296764,0.0047308463,0.006256854,0.8276648,0.15625867,0.000044732526],"about_ca_topic_score_codex":0.0033389805,"about_ca_topic_score_gemma":0.0046760067,"teacher_disagreement_score":0.013506431,"about_ca_system_score_codex":0.0011861806,"about_ca_system_score_gemma":0.00043449315,"threshold_uncertainty_score":0.04518354},"labels":[],"label_agreement":null},{"id":"W4406372334","doi":"10.46298/dmtcs.13438","title":"Eulerian $k$-dominating reconfiguration graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; Mount Allison University; Universities Space Research Association","keywords":"Eulerian path; Combinatorics; Mathematics; Vertex (graph theory); Dominating set; Graph; Discrete mathematics; Lagrangian; Mathematical analysis","score_opus":0.01472033709827064,"score_gpt":0.30093745814633094,"score_spread":0.2862171210480603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406372334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47068676,0.002806459,0.23358758,0.012828961,0.0008936899,0.0002860008,0.003960858,0.0010499335,0.27389976],"genre_scores_gemma":[0.9279672,0.0020538047,0.040428992,0.002150547,0.00015326109,0.00014087412,0.0020594476,0.00014987237,0.024895944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952316,0.000058316728,0.000030116948,0.00015051683,0.00011155728,0.00012631106],"domain_scores_gemma":[0.9983816,0.00072854647,0.00020268721,0.00023416396,0.00028411282,0.00016886817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004191937,0.00037649178,0.00034093618,0.00064814155,0.0008089295,0.0010856036,0.00069098384,0.0005535943,0.007659395],"category_scores_gemma":[0.002865455,0.0002997952,0.00033460697,0.0008622474,0.0011550032,0.0022220216,0.00072071265,0.00086874346,0.0010628444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004360028,0.00005531008,0.0040497105,0.0005046702,0.0000363111,0.00093658635,0.0004923161,0.036329463,0.024388755,0.8457276,0.03478413,0.052259084],"study_design_scores_gemma":[0.0000813472,0.000110739,0.007876457,0.0001663582,0.000043572545,0.0024916846,0.001014522,0.06513295,0.033402227,0.70949525,0.18010502,0.00007991192],"about_ca_topic_score_codex":0.0017592316,"about_ca_topic_score_gemma":0.003990826,"teacher_disagreement_score":0.007659395,"about_ca_system_score_codex":0.0014404998,"about_ca_system_score_gemma":0.00086543127,"threshold_uncertainty_score":0.025623262},"labels":[],"label_agreement":null},{"id":"W4406651655","doi":"10.1007/978-3-031-75409-8_7","title":"Improved Outerplanarity Bounds for Planar Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Waterloo","funders":"","keywords":"Computer science; Planar; Planar graph; Theoretical computer science; Graph; Computer graphics (images)","score_opus":0.018720267353283707,"score_gpt":0.2899366867150379,"score_spread":0.2712164193617542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406651655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094774365,0.018434104,0.48350194,0.009339508,0.002490507,0.00034860987,0.0038041938,0.0061769304,0.38112974],"genre_scores_gemma":[0.5581472,0.019169997,0.27730653,0.0036842732,0.0050169877,0.00096450164,0.007516387,0.0072101215,0.12098402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951786,0.00079985,0.0001565701,0.000958394,0.0018527341,0.0010539088],"domain_scores_gemma":[0.9781035,0.015082173,0.0007430271,0.0035288637,0.0016060487,0.0009363841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003347145,0.005018423,0.0030047728,0.0056587923,0.0026663812,0.006432959,0.008439867,0.0024816191,0.036203038],"category_scores_gemma":[0.020907756,0.0020695885,0.0029428196,0.0069715264,0.00409657,0.018735977,0.010919407,0.014400481,0.009545847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002290601,0.0007195474,0.002154493,0.0021873445,0.0002545698,0.00040204593,0.0012709048,0.083520405,0.02195762,0.5109736,0.10012785,0.27414104],"study_design_scores_gemma":[0.0001635328,0.00026236172,0.002111505,0.00035292798,0.0004005524,0.00029918874,0.0003243044,0.11916657,0.012296753,0.81696147,0.04753982,0.00012098964],"about_ca_topic_score_codex":0.0035977727,"about_ca_topic_score_gemma":0.005708351,"teacher_disagreement_score":0.036203038,"about_ca_system_score_codex":0.004761351,"about_ca_system_score_gemma":0.0014858433,"threshold_uncertainty_score":0.121111214},"labels":[],"label_agreement":null},{"id":"W4406655767","doi":"10.1016/b978-044488002-4/50007-5","title":"10.1016/b978-044488002-4/50007-5","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"History; Computer science","score_opus":0.014118273479009562,"score_gpt":0.216969121848539,"score_spread":0.20285084836952944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406655767","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024450422,0.00041917697,0.0010147364,0.0003119316,0.00017137112,0.00004243825,0.0008776407,0.00092844677,0.99598986],"genre_scores_gemma":[0.00047369013,0.0002107485,0.00035083757,0.00009165238,0.000033351807,0.000025459833,0.0004515515,0.00023804647,0.99812466],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948406,0.000031986638,0.000034298202,0.00017242148,0.0001809707,0.000096173884],"domain_scores_gemma":[0.9982108,0.0005425808,0.00012169111,0.0002997565,0.00034886439,0.000476303],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008122308,0.00217606,0.001429145,0.0023335945,0.0014976114,0.005385602,0.0030042988,0.004368158,0.97806895],"category_scores_gemma":[0.0015717676,0.0010092715,0.0009435729,0.0031525553,0.001378828,0.0054239607,0.0031010527,0.002290236,0.9884051],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012340672,0.00010641744,0.00040295513,0.0004439417,0.00001781393,0.000119782046,0.00007963407,0.00036688903,0.0022339628,0.008552379,0.42234537,0.5652075],"study_design_scores_gemma":[0.000014695719,0.000037259768,0.00044697121,0.00020238716,0.000006748008,0.00014517579,0.00006620012,0.00016415984,0.00039572633,0.0011022616,0.99740773,0.000010662679],"about_ca_topic_score_codex":0.0032943694,"about_ca_topic_score_gemma":0.003439099,"teacher_disagreement_score":0.021931052,"about_ca_system_score_codex":0.0010756339,"about_ca_system_score_gemma":0.0009075531,"threshold_uncertainty_score":0.03128189},"labels":[],"label_agreement":null},{"id":"W4406655784","doi":"10.1016/b978-044488002-4/50011-7","title":"10.1016/b978-044488002-4/50011-7","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.01465901170541322,"score_gpt":0.21668001104560536,"score_spread":0.20202099934019213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406655784","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024271074,0.00040518394,0.0009960724,0.00033200294,0.00016695222,0.00004257982,0.0008649605,0.0009368235,0.9960128],"genre_scores_gemma":[0.00046932627,0.00020534226,0.00032320493,0.00009558933,0.000034665092,0.000025100906,0.00043514653,0.00023917272,0.9981725],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994636,0.000032449247,0.00003600378,0.00017636304,0.00019218733,0.00009941001],"domain_scores_gemma":[0.99815696,0.00055610517,0.0001345894,0.00030522628,0.00036397323,0.00048308325],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00083227217,0.0022038552,0.0014444765,0.0023638357,0.0015192847,0.005604416,0.0029543443,0.0043548415,0.97770953],"category_scores_gemma":[0.001674672,0.0010286601,0.0009440868,0.0031296173,0.0013938859,0.005610095,0.0032790333,0.002282853,0.9881846],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011537969,0.00010781906,0.0004196165,0.00042216814,0.00001755009,0.000121755926,0.00008059611,0.0003738965,0.0021881252,0.008521771,0.44095564,0.54667574],"study_design_scores_gemma":[0.000014103646,0.000037350692,0.00046624712,0.00020925888,0.000006754032,0.00014803793,0.00007064289,0.00016257529,0.00039752212,0.0011395012,0.9973369,0.000011082353],"about_ca_topic_score_codex":0.0032823181,"about_ca_topic_score_gemma":0.003508883,"teacher_disagreement_score":0.022290468,"about_ca_system_score_codex":0.0011069087,"about_ca_system_score_gemma":0.00092667795,"threshold_uncertainty_score":0.031794548},"labels":[],"label_agreement":null},{"id":"W4406943783","doi":"10.1016/j.tcs.2025.115091","title":"A subquadratic certification scheme for P5-free graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Certification; Scheme (mathematics); Mathematics; Programming language; Computer science; Discrete mathematics; Combinatorics; Calculus (dental); Medicine; Economics; Management","score_opus":0.021426337706722795,"score_gpt":0.31762652775782085,"score_spread":0.29620019005109804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406943783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1724101,0.0006829909,0.7897788,0.0020318073,0.00022990612,0.00063349697,0.001201932,0.010744606,0.02228638],"genre_scores_gemma":[0.81479263,0.00026864972,0.17439412,0.00050094276,0.00012538847,0.00039300928,0.0010057938,0.0005397185,0.007979645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953766,0.00076088443,0.00022356492,0.0013091146,0.0013084975,0.0010213716],"domain_scores_gemma":[0.97998476,0.0071553555,0.0014232573,0.008842466,0.0012522169,0.0013418698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036946447,0.00094291597,0.0015334185,0.0010692659,0.0023452444,0.0037749577,0.004188667,0.0019592629,0.013703844],"category_scores_gemma":[0.013450086,0.00073370116,0.0013676266,0.0018681171,0.0027511287,0.009525621,0.007888618,0.004182502,0.0027800987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051588686,0.0006793552,0.004335065,0.0013560947,0.00016514535,0.0006502749,0.0010668958,0.13504289,0.06352559,0.48275396,0.025091339,0.28017458],"study_design_scores_gemma":[0.0006591,0.000784451,0.0022590607,0.00016430057,0.00022768047,0.00079190155,0.00022878672,0.5114767,0.03572397,0.42598125,0.021493593,0.00020916133],"about_ca_topic_score_codex":0.0024498785,"about_ca_topic_score_gemma":0.0024929815,"teacher_disagreement_score":0.013703844,"about_ca_system_score_codex":0.0033603755,"about_ca_system_score_gemma":0.004163875,"threshold_uncertainty_score":0.04584396},"labels":[],"label_agreement":null},{"id":"W4407134763","doi":"10.1016/j.laa.2025.01.044","title":"Subdivision and graph eigenvalues","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; European Commission","keywords":"Mathematics; Subdivision; Eigenvalues and eigenvectors; Combinatorics; Graph; Geography","score_opus":0.013491166718671309,"score_gpt":0.303899687886157,"score_spread":0.2904085211674857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407134763","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91433656,0.00058705924,0.072765686,0.00051043154,0.000067906505,0.0000146886705,0.000030902807,0.0002522287,0.011434537],"genre_scores_gemma":[0.99186033,0.00013636738,0.006739441,0.00005283583,0.000026934964,0.000014561536,0.000029423305,0.000054139316,0.0010860637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996226,0.00009277401,0.00001177893,0.00008600108,0.00011179353,0.000075092496],"domain_scores_gemma":[0.9970962,0.0015372111,0.00039734505,0.00046343874,0.00020240192,0.00030336555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070081133,0.0002651097,0.0004922215,0.00097259023,0.0007455233,0.00092050654,0.0007936932,0.0007160164,0.0027021759],"category_scores_gemma":[0.009348769,0.00028980145,0.00040084048,0.00036286082,0.0025639054,0.0023395857,0.0011283896,0.001108988,0.00026496465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039590555,0.00016686082,0.00904837,0.00016550625,0.000052040275,0.0006089535,0.001623423,0.08180604,0.06414208,0.80907625,0.0015280523,0.031386495],"study_design_scores_gemma":[0.00004178018,0.00013346216,0.008158227,0.00005373949,0.000021167954,0.0005083809,0.00055773515,0.27876854,0.009482428,0.6995757,0.0026477163,0.000051166327],"about_ca_topic_score_codex":0.00084298605,"about_ca_topic_score_gemma":0.0007034018,"teacher_disagreement_score":0.0027021759,"about_ca_system_score_codex":0.00068186125,"about_ca_system_score_gemma":0.00022164769,"threshold_uncertainty_score":0.0090397},"labels":[],"label_agreement":null},{"id":"W4407258471","doi":"10.1137/23m1615218","title":"Group Connectivity in 3-Edge-Connected Signed Graphs","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Signed graph; Mathematics; Enhanced Data Rates for GSM Evolution; Group (periodic table); Discrete mathematics; Connectivity; Graph; Computer science; Telecommunications","score_opus":0.017141712302540874,"score_gpt":0.3026721765592732,"score_spread":0.28553046425673234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407258471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8709638,0.00022833428,0.104153454,0.00080483593,0.00009987857,0.00010922091,0.00045003282,0.00031689412,0.022873506],"genre_scores_gemma":[0.9776404,0.00026274723,0.016088186,0.00019385818,0.00006194934,0.00011705375,0.00051369437,0.0000736901,0.005048299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994752,0.00013747724,0.000034050725,0.00012454264,0.00013774731,0.00009101963],"domain_scores_gemma":[0.9964126,0.0015782841,0.00091241737,0.00026022448,0.00039642843,0.0004402281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000367691,0.0004780575,0.0006188759,0.0017003306,0.0013203111,0.0023742702,0.0011113527,0.0015159601,0.008966867],"category_scores_gemma":[0.003987018,0.00040186048,0.00044219953,0.0015617835,0.0016225027,0.003067831,0.0013930472,0.0011613783,0.0007707069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007078898,0.0002660808,0.0053183693,0.00041084885,0.00006086211,0.00145956,0.0023044203,0.022805285,0.019867912,0.88178515,0.005576096,0.059437603],"study_design_scores_gemma":[0.00011269385,0.000114842136,0.002200992,0.000058534315,0.000040530416,0.00047971198,0.0008443093,0.051726554,0.0042978497,0.93541867,0.004671046,0.000034386925],"about_ca_topic_score_codex":0.00087874255,"about_ca_topic_score_gemma":0.00095018535,"teacher_disagreement_score":0.008966867,"about_ca_system_score_codex":0.0004916234,"about_ca_system_score_gemma":0.00042940388,"threshold_uncertainty_score":0.02999717},"labels":[],"label_agreement":null},{"id":"W4407352089","doi":"10.1017/fms.2024.68","title":"An efficient asymmetric removal lemma and its limitations","year":2025,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lemma (botany); Mathematics; Pure mathematics; Biology","score_opus":0.03500129368280316,"score_gpt":0.3117944297006516,"score_spread":0.27679313601784844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407352089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06388613,0.0018524076,0.786972,0.013170453,0.0013376065,0.00044232962,0.0015669897,0.0029569932,0.12781522],"genre_scores_gemma":[0.6508062,0.002142361,0.2907985,0.0052857907,0.0022413167,0.0009498259,0.002561454,0.0019991093,0.043215416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902913,0.0020942953,0.0005924998,0.002162086,0.0036051183,0.0012547286],"domain_scores_gemma":[0.95825815,0.018003551,0.0010802633,0.017640945,0.003959496,0.0010576362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005349938,0.0012774671,0.0019400397,0.0021688454,0.0028412815,0.0037521557,0.0063012736,0.002190862,0.016322594],"category_scores_gemma":[0.023371419,0.0013576896,0.0030098339,0.002406422,0.0058062524,0.014922119,0.010710039,0.008825913,0.00738632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040039036,0.00016135661,0.0012766203,0.00038015755,0.00005674331,0.00027842724,0.00029635485,0.006439644,0.010890071,0.9042522,0.01964623,0.055921823],"study_design_scores_gemma":[0.00015091979,0.00013267258,0.0008073368,0.00010507533,0.000107336244,0.0007846745,0.00018685225,0.07814371,0.02319071,0.8280157,0.06827111,0.000103859384],"about_ca_topic_score_codex":0.0016829803,"about_ca_topic_score_gemma":0.0010961645,"teacher_disagreement_score":0.016322594,"about_ca_system_score_codex":0.0022740532,"about_ca_system_score_gemma":0.0022570353,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4407532593","doi":"10.5802/igt.6","title":"Induced subgraphs and tree decompositions XII. Grid theorem for pinched graphs","year":2025,"lang":"en","type":"article","venue":"Innovations in Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Combinatorics; Grid; Mathematics; Tree (set theory); Discrete mathematics; Geometry","score_opus":0.022705901374081027,"score_gpt":0.3215805210370834,"score_spread":0.2988746196630024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407532593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26877445,0.0025962014,0.63923264,0.0017992816,0.00025639625,0.00025941833,0.0027198787,0.0017090696,0.0826526],"genre_scores_gemma":[0.8046446,0.0020704847,0.15569453,0.00081736955,0.00020014375,0.00032717083,0.0054825405,0.00043276054,0.03033035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992236,0.00011955067,0.000049115977,0.00023401284,0.00021936935,0.00015433384],"domain_scores_gemma":[0.9985043,0.0005783378,0.00027675848,0.00030953388,0.00017955924,0.0001515323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055567134,0.00054384954,0.0005847171,0.0017336946,0.001047928,0.002394731,0.0010492946,0.00069711695,0.008302223],"category_scores_gemma":[0.0025156587,0.00069719274,0.0012933237,0.0021230187,0.0013783198,0.003538071,0.002086696,0.0015488215,0.0015679462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013573772,0.00006539685,0.0019232399,0.0002157375,0.000051336698,0.00041982208,0.00045533202,0.015147346,0.0039612805,0.9232997,0.0096172355,0.044707883],"study_design_scores_gemma":[0.000035616857,0.000036223486,0.0014259467,0.000057802823,0.000032683587,0.0003994413,0.00026192603,0.037026465,0.0020312183,0.94403434,0.01464001,0.000018348157],"about_ca_topic_score_codex":0.0037605928,"about_ca_topic_score_gemma":0.0034618226,"teacher_disagreement_score":0.008302223,"about_ca_system_score_codex":0.0013010919,"about_ca_system_score_gemma":0.0005351739,"threshold_uncertainty_score":0.027773678},"labels":[],"label_agreement":null},{"id":"W4407952367","doi":"10.2140/involve.2025.18.261","title":"Every graph with maximum degree at most fouris (11,219)-packing edge-colorable and (12,217)-packing edge-colorable","year":2025,"lang":"en","type":"article","venue":"Involve a Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; Degree (music); Computer science; Artificial intelligence; Physics","score_opus":0.03833087084889889,"score_gpt":0.27829352487017445,"score_spread":0.23996265402127556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407952367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8579757,0.00046810452,0.065718554,0.0038625547,0.00057727384,0.00025679846,0.0039515346,0.0009347258,0.06625465],"genre_scores_gemma":[0.8856788,0.00068633317,0.0748424,0.00077579136,0.00014173325,0.00023451714,0.0069342023,0.00028960494,0.030416558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906665,0.00009959633,0.000040037405,0.00020486477,0.00017989303,0.0004090332],"domain_scores_gemma":[0.99763596,0.0005439263,0.00044396849,0.00047408804,0.000294964,0.0006071496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005179896,0.0019704988,0.0010812007,0.0008751733,0.0028907903,0.0024716435,0.0017355722,0.0014639414,0.01681881],"category_scores_gemma":[0.001813785,0.0011105827,0.0011878732,0.0018644264,0.001684734,0.0034069503,0.0019173666,0.002263553,0.0014400396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051568584,0.0020831956,0.019715603,0.0022334117,0.00057672703,0.0042173066,0.0026232994,0.033196133,0.121862754,0.47784525,0.093557596,0.23693186],"study_design_scores_gemma":[0.00068670243,0.0008073654,0.021820502,0.00023015143,0.0004007215,0.0037233639,0.0020282276,0.04059879,0.067053616,0.7959856,0.066476226,0.00018880375],"about_ca_topic_score_codex":0.0021951005,"about_ca_topic_score_gemma":0.0033579264,"teacher_disagreement_score":0.01681881,"about_ca_system_score_codex":0.0012097118,"about_ca_system_score_gemma":0.0011662112,"threshold_uncertainty_score":0.05626458},"labels":[],"label_agreement":null},{"id":"W4407955310","doi":"10.1016/j.ejc.2025.104139","title":"Injective edge colorings of degenerate graphs and the oriented chromatic number","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Chromatic scale; Combinatorics; Injective function; Degenerate energy levels; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Physics","score_opus":0.008913040825824276,"score_gpt":0.25554163910575695,"score_spread":0.24662859827993266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407955310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.891688,0.0005018017,0.079546176,0.00035009108,0.000039758746,0.000034363926,0.00028927188,0.0002631094,0.02728743],"genre_scores_gemma":[0.98214173,0.00030472587,0.014422565,0.00011645347,0.000034542034,0.0000343789,0.00028430292,0.00007451543,0.0025868372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951875,0.00007847885,0.000021804017,0.000121222576,0.0001015678,0.00015828146],"domain_scores_gemma":[0.99696225,0.00151862,0.00046486678,0.00048756428,0.00020352071,0.0003632806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004653958,0.0003944156,0.00029860713,0.0013696416,0.0008104626,0.0012854541,0.0007874577,0.0003290137,0.0027761648],"category_scores_gemma":[0.003074991,0.00033180302,0.0004705276,0.0009622176,0.0020605656,0.001982114,0.0014602329,0.0010175843,0.00021444175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006964251,0.00026197138,0.041220315,0.00027627213,0.00008546962,0.00048474927,0.0013244114,0.08336797,0.039645962,0.75611496,0.004444832,0.07207662],"study_design_scores_gemma":[0.00007048327,0.0001476254,0.020990632,0.00008206888,0.00008809719,0.0009050568,0.0006352418,0.19909503,0.019621154,0.74627656,0.012009612,0.000078551515],"about_ca_topic_score_codex":0.0025405118,"about_ca_topic_score_gemma":0.0028938393,"teacher_disagreement_score":0.0027761648,"about_ca_system_score_codex":0.001493554,"about_ca_system_score_gemma":0.00059480837,"threshold_uncertainty_score":0.010836601},"labels":[],"label_agreement":null},{"id":"W4408128244","doi":"10.1007/978-981-96-1090-7_41","title":"Approximately Covering Vertices by Order-5 or Longer Paths","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Order (exchange); Algorithm","score_opus":0.020373389558708023,"score_gpt":0.28294204550124963,"score_spread":0.2625686559425416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408128244","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56849325,0.0018638653,0.3183661,0.0008952669,0.00035232003,0.00015195366,0.0022011332,0.0018005483,0.10587552],"genre_scores_gemma":[0.83737636,0.001003482,0.1227581,0.000482073,0.00012858768,0.00011722252,0.002262446,0.0005734627,0.035298187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994886,0.000084995285,0.000017431626,0.00014251133,0.00012253522,0.00014395102],"domain_scores_gemma":[0.9981534,0.0009354863,0.00015364103,0.000555633,0.000078594916,0.00012321821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027358157,0.000499929,0.0006722468,0.00053701835,0.0006048353,0.001385672,0.0011217261,0.0010263391,0.017939115],"category_scores_gemma":[0.002676947,0.0004580659,0.0008004797,0.0012136399,0.0005929128,0.0025850073,0.0013695993,0.0012809718,0.0022309942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016711802,0.00022358533,0.005281296,0.0010570004,0.00016942839,0.0007755684,0.00076371327,0.13658826,0.053483058,0.424638,0.030310685,0.34503832],"study_design_scores_gemma":[0.00013135502,0.00033259927,0.0041809957,0.00014690075,0.00013008853,0.0015404262,0.0006199055,0.19876322,0.023973277,0.725909,0.044229284,0.000042902084],"about_ca_topic_score_codex":0.0011454702,"about_ca_topic_score_gemma":0.0019085675,"teacher_disagreement_score":0.017939115,"about_ca_system_score_codex":0.0008807174,"about_ca_system_score_gemma":0.00041971132,"threshold_uncertainty_score":0.06001234},"labels":[],"label_agreement":null},{"id":"W4408140300","doi":"10.1016/j.tcs.2025.115160","title":"On 1-planar graphs with bounded cop-number","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Planar graph; Mathematics; Combinatorics; Planar; Discrete mathematics; 1-planar graph; Outerplanar graph; Pathwidth; Chordal graph; Graph; Computer science; Line graph; Mathematical analysis","score_opus":0.008572124148925313,"score_gpt":0.28842919260586986,"score_spread":0.2798570684569445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408140300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5566273,0.0034929342,0.3442279,0.0052800463,0.00023293211,0.00026053732,0.0024933086,0.0008882361,0.08649683],"genre_scores_gemma":[0.9003902,0.0044521624,0.06931291,0.0009849217,0.0005261421,0.00041386392,0.0028813537,0.0005549552,0.020483492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983485,0.00042099066,0.000058929574,0.00046152677,0.00032348582,0.00038666461],"domain_scores_gemma":[0.9899949,0.006306078,0.0015583234,0.00068430457,0.0005277588,0.0009286243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008070063,0.0020250336,0.0019639463,0.002627843,0.002295163,0.0034107035,0.002079359,0.0023222256,0.008253999],"category_scores_gemma":[0.008866628,0.0010259427,0.0015236514,0.0025639983,0.0037798998,0.007290326,0.003273045,0.003318981,0.0017403342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048428736,0.00015547904,0.0026458385,0.00049473846,0.00008435483,0.0009926655,0.0008555553,0.13557187,0.005801235,0.81887347,0.010294179,0.023746198],"study_design_scores_gemma":[0.000091588,0.00009643271,0.0011406983,0.00011325356,0.000053556814,0.00060846156,0.00025956854,0.1564032,0.001775469,0.8298399,0.009552745,0.00006512294],"about_ca_topic_score_codex":0.0036650423,"about_ca_topic_score_gemma":0.0028810962,"teacher_disagreement_score":0.008253999,"about_ca_system_score_codex":0.0034400013,"about_ca_system_score_gemma":0.00088258326,"threshold_uncertainty_score":0.027612329},"labels":[],"label_agreement":null},{"id":"W4408225562","doi":"10.1016/j.dam.2025.02.024","title":"An introduction to the deduction number","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Calculus (dental); Combinatorics; Arithmetic","score_opus":0.011608572319302658,"score_gpt":0.3122440572055866,"score_spread":0.30063548488628394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408225562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012131765,0.019203205,0.6882651,0.010264443,0.0031269125,0.00022677021,0.0010141303,0.0011364205,0.26463118],"genre_scores_gemma":[0.41562247,0.026822716,0.48245084,0.008419461,0.010935706,0.0013480376,0.0016000055,0.0018189095,0.05098183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99216753,0.0021419863,0.00053034135,0.0022088666,0.0021731597,0.0007780488],"domain_scores_gemma":[0.96574646,0.028712723,0.0009037012,0.0019323964,0.0019593167,0.00074536295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005825961,0.0024091217,0.0023222575,0.004720627,0.0033211445,0.007497686,0.0040925103,0.0036246255,0.017252719],"category_scores_gemma":[0.025434716,0.0016326832,0.0033354498,0.0060386863,0.00988208,0.022700729,0.005134321,0.014326118,0.006334643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003624184,0.00003072504,0.00025368304,0.0001768389,0.000012344737,0.0000747826,0.00017760265,0.0019973402,0.0003514987,0.9748005,0.0075469506,0.014541447],"study_design_scores_gemma":[0.000010535605,0.000028664126,0.00015398409,0.000067790716,0.00001871716,0.00016292169,0.000029528343,0.0061336337,0.0003966041,0.96349406,0.029476834,0.000026687652],"about_ca_topic_score_codex":0.0016864946,"about_ca_topic_score_gemma":0.0010725285,"teacher_disagreement_score":0.017252719,"about_ca_system_score_codex":0.0053322483,"about_ca_system_score_gemma":0.0017971847,"threshold_uncertainty_score":0.05771607},"labels":[],"label_agreement":null},{"id":"W4408310889","doi":"10.1007/s13398-025-01715-2","title":"Covering a space with a small number of countably tight subspaces","year":2025,"lang":"es","type":"article","venue":"Revista de la Real Academia de Ciencias Exactas Físicas y Naturales Serie A Matemáticas","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Linear subspace; Space (punctuation); Mathematics; Combinatorics; Pure mathematics; Computer science","score_opus":0.011861935661993697,"score_gpt":0.3129017105011057,"score_spread":0.30103977483911204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408310889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5848145,0.0015268546,0.37948802,0.0018150047,0.0002754117,0.0001445188,0.0013702151,0.00074176723,0.029823655],"genre_scores_gemma":[0.89185387,0.000798355,0.09258807,0.0004179582,0.00023781856,0.000346174,0.0018228645,0.00030931932,0.011625594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625,0.001121415,0.00026449005,0.00085404096,0.00082558696,0.00068443856],"domain_scores_gemma":[0.9882969,0.006286812,0.0009148204,0.0022924207,0.0007141652,0.0014948695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014885298,0.0015905193,0.0024584315,0.002354776,0.0027403827,0.004862009,0.0027014716,0.0022311946,0.012342016],"category_scores_gemma":[0.01356037,0.0013477261,0.0019155025,0.0031024741,0.003279435,0.010847062,0.0070579983,0.004712094,0.0012428955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016314099,0.00041270614,0.0061779977,0.00090490683,0.0003230509,0.0006224033,0.0010253058,0.070892185,0.020624917,0.836565,0.009052866,0.05176727],"study_design_scores_gemma":[0.00016137403,0.00033793095,0.0025429209,0.00010378768,0.000121464196,0.001141922,0.00082955946,0.1705886,0.0063450644,0.80831176,0.00944074,0.000074758165],"about_ca_topic_score_codex":0.00076271384,"about_ca_topic_score_gemma":0.000779049,"teacher_disagreement_score":0.012342016,"about_ca_system_score_codex":0.001070695,"about_ca_system_score_gemma":0.0008099639,"threshold_uncertainty_score":0.041288137},"labels":[],"label_agreement":null},{"id":"W4408397455","doi":"10.1007/s00373-025-02901-0","title":"Veto Interval Graphs and Variations","year":2025,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Mathematical Sciences","keywords":"Mathematics; Combinatorics; Interval (graph theory); Veto; Discrete mathematics; Interval graph; Indifference graph; Chordal graph; Graph; 1-planar graph","score_opus":0.01242007600694425,"score_gpt":0.27290333408641954,"score_spread":0.2604832580794753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408397455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33121789,0.0035893915,0.32942143,0.004012038,0.00071939355,0.000092149305,0.0009405857,0.0008149897,0.32919207],"genre_scores_gemma":[0.9401887,0.00113271,0.02374783,0.000697558,0.00054437376,0.00007273921,0.0004370884,0.00029282836,0.032886133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992717,0.00018050004,0.00002518178,0.0001966205,0.0002091121,0.000116958545],"domain_scores_gemma":[0.99738926,0.0013691309,0.0003449043,0.00035304273,0.00025326604,0.00029044523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006698814,0.00039900307,0.00076032564,0.0018469442,0.0016531739,0.0029166166,0.0014229104,0.001110924,0.01279088],"category_scores_gemma":[0.005823879,0.00043310542,0.0006392322,0.0028122144,0.002875701,0.004281051,0.0020427357,0.002922826,0.0010309234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002205456,0.000007490775,0.00012431163,0.000012802971,0.0000029462647,0.000026965954,0.00007766271,0.0010564879,0.00016247033,0.99204916,0.001104041,0.005353566],"study_design_scores_gemma":[0.0000068229733,0.000005618433,0.00013046149,0.000007978172,0.0000041330572,0.00005826447,0.000050298346,0.0031103974,0.00010111015,0.99300826,0.00351194,0.000004894562],"about_ca_topic_score_codex":0.0012769141,"about_ca_topic_score_gemma":0.000948142,"teacher_disagreement_score":0.01279088,"about_ca_system_score_codex":0.0012085359,"about_ca_system_score_gemma":0.00035634486,"threshold_uncertainty_score":0.042789757},"labels":[],"label_agreement":null},{"id":"W4408462275","doi":"10.4153/s0008439525000281","title":"Bridging colorings of virtual links from virtual biquandles to biquandles","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bridging (networking); Computer science","score_opus":0.015082052390838254,"score_gpt":0.26430660656537636,"score_spread":0.2492245541745381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408462275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48526892,0.0004629633,0.40690017,0.0007760433,0.0010184251,0.00010110409,0.00013211809,0.00093326974,0.10440707],"genre_scores_gemma":[0.91261613,0.00023129524,0.06287566,0.00030443404,0.00016428341,0.00011492841,0.00011023072,0.00023612226,0.023346955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992642,0.00019309024,0.00004980257,0.00015873359,0.00019041964,0.00014367873],"domain_scores_gemma":[0.9987925,0.0002987553,0.00018015763,0.00029995147,0.00020386091,0.00022473834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008743393,0.00045164395,0.00042984376,0.0016045856,0.0018106385,0.0022500213,0.0007317791,0.00086533884,0.011576828],"category_scores_gemma":[0.0017338003,0.00028488084,0.0005157583,0.0006503369,0.002383516,0.0032654635,0.002332023,0.0017383852,0.001189796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040186405,0.000036631514,0.0001545174,0.000029375891,0.0000031116597,0.000076796605,0.00023021884,0.0011194026,0.0042822473,0.9846607,0.00082258205,0.008544255],"study_design_scores_gemma":[0.000022074104,0.000078593745,0.00034046936,0.000035951627,0.00000972747,0.00023824329,0.00020888193,0.013995,0.0059696874,0.96017784,0.018894795,0.00002873813],"about_ca_topic_score_codex":0.00040205306,"about_ca_topic_score_gemma":0.0005302143,"teacher_disagreement_score":0.011576828,"about_ca_system_score_codex":0.00085158873,"about_ca_system_score_gemma":0.00041735836,"threshold_uncertainty_score":0.038728356},"labels":[],"label_agreement":null},{"id":"W4408492470","doi":"10.37236/13018","title":"A Note on the Invertibility of Oriented Graphs","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Computer science","score_opus":0.010311144251661103,"score_gpt":0.28411038253773035,"score_spread":0.2737992382860692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408492470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21061036,0.005014405,0.39720553,0.0085189575,0.0019676443,0.00018169166,0.0006342524,0.0009997637,0.37486738],"genre_scores_gemma":[0.8386104,0.006957514,0.1201149,0.0036363392,0.0021434736,0.0002248996,0.0009480247,0.0006855868,0.026678784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984427,0.0003168145,0.00009172451,0.00037017124,0.000516341,0.000262212],"domain_scores_gemma":[0.99182254,0.0057456004,0.0003773291,0.0011501051,0.0005168927,0.0003875546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014036782,0.0008545605,0.0007127903,0.0012572076,0.0013201652,0.001611293,0.0015243043,0.0008544075,0.0086530335],"category_scores_gemma":[0.007301378,0.00057235727,0.0010493806,0.0012756579,0.005507986,0.0064354492,0.0038660201,0.006757556,0.001116406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072424504,0.0000649458,0.0010461687,0.000153507,0.000012572296,0.00043045255,0.0008643244,0.0020819474,0.005399723,0.94938755,0.0058762147,0.034610182],"study_design_scores_gemma":[0.000022397357,0.00008903257,0.0009687879,0.000040700084,0.000024449633,0.00055094657,0.00031347715,0.004593712,0.004297122,0.9547704,0.03429721,0.000031726107],"about_ca_topic_score_codex":0.0017453325,"about_ca_topic_score_gemma":0.0013906262,"teacher_disagreement_score":0.0086530335,"about_ca_system_score_codex":0.0009123451,"about_ca_system_score_gemma":0.00063125486,"threshold_uncertainty_score":0.028947294},"labels":[],"label_agreement":null},{"id":"W4408731436","doi":"10.61091/um122-06","title":"Dominator colorings of \\(n\\)-inordinate invariant intersection graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Combinatorics; Intersection (aeronautics); Discrete mathematics; Geography; Cartography","score_opus":0.015360826354190924,"score_gpt":0.291601772188336,"score_spread":0.27624094583414505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84569144,0.00011008666,0.09664621,0.00009838467,0.000037917576,0.000042732252,0.00019166266,0.00021954607,0.05696212],"genre_scores_gemma":[0.9823142,0.00009893426,0.013422903,0.000028303974,0.000013249976,0.00003392369,0.00024517404,0.00005052335,0.0037927625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959534,0.00007565068,0.00002006456,0.000085832406,0.000099085286,0.00012399122],"domain_scores_gemma":[0.9992316,0.00021589657,0.00013319062,0.0001636769,0.00015565653,0.00010002515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029695057,0.00022489789,0.00025863445,0.001193257,0.0011395089,0.0011104377,0.0006845656,0.0002757656,0.0035070647],"category_scores_gemma":[0.00096592563,0.00015944906,0.00041913477,0.0008539956,0.0011603406,0.0011312417,0.0007899029,0.0005452714,0.00024818393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014883892,0.00005032873,0.0034324145,0.000064697066,0.000016865104,0.00034043164,0.000630028,0.004220329,0.014638991,0.94912887,0.0007537724,0.026574306],"study_design_scores_gemma":[0.000054262382,0.00014188065,0.008616936,0.000050881295,0.00007043724,0.0011297847,0.0013260364,0.062395334,0.03978559,0.8671098,0.019242348,0.00007669633],"about_ca_topic_score_codex":0.0010001485,"about_ca_topic_score_gemma":0.0012407753,"teacher_disagreement_score":0.0035070647,"about_ca_system_score_codex":0.00061073696,"about_ca_system_score_gemma":0.0004473084,"threshold_uncertainty_score":0.01173234},"labels":[],"label_agreement":null},{"id":"W4408731651","doi":"10.61091/um122-02","title":"On 1-11-representability and multi-1-11-representability of graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.030053615606383734,"score_gpt":0.3417294456927507,"score_spread":0.31167583008636696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22668374,0.0034398423,0.66430056,0.0061258315,0.0007503124,0.00017782976,0.0016758258,0.0014732577,0.0953728],"genre_scores_gemma":[0.8403752,0.0036348994,0.12784761,0.0024236129,0.001117837,0.0003248246,0.0020121278,0.0007618313,0.021502113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767977,0.0005723253,0.000113516464,0.00078918773,0.00040468035,0.0004405509],"domain_scores_gemma":[0.98848814,0.007778795,0.0010478612,0.0012695856,0.00085314835,0.0005625447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015047386,0.0015926893,0.0010615285,0.0016575507,0.002300051,0.0029589534,0.0019499209,0.0019467477,0.0116061],"category_scores_gemma":[0.010681068,0.00069898897,0.0019810533,0.0025807826,0.005083345,0.010319062,0.003411631,0.005949884,0.002932306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015072721,0.0000933389,0.0006638398,0.00023311116,0.000029861907,0.00036427478,0.00077944074,0.009441304,0.0041136206,0.9557736,0.0044068275,0.023950186],"study_design_scores_gemma":[0.00002310556,0.00007195463,0.00027462395,0.000059163092,0.000026825855,0.00025408834,0.00014234889,0.011393842,0.0016894703,0.97440636,0.011623663,0.000034565055],"about_ca_topic_score_codex":0.0016162498,"about_ca_topic_score_gemma":0.0013382075,"teacher_disagreement_score":0.0116061,"about_ca_system_score_codex":0.0021841626,"about_ca_system_score_gemma":0.0008166638,"threshold_uncertainty_score":0.038826287},"labels":[],"label_agreement":null},{"id":"W4408736815","doi":"10.61091/ars162-07","title":"On total coloring of 1-planar graphs without 4-cycles","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Total coloring; Planar graph; Combinatorics; Edge coloring; Planar; Graph; Computer science; Graph power; Computer graphics (images); Line graph","score_opus":0.013061476965901698,"score_gpt":0.2873518288260597,"score_spread":0.274290351860158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7536205,0.0016772621,0.17013574,0.0026171543,0.00037143324,0.00013670581,0.0013781409,0.001058397,0.06900475],"genre_scores_gemma":[0.9561351,0.0015477256,0.031174574,0.0009204241,0.00025926792,0.00009030283,0.0017014828,0.00028872193,0.007882287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991265,0.0002262209,0.000033380886,0.0002389483,0.00016453763,0.00021056508],"domain_scores_gemma":[0.99303377,0.003979126,0.00071330596,0.0011337165,0.00072379515,0.00041630823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008813294,0.00092378503,0.0006617088,0.0011279817,0.0014099195,0.0018981817,0.0013043886,0.0007844877,0.0066641443],"category_scores_gemma":[0.004591093,0.00055611884,0.0009252346,0.0018625886,0.0017700781,0.0034795399,0.0015050676,0.0013360478,0.00080616656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009755805,0.00025448238,0.010740293,0.0010670491,0.00018098827,0.0010878587,0.0014767656,0.08213664,0.019557852,0.78068703,0.024797568,0.077037916],"study_design_scores_gemma":[0.0001441947,0.00016512103,0.002986311,0.00012699982,0.00012001876,0.00078420294,0.0008075753,0.07741661,0.0077443393,0.8945036,0.015137685,0.00006340826],"about_ca_topic_score_codex":0.0029058687,"about_ca_topic_score_gemma":0.0034814319,"teacher_disagreement_score":0.0066641443,"about_ca_system_score_codex":0.001038451,"about_ca_system_score_gemma":0.0006107361,"threshold_uncertainty_score":0.022293806},"labels":[],"label_agreement":null},{"id":"W4408841349","doi":"10.1017/fms.2025.22","title":"Tree-like graphings, wallings, and median graphings of equivalence relations","year":2025,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Equivalence (formal languages); Tree (set theory); Combinatorics; Pure mathematics","score_opus":0.012800867163832417,"score_gpt":0.27316420019931176,"score_spread":0.2603633330354793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408841349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75834215,0.00031734764,0.21367906,0.000405382,0.000054025553,0.00003453542,0.00019652944,0.00022263078,0.026748294],"genre_scores_gemma":[0.9794367,0.0001253445,0.016357353,0.00006858566,0.00003720799,0.000026844878,0.0002004163,0.00004797242,0.003699504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994267,0.000106729036,0.000027965887,0.00018339472,0.00015976458,0.00009536685],"domain_scores_gemma":[0.998544,0.00058303145,0.00024911974,0.00024904162,0.00015710318,0.00021768537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000493482,0.00022222707,0.0003929913,0.0009926041,0.0008822704,0.0016008219,0.000548336,0.00061927736,0.0054432903],"category_scores_gemma":[0.0023406458,0.0002653965,0.0006029977,0.00061576144,0.0026633232,0.0037990515,0.0016712196,0.0011595638,0.0003370129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022475502,0.000015107956,0.0008299572,0.00002526516,0.0000063959646,0.00011864327,0.00028416753,0.0015740299,0.0027317908,0.9898829,0.00026017087,0.0042491923],"study_design_scores_gemma":[0.000008925586,0.000039485516,0.0015849726,0.0000152009425,0.000010612291,0.00023710771,0.00035286043,0.010411454,0.003575194,0.97979385,0.003958583,0.000011850343],"about_ca_topic_score_codex":0.0007263788,"about_ca_topic_score_gemma":0.00088060164,"teacher_disagreement_score":0.0054432903,"about_ca_system_score_codex":0.0005730232,"about_ca_system_score_gemma":0.00020286815,"threshold_uncertainty_score":0.018209696},"labels":[],"label_agreement":null},{"id":"W4408892500","doi":"10.61091/jcmcc125-15","title":"The number of total dominating sets in binary trees","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Binary number; Mathematics; Combinatorics; Arithmetic","score_opus":0.01208407633317526,"score_gpt":0.30680075736877366,"score_spread":0.2947166810355984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408892500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85302764,0.0033744357,0.12267387,0.0007808513,0.00009770779,0.00009126696,0.0019372848,0.0001470813,0.017869815],"genre_scores_gemma":[0.95947474,0.0014224561,0.03494587,0.00011910748,0.00008659157,0.00011045938,0.001100774,0.00005417026,0.0026858866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887437,0.00025247774,0.00008055195,0.00024316028,0.0003164429,0.00023298991],"domain_scores_gemma":[0.9936406,0.0046910364,0.0005141577,0.00021722233,0.0004284202,0.00050845847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010237538,0.00056207716,0.0009840848,0.0020660511,0.0010186353,0.00218709,0.0010629598,0.0007894626,0.0015980981],"category_scores_gemma":[0.0067506013,0.0005046444,0.00046506585,0.0014819192,0.0008752175,0.0020857607,0.00089502276,0.0005980571,0.0002173906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002252006,0.00039618698,0.028029025,0.0026494293,0.0005257141,0.00078014773,0.0014511099,0.3008709,0.09594353,0.41883123,0.011532493,0.1367383],"study_design_scores_gemma":[0.0001427745,0.00042220837,0.016965982,0.00027347024,0.00019873292,0.0025137854,0.00058156,0.52184606,0.03209576,0.41051006,0.014349327,0.00010020402],"about_ca_topic_score_codex":0.0004708336,"about_ca_topic_score_gemma":0.0007714009,"teacher_disagreement_score":0.00218709,"about_ca_system_score_codex":0.0012544421,"about_ca_system_score_gemma":0.00042430783,"threshold_uncertainty_score":0.009101629},"labels":[],"label_agreement":null},{"id":"W4408892509","doi":"10.61091/jcmcc125-05","title":"The vertex-edge locating Roman domination of some graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Graph; Artificial intelligence","score_opus":0.011720877262077364,"score_gpt":0.2826358369886785,"score_spread":0.2709149597266011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408892509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5374692,0.0014634036,0.39152575,0.0005823374,0.00013904784,0.00011774611,0.00052987895,0.00038037918,0.067792185],"genre_scores_gemma":[0.9448811,0.0006714932,0.045589022,0.00018538866,0.00011255151,0.000084407315,0.00038978644,0.000078822115,0.0080074845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990054,0.00024671463,0.00006030552,0.00022421418,0.0002658666,0.00019767179],"domain_scores_gemma":[0.99854666,0.0005502071,0.00022477862,0.00017062576,0.00026790824,0.00023973081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008756442,0.00065917656,0.00059266645,0.0019806582,0.0014239067,0.0018684115,0.00077635364,0.00047530624,0.0019836295],"category_scores_gemma":[0.0031269793,0.0002649308,0.00067353126,0.0016324003,0.0017353625,0.0026687891,0.0012752921,0.0007085682,0.00027557663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024323502,0.000050668594,0.004517729,0.00025789737,0.00006512886,0.0005352132,0.0007311135,0.023454363,0.011925435,0.89192355,0.0026792826,0.06361633],"study_design_scores_gemma":[0.000051889292,0.00016628628,0.0041945297,0.00008461978,0.00012159443,0.00198393,0.0005658483,0.19812083,0.011193213,0.7456527,0.037770707,0.00009393043],"about_ca_topic_score_codex":0.0013537935,"about_ca_topic_score_gemma":0.0010972003,"teacher_disagreement_score":0.0019836295,"about_ca_system_score_codex":0.0013390406,"about_ca_system_score_gemma":0.00052472885,"threshold_uncertainty_score":0.009715438},"labels":[],"label_agreement":null},{"id":"W4408961034","doi":"10.1016/j.comgeo.2025.102192","title":"Bounds on the edge-length ratio of 2-outerplanar graphs","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Ministero dell'Università e della Ricerca; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Outerplanar graph; Pathwidth; Computer science; Graph; Telecommunications; Line graph","score_opus":0.017873185146532328,"score_gpt":0.29802974953785755,"score_spread":0.2801565643913252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408961034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5128923,0.010766759,0.3676659,0.0035901421,0.00018980209,0.0001232436,0.0019561502,0.0032458105,0.09956983],"genre_scores_gemma":[0.93177426,0.0038638741,0.055353615,0.0005593199,0.00029120507,0.00018714422,0.0010540973,0.0009610359,0.005955406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728155,0.00052771124,0.000102200764,0.000805353,0.00074306666,0.000540054],"domain_scores_gemma":[0.98521763,0.010812987,0.0012727459,0.0013868554,0.00063899986,0.00067065994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015041585,0.0020276604,0.0013551256,0.002696997,0.0013008873,0.0025244926,0.0034878186,0.0011307714,0.0091541475],"category_scores_gemma":[0.013033677,0.0007191778,0.0009922453,0.0024242764,0.0025333778,0.0070345276,0.0035263363,0.003506563,0.001856184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030498337,0.00048712664,0.016119203,0.002134419,0.00048571205,0.0015853406,0.0016992114,0.20817532,0.11912159,0.43599308,0.017965313,0.19318396],"study_design_scores_gemma":[0.00013521397,0.0005707847,0.012759163,0.00030402173,0.00046145066,0.0030172989,0.000686981,0.26056057,0.07590081,0.615734,0.029661516,0.00020821467],"about_ca_topic_score_codex":0.00072130666,"about_ca_topic_score_gemma":0.00096496625,"teacher_disagreement_score":0.0091541475,"about_ca_system_score_codex":0.0020025508,"about_ca_system_score_gemma":0.00044570354,"threshold_uncertainty_score":0.030623674},"labels":[],"label_agreement":null},{"id":"W4409158217","doi":"10.1016/j.dam.2025.03.023","title":"Preprocessing complexity for some graph problems parameterized by structural parameters","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Mathematics; Preprocessor; Graph; Computational complexity theory; Combinatorics; Algorithm; Theoretical computer science; Computer science; Artificial intelligence","score_opus":0.04015370730956459,"score_gpt":0.32062872376984347,"score_spread":0.2804750164602789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409158217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3991144,0.0030131661,0.49703264,0.032350164,0.00071242574,0.001340974,0.01035634,0.008874683,0.047205195],"genre_scores_gemma":[0.69352275,0.0015068817,0.26900163,0.0025746133,0.0010960666,0.0012545905,0.011878922,0.004035668,0.0151288975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99146444,0.0023577544,0.00048565766,0.0026628198,0.0013771218,0.0016521615],"domain_scores_gemma":[0.8968291,0.08436543,0.004388505,0.010381515,0.0020542005,0.001981275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064473725,0.003136168,0.0039124517,0.0024294043,0.0038549055,0.008715647,0.008539691,0.007039609,0.023839246],"category_scores_gemma":[0.053961996,0.0022576668,0.005275598,0.00622702,0.004260581,0.022423968,0.0038263137,0.011912429,0.0027746682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0078917295,0.003578623,0.008142054,0.002995897,0.00063710334,0.0010043605,0.0015768941,0.47321653,0.021388164,0.2441169,0.08449445,0.1509574],"study_design_scores_gemma":[0.0009137736,0.00025909254,0.0020632963,0.00008396772,0.00031411613,0.00039208576,0.00045042112,0.52259415,0.0055708345,0.46378332,0.0034888347,0.0000861418],"about_ca_topic_score_codex":0.005933696,"about_ca_topic_score_gemma":0.008964879,"teacher_disagreement_score":0.023839246,"about_ca_system_score_codex":0.007836864,"about_ca_system_score_gemma":0.0071007875,"threshold_uncertainty_score":0.07975018},"labels":[],"label_agreement":null},{"id":"W4409252201","doi":"10.1016/j.tcs.2025.115234","title":"Vertex-critical graphs in co-gem-free graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Chordal graph; Mathematics; Graph; Computer science; Discrete mathematics","score_opus":0.01258889013089405,"score_gpt":0.3244643890253385,"score_spread":0.31187549889444444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409252201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8990735,0.00038237864,0.09095636,0.0003424405,0.000024141938,0.00007503318,0.00050374004,0.00038572328,0.0082567325],"genre_scores_gemma":[0.9798023,0.00011359261,0.017411498,0.000081618884,0.000019242401,0.000050544084,0.0004902039,0.000042637505,0.001988329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993729,0.00007166211,0.000040348437,0.00022375122,0.00011894403,0.00017242318],"domain_scores_gemma":[0.994616,0.0033012545,0.00068722863,0.00057346164,0.00034694417,0.00047522195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055040093,0.00040110192,0.00041687302,0.0013630353,0.0011169161,0.001736469,0.0007705898,0.00056468416,0.002903304],"category_scores_gemma":[0.0034392755,0.00051090424,0.00060230674,0.00086144183,0.0022381193,0.0024071387,0.0017210748,0.0010965243,0.00020167588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013490714,0.00026299772,0.038163833,0.0009658404,0.00012494868,0.0013841623,0.0034684858,0.06313503,0.08074953,0.73871124,0.0043027536,0.06738214],"study_design_scores_gemma":[0.00014552461,0.000221017,0.0129946545,0.00010804379,0.00013840839,0.0017156828,0.0013196288,0.089529954,0.065890126,0.8110271,0.016817333,0.0000924858],"about_ca_topic_score_codex":0.0022450436,"about_ca_topic_score_gemma":0.0028282998,"teacher_disagreement_score":0.002903304,"about_ca_system_score_codex":0.0012900328,"about_ca_system_score_gemma":0.0007186154,"threshold_uncertainty_score":0.009712577},"labels":[],"label_agreement":null},{"id":"W4409898124","doi":"10.1142/s0129054125500054","title":"Efficiently Enumerating Spanning Trees of <i>k</i> -Trees","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Bangladesh University of Engineering and Technology","keywords":"Spanning tree; Combinatorics; Mathematics; Minimum degree spanning tree; Weight-balanced tree; Tree (set theory); Discrete mathematics; Trémaux tree; Graph; Binary tree; Binary search tree; Line graph; Pathwidth","score_opus":0.017781280910574723,"score_gpt":0.3485295082599452,"score_spread":0.3307482273493705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409898124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33078223,0.0017630766,0.6385591,0.0011292415,0.00016011998,0.000366671,0.0030307192,0.0068054227,0.017403428],"genre_scores_gemma":[0.43471536,0.0005059478,0.5536853,0.00021055301,0.00003980552,0.00016607888,0.005802292,0.00059139676,0.0042832573],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939346,0.000113377064,0.00007284136,0.0001377174,0.00014640382,0.00013618969],"domain_scores_gemma":[0.9982931,0.00082712667,0.00024730523,0.00024135718,0.00026362613,0.0001275214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042811516,0.0006513921,0.0008163144,0.0010557717,0.0007709607,0.0011249862,0.0010822064,0.00078278536,0.0033369865],"category_scores_gemma":[0.003776188,0.00047185805,0.00076814287,0.0018080677,0.00044653667,0.0032262327,0.0012151471,0.0006554633,0.0013558728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008497285,0.00036791,0.01345081,0.0019559462,0.0002219654,0.0010914486,0.0010873117,0.16562048,0.05931531,0.06751179,0.044524904,0.64400244],"study_design_scores_gemma":[0.00014396099,0.00026737456,0.003361895,0.00015273559,0.00012642847,0.0013547693,0.00071471947,0.75638896,0.031120649,0.18800381,0.018299319,0.000065381944],"about_ca_topic_score_codex":0.0020256331,"about_ca_topic_score_gemma":0.0042133485,"teacher_disagreement_score":0.0033369865,"about_ca_system_score_codex":0.0006853503,"about_ca_system_score_gemma":0.0013827118,"threshold_uncertainty_score":0.011163354},"labels":[],"label_agreement":null},{"id":"W4410061426","doi":"10.1007/978-981-96-4448-3_11","title":"Broadcasting and Three List Subtraction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Subtraction; Telecommunications; Computer network; Arithmetic; Mathematics","score_opus":0.023856134428355102,"score_gpt":0.2866058865756826,"score_spread":0.2627497521473275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410061426","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044915818,0.0029298817,0.20930716,0.003613971,0.0019057315,0.00012642347,0.0007125492,0.00327281,0.73321563],"genre_scores_gemma":[0.4103079,0.0025644237,0.11838403,0.001301352,0.00061465864,0.00016894274,0.0014346861,0.001787236,0.46343678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993856,0.00011676301,0.00003170313,0.00011433668,0.00020945749,0.0001421889],"domain_scores_gemma":[0.99899906,0.00040425186,0.000044103985,0.0003047395,0.00017414975,0.00007383345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045924945,0.00080335943,0.00081157126,0.0013410891,0.0026827175,0.0026263103,0.0014559319,0.0009884307,0.038731135],"category_scores_gemma":[0.0024395986,0.000480755,0.0007755059,0.0029331062,0.0016922631,0.0048819366,0.0020782424,0.0025426464,0.010062362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010546012,0.000042491658,0.00007441831,0.00008210776,0.0000074859167,0.00009103464,0.00023140691,0.0008143512,0.002508036,0.912229,0.016221292,0.06759289],"study_design_scores_gemma":[0.000029992916,0.00002414814,0.00011936418,0.000032509008,0.000023676577,0.0002257726,0.00013165896,0.0040141107,0.005500766,0.91071326,0.07915618,0.000028603943],"about_ca_topic_score_codex":0.0020691592,"about_ca_topic_score_gemma":0.0024784482,"teacher_disagreement_score":0.038731135,"about_ca_system_score_codex":0.0016813067,"about_ca_system_score_gemma":0.0011076723,"threshold_uncertainty_score":0.12956852},"labels":[],"label_agreement":null},{"id":"W4410156455","doi":"10.1145/3734525","title":"A \\(\\boldsymbol{O}(\\textbf{log}\\,\\boldsymbol{k})\\) -Approximation for <scp>Directed Steiner Tree</scp> in Planar Graphs","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Planar; Binary logarithm; Approximation algorithm; Planar graph; Discrete mathematics; Tree (set theory); Computer science; Graph","score_opus":0.02066447745728899,"score_gpt":0.29402476052985693,"score_spread":0.27336028307256793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410156455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097707786,0.0044365847,0.7645888,0.0078909295,0.0012841264,0.0009220461,0.006857684,0.03930213,0.07700987],"genre_scores_gemma":[0.21519123,0.0015412256,0.73964524,0.0016149704,0.00047670666,0.0007432985,0.009395416,0.0040478026,0.027344162],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973218,0.00036334645,0.00015575929,0.00054483465,0.0008742427,0.0007401318],"domain_scores_gemma":[0.9942638,0.0023289826,0.0004602403,0.0020476682,0.0004664446,0.0004328723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016784407,0.0039371345,0.002714966,0.0023602713,0.0015520606,0.0044564344,0.006857381,0.0035313964,0.042448502],"category_scores_gemma":[0.008815062,0.0012130042,0.0032028775,0.005720306,0.0013861682,0.011441167,0.0051474017,0.004946887,0.017864518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031777357,0.0018245496,0.0021044312,0.0019922378,0.00039213666,0.00049855013,0.00052175357,0.14325456,0.028045325,0.041264974,0.17892814,0.5979956],"study_design_scores_gemma":[0.0007774174,0.000500588,0.0014013646,0.0002578318,0.00029254588,0.001085058,0.0004149978,0.86055684,0.017848091,0.0857252,0.031038936,0.000101081765],"about_ca_topic_score_codex":0.009516758,"about_ca_topic_score_gemma":0.017365776,"teacher_disagreement_score":0.042448502,"about_ca_system_score_codex":0.005414257,"about_ca_system_score_gemma":0.004808922,"threshold_uncertainty_score":0.14200437},"labels":[],"label_agreement":null},{"id":"W4410338800","doi":"10.37236/12822","title":"Grid Minors and Products","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Grid; Computer science; Geology; Geodesy","score_opus":0.006239289094987502,"score_gpt":0.256904653646761,"score_spread":0.2506653645517735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410338800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66894937,0.0014602161,0.28732416,0.0006805147,0.00014370149,0.000101369806,0.0006247831,0.00060599676,0.04010992],"genre_scores_gemma":[0.9342486,0.000951808,0.05058305,0.00022335688,0.00017154017,0.0001005803,0.0009300867,0.000396213,0.012394877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991628,0.00015238505,0.00005212055,0.00031936023,0.00017123065,0.00014204296],"domain_scores_gemma":[0.9953432,0.0019467334,0.0008548421,0.00080838165,0.0004871171,0.0005598247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006727227,0.00062431704,0.0006751048,0.0009777835,0.0011740739,0.0021404885,0.0010277516,0.0005892863,0.008605893],"category_scores_gemma":[0.005117258,0.000657366,0.0007945684,0.0013127051,0.0025741311,0.0053436486,0.002437551,0.0013661679,0.0011664635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022695167,0.00006457311,0.004381177,0.00017341034,0.000035979243,0.0004945318,0.001175331,0.0072984053,0.007039102,0.9466459,0.0042651584,0.028199485],"study_design_scores_gemma":[0.00004414407,0.00017124711,0.002485348,0.00003675692,0.000047828995,0.0018991254,0.00054760673,0.026687894,0.0045333793,0.94324225,0.020270696,0.000033659733],"about_ca_topic_score_codex":0.001434058,"about_ca_topic_score_gemma":0.0011783869,"teacher_disagreement_score":0.008605893,"about_ca_system_score_codex":0.0007043184,"about_ca_system_score_gemma":0.00039097003,"threshold_uncertainty_score":0.02878958},"labels":[],"label_agreement":null},{"id":"W4410371193","doi":"10.1016/j.ejc.2025.104174","title":"Sparsity of 3-flow-critical graphs","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Mathematics; Combinatorics; Flow (mathematics); Discrete mathematics; Geometry","score_opus":0.017855904037367868,"score_gpt":0.28922014670176716,"score_spread":0.2713642426643993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410371193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8454016,0.0004378811,0.11007111,0.0018904337,0.00014357083,0.00010540191,0.0017593561,0.00039408493,0.039796636],"genre_scores_gemma":[0.9739987,0.00032857875,0.014965933,0.00038138928,0.0002625591,0.00011539591,0.00198011,0.00017307489,0.0077942107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948394,0.00013371739,0.00002257286,0.00011423196,0.00013688474,0.000108603905],"domain_scores_gemma":[0.9926675,0.0040766075,0.0010902572,0.0005051397,0.0008122753,0.00084831176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056583516,0.0005262518,0.0008245616,0.002336408,0.00095379166,0.0019467692,0.001217441,0.0010249711,0.010149072],"category_scores_gemma":[0.007197944,0.00056901557,0.00044196396,0.0012582889,0.0014960641,0.0025306419,0.0011030503,0.0015963498,0.0007551123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041971606,0.00016394643,0.0054310923,0.0003015025,0.000046399287,0.0004939188,0.0006710582,0.01381581,0.008836808,0.93474215,0.013029114,0.022048539],"study_design_scores_gemma":[0.000053507076,0.000037100686,0.0020858312,0.000041217932,0.000018894967,0.00034190115,0.00020882425,0.04412466,0.0016375546,0.9481803,0.0032519116,0.000018241848],"about_ca_topic_score_codex":0.001168448,"about_ca_topic_score_gemma":0.0015373087,"teacher_disagreement_score":0.010149072,"about_ca_system_score_codex":0.00068402436,"about_ca_system_score_gemma":0.0005740665,"threshold_uncertainty_score":0.033951998},"labels":[],"label_agreement":null},{"id":"W4410455285","doi":"10.1007/978-3-031-92935-9_1","title":"Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bipartite graph; Regular polygon; Computer science; Combinatorics; Set (abstract data type); Mathematics; Graph; Geometry","score_opus":0.02357357690253381,"score_gpt":0.28097834642607944,"score_spread":0.25740476952354563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410455285","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12535836,0.0039034265,0.48569903,0.006846155,0.000897023,0.0002955826,0.002342781,0.00048840756,0.37416917],"genre_scores_gemma":[0.5884516,0.0047777006,0.23666337,0.0009452462,0.0012155533,0.0008277428,0.0040717954,0.0007590422,0.16228792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991571,0.00029989704,0.00003078299,0.00015544586,0.0002156679,0.00014117983],"domain_scores_gemma":[0.9978307,0.0015030475,0.00014821578,0.00017493074,0.00013910724,0.00020400088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010845264,0.0010514746,0.0014125442,0.0010020474,0.0023534365,0.0039445395,0.003028837,0.0021561834,0.022202436],"category_scores_gemma":[0.0054776147,0.0009089694,0.0013829225,0.002647816,0.0020007647,0.0056176465,0.002635563,0.0044881864,0.0019352031],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091775444,0.000057690766,0.00010177447,0.00016546037,0.000020906627,0.000050988594,0.0001244255,0.023594545,0.000428054,0.92582196,0.023845697,0.025696717],"study_design_scores_gemma":[0.000032375672,0.000020432406,0.00016319592,0.00003432308,0.00001045765,0.000051731346,0.0001333503,0.050023217,0.00028964144,0.9401598,0.009066588,0.000014859464],"about_ca_topic_score_codex":0.003070555,"about_ca_topic_score_gemma":0.0037772397,"teacher_disagreement_score":0.022202436,"about_ca_system_score_codex":0.0021237158,"about_ca_system_score_gemma":0.0011043025,"threshold_uncertainty_score":0.07427454},"labels":[],"label_agreement":null},{"id":"W4410590705","doi":"10.37236/13669","title":"Frozen Colourings in $2K_2$-free graphs","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics","score_opus":0.0058383278427437645,"score_gpt":0.2613319210123492,"score_spread":0.25549359316960546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410590705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79905474,0.0011670783,0.13913727,0.0012938415,0.00026873781,0.00026488458,0.002339899,0.0011760367,0.055297613],"genre_scores_gemma":[0.94384974,0.0004935425,0.029079186,0.000494714,0.000097943324,0.0002672263,0.0028156384,0.00038167697,0.022520399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988582,0.00016151211,0.000061097,0.000359092,0.00021042243,0.00034964492],"domain_scores_gemma":[0.99806315,0.0005828058,0.0003721656,0.00038468957,0.00022483032,0.000372379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000444172,0.00075966335,0.0008031945,0.0013102932,0.002224992,0.0025866025,0.0015127122,0.0010640246,0.009919218],"category_scores_gemma":[0.001980202,0.000976036,0.0008783148,0.0016972293,0.002837489,0.0032218471,0.002280171,0.0011544087,0.0015911616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071613805,0.00013307176,0.0035323503,0.0004090039,0.00008102043,0.002534436,0.0027557958,0.038955376,0.019051706,0.8660931,0.01455843,0.05117957],"study_design_scores_gemma":[0.00012745532,0.00006631228,0.0025148827,0.00006179028,0.000044542045,0.0009205201,0.0005337458,0.02784753,0.004944314,0.93908197,0.023772545,0.00008439224],"about_ca_topic_score_codex":0.0049058576,"about_ca_topic_score_gemma":0.0051572765,"teacher_disagreement_score":0.009919218,"about_ca_system_score_codex":0.0020286003,"about_ca_system_score_gemma":0.00077267695,"threshold_uncertainty_score":0.033183098},"labels":[],"label_agreement":null},{"id":"W4411004437","doi":"10.1002/jgt.23265","title":"A Dichotomy Theorem for Γ‐Switchable H‐Colouring on m‐Edge‐Coloured Graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Telecommunications","score_opus":0.015777773108179422,"score_gpt":0.3045510545709746,"score_spread":0.2887732814627952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411004437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90767854,0.00017860408,0.07515937,0.002052544,0.00004386969,0.00008502569,0.0005320491,0.00029162838,0.013978378],"genre_scores_gemma":[0.9848625,0.00008609937,0.012337448,0.0002555267,0.00004096283,0.000093055045,0.00041949697,0.000035723,0.0018690553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798703,0.00040087904,0.00012285075,0.00056087953,0.00045934675,0.0004690035],"domain_scores_gemma":[0.9879638,0.009136071,0.0008238823,0.00088144204,0.00042685703,0.00076803064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018487595,0.00032698523,0.0009286268,0.0010169036,0.0016590701,0.0040294817,0.0012162206,0.00174594,0.006676896],"category_scores_gemma":[0.007207812,0.0004916724,0.0011323587,0.0007912785,0.0041631,0.006429979,0.0025917534,0.0031777872,0.00041575986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054629694,0.00022812399,0.0039123725,0.00017935138,0.00005031614,0.00030068372,0.0010368598,0.014815898,0.010606101,0.949911,0.0026521676,0.015760848],"study_design_scores_gemma":[0.000094795076,0.00008007485,0.001255569,0.00001759872,0.000020378147,0.00012940033,0.00024318435,0.04549438,0.0032873848,0.9481878,0.0011611384,0.000028387336],"about_ca_topic_score_codex":0.0010733089,"about_ca_topic_score_gemma":0.0005457677,"teacher_disagreement_score":0.006676896,"about_ca_system_score_codex":0.00261567,"about_ca_system_score_gemma":0.00093023764,"threshold_uncertainty_score":0.022336423},"labels":[],"label_agreement":null},{"id":"W4411149101","doi":"10.1016/j.tcs.2025.115393","title":"Cuts, cats, and complete graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Memorial University of Newfoundland","funders":"Memorial University of Newfoundland","keywords":"Combinatorics; Mathematics; Computer science; Discrete mathematics","score_opus":0.013954405158160247,"score_gpt":0.2940944799975862,"score_spread":0.28014007483942593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411149101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57103163,0.0032583892,0.3423673,0.0015746948,0.00017606447,0.00013077649,0.0004866839,0.00021576806,0.08075874],"genre_scores_gemma":[0.945852,0.0010274005,0.03862028,0.0002724891,0.000101050166,0.00006653959,0.0003159455,0.000054978704,0.013689362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999491,0.0001523126,0.000018975405,0.00009833722,0.00015663417,0.000082769555],"domain_scores_gemma":[0.99886024,0.00050805596,0.00021546794,0.0000855081,0.00011255275,0.00021810764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043939115,0.0004935718,0.0004065832,0.0011413166,0.0006479016,0.0012841743,0.00063810527,0.00083203625,0.0034821401],"category_scores_gemma":[0.0023108951,0.00028787818,0.00033832242,0.0009347305,0.0020949298,0.002438668,0.0009963518,0.0011657287,0.00027740028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037030662,0.000024936484,0.00087467994,0.000045300094,0.000014125102,0.00010241748,0.00020655994,0.013495149,0.0012717958,0.9730877,0.0016402189,0.009200023],"study_design_scores_gemma":[0.000012333918,0.000049856713,0.00089551817,0.000019240748,0.00001062335,0.0001562916,0.00016676408,0.028338486,0.0003343777,0.96363175,0.0063726734,0.000012104393],"about_ca_topic_score_codex":0.0022994317,"about_ca_topic_score_gemma":0.0039974065,"teacher_disagreement_score":0.0034821401,"about_ca_system_score_codex":0.0008521923,"about_ca_system_score_gemma":0.00031453752,"threshold_uncertainty_score":0.011648893},"labels":[],"label_agreement":null},{"id":"W4411279523","doi":"10.1016/j.disc.2025.114644","title":"Hopping forcing number in random d-regular graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Forcing (mathematics); Discrete mathematics; Random graph; Graph; Mathematical analysis","score_opus":0.014393945943673759,"score_gpt":0.3071972158539919,"score_spread":0.29280326991031813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411279523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71022,0.0011309957,0.2579514,0.0013436185,0.000119871256,0.00015121071,0.0005195601,0.00095625134,0.027607052],"genre_scores_gemma":[0.9777951,0.00041801308,0.018837815,0.00014892453,0.000038574613,0.00012596176,0.00019271624,0.000096972035,0.0023459091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929297,0.00021466112,0.00003228266,0.00017114457,0.00013222605,0.0001567276],"domain_scores_gemma":[0.9766757,0.019502431,0.0011567782,0.0010600408,0.00040785555,0.0011973014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019135535,0.0006519933,0.0007845971,0.0019081287,0.0009587996,0.0013548073,0.0016628499,0.0011062588,0.0032966046],"category_scores_gemma":[0.019187244,0.0005254724,0.00058643415,0.0007899672,0.0030592605,0.0022243243,0.0016045697,0.0012500559,0.00039305724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000667585,0.00018562144,0.005665039,0.00040422185,0.00007106018,0.0007464197,0.00043073104,0.39944437,0.0129775945,0.55942315,0.004240362,0.015743917],"study_design_scores_gemma":[0.00006930158,0.000119087104,0.001313057,0.00008502789,0.000027621658,0.00030632422,0.000105945845,0.7676154,0.0032510469,0.22583485,0.0012192519,0.000053241278],"about_ca_topic_score_codex":0.0010874429,"about_ca_topic_score_gemma":0.0014474468,"teacher_disagreement_score":0.0032966046,"about_ca_system_score_codex":0.0018884958,"about_ca_system_score_gemma":0.0009139555,"threshold_uncertainty_score":0.013702095},"labels":[],"label_agreement":null},{"id":"W4411331343","doi":"10.1016/j.laa.2025.06.009","title":"Vertex partitioning and p-energy of graphs","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; European Commission","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Discrete mathematics; Graph","score_opus":0.011410731436133593,"score_gpt":0.2791932171361464,"score_spread":0.26778248570001284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411331343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7066109,0.0018031425,0.24866197,0.0014722707,0.00007914511,0.00004332321,0.00043004972,0.00014780738,0.04075137],"genre_scores_gemma":[0.9791469,0.00043825014,0.015515261,0.00016346923,0.00005675688,0.00005321366,0.00022140179,0.00006014988,0.004344629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994355,0.00013888572,0.00002295831,0.00013085849,0.00014249397,0.00012923434],"domain_scores_gemma":[0.9970067,0.0021127453,0.00028256746,0.00024860317,0.00019683824,0.00015265383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058185845,0.0005459108,0.00043179077,0.0020311484,0.00084737357,0.0013237491,0.00095601054,0.00092098856,0.0033457263],"category_scores_gemma":[0.004344267,0.0003816219,0.00030446638,0.0014067884,0.0018367227,0.0022587767,0.0014485933,0.00096906803,0.00043323424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017082928,0.00008182515,0.004263973,0.000155695,0.00006601185,0.0003301635,0.00036410193,0.082604066,0.011813708,0.86787015,0.003046708,0.029232798],"study_design_scores_gemma":[0.0000110133105,0.000032481803,0.002994071,0.0000370963,0.000012978112,0.00028644226,0.00016342747,0.18899737,0.002564846,0.80331016,0.0015696579,0.000020432806],"about_ca_topic_score_codex":0.00054468913,"about_ca_topic_score_gemma":0.00069480983,"teacher_disagreement_score":0.0033457263,"about_ca_system_score_codex":0.00075676304,"about_ca_system_score_gemma":0.00020008824,"threshold_uncertainty_score":0.01119256},"labels":[],"label_agreement":null},{"id":"W4411405042","doi":"10.1017/9781009158688.011","title":"Points and Lines, Graphs and Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Northern British Columbia","funders":"","keywords":"Computer science","score_opus":0.016413020182926102,"score_gpt":0.217372722140218,"score_spread":0.2009597019572919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411405042","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00534663,0.13414551,0.06439186,0.008333091,0.002278275,0.00006563096,0.0006015989,0.00045671174,0.7843808],"genre_scores_gemma":[0.21772422,0.1693887,0.07947606,0.0044856616,0.0048544975,0.00041039215,0.0017573845,0.00072928687,0.52117383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952745,0.00014323616,0.000019221014,0.000114697825,0.00016380096,0.000031587268],"domain_scores_gemma":[0.9995715,0.00024831668,0.000030943076,0.0000539398,0.00006335866,0.00003186387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003460942,0.00096004637,0.0004619633,0.0020612539,0.00096507336,0.0042048185,0.0007221723,0.0013934307,0.014060507],"category_scores_gemma":[0.0015931922,0.00034427142,0.00031189303,0.00449712,0.0059162853,0.007440424,0.0012318146,0.0016903075,0.0036594586],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004081351,0.0000029399137,0.000050219795,0.000093362185,0.0000029512487,0.000024065497,0.00027232605,0.0006899426,0.00008702884,0.96188414,0.018926604,0.017962297],"study_design_scores_gemma":[0.0000019892075,0.000004003678,0.00013111197,0.00007470998,0.000002304651,0.00006476514,0.00019333014,0.00050364045,0.000039151255,0.7221342,0.27684617,0.000004606764],"about_ca_topic_score_codex":0.003961561,"about_ca_topic_score_gemma":0.0035197039,"teacher_disagreement_score":0.014060507,"about_ca_system_score_codex":0.002337878,"about_ca_system_score_gemma":0.00087788014,"threshold_uncertainty_score":0.047037065},"labels":[],"label_agreement":null},{"id":"W4411599125","doi":"10.61091/jcmcc126-19","title":"On domination polynomials of some graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013241094408873909,"score_gpt":0.2923340008613273,"score_spread":0.27909290645245344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411599125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70542943,0.0014806852,0.27563176,0.0018738725,0.000053730244,0.0000556512,0.0005464783,0.00025514417,0.014673147],"genre_scores_gemma":[0.9912013,0.000558642,0.006399773,0.000077414654,0.00008761612,0.000022797949,0.0001626186,0.000043923246,0.0014458558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991248,0.00026688055,0.000018291556,0.00017907927,0.0001772284,0.00023367973],"domain_scores_gemma":[0.99113804,0.0066273357,0.00076897425,0.0003953085,0.00060298055,0.00046743153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014093026,0.0005587624,0.0006613,0.0020043985,0.0009131561,0.0015674714,0.0010539156,0.0004502467,0.0030773017],"category_scores_gemma":[0.014663999,0.00031681696,0.0005126352,0.0021183235,0.0024453774,0.0024414198,0.0012012154,0.001625289,0.00021527964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002933936,0.0000857013,0.006624403,0.00027693147,0.000049619077,0.0003683198,0.0009963854,0.121128954,0.012296486,0.8273812,0.0035461055,0.026952526],"study_design_scores_gemma":[0.00003819289,0.00007852577,0.0047807177,0.000043142554,0.000023570989,0.00046861873,0.00037145714,0.43699244,0.0023695221,0.5513799,0.0033960312,0.00005794193],"about_ca_topic_score_codex":0.0026580833,"about_ca_topic_score_gemma":0.0015769963,"teacher_disagreement_score":0.0030773017,"about_ca_system_score_codex":0.001582724,"about_ca_system_score_gemma":0.0005768374,"threshold_uncertainty_score":0.01148355},"labels":[],"label_agreement":null},{"id":"W4411673352","doi":"10.1016/j.disc.2025.114648","title":"The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Combinatorics Foundation; National Research Foundation of Korea; Ministry of Education; University of Wyoming; Division of Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Combinatorics; Graph coloring; Discrete mathematics; List coloring; Chordal graph; Graph; Line graph","score_opus":0.03852087644603635,"score_gpt":0.35095695988294967,"score_spread":0.3124360834369133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411673352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019182844,0.00012783874,0.9691924,0.00022639186,0.00012677495,0.00007475507,0.00013336985,0.0006508087,0.010284869],"genre_scores_gemma":[0.26879606,0.000268989,0.7148195,0.00033208742,0.00012414977,0.00021195541,0.000455804,0.0009435125,0.014048006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921906,0.00024775474,0.000031453874,0.00015550088,0.00020194537,0.00014434534],"domain_scores_gemma":[0.99792576,0.0007711544,0.00008851085,0.00074053556,0.0002926927,0.00018141323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014031676,0.00072679744,0.0007101281,0.0013671318,0.0011007001,0.0013167829,0.0020606844,0.00063963473,0.008840534],"category_scores_gemma":[0.0045035244,0.0004913824,0.0010712959,0.0010947698,0.0012228709,0.0021448806,0.0023450337,0.0026556295,0.001418426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063859235,0.00027049475,0.002182826,0.0004550556,0.00007983897,0.00022095769,0.0004633911,0.064128526,0.011180141,0.5273553,0.016841087,0.37618375],"study_design_scores_gemma":[0.00009528875,0.00006768335,0.00045586357,0.0000528539,0.000055343735,0.00016737338,0.00013825348,0.38849142,0.006425505,0.5905599,0.013445846,0.000044757428],"about_ca_topic_score_codex":0.002854955,"about_ca_topic_score_gemma":0.005681469,"teacher_disagreement_score":0.008840534,"about_ca_system_score_codex":0.0008478598,"about_ca_system_score_gemma":0.0018781438,"threshold_uncertainty_score":0.029574513},"labels":[],"label_agreement":null},{"id":"W4411720721","doi":"10.61091/ars163-06","title":"Coloring of graphs with cost-functions whose marginal costs decrease","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Marginal cost; Combinatorics; Microeconomics; Economics","score_opus":0.012082443639475188,"score_gpt":0.2749637507143706,"score_spread":0.26288130707489543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42081317,0.00090734224,0.53806984,0.0023789697,0.00017445085,0.000261862,0.0014078525,0.0009009078,0.035085477],"genre_scores_gemma":[0.8620816,0.00077766634,0.1179753,0.00033036812,0.00014752393,0.00027029307,0.0008070187,0.00053715915,0.017073117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989039,0.0003425305,0.000034457444,0.0002350337,0.0001569064,0.00032714425],"domain_scores_gemma":[0.9928012,0.004350811,0.00077096425,0.00094757,0.00054744055,0.0005820449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016449756,0.0016344835,0.0012011589,0.0009692915,0.000798381,0.0023614538,0.0022422748,0.0013223069,0.010157766],"category_scores_gemma":[0.008405156,0.00059283705,0.0009477142,0.0021730494,0.001303212,0.004191395,0.0008906837,0.0017601136,0.00085773075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008455194,0.0003886877,0.003773304,0.0005039879,0.00013097303,0.00029416342,0.00026351365,0.53736216,0.010896276,0.36783487,0.012422466,0.06528405],"study_design_scores_gemma":[0.000048807713,0.000102140264,0.0013571684,0.00003312747,0.00006276838,0.0001716813,0.0000853378,0.779366,0.003607155,0.21042635,0.0047108447,0.000028549903],"about_ca_topic_score_codex":0.0034518614,"about_ca_topic_score_gemma":0.0042565204,"teacher_disagreement_score":0.010157766,"about_ca_system_score_codex":0.003523705,"about_ca_system_score_gemma":0.0016115743,"threshold_uncertainty_score":0.033981085},"labels":[],"label_agreement":null},{"id":"W4411720742","doi":"10.61091/ars163-03","title":"Eternal distance-2 domination in trees","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.010530093153499303,"score_gpt":0.29029416328090896,"score_spread":0.27976407012740967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5785876,0.0010583742,0.40308362,0.0009541401,0.00006274317,0.000100134785,0.0006514158,0.00022431683,0.015277653],"genre_scores_gemma":[0.9222788,0.0005527443,0.072230995,0.00016102336,0.00006591693,0.00007677641,0.00042452256,0.000058656144,0.0041504917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921954,0.00019532633,0.00004271332,0.00019895096,0.0001503519,0.00019308567],"domain_scores_gemma":[0.9955668,0.0029468352,0.00044875266,0.00044204446,0.00031434977,0.0002811985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078842364,0.00033273685,0.00056210416,0.0008806234,0.0011557643,0.0014399684,0.0010923102,0.00065108977,0.0020913589],"category_scores_gemma":[0.004911708,0.00023208813,0.0006042277,0.0012895744,0.0009734988,0.0028382393,0.0013283133,0.0009149527,0.00025957567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009033441,0.00025228158,0.013125784,0.0005536089,0.00013792262,0.0010094354,0.0016416991,0.31392846,0.0528658,0.5152854,0.007026423,0.09326987],"study_design_scores_gemma":[0.000060421316,0.00016061631,0.0033304114,0.00005331166,0.00005495425,0.0014994886,0.00047958264,0.5689076,0.014106369,0.3955502,0.015752431,0.000044713717],"about_ca_topic_score_codex":0.0009369307,"about_ca_topic_score_gemma":0.0014039429,"teacher_disagreement_score":0.0020913589,"about_ca_system_score_codex":0.0010637682,"about_ca_system_score_gemma":0.00038824594,"threshold_uncertainty_score":0.0077182055},"labels":[],"label_agreement":null},{"id":"W4411973470","doi":"10.1007/s10878-025-01332-0","title":"Algorithms for 2-balanced connected k-partition problem in graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Theory of computation; Partition (number theory); Combinatorics; Computer science; Mathematics; Partition problem; Discrete mathematics; Algorithm","score_opus":0.013535896212277767,"score_gpt":0.3004663665176037,"score_spread":0.286930470305326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411973470","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16684118,0.0012825582,0.7992106,0.0034852624,0.00032585138,0.00090086786,0.0020371657,0.0029872546,0.022929313],"genre_scores_gemma":[0.43549433,0.0006562789,0.545841,0.000843351,0.0002583789,0.00089974597,0.0042893505,0.0010112314,0.010706388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835664,0.00050851615,0.00008143376,0.00043908082,0.00025553876,0.00035875713],"domain_scores_gemma":[0.9948592,0.0033064405,0.00042788213,0.0006356059,0.00035362423,0.00041725853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019645146,0.0023422027,0.002350238,0.0020622362,0.0020064742,0.0048832432,0.0052752877,0.0036369872,0.018890474],"category_scores_gemma":[0.009758943,0.0013345064,0.0014310115,0.003127614,0.0014490831,0.009201216,0.0046385447,0.0029991714,0.0029254563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025997504,0.001344459,0.0034247758,0.0013635788,0.00026708515,0.00022939141,0.0009916236,0.48509982,0.0060697757,0.106094286,0.04627808,0.3462374],"study_design_scores_gemma":[0.00043514336,0.00013036124,0.00047329644,0.000081715414,0.00007309849,0.00011216887,0.00033604432,0.82922506,0.0016828404,0.16414165,0.0032799907,0.000028654404],"about_ca_topic_score_codex":0.0050695785,"about_ca_topic_score_gemma":0.0074490495,"teacher_disagreement_score":0.018890474,"about_ca_system_score_codex":0.002291751,"about_ca_system_score_gemma":0.0027286173,"threshold_uncertainty_score":0.06319493},"labels":[],"label_agreement":null},{"id":"W4412016901","doi":"10.1007/s00493-025-00160-4","title":"Signed graphs with the same even cycles","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011003287367122902,"score_gpt":0.27149403176875814,"score_spread":0.2604907444016352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412016901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53171283,0.00085273,0.21394391,0.0028682984,0.0019320068,0.00028118148,0.0012516498,0.00095065875,0.24620683],"genre_scores_gemma":[0.8978398,0.0007349366,0.0369211,0.0013504925,0.00025276822,0.00024915763,0.0009012776,0.00039391592,0.061356556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992176,0.00018639874,0.000057687048,0.00014725821,0.00021919698,0.00017184093],"domain_scores_gemma":[0.9974228,0.0005995375,0.0003943467,0.0005393679,0.00061349384,0.00043039516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005308735,0.0007871133,0.0005649046,0.0017250279,0.0015397634,0.0034898408,0.00090923015,0.0014479643,0.01593161],"category_scores_gemma":[0.00348902,0.00045643141,0.00068735017,0.0013585187,0.0014569146,0.004297439,0.0017529607,0.0016445912,0.0023929588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001945264,0.00006681567,0.00063881243,0.0001102771,0.000022104608,0.0005285719,0.00022259958,0.0012715358,0.007680946,0.95715535,0.0035419357,0.028566452],"study_design_scores_gemma":[0.000054427215,0.000049261194,0.00050439907,0.000051711715,0.000036475314,0.0004656592,0.00028974705,0.004739902,0.005597837,0.97235626,0.01581714,0.000037216654],"about_ca_topic_score_codex":0.0005722975,"about_ca_topic_score_gemma":0.00089174684,"teacher_disagreement_score":0.01593161,"about_ca_system_score_codex":0.00077346526,"about_ca_system_score_gemma":0.00094543025,"threshold_uncertainty_score":0.053296506},"labels":[],"label_agreement":null},{"id":"W4412042334","doi":"10.1112/blms.70134","title":"Longest cycles in vertex‐transitive and highly connected graphs","year":2025,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Mathematics; Transitive relation; Vertex (graph theory); Combinatorics; Graph","score_opus":0.009607886391988337,"score_gpt":0.2566998037470482,"score_spread":0.24709191735505986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412042334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7030968,0.006623578,0.23223847,0.0026624284,0.00022447099,0.00015808184,0.0014128054,0.000746756,0.052836645],"genre_scores_gemma":[0.96301144,0.001749077,0.03138746,0.00029946215,0.00019949053,0.00006937038,0.0008525048,0.00008026793,0.0023509148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997719,0.0005149401,0.00013921481,0.0005420219,0.000754785,0.0003301252],"domain_scores_gemma":[0.98299974,0.010368513,0.0030235236,0.0015260995,0.0011672324,0.0009148144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011485924,0.0007671768,0.00077255623,0.0032547752,0.001552881,0.0032413863,0.0015428675,0.0010735015,0.004221882],"category_scores_gemma":[0.01024776,0.00071906345,0.00092149375,0.003678874,0.0030484726,0.006010366,0.0031426447,0.0020749953,0.00038874923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005126089,0.00013409376,0.006789909,0.00052350794,0.00017905422,0.0006483322,0.0010822677,0.03793301,0.010358205,0.8930801,0.005660306,0.04309848],"study_design_scores_gemma":[0.00004020181,0.000057325942,0.0021331646,0.00011502913,0.00009601442,0.00038207546,0.00029921258,0.03500998,0.0071653337,0.94182146,0.012841658,0.000038513914],"about_ca_topic_score_codex":0.0024348383,"about_ca_topic_score_gemma":0.002532136,"teacher_disagreement_score":0.004221882,"about_ca_system_score_codex":0.0020064148,"about_ca_system_score_gemma":0.001115052,"threshold_uncertainty_score":0.0145576},"labels":[],"label_agreement":null},{"id":"W4412133525","doi":"10.1002/jgt.23276","title":"Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Chordal graph; Combinatorics; Mathematics; Clique-sum; Partial k-tree; 1-planar graph; Pathwidth; Indifference graph; Bounded function; Discrete mathematics; Graph; Line graph","score_opus":0.014522849603426218,"score_gpt":0.28703737638345067,"score_spread":0.27251452678002447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412133525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8711943,0.0008828997,0.10140166,0.002661651,0.000099880795,0.000032866217,0.00033528238,0.00035806044,0.023033379],"genre_scores_gemma":[0.992702,0.00018566567,0.005737033,0.00019466951,0.000054231165,0.00001462499,0.00013828248,0.000022203742,0.00095134287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994709,0.000100878715,0.000023569015,0.00012266939,0.00014181086,0.00014017423],"domain_scores_gemma":[0.99399817,0.0037806535,0.0007621643,0.00060711167,0.00029622394,0.00055572164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056787074,0.00025057612,0.00034047576,0.0006860273,0.0005857337,0.0013999068,0.0008067941,0.0006126185,0.0031325403],"category_scores_gemma":[0.0042843577,0.00025485063,0.00032316925,0.0006484449,0.0019750078,0.0029795226,0.0016628538,0.001170448,0.00022051761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018388942,0.00011731047,0.007952206,0.00019503002,0.00003605725,0.00041958666,0.00065575924,0.016030299,0.0062255226,0.9458094,0.0041149035,0.018260008],"study_design_scores_gemma":[0.000034853623,0.00003480934,0.0024494936,0.000029969493,0.000016745773,0.00022392567,0.00034305546,0.03247229,0.0023581772,0.9573006,0.004718471,0.000017601698],"about_ca_topic_score_codex":0.0014931728,"about_ca_topic_score_gemma":0.0016396537,"teacher_disagreement_score":0.0031325403,"about_ca_system_score_codex":0.00073263806,"about_ca_system_score_gemma":0.00038973388,"threshold_uncertainty_score":0.01047945},"labels":[],"label_agreement":null},{"id":"W4412402110","doi":"10.55016/ojs/cdm.v10i2.62217","title":"A theorem on fractional ID - ( g , f ) - factor-critical graphs","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; National Social Science Fund of China; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Discrete mathematics; Factor (programming language); Computer science","score_opus":0.023433605097989585,"score_gpt":0.3495409181538872,"score_spread":0.32610731305589763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5046173,0.0023629332,0.3611383,0.0026299509,0.0004431305,0.0001921851,0.0014122725,0.001056867,0.12614706],"genre_scores_gemma":[0.92789215,0.0009721289,0.05698908,0.00083251327,0.0003211258,0.00012699288,0.00094298733,0.00018840388,0.01173461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996623,0.00003498111,0.000015180319,0.00013053218,0.000064062566,0.00009294524],"domain_scores_gemma":[0.9982925,0.00093550823,0.00015183602,0.0001764301,0.00021377217,0.0002299437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048022237,0.0006222447,0.00050994114,0.0013446446,0.0018816199,0.0012437524,0.0007764457,0.00067842903,0.0075932574],"category_scores_gemma":[0.0031163841,0.0003366768,0.00083433907,0.0008081802,0.002139741,0.0026433002,0.0014185376,0.0011906481,0.00068300584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018168995,0.000045158104,0.0018036003,0.00017720643,0.000024796549,0.00026225153,0.0005533774,0.0052902033,0.0063397973,0.957543,0.0070791985,0.020699779],"study_design_scores_gemma":[0.000080718164,0.000117594995,0.0014948294,0.00007867985,0.00007209713,0.00093629357,0.00049025094,0.023924468,0.0074288407,0.93413717,0.031187681,0.00005141839],"about_ca_topic_score_codex":0.002767367,"about_ca_topic_score_gemma":0.0022112045,"teacher_disagreement_score":0.0075932574,"about_ca_system_score_codex":0.0012707883,"about_ca_system_score_gemma":0.0006333834,"threshold_uncertainty_score":0.02540195},"labels":[],"label_agreement":null},{"id":"W4412435997","doi":"10.55016/ojs/cdm.v11i2.62553","title":"Fully Indecomposable and Nearly Decomposable Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Research in Fundamental Sciences; School of Mathematics, Institute for Research in Fundamental Sciences; Sharif University of Technology","keywords":"Combinatorics; Mathematics; Indecomposable module; Cograph; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.018580713753969132,"score_gpt":0.3376772356103748,"score_spread":0.3190965218564057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76696503,0.0003782319,0.19550502,0.00053574546,0.00005451125,0.00007100487,0.0013076962,0.0004473596,0.034735482],"genre_scores_gemma":[0.9631385,0.000260981,0.02866589,0.00016914698,0.00006879656,0.000062414045,0.0012897855,0.00006192945,0.006282557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995302,0.00007333012,0.000027200542,0.00016772246,0.000102469014,0.00009913979],"domain_scores_gemma":[0.99816656,0.00068340625,0.0003377874,0.00031376592,0.00019253303,0.00030585282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028687075,0.00048341387,0.00025810214,0.0006681523,0.00044376953,0.00066706236,0.000656779,0.0004874787,0.004406344],"category_scores_gemma":[0.0018825603,0.0003441123,0.00033050985,0.0005670654,0.0009024424,0.001559244,0.000880103,0.0009279113,0.00048706259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000491211,0.00023650477,0.005680252,0.00026772372,0.00009227523,0.0045326105,0.0009380172,0.036971644,0.07231393,0.7985704,0.006516572,0.07338895],"study_design_scores_gemma":[0.000031726842,0.00010804654,0.0032186033,0.000025656107,0.00002453749,0.0021909608,0.0002885495,0.061691705,0.009988104,0.91551477,0.0068837935,0.000033627453],"about_ca_topic_score_codex":0.00033568582,"about_ca_topic_score_gemma":0.0003920926,"teacher_disagreement_score":0.004406344,"about_ca_system_score_codex":0.00023546495,"about_ca_system_score_gemma":0.00021820294,"threshold_uncertainty_score":0.014740646},"labels":[],"label_agreement":null},{"id":"W4412558656","doi":"10.1016/j.dam.2025.07.009","title":"Obstructions for local tournament orientation completions with cut-vertices","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Mathematics; Orientation (vector space); Combinatorics; Geometry","score_opus":0.01855583382420776,"score_gpt":0.30799474652268233,"score_spread":0.28943891269847455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412558656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6946257,0.0006280738,0.14074492,0.0030329914,0.0007084234,0.00020980496,0.0009289747,0.0012628296,0.1578583],"genre_scores_gemma":[0.93895847,0.00034372008,0.0116382195,0.0004075651,0.00035962212,0.00015739955,0.0010082667,0.00044323163,0.04668352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983943,0.00023023157,0.00007038581,0.00031363103,0.0005269365,0.00046456346],"domain_scores_gemma":[0.995761,0.0013885676,0.0004945708,0.00029208427,0.000277913,0.0017859291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012204354,0.0009583972,0.0015795955,0.0026329332,0.003997587,0.0058110077,0.00197765,0.0018899532,0.019330535],"category_scores_gemma":[0.0045198137,0.0009913202,0.0015380848,0.0018528523,0.0035422896,0.0050434256,0.006192165,0.0058089616,0.0019447607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113005706,0.00010662597,0.00040942655,0.000057021196,0.0000128561205,0.0001353265,0.00037264705,0.0016440751,0.000683786,0.99100715,0.002601011,0.0028569484],"study_design_scores_gemma":[0.00010691958,0.000034277804,0.0005295142,0.000018995393,0.000020894056,0.00013890762,0.0002391132,0.008489277,0.00050669647,0.9859444,0.003939319,0.000031601754],"about_ca_topic_score_codex":0.0026778523,"about_ca_topic_score_gemma":0.0030115386,"teacher_disagreement_score":0.019330535,"about_ca_system_score_codex":0.0020179267,"about_ca_system_score_gemma":0.0009697584,"threshold_uncertainty_score":0.064667046},"labels":[],"label_agreement":null},{"id":"W4412582169","doi":"10.55016/ojs/cdm.v12i2.62487","title":"Lower Bounds on the Distance Domination Number of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; University of Johannesburg; National Research Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.020261008347206164,"score_gpt":0.3484921222010613,"score_spread":0.3282311138538551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4191047,0.030063145,0.42681536,0.0073582255,0.00053109584,0.00018183702,0.003334884,0.0015234636,0.11108731],"genre_scores_gemma":[0.918705,0.007935108,0.061458077,0.0007839124,0.0006587008,0.00024516252,0.001703017,0.0003610491,0.008149876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975013,0.0004601801,0.000117372605,0.0006705175,0.00071378297,0.00053684314],"domain_scores_gemma":[0.97797966,0.017134055,0.0012025579,0.0013564718,0.0011153693,0.0012118955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021243272,0.0019938233,0.0016407642,0.0031840405,0.0013493905,0.0029062154,0.0025139493,0.0013237604,0.0045314785],"category_scores_gemma":[0.014414052,0.0007034611,0.0012529268,0.0021819158,0.002263217,0.0050119176,0.0032671993,0.003151135,0.0011738316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002006081,0.00043040677,0.023506902,0.002358436,0.00055191404,0.0010215228,0.0015843366,0.34651893,0.09050277,0.37723267,0.023054123,0.13123196],"study_design_scores_gemma":[0.00009091073,0.00040812237,0.011113385,0.00042858155,0.0002764614,0.0023094148,0.0004097156,0.62542677,0.02460088,0.3079234,0.026823651,0.00018865349],"about_ca_topic_score_codex":0.0012729142,"about_ca_topic_score_gemma":0.0016234205,"teacher_disagreement_score":0.0045314785,"about_ca_system_score_codex":0.0033953553,"about_ca_system_score_gemma":0.0007596698,"threshold_uncertainty_score":0.024635077},"labels":[],"label_agreement":null},{"id":"W4412582188","doi":"10.55016/ojs/cdm.v12i2.62745","title":"Permutations avoiding connected graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.028515208239438185,"score_gpt":0.35768140537228726,"score_spread":0.32916619713284906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72767866,0.00057125563,0.16168225,0.0014411038,0.000330494,0.00018551697,0.0005286608,0.0008514343,0.10673065],"genre_scores_gemma":[0.95049155,0.0004792749,0.030675372,0.0003302704,0.00022041242,0.00019662698,0.0006859599,0.0001617639,0.016758742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989807,0.0002400382,0.000078547084,0.0002597071,0.0002225451,0.00021840079],"domain_scores_gemma":[0.99786454,0.00084803585,0.0003509643,0.0003708294,0.00020095857,0.0003647849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044519402,0.0005123131,0.00054345286,0.0014227418,0.0020223851,0.0019017825,0.00061324274,0.0013452676,0.0043839244],"category_scores_gemma":[0.00352962,0.0005588657,0.0005683822,0.001560942,0.0026909923,0.0025648763,0.0025884458,0.0014047314,0.0008596649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015291663,0.000029148296,0.0012111622,0.00008237528,0.000012984532,0.00064365886,0.000584861,0.0021312227,0.007570071,0.9660415,0.0024036192,0.019136459],"study_design_scores_gemma":[0.000026953307,0.000037241312,0.0005120317,0.000018216486,0.000016559716,0.000603726,0.00016415725,0.0050482205,0.0029425377,0.9770081,0.013605092,0.000017083928],"about_ca_topic_score_codex":0.0005240788,"about_ca_topic_score_gemma":0.00067501666,"teacher_disagreement_score":0.0043839244,"about_ca_system_score_codex":0.00079650903,"about_ca_system_score_gemma":0.00054946926,"threshold_uncertainty_score":0.014665663},"labels":[],"label_agreement":null},{"id":"W4412582201","doi":"10.55016/ojs/cdm.v12i2.62550","title":"Bounds for the m -Eternal Domination Number of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.025918743299742482,"score_gpt":0.38280737895624833,"score_spread":0.35688863565650586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51101154,0.0084323855,0.29207382,0.010178724,0.0003770775,0.0001832317,0.0042637666,0.0014336222,0.17204584],"genre_scores_gemma":[0.9417681,0.0022601332,0.041516278,0.000678806,0.00039357864,0.00019704351,0.0009970829,0.0002543666,0.011934647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818134,0.00026427043,0.00008068798,0.0004906028,0.0004096334,0.00057345355],"domain_scores_gemma":[0.9820869,0.012989063,0.0010834537,0.0016764295,0.00075355626,0.0014105715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020854154,0.0012428624,0.0011176707,0.0026996492,0.0015332608,0.0025058421,0.002761835,0.0010916351,0.008969643],"category_scores_gemma":[0.012538708,0.00060457597,0.0010522272,0.0017252407,0.002805882,0.0058200755,0.0026985172,0.0031287782,0.0011234964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019697107,0.00043298685,0.018524582,0.0011098352,0.00030339675,0.00069849787,0.0009821171,0.17037211,0.04403918,0.6422429,0.022294642,0.097030066],"study_design_scores_gemma":[0.000108218126,0.00026710014,0.009809924,0.00023429147,0.00017249903,0.0010121344,0.00021384218,0.34379193,0.0144202,0.60855645,0.02126844,0.00014496745],"about_ca_topic_score_codex":0.0022270456,"about_ca_topic_score_gemma":0.004155265,"teacher_disagreement_score":0.008969643,"about_ca_system_score_codex":0.0033426909,"about_ca_system_score_gemma":0.0011707034,"threshold_uncertainty_score":0.030006409},"labels":[],"label_agreement":null},{"id":"W4412582255","doi":"10.55016/ojs/cdm.v12i2.62508","title":"On Cops and Robbers on G Ξ and cop-edge critical graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Center for Research and Development in Mathematics and Applications","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Artificial intelligence","score_opus":0.023302382710995946,"score_gpt":0.3636016574214429,"score_spread":0.34029927471044696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65962,0.0012287077,0.25880113,0.0023139494,0.000107691536,0.00023089498,0.00042534195,0.00019982572,0.07707247],"genre_scores_gemma":[0.9483057,0.0010982166,0.036845937,0.00039264772,0.00013769568,0.00021276019,0.00045415296,0.00014876586,0.012404193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911124,0.00034118342,0.0000347355,0.00019219637,0.000114020586,0.00020665806],"domain_scores_gemma":[0.99501026,0.00318325,0.00067691784,0.00018446015,0.00018379113,0.0007613929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007195494,0.00137146,0.0009285592,0.00201679,0.002048866,0.0018706645,0.0011902591,0.0017722921,0.00645449],"category_scores_gemma":[0.004976772,0.0006061329,0.0008325859,0.0012380701,0.004061266,0.0035302273,0.0020618455,0.0019882547,0.00045586485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014903881,0.00008396203,0.0013574235,0.00016698767,0.00003479683,0.0005406713,0.0005964868,0.04853442,0.0029689982,0.9343162,0.0029595038,0.008291396],"study_design_scores_gemma":[0.00004008096,0.0000819168,0.0011224898,0.00007056398,0.000028021232,0.00030146874,0.00040197882,0.102273256,0.0010299607,0.8899511,0.004665078,0.00003411929],"about_ca_topic_score_codex":0.0041191694,"about_ca_topic_score_gemma":0.0031972968,"teacher_disagreement_score":0.00645449,"about_ca_system_score_codex":0.00221051,"about_ca_system_score_gemma":0.00079769775,"threshold_uncertainty_score":0.021592438},"labels":[],"label_agreement":null},{"id":"W4412582263","doi":"10.55016/ojs/cdm.v12i2.62445","title":"On the total signed domination number of the Cartesian product of paths","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Cartesian product; Mathematics; Combinatorics; Product (mathematics); Geometry","score_opus":0.015871039270510267,"score_gpt":0.32509482120535843,"score_spread":0.3092237819348482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62440586,0.0030676126,0.3249942,0.001288472,0.00017414597,0.0001160703,0.0009763842,0.00029194448,0.04468528],"genre_scores_gemma":[0.93614,0.0018100039,0.056011792,0.00023995273,0.00019318624,0.00019038243,0.0006269701,0.000106865766,0.0046809423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985563,0.00039792026,0.000086272405,0.00034471333,0.00039428665,0.00022048842],"domain_scores_gemma":[0.9834712,0.012947124,0.0010845478,0.0008268907,0.00080158905,0.0008686587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023015256,0.0011590635,0.00092739606,0.0025144995,0.0010068615,0.0021432687,0.001273961,0.00066142384,0.003540834],"category_scores_gemma":[0.015337634,0.00044255605,0.00069410075,0.002019949,0.0029330072,0.0045944783,0.0018845918,0.0014653278,0.00042755072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001157476,0.00020750439,0.014311314,0.00074696355,0.00020404047,0.00055556727,0.0011556747,0.15313318,0.020007733,0.73179305,0.0058511584,0.070876315],"study_design_scores_gemma":[0.000066358305,0.00040344693,0.005329681,0.00019198885,0.00015044895,0.0010742708,0.00026971364,0.32868716,0.0074114227,0.64772564,0.008607073,0.000082747436],"about_ca_topic_score_codex":0.00081250054,"about_ca_topic_score_gemma":0.0009722535,"teacher_disagreement_score":0.003540834,"about_ca_system_score_codex":0.0015926356,"about_ca_system_score_gemma":0.0008545007,"threshold_uncertainty_score":0.012171805},"labels":[],"label_agreement":null},{"id":"W4412617759","doi":"10.55016/ojs/cdm.v12i1.62175","title":"Bounds on several versions of restrained domination number","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph","score_opus":0.022056640730318405,"score_gpt":0.3656217373183562,"score_spread":0.3435650965880378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29949772,0.012917911,0.5626874,0.0030587295,0.00052670296,0.00034641818,0.0021354714,0.0017467726,0.11708293],"genre_scores_gemma":[0.8943808,0.0037096245,0.09224753,0.00065560616,0.000551801,0.00041841355,0.0009070068,0.0005089274,0.00662039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941012,0.0013469962,0.00034506767,0.0015135097,0.0018430754,0.00085003173],"domain_scores_gemma":[0.92949814,0.04703863,0.0062913527,0.009913397,0.004438516,0.0028199933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050229942,0.0018941406,0.0015144914,0.0048193345,0.0015611933,0.0032622106,0.005806819,0.0020904108,0.008461398],"category_scores_gemma":[0.04319788,0.00093467266,0.0016619611,0.0039971215,0.00472707,0.013766708,0.0034329141,0.006121008,0.0009788064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012709581,0.0003803673,0.012224813,0.00139299,0.00038082752,0.0007438882,0.0010701279,0.19081876,0.018529778,0.63980305,0.01234909,0.12103539],"study_design_scores_gemma":[0.00008512715,0.00028965937,0.0049394644,0.0003667925,0.00024926633,0.0013019447,0.0002785336,0.31445596,0.013960437,0.64660734,0.017234534,0.00023108596],"about_ca_topic_score_codex":0.00073500245,"about_ca_topic_score_gemma":0.0010419914,"teacher_disagreement_score":0.008461398,"about_ca_system_score_codex":0.0035354057,"about_ca_system_score_gemma":0.0010379935,"threshold_uncertainty_score":0.028306127},"labels":[],"label_agreement":null},{"id":"W4412647922","doi":"10.55016/ojs/cdm.v2i1.61885","title":"On the rigidity of regular bicycle (n,k)-gons","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rigidity (electromagnetism); Combinatorics; Materials science","score_opus":0.020391223131922997,"score_gpt":0.33276876695995283,"score_spread":0.31237754382802985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93798226,0.00046446876,0.036100343,0.0001415607,0.000043076438,0.000022861364,0.00011121712,0.00005294643,0.025081232],"genre_scores_gemma":[0.9896572,0.00025598245,0.0066966163,0.00002966223,0.000023920527,0.000010369652,0.00010150303,0.000029400426,0.0031952385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971646,0.00004972372,0.000017876928,0.00006321327,0.00008102492,0.00007165448],"domain_scores_gemma":[0.99934214,0.00025298123,0.00015395287,0.0000891038,0.000054659817,0.00010713177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023094274,0.00032454412,0.00038965605,0.0010247988,0.0008733311,0.00068505574,0.00057263905,0.0005383588,0.0038113892],"category_scores_gemma":[0.0011880492,0.00033429102,0.00050778757,0.00048602535,0.0020267477,0.00091592356,0.0010151903,0.0007335977,0.00029215895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025541635,0.000048158654,0.005544767,0.00020665515,0.000030798736,0.0009547758,0.0009632971,0.06201347,0.021039313,0.88236725,0.0010698531,0.02550628],"study_design_scores_gemma":[0.000031803826,0.00029185138,0.011902989,0.00011104099,0.000032575113,0.0015567292,0.00090874115,0.16662931,0.008614693,0.7999357,0.009866489,0.00011805909],"about_ca_topic_score_codex":0.0012940684,"about_ca_topic_score_gemma":0.00129519,"teacher_disagreement_score":0.0038113892,"about_ca_system_score_codex":0.0004974811,"about_ca_system_score_gemma":0.0001971164,"threshold_uncertainty_score":0.012750387},"labels":[],"label_agreement":null},{"id":"W4412648037","doi":"10.55016/ojs/cdm.v1i1.61914","title":"Uniquely circular colourable and uniquely fractional colourable graphs of large girth","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council","keywords":"Combinatorics; Mathematics; Girth (graph theory)","score_opus":0.010675779929692698,"score_gpt":0.2983649979812065,"score_spread":0.2876892180515138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84769756,0.0005802813,0.12025591,0.0006532684,0.00007038913,0.000046026267,0.00034618887,0.00032673075,0.030023552],"genre_scores_gemma":[0.9670924,0.0003021006,0.028062722,0.00017166208,0.000037670696,0.000036956983,0.00024734525,0.00004565964,0.0040034237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991823,0.0001302441,0.000036726316,0.00028932866,0.000120866105,0.00024048744],"domain_scores_gemma":[0.9960473,0.001964109,0.00053378916,0.00083584635,0.00024520743,0.00037365218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000624492,0.00046171897,0.00059703144,0.0006509989,0.0014312017,0.0016980635,0.00086732453,0.0010061513,0.0032459325],"category_scores_gemma":[0.0044279215,0.00054222683,0.00056959153,0.0007200107,0.00234498,0.0033086515,0.0018507879,0.0013883223,0.000318305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000577326,0.00006262964,0.00558366,0.00029196637,0.000044869692,0.0011056011,0.0012982925,0.02951271,0.041500427,0.8844283,0.002557348,0.033036895],"study_design_scores_gemma":[0.00008727097,0.00018445794,0.0056234957,0.00006880296,0.00010065098,0.0028755143,0.001000558,0.05283832,0.03316095,0.88626033,0.017694596,0.00010505647],"about_ca_topic_score_codex":0.00081363716,"about_ca_topic_score_gemma":0.0011815688,"teacher_disagreement_score":0.0032459325,"about_ca_system_score_codex":0.0008050979,"about_ca_system_score_gemma":0.00063818216,"threshold_uncertainty_score":0.010858655},"labels":[],"label_agreement":null},{"id":"W4412648067","doi":"10.55016/ojs/cdm.v1i1.61915","title":"Induced Subgraphs of Bounded Degree and Bounded Treewidth","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Treewidth; Bounded function; Mathematics; Combinatorics; Degree (music); Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.025956985522601995,"score_gpt":0.3125563119720091,"score_spread":0.2865993264494071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6564919,0.0008730771,0.3128233,0.0010564451,0.000040768016,0.000084931075,0.0015259895,0.00061208656,0.026491448],"genre_scores_gemma":[0.9425,0.00060999306,0.051113162,0.00023140642,0.00007321061,0.00010356963,0.0013814529,0.000120786215,0.0038663868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991774,0.00013487831,0.000037796024,0.00019235892,0.00022509204,0.00023245285],"domain_scores_gemma":[0.9936573,0.003463737,0.0011515939,0.0009152824,0.00040718322,0.00040485393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048711846,0.00042828702,0.0004767651,0.0006886366,0.0004820833,0.0013273458,0.0011017381,0.0005125182,0.0026255508],"category_scores_gemma":[0.0037030214,0.0005011623,0.0005699035,0.0011610183,0.0007650225,0.0024736465,0.001359465,0.0012880524,0.00040587797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057944993,0.00033037388,0.009454085,0.00050299766,0.00015381712,0.0012162466,0.0009254093,0.10946762,0.08120581,0.7396342,0.007855642,0.04867436],"study_design_scores_gemma":[0.00014551403,0.00013762401,0.007305892,0.00006313735,0.0001211958,0.0012345936,0.00025818672,0.2693786,0.024568908,0.6825937,0.014148302,0.000044444325],"about_ca_topic_score_codex":0.0006135406,"about_ca_topic_score_gemma":0.0010089244,"teacher_disagreement_score":0.0026255508,"about_ca_system_score_codex":0.0010185203,"about_ca_system_score_gemma":0.0004401783,"threshold_uncertainty_score":0.00878334},"labels":[],"label_agreement":null},{"id":"W4412648234","doi":"10.55016/ojs/cdm.v13i1.62310","title":"On the enumeration of a class of toroidal graphs","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Enumeration; Combinatorics; Mathematics; Toroid; Class (philosophy); Computer science; Physics; Artificial intelligence","score_opus":0.01820904632752397,"score_gpt":0.3194199532373009,"score_spread":0.3012109069097769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80951804,0.0006035821,0.09967837,0.000658107,0.0001321772,0.000058764694,0.00060887536,0.0003838686,0.0883582],"genre_scores_gemma":[0.96100736,0.0005382563,0.02600452,0.00016510209,0.00009601937,0.00008015767,0.000742311,0.00009325707,0.011273173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996493,0.00008340759,0.000020542268,0.000075038166,0.00008494209,0.00008685938],"domain_scores_gemma":[0.99902296,0.0004270604,0.00014223967,0.00014336513,0.00013835114,0.00012604345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002905678,0.0003596468,0.0004277085,0.0017488935,0.0015832372,0.0017836383,0.0005771214,0.0005690286,0.004969611],"category_scores_gemma":[0.0017799871,0.00020140302,0.00037168877,0.001966758,0.0015486121,0.0027710644,0.0010844329,0.000809901,0.00044139515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009757679,0.000027394193,0.0012200554,0.00009047265,0.0000069330977,0.0002403574,0.000545352,0.004351876,0.0032682181,0.96158886,0.0022328617,0.026330048],"study_design_scores_gemma":[0.000012221633,0.000038177186,0.0015758502,0.000055072433,0.000014464152,0.00060975767,0.00066914735,0.025616094,0.002933065,0.9526816,0.015762117,0.00003240983],"about_ca_topic_score_codex":0.00097252685,"about_ca_topic_score_gemma":0.0011174898,"teacher_disagreement_score":0.004969611,"about_ca_system_score_codex":0.0007204191,"about_ca_system_score_gemma":0.00035399297,"threshold_uncertainty_score":0.016624987},"labels":[],"label_agreement":null},{"id":"W4412863170","doi":"10.1007/978-981-95-0218-9_11","title":"Vertex-Critical $$(P_5,W_4)$$-Free Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island; Acadia University","funders":"","keywords":"Computer science; Vertex (graph theory); Combinatorics; Graph; Theoretical computer science; Mathematics","score_opus":0.017836022691292343,"score_gpt":0.2949606395636925,"score_spread":0.27712461687240014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412863170","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38099042,0.0010654323,0.11395874,0.0023880468,0.00064908975,0.0002206662,0.0018182823,0.001172178,0.49773714],"genre_scores_gemma":[0.7876825,0.0008140458,0.037064854,0.00062655134,0.00015377541,0.00013171586,0.0018599669,0.00061252597,0.17105402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986863,0.000017585455,0.000004591488,0.00003264694,0.000029593708,0.000046884346],"domain_scores_gemma":[0.9996259,0.000120028664,0.000040942243,0.000048933827,0.00006775097,0.0000963539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015941774,0.0005645044,0.00033052752,0.0010479271,0.0016937468,0.0013612553,0.0008500949,0.0005335339,0.020142091],"category_scores_gemma":[0.00076398795,0.00046425086,0.00032599262,0.00090501184,0.0008599574,0.0018085127,0.00094229,0.0012479489,0.0028636586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015867388,0.000055384975,0.0005150864,0.00019010656,0.000018185483,0.00035778023,0.00027975717,0.0021335802,0.012300334,0.92123234,0.028962966,0.033795834],"study_design_scores_gemma":[0.000031278498,0.0000330658,0.0007303861,0.000048801954,0.000032264,0.00038041687,0.00021233708,0.004702849,0.011394204,0.92271155,0.05970431,0.000018528805],"about_ca_topic_score_codex":0.0013319004,"about_ca_topic_score_gemma":0.0028818564,"teacher_disagreement_score":0.020142091,"about_ca_system_score_codex":0.00066809397,"about_ca_system_score_gemma":0.00051778177,"threshold_uncertainty_score":0.06738198},"labels":[],"label_agreement":null},{"id":"W4412946758","doi":"10.1002/rsa.70023","title":"Leaf Stripping on Uniform Attachment Trees","year":2025,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Banco Bilbao Vizcaya Argentaria; Canada Research Chairs; McGill University; Fundación BBVA; Simons Foundation; Ministerio de Economía y Competitividad; National Science Foundation","keywords":"Stripping (fiber); Mathematics; Horticulture; Combinatorics; Computer science; Biology; Botany; Materials science; Composite material","score_opus":0.013784659978995658,"score_gpt":0.3026938574745666,"score_spread":0.288909197495571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412946758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6458883,0.00092801155,0.3432386,0.00041078456,0.00010025019,0.00015571437,0.00021011889,0.0016802163,0.007387972],"genre_scores_gemma":[0.9486403,0.00018449471,0.048385303,0.00010874117,0.00003312063,0.000060330007,0.0001821892,0.00015437441,0.0022510956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976164,0.0009218486,0.00010012046,0.00036604074,0.00051622576,0.00047937507],"domain_scores_gemma":[0.9775655,0.015267724,0.0013175841,0.003546154,0.0014769858,0.0008260973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038513131,0.00046302864,0.0011454643,0.0010446078,0.0013308573,0.0012746116,0.002004303,0.000835029,0.003646905],"category_scores_gemma":[0.02462959,0.0004659211,0.00051381957,0.0011407569,0.0017941163,0.002523968,0.0018877597,0.0011723489,0.00087993447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002247014,0.00035039504,0.0056305043,0.0002742608,0.00016944483,0.00036868043,0.00037499378,0.77593786,0.030679764,0.07540692,0.009910387,0.09864977],"study_design_scores_gemma":[0.0000426926,0.00017702849,0.0006569035,0.000010683783,0.00002117876,0.00007411151,0.00004361118,0.9792793,0.006113853,0.01298307,0.0005837981,0.000013760545],"about_ca_topic_score_codex":0.0024273423,"about_ca_topic_score_gemma":0.0017868971,"teacher_disagreement_score":0.0038513131,"about_ca_system_score_codex":0.0015549931,"about_ca_system_score_gemma":0.0009788782,"threshold_uncertainty_score":0.02036792},"labels":[],"label_agreement":null},{"id":"W4412969805","doi":"10.1090/proc/17320","title":"Open graphs and Tukey order","year":2025,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science; Artificial intelligence; Annotation","score_opus":0.019396964075518497,"score_gpt":0.3205074959984511,"score_spread":0.3011105319229326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412969805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051941413,0.0030123722,0.506956,0.0051697,0.0016401234,0.00012487304,0.0018560387,0.002251799,0.42704773],"genre_scores_gemma":[0.65684426,0.0030898438,0.14390753,0.0024826028,0.0021305603,0.0003013736,0.0025685765,0.0018102819,0.18686491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965526,0.0011901566,0.0002061821,0.0008880171,0.000716803,0.00044620188],"domain_scores_gemma":[0.99242216,0.0035091573,0.0007301816,0.001338,0.001455326,0.0005452838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026051656,0.0007819769,0.0009197784,0.002440316,0.0025632274,0.004029547,0.0008805409,0.00090700336,0.03347562],"category_scores_gemma":[0.009737956,0.0004490151,0.0015726307,0.0024054511,0.00512706,0.006506464,0.002926551,0.003046275,0.0076027815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025286874,0.000009603262,0.00008734672,0.000027253402,0.000005577902,0.000018423032,0.00016966533,0.00037795462,0.00011802468,0.9867279,0.0033347858,0.009098072],"study_design_scores_gemma":[0.0000074271065,0.000009650167,0.000089327754,0.000007981873,0.0000027927213,0.00001954421,0.000060015303,0.0007764861,0.00015177291,0.9876177,0.011250821,0.0000065918157],"about_ca_topic_score_codex":0.0033469032,"about_ca_topic_score_gemma":0.0045609456,"teacher_disagreement_score":0.03347562,"about_ca_system_score_codex":0.002567702,"about_ca_system_score_gemma":0.0014893656,"threshold_uncertainty_score":0.111987054},"labels":[],"label_agreement":null},{"id":"W4413071390","doi":"10.1007/978-3-031-98740-3_10","title":"Covering Vertices by $$4^+$$-Paths: A Simpler Local Search Coupled with a More Delicate Amortization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Amortization; Algorithm","score_opus":0.014650625266111888,"score_gpt":0.281982273973631,"score_spread":0.26733164870751913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413071390","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041142676,0.00048105957,0.9091428,0.001421322,0.00036385754,0.00033294086,0.0007432799,0.0036656922,0.04270647],"genre_scores_gemma":[0.12573633,0.0002305182,0.8472419,0.0005322185,0.0001920624,0.0002988798,0.00078631775,0.0020307833,0.022950994],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986413,0.00035296447,0.000076148805,0.00040641247,0.0002994525,0.00022374591],"domain_scores_gemma":[0.99732554,0.0012997369,0.00009128332,0.0010067904,0.00012769678,0.00014896486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011183327,0.0013368445,0.002265569,0.0011319849,0.0013488195,0.002748653,0.0040794318,0.0025109784,0.051947232],"category_scores_gemma":[0.004941316,0.00096012774,0.0023155326,0.002158419,0.0013771876,0.0069902814,0.0046631284,0.0030238763,0.0066943252],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010794275,0.0007122346,0.0006873626,0.00105189,0.00024540327,0.00030209913,0.000433569,0.17720006,0.023250086,0.23427036,0.066982396,0.49378505],"study_design_scores_gemma":[0.00023720105,0.00020472865,0.00032498836,0.000071675764,0.00014975827,0.0003736739,0.00020326316,0.7084607,0.005739924,0.26484215,0.019330373,0.00006158447],"about_ca_topic_score_codex":0.0029561063,"about_ca_topic_score_gemma":0.006969611,"teacher_disagreement_score":0.051947232,"about_ca_system_score_codex":0.0013931049,"about_ca_system_score_gemma":0.0016976447,"threshold_uncertainty_score":0.1737808},"labels":[],"label_agreement":null},{"id":"W4413073558","doi":"10.37236/13247","title":"Clustered Colouring of Graph Products","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Bounded function; Discrete mathematics; Cluster analysis; 1-planar graph; Pathwidth; Degree (music); Partial k-tree; Graph; Chordal graph; Line graph","score_opus":0.008809648612104325,"score_gpt":0.26838149700915837,"score_spread":0.25957184839705405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413073558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5922788,0.00071645057,0.3765262,0.00030729122,0.00011489694,0.00013866025,0.0005033773,0.0009335601,0.028480796],"genre_scores_gemma":[0.89567554,0.0003027613,0.094444565,0.00014709184,0.000043895358,0.00009534014,0.00065204443,0.0003945584,0.008244273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866223,0.0002853907,0.00005883397,0.00049017696,0.00025857167,0.00024484692],"domain_scores_gemma":[0.99368274,0.0021280341,0.00070284895,0.0018102415,0.000992815,0.0006834338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006864651,0.0006251691,0.00064521586,0.00086370046,0.0013377838,0.0016567957,0.001553182,0.0009263658,0.0058151167],"category_scores_gemma":[0.0046091434,0.0006385131,0.0008129432,0.0013618221,0.0019672557,0.0032074207,0.001972637,0.0010550774,0.000833608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095175137,0.00018165204,0.005553802,0.0006931109,0.00014175111,0.00078709435,0.0015540062,0.14329275,0.10072222,0.6545864,0.0075701927,0.083965234],"study_design_scores_gemma":[0.00009359291,0.0005729807,0.004200136,0.000101953076,0.00014089275,0.0015144726,0.0005668237,0.28645274,0.05868094,0.62219226,0.025356809,0.00012632603],"about_ca_topic_score_codex":0.0020719878,"about_ca_topic_score_gemma":0.002849609,"teacher_disagreement_score":0.0058151167,"about_ca_system_score_codex":0.0016335953,"about_ca_system_score_gemma":0.0006803235,"threshold_uncertainty_score":0.019453526},"labels":[],"label_agreement":null},{"id":"W4413106090","doi":"10.55016/ojs/cdm.v4i1.61874","title":"The search for N-e.c. graphs","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Combinatorics; Mathematics","score_opus":0.02301138307289361,"score_gpt":0.3528199337561546,"score_spread":0.329808550683261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6829957,0.0045655915,0.1982962,0.0077843075,0.00023261567,0.00006271513,0.00059136277,0.0006682163,0.10480332],"genre_scores_gemma":[0.8905047,0.002594987,0.09350047,0.00079692004,0.00018963634,0.000060880215,0.00069423404,0.00010338834,0.01155476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975663,0.00006209724,0.0000092851205,0.000081357946,0.00005558325,0.0000350981],"domain_scores_gemma":[0.99816364,0.0011170513,0.00016834236,0.0002723873,0.00017153317,0.0001069638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047388574,0.0003109471,0.00039175412,0.0008249257,0.0011235891,0.001271261,0.00076306175,0.0012189785,0.0031251768],"category_scores_gemma":[0.003655745,0.000390567,0.00033223917,0.0010396849,0.0018485817,0.0023780072,0.0008910444,0.0015608476,0.00042858516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043789896,0.000022484299,0.0009859302,0.00013810524,0.000009299661,0.00019099591,0.00013912444,0.0053024073,0.0027506691,0.95311046,0.0039367783,0.033370007],"study_design_scores_gemma":[0.000017574166,0.000024705341,0.000872675,0.000070887676,0.000012959835,0.00069124065,0.00021643689,0.01982454,0.0035051075,0.95445144,0.02029039,0.00002218098],"about_ca_topic_score_codex":0.0005309206,"about_ca_topic_score_gemma":0.00076687423,"teacher_disagreement_score":0.0031251768,"about_ca_system_score_codex":0.0006946808,"about_ca_system_score_gemma":0.00036876483,"threshold_uncertainty_score":0.0104548335},"labels":[],"label_agreement":null},{"id":"W4413186111","doi":"10.55016/ojs/cdm.v5i2.62764","title":"Generalized CPR-graphs and applications","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.012707080345668788,"score_gpt":0.31933515415495034,"score_spread":0.30662807380928153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16994429,0.0011173314,0.47139272,0.0031942625,0.0006934989,0.00032017363,0.001344988,0.001419583,0.3505732],"genre_scores_gemma":[0.7752329,0.0012045231,0.16985875,0.0011176704,0.00036741575,0.00023097363,0.0019371839,0.0004389543,0.049611583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991615,0.00019581124,0.00004600437,0.00023091068,0.00024614565,0.00011966768],"domain_scores_gemma":[0.99867404,0.000344886,0.00014818592,0.0003221896,0.0003463688,0.00016440511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056551304,0.00051687297,0.0004475163,0.0010690347,0.0012937197,0.0016148008,0.000886045,0.0009584018,0.016407749],"category_scores_gemma":[0.0025770036,0.0003288149,0.00088226,0.0010588933,0.0017155347,0.0021349601,0.0017307634,0.0020790119,0.0021093294],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001572841,0.000013615597,0.00017062329,0.00005163284,0.0000046561163,0.00013409319,0.00006997692,0.003819481,0.0017785509,0.9816591,0.0021488732,0.010133728],"study_design_scores_gemma":[0.000014101999,0.000025609168,0.000241891,0.00003431032,0.000008425451,0.00032158566,0.00015541096,0.014407337,0.0020583316,0.95850176,0.024212506,0.00001878339],"about_ca_topic_score_codex":0.002004741,"about_ca_topic_score_gemma":0.0019306798,"teacher_disagreement_score":0.016407749,"about_ca_system_score_codex":0.0011711775,"about_ca_system_score_gemma":0.0007756937,"threshold_uncertainty_score":0.05488944},"labels":[],"label_agreement":null},{"id":"W4413186243","doi":"10.55016/ojs/cdm.v6i2.62059","title":"A variant of the bipartite relation theorem and its application to clique graphs","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Clique; Bipartite graph; Clique graph; Robertson–Seymour theorem; Discrete mathematics; Cograph; Relation (database); Chordal graph; Graph; 1-planar graph; Line graph; Computer science; Voltage graph","score_opus":0.02114390511315031,"score_gpt":0.29782461520389014,"score_spread":0.27668071009073986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3917106,0.0018148515,0.4753858,0.0035136181,0.00058584264,0.000071778624,0.00023619086,0.0002759816,0.12640534],"genre_scores_gemma":[0.9550087,0.0007413317,0.029187595,0.00048658423,0.0003701166,0.000045415298,0.00015631718,0.000093497525,0.013910507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999468,0.00017027206,0.000017649263,0.00012287816,0.00012921845,0.00009193166],"domain_scores_gemma":[0.99907494,0.00040628563,0.00010658407,0.000108485256,0.000120824196,0.00018294468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092784676,0.00029983924,0.0003688037,0.00166564,0.0014762292,0.0013735965,0.0009347987,0.0009736926,0.0060746507],"category_scores_gemma":[0.0027797811,0.00020261396,0.0005455784,0.0013715795,0.0025969269,0.0036390228,0.0029025162,0.0013269072,0.00052762195],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055071782,0.000004777338,0.00015301461,0.000012892822,0.0000018668827,0.000048598664,0.00010620949,0.00041282712,0.000523413,0.9964205,0.00029392634,0.0020165748],"study_design_scores_gemma":[0.000008245037,0.00002538183,0.00041770315,0.0000118067555,0.000005628867,0.00018291168,0.00019724407,0.006963359,0.0005873357,0.9864807,0.0051067728,0.00001301008],"about_ca_topic_score_codex":0.002049132,"about_ca_topic_score_gemma":0.0015291608,"teacher_disagreement_score":0.0060746507,"about_ca_system_score_codex":0.0007351057,"about_ca_system_score_gemma":0.00037262545,"threshold_uncertainty_score":0.020321667},"labels":[],"label_agreement":null},{"id":"W4413186403","doi":"10.55016/ojs/cdm.v7i2.62089","title":"Domination Value in Graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Value (mathematics); Statistics","score_opus":0.018171568515713735,"score_gpt":0.33151473795935527,"score_spread":0.31334316944364154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61799777,0.0050080568,0.3201098,0.0015513031,0.00009343072,0.00010754259,0.00079722557,0.00027363576,0.054061253],"genre_scores_gemma":[0.97713506,0.00089221116,0.017474178,0.00009681882,0.00012146869,0.00006706783,0.0002487292,0.000044974076,0.003919429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986726,0.00033559577,0.00007305635,0.00033918011,0.0003722189,0.00020721449],"domain_scores_gemma":[0.99409133,0.004187857,0.0004443848,0.00035819254,0.00053010276,0.0003881793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013516351,0.00043113108,0.00067245855,0.0023195622,0.00087817584,0.0027455296,0.0008434436,0.0007068501,0.0016422012],"category_scores_gemma":[0.008387934,0.0002802938,0.0004663157,0.002465152,0.0027514268,0.0041041486,0.0012010336,0.00086616504,0.00019150597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106293366,0.00004004912,0.0052678552,0.00016287804,0.000059409256,0.00016361348,0.0008562046,0.031646103,0.0048447265,0.9108079,0.0020994449,0.04394541],"study_design_scores_gemma":[0.000015001222,0.000041649677,0.0026165303,0.00003931582,0.000028345596,0.00037236357,0.00024669856,0.08157869,0.0022827864,0.90356266,0.009189875,0.00002599794],"about_ca_topic_score_codex":0.000979097,"about_ca_topic_score_gemma":0.0006066082,"teacher_disagreement_score":0.0027455296,"about_ca_system_score_codex":0.0021149807,"about_ca_system_score_gemma":0.00043047237,"threshold_uncertainty_score":0.015345335},"labels":[],"label_agreement":null},{"id":"W4413186462","doi":"10.55016/ojs/cdm.v7i1.62115","title":"On characterizing game-perfect graphs by forbidden induced subgraphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.02203298500575682,"score_gpt":0.32223342822638623,"score_spread":0.3002004432206294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48422396,0.0009787903,0.48207873,0.0012867295,0.00009556148,0.00025502988,0.0009153571,0.0003223866,0.029843437],"genre_scores_gemma":[0.9382707,0.00062190107,0.056971107,0.0003195346,0.00017245885,0.00019660946,0.0006051142,0.000117051495,0.0027255812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974567,0.0008543353,0.00011944505,0.0007289858,0.0004263665,0.0004140083],"domain_scores_gemma":[0.9852341,0.01054893,0.0018257439,0.0010489036,0.00054105505,0.0008012439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021270502,0.0012874134,0.0010310481,0.0023692383,0.0019591565,0.003101874,0.0017466448,0.0013275904,0.0025828837],"category_scores_gemma":[0.012418532,0.0006418157,0.0011079272,0.0029585653,0.00464317,0.0071282526,0.0019816908,0.001716426,0.00025632052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002219367,0.00015308104,0.005009579,0.00017830783,0.00006185824,0.00020031101,0.0006856372,0.05369115,0.0049829697,0.9181287,0.002139527,0.014546846],"study_design_scores_gemma":[0.00005011491,0.000085334716,0.0017761062,0.000055409444,0.00004903619,0.00038683298,0.00027940073,0.12103241,0.0020436307,0.8698313,0.004362713,0.000047618334],"about_ca_topic_score_codex":0.0033842563,"about_ca_topic_score_gemma":0.0029447174,"teacher_disagreement_score":0.0033842563,"about_ca_system_score_codex":0.0026533648,"about_ca_system_score_gemma":0.0012379976,"threshold_uncertainty_score":0.019251585},"labels":[],"label_agreement":null},{"id":"W4413187066","doi":"10.55016/ojs/cdm.v3i2.61934","title":"Colourful transversal theorems","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Transversal (combinatorics); Mathematics; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.02085932868845986,"score_gpt":0.3110499104651051,"score_spread":0.29019058177664525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07526485,0.0008720704,0.82303905,0.0017884867,0.00075337675,0.000113494694,0.0005987538,0.0009799912,0.096590005],"genre_scores_gemma":[0.8690207,0.0013457407,0.07018689,0.0021763628,0.00065569376,0.00025915747,0.00072841835,0.00050885946,0.055118334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773824,0.0003243328,0.00013051012,0.00063908385,0.00064601685,0.00052188215],"domain_scores_gemma":[0.9932145,0.001972768,0.0005878119,0.0016996416,0.0017227615,0.00080251775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025257128,0.00089531357,0.00059585215,0.0015692262,0.0016018052,0.0028540741,0.0016670916,0.0013142132,0.014714491],"category_scores_gemma":[0.007886565,0.00062689284,0.0017885715,0.0010308636,0.003805277,0.0076499376,0.005320754,0.0052129203,0.0029924447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028303833,0.000008504409,0.00018682618,0.000027852802,0.000007717351,0.00006477954,0.00013788289,0.00064181176,0.001166119,0.99205995,0.0017651981,0.0039050113],"study_design_scores_gemma":[0.000021494181,0.00004054844,0.00021809057,0.000017282939,0.000016335389,0.0002580543,0.000098079945,0.006145942,0.0034845723,0.98003197,0.009646786,0.000020888518],"about_ca_topic_score_codex":0.0014875854,"about_ca_topic_score_gemma":0.0009568608,"teacher_disagreement_score":0.014714491,"about_ca_system_score_codex":0.001667241,"about_ca_system_score_gemma":0.0009171322,"threshold_uncertainty_score":0.049224854},"labels":[],"label_agreement":null},{"id":"W4413187103","doi":"10.55016/ojs/cdm.v3i2.62003","title":"Partially critical indecomposable graphs","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Indecomposable module; Discrete mathematics","score_opus":0.028750634360140834,"score_gpt":0.34725951642660197,"score_spread":0.3185088820664611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93645495,0.0006297681,0.050411552,0.00021906127,0.00001942791,0.00005555506,0.0007159706,0.00013593952,0.011357713],"genre_scores_gemma":[0.98769325,0.00028216402,0.009206431,0.00004113114,0.000026036681,0.000029505225,0.0008297997,0.000017305276,0.0018744444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998134,0.00002391893,0.000009302976,0.00007032659,0.000040202172,0.000042973264],"domain_scores_gemma":[0.9991062,0.00029112256,0.00022829101,0.00010029169,0.00010724722,0.00016677298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001445759,0.0004892736,0.00028151827,0.0013223618,0.0005219648,0.0006088548,0.0006071997,0.0002987723,0.001981303],"category_scores_gemma":[0.0010702274,0.00022425038,0.00021588725,0.00073613663,0.00066234387,0.0013831372,0.000602516,0.0005586455,0.00014462374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006914472,0.00021080207,0.028653705,0.00066081126,0.00016640771,0.004613454,0.0019706902,0.055710718,0.09607969,0.7192442,0.004948292,0.08704981],"study_design_scores_gemma":[0.00005607257,0.00025559022,0.014947339,0.00009997322,0.00011885379,0.004037826,0.0011722811,0.07224639,0.03876251,0.8399897,0.028250102,0.00006329892],"about_ca_topic_score_codex":0.0005109792,"about_ca_topic_score_gemma":0.0007822593,"teacher_disagreement_score":0.001981303,"about_ca_system_score_codex":0.0005427033,"about_ca_system_score_gemma":0.00027020156,"threshold_uncertainty_score":0.006628096},"labels":[],"label_agreement":null},{"id":"W4413232290","doi":"10.1007/978-3-032-00281-5_8","title":"The Two-Squirrel Problem and Its Relatives","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Squirrel monkey; Theoretical computer science; Biology; Ecology","score_opus":0.018986700502872562,"score_gpt":0.29215149539107527,"score_spread":0.2731647948882027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413232290","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22339706,0.0066322996,0.33348975,0.02413038,0.0025471048,0.00022216469,0.0011092789,0.00084975763,0.4076222],"genre_scores_gemma":[0.7814498,0.003718245,0.09674412,0.0030791033,0.0025360135,0.00022970907,0.0015559199,0.0005946047,0.110092476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892765,0.00033480805,0.000050860537,0.00030462502,0.00020538397,0.0001766818],"domain_scores_gemma":[0.995158,0.0031635568,0.00042127652,0.0006352722,0.00028085688,0.00034108787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016189042,0.0008757597,0.0018006833,0.0011410573,0.003858441,0.0030138874,0.002644095,0.004567037,0.031925328],"category_scores_gemma":[0.0090823285,0.00073011016,0.0015238828,0.002429722,0.003590771,0.009360095,0.0029850078,0.004661223,0.0032686251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020203122,0.00012849162,0.00020690788,0.00023532065,0.000023197445,0.00018343996,0.00019572333,0.00329243,0.0004968593,0.9485048,0.020601116,0.025929704],"study_design_scores_gemma":[0.000040926778,0.000024466177,0.00007646216,0.000019743109,0.0000076131573,0.00012340501,0.000079349375,0.0050998754,0.00018700415,0.9882088,0.006122591,0.000009714355],"about_ca_topic_score_codex":0.0010230084,"about_ca_topic_score_gemma":0.00087361236,"teacher_disagreement_score":0.031925328,"about_ca_system_score_codex":0.0009811565,"about_ca_system_score_gemma":0.0008867807,"threshold_uncertainty_score":0.106800854},"labels":[],"label_agreement":null},{"id":"W4413241235","doi":"10.1002/rsa.70026","title":"Sidorenko‐Type Inequalities for Pairs of Trees","year":2025,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; McGill University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Mitacs; Pacific Institute for the Mathematical Sciences; University of Victoria","keywords":"Homomorphism; Mathematics; Combinatorics; Vertex (graph theory); Path (computing); Type (biology); Graph; Discrete mathematics; Computer science","score_opus":0.019395925844421836,"score_gpt":0.3092716544559079,"score_spread":0.289875728611486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413241235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19451076,0.0023787206,0.6451208,0.004778674,0.00041181015,0.0003484803,0.003737117,0.00025119036,0.14846252],"genre_scores_gemma":[0.8652199,0.0010455246,0.1180326,0.0011766982,0.00044174414,0.0004718829,0.0025317154,0.00012415597,0.010955729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944922,0.0016874863,0.0004016942,0.0013023441,0.0013515349,0.0007648453],"domain_scores_gemma":[0.9723432,0.020573208,0.0019506521,0.0012340423,0.0026152045,0.0012836538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004609804,0.000885291,0.001463889,0.0025870244,0.0019868293,0.0039103003,0.0032695977,0.0018780716,0.014199987],"category_scores_gemma":[0.023669021,0.0011197622,0.001878496,0.0027664457,0.0024770198,0.009779922,0.0037678669,0.0058248895,0.001223556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001490294,0.00005281634,0.0017081816,0.00017805671,0.000038585284,0.0002204052,0.00030357784,0.007904158,0.0015307465,0.9769116,0.0030572333,0.007945559],"study_design_scores_gemma":[0.00003610292,0.000050161147,0.0017106069,0.00009504527,0.000037684866,0.00027720234,0.00018577113,0.07713323,0.001581392,0.91365635,0.0051964098,0.000040056955],"about_ca_topic_score_codex":0.0027214692,"about_ca_topic_score_gemma":0.0032033601,"teacher_disagreement_score":0.014199987,"about_ca_system_score_codex":0.0037185752,"about_ca_system_score_gemma":0.0017658906,"threshold_uncertainty_score":0.04750371},"labels":[],"label_agreement":null},{"id":"W4413297002","doi":"10.1007/s00236-025-00503-0","title":"On the 3-tree core of plane graphs","year":2025,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Bangladesh University of Engineering and Technology","keywords":"Theory of computation; Core (optical fiber); Tree (set theory); Combinatorics; Mathematics; Computer science; Plane (geometry); Discrete mathematics; Algorithm; Geometry; Telecommunications","score_opus":0.02111892525438423,"score_gpt":0.2857842315970918,"score_spread":0.2646653063427076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413297002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7609815,0.0016332311,0.13252509,0.0020723422,0.000135522,0.00010923636,0.001180442,0.00038059248,0.10098202],"genre_scores_gemma":[0.93006533,0.0017466111,0.045336675,0.00072663627,0.00020739768,0.00009617819,0.001722163,0.000314094,0.0197849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995926,0.000102616425,0.0000142106965,0.00007944753,0.00010788244,0.00010337797],"domain_scores_gemma":[0.9981177,0.0009293847,0.00026947373,0.00016423501,0.00024937867,0.00026984766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045634725,0.0005267516,0.0010658548,0.0019009464,0.0012803327,0.0027389093,0.0011335916,0.0013942331,0.009690197],"category_scores_gemma":[0.0032458184,0.0006401163,0.0006647735,0.0020124307,0.0015474587,0.0035742077,0.0016851777,0.0020842003,0.0016549007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023309578,0.00006811335,0.0008947302,0.0001498276,0.000022830047,0.00019813585,0.00065164745,0.008172369,0.003545736,0.9606991,0.0075370856,0.01782732],"study_design_scores_gemma":[0.000029497747,0.000028388218,0.0007437497,0.000048306065,0.000017753648,0.00014984478,0.00024076657,0.027573407,0.00078864186,0.966556,0.0038129443,0.000010800333],"about_ca_topic_score_codex":0.0036390545,"about_ca_topic_score_gemma":0.004288491,"teacher_disagreement_score":0.009690197,"about_ca_system_score_codex":0.0009253853,"about_ca_system_score_gemma":0.000537294,"threshold_uncertainty_score":0.03241694},"labels":[],"label_agreement":null},{"id":"W4413431503","doi":"10.1016/j.disc.2025.114746","title":"Oriented colouring graphs of bounded degree and degeneracy","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Illinois at Urbana-Champaign","keywords":"Mathematics; Degree (music); Bounded function; Degeneracy (biology); Combinatorics; Discrete mathematics","score_opus":0.02541250570613969,"score_gpt":0.3095260943351586,"score_spread":0.2841135886290189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413431503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71898615,0.0022912587,0.2105138,0.0010268816,0.00007537266,0.00005583173,0.0004993282,0.00057118986,0.06598018],"genre_scores_gemma":[0.9567178,0.0012971446,0.035571575,0.00037901613,0.000086954584,0.00004893113,0.00040707155,0.00016122093,0.005330357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990596,0.00012051646,0.00003867862,0.00022114387,0.00033316624,0.00022695579],"domain_scores_gemma":[0.9945608,0.003223146,0.00060426124,0.0008034179,0.00033974403,0.00046858878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006218265,0.00077553256,0.00058051734,0.0014452559,0.001082787,0.0014768111,0.0012300214,0.00068299676,0.0034554212],"category_scores_gemma":[0.0058048214,0.0006424243,0.00048848416,0.0017167225,0.0023641672,0.003840281,0.002910203,0.0020185085,0.0005099027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006682009,0.0002082041,0.014080036,0.00055812177,0.00009532505,0.0007227665,0.00086502294,0.19807747,0.04327555,0.6573119,0.0037864805,0.080350876],"study_design_scores_gemma":[0.00004903727,0.0000836534,0.004035864,0.00007721211,0.000043351574,0.00061970094,0.00017603108,0.155679,0.006432085,0.8238839,0.008870916,0.00004921258],"about_ca_topic_score_codex":0.0026956827,"about_ca_topic_score_gemma":0.0035502175,"teacher_disagreement_score":0.0034554212,"about_ca_system_score_codex":0.0023147913,"about_ca_system_score_gemma":0.0007338543,"threshold_uncertainty_score":0.01679504},"labels":[],"label_agreement":null},{"id":"W4413472841","doi":"10.61091/jcmcc126-24","title":"The polychromatic domination number","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.010896539075305703,"score_gpt":0.2957728304822263,"score_spread":0.2848762914069206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413472841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41130096,0.0016385457,0.32800537,0.004476236,0.00047925182,0.00049358275,0.00956362,0.001817663,0.24222478],"genre_scores_gemma":[0.8982499,0.000759107,0.057123385,0.0010047413,0.00035480654,0.00069767714,0.0032136575,0.0004165055,0.038180295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977881,0.00039731865,0.00009429988,0.00077935826,0.00058738294,0.00035359306],"domain_scores_gemma":[0.9939713,0.0033329509,0.0005670572,0.00080145017,0.00062595535,0.0007011782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011117985,0.0007856307,0.00071465503,0.001582021,0.0013621463,0.0026929537,0.0013079932,0.0006893024,0.016820908],"category_scores_gemma":[0.0069659953,0.00047189827,0.00062517566,0.0014375,0.0021606837,0.0031591302,0.001615072,0.0017378705,0.0018115634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091700593,0.00017946873,0.005232385,0.0006198232,0.00013849407,0.00030324367,0.00055173284,0.036259644,0.03029585,0.75740504,0.04646435,0.121632904],"study_design_scores_gemma":[0.00024672627,0.00026816563,0.007994408,0.00012486975,0.00012313551,0.0016397093,0.0002403246,0.13647749,0.029091632,0.74083006,0.08283045,0.00013294724],"about_ca_topic_score_codex":0.0011306476,"about_ca_topic_score_gemma":0.0012070604,"teacher_disagreement_score":0.016820908,"about_ca_system_score_codex":0.0023098916,"about_ca_system_score_gemma":0.0012218748,"threshold_uncertainty_score":0.056271553},"labels":[],"label_agreement":null},{"id":"W4413682142","doi":"10.1007/s00012-025-00900-z","title":"Słupecki digraphs","year":2025,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Szegedi Tudományegyetem","keywords":"Mathematics; Algebra over a field; Digraph; Pure mathematics; Combinatorics","score_opus":0.008265318919469853,"score_gpt":0.2577459259912336,"score_spread":0.24948060707176373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413682142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5005436,0.00083194626,0.3000448,0.0012014911,0.00024460643,0.0003957758,0.0030539425,0.0016408934,0.19204292],"genre_scores_gemma":[0.86849135,0.0005082848,0.06485531,0.00029887602,0.000056895642,0.00027915023,0.002625399,0.000183567,0.062701076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910444,0.000104784136,0.00009201994,0.00031077975,0.00013369365,0.0002541537],"domain_scores_gemma":[0.9991142,0.00026548436,0.00010500855,0.00014381959,0.00018369948,0.00018775491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047964024,0.00041180156,0.00048096638,0.0023108523,0.0027932476,0.0030683358,0.00062637747,0.0005213825,0.011671847],"category_scores_gemma":[0.0013002915,0.000546447,0.00072534435,0.0014147055,0.002489519,0.0043398966,0.0024166189,0.0013793921,0.0017986251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046815858,0.000021953703,0.000647651,0.00004697534,0.000010515667,0.00014589836,0.00046541617,0.0006806229,0.0016750892,0.98319536,0.0010517562,0.012012013],"study_design_scores_gemma":[0.000033392873,0.000073407005,0.0020525723,0.00008890655,0.00006263087,0.0005267064,0.0014315173,0.0088943485,0.008699392,0.9013748,0.07669068,0.00007164638],"about_ca_topic_score_codex":0.003465231,"about_ca_topic_score_gemma":0.005550738,"teacher_disagreement_score":0.011671847,"about_ca_system_score_codex":0.0022440464,"about_ca_system_score_gemma":0.0008571632,"threshold_uncertainty_score":0.039046228},"labels":[],"label_agreement":null},{"id":"W4413812704","doi":"10.4171/owr/2025/1","title":"Graph Theory","year":2025,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Georgia Institute of Technology; Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Georgia State University; National Science Foundation","keywords":"Graph theory; Computer science; Graph; Focus (optics); Theoretical computer science; Mathematics; Combinatorics; Physics","score_opus":0.0126850914085572,"score_gpt":0.2899782201441894,"score_spread":0.27729312873563217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413812704","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060914345,0.06428647,0.24929373,0.043824174,0.010787317,0.0003014731,0.0031078998,0.0012992258,0.6210083],"genre_scores_gemma":[0.30042535,0.0721024,0.22134373,0.021283722,0.016291192,0.0012483068,0.007703375,0.0013270617,0.35827494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762374,0.0008025175,0.00014520099,0.0006844496,0.0005727955,0.00017134495],"domain_scores_gemma":[0.9974636,0.0012075595,0.0000823619,0.0005920117,0.0004959196,0.00015845768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023601085,0.000966537,0.0011811515,0.0024280353,0.0024404956,0.005406385,0.0017160876,0.0019167775,0.03292721],"category_scores_gemma":[0.004655552,0.00074646634,0.0013595582,0.0024942886,0.0035862664,0.0053300816,0.002881366,0.0054559177,0.00982625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013789082,0.000012715643,0.00012344979,0.00016798366,0.0000189062,0.00004105337,0.00017316434,0.0006326949,0.00022971263,0.9067685,0.058508657,0.033309355],"study_design_scores_gemma":[0.000008024712,0.000009033463,0.000148862,0.00008264294,0.000007006985,0.00009671875,0.000048985756,0.0010879568,0.00012308324,0.7807103,0.21766862,0.00000871114],"about_ca_topic_score_codex":0.0025373986,"about_ca_topic_score_gemma":0.0020984015,"teacher_disagreement_score":0.03292721,"about_ca_system_score_codex":0.0039031066,"about_ca_system_score_gemma":0.0015383572,"threshold_uncertainty_score":0.11015248},"labels":[],"label_agreement":null},{"id":"W4413876268","doi":"10.4153/s0008414x2510151x","title":"On the <i>f</i> -vectors of flow polytopes for the complete graph","year":2025,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université du Québec à Montréal; National Science Foundation","keywords":"Mathematics; Polytope; Combinatorics; Graph; Flow (mathematics); Geometry","score_opus":0.036441054005416786,"score_gpt":0.2770330724317701,"score_spread":0.24059201842635333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413876268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7030182,0.0006475064,0.23394878,0.0007300321,0.00013965539,0.00015630998,0.001262973,0.00026543302,0.05983105],"genre_scores_gemma":[0.92119145,0.00076255726,0.05061903,0.00023053394,0.00032737118,0.00028327157,0.0018531026,0.00023767931,0.024495037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996363,0.00006871624,0.0000110680285,0.00008234679,0.000106283835,0.00009528329],"domain_scores_gemma":[0.9989248,0.00045294059,0.0001762377,0.000054639022,0.00016752451,0.00022383865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005025982,0.00074636214,0.00064462767,0.0024219402,0.001418316,0.0024085566,0.00085781683,0.00081285485,0.010509253],"category_scores_gemma":[0.002016435,0.00041269817,0.0007651118,0.0007997711,0.0018950476,0.0017606415,0.00073852704,0.0018400353,0.0010904117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046155357,0.000044107404,0.00087421626,0.000052812415,0.000009323572,0.0001233517,0.00015450655,0.017679378,0.0013098095,0.9659945,0.002715284,0.010996603],"study_design_scores_gemma":[0.000027488033,0.000060290924,0.0017175919,0.00005720503,0.000009573222,0.00023200852,0.00022981584,0.10859505,0.0013471084,0.8802701,0.0074008377,0.000052866464],"about_ca_topic_score_codex":0.0037573264,"about_ca_topic_score_gemma":0.0022375486,"teacher_disagreement_score":0.010509253,"about_ca_system_score_codex":0.0013711394,"about_ca_system_score_gemma":0.0005152608,"threshold_uncertainty_score":0.035156965},"labels":[],"label_agreement":null},{"id":"W4413980878","doi":"10.61091/ojac20-02","title":"A note on plane trees with decreasing labels","year":2025,"lang":"en","type":"article","venue":"Online Journal of Analytic Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Plane (geometry); Computer science; Mathematics; Geometry","score_opus":0.014187209113237112,"score_gpt":0.31373094282946057,"score_spread":0.29954373371622345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413980878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07175481,0.004312529,0.8807017,0.002312739,0.0003877608,0.00003926361,0.00027151147,0.0009617654,0.03925795],"genre_scores_gemma":[0.49600282,0.006633944,0.4767435,0.0017286253,0.0010898239,0.00024246119,0.00065378804,0.0008734154,0.016031535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812526,0.00062728836,0.000059517046,0.00042398233,0.0005116823,0.0002523293],"domain_scores_gemma":[0.98796904,0.008811281,0.00064796314,0.0012874801,0.00089865254,0.00038552293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020096898,0.00083078013,0.0008291802,0.0014694107,0.00079227594,0.0016299712,0.0014949313,0.0010372625,0.0047492706],"category_scores_gemma":[0.017726125,0.00040036102,0.000599469,0.0020363687,0.0020918986,0.0043180855,0.0016981524,0.0040674056,0.0015485036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033003165,0.000121436075,0.0030799394,0.000295305,0.000051258383,0.00038993184,0.0005916084,0.11665048,0.031651974,0.6989154,0.014135543,0.13378702],"study_design_scores_gemma":[0.000029454313,0.00018381736,0.0024656034,0.00012807068,0.00004792328,0.00054880616,0.00020940656,0.30752137,0.01196494,0.64431286,0.032498885,0.00008889183],"about_ca_topic_score_codex":0.0025797212,"about_ca_topic_score_gemma":0.002625025,"teacher_disagreement_score":0.0047492706,"about_ca_system_score_codex":0.0013931202,"about_ca_system_score_gemma":0.0005113483,"threshold_uncertainty_score":0.015887856},"labels":[],"label_agreement":null},{"id":"W4414056840","doi":"10.1016/j.ic.2025.105355","title":"Polynomial Turing compressions for some graph problems parameterized by modular-width","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"China Scholarship Council","keywords":"Parameterized complexity; Turing machine; Oracle; Time complexity; Polynomial; Set (abstract data type); Turing; Kernelization","score_opus":0.015192233473038146,"score_gpt":0.2912174323092757,"score_spread":0.27602519883623755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414056840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5436698,0.0038047202,0.3436227,0.028147088,0.0006474069,0.00080187427,0.0038646967,0.006650961,0.06879069],"genre_scores_gemma":[0.9125418,0.0009656089,0.069023795,0.0014181051,0.0007964573,0.00063380104,0.0019434923,0.0012326769,0.011444391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948395,0.0012538541,0.00028059538,0.0011751864,0.0011499354,0.0013010142],"domain_scores_gemma":[0.9473732,0.041008566,0.002200941,0.006203622,0.0011167516,0.0020970497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004726615,0.0019871613,0.003105248,0.0024958146,0.0035619657,0.00681691,0.0059111,0.00433733,0.01951833],"category_scores_gemma":[0.045758374,0.0013998295,0.0037284635,0.004870409,0.005719181,0.02109109,0.005881699,0.010900893,0.0020617838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028454503,0.0010316541,0.0035762852,0.000970311,0.00022540631,0.00033787222,0.001438474,0.11207621,0.0063572344,0.7612882,0.029343927,0.08050904],"study_design_scores_gemma":[0.00026944105,0.000110296016,0.0007477332,0.00007744798,0.00012458346,0.00019048667,0.00021376017,0.18810229,0.0039317757,0.8036875,0.0024844585,0.00006020861],"about_ca_topic_score_codex":0.0017414229,"about_ca_topic_score_gemma":0.0036390855,"teacher_disagreement_score":0.01951833,"about_ca_system_score_codex":0.0067947763,"about_ca_system_score_gemma":0.004718922,"threshold_uncertainty_score":0.0652954},"labels":[],"label_agreement":null},{"id":"W4414056851","doi":"10.1016/j.jctb.2025.08.003","title":"Tree independence number II. Three-path-configurations","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Division of Computing and Communication Foundations; Ministry of Colleges and Universities; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; U.S. Air Force; Alfred P. Sloan Foundation","keywords":"Tree (set theory); Independence number; Independence (probability theory); Class (philosophy); Graph","score_opus":0.01070042686151122,"score_gpt":0.2865333438356005,"score_spread":0.27583291697408924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414056851","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66321623,0.0016572545,0.21514812,0.005581805,0.00013924061,0.00028413674,0.007415848,0.0019591902,0.10459813],"genre_scores_gemma":[0.96298194,0.0005780189,0.027400833,0.00040192757,0.00007592203,0.00017030926,0.0024063778,0.00017831191,0.0058063935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892056,0.000119091164,0.000046046818,0.000317386,0.00034220674,0.00025467147],"domain_scores_gemma":[0.9926843,0.005146897,0.0006807371,0.0005850492,0.00040077418,0.000502175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005752452,0.0004893589,0.0004798472,0.0008074051,0.0014605124,0.0024186599,0.0012937444,0.00092367287,0.011437172],"category_scores_gemma":[0.0066588023,0.0005232979,0.00061478594,0.0021766194,0.0017210599,0.003418067,0.0011816877,0.0027963147,0.0013807807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018103917,0.00057221734,0.028019287,0.0012849892,0.00015887045,0.0010897083,0.0008528132,0.1959147,0.07331741,0.5075743,0.056459498,0.13294585],"study_design_scores_gemma":[0.0001386344,0.00017653622,0.011727062,0.0000937786,0.000110501045,0.0018907565,0.00024428722,0.24050945,0.03972807,0.6850177,0.020285847,0.000077389304],"about_ca_topic_score_codex":0.0027024471,"about_ca_topic_score_gemma":0.0027058765,"teacher_disagreement_score":0.011437172,"about_ca_system_score_codex":0.00208305,"about_ca_system_score_gemma":0.0012312845,"threshold_uncertainty_score":0.038261175},"labels":[],"label_agreement":null},{"id":"W4414243250","doi":"10.5802/igt.10","title":"Product Structure of Graph Classes with Strongly Sublinear Separators","year":2025,"lang":"lv","type":"article","venue":"Innovations in Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Oxford; Grantová Agentura České Republiky; Merton College, University of Oxford","keywords":"Sublinear function; Treewidth; Graph; Bounded function; Line graph; Voltage graph; Graph property; Graph factorization; Clique-width; Distance-hereditary graph","score_opus":0.015296409847241087,"score_gpt":0.3071461678948458,"score_spread":0.2918497580476047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414243250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8165065,0.00016233724,0.16640364,0.0003699129,0.000024159048,0.000059919974,0.00079019915,0.0005995413,0.015083831],"genre_scores_gemma":[0.969068,0.00011955976,0.020486347,0.000083470855,0.000040944884,0.00008553274,0.0014779549,0.0001798725,0.00845844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986935,0.00016688225,0.00007580173,0.00052535045,0.00029874052,0.00023976789],"domain_scores_gemma":[0.9949201,0.0016998436,0.0010479761,0.00083673216,0.0007163365,0.00077898655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007212692,0.00050594314,0.0005929673,0.0014008752,0.0012772547,0.0022290524,0.0010023009,0.00063754385,0.009617088],"category_scores_gemma":[0.0029435458,0.0006506376,0.0009942799,0.0012589266,0.0024274983,0.0053454386,0.0019489615,0.0012225086,0.000912862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000262592,0.00011348324,0.009975062,0.00014065472,0.00006687401,0.00045349184,0.0013173115,0.0072584166,0.009107008,0.9544336,0.001888193,0.014983354],"study_design_scores_gemma":[0.00008235178,0.00021318441,0.0062969164,0.000045129953,0.00011106697,0.0009116366,0.0007552766,0.07141559,0.017246798,0.8898596,0.013006336,0.000055938166],"about_ca_topic_score_codex":0.0013511028,"about_ca_topic_score_gemma":0.0014335348,"teacher_disagreement_score":0.009617088,"about_ca_system_score_codex":0.0014084821,"about_ca_system_score_gemma":0.0005327074,"threshold_uncertainty_score":0.032172382},"labels":[],"label_agreement":null},{"id":"W4414474364","doi":"10.1016/j.disc.2025.114809","title":"On the structure of perfectly divisible graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique number; Induced subgraph; Graph; Perfect graph; Divisibility rule; Bounded function; Split graph; Clique graph","score_opus":0.014469867531054576,"score_gpt":0.29108378401340207,"score_spread":0.2766139164823475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414474364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78242785,0.0008089427,0.17723551,0.0022441624,0.00005927663,0.00011081063,0.0011268662,0.00049389777,0.03549259],"genre_scores_gemma":[0.95938486,0.00039627397,0.03235327,0.0002620273,0.00007552405,0.00006211574,0.0010389945,0.000079916856,0.0063470206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936646,0.00010911559,0.000033917197,0.00023697752,0.00014103352,0.00011239649],"domain_scores_gemma":[0.9952981,0.0021409402,0.00083845865,0.00092421786,0.00038858977,0.00040973607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043682964,0.00030253408,0.00041554627,0.0010787041,0.0014372187,0.0017980472,0.0012136346,0.0007515032,0.00434424],"category_scores_gemma":[0.003683435,0.00057922077,0.000347223,0.0013763634,0.002198736,0.005090442,0.002013952,0.0014975687,0.00038367856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029986846,0.000079077225,0.005682822,0.00024091112,0.00003609391,0.00061832543,0.0017567782,0.03114479,0.014051385,0.8990473,0.004572006,0.042470615],"study_design_scores_gemma":[0.00001942989,0.000042547472,0.0016239872,0.000038604852,0.000014052734,0.0003796752,0.00030230192,0.033088583,0.002554776,0.95417917,0.0077379993,0.000018760358],"about_ca_topic_score_codex":0.0010823656,"about_ca_topic_score_gemma":0.0011378651,"teacher_disagreement_score":0.00434424,"about_ca_system_score_codex":0.0011159584,"about_ca_system_score_gemma":0.00043560672,"threshold_uncertainty_score":0.014532983},"labels":[],"label_agreement":null},{"id":"W4414537028","doi":"10.1007/s00208-025-03293-5","title":"A unified Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups","year":2025,"lang":"en","type":"article","venue":"Mathematische Annalen","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; Institute for Basic Science; Javna Agencija za Raziskovalno Dejavnost RS; National Research Foundation of Korea; National Research Foundation","keywords":"Abelian group; Bounded function; Vertex (graph theory); Duality (order theory); Modulo; Set (abstract data type)","score_opus":0.022734948312030764,"score_gpt":0.3052306350787034,"score_spread":0.28249568676667264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414537028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25230515,0.0055175284,0.617536,0.005299543,0.0006448328,0.0002956661,0.0015006745,0.0008331187,0.11606751],"genre_scores_gemma":[0.87450576,0.0033607173,0.09485215,0.0014513507,0.0012694602,0.00056333,0.0009811895,0.00033452868,0.022681495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981596,0.000447912,0.00011589567,0.0005253729,0.0004858736,0.00026543182],"domain_scores_gemma":[0.9957723,0.0021404054,0.00055371237,0.0005262869,0.0005952151,0.00041203506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025065492,0.00079682487,0.0013486043,0.005164325,0.003027288,0.0051560537,0.0019319602,0.0020548746,0.008632267],"category_scores_gemma":[0.007245361,0.0007605796,0.0017431563,0.0038436481,0.0042407694,0.009537591,0.003501265,0.0024809004,0.0013308333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024629826,0.000007354892,0.00021413411,0.000031099557,0.000006006788,0.00004629995,0.00013057787,0.001374242,0.00033579834,0.99338055,0.0009104828,0.0035388703],"study_design_scores_gemma":[0.000015400796,0.000016311562,0.00015119715,0.00002349434,0.000009268733,0.00009060998,0.0000613178,0.009558675,0.00036782207,0.983115,0.0065772473,0.000013642553],"about_ca_topic_score_codex":0.0012543506,"about_ca_topic_score_gemma":0.00081909064,"teacher_disagreement_score":0.008632267,"about_ca_system_score_codex":0.0027943833,"about_ca_system_score_gemma":0.00091247633,"threshold_uncertainty_score":0.028877854},"labels":[],"label_agreement":null},{"id":"W4414581267","doi":"10.61091/jcmcc127-15","title":"A study on roman domination lower deg-centric graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Domination analysis; Upper and lower bounds; Graph theory; Dominating set; Connectivity","score_opus":0.0164604518090323,"score_gpt":0.30108273144938125,"score_spread":0.2846222796403489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8282388,0.0009426233,0.0809546,0.00080027786,0.000049481296,0.00007620994,0.00067262317,0.00014884741,0.088116564],"genre_scores_gemma":[0.97570103,0.0007029972,0.014125066,0.00016390356,0.00006624804,0.000047397065,0.00058723724,0.00004696677,0.008559177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941814,0.00012836538,0.000024208206,0.00019247096,0.0001294961,0.000107318665],"domain_scores_gemma":[0.997686,0.0011165811,0.00041210174,0.00023949952,0.00025559007,0.00029016778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005300041,0.00034827972,0.00043402662,0.001710374,0.0015197376,0.0015162561,0.00080584554,0.00035055302,0.0065263105],"category_scores_gemma":[0.0030767007,0.00029715023,0.00042657123,0.0022661402,0.0012303377,0.0022945188,0.00076047675,0.0009821389,0.00042112224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013581332,0.00007982941,0.009365558,0.00024081879,0.00003271322,0.000344146,0.00089558266,0.013303813,0.007399379,0.93606746,0.003802542,0.028332395],"study_design_scores_gemma":[0.000072032446,0.00022614573,0.01575978,0.00013283573,0.00013366605,0.0022475552,0.001076008,0.104775414,0.012043405,0.80712545,0.056341905,0.00006587181],"about_ca_topic_score_codex":0.0013291136,"about_ca_topic_score_gemma":0.0015572617,"teacher_disagreement_score":0.0065263105,"about_ca_system_score_codex":0.0013919491,"about_ca_system_score_gemma":0.0005116145,"threshold_uncertainty_score":0.021832705},"labels":[],"label_agreement":null},{"id":"W4414581271","doi":"10.61091/jcmcc127-06","title":"The {2}-domination in rooted product graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Vertex (graph theory); Product (mathematics); Graph product; Line graph; Block graph; Connectivity","score_opus":0.012288716764623476,"score_gpt":0.28850146660855935,"score_spread":0.2762127498439359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32328522,0.0008049962,0.53636515,0.0015434928,0.00020299117,0.0001545734,0.0016284804,0.0008839931,0.13513112],"genre_scores_gemma":[0.8389274,0.0006384194,0.082853295,0.0005643321,0.0001766369,0.00017951283,0.001921649,0.00043195972,0.074306816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999156,0.00017082549,0.00004678842,0.0002897518,0.00019528632,0.00014124716],"domain_scores_gemma":[0.9983558,0.00070465915,0.00017045962,0.00019574388,0.00034963473,0.00022365207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075562665,0.0004942719,0.0004115883,0.0009758664,0.0011995307,0.0020238515,0.0008030537,0.0006315091,0.009562437],"category_scores_gemma":[0.0028146114,0.00053263456,0.0008124584,0.0012191667,0.001649235,0.0034610722,0.0013529544,0.001213392,0.001334134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008893143,0.00004882246,0.0007887951,0.000113827606,0.000023217697,0.00019937247,0.0006001226,0.008972845,0.0040563503,0.93374443,0.008095932,0.043267343],"study_design_scores_gemma":[0.00002862309,0.000050963237,0.00075773185,0.00003986015,0.000021565738,0.000343122,0.00013468732,0.041543383,0.002920708,0.93083686,0.023293916,0.000028619814],"about_ca_topic_score_codex":0.0038278115,"about_ca_topic_score_gemma":0.0037671512,"teacher_disagreement_score":0.009562437,"about_ca_system_score_codex":0.0015576362,"about_ca_system_score_gemma":0.0008288737,"threshold_uncertainty_score":0.031989515},"labels":[],"label_agreement":null},{"id":"W4414581273","doi":"10.61091/jcmcc127-20","title":"Assigning airport gates during a pandemic using tolerance graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hrvatska Zaklada za Znanost","keywords":"Generalization; Scheduling (production processes); Graph; Graph coloring; Interval (graph theory); Clique","score_opus":0.020069160716700386,"score_gpt":0.2993154395757704,"score_spread":0.27924627885907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25903726,0.00014419894,0.73388946,0.00042770559,0.00010929736,0.0002681495,0.00034541846,0.0009050814,0.004873565],"genre_scores_gemma":[0.793608,0.00016520881,0.20307213,0.00010755468,0.00003753299,0.00012413588,0.00058911904,0.00011778487,0.002178557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994567,0.0001523947,0.000022218119,0.00013584002,0.00006592875,0.00016703733],"domain_scores_gemma":[0.9988065,0.0005020379,0.00019697817,0.0001464471,0.00014928667,0.0001987506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006332268,0.0008155937,0.0007159458,0.0007847124,0.001113366,0.00079454266,0.0012726475,0.0008302887,0.0030870936],"category_scores_gemma":[0.0026738732,0.00041425883,0.000911861,0.0010158825,0.00064050435,0.0014831538,0.0009839672,0.0007147112,0.00028105377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028769506,0.00014466354,0.003573401,0.00014654826,0.00004184332,0.00021850753,0.0002026113,0.90149933,0.0058652046,0.015118753,0.0022237638,0.07067773],"study_design_scores_gemma":[0.000033654043,0.00013807292,0.0010067254,0.000013965818,0.000034060555,0.000091928414,0.00027972553,0.9706542,0.0033189892,0.022132942,0.0022749663,0.000020703463],"about_ca_topic_score_codex":0.00790172,"about_ca_topic_score_gemma":0.0075681857,"teacher_disagreement_score":0.00790172,"about_ca_system_score_codex":0.0010907177,"about_ca_system_score_gemma":0.0014117567,"threshold_uncertainty_score":0.015711486},"labels":[],"label_agreement":null},{"id":"W4414581280","doi":"10.61091/jcmcc127-17","title":"\\(\\left(s,s+1,s+1,\\dots\\right)\\)-packing colorings and \\(\\left(1,s,s,\\dots\\right)\\)-packing colorings and d-distance colorings of distance graphs \\(D(1,t)\\)","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Upper and lower bounds; Graph; Vertex (graph theory); Bound graph; Chromatic scale; Wheel graph; Windmill graph; Graph power","score_opus":0.011218061044913212,"score_gpt":0.2712087827179902,"score_spread":0.259990721673077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15586054,0.00036076974,0.54905975,0.001419046,0.0014779868,0.0003292442,0.003354536,0.006833839,0.2813043],"genre_scores_gemma":[0.4155901,0.00043758072,0.40467027,0.0009488583,0.00012257813,0.00035459895,0.0047840374,0.0029807119,0.17011124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999616,0.000041231713,0.000019381652,0.00012549105,0.000079798156,0.0001179455],"domain_scores_gemma":[0.9993575,0.00009809742,0.00006781855,0.00022834016,0.00012562165,0.00012274018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021348598,0.00064458867,0.00031885592,0.00045698322,0.0009908283,0.0013861227,0.0007720539,0.00060301414,0.03848986],"category_scores_gemma":[0.0008157332,0.00044249045,0.0006124732,0.0009900017,0.0012016572,0.0015679648,0.0015140516,0.0014095824,0.008959564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000951975,0.00026004793,0.0017546719,0.00035610807,0.00003324694,0.00062067976,0.0006380889,0.015147914,0.060040258,0.56019187,0.105881505,0.25412372],"study_design_scores_gemma":[0.00016933597,0.00037749042,0.0055742934,0.00012697671,0.000046529392,0.0014377087,0.0010071038,0.10787987,0.09656101,0.47595307,0.31073537,0.00013128457],"about_ca_topic_score_codex":0.003594412,"about_ca_topic_score_gemma":0.005134357,"teacher_disagreement_score":0.03848986,"about_ca_system_score_codex":0.00086686225,"about_ca_system_score_gemma":0.00053933513,"threshold_uncertainty_score":0.12876135},"labels":[],"label_agreement":null},{"id":"W4414581293","doi":"10.61091/jcmcc127-16","title":"On the connected coalition number of graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Natural Science Foundation of Shanxi Province; National Natural Science Foundation of China","keywords":"Cartesian product; Connectivity; Strongly connected component; Dominating set; Partition (number theory); Vertex (graph theory); Lexicographical order; Domination analysis","score_opus":0.016053839097720617,"score_gpt":0.29850830388490146,"score_spread":0.28245446478718084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22927123,0.0044179615,0.469331,0.010270487,0.0010236467,0.00042439817,0.0029605017,0.0009620149,0.28133878],"genre_scores_gemma":[0.81130767,0.0036006053,0.11052902,0.001514298,0.0010322471,0.0009940153,0.0030793643,0.0006114433,0.06733138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984669,0.00049630867,0.000069221154,0.00036128578,0.0003847808,0.000221366],"domain_scores_gemma":[0.99334234,0.00442702,0.00052725396,0.0004674295,0.00051112566,0.0007248333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018568601,0.0013472975,0.0014191138,0.0038827588,0.0025152687,0.003372182,0.0023800079,0.0013306184,0.015883455],"category_scores_gemma":[0.014199893,0.0007014016,0.0014154864,0.0044270977,0.0035893486,0.007267692,0.003828368,0.0035170075,0.0015741993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011627409,0.00003748886,0.0005640616,0.00015648062,0.000031134652,0.00007936134,0.00028793924,0.0130196605,0.00043337364,0.95951086,0.0092205,0.016542826],"study_design_scores_gemma":[0.000034573655,0.000021917996,0.0003012703,0.00004633385,0.000024490406,0.000074455376,0.00008628231,0.049412772,0.00026953954,0.94072866,0.008986859,0.000012929078],"about_ca_topic_score_codex":0.0032201293,"about_ca_topic_score_gemma":0.0027547195,"teacher_disagreement_score":0.015883455,"about_ca_system_score_codex":0.003662614,"about_ca_system_score_gemma":0.0014305046,"threshold_uncertainty_score":0.053135395},"labels":[],"label_agreement":null},{"id":"W4414631978","doi":"10.61091/ars164-09","title":"Nonsplit graphs with split maximal edge induced subgraphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Board for Higher Mathematics","keywords":"Graph; Induced subgraph; Enhanced Data Rates for GSM Evolution; Independent set; Set (abstract data type); Line graph","score_opus":0.014494523322379722,"score_gpt":0.2721521042521349,"score_spread":0.25765758092975516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414631978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8901429,0.0002891697,0.07448807,0.00022379166,0.000026698834,0.00011493866,0.0017355982,0.00042034677,0.032558378],"genre_scores_gemma":[0.9789898,0.0002047518,0.013416611,0.000069225855,0.00001767841,0.00006590212,0.002483869,0.00005456594,0.00469771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971527,0.00003800194,0.00001958496,0.000072444294,0.00006840728,0.00008634239],"domain_scores_gemma":[0.9984688,0.0005531029,0.0003719737,0.00028443508,0.0001578943,0.00016367038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023092225,0.00046982325,0.00029916962,0.00075519364,0.0011220725,0.0011523097,0.0006248525,0.0004610311,0.007480043],"category_scores_gemma":[0.0010440144,0.00029579463,0.00050555676,0.0009614744,0.00092998374,0.0020118419,0.0011525885,0.00063616363,0.00073168083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020108905,0.000437333,0.028974919,0.0012262979,0.00019655618,0.0047215596,0.0016322501,0.030769778,0.095305204,0.69491416,0.013686968,0.12612404],"study_design_scores_gemma":[0.00016203092,0.0005022584,0.029119892,0.00013300644,0.00025231307,0.0051005846,0.0015249463,0.07727257,0.06463156,0.7766801,0.044543725,0.00007699291],"about_ca_topic_score_codex":0.0005369605,"about_ca_topic_score_gemma":0.0011685621,"teacher_disagreement_score":0.007480043,"about_ca_system_score_codex":0.0004212397,"about_ca_system_score_gemma":0.00030891126,"threshold_uncertainty_score":0.025023282},"labels":[],"label_agreement":null},{"id":"W4414785425","doi":"10.37236/13199","title":"Degree-Similar Graphs","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shandong Province; University of Waterloo; China Postdoctoral Science Foundation","keywords":"Degree matrix; Invertible matrix; Adjacency matrix; Laplacian matrix; Diagonal matrix; Degree (music); Converse; Diagonal; Matrix (chemical analysis)","score_opus":0.013921917469359935,"score_gpt":0.2820883461614702,"score_spread":0.26816642869211027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414785425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4030089,0.0008194453,0.5084274,0.0017311488,0.00028235323,0.00036339698,0.0019129615,0.0006077495,0.082846686],"genre_scores_gemma":[0.90219826,0.0007726051,0.069505,0.00084368954,0.00020595347,0.00026957245,0.0017257739,0.00016353406,0.024315644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986706,0.0003015709,0.000049291357,0.0004924355,0.0002713412,0.00021485052],"domain_scores_gemma":[0.99696714,0.0009828063,0.0005576601,0.00062513526,0.00051141303,0.00035590745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005243117,0.00055406836,0.0005186415,0.0016814828,0.001482558,0.001591288,0.0011609304,0.00092693756,0.008005981],"category_scores_gemma":[0.004551307,0.00042559463,0.00072605704,0.0015753552,0.0015745274,0.0027960541,0.00150667,0.0010825889,0.0012902755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007527216,0.00004752755,0.0010755988,0.00007773935,0.000038296137,0.00034720503,0.0005635923,0.005411489,0.0048368797,0.9664216,0.0045074676,0.016597243],"study_design_scores_gemma":[0.00002597118,0.000034465203,0.0010631355,0.000022526738,0.0000325289,0.0007575984,0.00025843948,0.01812288,0.0018786163,0.9580748,0.019698689,0.000030256144],"about_ca_topic_score_codex":0.001008357,"about_ca_topic_score_gemma":0.0013242295,"teacher_disagreement_score":0.008005981,"about_ca_system_score_codex":0.00091731385,"about_ca_system_score_gemma":0.00046745967,"threshold_uncertainty_score":0.026782632},"labels":[],"label_agreement":null},{"id":"W4414962663","doi":"10.1016/j.jctb.2025.09.005","title":"Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Bipartite graph; Robertson–Seymour theorem; Minor (academic); Graph; Set (abstract data type); Complete bipartite graph","score_opus":0.02026782751886669,"score_gpt":0.29336489469822086,"score_spread":0.27309706717935417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414962663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55761915,0.0007041034,0.39321822,0.0009258182,0.000059167436,0.00014260107,0.0011930257,0.00045610368,0.04568176],"genre_scores_gemma":[0.9078026,0.0004247598,0.07963009,0.00020505146,0.00008479405,0.00012186795,0.0018703659,0.00011144149,0.009748981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969363,0.00006960779,0.000013301245,0.0000920003,0.00007247134,0.000059033177],"domain_scores_gemma":[0.998872,0.00043280257,0.00026157527,0.00017752945,0.00010799359,0.00014810383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030243807,0.0003007018,0.00030071323,0.0006370734,0.0005436733,0.00090246723,0.0004715698,0.00035978106,0.0038583938],"category_scores_gemma":[0.0013603431,0.00033612762,0.000683015,0.0008137073,0.00082769775,0.0015299639,0.0009827146,0.00094662776,0.00048431373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009371348,0.00008353288,0.0021249729,0.00013435197,0.000028853854,0.00044710847,0.00053297664,0.011422373,0.014364516,0.9478951,0.003621957,0.01925053],"study_design_scores_gemma":[0.000031641972,0.000048354417,0.0019929707,0.000028090502,0.000025250718,0.00062538404,0.0001954768,0.050177068,0.0042826924,0.93078494,0.011795242,0.000012841467],"about_ca_topic_score_codex":0.00073693506,"about_ca_topic_score_gemma":0.0011481658,"teacher_disagreement_score":0.0038583938,"about_ca_system_score_codex":0.0006897029,"about_ca_system_score_gemma":0.0002450431,"threshold_uncertainty_score":0.012907565},"labels":[],"label_agreement":null},{"id":"W4415210014","doi":"10.1051/ita/2025010","title":"Superfluous Arcs and Confluent Reductions in the Minimum Feedback Vertex Set Problem","year":2025,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Trois-Rivières; Université du Québec à Montréal","funders":"","keywords":"Digraph; Feedback arc set; Vertex (graph theory); Feedback vertex set; Bounded function; Directed graph; Graph; Reduction (mathematics)","score_opus":0.010358751724870477,"score_gpt":0.28663921932323977,"score_spread":0.2762804675983693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415210014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14452213,0.00036722835,0.8394155,0.0010714754,0.000056793244,0.00040966037,0.0005369643,0.0015275783,0.0120927235],"genre_scores_gemma":[0.64080375,0.00050914806,0.348602,0.00035649788,0.00008418514,0.0003900199,0.0011512502,0.0004806999,0.0076225586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981376,0.00058204826,0.000110418325,0.00045852317,0.00043492037,0.00027654026],"domain_scores_gemma":[0.9941414,0.004148943,0.00028641004,0.00085808244,0.00034764357,0.0002174728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015223237,0.0006694513,0.0008165463,0.0007985043,0.0013154736,0.0013069025,0.0013792267,0.0009012097,0.003073521],"category_scores_gemma":[0.0072044753,0.00044462146,0.001605826,0.0009029262,0.0017845774,0.003014859,0.002360167,0.0026808071,0.0005683673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007342265,0.00062888535,0.0028215505,0.0010323721,0.0001670416,0.0009796509,0.0021756706,0.34591568,0.046494134,0.38206413,0.008783706,0.2082029],"study_design_scores_gemma":[0.00013962026,0.00021996752,0.0008679825,0.00008098021,0.00012703116,0.00043166918,0.0005580932,0.3311479,0.037010204,0.6179704,0.011393226,0.000052915802],"about_ca_topic_score_codex":0.0027572603,"about_ca_topic_score_gemma":0.0043811114,"teacher_disagreement_score":0.003073521,"about_ca_system_score_codex":0.0013104203,"about_ca_system_score_gemma":0.0018586074,"threshold_uncertainty_score":0.01028192},"labels":[],"label_agreement":null},{"id":"W4415525844","doi":"10.61091/jcmcc128-05","title":"Backward edge-preserving maps between graphs","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Intersection graph; Vertex (graph theory); Line graph; Homomorphism; Class (philosophy); Graph homomorphism; Comparability graph","score_opus":0.023166008838318906,"score_gpt":0.3027298115669463,"score_spread":0.27956380272862735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415525844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4798762,0.00070562214,0.4749832,0.00052682793,0.00023789993,0.0001562941,0.00046076693,0.00046606894,0.042587053],"genre_scores_gemma":[0.9179674,0.0005660199,0.068538465,0.00020332767,0.00019956048,0.00013239418,0.00034769744,0.00014957211,0.011895607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994779,0.0001186453,0.000027844686,0.000128972,0.00014079861,0.00010582928],"domain_scores_gemma":[0.9980659,0.00082095,0.00025249485,0.00032654297,0.00028350935,0.00025057365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007059076,0.00047347706,0.00032471714,0.00179201,0.0009961596,0.0011922955,0.0007242516,0.0006035454,0.003396401],"category_scores_gemma":[0.0028792021,0.0002849178,0.00064166525,0.0007993033,0.0015971009,0.0038146246,0.001957776,0.0013572876,0.0005485527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058601716,0.00005505384,0.0010427053,0.00006911742,0.000014666799,0.00032071932,0.0006009308,0.0039823954,0.009218448,0.96311384,0.0008935691,0.02062992],"study_design_scores_gemma":[0.000015402436,0.00010121178,0.0008419688,0.000023362287,0.000016669403,0.0006038104,0.00024143123,0.014707077,0.006596232,0.96487033,0.011956946,0.0000254571],"about_ca_topic_score_codex":0.00030835014,"about_ca_topic_score_gemma":0.00022480721,"teacher_disagreement_score":0.003396401,"about_ca_system_score_codex":0.00041237354,"about_ca_system_score_gemma":0.0003737062,"threshold_uncertainty_score":0.011362076},"labels":[],"label_agreement":null},{"id":"W4415525854","doi":"10.61091/jcmcc128-04","title":"On star polynomials of digraphs and their applications to domination","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Digraph; Directed graph; Macdonald polynomials; Orthogonal polynomials; A* search algorithm; Difference polynomials","score_opus":0.01529881721057274,"score_gpt":0.29956420065080497,"score_spread":0.2842653834402322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415525854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08476017,0.0027936685,0.8131688,0.0021630868,0.00038749143,0.0001484835,0.0013649086,0.000465113,0.09474837],"genre_scores_gemma":[0.7653864,0.007067893,0.16479713,0.0010958357,0.0011510674,0.00038435947,0.0014751329,0.000457031,0.058185097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897087,0.0002929554,0.00006589356,0.00023860276,0.00022598474,0.00020573437],"domain_scores_gemma":[0.99499077,0.0034071328,0.00044314703,0.00021902354,0.0005450417,0.00039496997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015919071,0.0010403091,0.0010522116,0.0032223894,0.0017908205,0.00227255,0.0012505715,0.00087511,0.012280567],"category_scores_gemma":[0.0077700475,0.0006076918,0.0018143195,0.0058259526,0.0025384838,0.0049515953,0.002597221,0.0031270804,0.0015098009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023971808,0.000024715826,0.00032210577,0.00008237108,0.00000992856,0.00008036556,0.00031094762,0.007704235,0.00036311397,0.97308964,0.0022063595,0.015782153],"study_design_scores_gemma":[0.000020913452,0.000023183347,0.00023581389,0.000031415384,0.00001253198,0.0001144038,0.00008312131,0.0362566,0.00024484965,0.9546408,0.008314986,0.000021491738],"about_ca_topic_score_codex":0.009055983,"about_ca_topic_score_gemma":0.008973237,"teacher_disagreement_score":0.012280567,"about_ca_system_score_codex":0.0035579398,"about_ca_system_score_gemma":0.001379716,"threshold_uncertainty_score":0.04108256},"labels":[],"label_agreement":null},{"id":"W4415595910","doi":"10.1016/j.dam.2025.10.035","title":"Eternally surrounding a robber","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Multipartite; Variation (astronomy); Class (philosophy); Group (periodic table)","score_opus":0.018495355132309266,"score_gpt":0.304831071605036,"score_spread":0.2863357164727267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415595910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24151927,0.00081235595,0.6326922,0.002608136,0.00039343815,0.00023630605,0.0009719781,0.0007189076,0.12004738],"genre_scores_gemma":[0.8113373,0.00072048913,0.12845927,0.00038251202,0.00011834305,0.00020381961,0.0011516343,0.00038582474,0.057240695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856997,0.00039514582,0.000055414705,0.00047620226,0.00022636479,0.00027678013],"domain_scores_gemma":[0.9978131,0.0007195089,0.00036808779,0.0005519869,0.00021054172,0.0003367156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008659959,0.0007861018,0.00087081955,0.00052822655,0.0019977088,0.0022291108,0.0015591246,0.0014357824,0.020592798],"category_scores_gemma":[0.0044127647,0.000490135,0.000655235,0.00074529706,0.0024293833,0.006747169,0.0039653145,0.0014775385,0.0027488715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041104478,0.00014208944,0.0026488993,0.000387894,0.00006679877,0.00060382514,0.0011180454,0.06822152,0.004912904,0.83368224,0.014607539,0.073197156],"study_design_scores_gemma":[0.000066207576,0.00032777584,0.0016296519,0.00016703371,0.00007839576,0.0008526583,0.0019067737,0.11341848,0.009005042,0.7318825,0.14060095,0.00006449458],"about_ca_topic_score_codex":0.0023848212,"about_ca_topic_score_gemma":0.0029634135,"teacher_disagreement_score":0.020592798,"about_ca_system_score_codex":0.0006048797,"about_ca_system_score_gemma":0.00069656916,"threshold_uncertainty_score":0.0688898},"labels":[],"label_agreement":null},{"id":"W4415667475","doi":"10.55016/ojs/cdm.v20i2.77499","title":"About the second neighborhood conjecture for tournaments missing two stars or disjoint paths","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Disjoint sets; Vertex (graph theory); Graph; Simple (philosophy); Property (philosophy)","score_opus":0.024747095572057655,"score_gpt":0.36404841140807986,"score_spread":0.3393013158360222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8204668,0.002205502,0.09907074,0.008698113,0.0005544187,0.00007218454,0.0005092181,0.00043995245,0.06798311],"genre_scores_gemma":[0.98519945,0.00050496514,0.008203709,0.0008474546,0.00033653236,0.000050063354,0.0005200255,0.00007307888,0.0042647473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984579,0.0004003933,0.000056826204,0.00044504442,0.00030767833,0.0003322015],"domain_scores_gemma":[0.98802084,0.008332887,0.0009909332,0.0009510509,0.00088541955,0.0008190198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017923223,0.00051592937,0.0010480643,0.0007458829,0.0027887311,0.0025438755,0.0012424055,0.0019858615,0.0059464],"category_scores_gemma":[0.0116530545,0.00038648376,0.0010877154,0.0010349405,0.0031329705,0.005228055,0.0024439343,0.0029501056,0.0005381615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011443328,0.00019138114,0.0141010415,0.0003660468,0.000120671146,0.0010187811,0.00119291,0.017379183,0.005384605,0.9191059,0.015368283,0.024626935],"study_design_scores_gemma":[0.00020824376,0.00020198408,0.0035150857,0.00007445866,0.0000783738,0.0006816462,0.00071395625,0.043079715,0.0023774302,0.9392659,0.009749738,0.000053397023],"about_ca_topic_score_codex":0.002588122,"about_ca_topic_score_gemma":0.001852838,"teacher_disagreement_score":0.0059464,"about_ca_system_score_codex":0.0010977387,"about_ca_system_score_gemma":0.00061228697,"threshold_uncertainty_score":0.019892693},"labels":[],"label_agreement":null},{"id":"W4415764895","doi":"10.5614/ejgta.2025.13.2.1","title":"Maximum boundary independent broadcasts in graphs and trees","year":2025,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Boundary (topology); Graph; Upper and lower bounds; Connectivity; Tree (set theory); Order (exchange)","score_opus":0.0056193732299541655,"score_gpt":0.2739667729574518,"score_spread":0.26834739972749766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415764895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2936815,0.0024260913,0.6755324,0.001936025,0.000106645704,0.00034235566,0.001783048,0.001985071,0.022206906],"genre_scores_gemma":[0.76056963,0.0014341248,0.22710964,0.00030878227,0.00022480343,0.00039940406,0.0023523355,0.0004440443,0.007157278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985857,0.0003854565,0.00007252038,0.00030026454,0.00033338633,0.00032270045],"domain_scores_gemma":[0.9892412,0.007802361,0.0010148984,0.0009545596,0.00048112866,0.0005058898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013548648,0.00082137214,0.0012377393,0.0014160601,0.0016561616,0.0021812806,0.0019696231,0.0012425717,0.0032784613],"category_scores_gemma":[0.01166936,0.0010741876,0.0009824065,0.002450938,0.0012961229,0.005189147,0.0020136186,0.0017704589,0.00076159684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022768734,0.00039825976,0.005552018,0.0015168737,0.0002554758,0.00055200484,0.0020322832,0.4926868,0.049283255,0.23279296,0.029518869,0.18313429],"study_design_scores_gemma":[0.00021068656,0.00016740129,0.0021500594,0.00012517133,0.000107364496,0.00046334046,0.00048592157,0.64941263,0.015854444,0.32156128,0.009414429,0.00004723621],"about_ca_topic_score_codex":0.0031146975,"about_ca_topic_score_gemma":0.004561454,"teacher_disagreement_score":0.0032784613,"about_ca_system_score_codex":0.0021967127,"about_ca_system_score_gemma":0.0009696997,"threshold_uncertainty_score":0.015938342},"labels":[],"label_agreement":null},{"id":"W4415764896","doi":"10.5614/ejgta.2025.13.2.8","title":"Perfect coalition in graphs","year":2025,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Disjoint sets; Perfect graph theorem; Trivially perfect graph; Vertex (graph theory); Dominating set; Perfect graph; Partition (number theory); Perfect power","score_opus":0.005659939029547717,"score_gpt":0.28493499668852657,"score_spread":0.27927505765897886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415764896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081228256,0.011388225,0.7860597,0.0043215323,0.0007148303,0.0004862438,0.002219584,0.0010749504,0.11250663],"genre_scores_gemma":[0.755103,0.009011596,0.20728523,0.0015177367,0.0009305678,0.0006336493,0.0022831366,0.00026954248,0.022965612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731654,0.00081765314,0.00020015545,0.0006984003,0.0006013311,0.00036580337],"domain_scores_gemma":[0.9949662,0.0027685983,0.00061378366,0.0007521544,0.0004576654,0.00044150863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001839686,0.0012324901,0.0014022011,0.0026687153,0.0029098806,0.004477206,0.0017318586,0.0015827842,0.004925487],"category_scores_gemma":[0.008665362,0.0007988575,0.0010330796,0.004599078,0.004648416,0.0072263367,0.0037788134,0.0025798094,0.0012919325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038900624,0.000017096218,0.0003409381,0.00017395918,0.000025169938,0.00011329741,0.00034803897,0.00907463,0.00046856373,0.9705345,0.0044013015,0.01446365],"study_design_scores_gemma":[0.00001423664,0.000019771687,0.00015867928,0.000042778833,0.000018901068,0.00022592954,0.00013151485,0.014648476,0.00032675566,0.9623799,0.022020768,0.00001244389],"about_ca_topic_score_codex":0.0030752923,"about_ca_topic_score_gemma":0.0028294644,"teacher_disagreement_score":0.004925487,"about_ca_system_score_codex":0.003193656,"about_ca_system_score_gemma":0.0016153291,"threshold_uncertainty_score":0.023171723},"labels":[],"label_agreement":null},{"id":"W4415914271","doi":"10.28924/2291-8639-23-2025-273","title":"Extending Certified Domination: Bondage Numbers in Generalized Petersen Graphs","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Vertex (graph theory); Domination analysis; Graph; Cardinality (data modeling)","score_opus":0.015611420772718154,"score_gpt":0.35071257551925816,"score_spread":0.33510115474654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415914271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37777174,0.00098673,0.5971497,0.00068467093,0.00018648447,0.00023901754,0.00065658183,0.00044779474,0.021877289],"genre_scores_gemma":[0.92813987,0.00055388804,0.06742438,0.00016019757,0.00013524639,0.00016618242,0.00031368542,0.00007501108,0.0030316124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979096,0.00040532576,0.00011934326,0.000641655,0.00067181856,0.00025230032],"domain_scores_gemma":[0.99393797,0.0032216534,0.000900793,0.0008646569,0.000715943,0.00035909456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014994157,0.00063600694,0.0006357733,0.0015967216,0.0011494084,0.0018555914,0.0010373584,0.00082063564,0.0019364478],"category_scores_gemma":[0.010168875,0.00033531687,0.00067394896,0.0016531936,0.0022732844,0.0054396624,0.0018770053,0.0014219913,0.00023124415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045996998,0.00012535097,0.0070730327,0.00036136457,0.000086000844,0.0004898643,0.0008852858,0.12367995,0.020746203,0.7488163,0.0030988161,0.09417788],"study_design_scores_gemma":[0.000084365245,0.0003143118,0.004327671,0.00008121865,0.0000769656,0.0011800167,0.0003577205,0.30804074,0.016058384,0.6485533,0.020783441,0.0001418421],"about_ca_topic_score_codex":0.0013533095,"about_ca_topic_score_gemma":0.0013503188,"teacher_disagreement_score":0.0019364478,"about_ca_system_score_codex":0.0013988428,"about_ca_system_score_gemma":0.0011113294,"threshold_uncertainty_score":0.01014936},"labels":[],"label_agreement":null},{"id":"W4415956068","doi":"10.1007/978-3-031-89771-9_156","title":"Restrained Roman Edge Domination in Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Studies in systems, decision and control","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Graph; Edge cover; Weight function; Dominating set","score_opus":0.039015043947590915,"score_gpt":0.34568425989983026,"score_spread":0.30666921595223934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415956068","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21058206,0.0038341363,0.25122297,0.0023333412,0.00050319644,0.00010391223,0.00047229137,0.00033262745,0.53061545],"genre_scores_gemma":[0.86984235,0.0025606824,0.04677367,0.0005184662,0.0003390459,0.00012698784,0.00034979303,0.0002460435,0.07924306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992694,0.00026294644,0.000023910114,0.00013379341,0.00020365563,0.000106194675],"domain_scores_gemma":[0.99732697,0.0016948582,0.00014916636,0.00038218612,0.00026947886,0.00017723134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075496844,0.000436696,0.00059112045,0.0011855417,0.0013888605,0.0018764569,0.0011107133,0.00066105643,0.007013313],"category_scores_gemma":[0.004577296,0.0003760477,0.00052442536,0.0018105842,0.0025445095,0.0026690061,0.0011914355,0.0023810882,0.000808948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019840749,0.000009414038,0.00013581196,0.000052977834,0.0000060499265,0.000053111235,0.0002241917,0.0030615695,0.00080569164,0.9803389,0.002787486,0.012505012],"study_design_scores_gemma":[0.000006182975,0.000007862468,0.00017393923,0.000021345437,0.000005373014,0.00010412309,0.00006774896,0.007231103,0.00050376146,0.9819802,0.009892191,0.0000062325025],"about_ca_topic_score_codex":0.0009583479,"about_ca_topic_score_gemma":0.0013902608,"teacher_disagreement_score":0.007013313,"about_ca_system_score_codex":0.0009858472,"about_ca_system_score_gemma":0.00047583345,"threshold_uncertainty_score":0.023461878},"labels":[],"label_agreement":null},{"id":"W4415963533","doi":"10.48550/arxiv.2510.17344","title":"On Algorithmic Meta-Theorems for Solution Discovery: Tractability and Barriers","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Parameterized complexity; Treewidth; Graph; Security token; Complement (music); Transformation (genetics); Computational complexity theory","score_opus":0.0720055849767724,"score_gpt":0.33890989622375284,"score_spread":0.26690431124698044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415963533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014814943,0.0021505556,0.95305055,0.008404498,0.0001558349,0.00040703308,0.0007968618,0.00095031713,0.01926941],"genre_scores_gemma":[0.28796533,0.0036075222,0.68838733,0.0039955005,0.00087859144,0.0026662373,0.0025383455,0.001525464,0.0084357085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9781049,0.0084927725,0.0016313946,0.005128058,0.004880914,0.0017620238],"domain_scores_gemma":[0.83188504,0.14795408,0.0035779846,0.012018919,0.003224447,0.0013394972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021885606,0.003661725,0.003519911,0.0046456107,0.003237477,0.0130060185,0.007183085,0.0052994965,0.011389433],"category_scores_gemma":[0.094197266,0.0026084066,0.010316525,0.0053205644,0.011145848,0.029197419,0.010079542,0.018568037,0.0018638241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017454568,0.00019536114,0.0013219774,0.00095111906,0.00026068417,0.0001953548,0.0005052263,0.071106665,0.0010780932,0.8928443,0.0040268307,0.027339928],"study_design_scores_gemma":[0.00005578771,0.000056972447,0.0001355337,0.00017850619,0.00008736363,0.00010831596,0.00009501012,0.099302255,0.0010512214,0.8945427,0.004353229,0.00003309864],"about_ca_topic_score_codex":0.0029311308,"about_ca_topic_score_gemma":0.0033173033,"teacher_disagreement_score":0.021885606,"about_ca_system_score_codex":0.008569144,"about_ca_system_score_gemma":0.0064458326,"threshold_uncertainty_score":0.11574352},"labels":[],"label_agreement":null},{"id":"W4415991362","doi":"10.1007/s00493-025-00168-w","title":"The Grid-Minor Theorem Revisited","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Monash University; Australian Government","keywords":"Treewidth; Graph minor; Planar graph; Graph; Upper and lower bounds; Existential quantification; Perfect graph; Chromatic scale","score_opus":0.010468888549975325,"score_gpt":0.2878532767963204,"score_spread":0.27738438824634504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415991362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38972083,0.002934741,0.5125925,0.003487718,0.00038145983,0.00013370681,0.0006444975,0.0011567406,0.088947855],"genre_scores_gemma":[0.95512533,0.00059330557,0.03561712,0.0006191628,0.00012452714,0.000094613,0.00026192813,0.00015057974,0.0074134027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999091,0.00011738736,0.00003052753,0.0003525467,0.00023381694,0.0001747701],"domain_scores_gemma":[0.997221,0.0014334195,0.00024111384,0.0005030761,0.0003296943,0.00027180166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689318,0.00033873247,0.00059900753,0.0006974852,0.0010369868,0.0013153037,0.0015154508,0.0006863323,0.007197664],"category_scores_gemma":[0.0034976287,0.0003755639,0.000647956,0.00059942674,0.0023830894,0.0033236234,0.0024344411,0.0018645073,0.00079288846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024838728,0.000053808268,0.004128881,0.00021110794,0.00003379525,0.00028913567,0.00032695354,0.009803294,0.015702244,0.93554413,0.005735604,0.02792264],"study_design_scores_gemma":[0.0001111401,0.0003207761,0.006189163,0.000075584525,0.00006222444,0.002144659,0.0004561542,0.07872822,0.029767126,0.83286643,0.0492232,0.000055284112],"about_ca_topic_score_codex":0.0022382224,"about_ca_topic_score_gemma":0.0021614507,"teacher_disagreement_score":0.007197664,"about_ca_system_score_codex":0.0012786546,"about_ca_system_score_gemma":0.0005666423,"threshold_uncertainty_score":0.024078608},"labels":[],"label_agreement":null},{"id":"W4416086981","doi":"10.61091/jcmcc128-15","title":"Equitable domination number of certain graph operators","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Domination analysis; Vertex (graph theory); Graph; Existential quantification; Subdivision; Neighbourhood (mathematics)","score_opus":0.016453819897170957,"score_gpt":0.31402654811134784,"score_spread":0.2975727282141769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416086981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5643002,0.00057611376,0.32885617,0.0014198482,0.00012416324,0.00019109706,0.0012716511,0.0006733327,0.102587454],"genre_scores_gemma":[0.9428105,0.00027659725,0.0366004,0.00030112782,0.00011190363,0.00018003282,0.0006789121,0.00011714165,0.01892337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839216,0.0003199736,0.00011473112,0.00046481885,0.00040969372,0.00029868254],"domain_scores_gemma":[0.9952318,0.0028549414,0.0004346025,0.0004263069,0.00053679635,0.00051554124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00178364,0.00064335414,0.000653609,0.001594388,0.0011324849,0.0020622488,0.00097388047,0.00067179336,0.008678168],"category_scores_gemma":[0.00567356,0.0002668829,0.00081363483,0.0015086893,0.0018817631,0.003866411,0.002035494,0.0013732571,0.00056624174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020808821,0.00007625438,0.0008283301,0.00013779089,0.000035359255,0.00020355165,0.0004519472,0.014692475,0.0045653824,0.9474911,0.003614876,0.027694868],"study_design_scores_gemma":[0.00006970386,0.000071446324,0.00060453854,0.000025039342,0.000034403794,0.00026636643,0.00015808608,0.07856213,0.0035158864,0.9090181,0.0076476904,0.000026728416],"about_ca_topic_score_codex":0.0010000898,"about_ca_topic_score_gemma":0.0011485049,"teacher_disagreement_score":0.008678168,"about_ca_system_score_codex":0.0020752153,"about_ca_system_score_gemma":0.0008059949,"threshold_uncertainty_score":0.029031336},"labels":[],"label_agreement":null},{"id":"W4416096748","doi":"10.1007/s00224-025-10247-6","title":"Improved Parameterized Algorithms for Cluster Vertex Deletion","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"National Natural Science Foundation of China","keywords":"Vertex (graph theory); Parameterized complexity; Graph; Neighbourhood (mathematics); Degree (music); Feedback vertex set; Connected component","score_opus":0.02599159056114206,"score_gpt":0.3157768604298239,"score_spread":0.2897852698686818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416096748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043527517,0.000600626,0.93459356,0.001012483,0.00034742872,0.00049781584,0.001384726,0.0071653523,0.010870436],"genre_scores_gemma":[0.21950522,0.00049688475,0.75678253,0.00044006182,0.00027737772,0.0007707065,0.0045884103,0.0024525842,0.014686246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948001,0.0011311711,0.00032524607,0.0014289812,0.0014740425,0.00084045465],"domain_scores_gemma":[0.9821346,0.005428957,0.00082091516,0.00891727,0.0018663541,0.00083188794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026933237,0.0022097477,0.0031194687,0.0021881943,0.0029693889,0.005024441,0.0094508,0.0023477706,0.02012319],"category_scores_gemma":[0.017793369,0.0014345153,0.0022999605,0.0060641575,0.0018836035,0.010146557,0.007193907,0.0046941396,0.0053588236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002318626,0.0011237449,0.0023972995,0.00073801295,0.00024378036,0.00021269979,0.00067762996,0.28409547,0.01447008,0.13957193,0.047305882,0.50684476],"study_design_scores_gemma":[0.0003844885,0.00015684571,0.00076808827,0.00006370691,0.00014129226,0.00021456511,0.0002600101,0.7952627,0.008899046,0.1799098,0.013862036,0.00007750022],"about_ca_topic_score_codex":0.0065886104,"about_ca_topic_score_gemma":0.01236687,"teacher_disagreement_score":0.02012319,"about_ca_system_score_codex":0.0050943824,"about_ca_system_score_gemma":0.006795166,"threshold_uncertainty_score":0.06731874},"labels":[],"label_agreement":null},{"id":"W4416099726","doi":"10.4230/lipics.socg.2025.19","title":"Polychromatic Coloring of Tuples in Hypergraphs","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; University of Windsor","funders":"","keywords":"Hypergraph; Vertex (graph theory); Tuple; Set (abstract data type); Constant (computer programming)","score_opus":0.053731101519079436,"score_gpt":0.32533864359938885,"score_spread":0.2716075420803094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416099726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2029257,0.0037005683,0.72406274,0.0021398922,0.000322713,0.0003665018,0.0056671803,0.004620114,0.056194574],"genre_scores_gemma":[0.66609293,0.0028619186,0.3035079,0.001449364,0.00045411996,0.00067803304,0.007068039,0.0013066718,0.016581034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590343,0.001134588,0.0002027831,0.0012297647,0.00074925536,0.0007801536],"domain_scores_gemma":[0.98630816,0.006454655,0.0011412798,0.0036808639,0.0013159241,0.0010991362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024462068,0.0016848393,0.0012563374,0.00158608,0.002002084,0.004042343,0.0020950143,0.0011789269,0.011291736],"category_scores_gemma":[0.0111604305,0.0016297052,0.0015706096,0.0030397954,0.0020115422,0.0069168946,0.002521531,0.0034428008,0.0021958714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002580355,0.0006016062,0.008678125,0.0011838903,0.00035041556,0.00058372045,0.0014023934,0.17675695,0.032376036,0.5654968,0.044451956,0.16553776],"study_design_scores_gemma":[0.000223242,0.0003670504,0.0050741653,0.0002322213,0.0002525186,0.0014193866,0.0005453312,0.3053437,0.021183487,0.6152326,0.049974494,0.00015186978],"about_ca_topic_score_codex":0.004170793,"about_ca_topic_score_gemma":0.0054850746,"teacher_disagreement_score":0.011291736,"about_ca_system_score_codex":0.0034817513,"about_ca_system_score_gemma":0.0018932401,"threshold_uncertainty_score":0.037774622},"labels":[],"label_agreement":null},{"id":"W4416232600","doi":"10.48550/arxiv.2506.05602","title":"Induced subgraphs and tree decompositions XIX. Thetas and forests","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Treewidth; Graph; Block graph; Tree (set theory); Clique-sum; 1-planar graph; Tree-depth; Class (philosophy); Function (biology)","score_opus":0.07283746239507752,"score_gpt":0.23432469668237466,"score_spread":0.16148723428729714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416232600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8247179,0.0022633434,0.11802142,0.00173842,0.00006259587,0.000048677237,0.0008861935,0.00027594343,0.05198551],"genre_scores_gemma":[0.96285284,0.00095301913,0.02282793,0.0002525477,0.00010133958,0.000053011645,0.0011806166,0.00006891981,0.011709862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979955,0.000033862972,0.000007319213,0.000062078005,0.000037700214,0.000059576927],"domain_scores_gemma":[0.99911875,0.00043361483,0.0001814568,0.00009043102,0.000054928547,0.000120731354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002683641,0.00021619665,0.0002492672,0.0008154219,0.00061840005,0.0010819632,0.00039466855,0.00029958235,0.004754205],"category_scores_gemma":[0.001089017,0.0003139545,0.00043248324,0.0008073305,0.0008814188,0.0016571152,0.00088017085,0.0008300478,0.0003808398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009733947,0.000057986803,0.0052570864,0.0001175115,0.000024487188,0.0002001998,0.00062619534,0.007275842,0.007743398,0.9465126,0.0041662185,0.027921107],"study_design_scores_gemma":[0.000031665422,0.00003494316,0.0061892006,0.000044430606,0.000037089547,0.00051912206,0.00046937837,0.02725256,0.0038041442,0.94755757,0.014047255,0.000012625581],"about_ca_topic_score_codex":0.001890583,"about_ca_topic_score_gemma":0.002907147,"teacher_disagreement_score":0.004754205,"about_ca_system_score_codex":0.00087192,"about_ca_system_score_gemma":0.00027975504,"threshold_uncertainty_score":0.015904427},"labels":[],"label_agreement":null},{"id":"W4416347661","doi":"10.48550/arxiv.2510.12564","title":"Dominating Hadwiger's Conjecture for graphs $G$ with $α(G)=2$","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Dominating set; Conjecture; Graph; Independence number; Clique number; Chromatic scale; Graph power; Existential quantification","score_opus":0.037917087882524,"score_gpt":0.3210448310125198,"score_spread":0.2831277431299958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416347661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6574605,0.0015048363,0.21402249,0.009279524,0.000591889,0.00025139694,0.001849043,0.0007258282,0.11431444],"genre_scores_gemma":[0.93644345,0.0008613729,0.032879032,0.0020550203,0.00025260638,0.00016571529,0.0019893176,0.00011938951,0.02523407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900156,0.00011471983,0.00003450047,0.0004356868,0.00013997726,0.0002735232],"domain_scores_gemma":[0.99618906,0.00199736,0.00023982259,0.000854934,0.00034075684,0.0003782044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095768116,0.00091479404,0.00070805283,0.00079961517,0.0022139223,0.0019217684,0.0013351636,0.0012720762,0.008601012],"category_scores_gemma":[0.005002052,0.0006238715,0.0015740178,0.0012135908,0.003093091,0.0051002637,0.0024315757,0.0025149635,0.0011482304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046733074,0.0001522396,0.008661778,0.00034195225,0.000095501986,0.00067461433,0.0017876634,0.01698178,0.010415234,0.896327,0.030475648,0.033619177],"study_design_scores_gemma":[0.00019473722,0.00016757933,0.004487199,0.00007499373,0.00008795527,0.0007410172,0.00061229174,0.046099607,0.009914134,0.8968269,0.040703017,0.00009067961],"about_ca_topic_score_codex":0.006239884,"about_ca_topic_score_gemma":0.005450611,"teacher_disagreement_score":0.008601012,"about_ca_system_score_codex":0.0023015903,"about_ca_system_score_gemma":0.0012007075,"threshold_uncertainty_score":0.028773248},"labels":[],"label_agreement":null},{"id":"W4416375366","doi":"10.48550/arxiv.2504.17868","title":"Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal Time","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; European Commission","keywords":"Colored; Upper and lower bounds; Graph; Set (abstract data type); Similarity (geometry); Class (philosophy)","score_opus":0.029473443243371533,"score_gpt":0.3073322533160774,"score_spread":0.27785881007270585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416375366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28958628,0.0014138602,0.67821985,0.0049697943,0.00033013104,0.00093426753,0.0021121334,0.008098361,0.014335282],"genre_scores_gemma":[0.81097674,0.00055116566,0.1770849,0.0007543243,0.00028540782,0.00040897506,0.0017505179,0.0011705536,0.0070174076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971113,0.00053707376,0.00016740116,0.0008309271,0.00070447143,0.00064873014],"domain_scores_gemma":[0.97986025,0.012142671,0.0016972438,0.0037183296,0.0011828304,0.0013987136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025761763,0.0019239335,0.0027610573,0.0009865885,0.0013361832,0.003336769,0.003955659,0.0021373173,0.00871323],"category_scores_gemma":[0.017552074,0.0008408605,0.0015237696,0.0019099787,0.0026552973,0.007830079,0.0035266243,0.0027911763,0.0015125314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042632045,0.0010910857,0.0073369737,0.0014808958,0.00023570025,0.0006252452,0.00094009447,0.5466562,0.036905546,0.13126394,0.030302,0.23889917],"study_design_scores_gemma":[0.00029250377,0.00041824975,0.00082411966,0.00004346333,0.00011279317,0.0003591591,0.00020988342,0.85621744,0.012733977,0.12622184,0.0025185638,0.000048019087],"about_ca_topic_score_codex":0.0023230165,"about_ca_topic_score_gemma":0.003255617,"teacher_disagreement_score":0.00871323,"about_ca_system_score_codex":0.0029505165,"about_ca_system_score_gemma":0.003686336,"threshold_uncertainty_score":0.029148638},"labels":[],"label_agreement":null},{"id":"W4416785444","doi":"10.28924/2291-8639-23-2025-304","title":"The Rainbow Mean Coloring of Some Operations of Graphs","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Edge coloring; Vertex (graph theory); Brooks' theorem; Chromatic scale; Graph; Product (mathematics)","score_opus":0.013743296980078909,"score_gpt":0.3405275770100706,"score_spread":0.32678428002999166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416785444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48396245,0.00035022572,0.48550615,0.00014569746,0.0001189521,0.00009622127,0.00060215895,0.0008874449,0.028330684],"genre_scores_gemma":[0.8335044,0.00022044408,0.1602849,0.000058341608,0.00007634701,0.0000623308,0.00045263494,0.00027496158,0.0050657485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996088,0.00007357597,0.00001993224,0.00007683798,0.0001211616,0.000099761535],"domain_scores_gemma":[0.9989209,0.00039962106,0.00012290146,0.00026392477,0.00019661897,0.00009601763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052794395,0.00039416566,0.0002791404,0.001317582,0.00057640596,0.0009203092,0.00039373958,0.00025570663,0.003086405],"category_scores_gemma":[0.0023443452,0.00019856458,0.0005424993,0.0013564386,0.0011639477,0.001747879,0.0006738279,0.0005592518,0.00034753545],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042870274,0.000098382676,0.00788169,0.00018575393,0.00005293598,0.0004231243,0.00069656235,0.08548889,0.030084815,0.7496433,0.0057109036,0.11930488],"study_design_scores_gemma":[0.000024594636,0.00019111668,0.005878166,0.000029012022,0.000032697706,0.0005857676,0.0003766725,0.26005748,0.01920642,0.6999001,0.013661183,0.00005673154],"about_ca_topic_score_codex":0.0017483433,"about_ca_topic_score_gemma":0.0018798985,"teacher_disagreement_score":0.003086405,"about_ca_system_score_codex":0.0007099565,"about_ca_system_score_gemma":0.00056856667,"threshold_uncertainty_score":0.010325074},"labels":[],"label_agreement":null},{"id":"W45265680","doi":"","title":"On Quadrilaterals and Cycle Covers in a Bipartite Graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Quadrilateral; Complete bipartite graph; Combinatorics; Graph; Structural engineering; Finite element method","score_opus":0.013954489477157517,"score_gpt":0.27878385254499,"score_spread":0.2648293630678325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45265680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50197846,0.004689339,0.24783823,0.0030586105,0.00050329993,0.00018241194,0.0015466638,0.00045860672,0.23974435],"genre_scores_gemma":[0.88759667,0.0030130702,0.05593384,0.0006316958,0.00050500006,0.00020067545,0.0017689097,0.0002981664,0.050051942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934906,0.00021481427,0.000025662343,0.00011291883,0.00013639133,0.00016122498],"domain_scores_gemma":[0.9975555,0.0015212026,0.00031904483,0.00020282005,0.00015253958,0.00024887075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046870142,0.0004929669,0.0006484604,0.0018464132,0.0016642404,0.0018608768,0.00091300067,0.001328133,0.013972953],"category_scores_gemma":[0.003320873,0.00055278046,0.00054269994,0.0022696338,0.0019080562,0.0038197197,0.0019087938,0.0015377179,0.0017342897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014938465,0.000044263976,0.0011899523,0.00015615461,0.000021740907,0.00026198756,0.00042898543,0.009731879,0.001670466,0.9482158,0.0089474125,0.029181888],"study_design_scores_gemma":[0.000017479028,0.000026482125,0.0007068298,0.00005025434,0.000015590353,0.0003526427,0.00030338418,0.024154646,0.00069632876,0.963105,0.010559184,0.0000121359],"about_ca_topic_score_codex":0.0025662747,"about_ca_topic_score_gemma":0.003954359,"teacher_disagreement_score":0.013972953,"about_ca_system_score_codex":0.0010024958,"about_ca_system_score_gemma":0.00030206834,"threshold_uncertainty_score":0.046744227},"labels":[],"label_agreement":null},{"id":"W46589465","doi":"","title":"Arc Signed Graphs of Oriented Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Combinatorics; Indifference graph; Graph; Geometry","score_opus":0.018186615225529747,"score_gpt":0.25880686326639474,"score_spread":0.240620248040865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46589465","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24842541,0.0048178528,0.32917586,0.0023539453,0.0026587257,0.00017548015,0.002236666,0.0014969268,0.40865925],"genre_scores_gemma":[0.84894806,0.0031440402,0.048178133,0.00075998565,0.0007491939,0.00010651208,0.0018330377,0.00039113584,0.09588991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995746,0.00010441578,0.000030638374,0.00008191071,0.00014417432,0.00006426001],"domain_scores_gemma":[0.99866796,0.0004016981,0.00032309073,0.0001632945,0.00025712824,0.00018678934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031894015,0.00049655203,0.0003391089,0.0019209435,0.00077112566,0.0025280206,0.00059290626,0.0006868077,0.015657857],"category_scores_gemma":[0.0025616651,0.0002835539,0.00034186346,0.0015056983,0.0010235622,0.0033721526,0.0011747658,0.001209304,0.0026479142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046857713,0.000027305548,0.0003565517,0.00010020336,0.000009982446,0.00015585149,0.00016624387,0.0009865657,0.0023055049,0.9532938,0.0066293124,0.035921935],"study_design_scores_gemma":[0.000015304926,0.000026863185,0.0005189763,0.000049083585,0.00001607276,0.00037286503,0.00017770872,0.0043556746,0.0018555168,0.9546671,0.03792762,0.000017217508],"about_ca_topic_score_codex":0.0006332313,"about_ca_topic_score_gemma":0.0010584121,"teacher_disagreement_score":0.015657857,"about_ca_system_score_codex":0.0006272538,"about_ca_system_score_gemma":0.00042666946,"threshold_uncertainty_score":0.0523808},"labels":[],"label_agreement":null},{"id":"W52813985","doi":"","title":"Hamiltonian Cycles in N 2 -Locally Connected Claw-Free Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Hamiltonian (control theory); Mathematical optimization; Structural engineering","score_opus":0.018901733731783367,"score_gpt":0.2569798225516237,"score_spread":0.23807808881984036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52813985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89955443,0.0014395036,0.035099614,0.0010435992,0.00012761369,0.00011962043,0.0006782655,0.00031381362,0.06162349],"genre_scores_gemma":[0.9621682,0.00047530877,0.010034119,0.00023226482,0.000038748258,0.0001061148,0.00062722986,0.00006418988,0.026253782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997875,0.00004553657,0.000012322076,0.000051402832,0.0000417928,0.000061481835],"domain_scores_gemma":[0.99916875,0.0003349856,0.00017851456,0.000057246958,0.000079503705,0.00018102356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015684514,0.00042557635,0.00036229068,0.0012198433,0.0013764749,0.0011608358,0.00082155416,0.0010211733,0.010380053],"category_scores_gemma":[0.0013031699,0.00039585071,0.00027634358,0.0008696346,0.0009486796,0.0017021544,0.0012267043,0.0007007422,0.0010167955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006361624,0.00021394526,0.0049062665,0.00070899056,0.000110814275,0.0027665896,0.002204422,0.022084601,0.023701869,0.8394959,0.017327817,0.08584259],"study_design_scores_gemma":[0.000112420115,0.00009935309,0.0032792513,0.00012569258,0.000059969574,0.00094388996,0.0011056897,0.03155687,0.0057195765,0.9427453,0.014206527,0.00004546517],"about_ca_topic_score_codex":0.0024691913,"about_ca_topic_score_gemma":0.0069774967,"teacher_disagreement_score":0.010380053,"about_ca_system_score_codex":0.00068318,"about_ca_system_score_gemma":0.00043952148,"threshold_uncertainty_score":0.034724772},"labels":[],"label_agreement":null},{"id":"W54544480","doi":"","title":"Edge-added Eccentricities of Vertices in a Graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Graph; Computer science; Artificial intelligence","score_opus":0.022744686622149853,"score_gpt":0.26096908762655074,"score_spread":0.2382244010044009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54544480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72602206,0.0009271905,0.15721132,0.00084232667,0.0005745922,0.00008622045,0.0017055775,0.00078909786,0.11184158],"genre_scores_gemma":[0.92169297,0.0005137525,0.0556667,0.00014816194,0.00017262732,0.000057247104,0.00068222446,0.00018567355,0.020880628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992493,0.00014702178,0.00005040128,0.0002046337,0.00022551522,0.00012319749],"domain_scores_gemma":[0.9966149,0.0013629969,0.00046702483,0.00059996464,0.0005675702,0.00038760202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005695582,0.00048314256,0.00051046856,0.0023663277,0.0013362729,0.0016128455,0.0009773993,0.001018172,0.011964863],"category_scores_gemma":[0.0073323064,0.00037194506,0.00027863283,0.0017195761,0.0010269769,0.0028321794,0.0017737241,0.001055006,0.0024906276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015152154,0.00022992186,0.019141307,0.00069461117,0.00013174624,0.0029366242,0.0012245524,0.020505507,0.059416037,0.69798565,0.0133188935,0.18289992],"study_design_scores_gemma":[0.000140077,0.00020951264,0.016073886,0.00031804197,0.00022914808,0.0063738828,0.001169687,0.054946583,0.052152563,0.8127396,0.055538315,0.0001087439],"about_ca_topic_score_codex":0.00034234385,"about_ca_topic_score_gemma":0.0007341103,"teacher_disagreement_score":0.011964863,"about_ca_system_score_codex":0.00045107928,"about_ca_system_score_gemma":0.00022304922,"threshold_uncertainty_score":0.040026426},"labels":[],"label_agreement":null},{"id":"W55235417","doi":"","title":"On the connectivity of generalized p-cycles.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Degree (music); Upper and lower bounds; Order (exchange); Enhanced Data Rates for GSM Evolution; Set (abstract data type); Discrete mathematics; Mathematical analysis; Physics; Computer science","score_opus":0.025808839045729174,"score_gpt":0.28955243720565654,"score_spread":0.2637435981599274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W55235417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42870396,0.007453261,0.44679436,0.003934297,0.00025688147,0.0004234973,0.0017938734,0.0003800512,0.11025976],"genre_scores_gemma":[0.9012997,0.006599808,0.08139881,0.0007102534,0.0004982794,0.00063434395,0.0016766584,0.00016916475,0.007012918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991441,0.00025414536,0.000045746016,0.00023746566,0.00017435652,0.00014418356],"domain_scores_gemma":[0.9928845,0.00542083,0.00058179063,0.00038918544,0.00042086275,0.00030284686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064557017,0.0008528584,0.00072383,0.0019144716,0.0014969804,0.0014674243,0.0009854115,0.0012436978,0.005900305],"category_scores_gemma":[0.009356504,0.0005517356,0.0005756897,0.0025330586,0.0021561175,0.0046599866,0.0018971259,0.0013213872,0.00055642077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000392293,0.00008670556,0.003971332,0.00084547285,0.00009879909,0.0013024056,0.00094214175,0.08061947,0.009856246,0.8191859,0.010826197,0.07187301],"study_design_scores_gemma":[0.00007441062,0.00016746926,0.0024373527,0.0002036196,0.000074040836,0.001710123,0.00041084772,0.09129461,0.0040706643,0.88163817,0.017867666,0.000051150553],"about_ca_topic_score_codex":0.0019269346,"about_ca_topic_score_gemma":0.0018772163,"teacher_disagreement_score":0.005900305,"about_ca_system_score_codex":0.0011466766,"about_ca_system_score_gemma":0.00064359297,"threshold_uncertainty_score":0.019738436},"labels":[],"label_agreement":null},{"id":"W578099889","doi":"10.1007/978-3-319-27261-0_8","title":"Genus, Treewidth, and Local Crossing Number","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Treewidth; Combinatorics; Mathematics; 1-planar graph; Partial k-tree; Planar graph; Clique-sum; Vertex (graph theory); Crossing number (knot theory); Graph; Upper and lower bounds; Discrete mathematics; Pathwidth; Chordal graph; Line graph; Cartography","score_opus":0.03260231898459536,"score_gpt":0.3087347453853231,"score_spread":0.2761324264007277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W578099889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6129617,0.025422545,0.25304782,0.0020052737,0.00029853015,0.000046986817,0.00056342175,0.001100777,0.10455303],"genre_scores_gemma":[0.945169,0.010177272,0.035652205,0.00020531997,0.00035346864,0.000053318934,0.00042557286,0.00039152923,0.0075724497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948716,0.000059685677,0.00001924199,0.00019388628,0.00015214014,0.00008788869],"domain_scores_gemma":[0.9969709,0.0017937816,0.0004763267,0.000363733,0.00015528912,0.0002398671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051072356,0.000881528,0.00054986664,0.0015709387,0.00065425376,0.0021284653,0.0012595346,0.00085137377,0.0037955842],"category_scores_gemma":[0.0050725522,0.0005549788,0.0006656068,0.002058529,0.0016059498,0.006157058,0.0017756822,0.0018859843,0.0007099048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033863346,0.00013884857,0.014926134,0.0009002525,0.00018554476,0.0009879271,0.0010829695,0.122781344,0.051194206,0.5923314,0.009018754,0.20611398],"study_design_scores_gemma":[0.00002120846,0.00021896565,0.014816855,0.00025536644,0.00023686083,0.0025793458,0.00046560387,0.16090022,0.018436972,0.77886915,0.023102725,0.00009666963],"about_ca_topic_score_codex":0.000782426,"about_ca_topic_score_gemma":0.0009783263,"teacher_disagreement_score":0.0037955842,"about_ca_system_score_codex":0.0009868578,"about_ca_system_score_gemma":0.00023560169,"threshold_uncertainty_score":0.012697518},"labels":[],"label_agreement":null},{"id":"W5848928","doi":"10.2466/pms.1965.21.2.535","title":"The Complexity of List Ranking of Trees","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Bounded function; Ranking (information retrieval); Graph; Path (computing); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.05138417851192042,"score_gpt":0.29403200381298866,"score_spread":0.24264782530106824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5848928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.822979,0.0016739956,0.12467775,0.007984454,0.00016406472,0.00039413536,0.0083434,0.002945134,0.030838143],"genre_scores_gemma":[0.93680423,0.00053480774,0.049445875,0.00035679238,0.00013735058,0.0001525072,0.0048446916,0.00037941505,0.007344219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969896,0.0009848612,0.00019940862,0.00047592062,0.0006515469,0.00069859467],"domain_scores_gemma":[0.97820115,0.017395,0.0011277555,0.00132181,0.0010612353,0.00089301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017812432,0.0006362173,0.0014634869,0.001059585,0.0016899189,0.00545812,0.002225004,0.0015899304,0.013167246],"category_scores_gemma":[0.012778615,0.00056790677,0.0010627639,0.0028740212,0.0010838541,0.007977822,0.0017317538,0.0017158247,0.0014937196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027320883,0.0008784197,0.016434934,0.0029363097,0.00035523908,0.001080197,0.0017102835,0.44450378,0.015297811,0.21275,0.07678563,0.22453527],"study_design_scores_gemma":[0.00030603487,0.00020714407,0.002854683,0.000069237634,0.00014984095,0.0006011166,0.00073783565,0.7403094,0.005168246,0.24074805,0.008787178,0.00006127916],"about_ca_topic_score_codex":0.0060809045,"about_ca_topic_score_gemma":0.0066962475,"teacher_disagreement_score":0.013167246,"about_ca_system_score_codex":0.0034428812,"about_ca_system_score_gemma":0.0024709362,"threshold_uncertainty_score":0.044048786},"labels":[],"label_agreement":null},{"id":"W603134616","doi":"10.1016/j.disc.2015.05.002","title":"Characterization of the finite C-MH-homogeneous graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Homomorphism; Finite graph; Homogeneous; Discrete mathematics; Graph; Monomorphism; Isomorphism (crystallography); Injective function; Chemistry","score_opus":0.034794152584167154,"score_gpt":0.27989089660593613,"score_spread":0.24509674402176898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W603134616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7620748,0.00042564762,0.11689664,0.0012720301,0.000096292744,0.00011336387,0.0013392371,0.0003952187,0.117386706],"genre_scores_gemma":[0.98185045,0.00015862762,0.006951885,0.00017423631,0.00012774538,0.000049564234,0.00070062187,0.000066276974,0.009920602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997012,0.000052844072,0.000012523397,0.000087432534,0.00006565585,0.00008035673],"domain_scores_gemma":[0.9979761,0.00082479627,0.0003101178,0.00018608832,0.0002968393,0.0004060186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032417275,0.00037228726,0.00043875645,0.0023207876,0.001155881,0.0016997011,0.0011495803,0.0005092113,0.010427825],"category_scores_gemma":[0.0017799989,0.00022815204,0.00044893078,0.0010816942,0.001754237,0.0018723737,0.0011186274,0.0011828408,0.000591734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008499156,0.000032587915,0.0006838816,0.00006418534,0.000009393529,0.00011607079,0.0003379604,0.0011535813,0.0048981598,0.9859158,0.0010869399,0.005616456],"study_design_scores_gemma":[0.00002709168,0.000036188292,0.0022834826,0.000035590463,0.000028409173,0.00027833786,0.00044829096,0.014597741,0.005379656,0.97141,0.005451571,0.00002344536],"about_ca_topic_score_codex":0.001604905,"about_ca_topic_score_gemma":0.0010987013,"teacher_disagreement_score":0.010427825,"about_ca_system_score_codex":0.0011806446,"about_ca_system_score_gemma":0.00045480992,"threshold_uncertainty_score":0.034884572},"labels":[],"label_agreement":null},{"id":"W61114388","doi":"","title":"Dissolved Graphs and Strong Perfect Graph Conjecture.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Graph; Combinatorics; Strong perfect graph theorem; Line graph; 1-planar graph","score_opus":0.012713019159197654,"score_gpt":0.26526512607692987,"score_spread":0.2525521069177322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61114388","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3645279,0.006311802,0.1728526,0.040500358,0.0021658987,0.00017374314,0.002587884,0.0011436044,0.40973625],"genre_scores_gemma":[0.9420526,0.002743831,0.019727811,0.0024391187,0.00082858326,0.00010554331,0.0018621774,0.00013362349,0.030106748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848807,0.0004724401,0.00006763302,0.00035123483,0.00038433512,0.00023631784],"domain_scores_gemma":[0.9924385,0.0044826716,0.0008108968,0.0011506015,0.0004679482,0.00064948073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014532317,0.00058839394,0.00075140625,0.0013320538,0.0024142908,0.0031708253,0.0013808326,0.0018552365,0.013532875],"category_scores_gemma":[0.01046007,0.0006694315,0.0007645528,0.0016903388,0.0038353717,0.009332456,0.0038883402,0.0029396706,0.0014777747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004879846,0.000027030304,0.0005084053,0.00008897338,0.000011673617,0.00009381192,0.00015840465,0.0013032038,0.00028653824,0.9814432,0.009824592,0.0062053693],"study_design_scores_gemma":[0.000016685244,0.000009441145,0.00018082537,0.000020310577,0.000009079746,0.00010128681,0.00011280314,0.0022119416,0.0002597645,0.99106455,0.0060070893,0.0000061726046],"about_ca_topic_score_codex":0.0016658319,"about_ca_topic_score_gemma":0.001954783,"teacher_disagreement_score":0.013532875,"about_ca_system_score_codex":0.0015652948,"about_ca_system_score_gemma":0.00094902085,"threshold_uncertainty_score":0.045271993},"labels":[],"label_agreement":null},{"id":"W628055479","doi":"10.1002/net.21464","title":"Proximity graphs inside large weighted graphs","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Chordal graph; Computer science; Maximal independent set; Indifference graph; Pathwidth; Modular decomposition; Combinatorics; 1-planar graph; Mathematics; Graph; Line graph","score_opus":0.019144565450619933,"score_gpt":0.2774915085623688,"score_spread":0.2583469431117489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W628055479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2121586,0.00030026174,0.7769011,0.000370497,0.00005417016,0.00011777543,0.00030987698,0.00029331152,0.0094944015],"genre_scores_gemma":[0.80163306,0.00027760357,0.19418834,0.00013416288,0.000081841405,0.00014910889,0.0003778327,0.000084071806,0.0030740092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985109,0.0004905654,0.00009195756,0.00043212884,0.00039111322,0.00008320526],"domain_scores_gemma":[0.99471056,0.003064042,0.00079437654,0.0005022479,0.0006227805,0.00030602468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008826207,0.00038766843,0.00046747882,0.0026797443,0.000929861,0.0015073143,0.0008134945,0.0008325514,0.0031606774],"category_scores_gemma":[0.008145231,0.00037028547,0.00047919832,0.0021991816,0.0015900129,0.003447036,0.0019660082,0.0010763914,0.00030570428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010594874,0.00004248894,0.002204512,0.000185617,0.00004190192,0.00055719394,0.000742883,0.051683903,0.0059512346,0.89173913,0.0017020159,0.045043133],"study_design_scores_gemma":[0.000019074163,0.000047958478,0.001001724,0.000030595813,0.000023125918,0.00043818605,0.00022458543,0.12589034,0.0027040474,0.8632059,0.006395754,0.000018793298],"about_ca_topic_score_codex":0.00079229067,"about_ca_topic_score_gemma":0.00072684174,"teacher_disagreement_score":0.0031606774,"about_ca_system_score_codex":0.00071421074,"about_ca_system_score_gemma":0.0002167686,"threshold_uncertainty_score":0.010573566},"labels":[],"label_agreement":null},{"id":"W6358082","doi":"","title":"Comparison of Clique-Listing Algorithms.","year":2004,"lang":"en","type":"article","venue":"The International Journal of Periodontics & Restorative Dentistry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Clique graph; Mathematics; Algorithm; Discrete mathematics; Split graph; Graph; Clique; Computer science; Line graph; Graph power; Pathwidth","score_opus":0.061423386650519836,"score_gpt":0.4117061946477557,"score_spread":0.3502828079972359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6358082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2602532,0.027689984,0.56425065,0.004991368,0.0036897012,0.002239061,0.009777883,0.028637292,0.09847079],"genre_scores_gemma":[0.3480966,0.0071773883,0.605165,0.0010442126,0.00056432834,0.0008791785,0.02174614,0.0035582224,0.011768962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938876,0.001978266,0.0005472932,0.00078205985,0.00206286,0.000741922],"domain_scores_gemma":[0.96164244,0.026037002,0.0012136055,0.005343158,0.0048918007,0.00087193545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060462467,0.001750836,0.0015505052,0.0043073646,0.002176171,0.0024917272,0.0035616644,0.0025320204,0.011052207],"category_scores_gemma":[0.030762717,0.00063270587,0.0016878061,0.00680444,0.0007988933,0.007436988,0.0019329644,0.0016808537,0.0032103106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031408386,0.002245927,0.009650698,0.002208854,0.0007458435,0.00011473058,0.00035059976,0.176675,0.0033431693,0.04455802,0.09428321,0.6626832],"study_design_scores_gemma":[0.0014811243,0.0016749497,0.007717093,0.00035088212,0.00053842395,0.0010392279,0.0007494535,0.7990491,0.014431562,0.08002279,0.09271849,0.00022700676],"about_ca_topic_score_codex":0.004811355,"about_ca_topic_score_gemma":0.0076473937,"teacher_disagreement_score":0.011052207,"about_ca_system_score_codex":0.0036450066,"about_ca_system_score_gemma":0.0044949115,"threshold_uncertainty_score":0.036973357},"labels":[],"label_agreement":null},{"id":"W636225799","doi":"10.1016/j.ejc.2015.03.026","title":"The number of lines in a matroid with no <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-minor","year":2015,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Matroid; Mathematics; Prime power; Combinatorics; Rank (graph theory); Prime (order theory); Discrete mathematics; Oriented matroid; Graphic matroid","score_opus":0.02048945282311033,"score_gpt":0.25401326868118757,"score_spread":0.23352381585807724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W636225799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7290369,0.00079120835,0.13288227,0.0030350212,0.000533032,0.0002071863,0.010658719,0.0022926077,0.120563045],"genre_scores_gemma":[0.8357244,0.000429092,0.08487999,0.0003246604,0.0002808614,0.00031275002,0.007960093,0.00080067216,0.06928751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842525,0.00031498936,0.00018798652,0.0004158593,0.00034366112,0.00031232834],"domain_scores_gemma":[0.98942786,0.003634996,0.0019590764,0.0011989792,0.0019636627,0.0018154227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010007594,0.0007886423,0.00068587787,0.0015664233,0.0022181387,0.0039523165,0.0018696595,0.0013170061,0.02324801],"category_scores_gemma":[0.0063718944,0.00059777615,0.00074259954,0.0011254504,0.0018265333,0.0043575964,0.0017395108,0.0013376373,0.0061108926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036647806,0.0005056705,0.026584143,0.0011835998,0.0003518238,0.0017556506,0.0024521286,0.010728956,0.06495962,0.70041466,0.07376563,0.113633335],"study_design_scores_gemma":[0.00038424073,0.0011694677,0.021436052,0.00039543834,0.00039196832,0.008794985,0.003000573,0.04741483,0.09326805,0.62094665,0.20248225,0.00031550782],"about_ca_topic_score_codex":0.0011160556,"about_ca_topic_score_gemma":0.0015555694,"teacher_disagreement_score":0.02324801,"about_ca_system_score_codex":0.0012694866,"about_ca_system_score_gemma":0.00068834366,"threshold_uncertainty_score":0.07777238},"labels":[],"label_agreement":null},{"id":"W646088219","doi":"10.1007/b135661","title":"Graph Theory and Combinatorial Optimization","year":2005,"lang":"en","type":"book","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Combinatorial optimization; Graph theory; Theoretical computer science; Combinatorics; Mathematics; Algorithm","score_opus":0.011058385292386614,"score_gpt":0.2648337191834106,"score_spread":0.25377533389102397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W646088219","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016910133,0.07583599,0.06184266,0.005353862,0.005114757,0.00007424503,0.0004209076,0.0007072245,0.8489593],"genre_scores_gemma":[0.026870895,0.07176317,0.043717578,0.002992642,0.0059645628,0.00025257003,0.000882,0.0009579884,0.8465987],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972516,0.0000449555,0.000006035366,0.000050469636,0.00015402539,0.000019294908],"domain_scores_gemma":[0.99965525,0.00015857263,0.00001827979,0.00006405069,0.00006752043,0.000036363555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023879681,0.0020560815,0.0015684247,0.0018921107,0.0009321296,0.002506157,0.0015325965,0.0011443006,0.051708117],"category_scores_gemma":[0.0010483913,0.00080964825,0.00061138783,0.005285471,0.0017889597,0.003272497,0.00081440696,0.003686567,0.027403707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014666881,0.00005771799,0.00007387039,0.00035115282,0.000020611784,0.000035735087,0.00007270101,0.004292683,0.00052974524,0.30290735,0.5129567,0.17868721],"study_design_scores_gemma":[0.000010210311,0.000014981388,0.00023359503,0.00016593824,0.000018399904,0.000118074415,0.000048015612,0.0038061822,0.00022589993,0.40433782,0.5910057,0.00001515291],"about_ca_topic_score_codex":0.0020935147,"about_ca_topic_score_gemma":0.0058344374,"teacher_disagreement_score":0.051708117,"about_ca_system_score_codex":0.0018191237,"about_ca_system_score_gemma":0.0012839895,"threshold_uncertainty_score":0.1729809},"labels":[],"label_agreement":null},{"id":"W650364680","doi":"10.1016/j.dam.2015.05.035","title":"Ferrers dimension of grid intersection graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Combinatorics; Mathematics; Bipartite graph; Intersection (aeronautics); Permutation graph; Intersection graph; Discrete mathematics; Chordal graph; Grid; Indifference graph; Dimension (graph theory); Graph; Line graph","score_opus":0.03533442601073086,"score_gpt":0.2956990426382853,"score_spread":0.2603646166275544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W650364680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88358533,0.00064713403,0.040910967,0.002411433,0.00014959961,0.00004719326,0.0009538834,0.00029147623,0.07100301],"genre_scores_gemma":[0.9826596,0.00033891128,0.0066575976,0.00018932045,0.00014943095,0.00006008343,0.00054375024,0.00007662131,0.009324697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938273,0.00013137073,0.000025910405,0.00012277513,0.00016188616,0.00017530395],"domain_scores_gemma":[0.99646264,0.0018350739,0.000554949,0.0002706254,0.00027848943,0.00059827877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073812675,0.0005027918,0.0010591575,0.0037271865,0.0022840437,0.0036603159,0.0019352104,0.0011067168,0.01453267],"category_scores_gemma":[0.004629731,0.0005650745,0.0005761503,0.0018075343,0.0024748552,0.004499567,0.0023620068,0.002297151,0.0006835493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011928346,0.000039125924,0.0015219204,0.000045840745,0.000017639908,0.00007043572,0.0004155068,0.003753605,0.0007601395,0.98564655,0.0027342483,0.0048758057],"study_design_scores_gemma":[0.000032516367,0.000021444632,0.0015441409,0.000026482503,0.000025081454,0.00016095398,0.00037578098,0.02389847,0.0007271058,0.9699305,0.0032381017,0.000019391022],"about_ca_topic_score_codex":0.0029671495,"about_ca_topic_score_gemma":0.0023905546,"teacher_disagreement_score":0.01453267,"about_ca_system_score_codex":0.0017262044,"about_ca_system_score_gemma":0.0006010159,"threshold_uncertainty_score":0.048616588},"labels":[],"label_agreement":null},{"id":"W651716066","doi":"10.1007/978-1-4612-1388-8","title":"Algorithmic Problems in Groups and Semigroups","year":2000,"lang":"en","type":"book","venue":"Birkhäuser Boston eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Warwick; Marquette University; McGill University; U.S. Naval Academy; Northern Illinois University; Vanderbilt University; Boston College","keywords":"Computer science; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.01661873575901487,"score_gpt":0.24693942095271987,"score_spread":0.230320685193705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W651716066","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015798114,0.04342693,0.12732363,0.010791067,0.0032499146,0.00010246464,0.0004838739,0.00044006016,0.79838383],"genre_scores_gemma":[0.3163412,0.038916297,0.15444598,0.0027173231,0.0073615834,0.00044068898,0.0020668607,0.00041532324,0.47729486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995233,0.0001407952,0.000024965282,0.000084622545,0.0001806962,0.00004548734],"domain_scores_gemma":[0.9993488,0.00040058262,0.00003389868,0.000092719856,0.00007066164,0.00005325286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006340022,0.0007250782,0.0005890982,0.0012881083,0.0013806946,0.0032891412,0.00073531986,0.0008395492,0.013542987],"category_scores_gemma":[0.0020144954,0.0002701346,0.00076265243,0.0019408459,0.002748478,0.0048003807,0.0014992659,0.0020459013,0.0037619614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005440364,0.0000065882045,0.000052596,0.000089020956,0.0000040561663,0.000026219279,0.0002761366,0.00049827364,0.00012249035,0.9552315,0.021805266,0.021882527],"study_design_scores_gemma":[0.000003814635,0.000006680243,0.00008969687,0.000034603065,0.0000022044298,0.00008803339,0.000103357306,0.0008122165,0.000050249833,0.9188706,0.07993589,0.000002501656],"about_ca_topic_score_codex":0.0004444937,"about_ca_topic_score_gemma":0.0006135611,"teacher_disagreement_score":0.013542987,"about_ca_system_score_codex":0.0010864974,"about_ca_system_score_gemma":0.00075310806,"threshold_uncertainty_score":0.04530579},"labels":[],"label_agreement":null},{"id":"W65985817","doi":"","title":"Characterizing Intersection Graphs of Substars of a Star.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Intersection (aeronautics); Combinatorics; Geography; Mathematical analysis; Cartography","score_opus":0.01302765539315038,"score_gpt":0.2551824923929553,"score_spread":0.24215483699980495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65985817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5663613,0.0005566829,0.3538249,0.00069559884,0.00013882038,0.0002719042,0.0025966468,0.0013374452,0.07421665],"genre_scores_gemma":[0.8960428,0.0003530168,0.08609281,0.00021986623,0.00010869127,0.00013299478,0.0044010165,0.00060875865,0.012039958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829537,0.00034950092,0.00011851047,0.00041828683,0.00039872708,0.00041967453],"domain_scores_gemma":[0.9914494,0.0040377434,0.0011299916,0.0012767963,0.0012626952,0.0008433147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010683449,0.0006029012,0.00088925817,0.003209075,0.0029001199,0.004569444,0.0018345097,0.0013084343,0.011611123],"category_scores_gemma":[0.007351813,0.0010046116,0.0014794912,0.003510526,0.002287909,0.007903978,0.0032223756,0.002190512,0.0022701046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037719804,0.00022888635,0.011224346,0.00021215416,0.000091613016,0.00068452564,0.0013670038,0.005061031,0.010618687,0.9318299,0.0062004793,0.032104123],"study_design_scores_gemma":[0.000027948929,0.0000953754,0.0037023914,0.00009020442,0.0001261792,0.00075244624,0.0018167171,0.021215055,0.009706828,0.94573295,0.016691871,0.00004192951],"about_ca_topic_score_codex":0.0021639008,"about_ca_topic_score_gemma":0.0028267992,"teacher_disagreement_score":0.011611123,"about_ca_system_score_codex":0.0010163094,"about_ca_system_score_gemma":0.00082992326,"threshold_uncertainty_score":0.038843095},"labels":[],"label_agreement":null},{"id":"W66989490","doi":"","title":"Connected resolving sets in graphs","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017811914838034626,"score_gpt":0.2806273165562354,"score_spread":0.2628154017182008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66989490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40551463,0.0031856063,0.2754593,0.0059319832,0.00078424107,0.00026830035,0.0012453208,0.0012067865,0.3064038],"genre_scores_gemma":[0.86462206,0.0021034079,0.065700345,0.0010408504,0.0007629923,0.00030736875,0.0017400638,0.0004631124,0.06325977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784315,0.00067793584,0.00017172389,0.000492981,0.0005630658,0.00025102065],"domain_scores_gemma":[0.99412423,0.003925773,0.0005238343,0.000552549,0.0003894897,0.00048407918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016542982,0.0010564377,0.0016612539,0.005581868,0.0066858237,0.010554651,0.0026209499,0.0030540335,0.01803585],"category_scores_gemma":[0.007780801,0.0019586242,0.0017528597,0.007685862,0.005071467,0.0141615635,0.0052855415,0.00534558,0.0025208592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015370533,0.000018883662,0.00012170376,0.000036351026,0.000008050132,0.000055427907,0.00039247246,0.00043088637,0.0002033233,0.994303,0.0010533503,0.003361198],"study_design_scores_gemma":[0.0000074643094,0.0000036941426,0.000061822226,0.000011253189,0.000011734778,0.000073993215,0.00013352289,0.0008889263,0.00020680293,0.996003,0.002591783,0.00000610515],"about_ca_topic_score_codex":0.0010120276,"about_ca_topic_score_gemma":0.0012520058,"teacher_disagreement_score":0.01803585,"about_ca_system_score_codex":0.0017953183,"about_ca_system_score_gemma":0.00077273074,"threshold_uncertainty_score":0.060335934},"labels":[],"label_agreement":null},{"id":"W68296954","doi":"","title":"The number of independent sets intersecting the set of leaves in trees.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Set (abstract data type); Combinatorics; Computer science; Programming language","score_opus":0.02028516209727581,"score_gpt":0.3224003603183159,"score_spread":0.3021151982210401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68296954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79696095,0.004824886,0.08642228,0.003014595,0.00066939904,0.00013703435,0.009977594,0.0008643394,0.09712876],"genre_scores_gemma":[0.96075076,0.0017287014,0.023377085,0.00021202156,0.0004512777,0.00018948987,0.003612176,0.00019286344,0.0094857635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978022,0.00047888054,0.00021540913,0.0004932208,0.00064573553,0.00036451293],"domain_scores_gemma":[0.97689635,0.01612193,0.0022559306,0.0016303697,0.0012374972,0.0018579816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018018854,0.00065944367,0.0012954953,0.0045803143,0.0025047688,0.00496842,0.0026512255,0.0020153967,0.010980633],"category_scores_gemma":[0.020591974,0.0007239784,0.00079851307,0.0032587394,0.0031214608,0.0064471187,0.002098105,0.0022058485,0.0016580897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012771008,0.0002260464,0.027127633,0.0008610246,0.00034879145,0.0008509678,0.0012927649,0.016145557,0.014171636,0.8367772,0.022153037,0.078768186],"study_design_scores_gemma":[0.00010987207,0.00014996521,0.015260374,0.00020032914,0.0003342572,0.004508227,0.0008865106,0.040236644,0.010802114,0.90402627,0.023400346,0.000084954714],"about_ca_topic_score_codex":0.000563159,"about_ca_topic_score_gemma":0.0008154798,"teacher_disagreement_score":0.010980633,"about_ca_system_score_codex":0.0011672376,"about_ca_system_score_gemma":0.0007199788,"threshold_uncertainty_score":0.036733866},"labels":[],"label_agreement":null},{"id":"W6891559455","doi":"10.4230/lipics.disc.2022.40","title":"Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dominating set; Set cover problem; Set (abstract data type); Connected dominating set; Cover (algebra); Distributed algorithm","score_opus":0.030134733620477132,"score_gpt":0.2921644039674968,"score_spread":0.2620296703470197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891559455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021085276,0.053336922,0.8863791,0.027121432,0.016595244,0.000113866394,0.00020615377,0.00045246258,0.013686217],"genre_scores_gemma":[0.11903132,0.10247687,0.67621714,0.0129545275,0.046831228,0.0005931022,0.0012667201,0.00065079797,0.039978344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977842,0.00064820226,0.00015160828,0.0005627795,0.00070940127,0.0001438483],"domain_scores_gemma":[0.9966419,0.0018033232,0.000092587565,0.00042271416,0.0007690562,0.0002705208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035394246,0.0013151284,0.001521108,0.0018044912,0.0012232093,0.003577638,0.0025081271,0.002879001,0.004942561],"category_scores_gemma":[0.0061499774,0.000764833,0.0013877585,0.0033525818,0.0023645272,0.010870858,0.001967722,0.0074230693,0.0022801473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018412093,0.00011885348,0.0003865748,0.0010557513,0.000107694425,0.0001652924,0.00021047775,0.021037698,0.0020857677,0.5848895,0.10952117,0.28023705],"study_design_scores_gemma":[0.000087315784,0.00018323104,0.00027283467,0.0002516826,0.000075910626,0.0005250274,0.00015672551,0.094742455,0.0014115066,0.50339127,0.39883474,0.000067380526],"about_ca_topic_score_codex":0.0013068271,"about_ca_topic_score_gemma":0.0009041775,"teacher_disagreement_score":0.004942561,"about_ca_system_score_codex":0.002461426,"about_ca_system_score_gemma":0.0017386607,"threshold_uncertainty_score":0.018718481},"labels":[],"label_agreement":null},{"id":"W6891661482","doi":"10.48336/n2cc-p369","title":"The deduction model for Cops and Robber","year":2022,"lang":"en","type":"article","venue":"Memorial University Research Repository (Memorial University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Cartesian product; Product (mathematics); Upper and lower bounds; Complete information; Order (exchange); Variation (astronomy)","score_opus":0.0375121743405933,"score_gpt":0.27396587992465204,"score_spread":0.23645370558405876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891661482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10550244,0.00027014868,0.85800827,0.0017024492,0.000103011356,0.0003093344,0.00049454643,0.0008389017,0.032770835],"genre_scores_gemma":[0.6106226,0.00042249737,0.3676408,0.00060607604,0.0001069242,0.000366772,0.0012328356,0.00027399615,0.018727493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99607074,0.0010281975,0.00026721487,0.0012409167,0.00089894363,0.0004939569],"domain_scores_gemma":[0.99087864,0.005631049,0.0008046479,0.0013676985,0.0007998333,0.00051814417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024790873,0.0008057468,0.0009347056,0.00087444973,0.0020090214,0.0024444133,0.002249802,0.0016482781,0.010032165],"category_scores_gemma":[0.0103664985,0.0006604733,0.0019792758,0.0008856306,0.0033679665,0.009393513,0.002970763,0.0033374398,0.0015190454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000128311,0.00010761556,0.0006007302,0.00015206214,0.000028694596,0.00034281088,0.00073125167,0.02805066,0.002638877,0.94839,0.002801193,0.016027838],"study_design_scores_gemma":[0.000055254524,0.00009879245,0.00025803287,0.000026683845,0.000041654243,0.00028022774,0.00024033584,0.15229666,0.0028707979,0.8328106,0.010994073,0.00002688497],"about_ca_topic_score_codex":0.002686425,"about_ca_topic_score_gemma":0.002151762,"teacher_disagreement_score":0.010032165,"about_ca_system_score_codex":0.0018993502,"about_ca_system_score_gemma":0.0015387557,"threshold_uncertainty_score":0.03356099},"labels":[],"label_agreement":null},{"id":"W6903249076","doi":"10.1051/ro/2024108/pdf","title":"Graphs obtained by disjoint unions and joins of cliques and stable sets","year":2024,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Disjoint sets; Cograph; Split graph; Multipartite; Clique-sum; Joins; Independent set; Graph; Chordal graph","score_opus":0.013948846660069897,"score_gpt":0.27235995120281015,"score_spread":0.25841110454274024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903249076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6352632,0.00035947844,0.3177695,0.00029914768,0.000083409206,0.00022586237,0.0013298477,0.00096855103,0.0437011],"genre_scores_gemma":[0.8760139,0.00023744084,0.10963197,0.0001247522,0.00004441636,0.00014193838,0.0019980874,0.00021398887,0.011593477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996928,0.000043205873,0.000014530626,0.000098393946,0.0000952944,0.00005570286],"domain_scores_gemma":[0.9993906,0.00022827805,0.00011376731,0.00011518589,0.00007534347,0.000076894874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002367323,0.00030211557,0.00022966869,0.0009799396,0.0008434734,0.0010023639,0.0005287373,0.0003521587,0.0040460075],"category_scores_gemma":[0.001494991,0.00031444037,0.00052690477,0.0009434296,0.00084127084,0.0016277846,0.0010030722,0.0004586015,0.00044383976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005754594,0.00020523295,0.006633055,0.00040784528,0.00012715161,0.001135875,0.0013899078,0.03238504,0.066039465,0.72983766,0.007091674,0.15417154],"study_design_scores_gemma":[0.0001200436,0.00023178764,0.012646671,0.0000939516,0.00019140863,0.0019581337,0.0011929249,0.12264017,0.084569596,0.72545856,0.05082451,0.00007233058],"about_ca_topic_score_codex":0.00079307245,"about_ca_topic_score_gemma":0.0018361737,"teacher_disagreement_score":0.0040460075,"about_ca_system_score_codex":0.00045222082,"about_ca_system_score_gemma":0.00037882652,"threshold_uncertainty_score":0.013535202},"labels":[],"label_agreement":null},{"id":"W6903276152","doi":"10.1051/ita/2024015/pdf","title":"Enumerating Minimum Feedback Vertex Sets in directed graphs with union-cat trees","year":2024,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Feedback vertex set; Directed graph; Feedback arc set; Vertex (graph theory); Graph; Time complexity; Directed acyclic graph; Strongly connected component","score_opus":0.013390165934388692,"score_gpt":0.2607620653767557,"score_spread":0.24737189944236704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903276152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5454875,0.00053777325,0.4471452,0.00037193918,0.000029582947,0.00013433183,0.0020011251,0.0011966187,0.0030959572],"genre_scores_gemma":[0.73156554,0.00023247593,0.2636789,0.00007696247,0.000015640511,0.0001759536,0.0023534214,0.00012339663,0.0017777912],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994116,0.00013016757,0.00005884668,0.00015184424,0.00016580125,0.00008170427],"domain_scores_gemma":[0.997256,0.0018613546,0.0002228195,0.00024029589,0.00026042064,0.00015918088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068704336,0.00036921917,0.0008024104,0.0012378932,0.0007438521,0.0011858745,0.001417248,0.0009947707,0.0017618143],"category_scores_gemma":[0.0055754134,0.00043765677,0.0006034036,0.0014096489,0.0006108682,0.0028624076,0.0011163774,0.00089442986,0.00026787253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010998405,0.00043407205,0.016412955,0.00135825,0.00012894886,0.00049013505,0.0013949851,0.35593623,0.039785884,0.20784059,0.010638426,0.36447972],"study_design_scores_gemma":[0.00006477364,0.00012923355,0.0013959773,0.00009035052,0.000034697325,0.00036485525,0.0003698199,0.7855265,0.017799223,0.19040222,0.0037935798,0.000028632954],"about_ca_topic_score_codex":0.0016433257,"about_ca_topic_score_gemma":0.0029688638,"teacher_disagreement_score":0.0017618143,"about_ca_system_score_codex":0.0009391579,"about_ca_system_score_gemma":0.00094477844,"threshold_uncertainty_score":0.006814122},"labels":[],"label_agreement":null},{"id":"W6910408406","doi":"10.4230/lipics.esa.2022.59","title":"Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Path (computing); Matrix multiplication; Matrix (chemical analysis); Range query (database); Colored; Tree (set theory); Element (criminal law); Product (mathematics); Node (physics)","score_opus":0.01677952594851535,"score_gpt":0.28010107376614735,"score_spread":0.263321547817632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910408406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07263384,0.00035067834,0.91003877,0.00065379805,0.00012936538,0.0002821106,0.0009111306,0.010633247,0.0043671215],"genre_scores_gemma":[0.34187287,0.00012295213,0.6505983,0.0002932975,0.00010278502,0.0002807684,0.0018632769,0.00051141874,0.004354272],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975369,0.0004141241,0.0001797785,0.000652126,0.00078419957,0.00043274937],"domain_scores_gemma":[0.9954619,0.0020777055,0.00035191153,0.0012045588,0.0006267575,0.00027712277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012694122,0.0012841485,0.0016684692,0.0009278012,0.0010137309,0.002105559,0.0027210473,0.001068973,0.007351705],"category_scores_gemma":[0.007747923,0.000667973,0.0010385589,0.0021544092,0.00083420984,0.005552039,0.0025525764,0.0014759712,0.0021433828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020246394,0.00074991654,0.00431023,0.00068206707,0.00014671279,0.00049036526,0.001162528,0.19007033,0.040316295,0.089905776,0.03993283,0.6302084],"study_design_scores_gemma":[0.00014728129,0.0001910001,0.00030636514,0.000015591879,0.000026073663,0.0001460471,0.00017283815,0.92582107,0.006658693,0.061664913,0.0048200646,0.000030081346],"about_ca_topic_score_codex":0.007851731,"about_ca_topic_score_gemma":0.014458652,"teacher_disagreement_score":0.007851731,"about_ca_system_score_codex":0.0013469927,"about_ca_system_score_gemma":0.0024295673,"threshold_uncertainty_score":0.02459389},"labels":[],"label_agreement":null},{"id":"W6929452493","doi":"10.48550/arxiv.1406.6413","title":"A finer reduction of constraint problems to digraphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Nondeterministic algorithm; Complexity of constraint satisfaction; Constraint (computer-aided design); Conjecture; Constraint satisfaction; Reduction (mathematics); Algebraic number","score_opus":0.06930224953546349,"score_gpt":0.21551348069052031,"score_spread":0.14621123115505683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929452493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088705175,0.00097229856,0.8307698,0.005217464,0.00030042604,0.00022669077,0.001219238,0.0007511575,0.071837805],"genre_scores_gemma":[0.66631854,0.0012438836,0.2949934,0.001905292,0.0006390057,0.00032645575,0.0020549835,0.0004516478,0.032066766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778205,0.0006311633,0.0001343974,0.00070870324,0.0004889686,0.00025474536],"domain_scores_gemma":[0.9968821,0.0018525493,0.0001692041,0.00067973306,0.00020501325,0.00021140712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011317094,0.00054300623,0.0008356546,0.0011448375,0.0012819018,0.0040753772,0.0016032051,0.0010849006,0.012258226],"category_scores_gemma":[0.005256776,0.00051751063,0.0017259734,0.0021028577,0.0025835237,0.006623514,0.004343601,0.0058917,0.0009494356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016603459,0.000044862743,0.000114759925,0.000055293636,0.00000947071,0.000059022666,0.00015143328,0.004510298,0.0006850195,0.9836574,0.0014606504,0.0092350505],"study_design_scores_gemma":[0.00001878781,0.000011470431,0.00011936662,0.000013075018,0.000007135539,0.000053973017,0.00005111062,0.016748732,0.0004284769,0.9741977,0.008342244,0.000007830842],"about_ca_topic_score_codex":0.0029542178,"about_ca_topic_score_gemma":0.003349731,"teacher_disagreement_score":0.012258226,"about_ca_system_score_codex":0.0020457318,"about_ca_system_score_gemma":0.0011531245,"threshold_uncertainty_score":0.041007876},"labels":[],"label_agreement":null},{"id":"W6944628196","doi":"10.20382/jocg.v16i2a2","title":"Constrained and ordered level planarity parameterized by the number of levels","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Planarity testing; Parameterized complexity; Disjoint sets; Time complexity; Graph; Crossing number (knot theory); Twist; Order (exchange)","score_opus":0.02604492658022801,"score_gpt":0.28367366597794924,"score_spread":0.25762873939772124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6944628196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42475507,0.001496148,0.53142554,0.0044489615,0.00010590763,0.00026156628,0.009762403,0.0024938902,0.02525045],"genre_scores_gemma":[0.8062201,0.0013188387,0.16512579,0.0007878858,0.00029305657,0.00050951366,0.011242746,0.0013257499,0.013176358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974527,0.00042153735,0.0001429571,0.0009986984,0.0005519412,0.0004321631],"domain_scores_gemma":[0.9897962,0.0062645213,0.001313767,0.0016217869,0.0004276194,0.00057616556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097448146,0.0016389808,0.0017165085,0.00085742056,0.0010941187,0.004880894,0.0032843717,0.0023517858,0.013169385],"category_scores_gemma":[0.010789066,0.001173479,0.0023499494,0.0026554326,0.0018106702,0.010349209,0.0026672196,0.004067962,0.0012890521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009020622,0.00043212564,0.00851758,0.001151375,0.0002998577,0.0006732118,0.00083455053,0.58751667,0.010734693,0.30719757,0.020839883,0.06090039],"study_design_scores_gemma":[0.00016789766,0.000125085,0.002426814,0.00008074139,0.00013230914,0.0006911412,0.00027995877,0.5751538,0.003910426,0.4075817,0.009385559,0.00006457395],"about_ca_topic_score_codex":0.0039595347,"about_ca_topic_score_gemma":0.004435538,"teacher_disagreement_score":0.013169385,"about_ca_system_score_codex":0.0028758736,"about_ca_system_score_gemma":0.0018827906,"threshold_uncertainty_score":0.04405594},"labels":[],"label_agreement":null},{"id":"W6957551228","doi":"10.6068/dp14ba901929355","title":"Trend 1961 - 2013. Statistics Canada. CANSIM: Construction - Nonresidential Building Construction | Country: Canada | Table: Flows and stocks of fixed non-residential capital, by sector of North American Industry Classification System (NAICS) and asset | Variable: Geometric (infinite) end-year net stock, Telecommunication equipment (x 1,000,000), Administrative and support, waste management and remediation services, Current prices | Units: $CAD, 1961-2013. Data-Planet™ Statistical Ready Reference by Conquest Systems, Inc. Dataset-ID: 075-001-035.","year":2015,"lang":"en","type":"other","venue":"Data Planet","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Economic statistics; Census; Official statistics; Summary statistics; Stock (firearms); Index (typography); Publication; Business statistics; Private sector","score_opus":0.025001666218496695,"score_gpt":0.2699939128488903,"score_spread":0.2449922466303936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957551228","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008100088,0.00004336227,0.000019590252,0.00007626103,0.000018877925,0.00000915515,0.99892825,0.00004752024,0.00077600125],"genre_scores_gemma":[0.00091207604,0.000213572,0.0001972594,0.00008858153,0.000014291153,0.00006580247,0.9948043,0.0000635887,0.0036404806],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971208,0.00012499635,0.00029014668,0.00039931675,0.001371829,0.0006928957],"domain_scores_gemma":[0.97607064,0.000795778,0.00092065515,0.00065120443,0.020525161,0.0010365626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011622178,0.0022478087,0.0022555734,0.007531189,0.0024804203,0.0041564847,0.0043730196,0.001308986,0.0808999],"category_scores_gemma":[0.0121835405,0.0015160085,0.0018136427,0.035875086,0.0005624582,0.0021725562,0.0019639574,0.0028204904,0.05021946],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024170098,0.000008765558,0.0017266724,0.00024279894,0.0000222154,0.000008016664,0.000020018175,0.00017195872,0.000010585712,0.00036403956,0.9957611,0.0016396574],"study_design_scores_gemma":[0.00015773597,0.000013898083,0.03498482,0.0007854949,0.00006346465,0.000028252007,0.00048260944,0.0006235194,0.00022234263,0.0006324825,0.9619311,0.00007425793],"about_ca_topic_score_codex":0.99185634,"about_ca_topic_score_gemma":0.99091023,"teacher_disagreement_score":0.0808999,"about_ca_system_score_codex":0.039756577,"about_ca_system_score_gemma":0.08884271,"threshold_uncertainty_score":0.28845555},"labels":[],"label_agreement":null},{"id":"W6957651068","doi":"10.60692/egsba-a0564","title":"Rice straw anaerobic digestion enhancement through bioaugmentation: effect on the microbial community","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kwantlen Polytechnic University","funders":"","keywords":"Microbial consortium; Microbial population biology; Anaerobic digestion; Bioconversion; Straw; Metagenomics; Bioenergy; Biogas; Anaerobic exercise","score_opus":0.05594527197766261,"score_gpt":0.27987867046795056,"score_spread":0.22393339849028795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957651068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9982407,0.0005357456,0.00071733113,0.00003674697,0.0000068847726,0.000012664447,0.00009430335,0.000022503924,0.00033318505],"genre_scores_gemma":[0.9973278,0.00033593905,0.0015310743,0.000020856134,0.000002839667,0.000013103455,0.00016425317,0.00000582112,0.00059821823],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99983835,0.000047025773,0.00001174191,0.00002802264,0.000031824813,0.000042904354],"domain_scores_gemma":[0.9998944,0.000018514766,0.000024149787,0.000008041562,0.000018104354,0.000036700512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002849762,0.00041241857,0.0003026515,0.00018611837,0.00013239587,0.00043439463,0.00015724842,0.00019231606,0.0005979229],"category_scores_gemma":[0.00021197082,0.00012791008,0.00023872213,0.0002392526,0.00015322556,0.00017119748,0.00031234144,0.00028169627,0.00012892595],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013806253,0.0000378562,0.0003766256,0.000024738358,0.0000039029123,0.000011758998,0.000013118974,0.00006703427,0.99777216,0.000007359821,0.000007950528,0.0015392959],"study_design_scores_gemma":[0.000015265285,0.00067246676,0.011319165,0.0000105676945,0.000033402124,0.000051806408,0.00005161698,0.00095564674,0.98627114,0.000012757836,0.0005999578,0.000006148658],"about_ca_topic_score_codex":0.0016689221,"about_ca_topic_score_gemma":0.002103518,"teacher_disagreement_score":0.0016689221,"about_ca_system_score_codex":0.00021911987,"about_ca_system_score_gemma":0.00039599685,"threshold_uncertainty_score":0.003318429},"labels":[],"label_agreement":null},{"id":"W6979296102","doi":"","title":"Small hitting sets for longest paths and cycles","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche; National Science Foundation","keywords":"Graph; Upper and lower bounds; Mathematical proof; Path graph; Connectivity; Complete graph; Intersection graph; Path (computing); Strength of a graph","score_opus":0.06631587931356754,"score_gpt":0.3299141863886663,"score_spread":0.2635983070750988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979296102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4165977,0.01615536,0.44216082,0.007977423,0.0006579389,0.00034099532,0.004425649,0.00302883,0.1086552],"genre_scores_gemma":[0.91006947,0.005566544,0.063786395,0.0016410542,0.0013933026,0.0010244277,0.0035569507,0.0010694365,0.011892441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948173,0.0010993286,0.00023483418,0.0014811428,0.0013735594,0.0009939271],"domain_scores_gemma":[0.9082927,0.0765618,0.0040766345,0.005783218,0.0020538368,0.003231866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033833764,0.0026182325,0.0031419217,0.0073843547,0.0027430735,0.005352141,0.0058511584,0.0030415272,0.018042527],"category_scores_gemma":[0.0560213,0.0017902828,0.0029384117,0.0057752556,0.006205687,0.015775792,0.0069359085,0.0084925955,0.0020827972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063059246,0.00014926067,0.0034180887,0.0007145723,0.00017848733,0.00033676243,0.001057311,0.064389125,0.0059130513,0.8851242,0.009603076,0.028485358],"study_design_scores_gemma":[0.000053725682,0.000053456086,0.0006864997,0.00010081485,0.00004698737,0.00016794233,0.000115282164,0.07831394,0.0018179541,0.9142666,0.004320378,0.00005655136],"about_ca_topic_score_codex":0.0029602873,"about_ca_topic_score_gemma":0.0031222517,"teacher_disagreement_score":0.018042527,"about_ca_system_score_codex":0.0050041573,"about_ca_system_score_gemma":0.0016420361,"threshold_uncertainty_score":0.060358286},"labels":[],"label_agreement":null},{"id":"W6982391525","doi":"","title":"Idaho Health and Welfare: Treatment and Transitions Program Evaluation 2020, Year 2 Quarter 1 Report","year":2020,"lang":"en","type":"article","venue":"Scholar Works  (Boise State University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Substance Abuse and Mental Health Services Administration; U.S. Department of Health and Human Services","keywords":"Quarter (Canadian coin); Mental health; Program evaluation; Mental illness; Administration (probate law); Human services; Pilot program; Substance abuse","score_opus":0.026740880101894522,"score_gpt":0.28910185815821343,"score_spread":0.2623609780563189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6982391525","genre_codex":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19990279,0.003584038,0.0042865244,0.04166164,0.0050956532,0.14432286,0.4374837,0.0019076425,0.16175517],"genre_scores_gemma":[0.20106477,0.0052321823,0.02777121,0.032373518,0.0008714422,0.28789747,0.32736546,0.00045284434,0.116971135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9923029,0.0033842425,0.00037711347,0.00032023859,0.002415701,0.0011997655],"domain_scores_gemma":[0.98542863,0.0015101323,0.001147989,0.0007128304,0.0053349114,0.005865622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02303913,0.001261494,0.0013393792,0.0015296725,0.0029724,0.0039990246,0.0017855689,0.0019152954,0.025157368],"category_scores_gemma":[0.014811067,0.0009301569,0.0013502853,0.0009621457,0.0006722599,0.0018307606,0.0042937943,0.00289769,0.0072402423],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.019710215,0.023034649,0.020792926,0.0014611332,0.0003295479,0.00009790522,0.0005423989,0.0012807936,0.00094343163,0.0018960718,0.7677419,0.16216907],"study_design_scores_gemma":[0.04451957,0.03098458,0.42346403,0.0047732545,0.00079964334,0.0002140284,0.0033749614,0.0035493656,0.0051099635,0.002916086,0.48006436,0.00023015498],"about_ca_topic_score_codex":0.035442594,"about_ca_topic_score_gemma":0.09153597,"teacher_disagreement_score":0.035442594,"about_ca_system_score_codex":0.0075304983,"about_ca_system_score_gemma":0.031118719,"threshold_uncertainty_score":0.12184405},"labels":[],"label_agreement":null},{"id":"W6990684053","doi":"","title":"Domination and independence numbers of large 2-crossing-critical graphs","year":2023,"lang":"en","type":"article","venue":"DiRROS repository (University of Maribor)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Independence (probability theory); Upper and lower bounds; Domination analysis; Independence number; Class (philosophy)","score_opus":0.010468779005087268,"score_gpt":0.2632542755910387,"score_spread":0.25278549658595145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990684053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8725713,0.0022664254,0.07318249,0.00079708477,0.00006157998,0.000049105536,0.0011519834,0.0003264619,0.049593583],"genre_scores_gemma":[0.987177,0.00080809847,0.008701891,0.00008911377,0.000092272996,0.000048945567,0.0006245841,0.00007309021,0.002384988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994112,0.00009957634,0.000017469169,0.00016280192,0.00016432276,0.00014464484],"domain_scores_gemma":[0.99009573,0.007391002,0.00070930517,0.0004125235,0.00043252524,0.0009588134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000793742,0.0007020526,0.00042815885,0.003429128,0.00086638296,0.0014399696,0.0009029334,0.0004479367,0.0037940645],"category_scores_gemma":[0.007898049,0.00045843434,0.00037880594,0.0012152398,0.0016451002,0.0015037432,0.0010713623,0.0015504771,0.0003518199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001282783,0.00023879725,0.03849356,0.00076611177,0.00021867966,0.0012037812,0.0019340096,0.08831711,0.068025246,0.7125238,0.014780042,0.072216034],"study_design_scores_gemma":[0.00007226431,0.00012323042,0.032862578,0.00016296945,0.00013244116,0.0017051197,0.00038416742,0.18132813,0.019983923,0.75003535,0.013109578,0.00010031461],"about_ca_topic_score_codex":0.0010551065,"about_ca_topic_score_gemma":0.0019428021,"teacher_disagreement_score":0.0037940645,"about_ca_system_score_codex":0.0010727057,"about_ca_system_score_gemma":0.00036288935,"threshold_uncertainty_score":0.0126924515},"labels":[],"label_agreement":null},{"id":"W6991207653","doi":"","title":"Fractionally total colouring most graphs","year":2004,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Integer (computer science); Graph; Vertex (graph theory); Total coloring; Time complexity; Enhanced Data Rates for GSM Evolution","score_opus":0.015142649374151912,"score_gpt":0.2691662297670496,"score_spread":0.25402358039289774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991207653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36269984,0.00075794273,0.59751153,0.0011216789,0.000117991316,0.00015264828,0.00086688856,0.0018923349,0.03487926],"genre_scores_gemma":[0.73507285,0.0007035809,0.24434026,0.0003742339,0.00010463174,0.00013170214,0.0012922089,0.0006265619,0.017354026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991134,0.00015669345,0.00002786385,0.00028281775,0.00021964867,0.00019957402],"domain_scores_gemma":[0.99784863,0.00094368274,0.00015838224,0.0006833847,0.00024455323,0.00012139547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006741565,0.00072961906,0.00085670885,0.0007612917,0.0013056408,0.002601064,0.0011074741,0.00066677824,0.006378111],"category_scores_gemma":[0.004987471,0.00044493354,0.000943894,0.0016329297,0.0013165948,0.0027588275,0.0014010053,0.0011878138,0.00067289063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010230227,0.00020994864,0.0031481925,0.0006490968,0.00013279695,0.00018937902,0.0010516496,0.35352415,0.054218087,0.33728787,0.013191961,0.23537368],"study_design_scores_gemma":[0.00007695239,0.000120542936,0.0015510825,0.00006753352,0.000096285396,0.0002745046,0.00026209437,0.40510675,0.018792821,0.550942,0.02267214,0.000037227965],"about_ca_topic_score_codex":0.0061545465,"about_ca_topic_score_gemma":0.007349822,"teacher_disagreement_score":0.006378111,"about_ca_system_score_codex":0.0021637813,"about_ca_system_score_gemma":0.0013405394,"threshold_uncertainty_score":0.021336913},"labels":[],"label_agreement":null},{"id":"W6995280534","doi":"","title":"Interval Graphs","year":2016,"lang":"en","type":"article","venue":"Scholarship - Claremont (Claremont Colleges)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Interval graph; Interval (graph theory); Upper and lower bounds; Indifference graph; Clique; Function (biology); Chordal graph; Series (stratigraphy)","score_opus":0.03519933556200806,"score_gpt":0.29893635943405156,"score_spread":0.2637370238720435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6995280534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05763928,0.003001735,0.85274184,0.0035963946,0.00085664686,0.00016232178,0.0010685567,0.00062302535,0.080310166],"genre_scores_gemma":[0.60871035,0.004069501,0.35083783,0.0021994826,0.0016351207,0.00045051478,0.0016766693,0.00041744794,0.030002987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981437,0.0005069851,0.00008900425,0.00059560244,0.00044619417,0.00021857729],"domain_scores_gemma":[0.9904902,0.00594058,0.001192583,0.0009008298,0.0010244609,0.00045138306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001183596,0.0007579781,0.0009482982,0.002052714,0.001531431,0.0027517998,0.0019561043,0.0011709087,0.012609492],"category_scores_gemma":[0.011568702,0.00039437576,0.00088478974,0.0032575007,0.0018765418,0.0063619697,0.0015161033,0.0022177706,0.0015379889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004508176,0.00002408225,0.00052744057,0.00011273596,0.00001710422,0.00009870727,0.00015334763,0.010187707,0.0008262248,0.95037204,0.007018073,0.030617388],"study_design_scores_gemma":[0.0000127212,0.000027039614,0.00024614367,0.000033184206,0.00001372116,0.00027052112,0.00010449261,0.028467935,0.0005844622,0.9414957,0.0287306,0.000013557683],"about_ca_topic_score_codex":0.0013380488,"about_ca_topic_score_gemma":0.00078780705,"teacher_disagreement_score":0.012609492,"about_ca_system_score_codex":0.0014973975,"about_ca_system_score_gemma":0.00047200534,"threshold_uncertainty_score":0.042182922},"labels":[],"label_agreement":null},{"id":"W7019141620","doi":"","title":"FACES OF MATCHING POLYHEDRA","year":2016,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Set (abstract data type); Filter (signal processing); Matching (statistics); Noise (video); Intersection (aeronautics); Feature (linguistics)","score_opus":0.011393203437239053,"score_gpt":0.23584250092463035,"score_spread":0.2244492974873913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019141620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10510477,0.0006749621,0.7650918,0.0008351462,0.00020653613,0.000345813,0.0017939918,0.0007077601,0.12523918],"genre_scores_gemma":[0.44831702,0.0010089667,0.4739929,0.0005679391,0.00020936612,0.00070798537,0.003911465,0.00043215055,0.07085211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989819,0.00016890974,0.00005686855,0.00023116749,0.00032625438,0.00023474493],"domain_scores_gemma":[0.9992562,0.00035218272,0.00009193523,0.00012033929,0.00010087456,0.00007837418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050684507,0.0006671463,0.0006826382,0.001017706,0.0011203068,0.003009027,0.0016207943,0.0012887906,0.024799371],"category_scores_gemma":[0.0031227046,0.00070356636,0.0011459356,0.0013527799,0.0016493825,0.003049264,0.0024462952,0.0025395162,0.0025131041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014655688,0.00007097612,0.00038075095,0.00017678233,0.00001537882,0.00010303316,0.00029029415,0.049812894,0.002506028,0.8671929,0.0054930956,0.073811114],"study_design_scores_gemma":[0.00005459707,0.00007857061,0.0003271541,0.000071897135,0.000014621854,0.0001469545,0.0002918036,0.14325237,0.0033489729,0.8204126,0.03197735,0.000023154656],"about_ca_topic_score_codex":0.002871688,"about_ca_topic_score_gemma":0.00281634,"teacher_disagreement_score":0.024799371,"about_ca_system_score_codex":0.0014251792,"about_ca_system_score_gemma":0.0007429538,"threshold_uncertainty_score":0.082962155},"labels":[],"label_agreement":null},{"id":"W7019883598","doi":"","title":"Hypergraphs, existential closure, and related&#13;\\nproblems","year":2024,"lang":"en","type":"dissertation","venue":"Memorial University Research Repository (Memorial University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nucleofection; Hyporeflexia; Gestational period; TSG101; Diafiltration; Liquation","score_opus":0.019918904738613675,"score_gpt":0.26624533795293404,"score_spread":0.24632643321432035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019883598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10405496,0.007865011,0.6964749,0.0123808775,0.00068948185,0.00012338207,0.0006001518,0.0005835578,0.17722765],"genre_scores_gemma":[0.79343456,0.008808404,0.15333986,0.004300907,0.001436031,0.00045585466,0.0011786548,0.0005042599,0.036541555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971437,0.0009712911,0.00012788236,0.0008683131,0.0005369133,0.0003518486],"domain_scores_gemma":[0.98938984,0.0075526503,0.00052892877,0.0014561947,0.0006177973,0.00045460172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028569675,0.000826358,0.00063799066,0.0019393963,0.002928767,0.002923461,0.0017891192,0.0018868148,0.010225339],"category_scores_gemma":[0.00878889,0.0007063198,0.0015882857,0.0017907514,0.0100861015,0.011684631,0.0050360016,0.005424638,0.00081970636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005738397,0.000011221925,0.000116730895,0.00004953154,0.000003876285,0.00005445633,0.0002322935,0.00077089295,0.0001489994,0.99410665,0.00070347305,0.0037960294],"study_design_scores_gemma":[0.0000038833814,0.000011501449,0.00008416779,0.000035820914,0.000006389237,0.00008400885,0.00013990204,0.0016049648,0.00034261832,0.9897871,0.00789063,0.000009047431],"about_ca_topic_score_codex":0.0011357373,"about_ca_topic_score_gemma":0.0009739465,"teacher_disagreement_score":0.010225339,"about_ca_system_score_codex":0.0027220596,"about_ca_system_score_gemma":0.00093350763,"threshold_uncertainty_score":0.034207106},"labels":[],"label_agreement":null},{"id":"W7023757594","doi":"","title":"Paroles francophones de l'Ouest et du Nord canadiens","year":2012,"lang":"fr","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Government (linguistics); Subject (documents); Identity (music); Perspective (graphical)","score_opus":0.02974691159943568,"score_gpt":0.3027661443516184,"score_spread":0.27301923275218276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023757594","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45711604,0.02748335,0.0010249098,0.009980403,0.0016276474,0.000046654477,0.002453616,0.00015860863,0.5001087],"genre_scores_gemma":[0.6256013,0.011235822,0.0010512063,0.0014037372,0.00039181078,0.00010256586,0.0007931289,0.00009684372,0.35932362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876773,0.00026113275,0.000040955732,0.00018761535,0.0002207771,0.0005217928],"domain_scores_gemma":[0.99874,0.0004181789,0.00018852811,0.00006444199,0.0002110102,0.00037797083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008442493,0.0007388072,0.00055166095,0.0018575416,0.0066049537,0.0029879273,0.00042188968,0.0013913229,0.018469585],"category_scores_gemma":[0.0015964904,0.00034064281,0.00035706747,0.00294446,0.0013052368,0.00085386744,0.001794049,0.0030014308,0.0024228136],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017729033,0.0003636015,0.09368634,0.0008670777,0.000239456,0.014544036,0.0553985,0.0016952871,0.0075432397,0.46567458,0.11664973,0.24156526],"study_design_scores_gemma":[0.000054626715,0.00004653069,0.08929669,0.00030329236,0.00002555268,0.0011850863,0.007375521,0.00014731585,0.0004506631,0.0019287255,0.89914745,0.000038441547],"about_ca_topic_score_codex":0.39036718,"about_ca_topic_score_gemma":0.5339576,"teacher_disagreement_score":0.60963285,"about_ca_system_score_codex":0.007219512,"about_ca_system_score_gemma":0.005612013,"threshold_uncertainty_score":0.77619},"labels":[],"label_agreement":null},{"id":"W7024564512","doi":"","title":"Shifting visions gender and discourses ; [... consists a selection of articles presented at the eight biennial International Gender and Language Association (IGALA) conference, held in Vancouver, Canada, in 2014]","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Selection (genetic algorithm); Vision; Association (psychology); Focus (optics); Narrative","score_opus":0.026654099922477137,"score_gpt":0.2958584293949209,"score_spread":0.26920432947244377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024564512","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02687546,0.10184511,0.018918192,0.28405002,0.019020693,0.000067831555,0.000854501,0.00022886907,0.54813933],"genre_scores_gemma":[0.7576568,0.05201671,0.0052475515,0.028217437,0.012998923,0.00011948953,0.00079888845,0.0006692715,0.14227486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800044,0.001108026,0.000046093468,0.00023478351,0.00044718353,0.00016347633],"domain_scores_gemma":[0.9964637,0.0023251288,0.00022546077,0.00017645926,0.00045678567,0.00035257053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023459888,0.0006035152,0.0003692547,0.0027099047,0.006882751,0.0085385395,0.0007474647,0.0024850823,0.008595772],"category_scores_gemma":[0.0061098095,0.0002224857,0.0002696935,0.0034147648,0.017243465,0.011250618,0.0029220686,0.003808443,0.0014207326],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044507236,0.000008310809,0.00047635974,0.00023201178,0.000007202083,0.0001490026,0.08741519,0.00005669839,0.00038163588,0.7107552,0.17018215,0.030291747],"study_design_scores_gemma":[0.0000035879302,0.000007828312,0.0016474364,0.00047424046,0.0000051688025,0.00022271572,0.062050305,0.00011346212,0.00023323872,0.14831723,0.7869081,0.000016601642],"about_ca_topic_score_codex":0.020916415,"about_ca_topic_score_gemma":0.0347931,"teacher_disagreement_score":0.020916415,"about_ca_system_score_codex":0.0055332147,"about_ca_system_score_gemma":0.002625852,"threshold_uncertainty_score":0.04158932},"labels":[],"label_agreement":null},{"id":"W7027413379","doi":"","title":"Colourings and games on sparse graphs","year":2024,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Term (time); Graph; Graph theory; Feature (linguistics)","score_opus":0.019161081898827523,"score_gpt":0.2735406871183508,"score_spread":0.25437960521952324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027413379","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16828483,0.0019327712,0.29609805,0.009310876,0.0009662694,0.00039635994,0.0024017105,0.0015156076,0.5190935],"genre_scores_gemma":[0.7030818,0.0028151455,0.098244704,0.0010747069,0.00038857988,0.0005070813,0.002498709,0.00062226853,0.19076699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995322,0.00015808175,0.000018613044,0.0000733437,0.00013030041,0.00008741268],"domain_scores_gemma":[0.9986633,0.00068474736,0.000101028665,0.00016305379,0.00015415407,0.00023361456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041493826,0.00059638906,0.00041033875,0.001145053,0.0010881543,0.002143035,0.000612966,0.00073907943,0.044358082],"category_scores_gemma":[0.0024889945,0.00042062975,0.0005616412,0.0012230515,0.0014362513,0.0027249916,0.0015909357,0.0017774869,0.003246266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000319804,0.000015556761,0.00019258418,0.000064825166,0.000005708982,0.00006965478,0.00015039321,0.0034776097,0.0009156861,0.9716259,0.012235158,0.011215086],"study_design_scores_gemma":[0.000013528563,0.000008630251,0.00017841709,0.000018669076,0.000003836157,0.000049081926,0.00005930565,0.005526114,0.0003241107,0.97778887,0.016022649,0.0000067570118],"about_ca_topic_score_codex":0.003027275,"about_ca_topic_score_gemma":0.004141928,"teacher_disagreement_score":0.044358082,"about_ca_system_score_codex":0.0013208959,"about_ca_system_score_gemma":0.00044083924,"threshold_uncertainty_score":0.14839256},"labels":[],"label_agreement":null},{"id":"W7030132810","doi":"","title":"The maximum nullity of a complete edge subdivision graph is equal to it zero forcing number","year":2014,"lang":"en","type":"article","venue":"oURspace (University of Regina)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Subdivision; Graph; Forcing (mathematics); Rank (graph theory); Enhanced Data Rates for GSM Evolution; Zero (linguistics); Projection (relational algebra); Tree (set theory); Complete graph","score_opus":0.024459704155524446,"score_gpt":0.2583607915366228,"score_spread":0.23390108738109833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030132810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9186127,0.00011249989,0.06547719,0.0008250862,0.00004401049,0.000019465628,0.00047240977,0.00020051698,0.014236091],"genre_scores_gemma":[0.9831845,0.00008629097,0.012732522,0.000096149575,0.000050268558,0.00002884424,0.00039007055,0.00007355155,0.0033578405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920505,0.00016089134,0.000046999303,0.00021695025,0.00017129655,0.00019877133],"domain_scores_gemma":[0.9945785,0.002681836,0.00060554926,0.0008025599,0.000627483,0.00070418057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009456303,0.00037874747,0.00066416716,0.0013443219,0.0013191685,0.0018024585,0.0007699559,0.00069899834,0.0060910634],"category_scores_gemma":[0.0053882287,0.0003352814,0.00055772776,0.0006166606,0.0032437625,0.0030417182,0.0013710121,0.0010853311,0.00065113226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004127598,0.00007846247,0.010233035,0.000168268,0.000038073766,0.00016722897,0.0006725689,0.009231584,0.02280609,0.924313,0.0036307902,0.028248241],"study_design_scores_gemma":[0.00004597981,0.00015393576,0.005341886,0.00003827721,0.000041708478,0.00047581454,0.00043359556,0.024538042,0.015870867,0.9482253,0.0047609736,0.00007354991],"about_ca_topic_score_codex":0.0008072205,"about_ca_topic_score_gemma":0.0010861766,"teacher_disagreement_score":0.0060910634,"about_ca_system_score_codex":0.00071655633,"about_ca_system_score_gemma":0.00056839274,"threshold_uncertainty_score":0.020376623},"labels":[],"label_agreement":null},{"id":"W7034786469","doi":"","title":"Women, power, and political representation: Canadian and comparative perspectives","year":2021,"lang":"en","type":"article","venue":"CentAUR (University of Reading)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Politics; Government (linguistics); Work (physics); Agency (philosophy)","score_opus":0.03177474351319209,"score_gpt":0.2763056241026017,"score_spread":0.24453088058940958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034786469","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096476294,0.09243092,0.0013349376,0.102865174,0.00077640463,0.000034524517,0.00066855847,0.000023409899,0.70538986],"genre_scores_gemma":[0.8958459,0.059505444,0.0007553363,0.005024003,0.000365982,0.000031822536,0.00021082383,0.000041597606,0.038219128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9971336,0.0006686516,0.000055313994,0.00022354366,0.00080307695,0.0011158129],"domain_scores_gemma":[0.99533725,0.0024576702,0.00023105406,0.000108958346,0.0012432149,0.0006218241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043741283,0.0005065437,0.0008047616,0.00695838,0.019102795,0.012804615,0.001642485,0.0024884155,0.021165943],"category_scores_gemma":[0.007292429,0.0003091151,0.0003455191,0.01977327,0.02038066,0.004023563,0.002547738,0.002664998,0.00037621087],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011332372,0.000031502066,0.0044439784,0.00024217239,0.000017648947,0.00021913825,0.04989243,0.00031244758,0.00014472652,0.8668257,0.025572464,0.05218446],"study_design_scores_gemma":[0.00004170669,0.000039847884,0.035305697,0.0012419447,0.00006208184,0.00025512167,0.20507698,0.00048837013,0.00037967623,0.10372286,0.653282,0.00010374061],"about_ca_topic_score_codex":0.97893804,"about_ca_topic_score_gemma":0.98866045,"teacher_disagreement_score":0.08743605,"about_ca_system_score_codex":0.08743605,"about_ca_system_score_gemma":0.06014351,"threshold_uncertainty_score":0.63439596},"labels":[],"label_agreement":null},{"id":"W7068177990","doi":"","title":"Nutrient intake and lifestyle patterns of pregnant Indigenous women residing in northern Manitoban communities: a pilot study for implications for fetal alcohol spectrum disorder","year":2023,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pregnancy; Indigenous; Fetal Alcohol Spectrum Disorder; Nutrient; Alcohol intake; Alcohol consumption; Consumption (sociology); Public health; Gestation","score_opus":0.03669118404247049,"score_gpt":0.2745380118242164,"score_spread":0.2378468277817459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7068177990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9995865,0.00001707291,0.000021733682,0.000020083375,8.971682e-7,0.000027184804,0.000042264885,8.1341847e-7,0.00028339782],"genre_scores_gemma":[0.9987826,0.000106201165,0.00021879125,0.00004607767,0.0000028622237,0.00007664973,0.00007870464,0.0000014524395,0.0006866482],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99981636,0.00005129374,0.000011778775,0.000034101515,0.000027312084,0.000059216643],"domain_scores_gemma":[0.999796,0.000031151147,0.000040934956,0.000018607498,0.000044309683,0.00006902318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000356192,0.0003568835,0.00025108334,0.00054294546,0.0020907342,0.00052009895,0.00036118246,0.00030356352,0.0013735207],"category_scores_gemma":[0.0007361279,0.0003908102,0.0002988452,0.00083843066,0.00045782054,0.00030806332,0.0006920848,0.00043621816,0.00023307251],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016384495,0.0006870595,0.9601996,0.00004712097,0.000028236029,0.0010635196,0.02914757,0.000032939308,0.003381835,0.000052474275,0.00013308565,0.0050627626],"study_design_scores_gemma":[0.000012624281,0.0003586312,0.9701836,0.000016027265,0.000023659153,0.00025594563,0.028537843,0.00009448133,0.00016150899,0.000028060887,0.0003196399,0.000007957722],"about_ca_topic_score_codex":0.27116793,"about_ca_topic_score_gemma":0.38184726,"teacher_disagreement_score":0.72883207,"about_ca_system_score_codex":0.0010111973,"about_ca_system_score_gemma":0.0013595504,"threshold_uncertainty_score":0.5391791},"labels":[],"label_agreement":null},{"id":"W7070140790","doi":"","title":"Counting Bases","year":2006,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Matroid; Pfaffian; Bipartite graph; Class (philosophy); Polytope; Matching (statistics); Characterization (materials science); Matroid partitioning","score_opus":0.011495399728766344,"score_gpt":0.22712273903125,"score_spread":0.21562733930248365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7070140790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15901777,0.0013338977,0.6994186,0.0021060982,0.0006081044,0.0004218387,0.00284038,0.0011240775,0.13312915],"genre_scores_gemma":[0.64244807,0.0009456833,0.3052692,0.0005844868,0.00050753745,0.0005628468,0.0033517089,0.0004043195,0.045926187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554956,0.0006257925,0.0002984073,0.0016386752,0.0012182277,0.00066942413],"domain_scores_gemma":[0.9945873,0.0018258512,0.0005009296,0.0016536253,0.0009830125,0.0004492112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017130899,0.0010289081,0.0012597602,0.003926887,0.003423817,0.0053152167,0.002541308,0.0017147689,0.013553936],"category_scores_gemma":[0.010580712,0.00087931595,0.0020243505,0.0034822873,0.0037786253,0.012808793,0.0053315987,0.003411156,0.0020471292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089467794,0.00004541862,0.0012774243,0.00008684037,0.000024133265,0.00007600306,0.0003168752,0.0030491196,0.0014791576,0.9472954,0.004785734,0.04147438],"study_design_scores_gemma":[0.000024022815,0.00005970592,0.00052719313,0.00006786983,0.000029847079,0.0003262288,0.00017348002,0.020137494,0.004704123,0.93715507,0.03676311,0.0000319787],"about_ca_topic_score_codex":0.0023002,"about_ca_topic_score_gemma":0.0016448605,"teacher_disagreement_score":0.013553936,"about_ca_system_score_codex":0.003383362,"about_ca_system_score_gemma":0.0016202967,"threshold_uncertainty_score":0.045342445},"labels":[],"label_agreement":null},{"id":"W7070373081","doi":"","title":"Optimization and packings of T-joins and T-cuts","year":2011,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Simple (philosophy); Graph; Cardinality (data modeling); Combinatorial optimization; Simple graph; Optimization problem; Planar","score_opus":0.020072405753269556,"score_gpt":0.25675361521796325,"score_spread":0.2366812094646937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7070373081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47765693,0.002375862,0.4777992,0.0015008987,0.00025069623,0.00028953393,0.0009840366,0.00061523257,0.03852762],"genre_scores_gemma":[0.68699825,0.0023928755,0.29355422,0.0003408292,0.00026670255,0.0002695516,0.001389001,0.0005201167,0.014268414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988205,0.00027716314,0.00008253296,0.0002723841,0.00023357313,0.00031387623],"domain_scores_gemma":[0.996899,0.0016258452,0.00062878244,0.00033548046,0.0001507709,0.00036004657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995579,0.00094384264,0.0013646251,0.00096207,0.000864874,0.0028210497,0.0011544934,0.0012030322,0.007047002],"category_scores_gemma":[0.0061001116,0.0010099818,0.0011698963,0.002158994,0.0015551767,0.0047466997,0.0019029903,0.0016429073,0.00090912095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009895866,0.0004253018,0.0035739916,0.0005992099,0.00012166894,0.000560182,0.00047142798,0.55065745,0.014120694,0.2950309,0.012015649,0.121433854],"study_design_scores_gemma":[0.00010581563,0.0004454261,0.002040968,0.000085306594,0.00006651799,0.000466876,0.00043754478,0.6585575,0.008266165,0.3204357,0.009042958,0.000049362767],"about_ca_topic_score_codex":0.0018851121,"about_ca_topic_score_gemma":0.0016911244,"teacher_disagreement_score":0.007047002,"about_ca_system_score_codex":0.0014768598,"about_ca_system_score_gemma":0.0007297603,"threshold_uncertainty_score":0.023574531},"labels":[],"label_agreement":null},{"id":"W7093659350","doi":"","title":"Interval Graphs","year":2016,"lang":"","type":"article","venue":"Scholarship - Claremont (Claremont Colleges)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Interval graph; Interval (graph theory); Upper and lower bounds; Indifference graph; Clique; Function (biology); Chordal graph; Series (stratigraphy)","score_opus":0.04414187088998066,"score_gpt":0.30948742010610275,"score_spread":0.2653455492161221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093659350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058858424,0.0030869783,0.85012925,0.0037191848,0.0008716752,0.00016243677,0.0010719682,0.0006255461,0.08147449],"genre_scores_gemma":[0.61266583,0.0041357465,0.34665823,0.0022494413,0.0016574505,0.00044402567,0.0016688681,0.00042529657,0.03009504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817276,0.0004965958,0.00008693953,0.0005869132,0.00044126785,0.0002155288],"domain_scores_gemma":[0.9905847,0.0058652307,0.0011851946,0.0008924482,0.0010223755,0.00044997974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011777506,0.00075497775,0.00094143476,0.0020339554,0.00152536,0.00274615,0.0019532617,0.0011721831,0.012478513],"category_scores_gemma":[0.011611555,0.00039360655,0.0008832635,0.0032321063,0.0018726598,0.0063527403,0.0015101194,0.0022385558,0.0015306021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000449095,0.000023934334,0.000525358,0.000111716596,0.000016909155,0.00009796703,0.00015417051,0.010030877,0.0008250379,0.95075065,0.0070645255,0.030353997],"study_design_scores_gemma":[0.000012611576,0.000026783324,0.000246611,0.000033121978,0.0000135732835,0.00026924702,0.00010490765,0.028212221,0.0005867739,0.9420362,0.028444543,0.0000134798875],"about_ca_topic_score_codex":0.0013520283,"about_ca_topic_score_gemma":0.0007898803,"teacher_disagreement_score":0.012478513,"about_ca_system_score_codex":0.0014976114,"about_ca_system_score_gemma":0.00047149314,"threshold_uncertainty_score":0.04174477},"labels":[],"label_agreement":null},{"id":"W7100779552","doi":"","title":"List Partitions","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Partition (number theory); Skew; Homogeneous; Clique; Upper and lower bounds; Time complexity; Homomorphism","score_opus":0.03197091546449135,"score_gpt":0.3119377880094662,"score_spread":0.2799668725449749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100779552","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012302951,0.00426731,0.32510996,0.005561687,0.0045674383,0.0020114072,0.04963073,0.046119153,0.5504294],"genre_scores_gemma":[0.109538026,0.0034771643,0.23121321,0.0046451227,0.0016479216,0.0021156284,0.10066376,0.014057672,0.53264153],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99594986,0.0005786291,0.00033928035,0.0010658265,0.0013971238,0.0006691874],"domain_scores_gemma":[0.9938852,0.0009491476,0.00029423615,0.0025139812,0.0017969519,0.00056047237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016460889,0.0017401669,0.0014728759,0.0033682003,0.003961508,0.007858681,0.0043354314,0.0021913585,0.27553302],"category_scores_gemma":[0.009009212,0.0011233744,0.002006116,0.004818365,0.0013376093,0.012191169,0.007440871,0.0029032696,0.15897618],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057188707,0.0001500223,0.0009665382,0.00068548735,0.00006009565,0.0002725734,0.0005169556,0.0029231275,0.0030522041,0.23767732,0.5030853,0.25003847],"study_design_scores_gemma":[0.000051628256,0.00006145402,0.00027022677,0.000111329166,0.000026826925,0.00034367392,0.0002211778,0.0036747928,0.0027143555,0.099323705,0.8931563,0.000044603643],"about_ca_topic_score_codex":0.0024004346,"about_ca_topic_score_gemma":0.003475148,"teacher_disagreement_score":0.27553302,"about_ca_system_score_codex":0.0032738755,"about_ca_system_score_gemma":0.0033508313,"threshold_uncertainty_score":0.9217498},"labels":[],"label_agreement":null},{"id":"W7106241308","doi":"10.1016/j.tcs.2025.115658","title":"Distance-restricted firefighting on finite graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; Verafin (Canada); University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Neighbourhood (mathematics); Firefighting; Vertex (graph theory); Graph; Rest (music); Integer (computer science)","score_opus":0.013059116869591521,"score_gpt":0.29111173967843534,"score_spread":0.2780526228088438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106241308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4501226,0.00062196614,0.53516287,0.0013077147,0.000040458508,0.00017237612,0.00079306855,0.00050756964,0.011271409],"genre_scores_gemma":[0.93734086,0.00038509292,0.057164792,0.00017194619,0.000051941057,0.000110614696,0.0005224575,0.00008791002,0.00416438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983557,0.00062092644,0.0000937026,0.00039840335,0.00026667432,0.00026454378],"domain_scores_gemma":[0.9859282,0.011202151,0.0009648182,0.0009201729,0.00031843572,0.00066627644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017487819,0.00086613325,0.0011563771,0.0006997932,0.0006872909,0.0019775454,0.002663754,0.0013056882,0.0031823749],"category_scores_gemma":[0.013030667,0.0006518579,0.0009409837,0.0010302067,0.002983751,0.0062220115,0.0019234666,0.0022805734,0.00028946262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000506313,0.00016542831,0.0021226644,0.0002787813,0.00006783883,0.00032739178,0.0006208413,0.73448724,0.0034290738,0.23856749,0.0020446556,0.017382296],"study_design_scores_gemma":[0.0000591486,0.00006352737,0.00038673988,0.000022313008,0.00001845067,0.00015844876,0.00014226775,0.59852403,0.0013966988,0.39808667,0.0011189089,0.000022822354],"about_ca_topic_score_codex":0.0038149,"about_ca_topic_score_gemma":0.0037409698,"teacher_disagreement_score":0.0038149,"about_ca_system_score_codex":0.002692645,"about_ca_system_score_gemma":0.00082887965,"threshold_uncertainty_score":0.019536555},"labels":[],"label_agreement":null},{"id":"W7106501654","doi":"10.1016/j.procs.2025.10.337","title":"Cops and Robbers on Token Graphs","year":2025,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; British Columbia Institute of Technology","funders":"Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; Universidad Nacional Autónoma de México; Consejo Nacional de Ciencia y Tecnología","keywords":"Graph; Vertex (graph theory); Security token; Set (abstract data type); Integer (computer science)","score_opus":0.010810462332243493,"score_gpt":0.28424886563037566,"score_spread":0.2734384032981322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106501654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.376257,0.00030854924,0.5912141,0.0005488017,0.00010391567,0.0001998282,0.00045105067,0.0003455464,0.030571083],"genre_scores_gemma":[0.8894248,0.0003044405,0.088402405,0.00014495378,0.00006445278,0.00030075447,0.00046525116,0.00020395647,0.020689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998379,0.0005243443,0.00007011434,0.00040918365,0.0002694358,0.0003479285],"domain_scores_gemma":[0.9962251,0.0016565056,0.00069355697,0.00038414248,0.00021882373,0.00082184724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009879274,0.0009493551,0.00097234006,0.0009897646,0.0012054611,0.0017446597,0.0013950744,0.0009497807,0.009624385],"category_scores_gemma":[0.0058315373,0.0004952904,0.0007088258,0.00072659174,0.0022850013,0.004539774,0.0019480676,0.0013174383,0.0007472289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003103899,0.00006629395,0.0012984583,0.0001275643,0.00004020122,0.00034321923,0.00033564994,0.061689526,0.003327385,0.9171847,0.0028301983,0.012446469],"study_design_scores_gemma":[0.000059703732,0.00015501586,0.0010580217,0.00003890891,0.000034201494,0.00034154448,0.0003627436,0.25595516,0.0026659623,0.7287329,0.01055712,0.000038739854],"about_ca_topic_score_codex":0.0016459376,"about_ca_topic_score_gemma":0.0014976464,"teacher_disagreement_score":0.009624385,"about_ca_system_score_codex":0.0015579179,"about_ca_system_score_gemma":0.0006846879,"threshold_uncertainty_score":0.03219682},"labels":[],"label_agreement":null},{"id":"W7108482857","doi":"10.61091/jcmcc128-21","title":"Changing and unchanging of the connected domination number of a graph","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Domination analysis; Graph; Connected component; Connectivity; Path graph; Path (computing); Dominating set; Graph power","score_opus":0.01245190482271425,"score_gpt":0.28795091781680454,"score_spread":0.2754990129940903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108482857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80050725,0.00023356381,0.13278079,0.0005479585,0.00010792268,0.00005806892,0.00074919686,0.0010885255,0.0639268],"genre_scores_gemma":[0.9673346,0.00013012365,0.023016708,0.00006915549,0.000030919957,0.000055681303,0.00035786803,0.00024116859,0.008763885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956626,0.00006304431,0.000013226177,0.00016177342,0.000092826565,0.000102903905],"domain_scores_gemma":[0.99767894,0.0010696958,0.00016309218,0.00040217844,0.00033277692,0.0003534239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046616746,0.00033689867,0.0002481139,0.001757971,0.0009549946,0.0015676881,0.00072438695,0.0004351543,0.009070158],"category_scores_gemma":[0.0049494887,0.00018522539,0.0003867231,0.0010668173,0.0012368336,0.0029180616,0.0007750201,0.00062599994,0.00064774667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011798207,0.00022889761,0.014763274,0.00028328176,0.00007049087,0.0008632119,0.0019925411,0.0875312,0.06184502,0.6116183,0.012868389,0.20675561],"study_design_scores_gemma":[0.0000855629,0.00017863749,0.01564713,0.00008943181,0.00010333422,0.0010275159,0.0013314447,0.30040646,0.03982377,0.6095703,0.031635776,0.00010072479],"about_ca_topic_score_codex":0.0024537107,"about_ca_topic_score_gemma":0.0026975574,"teacher_disagreement_score":0.009070158,"about_ca_system_score_codex":0.0011127372,"about_ca_system_score_gemma":0.0006412892,"threshold_uncertainty_score":0.030342698},"labels":[],"label_agreement":null},{"id":"W7109980574","doi":"10.4230/lipics.itcs.2025.67","title":"Error-Correcting Graph Codes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Line graph; Null graph; Voltage graph; Butterfly graph; Hamming graph; Hamming code; Block graph; Linear code; Graph property; Block code","score_opus":0.019195820346420592,"score_gpt":0.31439216607789056,"score_spread":0.29519634573146997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109980574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053436518,0.0040242,0.90175605,0.0016880357,0.000896621,0.00019967882,0.0006953157,0.0016714167,0.03563222],"genre_scores_gemma":[0.6044688,0.00495355,0.35969523,0.00154645,0.00044751936,0.00024291653,0.0011400827,0.0004086042,0.027096862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987692,0.00020374809,0.00005350228,0.00031051997,0.00048817374,0.00017487131],"domain_scores_gemma":[0.99685043,0.001038194,0.00031538427,0.001010181,0.0006715979,0.0001141327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060438557,0.0007131535,0.0005907777,0.0010180871,0.0009136952,0.0010914078,0.00130786,0.0011243831,0.0035170873],"category_scores_gemma":[0.0046228827,0.00023899475,0.00047419252,0.0013552351,0.0016423082,0.0016733698,0.0016013896,0.0015386055,0.0014648555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016892541,0.000075574564,0.0012842672,0.00054998684,0.00006215877,0.00032588065,0.0002886211,0.07380008,0.019573985,0.74268776,0.010044295,0.15113841],"study_design_scores_gemma":[0.000076775366,0.00019984179,0.0008812641,0.00023441885,0.00009440137,0.0016222768,0.00013227618,0.1945839,0.052783135,0.6330144,0.116275996,0.00010131372],"about_ca_topic_score_codex":0.0012860647,"about_ca_topic_score_gemma":0.0014228657,"teacher_disagreement_score":0.0035170873,"about_ca_system_score_codex":0.0009545862,"about_ca_system_score_gemma":0.0010728172,"threshold_uncertainty_score":0.011765838},"labels":[],"label_agreement":null},{"id":"W7110189454","doi":"10.4230/lipics.socg.2025.19","title":"Polychromatic Coloring of Tuples in Hypergraphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hypergraph; Tuple; Set (abstract data type); Constant (computer programming); Characterization (materials science)","score_opus":0.012267265345861035,"score_gpt":0.292994078523558,"score_spread":0.280726813177697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110189454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22465816,0.0017318191,0.74211824,0.0013288262,0.00023558701,0.00025679125,0.0024532455,0.0017651343,0.025452193],"genre_scores_gemma":[0.7137991,0.0012662287,0.27111697,0.00078399514,0.0003188216,0.00035304204,0.0025730508,0.0004778062,0.009310901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975636,0.00076427107,0.00013321047,0.00070886343,0.00043027944,0.00039980165],"domain_scores_gemma":[0.9918522,0.003783607,0.0009936169,0.0018621647,0.0008636373,0.0006446953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012441154,0.0007910015,0.0007565226,0.0013882417,0.0015169069,0.002838501,0.0011275972,0.0009130621,0.0058842925],"category_scores_gemma":[0.006868665,0.0010397007,0.0009642315,0.0023845853,0.001743347,0.0045201294,0.001684702,0.0021816315,0.0009804099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009082689,0.000309174,0.01071647,0.00075048435,0.0001936023,0.0011709221,0.0019341564,0.09537442,0.037828207,0.6968847,0.022906529,0.13102303],"study_design_scores_gemma":[0.00008391801,0.0001570812,0.003931591,0.00012110128,0.00008017217,0.0013672797,0.0006288961,0.17323017,0.014820129,0.7759077,0.029577507,0.000094574614],"about_ca_topic_score_codex":0.0022708552,"about_ca_topic_score_gemma":0.0023042755,"teacher_disagreement_score":0.0058842925,"about_ca_system_score_codex":0.0020769078,"about_ca_system_score_gemma":0.00095227745,"threshold_uncertainty_score":0.01968491},"labels":[],"label_agreement":null},{"id":"W7110215014","doi":"10.4230/lipics.stacs.2025.64","title":"Cluster Editing on Cographs and Related Classes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Time complexity; Permutation (music); Upper and lower bounds; Connected component; Computational complexity theory; Cograph","score_opus":0.010841416548416588,"score_gpt":0.28794879680089236,"score_spread":0.2771073802524758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110215014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23443843,0.0015476693,0.7120156,0.0038599067,0.00031928584,0.000649098,0.0039983136,0.0037922806,0.03937941],"genre_scores_gemma":[0.69480884,0.0015202286,0.2677998,0.0013216935,0.0006871804,0.000538248,0.0067333956,0.0009596547,0.025630947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971636,0.00037629,0.00012041239,0.0013291227,0.000531518,0.00047905263],"domain_scores_gemma":[0.9905019,0.0049116346,0.00099495,0.0021524066,0.0007084591,0.00073066336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012419434,0.0010410408,0.0013136094,0.0018702407,0.003234659,0.0034463217,0.002842019,0.0020009018,0.009127474],"category_scores_gemma":[0.008436296,0.0006033271,0.0015628611,0.0035199195,0.0022659549,0.007839876,0.002734846,0.0025494036,0.0011472125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033448942,0.0002906237,0.0028815628,0.0006210364,0.00008233922,0.0005109831,0.0012189355,0.07990434,0.0050466866,0.762904,0.02510935,0.12109559],"study_design_scores_gemma":[0.00006369855,0.000051196203,0.0013928184,0.000047977795,0.00004109833,0.0005449722,0.00029967228,0.14213659,0.0026965593,0.8206153,0.032062996,0.000047136098],"about_ca_topic_score_codex":0.005447012,"about_ca_topic_score_gemma":0.004323409,"teacher_disagreement_score":0.009127474,"about_ca_system_score_codex":0.0036577643,"about_ca_system_score_gemma":0.0016784342,"threshold_uncertainty_score":0.030534446},"labels":[],"label_agreement":null},{"id":"W7110406314","doi":"10.4230/lipics.icalp.2025.37","title":"Satisfiability of Commutative vs. Non-Commutative CSPs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; UK Research and Innovation","keywords":"Satisfiability; Boolean satisfiability problem; Constraint satisfaction problem; Hilbert space; Commutative property; Maximum satisfiability problem; Dimension (graph theory)","score_opus":0.011625649098114992,"score_gpt":0.31388914808129603,"score_spread":0.30226349898318106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110406314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57454115,0.0025085064,0.38600913,0.007414099,0.00021399296,0.00024028058,0.0011500655,0.000957821,0.026965005],"genre_scores_gemma":[0.9508301,0.0006576402,0.044126853,0.00050994364,0.00021020338,0.00012468589,0.0007003416,0.00009302063,0.0027472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563307,0.0015800204,0.00036209731,0.00086170674,0.0010818748,0.00048125596],"domain_scores_gemma":[0.97837436,0.017009493,0.0013105304,0.0014151818,0.0012089185,0.00068152684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004355677,0.00046160872,0.0007325023,0.00071427744,0.0010997353,0.002521988,0.001426764,0.000943679,0.0029168038],"category_scores_gemma":[0.018378695,0.0006210713,0.0014318363,0.0012050816,0.0032348684,0.0077038812,0.002608687,0.0034652785,0.000270433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028715204,0.0001455711,0.002264925,0.000336069,0.00012145117,0.00071067415,0.0010677174,0.040468466,0.005093822,0.9244668,0.0023648147,0.022672424],"study_design_scores_gemma":[0.000099159406,0.000039164428,0.00054379535,0.000023397035,0.00006361672,0.00023678782,0.00027668916,0.12324058,0.0053766244,0.86777145,0.0023010916,0.000027648117],"about_ca_topic_score_codex":0.0033034333,"about_ca_topic_score_gemma":0.0023804135,"teacher_disagreement_score":0.004355677,"about_ca_system_score_codex":0.0015107603,"about_ca_system_score_gemma":0.0018192581,"threshold_uncertainty_score":0.023035347},"labels":[],"label_agreement":null},{"id":"W7110422314","doi":"10.4230/lipics.wads.2025.42","title":"The Parameterized Landscape of Labeled Graph Contractions","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Treewidth; Graph; Degeneracy (biology); Contraction (grammar); Computational complexity theory; Upper and lower bounds","score_opus":0.012420816385483684,"score_gpt":0.2946825092797038,"score_spread":0.2822616928942201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110422314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48436156,0.0010405829,0.4844436,0.007564646,0.00008101868,0.00023915584,0.0014517764,0.0010951457,0.019722637],"genre_scores_gemma":[0.8637109,0.0006896736,0.1259115,0.00094444246,0.000174484,0.00048464126,0.0020700095,0.0007471447,0.0052672857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922105,0.0032650083,0.00037211186,0.0021070407,0.0014190282,0.0006262954],"domain_scores_gemma":[0.9579055,0.029532813,0.0031529346,0.0066643376,0.0012196723,0.0015247249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042827916,0.0010578175,0.0019013481,0.0009166861,0.0019084131,0.004616837,0.003790161,0.0031836121,0.007710696],"category_scores_gemma":[0.039133407,0.001074896,0.0019248548,0.0022788025,0.004251015,0.015064164,0.0041684923,0.0048933956,0.0007076403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001020273,0.0003566141,0.005864542,0.00069921906,0.0002158668,0.00059241644,0.0012202478,0.3476869,0.01124833,0.5593244,0.007873743,0.06389754],"study_design_scores_gemma":[0.00011703257,0.00010176629,0.0008790993,0.000050802584,0.000044104763,0.000353492,0.00027842683,0.37910998,0.0023655933,0.6122378,0.0044246954,0.000037251888],"about_ca_topic_score_codex":0.0012401732,"about_ca_topic_score_gemma":0.0012611115,"teacher_disagreement_score":0.007710696,"about_ca_system_score_codex":0.0031332627,"about_ca_system_score_gemma":0.0016975276,"threshold_uncertainty_score":0.025794864},"labels":[],"label_agreement":null},{"id":"W7110599578","doi":"","title":"Graph Theory Notes for MATH 2070 and MATH 3370","year":2022,"lang":"en","type":"book","venue":"Mspace (University of Manitoba)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph theory; Graph; Cover (algebra); Bibliography; Reading list; Mathematical logic; Algebra over a field","score_opus":0.021505072085345155,"score_gpt":0.22584850047498467,"score_spread":0.2043434283896395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110599578","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067915797,0.002283468,0.00408242,0.00307978,0.0024885556,0.00008213922,0.0045672758,0.0010459576,0.9816913],"genre_scores_gemma":[0.0026942699,0.0021827894,0.0036436105,0.0009889001,0.0005662961,0.00009613258,0.0046654963,0.0011996666,0.9839627],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996111,0.000025381754,0.000009768689,0.000067037385,0.00025569936,0.000031074625],"domain_scores_gemma":[0.99929583,0.00013037946,0.000035099787,0.000097365155,0.00029229347,0.00014893721],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033780694,0.0011903759,0.0007508948,0.0015923831,0.0012644726,0.0025956256,0.0009856279,0.0007506347,0.4682648],"category_scores_gemma":[0.0015022226,0.00056112005,0.00055343815,0.0036876341,0.00061920803,0.0016750499,0.0011450071,0.002694906,0.31308028],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074746795,0.00002300114,0.000064359214,0.000078115954,0.0000026294279,0.000018328876,0.000045179615,0.000107600645,0.00037655747,0.016805055,0.94196373,0.04050812],"study_design_scores_gemma":[0.000003731391,0.000006575743,0.0003042796,0.00006647151,0.0000018519614,0.000052002215,0.000026834135,0.00012024241,0.00015342367,0.005735096,0.99352586,0.0000035983098],"about_ca_topic_score_codex":0.008993853,"about_ca_topic_score_gemma":0.017189069,"teacher_disagreement_score":0.4682648,"about_ca_system_score_codex":0.003282696,"about_ca_system_score_gemma":0.0025472995,"threshold_uncertainty_score":0.75845575},"labels":[],"label_agreement":null},{"id":"W7110872679","doi":"10.4230/lipics.fsttcs.2025.10","title":"Cat Herding Game Played on Infinite Trees","year":2025,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Game tree; Graph; Repeated game; Herding; Vertex (graph theory); Combinatorial game theory; Tree (set theory); Measure (data warehouse)","score_opus":0.015020762540071576,"score_gpt":0.2648626783205169,"score_spread":0.24984191578044534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110872679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.738638,0.00026024066,0.18315731,0.0012798883,0.00010961907,0.00016227122,0.00041413662,0.00044754168,0.075531006],"genre_scores_gemma":[0.9717643,0.0000760138,0.017986402,0.00011424242,0.000013539421,0.00007771452,0.00021095523,0.000034023884,0.009722772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993217,0.00022176457,0.00004624508,0.00013813197,0.00011915024,0.00015305381],"domain_scores_gemma":[0.9989531,0.0005401473,0.00006736755,0.00007849595,0.00008909834,0.00027180082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062926573,0.00030204357,0.0005734294,0.00045517422,0.0013656528,0.00227753,0.0008238543,0.0009052481,0.0050387876],"category_scores_gemma":[0.002020473,0.00021553555,0.0004819106,0.00037501723,0.0019119522,0.0026898114,0.0015813998,0.0010815164,0.00035444446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003680807,0.000076510354,0.0015818995,0.00009816379,0.000028855286,0.00069394964,0.0013277604,0.008598678,0.008356103,0.9681341,0.0015171592,0.009218655],"study_design_scores_gemma":[0.00010806872,0.00032394734,0.0016608714,0.000063646214,0.0000618104,0.00073669734,0.0012671156,0.14135733,0.0046949633,0.831057,0.018597612,0.00007100912],"about_ca_topic_score_codex":0.0022347835,"about_ca_topic_score_gemma":0.0027381824,"teacher_disagreement_score":0.0050387876,"about_ca_system_score_codex":0.0014872935,"about_ca_system_score_gemma":0.0006434314,"threshold_uncertainty_score":0.016856432},"labels":[],"label_agreement":null},{"id":"W7115031712","doi":"","title":"On colouring graphs with forbidden 7-vertex minors","year":2025,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Graph; Graph minor; Complete graph; Complement graph; Minor (academic)","score_opus":0.016130207490527838,"score_gpt":0.26237673949594104,"score_spread":0.2462465320054132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115031712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76675117,0.0007656663,0.18045299,0.0011320089,0.00017253707,0.00012040504,0.00036934865,0.00064312364,0.04959274],"genre_scores_gemma":[0.881597,0.0011261324,0.076797254,0.00040791844,0.00016918531,0.0001484525,0.00091654464,0.00031352584,0.038523924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999419,0.00016574288,0.000025459003,0.00012808703,0.00011008463,0.00015168442],"domain_scores_gemma":[0.99735993,0.0015025489,0.0003903533,0.00030134348,0.00022891774,0.00021694091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042039002,0.00059585384,0.00054890156,0.0011538496,0.0014053775,0.0014642711,0.00075869536,0.00076246465,0.004999518],"category_scores_gemma":[0.0026422285,0.0006272568,0.0008746106,0.0011631248,0.0017285799,0.0013019472,0.0014183283,0.001014993,0.00073190953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074116554,0.00012379281,0.004211654,0.0003745067,0.000065170054,0.0007583186,0.0027658024,0.025668913,0.041576453,0.85743725,0.007378752,0.05889823],"study_design_scores_gemma":[0.000104488325,0.00015660489,0.002621437,0.00007618677,0.000055413475,0.00073459145,0.000508778,0.046931036,0.012520945,0.9135948,0.022648104,0.00004768738],"about_ca_topic_score_codex":0.003684697,"about_ca_topic_score_gemma":0.004774667,"teacher_disagreement_score":0.004999518,"about_ca_system_score_codex":0.0011072672,"about_ca_system_score_gemma":0.0005937096,"threshold_uncertainty_score":0.016725063},"labels":[],"label_agreement":null},{"id":"W7117078956","doi":"","title":"Nowhere-zero flow reconfiguration","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Abelian group; Graph; Conjecture; Control reconfiguration; Planar graph; Sequence (biology); Flow (mathematics); Directed graph; Planar","score_opus":0.04292922885179728,"score_gpt":0.31685161905131487,"score_spread":0.2739223901995176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117078956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5481372,0.0025871603,0.35018766,0.0035932523,0.0008982288,0.00017000563,0.000497736,0.00073244906,0.093196325],"genre_scores_gemma":[0.9547378,0.0010806771,0.03321461,0.0007124995,0.00039193247,0.00013012633,0.00067292835,0.0001462719,0.0089130625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902964,0.00017976992,0.000054237713,0.00032040608,0.00013085801,0.00028510173],"domain_scores_gemma":[0.9963743,0.0014431593,0.0007794908,0.0007774803,0.00030625254,0.00031932993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083553523,0.0005127276,0.00060168596,0.0009679663,0.0019060186,0.0019790574,0.0012344786,0.0013628263,0.006465189],"category_scores_gemma":[0.0050207498,0.00041173227,0.00086392096,0.0008698774,0.0035317256,0.0075929197,0.0023706781,0.002415158,0.00056751014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001677662,0.000058903097,0.001699776,0.00018918252,0.000025446576,0.0003582381,0.0005183772,0.0142612625,0.0053516366,0.9492624,0.0027734817,0.025333462],"study_design_scores_gemma":[0.000022852202,0.00008393145,0.0009411407,0.000050794875,0.000023625236,0.00042418193,0.00047894768,0.020411571,0.0054712594,0.9574859,0.014569912,0.00003594463],"about_ca_topic_score_codex":0.0010550471,"about_ca_topic_score_gemma":0.00074486004,"teacher_disagreement_score":0.006465189,"about_ca_system_score_codex":0.0013455452,"about_ca_system_score_gemma":0.00065850094,"threshold_uncertainty_score":0.02162826},"labels":[],"label_agreement":null},{"id":"W7117406377","doi":"10.61091/ars165-05","title":"On error-detecting open-locating-dominating sets","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Independent set; Graph; Set (abstract data type); Maximal independent set; Dominating set","score_opus":0.03106490125795443,"score_gpt":0.3496209828387878,"score_spread":0.3185560815808334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117406377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22128846,0.00064489245,0.75352305,0.0016005102,0.00017637348,0.00028348246,0.0013906454,0.0008845692,0.020208102],"genre_scores_gemma":[0.8546697,0.00061094953,0.13400654,0.0006765162,0.00017413123,0.00023665657,0.0015621994,0.00024268588,0.007820608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715483,0.0005199778,0.00020140041,0.0008002141,0.00090881233,0.00041484841],"domain_scores_gemma":[0.97678,0.015393746,0.0018094631,0.0028188487,0.0023007498,0.000897212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021346807,0.0009608823,0.0010293027,0.001453622,0.0015619819,0.0018138497,0.0027706851,0.0010930211,0.0026995365],"category_scores_gemma":[0.017708566,0.00064086093,0.0011616887,0.0025610267,0.0019438779,0.003288355,0.002556801,0.0025298018,0.000417345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057779445,0.0002357606,0.0040386,0.00063265976,0.00013487907,0.000760248,0.0012836987,0.3470643,0.012217967,0.5463773,0.011193201,0.07548351],"study_design_scores_gemma":[0.000091077854,0.00019393212,0.001152309,0.000080179474,0.000071854054,0.0008167846,0.00036855537,0.45832786,0.009293832,0.5186225,0.010913806,0.000067252986],"about_ca_topic_score_codex":0.0028070922,"about_ca_topic_score_gemma":0.002121729,"teacher_disagreement_score":0.0028070922,"about_ca_system_score_codex":0.0026163692,"about_ca_system_score_gemma":0.0012096848,"threshold_uncertainty_score":0.018983245},"labels":[],"label_agreement":null},{"id":"W7117408694","doi":"10.61091/ars165-03","title":"The domatic number game played on graphs","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Disjoint sets; Vertex (graph theory); Alice and Bob; Graph; Dominating set; Pairwise comparison","score_opus":0.012502352197433743,"score_gpt":0.29871535748094324,"score_spread":0.2862130052835095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117408694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20728,0.0004236872,0.63887525,0.002149852,0.0002547949,0.00048496545,0.00131845,0.0010898617,0.14812316],"genre_scores_gemma":[0.8747166,0.00038105738,0.09852275,0.00060819875,0.00009338378,0.0004289538,0.0011086178,0.00023231484,0.023908094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973604,0.0009371812,0.00011860482,0.0005931039,0.00046021954,0.0005303742],"domain_scores_gemma":[0.9946812,0.0032823973,0.0003546399,0.0004805889,0.00036235503,0.000838756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015216513,0.0016117533,0.0010079608,0.0010570845,0.001568365,0.004003235,0.001973083,0.0014144941,0.009000009],"category_scores_gemma":[0.009453362,0.00060266914,0.000970171,0.001003381,0.0038583092,0.006316644,0.0028693886,0.00284493,0.00105319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046900037,0.00013716909,0.00069172116,0.00011215483,0.00002551247,0.00011883249,0.0004266409,0.036555964,0.0034366522,0.93495363,0.00522885,0.017843772],"study_design_scores_gemma":[0.0001005806,0.00014578184,0.0004165985,0.000046788868,0.000020295092,0.00013508434,0.00020260082,0.20371978,0.0027876392,0.78260356,0.009762408,0.00005876238],"about_ca_topic_score_codex":0.0034461794,"about_ca_topic_score_gemma":0.003662191,"teacher_disagreement_score":0.009000009,"about_ca_system_score_codex":0.0042591244,"about_ca_system_score_gemma":0.0018055893,"threshold_uncertainty_score":0.030902267},"labels":[],"label_agreement":null},{"id":"W7117418922","doi":"10.61091/um125-07","title":"Unique paired vs edge-vertex minimum dominating sets in trees","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Class (philosophy); Tree (set theory); Set (abstract data type)","score_opus":0.026180822681456047,"score_gpt":0.32281665872862075,"score_spread":0.2966358360471647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117418922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60196084,0.0011929808,0.3601904,0.00088025606,0.00021786327,0.00007344108,0.0006538545,0.00023868137,0.03459165],"genre_scores_gemma":[0.9655812,0.0004744625,0.031039784,0.00014123529,0.00013965444,0.000051612897,0.00031477134,0.000054261276,0.0022030703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988949,0.0002291345,0.00005580488,0.00032562576,0.00029765515,0.0001968296],"domain_scores_gemma":[0.9971047,0.0018654437,0.00034728862,0.00021813124,0.0002357812,0.00022851783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007800084,0.00048629782,0.000999936,0.0015074852,0.0014392622,0.0031143127,0.00094996166,0.0008642022,0.0032244637],"category_scores_gemma":[0.0052709677,0.00041940133,0.00076816994,0.0013901369,0.0011601858,0.003751669,0.002281763,0.0015658671,0.00033356738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023905716,0.00012781625,0.0035402114,0.00044813435,0.00011073142,0.0004854188,0.0006087093,0.04028994,0.0084830485,0.88558376,0.004123235,0.05595995],"study_design_scores_gemma":[0.000037078116,0.00013275475,0.0023367736,0.0000704097,0.00007589559,0.0012044118,0.00040256747,0.09818531,0.0055001844,0.88548523,0.006541623,0.000027676582],"about_ca_topic_score_codex":0.00026445082,"about_ca_topic_score_gemma":0.0003098291,"teacher_disagreement_score":0.0032244637,"about_ca_system_score_codex":0.00080888136,"about_ca_system_score_gemma":0.0003551619,"threshold_uncertainty_score":0.010786891},"labels":[],"label_agreement":null},{"id":"W7124154569","doi":"10.65109/mhsj2047","title":"Pure Nash equilibria: complete characterization of hard and easy graphical games","year":2010,"lang":"","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Treewidth; Bounded function; Characterization (materials science); Nash equilibrium; Class (philosophy); Complexity class; Time complexity; Parameterized complexity; Iterated function","score_opus":0.02453861068836116,"score_gpt":0.2775504084294305,"score_spread":0.25301179774106936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124154569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27608973,0.0004903123,0.6881505,0.003805757,0.000052704785,0.00061106303,0.0014360838,0.00066894374,0.028694902],"genre_scores_gemma":[0.91827637,0.0003920587,0.073269874,0.00055800873,0.00015625573,0.0005738425,0.0010986183,0.00014383784,0.005531137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938939,0.0019497307,0.00028150453,0.001685902,0.0012457741,0.0009431105],"domain_scores_gemma":[0.9780899,0.016239282,0.0018401701,0.001987143,0.000867193,0.0009763204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003071882,0.001623688,0.0016236741,0.0017290136,0.0015755,0.005780389,0.0039659827,0.0022477275,0.0061390754],"category_scores_gemma":[0.021924617,0.00095319614,0.0021241442,0.0014275707,0.0046917363,0.012590484,0.004664886,0.0057587614,0.00048045907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030029714,0.0003586911,0.002703855,0.00035268904,0.00013695475,0.0003202563,0.001246844,0.09315288,0.004364038,0.87684494,0.0026874447,0.01753108],"study_design_scores_gemma":[0.00007847167,0.00004033213,0.0004615477,0.00003008013,0.00004050856,0.00013353319,0.00019986625,0.23468594,0.0020769874,0.76071656,0.0015074249,0.000028630899],"about_ca_topic_score_codex":0.003164736,"about_ca_topic_score_gemma":0.0027156905,"teacher_disagreement_score":0.0061390754,"about_ca_system_score_codex":0.0035425574,"about_ca_system_score_gemma":0.0022649502,"threshold_uncertainty_score":0.025703192},"labels":[],"label_agreement":null},{"id":"W7124281514","doi":"10.65109/pcio5382","title":"Gerrymandering Planar Graphs","year":2024,"lang":"","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gerrymandering; Redistricting; Vertex (graph theory); Planar graph; Partition (number theory); Time complexity; Graph; Approximation algorithm; Planar","score_opus":0.03592371740322173,"score_gpt":0.3175840887005323,"score_spread":0.2816603712973106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124281514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48612657,0.0025037804,0.44629514,0.009172472,0.00018306574,0.0004927413,0.0023373147,0.0017088372,0.05118012],"genre_scores_gemma":[0.80359495,0.0021784785,0.17121458,0.00073447754,0.00020428622,0.0002475985,0.0034964606,0.00033590774,0.017993152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983883,0.0004302378,0.000053792468,0.00045929442,0.00028021724,0.00038828267],"domain_scores_gemma":[0.9935935,0.004400151,0.0008009061,0.0006143191,0.00030448494,0.000286616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094729767,0.0013494286,0.0012764874,0.0010978543,0.0014238694,0.003036273,0.002602215,0.0018735594,0.0106716035],"category_scores_gemma":[0.010574071,0.00073905475,0.0013572016,0.0028132494,0.0017490784,0.0064221667,0.0020980781,0.0033460287,0.0012732083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047082987,0.00028788278,0.0028456212,0.00080242695,0.00015452331,0.000429517,0.000737959,0.54957086,0.004516903,0.34603545,0.018816728,0.075331315],"study_design_scores_gemma":[0.00012714222,0.00010604252,0.0009016903,0.000055971577,0.00006151058,0.0003470143,0.00033536222,0.5156428,0.0025755793,0.46705598,0.012754174,0.00003668323],"about_ca_topic_score_codex":0.006515159,"about_ca_topic_score_gemma":0.005804312,"teacher_disagreement_score":0.0106716035,"about_ca_system_score_codex":0.0028868264,"about_ca_system_score_gemma":0.0013895029,"threshold_uncertainty_score":0.035700083},"labels":[],"label_agreement":null},{"id":"W7128185158","doi":"10.55016/ojs/cdm.v8i2.62050","title":"Colouring stability two unit disk graphs","year":2014,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic scale; Unit disk; Graph; Clique number; Clique; Unit disk graph; Stability (learning theory)","score_opus":0.03198840706107389,"score_gpt":0.3446661638066141,"score_spread":0.3126777567455402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128185158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8521401,0.00038130145,0.10602736,0.0011943823,0.00013638602,0.00007301067,0.0002760225,0.00039852096,0.03937283],"genre_scores_gemma":[0.9745043,0.00013275328,0.017250944,0.00018080654,0.000042071282,0.000044645076,0.00023001432,0.0000720143,0.0075425883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994598,0.00014743498,0.000017605273,0.00012269751,0.0001280344,0.00012430863],"domain_scores_gemma":[0.99596184,0.0021626165,0.00041568195,0.00047445393,0.00047234463,0.00051316357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003710063,0.00046844684,0.0003529433,0.00074142497,0.0014543649,0.0013488734,0.0011426547,0.0009717432,0.0074808532],"category_scores_gemma":[0.0036433737,0.00030178798,0.00033072953,0.0007708818,0.0014019682,0.0017687811,0.0015343269,0.0014590202,0.00083233323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010444805,0.00026463284,0.0068455767,0.0004137906,0.00007735476,0.0006690236,0.0013864302,0.046446618,0.0772555,0.7994206,0.015063355,0.05111268],"study_design_scores_gemma":[0.0001699712,0.00026321935,0.0052215047,0.000051897492,0.000080513746,0.00071615505,0.0007406809,0.32355565,0.03806212,0.6132219,0.017844627,0.000071731665],"about_ca_topic_score_codex":0.0027026937,"about_ca_topic_score_gemma":0.002516117,"teacher_disagreement_score":0.0074808532,"about_ca_system_score_codex":0.0009484921,"about_ca_system_score_gemma":0.00042956317,"threshold_uncertainty_score":0.025025964},"labels":[],"label_agreement":null},{"id":"W7128199293","doi":"10.1090/tran/9493","title":"Limits of degeneracy for colouring graphs with forbidden minors","year":2025,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degeneracy (biology); Bipartite graph; Upper and lower bounds; Sublinear function; Monotone polygon; Bounded function; Vertex (graph theory); Graph","score_opus":0.019903900032545527,"score_gpt":0.3073533367955095,"score_spread":0.287449436762964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128199293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7171791,0.0012863586,0.122927874,0.006751771,0.00026952315,0.00009931808,0.0010866027,0.0012776608,0.14912185],"genre_scores_gemma":[0.9637943,0.00049863575,0.021620674,0.0009824532,0.00020222164,0.00013981404,0.0006359282,0.00041412184,0.011711869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958032,0.0011318641,0.00024126454,0.001108214,0.0009923461,0.00072325784],"domain_scores_gemma":[0.97912323,0.01426849,0.0013355504,0.00251598,0.00093507726,0.0018217211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035039915,0.0007766582,0.0014171988,0.0031560115,0.0038490838,0.0048525543,0.0023695673,0.0031444945,0.011566852],"category_scores_gemma":[0.023960104,0.001307731,0.0017340322,0.0015900106,0.0068003265,0.009966984,0.006070553,0.0045034946,0.0015874903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001184437,0.000038710856,0.0008824383,0.00008989684,0.000011637439,0.00014171435,0.00045532137,0.0018665736,0.0009688844,0.98899186,0.0019240746,0.0045104786],"study_design_scores_gemma":[0.000015204417,0.000007332084,0.00012437333,0.000014662762,0.000004544717,0.000086145956,0.000043895234,0.0039905994,0.00025181312,0.9945931,0.00086069666,0.0000075606818],"about_ca_topic_score_codex":0.0018289186,"about_ca_topic_score_gemma":0.0017165125,"teacher_disagreement_score":0.011566852,"about_ca_system_score_codex":0.002968312,"about_ca_system_score_gemma":0.0009907434,"threshold_uncertainty_score":0.038694978},"labels":[],"label_agreement":null},{"id":"W7131979928","doi":"","title":"Résolution du problème du sous-graphe de poids maximum des arêtes dans des réseaux biologiques","year":2019,"lang":"fr","type":"article","venue":"NPARC","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Body weight; Triglycerides blood; Fish <Actinopterygii>","score_opus":0.024883911274655945,"score_gpt":0.27378151845988263,"score_spread":0.2488976071852267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131979928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16105741,0.0011309363,0.8176039,0.0024183537,0.0002032646,0.00039036802,0.00078000035,0.0016115088,0.0148042],"genre_scores_gemma":[0.27751726,0.0006870438,0.69800377,0.0003743261,0.00009419306,0.00031943482,0.0014528767,0.0003034162,0.02124768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924374,0.00017581412,0.000033244156,0.0002818422,0.00015549701,0.000110000896],"domain_scores_gemma":[0.9982987,0.00095163373,0.00015761121,0.00021307557,0.00023954538,0.00013953581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689997,0.0007943094,0.00095835933,0.0011076359,0.001379149,0.0014710537,0.0011869316,0.0017763221,0.0049953875],"category_scores_gemma":[0.002768475,0.00062467955,0.001777404,0.001072532,0.00090655277,0.0020801716,0.0015180836,0.0020132612,0.0006324463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007286481,0.0005692734,0.010475965,0.0022894784,0.00033956062,0.0013824318,0.0018249563,0.38658065,0.097705126,0.14110257,0.018413894,0.3385875],"study_design_scores_gemma":[0.00022394197,0.0006105007,0.007986607,0.00021558935,0.00021313131,0.0017072464,0.0021184331,0.7438075,0.057941146,0.122358225,0.06272516,0.00009257643],"about_ca_topic_score_codex":0.0057978216,"about_ca_topic_score_gemma":0.008662671,"teacher_disagreement_score":0.0057978216,"about_ca_system_score_codex":0.0009805448,"about_ca_system_score_gemma":0.001418895,"threshold_uncertainty_score":0.016711175},"labels":[],"label_agreement":null},{"id":"W7133054918","doi":"","title":"Some algorithmic and complexity results for monotone Boolean duality (hypergraph transversal)","year":2004,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"DPLL algorithm; Monotone polygon; Time complexity; True quantified Boolean formula; Conjunctive normal form; Duality (order theory); Boolean function; Polynomial","score_opus":0.06680735408382057,"score_gpt":0.38325191554362575,"score_spread":0.31644456145980515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133054918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27399045,0.0029185389,0.65252304,0.011612977,0.00025479734,0.00044751604,0.0020016334,0.0018473405,0.054403752],"genre_scores_gemma":[0.60691476,0.0017691742,0.36768633,0.0025817163,0.00080133247,0.0005833753,0.002992233,0.0005774791,0.016093643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680614,0.0009100823,0.00015072766,0.00070578273,0.0007980385,0.0006292292],"domain_scores_gemma":[0.9803304,0.015076436,0.0013674648,0.0015235704,0.0009432163,0.00075895234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002953239,0.0009903422,0.001017093,0.0022007686,0.0012492292,0.0051681944,0.0028133083,0.0018885443,0.010696472],"category_scores_gemma":[0.01523694,0.0010946138,0.0026166842,0.0030486984,0.0026870603,0.011243056,0.0034236328,0.007882742,0.0010154853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010640764,0.00089035544,0.0063959276,0.0010683339,0.00018919008,0.00037811985,0.0008596317,0.05362231,0.012782781,0.7670362,0.018460162,0.13725296],"study_design_scores_gemma":[0.00014321541,0.00011078096,0.0012511829,0.00007097084,0.00010212358,0.00036500863,0.0002060723,0.2203132,0.004859878,0.7663672,0.0061663957,0.00004398396],"about_ca_topic_score_codex":0.002769805,"about_ca_topic_score_gemma":0.004204046,"teacher_disagreement_score":0.010696472,"about_ca_system_score_codex":0.004054646,"about_ca_system_score_gemma":0.0022251362,"threshold_uncertainty_score":0.03578323},"labels":[],"label_agreement":null},{"id":"W7135073389","doi":"10.1137/1.9781611979084.6","title":"Partitioning Trillion Edge Graphs on Edge Devices","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Partition (number theory); Graph; Enhanced Data Rates for GSM Evolution; Edge computing; Overhead (engineering); Edge device; Block (permutation group theory)","score_opus":0.07647425681464981,"score_gpt":0.289620435954992,"score_spread":0.21314617914034217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7135073389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26438725,0.0012233364,0.6903361,0.0010377634,0.00039240505,0.0003432421,0.0033636591,0.014597771,0.024318581],"genre_scores_gemma":[0.55128473,0.00072450243,0.4309301,0.0005341871,0.00005427522,0.00034044991,0.0052974555,0.0012015273,0.009632751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996357,0.000060883413,0.00002507492,0.000089907364,0.00011860667,0.000069916365],"domain_scores_gemma":[0.99898165,0.00034988494,0.00008737568,0.0003264451,0.00017418242,0.00008034547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024756193,0.0006043838,0.00032743538,0.00068959314,0.0005561421,0.0008290001,0.0012484856,0.00046692527,0.0052340827],"category_scores_gemma":[0.0020412265,0.00027056917,0.00049295987,0.0010483364,0.0003971224,0.0018512629,0.0011864902,0.0007118149,0.0016710955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010986588,0.00032746763,0.0053135147,0.00073814444,0.00013462565,0.0006629907,0.0006983178,0.25486484,0.08353538,0.03651691,0.06323644,0.55287266],"study_design_scores_gemma":[0.00011935247,0.00032385747,0.0028839568,0.0000723478,0.00005179461,0.00031930787,0.0006540632,0.8224558,0.06361371,0.05254746,0.05689843,0.000059801663],"about_ca_topic_score_codex":0.0028347191,"about_ca_topic_score_gemma":0.008162056,"teacher_disagreement_score":0.0052340827,"about_ca_system_score_codex":0.00066987344,"about_ca_system_score_gemma":0.00070826133,"threshold_uncertainty_score":0.017509758},"labels":[],"label_agreement":null},{"id":"W7135223164","doi":"10.5269/bspm.77901","title":"Inverse domination number of a graph: a survey","year":2025,"lang":"","type":"article","venue":"Boletim da Sociedade Paranaense de Matemática","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Learning Partnership","funders":"","keywords":"Dominating set; Domination analysis; Vertex (graph theory); Inverse; Graph; Conjecture","score_opus":0.027319143652269912,"score_gpt":0.33815281027208616,"score_spread":0.31083366661981626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7135223164","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0657889,0.6754359,0.080438614,0.00466674,0.001326679,0.00008170871,0.000734908,0.0002497439,0.17127673],"genre_scores_gemma":[0.49379405,0.45127615,0.034138933,0.00128021,0.0041532596,0.00012340158,0.0009187273,0.0001459522,0.014169322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990669,0.0001310961,0.000054086835,0.00034810446,0.00030455823,0.00009529742],"domain_scores_gemma":[0.9979685,0.0014505681,0.000104688064,0.00012443557,0.0002566107,0.00009517977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007929289,0.00079385843,0.00090246217,0.004007883,0.00088450103,0.0029950922,0.0010264623,0.0008793318,0.002736047],"category_scores_gemma":[0.0030918398,0.0005880048,0.00075506157,0.0050543672,0.0018901387,0.005241623,0.0010767443,0.0017178989,0.00061997835],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012441828,0.00015704338,0.0049506957,0.0044082655,0.000109667504,0.0003333477,0.0006935217,0.015594882,0.0030499143,0.5286542,0.018995723,0.4229283],"study_design_scores_gemma":[0.000034468158,0.00021538853,0.0067579807,0.0012122863,0.0001535753,0.003309906,0.0007081941,0.030045094,0.0037836563,0.6095007,0.3441584,0.0001203663],"about_ca_topic_score_codex":0.0022876868,"about_ca_topic_score_gemma":0.0010537148,"teacher_disagreement_score":0.004007883,"about_ca_system_score_codex":0.0025247459,"about_ca_system_score_gemma":0.0011341096,"threshold_uncertainty_score":0.018318415},"labels":[],"label_agreement":null},{"id":"W71968967","doi":"","title":"On Distance Connected Domination Numbers of Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Domination analysis; Vertex (graph theory); Connectivity; Graph; Vertex connectivity; Order (exchange); Connected dominating set; Induced subgraph; Cardinality (data modeling); Integer (computer science); Discrete mathematics","score_opus":0.010305342496407155,"score_gpt":0.27915559109577526,"score_spread":0.2688502485993681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71968967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3329934,0.025256308,0.4051718,0.0071815904,0.0013412231,0.00056056713,0.0031062737,0.0008618028,0.22352701],"genre_scores_gemma":[0.87265605,0.010592779,0.088904895,0.0015866016,0.0014992632,0.0009682232,0.0020329165,0.0003764217,0.021382753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754924,0.0007158644,0.000121134035,0.0005018571,0.0007337064,0.00037814752],"domain_scores_gemma":[0.9782607,0.016978364,0.001645998,0.0006998594,0.0010654649,0.0013497407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031243362,0.0018731955,0.0012932091,0.0065844143,0.0019711778,0.0034734528,0.001791564,0.0015849636,0.006584387],"category_scores_gemma":[0.022125032,0.00078992057,0.0009305466,0.0049754973,0.004660816,0.008342068,0.0031196005,0.003487404,0.0011907938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045893618,0.000064734544,0.0024954085,0.0004920273,0.000068503905,0.00022421226,0.0006889692,0.035895042,0.0024385648,0.9053226,0.008399408,0.043451447],"study_design_scores_gemma":[0.00006555978,0.000101947735,0.0016973903,0.0001749712,0.00004537419,0.00051972293,0.0001764118,0.06163221,0.0011872017,0.91841793,0.01592616,0.00005523015],"about_ca_topic_score_codex":0.0013554229,"about_ca_topic_score_gemma":0.0013068302,"teacher_disagreement_score":0.0065844143,"about_ca_system_score_codex":0.003879168,"about_ca_system_score_gemma":0.0008533733,"threshold_uncertainty_score":0.028145492},"labels":[],"label_agreement":null},{"id":"W73852609","doi":"","title":"Note on acyclic colorings of graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01629310249588141,"score_gpt":0.2869874171003903,"score_spread":0.2706943146045089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73852609","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017772987,0.019656597,0.27328852,0.022622334,0.022835346,0.0001578251,0.002168189,0.0013281851,0.64017004],"genre_scores_gemma":[0.4458855,0.059636872,0.2402163,0.023803657,0.03190909,0.0004953645,0.0034929996,0.0016965166,0.19286375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991334,0.0002397372,0.000044404944,0.00024453693,0.00023736326,0.00010057007],"domain_scores_gemma":[0.9924085,0.0053185388,0.00022213177,0.0009795442,0.000665332,0.00040587335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014044686,0.0011345062,0.00077650533,0.0019431399,0.0022777726,0.002149426,0.001397816,0.0010431664,0.024032451],"category_scores_gemma":[0.006239112,0.00059274834,0.0011369317,0.002940638,0.0031007978,0.004487264,0.0025511004,0.0046264054,0.003501611],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082001236,0.000037938345,0.00044995424,0.00029658587,0.000028100802,0.00036682928,0.00022423205,0.0011966937,0.0012263408,0.8893685,0.074078344,0.032644518],"study_design_scores_gemma":[0.000011772954,0.000028943035,0.00051863067,0.00007249695,0.000029792436,0.00044187164,0.000072566596,0.0012148615,0.00069737213,0.87883604,0.11805394,0.000021699174],"about_ca_topic_score_codex":0.0055505172,"about_ca_topic_score_gemma":0.00853756,"teacher_disagreement_score":0.024032451,"about_ca_system_score_codex":0.0011429704,"about_ca_system_score_gemma":0.0008538996,"threshold_uncertainty_score":0.08039653},"labels":[],"label_agreement":null},{"id":"W75080855","doi":"","title":"The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Graph; Set (abstract data type); Integer (computer science); Discrete mathematics; Planar graph; Computer science","score_opus":0.00849990397534381,"score_gpt":0.25327281408344565,"score_spread":0.24477291010810184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75080855","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8250245,0.0003468505,0.054134317,0.0008264726,0.0001309311,0.000040579907,0.0008056917,0.00023820656,0.118452504],"genre_scores_gemma":[0.9790557,0.00018381535,0.011004459,0.000102000515,0.000060556937,0.0000295704,0.00049396534,0.000041918254,0.0090281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997993,0.000048010796,0.00001110516,0.00004949053,0.000047103604,0.000045080727],"domain_scores_gemma":[0.998958,0.00046488448,0.00022920211,0.00009973414,0.00008279906,0.00016533781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013390498,0.0002219592,0.00021589673,0.00068686233,0.0007719102,0.0012034276,0.0005423677,0.00052286783,0.0055112313],"category_scores_gemma":[0.0014143835,0.00019439805,0.00020589038,0.00075280597,0.0007521302,0.0013851646,0.0007146877,0.0007495183,0.0006815357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033660282,0.00007074748,0.0025368468,0.00015009085,0.000024374058,0.00094876357,0.00044245817,0.009183711,0.013660181,0.9414122,0.0059894943,0.025244553],"study_design_scores_gemma":[0.000073319454,0.00012107302,0.003095871,0.000044800905,0.000044362438,0.0015985861,0.0005254665,0.05836421,0.0060898527,0.91319805,0.016813412,0.000031003397],"about_ca_topic_score_codex":0.00068858574,"about_ca_topic_score_gemma":0.00088888453,"teacher_disagreement_score":0.0055112313,"about_ca_system_score_codex":0.0004378763,"about_ca_system_score_gemma":0.00021024924,"threshold_uncertainty_score":0.018436909},"labels":[],"label_agreement":null},{"id":"W75907754","doi":"","title":"Vertex-Disjoint Paths in Graphs","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Disjoint sets; Vertex (graph theory); Combinatorics; Graph","score_opus":0.016950286058527865,"score_gpt":0.2743511412015198,"score_spread":0.25740085514299194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75907754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45499983,0.0045303376,0.3848565,0.005866684,0.0007362671,0.00034047582,0.003025029,0.0015404199,0.14410451],"genre_scores_gemma":[0.7989023,0.004823723,0.13856076,0.0010808965,0.0004989254,0.0004065939,0.002970319,0.00047877335,0.052277695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987135,0.00033906367,0.00009571194,0.00035991275,0.00031188622,0.00017988587],"domain_scores_gemma":[0.9945157,0.003749082,0.0005376331,0.00043230283,0.00030249447,0.0004626954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009405114,0.0010782578,0.0011029998,0.0031418814,0.0028320558,0.004715123,0.0018273498,0.0022229142,0.012188351],"category_scores_gemma":[0.007191813,0.0013278415,0.0010447656,0.0057506934,0.0027572317,0.010680826,0.0038784477,0.0031941617,0.0018307606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090133704,0.00005643339,0.0006579263,0.00020744526,0.000026992833,0.00016536201,0.0005737019,0.0030488728,0.000881832,0.96086216,0.0045190915,0.02890996],"study_design_scores_gemma":[0.000016469136,0.00001000263,0.00015558288,0.000024233817,0.000017799235,0.00010662942,0.00009771884,0.0022967851,0.00026951925,0.99256104,0.0044379234,0.000006296931],"about_ca_topic_score_codex":0.0014181309,"about_ca_topic_score_gemma":0.0019463374,"teacher_disagreement_score":0.012188351,"about_ca_system_score_codex":0.001551774,"about_ca_system_score_gemma":0.0010165477,"threshold_uncertainty_score":0.040774047},"labels":[],"label_agreement":null},{"id":"W762650586","doi":"10.1016/j.disc.2015.06.005","title":"Join colourings of chordal graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Chordal graph; Combinatorics; Mathematics; Partition (number theory); Discrete mathematics; Pathwidth; Cograph; Split graph; Indifference graph; Graph; Line graph; 1-planar graph","score_opus":0.04375043402777048,"score_gpt":0.31112911825039025,"score_spread":0.2673786842226198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W762650586","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76472974,0.0005166604,0.15269147,0.001013148,0.0003421237,0.00016579014,0.000999535,0.00060823874,0.07893329],"genre_scores_gemma":[0.93024963,0.00043340214,0.04114377,0.00026797404,0.00018168971,0.00010686295,0.0012728171,0.00028729605,0.026056627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991892,0.00014290503,0.00004250228,0.00017902063,0.00026404602,0.00018228951],"domain_scores_gemma":[0.99477756,0.0026030627,0.0005571687,0.00055775594,0.0005135738,0.0009908556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006208408,0.00040381882,0.000717176,0.001300714,0.0019882605,0.0033734497,0.0012464842,0.001021312,0.011216418],"category_scores_gemma":[0.0037184567,0.000511644,0.0005370396,0.0015032529,0.0016617917,0.0030998515,0.0024355415,0.00204067,0.0011363849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038740874,0.00008044458,0.001192638,0.00012506345,0.000024108393,0.00025281106,0.0014781673,0.002560337,0.009591551,0.95756257,0.0032588914,0.023485936],"study_design_scores_gemma":[0.00007123775,0.000069085254,0.0011238331,0.000030165804,0.00003307809,0.00017112287,0.0007319044,0.008159741,0.0038122116,0.9740559,0.011720906,0.000020755877],"about_ca_topic_score_codex":0.0011367823,"about_ca_topic_score_gemma":0.002018738,"teacher_disagreement_score":0.011216418,"about_ca_system_score_codex":0.0009460805,"about_ca_system_score_gemma":0.00051834126,"threshold_uncertainty_score":0.037522674},"labels":[],"label_agreement":null},{"id":"W76416303","doi":"","title":"F-factor and Vertex-disjoint F in a graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Vertex (graph theory); Graph; Factor (programming language); Discrete mathematics; Computer science; Programming language","score_opus":0.02384189453152436,"score_gpt":0.26140417543416056,"score_spread":0.2375622809026362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76416303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47285363,0.0053900443,0.35792124,0.0039147995,0.00091940485,0.00017129524,0.0027295728,0.0012844718,0.15481545],"genre_scores_gemma":[0.8769697,0.002158174,0.08398407,0.00066458597,0.00044932237,0.00011821325,0.0017315554,0.0002979398,0.03362645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891746,0.00017268783,0.00006227264,0.00041125997,0.00016406232,0.0002721981],"domain_scores_gemma":[0.99645066,0.001587993,0.00049472105,0.00053611095,0.0003886122,0.0005417641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008593955,0.0008789724,0.00072667206,0.0022378978,0.002268892,0.002091577,0.00093335786,0.001358718,0.010055339],"category_scores_gemma":[0.004975608,0.00051546854,0.0010809607,0.0018231563,0.003299506,0.005943283,0.0024274683,0.0018903788,0.0016874077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002794814,0.00008116016,0.0016392724,0.00017628535,0.000059128277,0.0006386402,0.0007084693,0.0015108362,0.003431918,0.95018065,0.009516182,0.03177793],"study_design_scores_gemma":[0.000027773285,0.000035829118,0.0008046309,0.00006257457,0.000057718906,0.0010454694,0.00052126934,0.0032881093,0.0026540405,0.96959203,0.021883305,0.000027248312],"about_ca_topic_score_codex":0.0024317952,"about_ca_topic_score_gemma":0.0027914138,"teacher_disagreement_score":0.010055339,"about_ca_system_score_codex":0.0010554991,"about_ca_system_score_gemma":0.00071384467,"threshold_uncertainty_score":0.033638418},"labels":[],"label_agreement":null},{"id":"W76468100","doi":"","title":"Bipartite Dominating Sets in Hypercubes.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Dominating set; Combinatorics; Mathematics; Vertex (graph theory); Hypercube; Cardinality (data modeling); Graph; Discrete mathematics; Computer science","score_opus":0.017858414930476286,"score_gpt":0.29359529617326785,"score_spread":0.27573688124279155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76468100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084959574,0.02274111,0.7823819,0.0022917725,0.0013735896,0.0008027818,0.0029790944,0.0006291226,0.10184109],"genre_scores_gemma":[0.60303277,0.013787005,0.34039414,0.001920599,0.0017587837,0.0020491362,0.0047077863,0.00026045856,0.03208932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977863,0.0008790375,0.0001575216,0.0004432256,0.0005301929,0.00020378453],"domain_scores_gemma":[0.99794203,0.0010587454,0.0003380846,0.00014411176,0.00033873843,0.0001783175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015625048,0.0011256754,0.0009783631,0.0025817722,0.001166294,0.002812336,0.0008609536,0.0012203,0.004109338],"category_scores_gemma":[0.003914911,0.00060969446,0.0008855142,0.0038880077,0.0014776031,0.0030073267,0.0016825525,0.0012692072,0.001138058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020640636,0.00007512908,0.0011973891,0.0009914273,0.00009258694,0.0005994827,0.0006653954,0.07880952,0.0038780426,0.8338952,0.015458461,0.06413084],"study_design_scores_gemma":[0.000058008824,0.00011140812,0.00076016464,0.00016264323,0.000037735004,0.0009437598,0.0003805101,0.13357815,0.0012822232,0.8076943,0.054951273,0.0000398024],"about_ca_topic_score_codex":0.0012264012,"about_ca_topic_score_gemma":0.0010492866,"teacher_disagreement_score":0.004109338,"about_ca_system_score_codex":0.0020330274,"about_ca_system_score_gemma":0.00073995156,"threshold_uncertainty_score":0.014750719},"labels":[],"label_agreement":null},{"id":"W779346977","doi":"","title":"The monophonie detour hull number of a graph","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hull; Combinatorics; Graph; Discrete mathematics; Marine engineering; Engineering","score_opus":0.013445473967491238,"score_gpt":0.2772048916383965,"score_spread":0.26375941767090527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W779346977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9051067,0.0002351894,0.03347675,0.0014019707,0.00023276483,0.000036664347,0.0006761376,0.00021934904,0.05861442],"genre_scores_gemma":[0.9814216,0.00016066931,0.0075680395,0.00011618932,0.00016612225,0.000043828637,0.00056089385,0.00007799883,0.009884606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938166,0.00013049292,0.000030906413,0.00013744865,0.00018229871,0.00013720582],"domain_scores_gemma":[0.99575716,0.0021219875,0.0005471678,0.00031802955,0.0003329173,0.00092263665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060952164,0.00051474513,0.00071951933,0.0033446199,0.0022951826,0.003304289,0.001412362,0.0014682267,0.011792455],"category_scores_gemma":[0.004187691,0.00039455248,0.00046420263,0.0013143559,0.0028044682,0.004112231,0.0016871474,0.0021540923,0.0010674095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091725163,0.0001321285,0.005890748,0.00018438975,0.000048251728,0.0005390169,0.0010872104,0.00986763,0.011376001,0.93666357,0.007688165,0.025605708],"study_design_scores_gemma":[0.000065467066,0.0001530211,0.0059118494,0.0000666684,0.000046685807,0.0005670165,0.00064460153,0.043641616,0.00589216,0.93404806,0.008891451,0.00007138192],"about_ca_topic_score_codex":0.0011723327,"about_ca_topic_score_gemma":0.0012643901,"teacher_disagreement_score":0.011792455,"about_ca_system_score_codex":0.0011717656,"about_ca_system_score_gemma":0.00055251713,"threshold_uncertainty_score":0.03944969},"labels":[],"label_agreement":null},{"id":"W78658037","doi":"10.1007/978-3-642-30541-2_2","title":"On a DAG Partitioning Problem","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Directed acyclic graph; Bounded function; Combinatorics; Graph; Feedback arc set; Pathwidth; Graph partition; Computer science; Directed graph; Mathematics; Strongly connected component; Discrete mathematics; Time complexity; Line graph; Voltage graph","score_opus":0.026816232369333087,"score_gpt":0.28554245065602657,"score_spread":0.2587262182866935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78658037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10108485,0.003129713,0.7484433,0.013416704,0.0011634771,0.0006628326,0.0024209432,0.001408585,0.12826961],"genre_scores_gemma":[0.3075062,0.0040313783,0.59729517,0.0018725217,0.001297554,0.00067339075,0.0077489843,0.0012527474,0.07832208],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890125,0.00031042274,0.00005810324,0.0003193211,0.0002409321,0.00017003372],"domain_scores_gemma":[0.9971533,0.0018001006,0.0001291105,0.0005021899,0.0002193403,0.00019595702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010982063,0.0015544394,0.0016091756,0.0011630822,0.0018048933,0.0029739197,0.0026274044,0.002450227,0.019853944],"category_scores_gemma":[0.0073208,0.0009404791,0.001574625,0.0033056163,0.0012130666,0.0074160947,0.0038245872,0.0034102744,0.002560347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006421444,0.0005845158,0.0010486068,0.0011312994,0.00014603393,0.00040416853,0.00046388048,0.11186304,0.004704532,0.37500498,0.107459486,0.39654732],"study_design_scores_gemma":[0.0001354801,0.00008828352,0.00047384933,0.00011160188,0.00008442385,0.00032271835,0.00026024447,0.16477594,0.0014598804,0.80332345,0.028938897,0.000025166368],"about_ca_topic_score_codex":0.0023915353,"about_ca_topic_score_gemma":0.002830708,"teacher_disagreement_score":0.019853944,"about_ca_system_score_codex":0.0013595141,"about_ca_system_score_gemma":0.0012179374,"threshold_uncertainty_score":0.06641805},"labels":[],"label_agreement":null},{"id":"W78797683","doi":"","title":"Some Properties Of Strong Domination Numbers Of Hypergraphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014131852217851671,"score_gpt":0.24701193208292582,"score_spread":0.23288007986507414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78797683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5981627,0.0027588066,0.16665614,0.0034678658,0.0003454339,0.0001704899,0.0027417815,0.0006433571,0.22505347],"genre_scores_gemma":[0.96808326,0.0007416801,0.0190918,0.00022414097,0.00036729907,0.00017401762,0.000581614,0.00010200013,0.010634098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985275,0.0004042368,0.00012234981,0.0002761875,0.00046751677,0.00020213555],"domain_scores_gemma":[0.9794312,0.015687736,0.001729529,0.00092392706,0.0011264666,0.0011011325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022288614,0.0005791037,0.00052868365,0.003209545,0.0014865786,0.004705647,0.0009888983,0.0008247745,0.009839663],"category_scores_gemma":[0.01621208,0.0006020668,0.00051521533,0.0030245448,0.0024120673,0.0068331324,0.0014165059,0.0019768716,0.00082513917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000160283,0.000041375824,0.0029313634,0.00016694602,0.000033317127,0.0001373449,0.00049986626,0.0028886856,0.0030700613,0.96378195,0.004670366,0.02161852],"study_design_scores_gemma":[0.00004228973,0.00004358985,0.0024910488,0.000062284824,0.000036254554,0.00048299608,0.00025579895,0.012724112,0.0028914327,0.9727516,0.0081873,0.000031313582],"about_ca_topic_score_codex":0.00049047155,"about_ca_topic_score_gemma":0.00073004473,"teacher_disagreement_score":0.009839663,"about_ca_system_score_codex":0.0016338603,"about_ca_system_score_gemma":0.00059252605,"threshold_uncertainty_score":0.032916903},"labels":[],"label_agreement":null},{"id":"W81407506","doi":"","title":"Transverse families of matchings in the plane.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transverse plane; Plane (geometry); Combinatorics; Geometry; Structural engineering; Engineering","score_opus":0.011947212194047895,"score_gpt":0.2555910858161357,"score_spread":0.2436438736220878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81407506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60207474,0.0012402647,0.19702888,0.0016836886,0.00019818834,0.00009439761,0.0019053753,0.0005711688,0.19520333],"genre_scores_gemma":[0.9390347,0.0009751627,0.021384219,0.00026720745,0.000116169795,0.00008783361,0.0016414963,0.0001502105,0.036342945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937063,0.00014823204,0.000031593154,0.00016314982,0.00013645725,0.00014997507],"domain_scores_gemma":[0.9984061,0.00061456615,0.0003393957,0.00019524754,0.00017933281,0.0002652906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062362093,0.00043942468,0.00042996873,0.0019913493,0.0021503586,0.00250975,0.00072921976,0.00091042597,0.013321462],"category_scores_gemma":[0.003146,0.00063758274,0.00070349866,0.001896726,0.0013053152,0.0038544354,0.0021876758,0.0012055982,0.0018863964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121396544,0.000026764073,0.0015488476,0.000039100472,0.000021319773,0.0004529162,0.00035894386,0.0013255876,0.0021999995,0.9820087,0.0036900553,0.00820626],"study_design_scores_gemma":[0.000060311708,0.00005344575,0.0022739877,0.000065858614,0.00006144122,0.0016329099,0.0009997311,0.013116702,0.0033678238,0.9528228,0.025517162,0.00002773459],"about_ca_topic_score_codex":0.0019902287,"about_ca_topic_score_gemma":0.0018969317,"teacher_disagreement_score":0.013321462,"about_ca_system_score_codex":0.0009928831,"about_ca_system_score_gemma":0.00043129487,"threshold_uncertainty_score":0.044564724},"labels":[],"label_agreement":null},{"id":"W81615461","doi":"","title":"Circumferences of 2-Connected Claw-Free Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Structural engineering; Engineering","score_opus":0.019228272521084465,"score_gpt":0.26707222680117987,"score_spread":0.2478439542800954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81615461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7294473,0.0015599198,0.06972194,0.00079212995,0.00032460634,0.000105017454,0.00208866,0.0010969891,0.19486356],"genre_scores_gemma":[0.94703746,0.0006786067,0.020107916,0.0001683145,0.000110861874,0.00012618238,0.001561041,0.00019126081,0.03001824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996195,0.00006219849,0.000021697098,0.00010215421,0.00011204882,0.0000824577],"domain_scores_gemma":[0.9985043,0.00055214675,0.00040443815,0.00013331295,0.00012686863,0.00027889985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001738086,0.0006182177,0.00036792402,0.002455677,0.0011322157,0.0018021788,0.00095860136,0.00090416893,0.013615762],"category_scores_gemma":[0.0021353585,0.00047024,0.00034013204,0.0013850249,0.0012240899,0.0016254219,0.0015976203,0.0007748374,0.002030846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004871061,0.00007800456,0.0037654785,0.0004438092,0.00007539868,0.0016173089,0.0012725596,0.012440274,0.02093136,0.88444054,0.018136187,0.05631198],"study_design_scores_gemma":[0.00012757575,0.00015808405,0.015245232,0.00018534125,0.00010888192,0.0026488276,0.0015134305,0.031802367,0.015289744,0.85534006,0.077465236,0.000115338866],"about_ca_topic_score_codex":0.0016790088,"about_ca_topic_score_gemma":0.0021172594,"teacher_disagreement_score":0.013615762,"about_ca_system_score_codex":0.00054886384,"about_ca_system_score_gemma":0.0002393635,"threshold_uncertainty_score":0.045549273},"labels":[],"label_agreement":null},{"id":"W82574740","doi":"","title":"Long Cycles in 2-Connected Triangle-Free Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Circumference; Bipartite graph; Degree (music); Graph; Connectivity; Discrete mathematics; Geometry; Physics","score_opus":0.024307189558129275,"score_gpt":0.27066436548210565,"score_spread":0.24635717592397638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82574740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8303348,0.003955067,0.10627983,0.0011984473,0.00023292418,0.000115367424,0.0005118947,0.00019385708,0.057177864],"genre_scores_gemma":[0.9584247,0.0013334132,0.028944392,0.00027605295,0.000060455957,0.00010884676,0.00038776197,0.00004945757,0.010414987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997508,0.000051126142,0.000015536203,0.00006294347,0.000056272664,0.00006337601],"domain_scores_gemma":[0.99910694,0.0003916073,0.00022404137,0.00007400371,0.000080023645,0.00012336508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017027084,0.00035902503,0.00021598484,0.0007229335,0.000818385,0.0007362703,0.0005072269,0.00068774656,0.004092015],"category_scores_gemma":[0.0016404393,0.0004138446,0.00030930055,0.0009228455,0.00075510296,0.0016091733,0.0012043696,0.00051246985,0.0005444724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009067512,0.00009068844,0.008755297,0.0010395185,0.000110604,0.0033125808,0.0020552494,0.046455745,0.09970811,0.73213214,0.008003692,0.09742966],"study_design_scores_gemma":[0.00013815385,0.00027086484,0.006388702,0.00023471912,0.000083260515,0.0025936256,0.0010044544,0.055416003,0.0335513,0.844318,0.055920318,0.00008058289],"about_ca_topic_score_codex":0.0012488574,"about_ca_topic_score_gemma":0.0023481771,"teacher_disagreement_score":0.004092015,"about_ca_system_score_codex":0.0005598291,"about_ca_system_score_gemma":0.00023088856,"threshold_uncertainty_score":0.013689101},"labels":[],"label_agreement":null},{"id":"W826208409","doi":"","title":"The linear t-arboricity of complete bipartite graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Bipartite graph; Dense graph; Complete bipartite graph; Combinatorics; 1-planar graph; Discrete mathematics; Graph; Chordal graph; Planar graph","score_opus":0.02636395996074221,"score_gpt":0.2948282829023085,"score_spread":0.2684643229415663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W826208409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5775509,0.0014615674,0.16931953,0.0041178735,0.00029416557,0.000118295706,0.002378572,0.0005277515,0.24423134],"genre_scores_gemma":[0.9644109,0.00090062356,0.015446126,0.00055551145,0.00030454047,0.00011576075,0.0011794174,0.00011252706,0.01697456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994672,0.0001878913,0.000029983637,0.00012655876,0.00009953132,0.00008890749],"domain_scores_gemma":[0.9957918,0.002603095,0.0005806981,0.00037893342,0.0003174028,0.00032803963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042639195,0.00028649168,0.00031764654,0.0009288069,0.0008494747,0.0018766035,0.0006016154,0.0007671801,0.010594038],"category_scores_gemma":[0.004905396,0.0003579642,0.00049786863,0.0011866303,0.0016162443,0.0026906442,0.0010410269,0.001609076,0.0015518301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001589304,0.00005518714,0.0016016898,0.00019812208,0.000031889864,0.00037626558,0.00035314955,0.0061914604,0.004195607,0.9510873,0.009360522,0.026389778],"study_design_scores_gemma":[0.000025539084,0.000032130145,0.00068457617,0.000029716519,0.000015732088,0.00035246406,0.000113071575,0.015311884,0.0010931207,0.97822475,0.0041069617,0.0000100570205],"about_ca_topic_score_codex":0.0009131713,"about_ca_topic_score_gemma":0.0012524626,"teacher_disagreement_score":0.010594038,"about_ca_system_score_codex":0.00058715336,"about_ca_system_score_gemma":0.00041971612,"threshold_uncertainty_score":0.035440624},"labels":[],"label_agreement":null},{"id":"W833184608","doi":"10.1016/j.dam.2015.05.025","title":"Triangulations and equality in the domination chain","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Characterization (materials science); Cardinality (data modeling); Combinatorics; Domination analysis; Dominating set; Chain (unit); Discrete mathematics; Graph; Computer science; Data mining","score_opus":0.06494971143370033,"score_gpt":0.3402882606783024,"score_spread":0.2753385492446021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W833184608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5789968,0.0016234253,0.21586667,0.0035942441,0.0003410607,0.00008840996,0.0005996863,0.0001480892,0.19874166],"genre_scores_gemma":[0.93373185,0.0010780194,0.027556976,0.0004000014,0.00027960772,0.00008455803,0.00044568538,0.00012353336,0.036299687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877626,0.0003342102,0.0000690347,0.00023315797,0.00031801546,0.00026934416],"domain_scores_gemma":[0.99410903,0.0034891812,0.00057368784,0.00048342126,0.0006811269,0.0006635092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010600701,0.00033670635,0.0009803781,0.002572321,0.002710344,0.003589686,0.0014120518,0.0014054372,0.0134899225],"category_scores_gemma":[0.0071090525,0.00064136076,0.0007751886,0.0022519105,0.0043983753,0.0055683223,0.004037142,0.002999364,0.00096558477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002877666,0.000009222095,0.0002570132,0.000019282075,0.000004126973,0.000052136184,0.00025762082,0.0007962388,0.00035697606,0.9941162,0.0004599967,0.003642394],"study_design_scores_gemma":[0.000012565185,0.0000053917406,0.00017481681,0.000011484107,0.0000033636297,0.000040570896,0.00014276544,0.0025804276,0.00020469853,0.9953452,0.0014736474,0.000005023604],"about_ca_topic_score_codex":0.0038685806,"about_ca_topic_score_gemma":0.0033522933,"teacher_disagreement_score":0.0134899225,"about_ca_system_score_codex":0.0015362597,"about_ca_system_score_gemma":0.00066199264,"threshold_uncertainty_score":0.045128345},"labels":[],"label_agreement":null},{"id":"W84558688","doi":"","title":"Enumerations of Unlabelled Multigraphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Statistics","score_opus":0.015039088537401933,"score_gpt":0.282554488399597,"score_spread":0.2675153998621951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84558688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1351537,0.0031558946,0.65291333,0.002122015,0.0009289689,0.0002692305,0.005201245,0.0021372174,0.19811852],"genre_scores_gemma":[0.5278511,0.0020253102,0.3449762,0.0011102664,0.00038686895,0.00044409744,0.008606172,0.0011331156,0.11346682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987808,0.00039549128,0.00010514865,0.00023962471,0.00031154844,0.00016733447],"domain_scores_gemma":[0.99478513,0.002993014,0.00044556177,0.0007990589,0.000594952,0.00038235713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007400979,0.00062358327,0.00053711486,0.0023103808,0.002050649,0.0032443025,0.0014873048,0.0012217409,0.017610451],"category_scores_gemma":[0.005731097,0.00073154346,0.00075007556,0.0027283449,0.0008851185,0.0046734195,0.0023327984,0.0020232864,0.0040137437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016443778,0.000113754744,0.0012427461,0.0004488761,0.000037884252,0.0006576005,0.00069201173,0.005053332,0.0046434053,0.8821158,0.016232712,0.08859743],"study_design_scores_gemma":[0.000015315303,0.000021019838,0.0007621642,0.00020258341,0.000030128254,0.00053879153,0.00025205806,0.014932196,0.0029079018,0.9395676,0.040749546,0.000020780219],"about_ca_topic_score_codex":0.0007543723,"about_ca_topic_score_gemma":0.0029775342,"teacher_disagreement_score":0.017610451,"about_ca_system_score_codex":0.001204968,"about_ca_system_score_gemma":0.0006101351,"threshold_uncertainty_score":0.058912873},"labels":[],"label_agreement":null},{"id":"W84752148","doi":"","title":"Lower bounds on the signed k-subdomination number of graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.013654151886603199,"score_gpt":0.27968573837148053,"score_spread":0.26603158648487735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84752148","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.338095,0.0067302664,0.28620538,0.010327859,0.0020378495,0.00027778005,0.004467978,0.0023924797,0.3494654],"genre_scores_gemma":[0.87582344,0.0034958008,0.08220234,0.0011348991,0.0010319942,0.0004874089,0.0033404515,0.00071461994,0.03176902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979797,0.00037003486,0.00012624766,0.00038966126,0.0006933405,0.00044100874],"domain_scores_gemma":[0.98115784,0.012200165,0.001301285,0.0021661667,0.0015040573,0.0016704878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018996024,0.0016883509,0.0013987161,0.0035982188,0.0020882208,0.004954644,0.0032442405,0.0023064185,0.019492669],"category_scores_gemma":[0.0205576,0.0006478331,0.0010171375,0.0027686923,0.002764025,0.009613397,0.0031965843,0.0048164604,0.0046068467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011899238,0.0002895686,0.004152395,0.00087051385,0.000109124165,0.00033142755,0.0004708963,0.024438202,0.01484371,0.8258269,0.03458457,0.092892796],"study_design_scores_gemma":[0.00006797042,0.00012014901,0.0020613896,0.00016722993,0.00008845438,0.0005773888,0.00017199886,0.04823378,0.0072716298,0.9233132,0.017854037,0.00007275906],"about_ca_topic_score_codex":0.00061312556,"about_ca_topic_score_gemma":0.0014725723,"teacher_disagreement_score":0.019492669,"about_ca_system_score_codex":0.002419759,"about_ca_system_score_gemma":0.0013592803,"threshold_uncertainty_score":0.06520945},"labels":[],"label_agreement":null},{"id":"W85795673","doi":"","title":"The Connectivities of Trunk Graphs of Connected Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Trunk; Combinatorics; Graph; Botany","score_opus":0.015913673954377816,"score_gpt":0.26678116363131926,"score_spread":0.25086748967694145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85795673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8020311,0.0009134258,0.07836864,0.000686556,0.0000851182,0.00008171588,0.0021617005,0.0003493397,0.11532243],"genre_scores_gemma":[0.96524227,0.0010390847,0.018275803,0.00014596894,0.00012003618,0.00013402477,0.0020205886,0.00014323344,0.012879134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950826,0.000111972375,0.000029114788,0.00014161087,0.000111137124,0.000097901924],"domain_scores_gemma":[0.9941099,0.003468603,0.0009345488,0.00041486273,0.00052374764,0.00054826547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042131235,0.00043216898,0.0003457219,0.0046050237,0.0014664278,0.0023007614,0.000837999,0.00097577664,0.0139970705],"category_scores_gemma":[0.007501083,0.0006861044,0.00043865023,0.0024871295,0.0016888364,0.0040678536,0.0017414637,0.0013693736,0.001605236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024127738,0.000064134205,0.009346463,0.00022703511,0.00005451072,0.00061706925,0.0018997492,0.004424126,0.008085527,0.9298428,0.0058949846,0.03930221],"study_design_scores_gemma":[0.000034911085,0.00004913702,0.008762951,0.00015256375,0.0001012794,0.0014267337,0.001092764,0.015500197,0.004056734,0.95395434,0.014841946,0.000026414064],"about_ca_topic_score_codex":0.000881678,"about_ca_topic_score_gemma":0.0016392792,"teacher_disagreement_score":0.0139970705,"about_ca_system_score_codex":0.00054959604,"about_ca_system_score_gemma":0.00023564529,"threshold_uncertainty_score":0.046824872},"labels":[],"label_agreement":null},{"id":"W91420253","doi":"","title":"Super-Arc-Connected and Super-Connected Total Digraphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Combinatorics; Strongly connected component; Geometry","score_opus":0.015779937784937303,"score_gpt":0.2454578139895045,"score_spread":0.2296778762045672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91420253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34936708,0.0021302607,0.2964883,0.001985374,0.0003106705,0.00017853752,0.0047378396,0.0007833417,0.34401855],"genre_scores_gemma":[0.8667007,0.0018152986,0.066051446,0.0007828393,0.00015996542,0.0001471105,0.0033015045,0.0001725872,0.060868576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999589,0.00008394246,0.000028391507,0.000119257376,0.000109218294,0.000070203074],"domain_scores_gemma":[0.9982603,0.0006683387,0.00018850423,0.0002552791,0.0003092429,0.0003183417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040177084,0.00041672325,0.00037160466,0.0020713767,0.0011338174,0.0015886531,0.0009966808,0.00065398664,0.016985359],"category_scores_gemma":[0.0019326922,0.00043993874,0.00059186376,0.002300906,0.0009222311,0.0036599229,0.0014838539,0.001149191,0.001389024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057082463,0.000030400459,0.00074770936,0.00017997519,0.00003283705,0.00029853644,0.00027742155,0.0023432083,0.0015996948,0.9686868,0.005868746,0.01987762],"study_design_scores_gemma":[0.00001827862,0.00001985761,0.0009628938,0.000046580666,0.000055779274,0.00058353716,0.00022008887,0.009920827,0.001018101,0.96437997,0.02275988,0.000014102321],"about_ca_topic_score_codex":0.0013499974,"about_ca_topic_score_gemma":0.0033969416,"teacher_disagreement_score":0.016985359,"about_ca_system_score_codex":0.00086817617,"about_ca_system_score_gemma":0.00050091324,"threshold_uncertainty_score":0.056821704},"labels":[],"label_agreement":null},{"id":"W920035815","doi":"10.1016/j.ejc.2015.04.005","title":"Displaying blocking pairs in signed graphs","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Signed graph; Graph; Discrete mathematics; Blocking (statistics); Line graph","score_opus":0.039532124111896313,"score_gpt":0.2762106568089395,"score_spread":0.2366785326970432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W920035815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34528872,0.0003616657,0.5773423,0.00094074267,0.00053866603,0.00019751156,0.0013998817,0.016457306,0.05747327],"genre_scores_gemma":[0.85030806,0.0003246221,0.1316758,0.00022875439,0.00006488412,0.00012727316,0.0011387941,0.002589015,0.01354279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995161,0.00015036484,0.000024846531,0.000052661646,0.00017526415,0.00008061401],"domain_scores_gemma":[0.99781895,0.0011391042,0.00016784972,0.0002680686,0.00028174216,0.00032422974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005902923,0.0010215912,0.00065519725,0.0010283353,0.00080719433,0.0021451632,0.0008414596,0.0011007315,0.025758179],"category_scores_gemma":[0.0034438646,0.000593347,0.00047869934,0.00092807045,0.00053842727,0.003001592,0.0025391502,0.00131074,0.0035290483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037741004,0.00055671093,0.00559186,0.0011760241,0.00008487221,0.0034402956,0.0026435913,0.0657237,0.17675298,0.4101265,0.045729075,0.28440017],"study_design_scores_gemma":[0.00044153532,0.0006170029,0.002395301,0.00029302912,0.0001361691,0.0015500132,0.0016628024,0.36614966,0.10597913,0.42545912,0.0951484,0.0001678708],"about_ca_topic_score_codex":0.0008405878,"about_ca_topic_score_gemma":0.0012674677,"teacher_disagreement_score":0.025758179,"about_ca_system_score_codex":0.0005294252,"about_ca_system_score_gemma":0.0005424941,"threshold_uncertainty_score":0.08616966},"labels":[],"label_agreement":null},{"id":"W9227663","doi":"10.1080/21548331.1997.11443530","title":"Trees With Path-Stable Center.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Center (category theory); Path (computing); Computer science; Crystallography; Computer network; Chemistry","score_opus":0.009179629047181998,"score_gpt":0.2414310311169721,"score_spread":0.23225140206979009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9227663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6793977,0.0013225059,0.25285736,0.0010280834,0.00023615909,0.0001493705,0.00069641,0.0006616696,0.06365071],"genre_scores_gemma":[0.9639963,0.00029367532,0.02938687,0.000105716455,0.00012715602,0.00005620168,0.00038518972,0.00008789321,0.0055609667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931264,0.00009798092,0.0000344269,0.00019078916,0.0001685408,0.00019562377],"domain_scores_gemma":[0.99704224,0.0012120216,0.0005109441,0.00022486008,0.0004845583,0.0005253429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006916358,0.00031967592,0.000553854,0.0007135209,0.0018039271,0.0023149918,0.0005920392,0.0007850406,0.0044566207],"category_scores_gemma":[0.0034238638,0.00030747446,0.00051619404,0.00084670004,0.001630756,0.0034148344,0.0018504409,0.0012709856,0.00083319575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024117353,0.000072227966,0.002509114,0.00013797791,0.000020852243,0.00079613196,0.001056644,0.00345137,0.019525357,0.9558037,0.002511367,0.013874153],"study_design_scores_gemma":[0.0001592162,0.00026292753,0.004394673,0.00007739933,0.00009410676,0.0021354535,0.0014456245,0.04502727,0.025328813,0.8864507,0.034564935,0.000058834594],"about_ca_topic_score_codex":0.0011349347,"about_ca_topic_score_gemma":0.0013091934,"teacher_disagreement_score":0.0044566207,"about_ca_system_score_codex":0.0010285955,"about_ca_system_score_gemma":0.00063521304,"threshold_uncertainty_score":0.01490885},"labels":[],"label_agreement":null},{"id":"W92926827","doi":"","title":"A note on graphs with largest total k-domination number.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph; Vertex (graph theory)","score_opus":0.009164763541006529,"score_gpt":0.27539502022611634,"score_spread":0.2662302566851098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92926827","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08636216,0.058628436,0.21583317,0.07048465,0.029618362,0.0002582712,0.0045447606,0.0031168105,0.53115326],"genre_scores_gemma":[0.6861829,0.041309685,0.14629792,0.012312492,0.029375473,0.00029181727,0.0024096093,0.0014371593,0.08038298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999203,0.00017384427,0.000054301992,0.0002484447,0.00021605454,0.000104311985],"domain_scores_gemma":[0.992525,0.0051000984,0.00029058332,0.00084392936,0.00073905697,0.0005014114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013889134,0.0010814535,0.0011412787,0.0024075143,0.0020618897,0.0022943476,0.0020513134,0.0011927191,0.011396427],"category_scores_gemma":[0.008401513,0.00044939274,0.0008715355,0.0034082753,0.002282526,0.0067529045,0.0024652162,0.003734233,0.0028438182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054741086,0.00016374058,0.0039424715,0.0018880615,0.00016253887,0.0023140826,0.0004906349,0.008277507,0.011875412,0.504905,0.28432727,0.18110582],"study_design_scores_gemma":[0.000042837197,0.00009739288,0.004202278,0.0001965918,0.00013239558,0.0026720795,0.0003506261,0.005935486,0.0039384374,0.84204584,0.14028913,0.0000968976],"about_ca_topic_score_codex":0.0017238847,"about_ca_topic_score_gemma":0.0041298694,"teacher_disagreement_score":0.011396427,"about_ca_system_score_codex":0.0013695016,"about_ca_system_score_gemma":0.00076214207,"threshold_uncertainty_score":0.03812486},"labels":[],"label_agreement":null},{"id":"W929955757","doi":"10.1016/j.disc.2015.06.024","title":"Dichotomy for finite tournaments of mixed-type","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Unary operation; Tournament; Combinatorics; Conjecture; Constraint satisfaction problem; Congruence (geometry); Singleton; Type (biology); Discrete mathematics; Algebraic number; Statistics","score_opus":0.07072933088438883,"score_gpt":0.3471430431633135,"score_spread":0.2764137122789247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W929955757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75188047,0.001177335,0.12752925,0.0078625195,0.0004969213,0.00010338789,0.0013220442,0.00057710137,0.10905101],"genre_scores_gemma":[0.97569704,0.0002815706,0.0089858845,0.00071661285,0.000409025,0.00015463059,0.00074910687,0.00011283696,0.012893239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974317,0.00072986627,0.00011878615,0.00055808335,0.0005538288,0.00060770416],"domain_scores_gemma":[0.99122614,0.004972463,0.00091096346,0.00048507954,0.0005694231,0.0018359222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023356748,0.00091664813,0.0021203181,0.0026938643,0.0048425477,0.011885591,0.0029541238,0.0031669135,0.014647486],"category_scores_gemma":[0.0091006635,0.0011215305,0.0018984708,0.0020946066,0.005262574,0.008577372,0.0043399213,0.0062864334,0.0008433612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016252606,0.000045023266,0.00058429094,0.00004017059,0.000021439377,0.00006140174,0.00022409909,0.00087383407,0.0003876715,0.9945686,0.0014115777,0.0016192964],"study_design_scores_gemma":[0.000080703176,0.000024220306,0.0003549103,0.000018429475,0.000017775672,0.00008179305,0.00013545497,0.008171326,0.00013759635,0.99022865,0.000732621,0.000016560343],"about_ca_topic_score_codex":0.0016729524,"about_ca_topic_score_gemma":0.0017486089,"teacher_disagreement_score":0.014647486,"about_ca_system_score_codex":0.004057732,"about_ca_system_score_gemma":0.0014480712,"threshold_uncertainty_score":0.04900074},"labels":[],"label_agreement":null},{"id":"W93756305","doi":"","title":"Extensions of Bondys Theorem on Cycles in 2-Connected Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.017264078822137433,"score_gpt":0.2915152480615969,"score_spread":0.27425116923945947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93756305","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21589428,0.005400375,0.36259463,0.00476628,0.0018141586,0.00026204291,0.0017349382,0.0009110652,0.40662214],"genre_scores_gemma":[0.8530004,0.0050195563,0.062028408,0.0021137795,0.0018050586,0.00042749132,0.0016977653,0.00054847484,0.07335916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994711,0.00011378081,0.000029302844,0.00013826769,0.0001756803,0.000071915216],"domain_scores_gemma":[0.998485,0.0006737591,0.00016840105,0.00019549718,0.0002530578,0.00022421754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068325264,0.00068815966,0.0007476464,0.0024296737,0.0014718889,0.0018940793,0.0012432531,0.0011067331,0.017169287],"category_scores_gemma":[0.0036694955,0.0004205704,0.0010553906,0.0017935443,0.0016338737,0.005760809,0.0028727655,0.0024712158,0.002133915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027933664,0.00002089718,0.0002559076,0.00007053787,0.000009875657,0.0000983855,0.0001631982,0.0006294245,0.0004900155,0.98648304,0.004348225,0.007402475],"study_design_scores_gemma":[0.000013040677,0.000015783102,0.0003248187,0.000022040684,0.000012050503,0.00015368992,0.00008009635,0.0034269695,0.00029704202,0.98634166,0.009302561,0.000010267175],"about_ca_topic_score_codex":0.0016469291,"about_ca_topic_score_gemma":0.0015761018,"teacher_disagreement_score":0.017169287,"about_ca_system_score_codex":0.0009843394,"about_ca_system_score_gemma":0.0005405521,"threshold_uncertainty_score":0.057437003},"labels":[],"label_agreement":null},{"id":"W942805742","doi":"10.1007/978-3-662-07003-1_8","title":"Logics with Counting","year":2004,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Locality; Expressive power; Computer science; Theoretical computer science; Order (exchange); Mathematics; Algorithm; Philosophy","score_opus":0.03145243424737198,"score_gpt":0.26695618135805055,"score_spread":0.23550374711067856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W942805742","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018453732,0.0062125213,0.051158953,0.0030911036,0.0007215105,0.000030827297,0.00023159158,0.0004631222,0.93624496],"genre_scores_gemma":[0.13863914,0.010813392,0.04511571,0.0023462155,0.0017040002,0.00019230663,0.0010030181,0.00077256537,0.79941356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961,0.00010430074,0.000016298087,0.00009106534,0.00014123469,0.000037083646],"domain_scores_gemma":[0.9997247,0.00011895868,0.000013101231,0.000060825976,0.000057879923,0.000024432757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003803083,0.0009855448,0.0006223382,0.0018479193,0.0020538373,0.0041150306,0.0009860195,0.0007923337,0.034459688],"category_scores_gemma":[0.0009815983,0.0005546279,0.00056561764,0.002429767,0.0033810474,0.0076773595,0.0013382394,0.00264389,0.008401168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042948186,0.000007758696,0.0000136640265,0.0000332577,0.00000169352,0.0000075451208,0.00011606062,0.00014259169,0.000093808136,0.9554093,0.023189912,0.02098026],"study_design_scores_gemma":[0.0000034068203,0.0000031847437,0.00003449075,0.00004206455,0.0000042232264,0.000036549936,0.000064981316,0.00054198195,0.00019078972,0.8015221,0.19755112,0.000005238651],"about_ca_topic_score_codex":0.0021640512,"about_ca_topic_score_gemma":0.0033594237,"teacher_disagreement_score":0.034459688,"about_ca_system_score_codex":0.0035572385,"about_ca_system_score_gemma":0.0011613944,"threshold_uncertainty_score":0.11527914},"labels":[],"label_agreement":null},{"id":"W943098930","doi":"10.1007/978-3-319-06686-8_25","title":"A Parameterized Algorithm for Packing Overlapping Subgraphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parameterized complexity; Algorithm; Parallel computing; Theoretical computer science","score_opus":0.026081472131606883,"score_gpt":0.2877207777364756,"score_spread":0.2616393056048687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W943098930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02496349,0.00041815627,0.94809854,0.00040674183,0.0001634138,0.0005007817,0.0011730167,0.005493147,0.018782623],"genre_scores_gemma":[0.04806192,0.0003526257,0.93627685,0.00013257419,0.00007377176,0.0005407515,0.0037065248,0.001169963,0.0096849855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983419,0.00022651306,0.00014010993,0.0004977163,0.000541648,0.00025218754],"domain_scores_gemma":[0.99700135,0.001080854,0.00017254322,0.0012246396,0.00033569525,0.00018494687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007489663,0.0026266787,0.0024828187,0.0017248293,0.001790536,0.0033707302,0.005351242,0.0021932966,0.029683966],"category_scores_gemma":[0.0051669683,0.001843891,0.0024007005,0.0073226397,0.0010910793,0.0075951223,0.004935563,0.0033280982,0.007599336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043252844,0.0005746962,0.0006856087,0.0006616224,0.00008957131,0.00017972228,0.00033821334,0.05874698,0.014255041,0.050808784,0.042260397,0.8309669],"study_design_scores_gemma":[0.00043170215,0.0003249033,0.0010658667,0.0001679205,0.00018432522,0.0009150355,0.0004960209,0.63924086,0.015157877,0.2922416,0.04967676,0.00009715443],"about_ca_topic_score_codex":0.0033948065,"about_ca_topic_score_gemma":0.004827822,"teacher_disagreement_score":0.029683966,"about_ca_system_score_codex":0.0022938226,"about_ca_system_score_gemma":0.0025042242,"threshold_uncertainty_score":0.09930277},"labels":[],"label_agreement":null},{"id":"W94648563","doi":"","title":"Lower bounds on dominating functions in graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; Graph","score_opus":0.012760276739990906,"score_gpt":0.2704202048579882,"score_spread":0.25765992811799726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94648563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097727574,0.040586017,0.4939985,0.028722256,0.0034413252,0.00030651476,0.006362264,0.0026219974,0.3262336],"genre_scores_gemma":[0.71010226,0.03375318,0.1465204,0.006836812,0.006536978,0.0011757133,0.008478959,0.0028332118,0.083762415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951497,0.0011778901,0.00019317195,0.0007149016,0.001523039,0.0012414427],"domain_scores_gemma":[0.94736946,0.042848688,0.0012245573,0.0034130479,0.002724136,0.002420114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061136503,0.0040794066,0.002741037,0.008532866,0.0030552,0.008775048,0.005684667,0.0037158874,0.023188606],"category_scores_gemma":[0.042744156,0.001416071,0.0022437251,0.007979961,0.004099676,0.018376054,0.006492694,0.011372115,0.0067792158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070013956,0.0003205217,0.0026340017,0.0012535997,0.00017074833,0.00021148121,0.00072817615,0.022160629,0.0035260636,0.80302,0.06185235,0.10342237],"study_design_scores_gemma":[0.000058767568,0.000090805974,0.0012972322,0.00033734346,0.00015623645,0.00036899507,0.00019386671,0.037032362,0.002245113,0.93268067,0.025488416,0.00005014199],"about_ca_topic_score_codex":0.0019806563,"about_ca_topic_score_gemma":0.003546244,"teacher_disagreement_score":0.023188606,"about_ca_system_score_codex":0.0066724033,"about_ca_system_score_gemma":0.0018257049,"threshold_uncertainty_score":0.07757366},"labels":[],"label_agreement":null},{"id":"W97074593","doi":"","title":"C-Perfect K-Uniform Hypergraphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Chromatic scale; Clique; Integer (computer science); Clique number; Discrete mathematics; Computer science","score_opus":0.009822721899947998,"score_gpt":0.2507579705319085,"score_spread":0.24093524863196053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97074593","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5754836,0.0013934508,0.36140925,0.00073092163,0.00011201871,0.00017303858,0.0015037461,0.0005723708,0.058621544],"genre_scores_gemma":[0.9420822,0.00035789504,0.051739316,0.00020064904,0.00004615531,0.000079894315,0.0006159185,0.00005762524,0.0048203696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932706,0.00016016906,0.00003586002,0.00025123768,0.00010320838,0.00012255387],"domain_scores_gemma":[0.9972065,0.0011713812,0.00048175963,0.0005311335,0.00032117846,0.0002879876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005473144,0.00031929003,0.00030604374,0.0008885818,0.0011871906,0.0010961661,0.0006898485,0.0005066881,0.0046424097],"category_scores_gemma":[0.0031794882,0.0002771745,0.00031214647,0.0013358479,0.0012862319,0.002802515,0.0009901886,0.0004948362,0.00039970948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002908476,0.00004551006,0.00551321,0.00033688705,0.000052084273,0.0003310324,0.00029588904,0.013995605,0.0135553125,0.9278902,0.0036898903,0.034003556],"study_design_scores_gemma":[0.00007229854,0.00020754525,0.010226087,0.00014231614,0.00011697724,0.002905738,0.00069418544,0.10903229,0.024058182,0.81052357,0.041921455,0.00009942737],"about_ca_topic_score_codex":0.0014933165,"about_ca_topic_score_gemma":0.0020305763,"teacher_disagreement_score":0.0046424097,"about_ca_system_score_codex":0.0010140834,"about_ca_system_score_gemma":0.0005214578,"threshold_uncertainty_score":0.015530348},"labels":[],"label_agreement":null},{"id":"W97347673","doi":"","title":"Covering the Powers of the Complete Graph with a Bounded Number of Snakes.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bounded function; Graph; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.012341338833975098,"score_gpt":0.2553891607128465,"score_spread":0.24304782187887142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97347673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34599203,0.0009455621,0.5287576,0.0007808789,0.0003119739,0.00014480572,0.0005429368,0.00071188377,0.12181231],"genre_scores_gemma":[0.8232043,0.0009994193,0.12664415,0.0002543904,0.00018177014,0.0001707543,0.00071522,0.00052775454,0.047302313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994628,0.00016138179,0.000023589464,0.00012921653,0.00013123812,0.00009184696],"domain_scores_gemma":[0.9972692,0.0010087085,0.0002655187,0.0008301058,0.00016396322,0.00046257084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045782494,0.00058031536,0.00072471076,0.0008034154,0.001206646,0.0014813598,0.001478682,0.0008367718,0.012606904],"category_scores_gemma":[0.0048825364,0.00058399356,0.000851777,0.0006718084,0.0016622832,0.0038420018,0.0024462114,0.0013461963,0.002164015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031634106,0.000090912064,0.0011127159,0.00021996956,0.00005516105,0.0006431948,0.00044853424,0.024981594,0.016739678,0.9044235,0.008699857,0.04226863],"study_design_scores_gemma":[0.000048185862,0.000107960914,0.00081802654,0.00007383565,0.000047852252,0.00077799236,0.00027836623,0.079586126,0.005743448,0.88645726,0.026038129,0.00002287699],"about_ca_topic_score_codex":0.0005974159,"about_ca_topic_score_gemma":0.0009776759,"teacher_disagreement_score":0.012606904,"about_ca_system_score_codex":0.00042884424,"about_ca_system_score_gemma":0.00027905765,"threshold_uncertainty_score":0.04217422},"labels":[],"label_agreement":null},{"id":"W97986267","doi":"","title":"Splitters and barriers in open graphs having a perfect internal matching","year":2008,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Strong perfect graph theorem; Matching (statistics); Combinatorics; Perfect graph; Mathematics; Context (archaeology); Chordal graph; Discrete mathematics; Computer science; Graph; Pathwidth; Line graph; 1-planar graph; Statistics","score_opus":0.019033051428707426,"score_gpt":0.2841289702447476,"score_spread":0.26509591881604017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97986267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83228695,0.0007642182,0.14616938,0.0003170635,0.00005536036,0.00004616039,0.00022457112,0.0002995941,0.019836701],"genre_scores_gemma":[0.9768529,0.00032040948,0.018464036,0.000053220483,0.000031313903,0.000044285316,0.00022643665,0.00005058593,0.003956803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996897,0.00004585829,0.000018550898,0.000080804595,0.00007099624,0.00009406828],"domain_scores_gemma":[0.9980348,0.0010428703,0.0003549703,0.00016409706,0.0001523392,0.00025095922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034335547,0.00029317572,0.00047869817,0.0013807939,0.00076954195,0.0018081194,0.00064122694,0.00061339414,0.004243017],"category_scores_gemma":[0.0031117096,0.00038285865,0.00042977527,0.0008490996,0.0015676909,0.0030435477,0.0016461735,0.00077069993,0.00040797543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026086386,0.000041444502,0.0021137006,0.00014601715,0.000025658757,0.00045128717,0.00069933763,0.0068550226,0.012444418,0.9581814,0.001240389,0.017540459],"study_design_scores_gemma":[0.000052971398,0.000090230016,0.0017005146,0.000048164544,0.000045437184,0.00076945114,0.00071849365,0.031075314,0.008218973,0.95189273,0.0053614653,0.000026310117],"about_ca_topic_score_codex":0.0005486983,"about_ca_topic_score_gemma":0.0005970428,"teacher_disagreement_score":0.004243017,"about_ca_system_score_codex":0.00040655312,"about_ca_system_score_gemma":0.00026974958,"threshold_uncertainty_score":0.01419431},"labels":[],"label_agreement":null},{"id":"W98170933","doi":"","title":"The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Claw; Vertex (graph theory); Combinatorics; Degree (music); Graph; Planar graph; Biology; Physics","score_opus":0.03536603412151292,"score_gpt":0.25515231468816724,"score_spread":0.2197862805666543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98170933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9099801,0.00059137226,0.031037528,0.00078521256,0.000057660756,0.000032982727,0.00048629416,0.00021847631,0.056810316],"genre_scores_gemma":[0.9909038,0.00026603063,0.0029223925,0.00007494327,0.000042815813,0.000019127097,0.00031774177,0.00003048525,0.0054226713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985254,0.000034984598,0.0000067258243,0.0000335349,0.00003520089,0.00003707397],"domain_scores_gemma":[0.9980952,0.0011078005,0.00029075917,0.00015129986,0.00013031474,0.00022464506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015165108,0.00019887021,0.00018675816,0.0008521013,0.0005152745,0.0011387874,0.00050929433,0.00046437615,0.004740572],"category_scores_gemma":[0.0024917522,0.0002417497,0.00019126527,0.00071566744,0.00081280374,0.001267184,0.0006886064,0.000718774,0.0005697618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004642363,0.00012080164,0.009097011,0.00035705528,0.000053657674,0.0013976672,0.0009958335,0.022004329,0.031070916,0.8659874,0.009752373,0.05869863],"study_design_scores_gemma":[0.00006474411,0.00010769841,0.005989631,0.000062571795,0.00004987464,0.0011508489,0.00048391384,0.058192722,0.008313448,0.91713846,0.00841833,0.000027787468],"about_ca_topic_score_codex":0.0011229556,"about_ca_topic_score_gemma":0.00197755,"teacher_disagreement_score":0.004740572,"about_ca_system_score_codex":0.00031997322,"about_ca_system_score_gemma":0.00023719478,"threshold_uncertainty_score":0.01585877},"labels":[],"label_agreement":null},{"id":"W98685556","doi":"","title":"Tree Domination in Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Forestry; Combinatorics; Geography","score_opus":0.013355501293034559,"score_gpt":0.2749717552010086,"score_spread":0.26161625390797405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98685556","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33439118,0.014535853,0.28129965,0.008092374,0.0007580717,0.0001453203,0.0013294034,0.0009476096,0.35850057],"genre_scores_gemma":[0.9314171,0.0044776667,0.020480985,0.0008386055,0.00054117566,0.00009274734,0.0006708882,0.00016539662,0.041315358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916506,0.00023747403,0.0000409757,0.00014578344,0.0002511651,0.00015949593],"domain_scores_gemma":[0.9960937,0.0025819754,0.00031048537,0.0003474742,0.00037913473,0.00028721066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007270943,0.0002611455,0.0005392981,0.0016090209,0.0012773606,0.0024011345,0.00072632276,0.0009093514,0.0073020207],"category_scores_gemma":[0.0046349135,0.00030913396,0.0005234887,0.0019822083,0.0018599135,0.004021372,0.0013709631,0.0015830254,0.0010803605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053412565,0.000028709905,0.0014789725,0.00018069375,0.00003121779,0.00023792734,0.00063841545,0.0023367314,0.0021462655,0.94541395,0.011048007,0.036405716],"study_design_scores_gemma":[0.000014930792,0.000013970299,0.0009664174,0.000047157813,0.000028704695,0.0005639612,0.0002156043,0.00851351,0.0011467019,0.9694316,0.019045187,0.000012164259],"about_ca_topic_score_codex":0.0017757405,"about_ca_topic_score_gemma":0.0025405793,"teacher_disagreement_score":0.0073020207,"about_ca_system_score_codex":0.0013815548,"about_ca_system_score_gemma":0.00058744976,"threshold_uncertainty_score":0.024427652},"labels":[],"label_agreement":null},{"id":"W98850468","doi":"","title":"On normal quotients of transitive graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Quotient; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.013214129911310128,"score_gpt":0.2670815271796967,"score_spread":0.2538673972683866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98850468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47096017,0.00374461,0.2006317,0.0031623922,0.0013645415,0.00020702135,0.0011127804,0.0011667745,0.3176499],"genre_scores_gemma":[0.9319981,0.0014776735,0.022047276,0.00046115008,0.00067191635,0.00010081741,0.0010893006,0.0005201044,0.041633707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981615,0.0005490374,0.00014212732,0.00033854035,0.0005024875,0.00030632733],"domain_scores_gemma":[0.9967168,0.0013424855,0.00042047782,0.00048169095,0.00043469635,0.0006036897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293989,0.0009919051,0.0010693235,0.0034978532,0.0021551638,0.0042239535,0.001093782,0.0011050317,0.012303203],"category_scores_gemma":[0.0060651605,0.00062735606,0.0012278295,0.0017473042,0.004239024,0.008913212,0.0035575868,0.0024547868,0.002225366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044257908,0.000028335407,0.00040709763,0.00003609966,0.000008334957,0.00014978771,0.0004036473,0.0003933481,0.00068451965,0.9905974,0.0020499788,0.0051971865],"study_design_scores_gemma":[0.000012918004,0.000012805208,0.00016112026,0.000015022206,0.000006679249,0.00017383946,0.0001455374,0.0019483166,0.00037038792,0.99328107,0.00386543,0.0000070138385],"about_ca_topic_score_codex":0.0020756994,"about_ca_topic_score_gemma":0.0023154754,"teacher_disagreement_score":0.012303203,"about_ca_system_score_codex":0.0019080389,"about_ca_system_score_gemma":0.0004729822,"threshold_uncertainty_score":0.04115832},"labels":[],"label_agreement":null},{"id":"W99291367","doi":"","title":"The Fractional Vertex Linear Arboricity of Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Graph; Planar graph","score_opus":0.010957304689175594,"score_gpt":0.2678376617227024,"score_spread":0.2568803570335268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99291367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58875483,0.00276878,0.093991704,0.0036270968,0.00041152202,0.000042910662,0.00084914797,0.00035402464,0.30920005],"genre_scores_gemma":[0.9798411,0.00084632507,0.0065667517,0.0002488172,0.00022513517,0.000022017624,0.00030458288,0.000042049614,0.011903286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997664,0.00006764085,0.000010612572,0.00005013619,0.000050427792,0.000054755037],"domain_scores_gemma":[0.9987325,0.0007389263,0.00017213401,0.00015267852,0.00009658358,0.00010720823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022210697,0.00020656287,0.00022645704,0.0010652407,0.0009106007,0.001556459,0.00040944605,0.00066433015,0.007264387],"category_scores_gemma":[0.0028086596,0.00018838873,0.00026824055,0.0010328926,0.0014154009,0.0021143176,0.0007502199,0.0010448378,0.00075549097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008656704,0.000020933647,0.0010954611,0.00007664238,0.000010039132,0.00022729837,0.0002202835,0.0037987526,0.0024802724,0.9645913,0.004424694,0.022967698],"study_design_scores_gemma":[0.00001027764,0.000018727089,0.00066637393,0.000021369107,0.000009786354,0.00026770076,0.000114222035,0.009523866,0.0009794333,0.9816844,0.00669757,0.0000062020035],"about_ca_topic_score_codex":0.0011170673,"about_ca_topic_score_gemma":0.0014903026,"teacher_disagreement_score":0.007264387,"about_ca_system_score_codex":0.0006697576,"about_ca_system_score_gemma":0.00024886092,"threshold_uncertainty_score":0.024301767},"labels":[],"label_agreement":null},{"id":"W9954860","doi":"10.1103/physrevc.38.712","title":"Competition Graphs of Semiorders and the Conditions C(p) and C ∗ (p)","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Competition (biology); Combinatorics; Biology","score_opus":0.013193792900904899,"score_gpt":0.25350586300433825,"score_spread":0.24031207010343336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9954860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68422455,0.0005880907,0.22128594,0.0015133963,0.00017463753,0.0003966615,0.0022667586,0.0005106714,0.089039296],"genre_scores_gemma":[0.943983,0.00042895463,0.04595238,0.0003059578,0.00010244736,0.00036595418,0.0013918424,0.000069465736,0.007400017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979482,0.0004627046,0.0001807409,0.0004727993,0.00044591664,0.0004897184],"domain_scores_gemma":[0.987531,0.0062775826,0.001641566,0.0008748692,0.0014194557,0.0022555257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016378602,0.0005936567,0.0006834226,0.0016239817,0.0025293014,0.0025030144,0.0008513064,0.0012790522,0.006517869],"category_scores_gemma":[0.006503998,0.00060500455,0.0007994244,0.0016837023,0.00330082,0.0048021697,0.0014436219,0.0016077037,0.00043986953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018808024,0.000093037685,0.001833357,0.00013590093,0.000025581,0.00035843867,0.00032648668,0.0073779165,0.003661111,0.9750993,0.0024105138,0.00849023],"study_design_scores_gemma":[0.00010958089,0.00015369461,0.0032357858,0.0000616312,0.000050535316,0.00080512476,0.0007040948,0.04748963,0.0038766398,0.92639136,0.017041342,0.00008056597],"about_ca_topic_score_codex":0.0071806675,"about_ca_topic_score_gemma":0.010750847,"teacher_disagreement_score":0.0071806675,"about_ca_system_score_codex":0.002749342,"about_ca_system_score_gemma":0.002639148,"threshold_uncertainty_score":0.021804392},"labels":[],"label_agreement":null}]}